From 72a243e3bdcd73cb2b646fa91c969820c98662c5 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 16 Mar 2017 15:33:21 -0700
Subject: [PATCH 001/255] Convert manpage to Markdown, converted with ronn

---
 programs/Makefile  |  25 ++
 programs/zstd.1    | 629 +++++++++++++++++++--------------------------
 programs/zstd.1.md | 299 +++++++++++++++++++++
 3 files changed, 583 insertions(+), 370 deletions(-)
 create mode 100644 programs/zstd.1.md

diff --git a/programs/Makefile b/programs/Makefile
index 1475cb610..bb91e069a 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -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
diff --git a/programs/zstd.1 b/programs/zstd.1
index 684fb868a..9ac4ca0a8 100644
--- a/programs/zstd.1
+++ b/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
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
new file mode 100644
index 000000000..d170dcc8c
--- /dev/null
+++ b/programs/zstd.1.md
@@ -0,0 +1,299 @@
+zstd(1) -- zstd, unzstd, zstdcat - Compress or decompress .zst files
+====================================================================
+
+SYNOPSIS
+--------
+
+`zstd` [*OPTIONS*] [-|&lt;INPUT-FILE&gt;] [-o &lt;OUTPUT-FILE&gt;]
+
+`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

From b8e52d3c83eeeeec088836b5840ee1ca307a612d Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 16 Mar 2017 16:06:03 -0700
Subject: [PATCH 002/255] Fix zstd not erroring on compressing to terminal
 without forceStdout

---
 programs/zstdcli.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index ae49da7b1..fc7ca9e36 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -635,7 +635,7 @@ int main(int argCount, const char* argv[])
 
     /* Check if input/output defined as console; trigger an error in this case */
     if (!strcmp(filenameTable[0], stdinmark) && IS_CONSOLE(stdin) ) CLEAN_RETURN(badusage(programName));
-    if (outFileName && !strcmp(outFileName, stdoutmark) && IS_CONSOLE(stdout) && strcmp(filenameTable[0], stdinmark) && !(forceStdout && (operation==zom_decompress)))
+    if (outFileName && !strcmp(outFileName, stdoutmark) && IS_CONSOLE(stdout) && !strcmp(filenameTable[0], stdinmark) && !forceStdout && operation!=zom_decompress)
         CLEAN_RETURN(badusage(programName));
 
     /* user-selected output filename, only possible with a single file */

From d973071e907ba2b9f99db6ea14c625a1307c1ac9 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 16 Mar 2017 16:25:19 -0700
Subject: [PATCH 003/255] Add tests for compressed data on console

---
 tests/playTests.sh | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index c493fed55..c584fe560 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -72,6 +72,10 @@ cp tmp tmp2
 $ZSTD tmp2 -fo && die "-o must be followed by filename "
 $ECHO "test : implied stdout when input is stdin"
 $ECHO bob | $ZSTD | $ZSTD -d
+$ECHO "test : compressed data to terminal"
+$ECHO bob | $ZSTD && die "should have refused : compressed data to terminal"
+$ECHO "test : compressed data from terminal (a hang here is a test fail, zstd is wrongly waiting on data from terminal)"
+$ZSTD -d > $INTOVOID && die "should have refused : compressed data from terminal"
 $ECHO "test : null-length file roundtrip"
 $ECHO -n '' | $ZSTD - --stdout | $ZSTD -d --stdout
 $ECHO "test : decompress file with wrong suffix (must fail)"

From 0a189b63fee91518796bc225eb249dd4e927fcf1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 16 Mar 2017 16:33:53 -0700
Subject: [PATCH 004/255] fix minor details in man page

---
 programs/zstd.1    | 13 +++++++++++--
 programs/zstd.1.md | 22 ++++++++++++++--------
 programs/zstdcli.c |  2 +-
 3 files changed, 26 insertions(+), 11 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index 9ac4ca0a8..f79b3ce16 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -8,7 +8,10 @@
 \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
+\fBunzstd\fR is equivalent to \fBzstd \-d\fR
+.
+.P
+\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\.
@@ -22,10 +25,16 @@ Source files are preserved by default\. It\'s possible to remove them automatica
 .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 "\(bu" 4
+\fBzstd\fR does not accept input from console, but it properly accepts \fBstdin\fR when it\'s not the console\.
+.
+.IP "\(bu" 4
+\fBzstd\fR displays a short help page when command line is an error\. Use \fB\-q\fR to turn it 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\.
+\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 write compressed data to standard output if it is a terminal : it will display an error message and skip the \fIfile\fR\. 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:
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index d170dcc8c..bb5b22664 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -7,8 +7,10 @@ SYNOPSIS
 `zstd` [*OPTIONS*] [-|&lt;INPUT-FILE&gt;] [-o &lt;OUTPUT-FILE&gt;]
 
 `unzstd` is equivalent to `zstd -d`
+
 `zstdcat` is equivalent to `zstd -dcf`
 
+
 DESCRIPTION
 -----------
 `zstd` is a fast lossless compression algorithm and data compression tool,
@@ -27,15 +29,19 @@ but features the following differences :
   - When compressing a single file, `zstd` displays progress notifications
     and result summary by default.
     Use `-q` to turn them off.
+  - `zstd` does not accept input from console,
+    but it properly accepts `stdin` when it's not the console.
+  - `zstd` displays a short help page when command line is an error.
+    Use `-q` to turn it 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.
+`zstd` will refuse to write compressed data to standard output
+if it is a terminal : it will display an error message and skip the _file_.
+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:
@@ -162,8 +168,8 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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#`: 
+    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.
@@ -194,7 +200,7 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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 FILEs` <br />
     `zstd --train --optimize-cover=d=d,steps=512 FILEs`
 
 
@@ -226,7 +232,7 @@ 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: 
+    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.
 
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index ae49da7b1..50ff21d53 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -167,7 +167,7 @@ static int usage_advanced(const char* programName)
 static int badusage(const char* programName)
 {
     DISPLAYLEVEL(1, "Incorrect parameters\n");
-    if (displayLevel >= 1) usage(programName);
+    if (displayLevel >= 2) usage(programName);
     return 1;
 }
 

From 9a38dfa7948c8ea80b07a2f3af152d02b481c4b9 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Fri, 17 Mar 2017 12:32:18 -0700
Subject: [PATCH 005/255] Only run IS_CONSOLE tests with a TTY

---
 tests/playTests.sh | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index c584fe560..38a66d327 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -20,6 +20,12 @@ roundTripTest() {
     $DIFF -q tmp1 tmp2
 }
 
+isTerminal=false
+if [ -t 0 ] && [ -t 1 ]
+then
+    isTerminal=true
+fi
+
 isWindows=false
 ECHO="echo"
 INTOVOID="/dev/null"
@@ -27,6 +33,7 @@ case "$OS" in
   Windows*)
     isWindows=true
     ECHO="echo -e"
+    INTOVOID="NUL"
     ;;
 esac
 
@@ -72,10 +79,12 @@ cp tmp tmp2
 $ZSTD tmp2 -fo && die "-o must be followed by filename "
 $ECHO "test : implied stdout when input is stdin"
 $ECHO bob | $ZSTD | $ZSTD -d
+if [ "$isTerminal" = true ]; then
 $ECHO "test : compressed data to terminal"
 $ECHO bob | $ZSTD && die "should have refused : compressed data to terminal"
 $ECHO "test : compressed data from terminal (a hang here is a test fail, zstd is wrongly waiting on data from terminal)"
 $ZSTD -d > $INTOVOID && die "should have refused : compressed data from terminal"
+fi
 $ECHO "test : null-length file roundtrip"
 $ECHO -n '' | $ZSTD - --stdout | $ZSTD -d --stdout
 $ECHO "test : decompress file with wrong suffix (must fail)"
@@ -244,7 +253,7 @@ $ZSTD -f tmp -D tmpDict1 --no-dictID
 $ZSTD -d tmp.zst -D tmpDict -fo result
 $DIFF $TESTFILE result
 $ECHO "- Compress with wrong argument order (must fail)"
-$ZSTD tmp -Df tmpDict1 -c > /dev/null && die "-D must be followed by dictionary name "
+$ZSTD tmp -Df tmpDict1 -c > $INTOVOID && die "-D must be followed by dictionary name "
 $ECHO "- Compress multiple files with dictionary"
 rm -rf dirTestDict
 mkdir dirTestDict

From e5c4f0403397e32a63baadd701816d5720c0d2a1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 17 Mar 2017 14:25:57 -0700
Subject: [PATCH 006/255] updated compression graph

---
 README.md              |  11 ++++++++---
 doc/images/Cspeed4.png | Bin 35361 -> 71276 bytes
 doc/images/Dspeed4.png | Bin 8984 -> 29425 bytes
 3 files changed, 8 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 6de5a1079..f1d8eda1b 100644
--- a/README.md
+++ b/README.md
@@ -14,11 +14,11 @@ you can consult a list of known ports on [Zstandard homepage](http://www.zstd.ne
 As a reference, several fast compression algorithms were tested and compared
 on a server running Linux Mint Debian Edition (`Linux version 4.8.0-1-amd64`),
 with a Core i7-6700K CPU @ 4.0GHz,
-using [lzbench v1.6], an open-source in-memory benchmark by @inikep
+using [lzbench], an open-source in-memory benchmark by @inikep
 compiled with GCC 6.3.0,
 on the [Silesia compression corpus].
 
-[lzbench v1.6]: https://github.com/inikep/lzbench
+[lzbench]: https://github.com/inikep/lzbench
 [Silesia compression corpus]: http://sun.aei.polsl.pl/~sdeor/index.php?page=silesia
 
 | Compressor name         | Ratio | Compression| Decompress.|
@@ -38,7 +38,12 @@ on the [Silesia compression corpus].
 Zstd can also offer stronger compression ratios at the cost of compression speed.
 Speed vs Compression trade-off is configurable by small increments. Decompression speed is preserved and remains roughly the same at all settings, a property shared by most LZ compression algorithms, such as [zlib] or lzma.
 
-The following tests were run on a Core i7-3930K CPU @ 4.5GHz, using [lzbench], an open-source in-memory benchmark by @inikep compiled with GCC 5.2.1, on the [Silesia compression corpus].
+The following tests were run
+on a server running Linux Mint Debian Edition (`Linux version 4.8.0-1-amd64`)
+with a Core i7-6700K CPU @ 4.0GHz,
+using [lzbench], an open-source in-memory benchmark by @inikep
+compiled with GCC 6.3.0,
+on the [Silesia compression corpus].
 
 Compression Speed vs Ratio | Decompression Speed
 ---------------------------|--------------------
diff --git a/doc/images/Cspeed4.png b/doc/images/Cspeed4.png
index f0ca0ffba9c4413cc2a8a19dd5768e03e236c095..318204c00e96311529ed76351481db81d8212770 100644
GIT binary patch
literal 71276
zcmeAS@N?(olHy`uVBq!ia0y~yU{zvZV0y~I#=yXEA!)`^1_lPk;vjb?hIQv;UNSH+
za29w(7Beu23xP0W`us~l3=9qoo-U3d6^w80a@K@?o%{d4|F_nb39?QN8@d*(dDnDx
z+lrEnD;CSXz4Gdcm2CFynHwJ)>_1l@mA(AJ#<Hlbvd7O&xfQxP?C7e{EfE{K!W;ur
zx*ePvT5?oU;{V@2Z$9Vr-jjRHzqif4^Y&}4jo$Y=#rx8$=T*nvtC`*sySr@fqzMxW
z76u47Ffg)U5{-cZFW$eeS55r>?(W~k1vz}33``sf4Vc6ZmPvD$S{6UE=-#7@MH-|<
zQSip*^nP2vB#*vhj+j<KthZ-knOIkFqXp9jkP!<76*_o&mE9e&I+k%%GkWBV1{g+4
z8N7+agYRsj1s75jZq)wp=kxi~^K7f1G;!-qSn56f*t_1MbXW#Fpur{J(x;@??gsW`
z!WNdOsHi6g8kslM|F3)b>eZw}hny_`e!2YicgEbwkLS&5uv>jxzCLEt=FLw(&;P$i
zMcw^=ecRWsUr+9SzfZfJPj=F-T~;U0oSE|S^77L&)8}cfT)A>No5;iJ{oih7n{}Ky
zb*gKX!lp%woU*dAY)ZcFUVh)Xw(Q{_xnqa&4>3>Uhq}sOjl-9};vY6_cVUH;CrRN8
z_U((S`}0`-^trj#d+$AwOrN7T|L>dh)KgP5<F;=$s$r5!$-TSlYTSV?QSFptJ(3T1
z&k&sRbMN<ilR?UgetdYSSluse?w7akXPV{rJH_oe$*w<Gs;a7<%)b9;SxH%0)!vSt
z9v;izZ#F+Qp8vClS8Z>Y)X}LI|IL<gmE!9K7bOm7xCC5|y;=P97`Ws~@_n#&`@Ko*
zaup6y(a~?$K7IQ1<eQtDRTUK-`(!MYZhi7Rti&s~CC<ysYmK1G*S}|G8oO^XjrH^E
zn=)mJ%hkOZ+$XBv?L5vFRmJ~&e*L}|-`6i(=y<R4xvXW?mlb=yT=Hg_DEKYJw4uc5
z#HLL~ni?7cxmQ=c{xV<u)~2e<%Y47hm;V1z{(s{B*$a2IR=?jHzAgX0UU*#P(waYy
z<-b?m$oS`5u~#unsR8Wv0~?rFCLR_FWCRzHjUTu}!op5{-~Ye%<@@*IxwYT;|9{{&
zs{dEh&wY7XR=?e^6?^{udVT5QMMr^`3x)sjr_U{&_Cj0gv~s^q(&5#2?!-iHPV4QF
zx4%~^{cG-(_j9&gTk5jzz|-mRdg8Gq6JImkzIE$K`2Js0bMEZ8$aad~{?CR#ckln5
zoBeyGUdHuW+xE7r`@Bs4tJT~Uek};8H4f}&a9mO^zYXGE0YRqyKhNgpaIB2g-2ZiL
z{>detliOmZZ`<_yRrr3b-{0PHdz+tD6hG26Lr_CsfBW}MH9w2`1%kq}y6=2GXRV+1
z&NMF1<@onMhs5_O>@It|Nq5!#y5Darc9y;q1_uBm%OMR10ZF$SKWNk{Fj<$q*>E?0
z>$|1X<6fDzl-T#J-^ji-bm_TYt7DC3&zhC<{lTS6L6MtMI_H)g`75z2COTTX{?B9i
zw-uAEf;Vj2bj6Ubbd%8ATPvUc{LpUyX5;(#f1kuFANQKO9A9?%t<}FfM>>Vs<!_bd
zEcYuf-~OVauqx+n`L#8Xiyp`N%{Dvxe4iEHvbgDG(skc%rstm4UR(cm>vgZBq(#T;
zs_ySDf4@!m&x<EAw|qm@zh5lRcip`{@8%{~lZMNkc9$++&Ncs$dV1Q;cURy2W{C=q
z?pV2eTgKO`p`rcNtIm6>>)+azJA2Rnf4{fAUYi^f67r<(CZqoAznS83y1!&OwpiSk
zfBxs7P4f3*mfvsY)Vgn)f9s_HhkVV4#<@M|&(6&J_T8}ZQ_AxVj(hEYKAHS&`=a~7
z@sGF3+1JICxaH}F#}u|^Uz+c*Kin~P!t_(0pPk+8xa6O)<NS*c6lJ#@U0pZ*%l4J~
zS=TO}oc!`{2KVWMlke{N@u*u)SMjU9+qL!a`RCUx{Hi)V=Fu<S-fQ`XPUmjof<};%
zOM`-ulN`(RMsNad&~FTnuf3XgsUhL%sj2%`{ft?E@LqoX@93X@-`Bt2+Seyt{(9~9
zQ+IY2+iuI2_<SYU|0aXq@uJ<o-|c?-;9&DQE2%5FH#Ru_`+NU??3Sg^{(ir&|8DK7
zExXsT8UFv`|KDVZ^v>cptlVNZ627+E|5?Z@GPn8lKB=gT?zP?e`))+$-k)1rTH_<T
z{Db}f&-Ss5GyB3<B(7a|ebK>7`gI?<t?L%X7C!1fJKOyB<M`66p=CVQ-yZ}yo4>7F
zWBhBEIIq|Ix?h<;FZS0xiIVk+<u$$P+`V1FNaVcd{Dpl_U(~&=x?2^OtGoJP-UioP
zlafoxuZn*@QMcFp`Sa&txnq@n%9Y2eK1{UP9ei{B#*KmdzVCfsc_VYhzZ=Q@Cw<ND
zn!Nd2wfe(y`@bjK%0oj#i+;b|UcFjLfB&CNf8LevpS)#@$<Hgx?NVQ}eBS%1>ViU;
z)x%Ba7TH>~TnUIdUiHPyapF9udj9e|h3&8P-A!y_x982x-TOAC=^tyuzB!AGOReu8
zzWB@6;`t+4Sj_l0C>VX3#~BW3VKuZnl$LJ&yC!!1-Q&+buXysjxli{cON;!k3+*`?
zE7pE8(YVCvwk7mZZ24VPtH{>vVog@x?(hG5d;iTaKk>MVg*q`iE^M1{iNQ5`@89?T
z|E)JMH^0r`9xa(A`*)3ET6OjAxfbrtZr?YY-x;%ayY>4$m#<yEHZ^@-<+2x6vfKUC
z9V$N@WOqHTdZn08?^e@mcKaWVxrNJgMNMn&>@Hu=>pFMW|F7}?Q==!p`djzw^89Uy
ztG7M75|&?8+i(AGM{eV?hqHp~{(YW*yE^dw`Pz5I+n%nN_xh~){Vms*>K-vsxhmun
z`~1hgd(L0yY-ydl%_VkM$;w(gDTmiA?otb~R+w1id@8kl_j>Eo*=!SEEpTT3^Y;F~
zwb#=h?d#ucb1B_sQu^}eGAHY#7QD=NSRWew<7Ii^;qtk2;|_=al~YqywcIZ9VfQ~V
zlawnBF~_~Hyt~lc&GswmoaJ+w>zg^Be$V>w^NxKsxBK6??8rS88-J_qUL$-ngJb1d
zwXLDcxA9zkzmKiEDt_00XMS6i)#2;6ef?_w@8|jYxG&Z#>OB`ec3!o(IOpy<-4tfs
z<-cZge6hLW46fuE8aE0nbjVm|pMyl;few}uw;bJDvPL%+-PN2c@Toig&!XcgqEdV>
zX4FgRWM&)8U2}+2<j(oUiA`<cyL_2Bb*27fDlBYV*rpS;rSxI^->dOAQ~x?UbMv;E
zoVb#GLGM9xcU$kRw?E_me~q_|@_qGj|G%&6Z##V6`F!4Isj8Rzs(9mno(kV{?%EpT
zZ?CpyHY_pj++Du@s@`@fzgH=;w{pKI%m3`qR=JdSHp=ev%=0%ALZ)wJUBISMRqw~K
z@^$md)n99;2G}iMU;8#&F0ShCty!VYE^n>YHwJBRjh>nHJ?3uw;pgw`zVH6Fdx7o`
z6Ps`0Zl8MGf4y<rHNUM_$|-B-+ikaVG*+C>+M0D$OFHOPElczqg`nu&Sr4AuMfS*f
zH`^@#x~lH^T%lF(rxx4PUVpy+`DKOJ`uD%Y1#c}1Y_7}|UF-Pw!J_NyAJ@MM;C$zL
z*fp2+@8$XbuAJ*x>$v^jye%0Wt6dM*{Y`KGcWutJd1cNG^(~Lg1s|+j(FQKd7?_eZ
z9#}S9l9)FmSP@!3e_*<m`{~BU<ZX-ESPzQjZe8Nq+;UK{W1YU9p4eR9@a{GXzZaR|
zJN_<wI8E5eYW3FArNMUJHuhJxOxP6{{lxNN%ldV5qu$H^|0r+k<Pp34;QT(-<*w_!
zokj9pqmAZOzuS4w?50@%F30z`ZCgsT)<<kS)HX$G(Tf(@D3c{G-@e^?`rf&h_f{Ft
z*!8WU?jOh1;!AlSnxp%(9=s_D{r+9%Ps}{t_|j!%ysNixZxrKI+seIrTgKHw_rFsU
z=5O2<c2(%i=F7j7@A^l-&%AiQbDK|z{;$|8582gxW<1zuwIFqF$f-=m6|qm)#h05d
zk*ogq=Vw{5#{Tek&o6VX|6=)~+$FmH->>WYw<XtS-B>Yy>(h@97TsOJ-af%k_B%t=
z;g<o^1OBQx)yB&3LrWk(-v)(GSN`0P2J;&OMK4SX@w@nL@xf`#?0h$3|7>k4=8vmk
zo%n8Hb1|<}lGRbk&u4$Gc`tR#l5vLcvR(P*)Aq_nZ-05C$?xM;sk3`omjz$1yk7Wo
zOU7&6d{tA^tEIK)K5pH**f?xiS^w3IDz!V=gRkHIdG~tjD@$HJ#ks{6Ycsd1-tp+Z
zw|-mB<#!*fjxF7ma&^(&64MpMPNw<C`M*i_Ke_p`(tX!_;S2LhuSMR|yI<$;W_7cl
ztu|^)>-@6FGJQXb%6~tf?{3rMc>4X+-xw*AEQR&Sj#jSB0l5cfOrHFB4cCvme=VBd
zYd>iIu~K5y{g(N`8#uw<Wn?*|;Bfto!GdBhNb8tM^u(!Co7Qq|y*jV&sf5qP3!b}U
zvp!y*b*c7|p!x*vCpLbkE$U0>TKQ=^*O#*A7d!dHu8+0ZJN2OPH>=Vsr#anAcuxQS
zz5jo)S>+yU$Mw~(-RI75iSAhWz5f6A`qPX1?XsfN>%J_O|H@JL#o^$UuNE6`w_mLD
ztI}GYy2_8Cc$KTO_S<di7B2C7^63z_{*9Sa{y(q(=e~t?ZncB$ot=AZA5XN~J@MUg
zHLGPS#p?G@e)#U_^|HU-4e|dzO*gx6?PPw51cR>Buh%ICQFnHyzJ4B1v;K?4JJ;yV
zR%;iTZutALzg|b`+shRH`~SXe-@8q!?Avv*_3QV1>XO|a`aj5VZ7u7Ub9T!=*@^A%
z4Blz?%@tb2P2?7E>ATZs3u#_T2s84QeS3R5{rEHPXD#m@&gy&qY<0$r<&QP8B5vHh
z`*!uM8SAf$b^Bd>x9XsXdc>vLl1q}`uSGZaFaG}i-rneF{;cWAveuVoo^e0yG53qB
z`lEvUSSg>o2cMVPxxX&HG~v%N>HICmYOh;VrK(=*T)ZAvy|y^}@V@HmW6HH<%6HFm
zuKAjDcYXSeZvG8TY};=sg|tgt5S!p9@N!GrmG{fpcDz#+xv%~GF>jonuI|+Of6wcu
z)&HDczwz$o(lsG-|5g=ToN#UCANTDq?bW~3&AGOr`E~oN;w}HwoJ#-8u!9ptV}zJO
zN6*vcr}u&jlp`$-!Y*=FB`3CdaBb;cQJro4{r^V!o<)p(my--<T+3<h7k+jA-Ss#3
zvWzEu-f{i^5p}yn^{1RE_RIUWDeQT->-CdYtJhDn|Nry+rz67tH^e60>dJX^q;p;2
z|1EU}rE?$e-tYdq_|itRt*J}4O)B1XdDs2<`&0AJS1dW7x8(QE^Dg%<U3&Ds$bFA*
zv`v=4%FPAY-A-?X-j<}w-;ugxd2(gl`Z<q(R9#<p>(<eK6W!%DPWF_wsR&r+GxJek
zZ1m1oE&f%y=J#thXIw8$|5h-UHRgJ+Tj#g?M>1v<_&}0;l52yZQu0&JB6)C^(NKHA
z=4)9O*G;fGox8x5S#0^!N&6d4)GiX_y?Jbxh2o0`pR=?Bmb2VWy>|OY|GAA#mDeA?
zSYmmrG}QL1<O`nD_q+^B?|$!}_WViR*>|U{#8zB>6vC{XuR0^$=2E)(rN1R^70-X&
zt><ojfB3pB&${PtH?vh(`7~~ObM<|HS#Q~~%_YYseAzaCo%GA^r>=jzb3OaDPkKeO
zczn&p+Q}BiwXeP2cCBCAHdo-%;ztJZZjZ#??(a<WxX}Zy3mjs&1ze7Oef<0xIHfLf
zeDG%T`Dr&dr{DIj{rPmd>+zYNLvP)_{dPv%Ei2z{<BzA7`OZFa{YS%j+wXJMuD)yf
z)%4m^cl%!xSGz7N&g0G5GJCz)UbTGVUsk2Hdw0*aOm_UW%KA<fuiKoP{aaOM><2Yx
zEGGV$^Xm2MT<@6YQSAF)N3>tPdbMn8vdIp=4bT|0{8#_;bbJnj`Hx?vVQ=~Eek6Q&
z)nNZRp5ukir>HI7+b&Ce+H%=XI9+MsLq4-f@2?gdzw++uuk+%%R%|Km?(Ny)vdUK_
zR~_Wcij_XwRHy%E>X|b>yCb8E`j=RoSDEzxrs<^LN%D}Gd=%TDV03Rk;~jg@poK#S
zM@F}b?yX%O>AL@p>ene&e}A|2;i7ey6+EK7>)vL^Z@$|xH*(e7kH5D3{#w5OckJ~g
zGF3Xf&#$eGPT!sSD*bKOnzgr&?aI*jd|3WpKvq`Po0VU8&G~&<G(4v8XosHX``GvH
z%#(k=+kL)FR<1@Nw{+#*b#phRpO*tQBHMe8ue`qOUeuhAf0|almbrhuTE$+ScSYX*
zzhysP`qyjSO1e<H$8WCT?|IelHf~><IQ4hL?04U#-WbcB+<f_SZ;Acf4v%iXt|jO1
zbG|k0xSaR=m$l{9M<oZZy+3=bSNiS4Ii>H8^MOkH9s8!0Udz$_HC<x;zF(_W&thA0
zD=Or){Qn>B{U<ZO?0ntg_pj@6Xx;yRf7e}`FIB>J%gJa`z3{(xvva|zokQV4e1oCV
z-`^WVA$h+;V1{veU(Mgw@!O5>zUtX@t1B>`lauq?Q@iH1+qjC4Rq1GJPYzujc5<@6
zUFPxSzkl!lUu|94z3sv!$?Cac{!-s`<MvqSe6RZTa{1}m`TH{CC#(B!OE$FHT&o|o
z#p9g)|38AU*Oz!seljb2-9%6^yh!(MNsnD_>`KP&KGqen$)+2wZuoRcd;ON@7Y>9)
z&&|p{Gt)Rd$~~9y=e_Fpk*hN=FWZ@B!ME&Pfw{oR^PaM%Hka1z{&lIq%UNx2{qoWk
zWjFV}-FEv(ZI1o-YCcHa`O|IJeaZAWiOwN!&DI`Vz3=trYYb89n=f9gw5nUQtw$#F
zB4_rN(8ar6=0}{}!@7OppE%Z{wV$7z6_zdk_Tu8=vLZG08CPEKezWQH8x`N%+j1vI
z=kLAhw`=i!Y2GDYtrtvAxO(kcm2GdC<@E!h`<1N(`>L{DNAhmHnzTdc<o?cw>*l_N
z1$A_T!lmuJ(cmE;fewwvpP!$fzO^+wcf+>q>w3TKze+h|ahvj9-ZK07QSo>kDTW=}
zbFNHtm16n(Y5M*x4`*Kv4LaU-`C4uL-|O{nO(hDVoGsrs8-9`bbt(Ho;hR08>3i2F
zzpw+f-i6cld^p7YC}#Gyb(c3v&K1jhcf73c>7L#B(tG}_^sha2Z}+)ZYYwh1TVJ~C
zM%INzjFbJgJ(|+WEq?0MRP9`W$hbJYUzZk@mfG0P-E(Z`@`P8f4ClNqy;nN7T5|34
zCC>}ay^PuYyRtpn?)jYJoC#mvY(9U>Ao_6ja_w!qUX<-EQ~&d=Y)``cjdIF2(x1;M
zSNWZ};Qv$o`p6QUptoFW9xk@4mKAbPx4!iI^6%@9dRD%eqko}%>!th4&mCLm>g@4W
z%613K@4Zrc_Ww?|UB1u6<C>w?UeUefe|cY=xp}K9P+j2C%#B-L)V}`vYHzl~Dq-`N
z<sScw9xR)kC-k;xz2lP4e~aw*vCa8)UTkh*-1+qnm&P^!u2_Gr?%eL*|IYn%|8#!c
z!Q&5&K_vtO6NgKmL(|Ksi|eN^*45R3Mw5UolN3iLw=yr=7S$*P#mSrd?=9VCcV)t%
z_>0$kq+EVjZ7WN>y6(!kih}0;rHn0QKd*TDn0zScD!aP(`@QP7$K(J1y8bQp{L-~+
zO;|pPXJtNpxbC!E!3FuMxqjT{ybWJu_Av?YhF=XkES`IG*;<WSNtR&q3$OXU7GKJ~
zQvABOh<_!!An)(M=v7&#EoGZS_7_WO{j|Eb(k}UXH|MjPtx5K^-=em(F0H;eZOihk
z75mx$##V4E-aRjR=KHDI{RdAU{_8gP*RQ`9(qH-%JY93W{IA`seE0jy{pP;<^}Nka
z+;-pk`};SqXS-f?UR71qxz2s@*VzU8>!yLL3;_p)KTKACdc>Mee6Z(U2W|iC5dI(*
zbX3-<=f1&ti(~Qz+uOm_4FeMgi{b;8iOKd#wF2Uvp^!otlDHuQaUlI2yo^mJZdCN$
zVTA^{0;HD$H9}C=K|u0ie|tBiKdE5GI%lJ1ZLhw>>~h)o@}tIm>z|*!s|3^1$YJ1?
zqTqD}I^ohdf$N3OeXHB+{CXBnJ{XYX-;gd-eSV6y6Ubta6Wp{O^a#$hxx~Cd9%j2i
z5aV3O-78jPEZMy|UWDUA&*BG)g`Lo-Z#W>qeZjQ4=b)u5Og+qMu!@hMk-mQaxz&&%
zZkRPtKPU9Cawr{_m~$E2ZbJ1Zhk`&q6U)SpKd$Ud#~M(_A{rEmMlFVi+GtRND`Yq^
z5Q*!72+OZuzm{y<7WV4(>!thm+rLmQEh+Kv_3i!g<;#z|*Dd?^{nl>0_PLyAn_|O(
z7u+iS|1>R_F>=n4rUte;&=47DxVGrekHTv2n>TM39p*JZ(JCHi@kaOE?d|?`pC-@u
zaCL26JA2wRHPGBcOyN;cx!>EiZ$Hh<Z=-N~d;auu=lneV{kI?A|8m)E6~m7yvsXF1
zu9TU>&!He-#@KXX!^Pqx^sKeWd%>nnL1wwPRKnwHw}Pfkq@<-&@9ru!Gnr#qyv%2g
z#l`2mnRj=;+vV-$?fn!qfs>Mwa^kYTy)I~`K}1C41gm&V!uP9U)3UFxn|ipNzniW9
z@^b&_YooWHQtr1=^7Qm9dfaQy7JB|U>qbUKmSZsu3Pop5S}LN4!bMGk)KelmpU<mS
zF*Ut<&ml5$rirQP$!2~#jp}c2K1#dT{r~fMTj}HJ`~ReBYH4lyUH`E=eoFcM+VFoL
z+U<8Vow&QZ{PexO)laWQ=TA*NJ?&;y)xE#Jzn^|~cJ|X>uh(yX&c7wD#H;u!$B|_R
zPJTPHv9kV-D7qUsT09)0Rjd@36nmuic;r5Ov0lci#N$}M{Ch6Nt?SA*$8E`&$SXPb
zqtf=An@XIVoSRBs2K67-joTBkMSC0Dgea!9&kF_Y6dD{NSQo8wUGncO7b`q{!pcHF
zu05q2{O8@UGnna})O12z-)GV!navNDW|Y4Q5Sv?&_V?G<poj<!ZgIUY)fv17rXE)g
z7+U^Jk(oGovhv=&d$*;g*46F1a`kHGK7Ky4?(XilAGfkDo96KP=BYo83`~NG1)rwN
z3r>IhTZu!l_Vxxe`xWe1qpW^E<+t`fr&0T`hh@IvlD?fQ)_3dg`!Qw1sne&QE^L?E
zv@of(bnBUUw$XXJ-)>XXRb`)_a&J%Nr(4<UZ=TFsxAU3QZK+MGR(XA?h}yMl*PGpJ
zz0J-ZcOR@NRy)bLWuC1@y+VV73x|uZz{`x*U-|iS9)FUHX7VdI`(1V0yw@3bdGAlZ
zIH~vU<4<!t@1|Qzl^^?_Y7&zCeMU`u()XKv$L4;lmE^tp!unb5dD%(d-ZhFf9ktZ_
zR4zYTbLGi<?unNLj6_t;&99fuzIJmBznqN*sJ*%S{k~{W&*8SwrR$b<Ul#J8?31;A
zvU2&nN$K+{kNMeLzI!(}+WwWDRr5Bnxih1qJ^1v_<=i}1z2GaGeEWG01p&Lp72HaP
z-H*<MR`Rg866la={LZ)S)U#M-#U*i9#qEqvrgKQ1T750=^6Id)MY2Kavq6({b8Ub3
zS-&e-E5B#K-HrP{O<jLt>-9KotGFd>{Z^d4=jQwc4b^;9E}j48O^&tn_XmHsMsF8;
zdupxfg{o~vkl+$<aXXUyKnYq=!tLjXS+IP2{J-x@mDkDY%`lD=^Eq8qD|fop_`J<!
zKZnJ}vFt%=esf+J?%wv!y!Kbg^&JzXOtQYe?(5_8^!G29{d8ht<8NIJjSa7v);_ml
z;O0;eC}Vv8cI)A~$QWq*0$goFh#x`~zt&b+-mx%PmgJVTsOFtBv+&LztK?UGy(L>!
zaPh!~ojY$Po8_!sJo%EvV>`Zk$A7L_t7+P?=gB1RIiZU-Cud)Ov;BVE?X7;|arJ*o
zFA5YrJ2SJacEML0zC-LR0vxLubd?UDI)4&9j5+)kY}@HASHJh#*30qn0V+EqHP@YA
zyz|42<bF?A*H)eQeKB5MUT=J^TRmIcHgS4v+05fB-|zYCcl+qCf4|>vfBpUa{rvB9
zO|z%HxG}*h?#beQJFU;p&u>3oTo$(}rSpZwl-JkRPHt&oxp;Ha_MDqZ%_pVv_gq|e
zc~|4L;=a??OdKuo4GKno&Npa-8brtuppej5D!qE?>gD&Z>1+E;KP~o*ZO{9aVK(3I
z6sJBvH@E11?RU@m{|8K;Jbijncl#YB&~)tahowI5-`8FJ_4B#?|DC+LTNmZ+{&LCt
z>8jQ1HVI$1uwK4w*(vjVA9<_$s^9OuKF|Gp;bC6$8@~=-D}MF4kAdl-xIzcdf8z&S
z$nF581`dx0`cKb(dbUq2{H}gY$|4mtwH<c--wtibyqx2)LRUdrTKa8^VPvH9@nu&|
zW|a6GpPj$&W~t}rXJ;qR|MNsWC_G$UQ&V%%!$s?ZLPAu^@0L#I)iphEMQqYNuLWQC
zyghBjA|O%C*mPo}`STt~YJfL1I9PNqT)eCPI&NLr+wT{R)la<foVo6N^3DZoCDnar
zJ^4K4_4W1JW7pk1UU%h`r>Ez()mzWYvgcm-ykq++nJqWJ8eXVcCmZ3w(71uaAksJD
zhNUKYse6#~&$p|KgUa_De`jK+?71%9%uM(SOZimh$yZ)1F}oEzyNQ8`V+Z#IrAx8R
zspu7$Qb5B0i)EE%(ao<<<?UDzvFXy}nEA??ik6m<`@SsIcfF)qsLP=spvbhPqh|v9
z!Bm8|Agl+z3%0M1|M$C9Iq6=GW%4PDof-F7@<Ss*O?a0r42~%-_HufBsHM2VJ=Sac
zBlX#{taY5Tf|~Ap3cR0ed~CPq_kISZiJ<oS&GYT6A?<Zg+=0_oM{?t-U3`^awl3Cd
z%+}YK(kUDiJ3kU6waBwU!D!YzvFlx^SyI59>8@>U(f#7~BYSQdt+t4@+o)on_inzl
zD?{TAVTF#Kz3Hc9(OS|+8V;<Fv(yqTo%_vii}$zO>HgD>9BGl*VVuXv$nq$(LBS|)
zzRh>YJUrYsfsIW0Q_QQ+O!{k{Hto%%JzF~V#_91evIua1riBGmUqM2u0j|Nojmcfg
z`swlW@?~@1u9<nW=;tDv>*-<w4h)SMq6!^7*VK=fqOB@BGRL7heEprjB~!PQ^78OR
zTG+YnE6Macb64HGg@Ng#rh|aw{PS~nqjeiP3>x?CtNVG-xP8g0e@}Kyi2t3kvd7!M
zYlHUFB9LtpIR#w$&h+lZ$So@moc|Z1dz){|j=sv%U7kjJH4cBB30mNyaEp~gY4Kmq
zqQ7XVJW&6`n`>1+58v)x_j|{yIZQiWeBoSoUI*m$jS3C|lHC3it3k1aWK~C0<MeWw
z$@BlNJXZQw{EVdj{Cx{9K&=U5;ZQ=1nIh~8RR3^mURq_s;ggb^{IyR`h}PGh*wWIn
zVz;=S1S5-pgkOU~k%i(mw9r#9-~vU_>AmMeJ7+FFHf__PlAqT@gH=su{tuOB&ExB2
zU=mcAAj5e5fGWtr2<tc$1d5q#_x|0KSiLys-qn<}L+>_x51%z(@AUI$9#LLRHa{K-
zhI2&Dny&S~>}$wLpX9bTGkz--ICCgG5K`zU3EY5)bO_5KgGDN8SL)lzQ;QaCyZpG}
z>D9N3^d}0RRZw+Q^SvNYG^^+QgZhiM8-6q}Fd3>Juz#BLZeo!$vV$5Jm>!B;m^LAM
z-ij$*R_6sSeV$dqbE0l$*n~9a6LWn2eZO<L-Je52pqq)uMzGs|YBjvG3JH3S*$rjK
zzsWmUO`oQ4+V8ZWlgIJqau$J(QpTne5%q`ez&o-K2OpTh^<u_^#%b5>E#xvnUxD&V
zpuU5E<k$WQ(&+K2!kC^k%VC}7j9rZ~{Z<?b4Gt>Y0xoW!E<d~lu^U~3AY;=BiOLCg
z*ief!hZGJGe-G{-PF|lcGq3Y@Wf5?|neGIYKYZ#-F4}SMe$LH#(|6V6^*!gZ1G&;r
zXM)V(@5k1H*vR2$pvH7Os`|-6asJb@e@FSvS$}_z`VZUk$i!J|A||}v&L=JCz|a^W
zq|ni`bot4>Xvv{x=K<}sX>aD|t(i8hFYfxz?qkcnCcSK~coMNad+zV1wh61leWyNA
z`JcG-x1A0s5nj}D5RiQ9KjF1Iyd(n$0!O!lv-kE))=HOc@5-Yb`C^Ve?JjznKTX^_
z$*C#l#yySMz5y@K^sP;H$|}#v<@Dr`oOb+}r=WvE4-?D8#3RqIAbY8Sf$5_9h3ohA
z_4i!X*#Gl$VCMT*#djSZ{t)^3TU52^*p<R{rP|`pJNH3Gpp;l9)^MXo2uHwzMcbVJ
z9pBQVvp(<pjmMu_cNYEKl;r83>KDN;VFwC_JSLWjc@jGC!4jww9{4Ueyrt&P+idrz
zH*<L}E&qIBj)v;am7iQMa}~XN;*&1=9<0!gg+r<Kzy>MQs(^t}w4$_p@}EEcrk4`Z
zj+J%wy|1`x$-3#)8>VAbB>@$nU~3ap=#XLSI14rgL44E<2)(cQI&R&xa_wkahI2C}
zX`0ukOq%j!S>>AN;7(#gJ!6x{f4dy$JR8jB4&%mc=i(|$yw}>8uaN%MQh2iHu<OxH
zXU<glg2#P0;u;i;DvZB@BML!uI5N)V{ryz-_?w&?zPWqXS^M}1?5qi#7gJrgFlCwQ
z&TE^&IYwX(gJViT+!geq*s(FT{Z@|oo4@YXHt+K4GMC*cIq5PpYQnpX^B`*p4{{5*
zu;m|<L--KPGE@q<eMfcwotlui+n3)Iy8nzk`6==;@9(C|FWTNR9%g3|aCjiX!lC5P
z*dL45G+Y$CVDIYic@>NO=H0xdaCh(Db+bKu{U&IiJ2l;ZZm2@0X6L%E;1Zf+&MpSW
zCo83kSWue>jT(Y4Uca6`{hqa2|DLLlS-1WBm{(4(f0+6BsqyLVr3%)nUhmpYyD%`a
zEb?wpFxoXwJiHrT%Yj3~z^QTV@4nf2H%x=BUU*vA5-Du_<QTu`={b{p`oGqI1D9hh
zgJVjDt)&!NA<)A4W_9ND_?%S}WkYl2!ow!a)w!;(y-in9Sm?}^8zLZ=HU^3+bjXCp
z@%5qFDxlZ6*f;jmhL=r$PwAcS%rFWPetK#%_mgDrPb#J}3l$E3t+CK&;y5y&!7=5J
zZSgx$)d6-3nCQrCoYoij^X}`dpW4f%mLAVln&oo&Md8t=n4Qn|I7!Yw`JeCjm+1|&
zof#TCL>|oFBlt67hX%+wumtA7(3rrwtLoR2o4LH7p2WXevUc<N<nP64X{W!Q?p~r|
zem2=w9-RM<fvT%FYb=FPy?#K0<Au)+>2jIL?(wUqwq29!H$F3Siei0o+M#*YGdnYE
z5<t}hM~h>Ff)US)IYJ0~K`aFma9y`P-cqYw+BW@=-br6m;fo?CEjJ%)f94_s?$JJ&
z!pfoKKXU>zC|`q<8HDKBdf<2H+E1&`x~Jxs?moU!y~lf7vP0dE9?nTinw^5cj#hGO
zP%ui8V-*KAE0OdY%sJ3_i|;nmr?<?ya-qg&eQt!$nW`@zKS@7R^GwUzMsQM9aAM(5
zQhwrCAPKP$u74kER$u8!<@K^t!^=#oL%jUFCY%<3b}IC_m{(ZUq~m7b5{ScP8iQj>
ziY@;-HjqydMd|_H2Qy~YJS$&+{Zw1I^wR6ON;z*!YcIaEEPBi88Z=?<qiyWnU<)T|
zIS5Fu^ly8OS}Q(^Sg>|;_`JH+adr7|b8Y|138kMsGwrp$&ZJ9!OkfGMBZsl+#ECk)
z7}T*_fpAbe^V1*e-cLuQON;g_zW(^0|NJ?c^9_v?&ugCi5^)}sM;RJl2q<*)^gTZk
zidujg>Vit{+4u4%-Jeyc@Vf7N#huq%noM?{W0~N+EWLUSq$qPJ;S_LjyZ-r67D^s(
zoFV+fyK?iNXXo9Qu3C8d@x88N%TFvnD>32pv%cvqEXEot;OJIZ#mb?y_}9n6kKjOn
z5e{Ft_QYS++JCDi<XhPG>N_reX_I1d(+>W7F>~jl%}K%F=uUEOP%tu^r(6zM+X%~O
zF1-$}x$S>`O<la{twZ;5)AS{3r_`rEJFR|3+g9~rvNR-tF9P)qf6Z4c2Nwo#!ll(A
zw|KhEr>wO(_in1Z`<#%y`Zy@Ir#=_)C}aCSTS}CFayO`0aZ@;8|IoeRm>$f@Q0p7H
zx6HV?zW#gF+CK-+wB5a2ZPawd@4Eb~>B`q<6)JFV3TCobFa?LyqM!x^BQ1Gpanwe;
z%RYy4|M@oG%bIOIy3O5E_N_AJ!zIbcqQ9-KMoSg$!ZK)5c!Ppb*?iq{*kUM%J6d8K
zqD}HZwRE|uXJ~D^ZCz&FE}i+am9@oqeDp5gzpr0^?{3cV#x>UW-WKu}tEHZ}ucJS0
z=VW8sYoEcZniamWawsMLmn?3F7zoV<4jw42!-}VA*RpGK?_AWVFO6GhlNseO?K)4(
z6u+aM!a+}erMecqd-L&});+L4ANe#W7@d=|*p6BN_qaGjJFTl+6r}aa#@XY0a;C%2
zz03J$g<Ac3>>xRRqRRC-@fz~B#^IBM{MVIl19hP}6a?%+6A7Q!><mUJ)Dn&`-IBc>
z&r$j5fLe~p=Zi~J)K46r{^aDU&D<)+x-XxkO#`QwM_~;LMtSnK=BQ;di{64{C$^|f
zKH4Y#|2e~>DRJKCM&qnN&?>18_QoR>J3QYBqUPxbS6JqBW-?iN`RB_krYHn}CuMMW
z6Bd3JEF4OQ7oM{O2MO3Ypl*(au*NA*-XC4w@a7~#;}5}vo)bSRuieo^DSHLBIMmng
z2c-*{Rqwef?msOqW`eXpL0S|#dgiB}or{`*9XU<5l$`FLZ?AJ(JKFzE`m)1f#@gHF
z2Zha0(-wR3Yvn;TP%t)DfO>Y<)z8<0nuUm1uVdNv&RWmjNb$+XzPRwUnm;oy-M+5h
zF1<VU^&N4OmYBU+t5no~@@wDyo+t?lAB8#=4yDJ>Ba4?K%-~RHIIw|9%H&^GaqpkH
z?B><$j&;qqvW{P8yZ^+x+Z*-<n!V2wN>|I36%N{+obB!5<RLE24c6Yw!lA_8_yINK
zJHi>?cK!W(Km6o8<+plGd)B1<Jay`%(fX1(*>_JJtz4uJ-Lr9!L%@Y?v1=^IdmyKQ
zi(>^h)_d!-rv9&5<~8e<U)fQ+Y`1B5s&1y7^z!ezxck{QaHJdyYEUTB*=i|{8upD$
z=X0|swEqjyT^7Dgw{w~Px38zWo^);IQu>g!Qw3xVuKw|IjSE*VtMl)xa4~zEQzV;N
z<2LEfWpyvxT}ivmHbIJ=1DYHHF7ue=cB97LMJ-VC>VEYuuW#~i3+^6T(<%9BtN%2w
zxUjBlSx6vpw0Jcr7==uNE?<IqwL_?J?eG56f6vQKns(0ax@djHKbD_=+SR?hiWVWX
zf{LFhvt+noy1*?Aj>QiC`TN1md{6=M*TMVvr9UN+cINJ3Iw!V<fBP`M|J1MTuVTYj
z?tI)U?mxv_+=zP{cWY}RD`>i8-@Z5@VPRE$eSaaLGY1wiPWkswn0X@Ks@K`|&uxDG
z{P``WxvaRBXUn{7b}<151szb2A@TVVaD>AMhYVKae&_*EKXkqLy^9w#9Qm%5@7(r0
zRrU1SG@BDQCmY4Sj&L|IA8m#u+SJ-QI&a5Aww)giasPd*1)9uQ6Tkmn`rQ2b-?xpD
zkMZo@yLWG_T*U*%oBL{amz0%xRaNb>{pV|b_lckfTh#gIo;Mp9n3A;|1T2@`nFAUv
z0f!8j;Mm)+ttIBO%hHf5m2DH=rCVLOk!zQgy`^zlcK7K`Pqv-*R<UmWuUk@{baTH$
zYU<LQTU$KW?faEA(>T4)#LVo}uF}^z85YIQd}dk{E;`Sg5fB*?Vv_Rv+1c5t=jYi@
znmjpqd*<qsTeGj9dU&|qwfQ(`1JJd#(N8D3%S~LeL}lm4W75s5%%8NZ0gbwGe#oDL
zG4rEf0xJu3I47m-x={D-QPR#D!Pt%dyEcfdI50&s_{qHLcN4E%3EAz9n25<Z>{9Qz
z<lSoh@0YG#O^x=_i`wF`<@eTU=rb>+yYBz{``gv|^y~He@6EHnQ1y-B4|s0kfW{HQ
zj}kjLKv@Bvpc0-iS*fKgNG+<<QcPJ8aYb5bfv(V8flD`E^!%PNapJ=@Tt8x?!?$hO
za^mUq_;<I`Pfyb=J9BcW_w-%YULJaMwA*!eQZ~a%q_K3D*lv&9b-s=Y0gU_f8@&Sk
zS%2*NV9OEK@ZM)b(#P2O@4aj6|0lek_ud=Cjo+_7b?dFSRvS(_t&+C>@qXTqf2Uf$
zyvxqYdb6XywY7Cq!NWrf`qnZ&D?V?lK3Uy=8fff&Ykq9(++0~piyJz6dfQ63pv=Gs
zlscxktSA(OrB!I1&v9g>LuKVon=cofx0Rwzv9v$Fxh;3LjAfCF-T$BGt3$3XC@kPu
zDLSY0oQh@Rwa*q7@&XPDYnTGXU0x;Z5MgN(E{GERP%G)z^;YY^_ty808<=X+n?$?c
z|Eh_9^!q1!_4k^1F!xvO%eSwmuUe<{^6h#v2`j;~A5yatm(5H``Sn3`rC>3W)lY8?
zue`i<8QU}Gp8fUUVDqBJM|aEb>u$eaw>#tX35V00&)aD~KGr+=>FMd!Zx$IBfB*Ka
zYRzT-&Q9jVr!C(%UXw0T2vcZqxWTeWuY+f{h&pPoQOV=MUgg?NiRJUJY?mvX&r^Lv
zJI1a&A?;D3b`T?@Jd@SRGpj;Z$3)++{T_=vk@9_e!Gi;gmH+>Ke+nADo-l37&6_vN
z%-$XR{rbm*s5v*cGOsoNVNv78(D;E<z@_c{JY&>K$&q_c_)V?-RZHFMR=l*{xn5Gv
z=%k6*>(c1bqQ@tfZaQQVxl!T!6Rv3j9E}Zq?;}D&Qqp(veJMC^^SLMYVa3a()A???
zHoLv8yL<7X;>(vW*S)>f8}04r*jUTIW!~B|@*D~Rf=p*-$qM#2c7roKocO~%C4Bqo
z*#7Vn+t0jip2Zjb^vo8Qopq5D|2!x*c5QZxcip}=&NOt=WTx3yj$JQ|kiXA_m|JO^
z`0jR9Rn?N!t54TXjm^u**kBwtzxLbBvY=T9MN7(Z-p=~_?RI{3PSxM9*K;{6i=X-I
zw!2Uz$NrF+iK8X7L2P2;)8|i65?w=mV{@tOrxUBUemcf}+*V6%cADz*>8dAur=Oj+
z=8MYix7OFsPT;*Qo%(s5+R9b(9NONWFS|mkSbitF9)|}TkIPN&>f*9qm+a};`J%<p
z-}dX2+`SbyQ>RzTd^~6UeoO3{_xu0X^?%jh^P!1XDtukc%Z>MbZb&&Pbg@w5`r2r9
zPEO86n^W^|ZaT^~+5BF`;@IV-%xj;^OfP2<;MmXLnDS#jV>qOOgJlyQL5n*VH2d>b
zP7N<Nul8}CoFQcrXH(xaC$uK!*mCt9P9C-mY`xmz&u?Czz`Tj6QGjDk^}C&$il6)K
ze82DalKu4wO-uIdvDx`_TJ)1e-Flxan)_b9xVJURJj?s|^tdX|w6n8P)qFqMN#<r{
zt*Ut}eSgFA9iVkdm0x7c?-VreD1XYgW!`bukBp2ghd{lpusT1~reFnEi2UnG$9))n
zc4c18P&@if12p)1JuW~)b!X<IGn?K8Hu7`yY&rm$o4LDDT3Xswz31eqQ&L6OoZI<2
z`(9RjK5Jf`<L%`&N&fE(_epc!*!Nv9RDZwgwchPZLCn6niZ9o)M4i9AZ;dlU<3{lh
z|4+;Re*F-2UdADYOD6Z#r2BgV)%D+7n5i_xSSfqk)z(d%B06`@4rRTGJ6?7OUYOQ5
zS<UxTrS0qM>!*Vj)2U96F<R2MErn;xi%PcbtG;Z@htK|4gJyp=Kl4FJKnDaGm3!xY
zYT;Bce=Bo~sp#UC!ey)}6VJ?=VVGhcrXaAA$;z|WFKhALt(qJP4Gp^)9GC27JB@0D
z1ZT+A@>B2Q%#$77Wy)P*`qZO2^HZj<!@RIbmTuvPGX*&2Hk9rDcWL@QkzLG1Dl7sW
zl8j9!W>ikO!-3qqa%n!WZ&ulDrcYms&PQ(edh7Z0v{R<f#ZT?IRCuvKJ4P9z){#@d
zh3%*->NHV83RAv(#>B7r*G^Wm-)@s}*qsnxnz!)GTp#WeiWY0Yxfh3}vmDmX{Pyeo
z?%6&Jk@{0h=Q``X*D>ZidsVH0^W%iy4A8Rx=A4w6;G7cy?qLd4GqFtE_}yoxGIA})
zvDu-xx_{4?cZQY!=CWmGy!^Oh))AJ8+<wyf^Q~4pEE6^2-p0-c>2xMVH7FP@lh-$I
zhh+&+_aIqw!~cxkHrv-8+|raY?cKe){@~@yRZg^@KQYx`=j8OJkD79~!NV#F4GuOO
z0xri62S1ZT?nfvjG|CApAocq0t~ardop%20L{aV{Rm+nmnI+n>wzZ#r-FuuipY3Mp
zj=Q<14?Jo)qXHfz+-2au>C)u3oOI|iwU0^;0+RavvwnlRx!^{zfCEEgBBE7xt=Q)H
zr&nbcuOE}`-Bfio<m72D!(_X%8}F{qE|Z&l?c6@a<MTr2=uOu@H<|m{6CO_e_K-BF
z*@d797k2)c(I{p=WZk0rWR|+t(nF`07@fN(6;Sur{I_a(OxKj_Jh^{oOwlO%_vYiK
zODq#Ms~a+Jdwk3qk|MMm1WtYjH|^ns0i^NsQsL_Clj*PeXLDxUsmc(4zU0P7dHtF8
zj%q!R>o?12L;9rx1>z6xPk1K<9u0>jY==9LNrgILr)4v)^*=u&r7v$;+%(59b&iV4
z4%NwxavfC=wMQm0IHt(h=Hx+^4?`P0HQW}$mw&7)Eb?A8v-nw~{+Wqyc>Ya)wS>zX
zqU(qFgZs1o)!smv5j4~ZxPC`B|E;}V{@d({eR*>W)Ha0mdUkTQOfdYj_rW!AB)GXZ
zC=`{%SZYB$4>8VVfx~i6>GF`Rr@nQCRW4uT%4b@#bKR!<EfX4#PEcC<^X0m~5#UVV
zz|eSrg+qzCc##;2{)M2yhBs^TrpvP5KC?RXn@pzg=2O|8FU(gn`zTF6fA(V)4{Y;u
zLq21Z$9=OL@JKYwPz~XX_phefw%<;@{?P1Z<qF?#a+%ZL#raC?ojzp=%gp#$n%?PY
zrw^@+{PZ`S?^NS0zxPx9*XU~dOcv!X`g<)AnzuQ4K%=Euhoq1*RtHn#zkhX>MQcvC
z^-5X1Gkchv8oT^QpDcS`R#x3Cof&3+Vt%J5UH0XeIV)$`e!IZ1^|Q3H=dbx9>6XQ@
zvUHMfgD2FbjSpBjl$t*;GDG%xi|2!g?EWdU^RCHX*>bx)Ht+41i|22>mGUkMPW?Bf
zaNE<zdoC3kCC+*OpZC;huZizt%$?10@~52LJ?qF!&*<YVSKi&YB{WIk67O`-BoG55
zOOwEdzxfXo_?%EygLc?A%3Xe1xrND^SN6MX?(|wy*=Kk6_`JB0aE&+oOv*K*tqQTv
z{LW3-sXEgr=EIA(6;dYaV&<gB-`lnsHZ|?0<{)5cWd03lTu@;hC^zmcOS~4=_3PG-
z#TUyGuZguCo_gz<-p%|&Zr{U`85S;<Gq<+&O!GfA!SdTw&CP0Q9#yYSuDf=4?rhki
zY=bf;mWj#fXJ>-b7li2GWX$E<`K;4xrNLvvUs_fVyZg4TxI1U=x-+}(FKqKO{+D$8
z!0DF$T{0fuvuypNikf`%&rO(l^rczBoYZOE>Pvp@Vz~xwu{pGW1_p01KLkzaLbHcJ
zM+xKGzPI`<CF|l3pOCkUR+U`Vx=8PJMYru?{+Ai$*Dq{bqY;}Xl6rzi*yfzU>B(nR
zj5|4fgdYF+1gWVVwtx)1E&R9&sQ~2I+~D^}DC1^OT})dy-{wm~xi2EZGML;ipDNtN
zDXTt{GmS%*IdqvEB>pcdItWP0p6^_ZR0b)$VTxU5nH*ZXJmktY_8MKzOZl(n^(b*4
zU*5si_v_Mu!28^1te}Gn97pysIHtU@Pktu=^OXZb;{ukd-@lgrikL2AlI##R>)n-K
zbr)DBxJ&KMS)<W>$hDr`-{^8geOcwk)kl-lq9*Nsl>=Qy&?o`gbM&zNH1d4l1Ahng
z{)-0!qb<W`dZxVD9cg#x#>;Y@<8_x0eN2&duTK}a{L0YTZkx*edR6FV{|1K`P~C7e
z`I#CbXdXo_SiAXpOLuJ9v8=gUcda_8GyA~CWh=dX9v^S$&b*@`d{*b`O3$=UGk5hh
ze2ca-S6@&S0!?R)H^db>dj6)Lkwpwk9BFiz?<vx6R(|_hPrL7h6>FtTYix3wjwk2t
zb>x1Mu6lY(Q_0M%v{ibh>sPWezh8N>bCIs*|NHshZqD5BS9Zr51K%*66JNtyVLLDc
z+?iM=7Jk{V6Om^cFK}i^Y)`CS{DS9FXqt?x?$Vzx7wIyX)_D7IZTVbOaQ(`aYsrU?
zDlhZi%GPU@x45m(^x5W_-fAxvO+G&58E;FEl*P1XOK&|eRKEH>qOU3+H0`<7KkOHe
zvT4f|tHn<RzVvPaPr)%TakPMT&AjPv;D(lFj4T2jW{qvr^42THRF>|3k^Q*OP5RK&
z)ZQGkjJIBE85g(pev6GZpY=3r^SZU#KeiYiWoe)6GyRp2u!WzQ<Kq-wxwET}=wx#r
zpD40-`}-JkWu3$~9_yypLb4WUfjP^>hxKeRjF5x~nuZqP%<w*8>L23OI@9x3xMjfY
z%w{j%S2bHX-WZ(~FI^<DJoK@ku-QB7OUhr@Dy@y(T`PO*{jWQPCxa$g3s~GL-@ImF
za%1M#88ZZaiOs6Y2Q{6i-{($-6{`vfEF4Ndr9h1gNPVFo&;puc7k9F1zhv;~=XU9o
zk3DOI*GkP5>zn(nxYoNr*mTABo+~ahmn1IEd}yIrz94jQ?%RxMm(QBPQa`9^$TD%_
zuaq5n@Y1@mL*#;?BC{@k?kd4r*61zTThIA{f~)UasZzz9geY6c{0yiaks<P6f6}6l
zD+`e(O_TKs)@(gqwshT!T>eLQ{w`bhUGHLNT4`Wk=FN;IH(uGVdzXJ*A=2YLVYB#|
zi7kOIykw8G2E(gej-3pSDJMKF6%e6n!u93rSMR+uTb4bG*dAg&vorC`k6tU`t+nR!
zt#_G*TzO<2BXi^3&veJKO>doSca$z}o8URiZP!%W>Q`^nojlA%#GqM7Aq}+J<5^&l
zGBo@e7?=)omdub`p6#>3;=`p28@>CoUfj5%yY+1BCFuh#SN<+*U7TL?;`bWkZsXLm
zUoY2&Cvd~ug_+tFuCf05^?T_-AEw2i#O3aL;6+QHl!e*$?|m~AjCC)TEi_v`;jg<j
zlhrxb<<D6{`n_Pzz-$PD4v2dBR(!5wlzKj>$M?+Z^X1f^cVr?rDuhou+oHWV&}!Fj
zwkX3}*Ls#of9(wGHC2x?{l;=()y3<jz9)PpB^k#hZ+vOC_OaQk)fVbU_ob)v{8_&F
z-uM5%&)Qv#-1v9urb8yLAFSuQ4Nc7qjTNA!2+NnB-3u=u6ooPjk~P=WZYuJS2#>p~
z2dbOE^>SsTrn1%JkKY<Q6HQ{SEVwASJTTfyE?c^CwHvQ{_p#+SJd@OBH3S~dyt3dT
zr~Kt0q4vFTwr%%jZ~t9hc1<AYbx)YY>pAV^umq<ti-kjJ@ypD@weav@;mGJd0Ln<N
zbKi?K-iiun-t|7l{BXL&^=mh^+og9u>Dbp-daImQrhi6w^z#$5O`m0~b`v%b%RG?L
zd~EXR%E*(7Gkc?$!}e}3*uv4<u%2N$yzkoM(V$S|lJf?#&!2&b<H-7kw)}ri9`0_3
zPl(^koUqh*)6;<D<uZ9MCOPxYO^ZBy+%Hoq@$|8j%NZLB_GF%{Sakb~!wriIs{*4f
zma$)0b#dph;L7XQ`as$B`bwGhT4-uxXsi%a=;)cQezq1VNFh1v?@G72w77%QzD!}c
zJ?moM#fqdg$2xEADs<|4lD^y{>ClTFd&xJYLGth_NuhwT>BNDxD-h>|C9r^IEe^gA
zH$J+hf}c0or`w4a+}@c~`SO!W?bBr^TMGZAXDRFh&u4(6d68$s|3lr&mLJ^;cTlnp
zXjuApf7uMr%r93p+0Se`7xh*<=1W<nRa$ap+$<ln^^^95%*<(Wt6iSD*j)D-e3{Ee
zZ3h9#-RGxSLu)=p7ACP5uitN<eDuxgmlJB;Z|6Q(@i2MybkF2pzTEEbb7k7+<y8f?
z)qFQLZp%yHg=M1#hdZ1CF30XFKW~GEo5DTTU;Zt9Pfgz%3E0fK)~8nU=Eb$VD~G46
z1gl=KT&q9NJn;u}5HliZ^guHej|__^Lz9odd8S_7yFqbx^`0)<x_DoG0@DdIeO=kT
zlBr8oy&?m5O%a`Sy|aAo(qI3pQ}(}I^)^>NJr=qwr{)RlKo0>2g>$SNN{|0=A9xFE
z0_AXi`SR`dN15+3d6RA3Z=GH3`>O9dOUYy_$1^;_X6H1_^e-=sI()q8qh{Rq*u7b+
z*3@pglrFJSamh7LGvQ0fXTb$9HhJu0hq|}HL4@06`}Y&?oO3t5F4+CX?BQZRoy)n0
zPCPvIqeo??siAY4So$0exy!2Nr>kGQcpFi<>|Ob~*^1KJ%uhXw^<6h}i#McjxD9H;
z&X#!%j%-lz`~x%>bU*$4T&NEYNN{Il9}VVxx2nJNq@J|RtPdCW$mhM0`lfejlCaN>
z8HvsAyz=S3KGP3<TzUANc?>JBRJh)`&Fde&+Jp!f29VpCVQxPl!C^9^P-<^!>b7L_
zS%uQ(?=rT;&fL0mVQ@*%%vHbqD(|!OS+BnJ=J&>H4|hlUpYfb%sXEiBI;ic8;rdM0
zmy>3Ah-V(33NH&78b5FdxU?OgyBV599b`Da%+g$T-6l{|v~;fB`(F;Z%Xzi-|F|f0
zGxb<$&Hn|Q^1cj}dlp}RZnsO(GB79m_|D13sp~l9O)F&PpR9lM(-l#FHaJAE{8)cw
z!-nD@XxY=D-e|7%%ZJ0V#@mfoIsAXs{*L*_x@V?|W%J5>Esg4we0;HFtKU_VNl0rD
z99lq&&3-UH`UDMUg<q`qEN%WgF+3OhZMMKA+x9D-sn4dSoq9R>_{o>gYO@??si^I^
zUhoYmZ80>S0JRg}JU@IDnxPz~aBnI9?p?b1<?OeD`oH$Aba^@b^Rp)>YJ{!MY0IiF
z{h7H>dowFM(K9q^fXeGd?MIiw0_q9(mzkVtb_SEr=U87*dM}eP_0y|3VO_SkOF=?U
z<?Z97e(+sEZX|nwO5G=pg)^a1DX^32>|5JU+c@R6zcqiD?7Dgj&#Z)H_qVk1Y%wm)
ztgCu*Pb0hyG17rP&*kuk>y7;_aG!UrTFn))3HzdKvluK7rgR^-V%i*KXRf}X>k70r
z3i5`+DUkhd8Vh&A?3Zgi_s*_z`=-!)cgpW<tI5gvYRg^rZbwRF$h6e>nRne)Of?;^
z?VYJ&rM+!GY}Rx2Av0)Hf?9oxKy$)b^0MNP?gazWV%>o9J<;1{J^1K*`BUNXgJCb<
zeZBY2@S;ie9AiyqG5_;s>vc4>ZEo(ZIzKO~dM0Y~@}%09CCH7fZqR_ykC2_}P#YyC
zI_&o|3BH`TD@K01e!Z^5=1Y@PHfDa^k>WN@XU;U$UpM1VqINcytg2hEep?^s%DWr4
zs;Ve1v3J}CjegJ;&fN@-DO>Cv*TG7CKhFiLm-}y<&6$?-BjZ@L&9mjFzh3!cB5k8L
zccSiQU+xn}S{_8{XI<D)R5-78?j_gFu+5+#M+bs-__gx)dP7J08-s-}YzS<2mwo>+
zR@kZR=Zm7X2Os{q<a6;s;mXXP5f*k|ulSw02aO6)WqD*HXhg)mCJ&PH8!Ln?0;(6C
z{>pxQ>7A1O-$IY2tDF=vKDW57|JGA0Thoi-p|GwZIE^?6FtJQ@ObCQE>=wB%xLvaI
zUf|VdQtvmu+wnefo%iRUr)y^3dR3SbyKb?2tF|kA+{ZzohKXh3!_CjnK;0vd)c9<h
z+|8_Gl~?qx-`0*=viSCQo$H_dN_N_vZs|WN{Gv$qk^8}i(EJE8M?%R#z_O)96l#Eh
z7?W*U%&~wo3b7AMcHX<L^z`c6N48ZWlGCSUr0<N&in4o^bA4v!zx17Q+|1{|<Ab0u
z01eTBYNyMWpT$9Hrw##7k0SDS%2JsXZ@=tN;uZS3wa|U>nmE(YPn&{lw!LPb`}Eh|
zQ(?D11**?kng8+b)2c<8FDs_aOmW*CbAIj|P0!AQXNzo~Jb{d6f)XvLpcdp7aOs=T
zCkwH}Awh-dmQc}I;i*A^&n2C9$$K+<@oMcazRPoQ=IYh`r6<iUKdrjmD0Z`OL+GyB
zGev7HA7`psoi3fmsjzveivHQZ8&F5VBv?6=4tJbi2{FCH9olL4G3ohpEm`!^ja#~=
zzIV^PQha~wY1PD+S!>tIeYMq|t9RXb0%WKZ8Wb!X0xoU`oF525!ns4e@$BwdO#AN6
zZNGgaI{nq9KPHhzwx{<!n<X}(vt%dVjVWEw&<E*n@orEsiup809F+GN8ZAUuta{J!
z<DBrDE5@9Y=1o#a_mNDGw$U?VOnF$5wv$g{BC=+e4hF}R78?#dNUh%(AqrY9xT?+X
z=YnO<-{dkU`x)QtsmOh95u$K&OUa*Kp_kw6=(h@kEJ^|;2T(XK0<E#BnlBp;DI6Rw
zFj)om^j%zWck$e5olAed+*Fg-w<cmjwt5@quLXJ5SLEMMb5<)^v+BKxaZ<U*(wP&U
zEr=|eAF~WJ9Ou@R>MCh;e@hE;0ny;_1ynQqH-5qg2_X)T1q+wnKIgJ_@_`-G(Z*N{
z@7tv8+_~1B&%ErUpz-9b=hAAA=!DC^-tvB~?O*3t{BaW(gfjUknJO#=<z`qwI^=*x
z1&$Rz(Sz9VL3@F&;&q$Am*v~Ccr~uuMQYyPnb(#p8F~ATD!c!dj4SJ|woC2uVYsQ8
zJNMRBs~tfT=IR*xygoKl*f_<laMz!t;ND!_m+v)FTQj#!UAEr}HjDv@q!*y}>%8=%
zQz2E1K@#KJzSu;kqYt~<CjS3%fxT$YUiVwOn)qcv1z%Czs>-D&uQZuxYWtYKf4S)O
z-P2RFFYnoQuH+TycrIf}@k@daA!P~FbkK;zzw{Hb5DyxxY3SpW%vhQC>eKCFD_hk-
zucF}8N&D26oN}q1`E=5qEsBkc*B57f&(E#2ob@>LmzDWzNP2d7a0O$z0+USn(K);J
z*S`qR+xM;f+~oQ5^UptheTsSQ^X&R-$_)o@a0s~c^%|!`#uOEFKufjX{OD)z+s0n=
zk3~}ANMN*K*6L%LKbhAHT|QN~iBqPyUDDa;f^cT`@u}UP-)LW`T>%^Qe<*t4!26HK
z<)@3s*97*-+vn-4A+1?x-@9Xd-PhGY(b3jR?#(T~r@1-(eA(Lk{QT+caup8S^6%@-
zojZ5Zym@*3^_P9kD_JHrUMrTJ!3y4o<(Lxj)6x>sQeG&W@$$t~{xeIA<*&S0eOS+Y
zhC<N-7CUF3Rh%5}|K7fN*e^<Wm-cfHXi5>#Wtuv5>ZZ)gYCC_uTAg}sj^(8rH#A;f
zTf2GT!!t9DQy(4atjk}zb7$l^>-RR18xk7b_g=abbUi)SaA(=uD9f538!|pv)cz{D
zxvO-w&8HK}lcr2j0Zj|8mCmre-WUm5u)r<g()L%dfDvLNi~fbgWBGT|qb#i&7q|7B
z`rftUzmjhi&3-E}D=U#raf!dD86=_w?lT21^O;!vZl`-taImfmV%-901F580$CbHT
zo<2S*9-s65`?uro?(R-~e{XLQ=pe&Qsi$*9ZQuX<`#bgXv$I8izh1xnnLX<KZOe#u
z2BwFC3LQNC*6EOHL?MB3?#EvaYcn6N(3SP=K3;VB*2jR_<!>Eq?>JtXB%D%J*fzth
zZ`0ycxjSB!{r<GmlJV+dAxKDb9GTy+&Ev}S>cV3+XHJ|bh_`+8R5yCt4MX+mda<tx
zdyaOCpO((wqbTJtukzVUp$yyp<`3XGNP$wvCI5K2SsNW#f9zw?a<vtG@cYnrg^0$B
zKhAxbxz1y&u2Os7SMSitl{3H3N)w#y$`?IJ$W<+^+h^Vcg{799-}V}Ks~9fyt~$$d
zgMY?j8AJX0)Jqi;H}zP3u3qsuyf;@_K%)2kX%4;S*hMZ4@4ctktl-$`vrk{}lft7f
zMp;=|DTqC(JRXj_WA=Z&7QHChJ1hL%$H!;u8+J_Hwae<_$xJr(*+-8a-8OC8fh$58
zw$U@~1soKVSQhDZ^l+H!F+nn?0H;j0JcqPt!IkTYpYLCd-FsL*W_P6c%nKW@wDe8(
zZ|ReAQd6yZ->_EkY5IA;N%4P{UWfE_F75)am<E}0U^;9a#UkOOA>rY-*InCww`}(6
z-P_jxE!kW4vhL;5=_!wo^)3>=|03t+>FN60lO2~WU3xRtG($$l=@nc0Tw_na1z+Dd
z{$yrkQF2mv)#M?|Grj3R0n@qrT%S=^RVe>Gw`JDJlvBCavo7zAx_@@{O5KJl7h@hA
z;amyYk(K6mX2Q&6tG|9(RO0E)X=fN?vOgX={=a0^zQgybGV69_l)n+>E^<xZw5%m8
zVafgJ7vfmmyTusy>0kV`MCq~B&wVb(iaVCAzA&w0p~lXgI~UzuR%-UTnVtXCw%prK
z-tB%r?RNhDyW4ucl=uC9x7&Zx<jJ`VH!oaJ*#H0U`=>vj&)>c|$$IjI42PSyt-tJ_
zC?w4O@AmOZ{w?$NzfP29;^<lHaD{bZ^6A4jA?3QnOo#mV{UI|7WxvnbQ22gg<Asj}
z$>9#{r)8(-FuU{0rO$j&*v2Wh`I7DNB(4_@aax&>R$%4LGg{ErsY5~p<6E=6Sy#2f
z_kwm`Ut1HIoPK`a<38({*L!s>Cf|8sW_#|r-FM5%_j|v;xzX<@urhXAsoA@OuF(lu
zCr?UBoVU7A)!ctLokf5Hw0`}^8%uEe(t(FlCjb3JTeX5awL5&j$z0=1y|r|8`j19g
z<6vR`Ek!aMvZfVhPJ4AKO6I}(D@m~q>V2Ti;Ks52PvSm*`s5PrZUtMpkr?e|^}1ii
zGD)19i|bAGg0FM_R=P7ZegKs(|0N4p!R1S!M!@}B`uguJ)OP!P*zr1GHp``3hBv>c
z&5D|#x7qi`ipItJ{7?CAjh(z`LIb?XYaw#s-37nv8PC6&8sy~VP4k?rX1V%JwZDJA
zEc>OsqD$OaKQCOn)|XGlLLoIZb)B!3^|xndXFq+r{r<Gi=d90f{rB~Hyg097`nfro
z*IA>^mok8sxxE1`bE{{GfwXd$aDSOSa}EEs@>9P<b2nXX>3bjc#lw4f+}8hv)3`PT
zr<_v}wwPDpYp$5mwQM3hXDE2F%2mHHT)AS!2H`VPrcCMZgPhKKtsA^;Hui4i^SRr)
zzyAGxKmWS@=QGAdZ*CYyZpoPVHm>%|i@@Fa-rn6Y#b-^|)lS!mRI=iGx~uf{oA?{A
za&AU%%h`BvN!k5toOxSVqRy8lV7hn(YgLthu9FzAoc3$0RQJ%;Z!9tnxqrTQ>E`qA
zMyBy|;-)ArpPF)F&Lkhpvn~BQOE!MXKIR5ZQyq4V#pi9q%ii75w0ha|&wR4j+o;;p
zy4z2<ipM@FbhcWSTvfFz`|gvIlT#13@h)my61+wA$*ZfYQ{Ua$c}~lE^EZqwwI`NN
zkCQ5~z0RitTAc)Hr~c#E!2q(ZF@OuS-u0Hc_EU$oxtm^CZ87%#3Ynw6qWIV#O#bzx
za_#81*~brtS>~nf_!fTY?0!do{j-yx{r^(4*CA2Xzm$`uVa0j_Xr+gXv(wwYwZf-f
zfOg?VI=_2!VWIP)WUG5MpU<w#y(RRC-Tp`8+hccc-O6G<vt^6P^|J4*vc;d)?S8lE
z`9+7|Xpbt;IT73RUkf-SyaAn(a&L|?xOLPs3AUDS#<iY(U2IdNLhAmW%G`9h=lzbo
zi(K!m%$R!XSzi3^8(%GFdKUe9QfRc^B-p4rYpF%_lP#B*{kq%U3tC?L|NOnV2f{<=
zcHgfzQcv;oaB`ZFI?u&nqNkuB>yiamS8eZGx<_p5zwGGOd)I&emcO<mG%s2vt~)NE
zyVUJSWA}mu8jFmS6^vU9)D)Fd6b|p6FM95z<w?&Xqxq9RN7wPC&)<9fUiI4db{sa5
z*|y-E^)}SO-6||z_|nGpr>E;rZ)9da)xs$(Q$G9ciWM3cr(3(ee{8X8)3)L}Yr}8<
zeB;j0cui12;HK5NJK)T{K$Imc_xw6zj?C;PHsy5vJKCjBw_H2$xZz5HWCp7odl~2S
zbA_SyYwzzizg(ty587g5U}Ravd1KO*7bUr%iHHXp4hok7n{z?Y&bVGI;(PMC+i$On
z%4<)zTyLXla^gOhMcIUdVHXMmt{1$#wK2<9dAq(BbfOkiUUKsAO!@t8H$NwffWv||
zhQ<?8DsMn7et{2RjbGL%ZJ+%vy|;bOiePrhTe^3uTxXoQ#`v#qq33peS0qEgmYcJ1
zxa?|l5e0M3i)m~SI-O%RLtk}isqeP3cg`KAOhxb3+RiEe1Uq&TWIf2%qbwXQ+az?w
z!M*Ja&&ETOjDFVD@2lCWeqLpc=JuosQf(#WKFQN7mc?y<^7-K{aL~gDhf+qSiC0~J
zfKR`Bu#ri1>C;U=0~%{`*RrmB|9q{^&Ay}S87H17{JTijKNWJmC#Zg9VBF5~>C-14
z+j8Uj-KBwAiVu{TSd?m?I9~Q;5pXyV&3bC>!oJ&=&z%Yn`|!~^n<eF9rLS@D<}dF=
z)Re1TPl)d>etKi(q*<ae-%9*BCVDz2$$r~_7+-F1c*`_%=FCs$tlytF)+@bq!-fkX
zJlx!qz4dmw<n8;J=IP<F;%`cyLPJArgTs=!O}yYR^B3|suQhG!?xK{rq7i58qF-&w
zlnRi!Y<_Exl^g3!tH<m|PV7m|EV5X<<65!Y%!{E+%y;G<dHc!e4Ps>KgCL_U<Ifk1
z`@8n3tEqYY|M%B7?L+W#zmwPF>vd<F=TF;N{M;)jXi|U21z#2^eFue2AIs)|-F@K<
zQ)TPYYg=C1{5-_vAZPQ|in+`yXG70BY1QPl3@KhQ9=&2mTv;MLGpbIldV6!zIVso7
z(@W-Nt>s*Kd1I-HisK2X97w_er=AtA5AK%VpZe!d4QRn{kEF5NpFgYW7VOQxZ&&$h
z<?<&>r^gu`JQbyPFpouGhk}E`r1eaoqQ+r1*Oc&(6W0#2e)`!bbF)Mv{#4AFJ$)|)
z6q45}JlgT^;w5FnHTS+{E%>-AvG7@FeySFvT@30aD+IJ3Xk=zjd2(W+QQ4atQd_IO
zztc5NKR3nveoe5KxA$3(lTuS}G%_%iF)~do<1zy$zo=jZ<@GMt{!CELE_>z?=6H7H
zb;mG+LYMU(JChu?#N5$!`tx^n-KRUV-ad(gB{>GBeYz9o&ee5p<5?-HXlfdI>eML}
zWo73{lP71dJ<iA?AfPC4ayz)|yx=N}*IJ$H()`a(r(17I{XKE>qdA{<ZIY~=ba>5!
z<er{)!m1A!GOoR5mIt3wQD|t;Zk#ej1k{gM?VJ`L6*a4}zq@<&Rz7wChXp|m4l4J-
zI{+KS#4lXz-<9_G`8AFcdk$@q`rggOJwbczgU6xG$ttSbp6%*4^-Ev}g(|qZWnfyX
zvS6`d>8r1wo}NxUHAU0!^7`_3cQj8=)191mcbBIJM}2?pQujl-dm<VfmWbQi%mVfG
zD>gYCZQUv#o_BhhZaY_2Pu-QyYtFk`PaiqB(P&Y+3TKMV&%{gcVZ;ONtjql7YRxvw
zH9B~r-|m-3NlQvVz=WAywZFb(W^*dm&os@R#?O7Rl;w`Ng22mtqLBSRcLYvsH;R9~
ztABo!vV#BfdFu<^YFrlhNM!WZ$%tsnE^f+_Nk{g`JQV=}fdr$Z^-){BuC0kwX6KhP
z>C9ZTXpxW5?Adv{JWJ+!a4~UQ0VVG`<t%Ut*`ZkQA!K3Arl&n??$1`=C6@Bl=!(=|
zi^_~SF_)T;7+=kW6d>Sq^x!6w6;sgi)Yq%`?773D)ZE-`yZho6K1O~K1%a21{H<!B
zamRZ~0by~9_uro1&NLx%)ANeN-Zb}?AE#NepFCcoxbc!^+x`_-8IlmLZn)0*A|$72
zLfrQo85`O;1UkM<V0SbIrNMlm3oozFe|uu$|GQ;w=R~Gl%lPH$xv;3$^jBfYeGN{&
zFY62E$Rg4nN5v`!H@CJ7p;_Mgdqb>BUMRTt%T3+0XOGqF)dx@h`}_NPWP3A*f`XI6
zq<rx7dc$p|%$crfzrKd=E?&Ci)|c#F^S*b|y4Pc6)c0Do?yU9I0$0M|U{ZMC$+Sys
ziP}<7wXiYy_^Cs!+)ocQGJiEIytv3!NJ=Uy-&RZE!D&!g`Sayv(A2{L-^Sc_?k9)O
zMsE6h;-*x(OF4%@@cQ+VLh6PO|7;9m?m%*ToT@?A6^+eoDf{dG`s_|WGb7O`<@!}l
zSwT;MO?rxbiUFDj_DlR!13P7h$b}Z;*L7#6_M4@iytw9(RB2Vz<@L)W7R#54q$D)N
z_dZ4{ZX6CsvsQh3qxoyo)Q5-LZ<~P{!D?Ir9XU!0%R%!uZ+#uE*T-zNjs92uTJof2
z__Hgv_1gC;Ub+SveVt_Sa`vTzFC`!g6G1V;B9PI~RQ>JE#0?t^Uf$Ze`t-Y{OP6})
z<*nn9v$^rKuuQ4JVJbu82`%nzpz+5t%>~NRrW;l)mcG2X%SS%=v2$w7{tV-#x6EdJ
z4Dsu%$>^<%*{$vF<)uAG$Eo?x6D{rEU#BD%PLlBbmaQ%W*)s|D@s{ky?f2`Vlai92
zG_uPT+&q7{o&R*V{yvTWKaSh07#Uqkl?7S7l%dgMA17$ZgteGOa6#NNUGK?<CC>$~
z{ytwvq;~DinY!D1J*SxNE_!;qwle6QO#PG{9S*`Zd#Vc7lyGon91kkth17s7AlDz`
zOi4?dC47FawY$Qm!j?Htok4N?BJpx4i@*n6Mp@3EPkv_>sa&??c)4N$<Efot3xbYR
z_8yn(Txj%mQbqRP;~Jb7enNKoLQSplcyMK9@TX_9^JmE|U%veG%gf83zOVmZ&C7Uq
zeemYPhYv4JKHg{Ax0#udWezKci&gapP=g@DoXJXd_d11?Q1`VCi~Cx(+-oc2o<6_l
zjYjjXmT=iL<jpzq!Y59ioS47=@3ocJBO@dI=6`i|aA+ubcPA2b^8W0%Qlg+@-j9hz
zX|4r$x#$*o##rG?cZCGS6zczEn!lVT@amoB75L<<fWv~jTwmVa4v(w-8oF}DhBQgr
zpGzW@KZWoA725lcjg_@?zPxcq)`1PojZrKdF4ve2=Ybjtw^?&KGw-}~&y2Km^eA7j
zq8VDwawt47W|B&|Vw7}*WAnG<0s~L!+Gh_hUlbEo5V)DNB?h#UIm4RKH)wIT3w${U
zDDW0!G6gU9%e}>FA<fA0hKWV#tw;_iW!%#*u-P3kt$x00{JV1#KR>-1eBsKy{Z}fM
zrCeWkSP&GAAl(d%@!}^=pPuYH+pKe)aAa6mShMr>u00Riq>tRczyFwFnF4aMWn3?6
zQL-!G-hVyseRrp)e>#`p{zp$`LE-Y?$G=>62ls-GhJg9!$D9KbmEE8C*Z-O<A||%$
z&F*!Al7fPYmzVpCFU#MplBAAYrM?&b@$rUb<geIeIkqtYi$B%|A5wW9vvSTU+xW*b
z9{0WDR5Z%;So2tK8=^fc;P9a70O-P>r%#_6Re#HQd2{n}oybitj~+ixy|pE?=+hHV
z&@h|LhXc$kia(DjJZNKR^e~^W0yME$G3!9z7N*L4=Vfm;F-^RBdc!+GqtBQ6F0C(S
zzqnQDIXG_|y}Ekld8w9~6t{3r9)-*Ey%ow3Mc$7+2QDslf4XY*x=GsW_gso-X>ae|
zXI1_#C(i!wOaG@&r^ip*|MzXaT|O%V(^pP`jy3)rk3s9e**SAIyV>pAtmyo0Uco%E
zNBKtu-M{utk_=<mRPA)Ns=rXs(dhfNd7HATx2^eY7@jk8OR2BN+`hHSikwbW7nqlU
z7L!8*SWZ14Bt+%n#ZYg_mt}Qz`}WRdX6Kt?ey`&28u^vVs+t@M0lOI*Pu$A20Q<P-
zz&B;qPv6W<nI|w_i@Ndn_wgBm6Xqs0#cm5{?!C_2ZLB|C^ai+52d>T<7?`$lsi>=a
zS5@u$TjAx^r4zd=<lH>lY&W-e_x9eFQ4Z{#+ri6{C8{70sm;p{DipSf-<Vn#b}weW
z;x4fz$rm3y3S~}CId-D&lA+d#j{>)mDkFspJxt1OJp!@nLB{FsuC6DaPLJ1HzyIGZ
zn?D~83yF)Xv-8PJ(2L#Wk)!i^ow>60^sMDfEK0XuHZP6lP<U{cX%_46-t~T`uPLX`
zwOYh@qO)1c-Qm@iY*5bz=6H@RYYr^&oUCGP9bHsZ<fC9@WE52Q|M&gVi(I>(JUG~_
z)_8XB_j|WD^*(sTu|=4XY2w=_j+b~@1Ty5A)Qi2IoL%pK`q$n{KUuCV%M#*EHNx_C
ztXVA3P_hWLr393_z`oJd5|EM60Uc02_nl$J1%;pQ|NqOM>^ocYrk_cT!va4>rirDW
z3P8&oGh`b#yQY4+w_S2m(rZag?e)8st1XngZy%Mn%f?Y?QOtVA$k5rkh)l^Mkm1Y7
z>m+Aa6JeHfLjiOSxxkbh-`aOidzo02_I_M>F^xqa!<;Ggsi@lGt!j%jH#AM`dwMBu
zV$tatE}p&og?G-PEZ5!Abin+6jq>YjYmGfKtG>Qcwf}k2|IN+K-d<iV{p;iQ-dZEL
z^6X5*<hGW!wrx(Qcd#<u({@m}R6So-*PVe;U;IXqMtt1wPg7*9gCAX)TsPPHgzV$V
zPZs$l`u+Y14{}hrtX1An^wg{J>(%hL=C`-!&wq1cqqAK7pTe7aDmU->b}L)0vNue^
zAfX|q_Uly^#kWy8D5-QyheO)E%E&$6mekZM+<*D2^P=OY&l^3BR{2l4T!&QYDKt2|
z=A1Hp`sqtcy;W^&VxFCuscc*IWrBR&4@WV*7>)CGzt`m4+;miCwq5NmpBV;@lO|1y
zT3>jFlTjbkgnY_B;hAzn!*`A;(?U-ipS}6XU0%tcn5e}3iii#S?-XRZ&ot8UYckR1
z1^2kYZE^-imRmjwy1KrfK7W1++5wn&xNT-xkF0fANyw8`p{re%XJ%h}vqFPSV9QPC
zN5|qop_eT$%j?d-m@fp%7jggIv@8jq-Bx>bfyB<UQS3&mnEzXUTlU;D8d0R(T7Tf?
z=5*iZRo~vcyy7V<x$^1#e{b(|I9Z+iz{vQW^~dz}zr(;Q3Z!%vaAy3=T+6&OExqsZ
z&bwA^C-l|Tyys8hLywPK?FGS`w}zZ=kQEA=>0)GQxieS##9hG;NsLSr<Nkceuwvq<
z*mj_8Z{?<pvz#X_!>96Eo1BQRGqZABx7*^}ukPOY>E#WGHAox^4-PZU+Ms4-bxW_{
z%?-oNdvk6YZDdu=WoKq)etJwgU&P-2UthlQLs`afCKjdGl^a0&z%!a0?(Gb!{P|gU
zQ{wz$qgjD_7e862Jy}IhX$5Ea^AMC|@7cIu!KwZ0>pvb9*UMkb=oS9-*X#A`1s9Zr
z_SbU!*u>E25nuP~i!39Hl*)pWX<@nNr<K}2^QsD)XlZV07jo=t_cTxEBvpe0{@320
zocjOgpCwPCgE!@>>e&ROMPA<E{-tZn+eb)~VvH;{Aq(>F@B4H_*x#eDaN}*=D}ocR
zx_j=bH4+v4pvcHH(eBHJms(65CUFmZ4pz?GuH(y>Zt*`g<^M^ii`Ubw&v_)3Y{;>R
zcu+FAGt6k#?c?g6?GqT5|Am}@0`Ap1Ffg7Mx$yGpwj(C<ZaPJ^Hhkw2==gFk-Tkzn
z!-A<SB`QxQzh8cGqR(@MC6C`;-sGjC>)ju|j`OmiQNX*oQ<R){xmtuJBM(A=!)v~%
zg22no{qy>i8ya>)TR~S#*C?d4o(R3Bal(4-R)xb&lB|)bhf#JcC^R&z=N9Pr@-?5~
zuRB9y6>EvFN4a-V%!WJFzFoVou7u68fy*~gjdh;m$8R71ml{kQ3Ku*Wqm!h{{myT@
zHVI`K7F;7a_%bq0H1)lKXwaY(3}<y56gJIt+$qDvvBkde%8!8U)>kL&%8N&tvj&wQ
z99x(fuXW_G^H0=MXmB{qRno&V>90EX-CZYl)LqO&Od5gJR`fe$X0FV+w<pqXzMby#
zb8}Z;{Ls+AuoKjNIe*?O!PAkUF^ZML<(k)FMizk&rH!ALKK*nlT|MRSKAY}CUhTT2
z|CcVRcIxnv5_<hQ=L>8h2&g(MQ=Kq#re?qGw;3s^saJ2V&%C_M)5F7KZmC5Fau703
zXPQ;=?B!GU)c-4$et(?cV6UlnwISu~BF7W%X(dw+H0)}gYI;6}p9vPC3``sqn+{A;
z_4W|}og514dU&U#r1U;})#1@J!8GDVqXRD}Bt1aQ(S3RaFG?2LY<;t0j%9S#@*PDE
zJ$GtT)gyOnhhO_ULwlRgtzBwM{ElCnIDtj+Z49{G2es!y9t)qGjfS#&-xTY2I~L#l
z(%GkQAq-TFdd>T-)X?D0m18qOzy80<UAs>g?@K+Xm@e9|=i4KT%lBTl9fchz1vTq|
zG}FhAAB7}5ejG8MXSO#dlW|kp_ALh2-5D6y3;sy)o;I^DcXr)f#Ut_mlGDPg1ukV<
zIXNSWH35eOH(A#0c*J#cOXg%5>#{XB*PUz?_z=qI^lRU*Coj#JIBu|>($-2jx~}Nw
zvk#iT_bqv$u=!c?a|^NA+ZJy?S{u^9&lOYka_Oeh*I_?D&;PHpIqmGE3l}a(asB)E
z@6!JI|5CqiHZm}s12y4of3z?#*{KC2r5>v*F5daZDspPeGXJ6(Hh(7T35g#2uT=Zy
zwL>|Q8&@bA<lnQoxxaq@P5b(Pf25A*T8rsMJu&jgv_5Ce#L@9#ea=2s4uuDsnOI#@
zKTYSq^u)bg;mL}76N~<DovUgwVXAh`w{FMdNG28t%&@E7m6Dcb^=9SHmC8!7y;Igi
zPPXOvv5le8<9^-0FLI3YMNgd2o~S-;*~yP@gmxdi;{E7J-$&0!&(l*^ECi=-I5F)&
zhoEwS14Cn)kb=NXp9wK+j4XTHA9%P;JX34$yXpM2S#H@kKJH@tSM*$T?w;ksTSOqO
zdvIC7a?3?QU;q3ab1kh^zVFWa3VujqWSV&I&zB5qCJvK`2knc~ebe3?np9Mrm(Vc(
zPsxh;JYH#9WzB|`j7X-)3tm`x^ZlOBeK~h_1afh6`>sEH=+Ki%-g*;f=kJRY5)!I$
zY06W&V8X~W(f9M?92S8ON{wHui=OWMZ>ttoClzef^5gX3%ey@u>`ack!aWOR3)foB
z1<DHYwO;}+em`==WwNZbfkA-ZTr1W1`oCL2x%=6<x!Rtdo@;OFylZU;2bG_vj=L=u
zbXc&ENqgIziQ(7giA3kU+3~^QXTS6=uj_paH<jl*uXn43cpuU|{~+23nwI<Y`7>yC
z-YD&i#B$T8-{0O=2W{O2U3IAz@lspui*VyHE(7t68;j<&Gcd&|e^|fX?_^TDLdx?U
z2|qutwe<m|Zb#JA?aKn1(E??)jmgKYSQWP#?ydelZKiShsd={5OSWt&;{9cosbcPW
zz?+4`rRrq!qL~~D7YZ6Ted4N2d}<i^t#;bqCw3<jKm9mg<#GIk!f!jsFeAj-4h)UA
zST=3mtZHewbKBubvu0_frlwAsI599=mQSI<VJSoKX3*e=!)_4`yLi3&zZS7(@>(0d
z=U1HP_<8n92q)i@bb~Sx6cZQtLB|RU)|Otnbm`2-9XobJy)Iy2WYJ>%aoqwmRG3i?
zPUk<W-RCq-2<PpYct8Grt3t}|>RTloh&0hSO;o}tr6cF|Hs5Lb@o~w&zMh+FoqBUq
z>ZP^O=A4|InK#=CN?C3-GAJwEKIpuJn?oT$b;8X0xOov(E`4(~H@@HV@KPVB$@)7T
z#eocr<*+fqNuYsPyI(JqFA7d_baYJ9`u6hj@}u|f$ETg0_4M7-73~fFp!)3PasTIn
z8SzXnBaePc*XF2PwxDQYhW+a5a{m`9*W=EJbbkA~<RxMaGy~IGb<E*FW#z@N;lPt?
zgl|^qKJw$JSkKVt@xHcfiwq-+49hned-c!LmY%%%sAzNe^v0S8yFzyE@t@+XYlf8Z
z9T*zhxL<Ib&<tKSBfPS5C#MS=JG=QGr#X!c{UEn~)MvQszQC3v2UGxW7P>rTO6ZJt
zEo?tQx#Prwbr0Vztp0+W@mOp;9F`{uw|rT^?i9SotHEJOxUHU4Hv`jER=fX-(PHcD
z6rWBt^yqvipzz;t^Xe}iJgeiTo`;s*;7a&{50jOafwuPPHT^4YF8ceYBvIwNm-D%;
zS9|;W&A+dD%lGcu>bEt=|4K?qF7nLK+xsQx<%NaKGPYGApFVw(S$*ZkwFfEx|NYH=
z0~%4a;1=j8`Sw7ViKAlTflK+uPtJao{3fRE%6{^HwX^w4k;5XK)?Cs^)|)JDVEc2g
z`n_%B-m0xno<E<h?e6AwO1AutV)C(`m7o21Ew^vj5D-`M(G_%}h={njcSgpFo&WBZ
z-+wDIp=5j9T;A1X0oR+ZEHP<pY&0r+6A`(iV4;jf!Gfr@v*g8fqf%}~e&(naa5$jm
zpm0g;pfwXmMXy7pYpYINaZp&^>22G0x+krW<dnSI_<!xqz#Fhe8E6)1ChMh3m!6!~
z-#<k<e^21AFE5pE-n_Y~;$xDq$(yUIr<c6CvhtesuIjwjuiyVxetvfH<KyG5%>AIQ
z#@X5Cr=#=ts?M@_wr=-3qwfXV<JR)7dU{|*;Nmk<6aN1CYHXSY8LAAr`{tV9L@Ax6
z3Jnf-nf`R|&6Dp_YG`QZoHAwF=_b+RPj>&EYF~Tx8Sl1hO@HowT`43c^B{5UQcI)|
z+@jy87rX1kpP!%KW~-FFzZY9nTzq!L!M)YruSs^4e7|E`{q4lQ+TSVX=2)h=EaG~#
z6Lbl3>FaAJbGP43d-pzXZ<}4?JlpE7eL1N=K0Ms!dr#0|K_^pKTqLN={6H3*)t`Uw
zvtU&`{;hXX{rrnl6_%9SI7K1G10FnOvQpYuwMa~M<_cAvHSbDq-L)-0+{T-B_T($Z
z1Br**I{l7bV^|_q{(9yq-4ES<*Y9mg_1^p1ecOSxJ5`wCv>%izD}7bh5n;I_`r!AY
zbyJ>SKW!JTxV|o2ZD#uFTUN{3=li@X4dau$5x#XZXLL>ctcK@{mw%f3@gn>E6M3I&
zGgapF&pY=0sJncP^6s<Wmrg90b4`b7x!>GLPft(xc5-Usk+s_5czw;=J7>=LTzq13
zm3g+Or{}X@R!qU&yTAH8Rr|B4>}^!!#-vso(EYJrHRCIvivIj^+5c?l*17z)UncO#
zSZv@de;C42<9y&X)5LurBVMR7aaeH4oL)PjzAj#k^=N4Ia-I*<FWO36iB&y>+@@Zu
zyrKSoUFFxS;b&hQnXK;b_5R-8r~iJxUvC(6DKz_zWjJ&1)#eFRy0`73C&`q*-kIg@
z{4Mi9;Pvh+r3za!KE!{|d{B62N8zWB$K_|28qKeKHnS~e+AfYCOB$}TDwP_>a4~)5
zyiuoh=KE4R&GYvAeg^E*xivxW=+ddVyj&k9|6c!AXZrWftZm0W*Jhe|&EF|-Uvhrs
zm9v)u_vxQK^uk#D;qOPr{ktNqPJLe*DN*}MY1W^mmR>nIYhG;0Jevku-C%6{^X2mS
z(?C}$rKP0AelK_)b9P;9SXkI&qiqfg-rl`iWvX}OfNW%Bq*37`m*0`v;p<EsFS5(m
z1SlyfsaRP>&8vE)dGh4Ri8E$MRNI;fI4oEOa(Q-Hqb<kdI<;olSpW(b;#kA-tdln-
zPY>6#R2EeH_vwTGF0cLPWN&3pe~Elzl$`#8%ganBZ&~~1#>T@w(bwMG<hTE`A$R-f
z^73=NJv}BjcdU+gxZZwcQKP-?yKBZ%XMgaHiJ2o~U3MnM@&5k5-=c+QTv1pemfJq9
zsfmecqFYnEz>3%ghm^NwGL8(5W<na<#diODK7IL<$7j>u=z8>UP5M9MW@ykOr#HWm
zO9zI=ZQ>F(6&qC4)Moiy=gsY1U2J+`#pU(gU0o_BCRgfC3ak6gc-tpyJ*&L@^-cW?
zCwea~b_cIibMKRxxMhpU#U<9k%X~J*zXc6A?d)TV1P#h<XW(9Q_3hz67J-b^#zmi>
zemc|s($Dckw^i#&;qBiPIBuRg-*g)^Sp?1h0kICtox}B|49=WBZG6z<c=FPvOM`-f
zlI}l!w{w<k^zyX)ySuK|t;>7i;lk_m?bX%OZ_2mNyX-3U@!_u5>n4MGEpBdYGpp7G
zU&!q&Hc9@WKEFokme_5nX}vpGmxBhKdpf?%boX@^{7}<)=FjI(S2megPKum5_1UIw
zrKgRrt-K2q?9D&^QTO0RRB^X<AK3kVU$z@t)}(1uriff@F$7)JEV<XB@>9z4clO_I
zB&T(KEk19X{%v>lJJsniO1q{l@%#Gi^Jinn{k+m<GY&k7Ex()k?Ir8owa>4taI4|q
z;hAzfZ}-_ftLCqJ`}?r`zl2-Se<kJ%IxJYm(0F2&+8a=`3EZfDG{<J|pA}E$t&W;f
z^{b=e=k|@A-}Yy0aooH^6}f+9!4Xq-Gj&t-_q@t)H`86+nX@jMilm>Pr~CMLfB6bc
zwbk1mU&$&z&&$U*&HmrV{%3OBVmb!jFIL|vJT6;w*7W*~_Yd=Ie{-JQQ~2Njqp?tk
zdq!5Y28Tkxeul;qzj{|RGBD}tY$!|b)A{qJWy-YBf39xq_WwS;5}9c*p{H2a=loMd
zNC{+2aM+%A*Jnb&^5pdN^w}=D+m`6|iC<cxw`<wsHIbX&?7nLo?tj5lUB3QLq4A}l
z$yZ)*c!nRnTea?7Y5DzITeDM-c8RJf_Uk5p*IvIzX@1?Wl{;JfPS(9x*q-v>K;yf(
zNmU#_)-V*y)_%Kqxsc^n+=4S+?RzWEdR9KX{P>$fN=in<pXa@IIh?lreY_B|vI~-~
zu4pY#mYqC#^3hO%ApfX+H9I-a_|7m`c+B*b_4SV|YontDHW_}EIbT>F&D{6**H__a
zfui^K_NsBLY&;G+pnpyD%F8D}$$3A6veIkwMQltQTN)hR?F{;P`}oUE#((GheHHuI
z`N_liB@>TiEHk}<Qtci%&0^x&tG4Xo%Uf?3rlh8xJklxrHa2o+(Na&J&kvgUXF04%
zdtdiz<#H8ub@!yCn*6Zo=W?RA+D3!=ye}hNk7=R|^_<T;&c?)|^b^z^Ud{c+w$AV0
z@5LpS#oMmby${^0oO<rbIU%Vd4!NkUl8S{5YUQAVarSI@x^DKG*TJtsigkajySdxc
zAXA!GN>VbjPgF$YM~uQJ(6~>!s*LTNz^MfxhTrDvn5;Lo-u!f;WUQ*5(g}&m$NKR#
zA6s>zx1I4hTORXyi)O85`MWtRtgJJ`o!4KUQT&yiSt{Uq;ND-g*HpZ7LpfZwO||*%
zdcd94?&ciT|1srWr%q`zeyOjwm!7L&9y9I1Vx<z4;U1gFgfA~HemW+dKO^U1W@e_4
zfPez1TrvL%DpxiL%gg8Af6gs!CG_d!_sdT_mK6(J+W1~-!4-$6ccQDSuAK0QeH=1b
z_vNp7Uq#RI)W5o-d2!-CU)`$vpn1cRkhN@^-|u`bw_X3{jABy;&|P^aUtL|TYHxr4
zjyLo3SwAw*%rMNmzuQt<s3XVEcU@~kKi3Xpk^Ku+oLR%V^P|Jl|9_@v9g5=rbnvy+
z=?m`!?X=vtBPD-_1D9FX?S5w^eB|ba#AX#0l@q$#?||;US$0$E%&#Yt{ZnpiNX%p1
zYO{AeZ{~cz<Lk6JGIvj7Q{MWn^zfsc-M9YyeP927cSb|uyE{AAUYjOsU3S7-e{TxY
z&0l*rrp_&2&e&@k&ip*S?&s1w6_0x_E%%q7oZxlcxc1{wao5dz%U@kNIrp}Cwk*@c
zv!_lT75HGwSl;&Nenq5vW$IhalUgf&ab9xuT=?n27QIV`r>fgu{JwX2*>Ok)0e8KB
z%xmy7-T!vm?K7*Z-j{a0mjCyGeY?=B5c})5?O)HD@J?*)YtP0LZEQ?;-=@cYou(71
zG;2>LX!hy(-12LoTaRr#Ht+UQZ}FM-_4`=Z!=EL-xVLvV=K;N#9RVgUg&I#tT>(u;
z`->HnYy7Lpw)L2}%2Z=nggxi)pF33grDnZ9d2S2Rv@0Xat+)qgW*QfPN~KjfPfkqy
z_F(b4oy!k;<?H0v)JECenW4E<eA>CJm3A*?O*H>s8opRhK4Yoijyf0jouxjD{??pL
z`FAsY{!RPWZR_s;xRKm{^Ly>TpU=~_yn1<g`Pp3^pi`c{yuTkmukxAX#agS}$mSDK
zCBB!}#qRD}xBthj?DZ$Vy}f<bSk}5MXYOl@tR|(s%l)p-H_4pz_uj6LUoQL4HgyJF
z**WX4zs*ON#rxHJZNsMvUYMS|vG+(xdepARm1noUox4AH*6Qyu?2Ih4R35wws1a^i
zvte0MJL`$s$-yZV=T9A-GrOeN54@@i-cXP7d~nwM{*-?Ee-WonojN1i-Q5iu6*j*u
zrQ+r3`SFy_L+x!TTPp-Mt?c(`UUJLtxWf`Z?Q5pOxvtBPi;Icfvg`6ot^4_O`qOm#
z-!pk63>^C8Y_*Q}%TM>#-x~rNm=Zp6<=5lm{pQaz3?fg*|NA6vS@L3n&wRVPEM}%R
zX3m|P+qd(V>*gid3-Yh73iWIB@XgwidRlDf-*30yE;m(;xI3lzE$;@ilC`Iwo}NBi
zm933W_Ep7-tJ^qTwn>?qJ1zLjX_BH*7tyibrnuUF{kdt^{>@XcMcSFi(D;kx+Pc{6
zCiB|g-=>1rdzo}^$_<%0Z}np3>3XqRR-e}DZWg?Loj?5e`n?u@cDJ6~Jm?`SSb5jr
zxr>8T$Cc^R-tYVE_vzE8CkNT(x0DAim(6YnSnl|``u)AVZ;zLJS=3i?#Z+mz-`uSG
z`?Ig>8OKHn?~JK_yESb;o381FnkOd&tM|T=w#o_;zOZEZa__9HRhDaBcfKlj6qemu
z3K|mI^Xt`WwSekRPdt+g|Ns4ddwKTuvfmso+qPMJcU~aNxg<UGFUzWZc`xO!6bi0k
zkDM=j9Hj`@%(Cy_uWU~rpDF);t^aRyaA~i!xs~Y#_kKCG6O*S-Rh6|aE3ta^Qa(?5
zw#u(8pU90*dvxNeFRcxJzi(4;_Zq><Z*L+ipH2-=Inp6mbTf7O&D)DQBTK%#+I-$F
z+s#!?UHx|d)olwIt#uc>^==C9?C6+qT7UnZa}G<==3jGo0-E?TzgsfdGMss0GdusZ
z7cVk?Z@rbJY-SeL#xJjD)fMjE_R7O|uGzoa_y1k%>B)Ip7Fn1I>KTFi&PYUqHsjp1
z)yj{vq~B)DHe1~&7q2zB?TFX+mI+n6*OYF_^PW=w_jSD5fwJqd<(9E=%?(ygUysYz
zn=o##{QRu5k8REB7g7tNq@--F_`I@;3S*uaRg$u#F1=*Q67?xRepG<w-#AbFdsn`H
zvb$WRi^=S5Y3K90ofJ0dUfHS6^wvc|b=yDtlAKuIUjD7Q&;wn-L+_v=<=zIiS)V?C
z&dz=R@Nm2DgrL_ygE)CUOm<HzS!*n@($Qn>;?mi>Uxd6e&AxVG?e=?FlP-qr-<P(c
z?%mGkpl;)$^BM2%>{N5~{aUr{{I(~$ec8UZ`mTOow^+&a!piR#8&W(xIwY4y-mlCp
zjA`Ctb*TLQzS`WvYDIyYYH#j{FuoVl*ciqgmzNr5J?-f~|3AmRX8%@vd2g*BY|9XM
z5^aGli%G%es;^l$w`2zQ-hN$j@B6)K|Eh0qZl-0wyP6TA{qDlk?a%Jr3NCr|)phP6
z6_XR^_mo6`f4Om5#G=(pmbk=Ky;L<8DtvULbL+PV_tmdX9GPjH?v<9d%=Tl?yY+H0
z*IJyT%HG|{+&?ev+O>xCTG!>pucJV>@QBZywl?^vX?J;Ym!D>NO!F4S>nrNkZQEaU
zQN@1OvSn<_w-;@2ONm}l?9Z|%#DRIj{Qnb_PwzWF#h7)ecva%k!_#)v@47n4`QzRx
zlhQydgJ3m8!*q@pTf$<)^Z)(%na1l8J3YWy^L2*JS*JCQYvcbs5|6ty`&s_7zOp@e
z5i#9s7$c*zO`CV#im&~86*Pt&?7RG2cH5f=4-z6brF53OymWNU<rR+JvDbr_$GooU
zj56WaUimrg=bz8#mj*BQQ#;v{cBSs^*6Th=;<d{rPMrAZ-R}3N8kyP8SeE`>l<gT;
z^YQ4noIA5VEUUVhb4Q9{i)d_c$?a{qkKVu6Z)W2)TAXD%VTH2A*0=q3zgDbWb@IvG
z8O2-w&dNx?v!hUL^KP{lKOZ#n`yBgta<cmE_4j8<vnWLe&#qQ{u#~A)HTBcWZ8<+P
zil;r9r(OKY)oIDphGSjMX-{r4P4;U)Yw&lPRM-0&b@1&Ru%KaJI;+3HapiHjY9G75
zUxFjI=gk!n5$RZ`zM?bJM0=B(hNo9n%%SPe^4I3a1iG7NRsQ{YeXi9S$#tfc6Z|G$
z_qk~G%fDM~_0O~Ub;(V2zalp$Wh;DoIz8Tu(P8ekyKAG(H`gsv+i@{P&(YEG+0S$H
zY@`4Ey1xI~F1HnN{-=L@e0+9AByZU(ja#o$FD`QRbM)n1@XDKc1-H1~ln);YjD>>S
z4a4I5w`_c##Wer!?(*47Y_|nYD=aKrRD0>$HrJ20H>daWr3;<acyiJ;czyQAFJ)Dm
z7V2;9eeeC*=Ixq4pEniVmi$>#y={(mncO8=VL1)^y=xZx$jD^>Js*@ZH8lNh|IVb-
zOV(yPy(-Cxow7sq8gu46xv;p__uj=>zm9GFaqh>l;=FZnpK3GpJn!$|yDxsf;@sJ*
z-uv{=s=l<o9=W@0?aMb)!{c6B&&^vnFKdH``=&sfa0hqsw3L(?nwJa>4Naw1HCpm&
zycWsgWwH{J{kUqejH$#*SNG6Y9;bhGUAwG#>sMBermn8(^KgE*UB!EEox9qw=9{N`
zW!C;%i*EcoljM>T{i4{P#U|##@#N<zN3R)wdb`g?)7*a5imU?AI!gJ4j3*>G`PTeu
z-oCZ{QTWyll+_6i3!buoruBt8E|o_sa%4{aaHpJ??bVjox4PJVnJnJ2I%)QyT<d3k
z0zt2LMV~K=4S#RNw0+~!ZN;WHRxNh2U1+keeBOnsTMZ0MXVn5ig7o4em8HVpo|xvm
zT)Ta}b)1c*T0~mRt&2THU%m+T^}S6)X%7ozbU9R2?fUZW?rzQL4`L8&f$j7*eE(tj
zvnIW7&Hc&RuFqHV)^EvSD}AW|TDEw&+O=!{S7Bw;g8hLv(=5TCpaH-wTTDR9_Vi2V
z?o+z(hKWUK_S`AlN)LWA&8&QWwyH1w&8dlxZ>pL~$>gNkN?*6Xm16t)mf@CTg=OG|
zBAnQ#RPeaheAZUB|L_0*-CuNCce}^)b91vxVwY!qe}8}fvAQyahK9`yjUMUzc8VAB
zSh>1Rr8IASw%Bj~y{UEQQtg8uJ3q<FetZ1m-((e~Eg!pI@7iNwEeLN4f#wACMJk@n
zOa~3fE_=Fu&nK_7winJE+a)H?%E*!>t{@P(o7Y|7LltA}_rk{qYkuCERkrtSLE{uF
z^?hc4xw*ehzgW8{<<J3%my<6YeEr)8v~-6NK26g2OawY<b*<79yu#8?iBBnkg~R2O
ztHXl1oFa4er=Jb`Q26(r&CRM64qm6S*8P5wulv<vN%oE&c>!hRwOi$#n^tX#-)_ve
z3w0*g#53VYhoG<3{K<k23%nW}Ql_#-b5yK#*vKZocEMxw>f*E2o|$JKEG~Pu$S=`o
zTl^GLCZnjNLqFfX-^xFy4Y|~Hn9Vt5>eSBpQ%?lDI|d0jEJ$Q>QIdM*n#*G2=Fr?9
zz2?E<zM4BV8u3}&c4e<6l%_`quRs2!ciNH}3H_P&ypS!Z;0lR>k!6pof~{?=-One&
zpq-abo;{o8kP;I!=gaHs{w1%<va(ifFKI1Py08p1b2?@IY~>3Eji0Y6^+&JWD!2dM
zWcAr=US2=CwWsDylIq-x4;HWcJ3~nP(uUaqs0r5LfL_6m4~dn3J|17XVFPH~Y)Sa~
zI8Z+hG=#Z+-!HFyKc7ke{9gaRT+$$+;jfIDfWv{U42>Sw_1?H1NM<>ut>rWA_4=~s
zv({XHzJ|qQU02$kYX=syDOd~Fl(-(TgU25zCKnuJ@}90Y_0pvv@G5#a+gq7l-@d)Q
z4cZhp9kgXuOef;PgY04^rhRG-3YV_Wv-q29+!&;tc?PsZ|K0Hz&+}SFZ#{bXrxyNQ
zlzM4G1Sii1qZ1ZW9;bJuzFjBt^AeZCJWY*Ki=eGDrNnbs<re#X2xOiJ-)aR3*v4m~
z78M^BWE`5cG5Pql9UmqrI;T84GZQr9?O9f~?Z~lX*H#?nV-Z*(q#zKPdQgl>SFK>#
zgFR=Wr>V6Ycg=mb@qfy~7ujde<y5A)g?DoBZV)>6<Yc<_rl-drxB8Xl%1>I<e5R^@
z@ozWJ>wOEi-Q9znJ{Uk_5e<IF`FPj<y&ngvAJ$oAO=@CbD&-dFSaZ95F^5T{gS(U6
z&$?MMCrkL8tl}b=r_@*cT@Z2d`jQ1Vel3ma<l+|KwR!d8<h_%!t7M<T&jW+B1s%LO
zeP)?>f_i(Gm-$Y9@+4*XZ4q(t)32_s_PsQ#rG;gAa*YE+<18i?rR-T7*c;PCFTA`_
z%Bq-ae%dyjRY7}=zj#^(`;Ts(_kx<?d_5BrZIx6G+^>AK?X3;cejQLwXNmGl09DV?
z--P{b6wB||ZomBE#P|F4@g|GEt%=;6^8DP~Z*DI{-cFe!0-ixz0A1-H72$BbrDS_Z
z#74KdRkoQ0Yd9U;${%cBvAYa;{VD?^OO%rX^Mv2u-WpGzXJ5bXbo8Ic^8X8Nt<QG1
z`*cFt?>A^2tdfi64>5%chnTh<F?n}KO~v8K&E5J!_V#Y}yB@pBqNcp1tn2pwt2%k+
zOwNT|3ErCudRo6HFf@9|SKTPN`kD35+LzZ^6m9=oUUWj%_Cc2M><nK=hQ?=t8^RVY
zR%meW=1h4uclrZ|@Ab2n9=krTbM4YwCrVMvK#&2A*8~z=QnEFQ`R5Ctu#DF7-hX<+
z)v!ggf_$6aKJ&>w+vSUz)dfD-H164BV_ExaOUAM{uT&Kj4y2r0w{QM=4uuCg4holU
zHv4m!crIA5!pH81U2s^At+MLUSxmRJ)Hq&F;M-l4-y6SMz2(Fb#f_%lK<kjf5d<X`
zyk+U?>Uz>D9yh^vwwb5v(boFsJ2TELa_ydDl(l=sAw8CwxCVzM=j&M+GWZ%lFMX=^
zW5<`>K9=Dz?@CVY(@ZofjhJKVWE9Moe&x@}nPJxyo+umd@=9o!?W{ic-2rxxZ$Vib
znzyD2Rs8*WJ@xUi-b<^)^(C!JR<yLXUX8dN@9xspw&_Zkw=MI!+jXD~QuEV2{cm|Z
z*!{Qi(=GAkPqu88Tax^8qJ-A=9={2Rwn}H;3GQ8#GSxJ+8o9wD%jqd_DX<^1I}B#^
z0b`cB9}n4$-~PJjE-zYN|Gk)@!tHe?E7Lqx2Zc+U=drK-sKn^&^7+$q^_0&GnU;qw
zKf)Hxc*14pn(`%={ZE=)sF-VN6cmqEOfbF|`0)Aj<dznerU~~x?#Ni$4w@kS!0z(d
z#^2#O%SBU#`#(-aExECcZ^_j&CoVATeEEsRc$eXU`I^_}eSeZ6h&<}6aG{{lbF$h=
z>-T$<K|6T-=31HlVVZ-qcV|Vsg7*JCHv2!#_*3v@&fZOJGNoBxb(4iu4{^Dntf>aA
z_Uk_Y+EsafU+t&m_J2L=K6c0Nh~b{J=B5&B>&;CSKi{8i-e3LevXJ1lvXc?#=US`p
z|9$uUlV`K@r)jU>6LjkIY0xJ6OFN6xJ9~PjygDBJ>GrDcTwGj6`sMEzGcPbQHg??~
zURcOGKQuBTLc`M1Qb=B2|KP!c@9u32eI?kDBbt_XNsh%#{?zp6|Gw|YNXv<SDJ8G8
zSzXn8{u91!u^8o@G9$0bT-)kvEM?Em&yUYOUt^iQjZIN}-~VjO+GiU+UVMAgSbR&Q
z!KN)+uGr|;=0#n)bje4d^3)W~PoL-ik69&eK6Tbl@w40heY>51`qWfy&~XJt=WV}V
zsb=S$p%=Xk+=f4S`n2)a#fuj|J!k!XO5kF*tJVJwHnXRGd~_5vB2|4?P}%Lon#j#6
zT3V;}t=Bc@aM`xh?)x_`#=o9Ntna6s*nL0k*6r2C>(hJQXxPh6b(kc%8)ceUp~2y|
z@Q>&A|23`4-fT!e%g4`Oeu{m8?KKs%eX~q=R|y2!nkd}7cF-fYeeIGZOHSl&zpLil
z#<THl*2VI_`#=jg(p(lF6Z!Jg&$8%A$C`+ZP9-9F@9*tZRaSPsSM^%A^54(rs-~t_
z_hjwvW3!uI`AiZt$t}ryYj1V=MHlZ|eb?ivec$c>|L>Mx?$y66O3_ni&#s*95a_v6
zCt{+WG=G@tlFn|9DgTXCLw}W~i7eS}>wl{o*8c{#|4c$0nk_*?IRF2g|F4qhYibkj
z=n*aI&*k>&%ahE@%WlrP_UOI$G@Xf@!fG?BUuC$Jdr#MkeX_p(?`jtpmmB_?+S-%D
z<7-2=<=zfUR|s-<epT`Yv^7a@=M$mge?LAxPW}7qYg*K<zfHM&92GY8$}?>L9@A*d
z`aJdCCKJm!fjRk4CgeT*^q}<GETP0d*EXUoo&wd1$&9g!^$iUtDx_>pj|msJ6t;C~
z(?qM%pPSFyZN7VK&+CpW$K|TeWX^xv?6>~9!zMKuDeJN|x!WVHKON?`H@UpLySsa7
z{r`VO-|v=t=j5FIs%v^;`St5B@6I}KVx!I9FPDXcg_ZaJd8&W*o%*~ACnjcTIr9s}
zGR+gJ4A0(J=em6I_0SyUqT=G>w^zT+ac<}H+@5#$&F@=Piyvy`-c5Sf@1V`GBwh5h
zuy?;lnB&#_FE0;2e!8vjn!H`zta)vqRqWtUh7b?9nZjcVTmQU{|DQEIa&vgy=74>7
zKDAAm8vgh8_MP)rvMK-nV}Dt?_9nxB2TA)kVKZxf=KMAVEq%5Uy%`2-?_Ffk-73m^
zVy;D@lT33-)c3{xc19<&L06v?`&>`|16p7v6>;U|w?0?q-dQ$j;E}%*$;bOnPScHk
z^6hs1_V9ckflGBoTX|()u2|~cFL$-iqW;az&C6$2{kvEF-ZLU%Moit$r<)2MItd@R
zlKFC85Qj_EsmTju<&-ykKVmuad)+J%k?FI|SR?+wpIKYl<s%{S*f4jABBBQkX025=
zsQQv|b6;)s+{n$Q8A}(x+_Sc3@87#(yiR8A?QEV~=U!!=DAjZ2)7|p>Gmq%;+x<vr
z&R-t6v~<Z5ws%`z>|VEgN9pUZ-(S*>cfZQ;@^zRzZ(iPfwY`al**2%GsPmt-`-O*}
z?9Y|iF?>=cEAE}P|8l{3(d9#>THE)%e&KcY+q#>FY?lgje3_!|Xl>&JS}OKbUw(<_
z#h<5IQ=FUsJpFz-IJMyVs;`nZix!$d&a!~lR0~2`o}Hbo{`>oT^Y2;tk(=H5cLrX|
zt-QRrd7_n4(U}SJchy{*CHi}6c%0x_p4ywK(|4{3zJAUy`Phx-2~qh!K0H(tSb2G7
z?rR;ZdF#KL3j924et*VRiLW!*l-T*@bY|V%wX>T|#I$-FTjc8g3niucyc7QYc-%i}
z%9NC4$=MUaCSSGraDaJ{W4ONti<0d_%?oW|!Wz1(CxqVKoO-u^=cIX|mOa+cnWUB#
z4nJQXKmKG-sJnMaM8lusXVzUZUinE~dF?e1<ZYIq{Qkg@>GE>_>1WQIvAX?uZRF<l
zd;k0wtTo+sWxHQWQcU?w+u}x-ma8$v8#jJ0vGHGi=Jl;U(7n=+-?`=AZtDE`^QYeW
zg|AJs9w|jD1ToiJnf_L{|Jix^m+#G=2ifIM>?(cjbN|=Z*WvG%Zqc>+71+G#`@QP*
zk&A<xC(Zifc74s2hFxlJGhaI?Y+5^?;d{O*WBAGRFVBAai_MxoKP2LR=11YPJ%8iv
z->PYDR7~UF56LZ%hARUT$B$(VY-JkjSWOPBXgt>X{(n@7uE+69mmE*T?k+ny%QPEw
zyN#f)#uXV?_lT^EUlp>ot+a|RE^;mU@gec&zu)gwRaB0!{Lfl_f5zYJ>+7a&zgOjL
z!clkD^!kp{PEqYJ4_DXLGxKb3&(m;co-xZc`u6Vh^K!;Tm)CZ0O;CM4)jaxxTZ~lW
zHjxVxC-_IbwzEn*u<qVGE^UUDs)|M)|4NF>n<iXs`~lvU4R^9a!m?AZN+P|MHt0&M
zY;=##e5sJ)>Df86Xw70_b-y_oyK|fGm%qQKo0^*X?en(W+iBZ&m%L26A6}b$WksM`
z=Gk9gU!UEQ!y9tjC@g$^^!@a`+u8VKyZydidwFHn%-_?Z^9pUAY>E9F6YIZe&z_i^
zgCWtWvWBaU3cERHSxX46<eE~Zzu@x5{*<tP&sOi=TxXOR(4*qE{cpk3UAIpL!kS0W
zmf1BS#2U$q^X5hh&wgRm1lqmvVoGeho|=SZa-+__58vA!zI*Av{YFX7-h;>G>vce#
zz}4&b-BOu$v9_+R&M4tP0~_m|vNtypjZ*yQT3u!N0J=B+<&~9_d8EyJ^j~huV4Bgb
zzwd_1#EU+6%kLDr_g3vXwj_CjmA1CG$%&Q0KTKctYzt-XEPi%IkhjY2*Ner^q;`qD
z{CwU%f1f{SY2y0*|8CXgp1rZwF+g|SxvOTizu#{EWdHxOy_&`BIdgQRGD5XujW_LE
zbNie0)(>orC&bvEeVV7ZAlqqIw3)otg!z4+-rBp|*}4dNBsjR7;!wD7kJV(sl18Ok
ze;*%{n;V&#nSB*}m|dYe$Y&+^S8rdjx?WH=>1pHqy)ofa)2!2?HwQDf_qkqoy3#OP
zccXXhdr<A+y4=zJ=ab3LjH=$Pum79<`)A+vvO9A2b$fDdZShP>PLA~}zqaxMJD<#k
z`HLcVd|k?TqLo|RtD<6uB<D(HiPHINUs&}^rP$Q|+Op@vA?|H=pT+)O#27S}Yu#dv
z)$^;5iiXd4|H56qHf7)BZIewMDu2J-Zm!{wZM|Lf-rqHrkJ5ND=G)aqJ^FRF?Cjp^
z@3XQitE^|QJsh*blj-Vy{c@Y_x94&0-pAd}_VZ-+_wVc1OC7&G(c$ZRZ|hf5v6+gD
z`;2v2Zu{w<{=Rgs-3_r<V)v(uHRUd!{`B`HKlvQ)GH+(RsC9cjd3`>o|Bf>w;N|A?
zc9Y}(z6xLTn%Ro2?;CVAYRUV1ckNc4-Mczy^-|W7Uu6LS6aH52{FO6%-5O=FQfnil
zOK;O&el3}@XrELxXp{QSzWbWx>qBqvlv;9SL1kdz#FJCjIu`qDY_s1Sp?pbr9$PNT
z01`OS_KRGYm<wIAdaF5VTidHIH)k5B&vH?al2}yH*T5zw%UrY0?sk;4y!`zI3QOiK
zzn<+S5VU@wqtkJ-S9ayzxzAsHHTk{W@A$VV3QLmbbGTS#ZMd7q8uZxt?z?E`SG#Hh
zk@pCLvU9~!hqAJ5FRH4yPQ7v^#CWcmvhw0>T5sGL8o5F9_gX(%4(zDAnD>3NV(Hy|
z8lq@DzCA$-s;aJh@^&%Vw=biuTIF#0<okiMQJdYRd)?oN_?PnplqR<wxfb3F+I0si
zvq9E_ib6XjgOn2jlRsAc{PZ-a_80Pc)yXbL+&x~XG4+al=n>VHzFXtxvY?JJcEwlu
z)&3DDvrg%Ul*vxG0_&N*e*E=*rxXXsOa$@PH{sQlm1@qPX6NtIoHa4R-6Km#WNz2m
zo4uy9Kdy<~d@FkUOMWI@B?pB~t`R#|sB`YwYUh0I{n^d4LL?JpZfXZ@IzJ7xmnC!A
zI@k#b9{yEDTTu2P31n0=`g(kNvAF-#s?gObXJ?rfeR$w#Y-FURbxLL9&X>z(yIk*F
zqR`;*mx)E`wfUkpaqgO(+V0cprf0rCxYarN>Aclh@hLarCh~&Q0TQ9dfwF2f>sksI
z6NiaUgQ=4AGuK>wA&a7APH{1%ckVq(ysP|VowoH&`^`wp^TFZVpxyZRc>n21s@_j-
zY)m%gdmWM!El~9L*H`e+kEf?+Z`B*b;K*`Wjwd2vC-$37^?ccys<``D`-%TEZ{3XA
z-TYPl_QA(XxuIcu!KJb3P)_BywUN)3-iGuc(;LO(DjY%MW}Urjt!HKy6>VA*vopx<
z&j;t{+@RgTF<b&2B_|L0<%?--n{-L%W`tV0{vQV|Eggq{28+8}SlKIzw`V}_LgCo5
z(V?32UZ%YmsK+#I<MBNuvlCLJ>v!(3W#Xuq0^00()@s76CCi-K`AWB~b?=umDtQs`
z^HI0{t2M_RSp-&yC<vT1UwD^u&xe<VmMeE=t`W+pJzQU2EAH8m^tR7Sunuxc8bjkT
zjxEz4%v~$L{JhLI;}>QJJ*?S5Yh@c`tV&L3e0hESyl(Hkz17}nY0I8Gf4)0(z88Gc
z)7uU2-$!?5?lY9!q-|}UowVu8>zMEU8*V8w$2vi)pEQvS{e#xwe>WHk_H6O|06L4I
zW9yRe)D<cQ7xw<yx9!)_qenj|HaOUVQU>Fr4c|F(?561F*VW#-_u%xdpC?0`U&Wn2
z95)l5G7hwYg5~N}{^;$TZnsoGw|2*igBCF;-q@VpA1%VpFE?ev1cA=}{_@p!Qw2Vx
zGJZewd!LTW{k={PQv5n~A_{%9^tNnspEKV_(qYbBZ8^DK$hjj2oLTSi-rKw5OWn`y
zC+jCII3QpdAC<DV>+I?+YmQXuPYn8-lRJHyX!QEeL1AH8d#6XdzgAYc^6RDA)MvKV
z>d{(Sr&1m-EYRHEH+A}S@10+F?%8wZ*81B|pH)1qySr_#me1a<F7Efw_MA$ts{40S
zr+EFZ6{Zq9e;mGln%R7ROnhh`XuR-kn1ZURD`@BZ-12)96`k8Wf`Wq9*52J!x*D{_
zp+su?eEE}s*{zQln8ZON;GrL?8kMvy&t5*=e`@EWQzAEIm6@MTdnhX8(3Z2lep?AN
z5}pZMP>4JE)9H1n%F*ZNJv&8p*8ExXJLfm|+69SMx4rwH_&@6PdvS5GdFvJ{&b*oV
zX}kG*5&PHn{kp#{NAc&)JHG3p0gJ!~PsX`fwfAekpS-iP_~}J=`Kc!-tDl}>n5?3x
z=vcC=%+s@Tj#a6b-S0QXp!?xwo&r_jzn6&4bz88IiA70T%dNIw_{aY>PfXl5Yh8cD
z!S%uTWTsbfe^rcirT}Er#8>o!U{&|@|My~^y?g2J?Go`jy2-_zLu`76!-tsE3m3RJ
z#HPO}OT7@V-P9xE=gn>L-!mtCbdu#YyR~g?_REgLZd1!d_N@M}dX9Ne{00-lb-VA>
z{=MA$=n?2X&jq%eJTevmY3JwZg7)?5#O}JXXG{IVhYyRsy@{+2H(mV=bTZ?%mv_D~
z=O{EZcr!9h)Qi0FQkO|S_f(OWpYiWkDKBS=s8tv5UCO>i7}BBm&a%p1_?ph~&FOj{
zIue%nx$0?IMoSuOx!3LU-~yM>t#5Pp7x*-Hi#K&WyBp`v+%@&Ml&ncf|3=5HcX;nb
z7JppxTtHc|QC7u5<I1c>Yu6`m@^Eb2&mJ|unW;%tLE*%$^~amelr_{ZFzt5U&b;Qk
z!%2&|nX!5fR?ADax!quy6=?SFT6+C|hV1?Oe?;rsu3KDM!nHu|^54+odT%!O-G2S5
z^4ibVqdzyL99=wV=Hp-N+oW2)OnD#DEGIHm(1D>*OlZfWF71>jCnj!6I?82P@StIi
zP35JO<L_>4TwL<%il^SL7fLgYQoCGST($&o@6cg->)+sz^1FJO-Q~rxFVj;`?h5|)
z&reQDJDjIuV|^O*T-I+&0k#|~|87zh%k+BSab5TdLqcF-W2NY{kbT(!8&BlCu70|W
zO|-i!cfRR{h@ER0U1OUsOzviT*|hdSLP5Zc%GMd>e`6#qOnx(eo$+q>hWl6eO>3k7
z-c34ra{Vvs_T>24))m{$GuH2{nQvDslYd#~_C-O?qW8V$yV*8={rxy%)^7Q}>)^?`
z4{40DA1faBnpYKzXIL}Ifd&N^%dz(shJ&_E{(OD><u!Xgt@AG?%czydT|9aBGIXb5
z!*z}wTu!&7^10panZDIet96P!{~;!Do=B8_?e+6kT<bQRsET|qRbVn-e^0i-#zXU7
zoh`e%t@gTL-M5Cs0``jw5<A#<n!m<2w@&??^IkD*?x|l>8IPQ@>SH`^Fxh39=H6G=
zYfE->-g{Y6#~WwOrp)PN_Vo6_ov>;}fRSk;@5M#y+&QL1UUcVmdNyyhOs(KuMF+WA
z)3SUElUU38D;yx*+65<>W`*ut@S$hUCbzYFw?ET7dDcGmwW+DZ&nwyHGar9l`#=1(
z>#Pcg<x<%j0-Bo^9(;Ih_r8+o=9X=>QVwg@JpLh<b9LpP7|DVwXD-hRyA}Q6+?VuY
zOp|4!g>Sr=HQ{aH-a!A~au?;G)iL-qpaZX2{{4Kad9!%Wg)Py-$^X-`RvmF=sf@MH
zFaTxYhJ3CUB`^LIM^2hs?sP6ff9|K*!3C#Sq>Im|dBiy`o1=Sb<&i?;$SyVoY3oga
z?!s+s?j8{yPrbK0J0Ci0$E(#A^*i^V>+$ln!a_^F9$NdA_xAsI&D+r*^cFd<vH7rh
zdhKU(#l6s#SdC`F8UO3EbBv?%?g%kSe|vUPJ^I`Y{o30%TqGw*<^4ay267Pt(^<s}
zGB;PA);^`Gtscua_m0L**5glpH~&=g>`>#n_(bn)tjR;qpd9m;0#dq(3j?q1{>s(4
zW!u{6`=Zxh;C?^V(f##iQI{(!Y9ilRIPUFy?gF26USP(^G;!<64fh|j^refR=AJLN
zeS3DwdXJfQix&Si234U9OdKZd4qr_r@1FEq>v+89jq;?rSMHwndv900oj5s?T}rm#
z$`h@JVPek;v{zK9{co9LA0Lu_J>v0tKRG_c(GC?I42>TAl>#P<^BNz0erojpaEa!o
zds|Do_$K{UTYjZh$Q{xy%~;^@Rbk1zJa3N2Gv-DKA6zo`PUhaa4RO1lyjU5l_Iu0j
z?Uyfh7GBg85}&GMIMGu`IB~C%u&R|!;G#p;U445t_lA^QRXhG$przzW0%ErCz+_eq
zm#R;f7v`2VPPemGbl<GCd?RbLXQte)ech&adse2DDL}SL&C&@7Kj7ayvA+Iu-ph$b
zA${p@jDy$Q-MNrWRN2|uGsh+UW&Onh&yKfRvdO!mE-zEQYkBud;Z%*IWk!x3vsvDQ
zv%p&2fVeze$4OID|2{Yq|LD=9Bj?vYJn0M?&j!t#g+~9*{oV=MBb1f3_tv>|dnS%8
zeGH8!t`$Dh^A(8Ls~o-W&fM(%hxFCdyuY^ufajn<wP407hge6C+gm@MPdmA-cK*!%
zb(@0S%Q~j(dHz*3-8jE;smeFQnH}HX-OWDt^78Wjw?Vvh<)S?*95)l({2agrurc!T
z?E8MNdQ;Wctdr-@n}_%G^nf<9Iv?wie0)t7G}!_=HFBzU_^BhE!k``bD+}Wi6Bq9J
z@u+)K?e8*8J-ulcE(8?+-Ti*wZB2!jd3&YI6WEzJwsbNyo-j*%zU&>Bj8&{g_w_kj
z!si<pxP5Vj%oQ!LWa;uc7xmimpGN-rDyL6tdaiyIjV^n|@ZZ7H^M!J(HSd(Xxok7b
z=O*2qv~+K3Zl0(1I`9Sb7mAoNGc!ReR8IAp-_!WzyzR}KoX9;D8#$%Ey}IgcRr)IA
z`PuR}Hx%{vewoC=!U7s8sSLGu{C<A6xqqL$y`EIXn~RIvL7N>xgVn|NV$1KQ`W0@E
z`}+E`BqPf$zXpet+c%4!SFxNEn|kt3|D~rjk*zClu1)Uv^Jvws{{gF?Pm%%W)enh{
zn?40u&a6DJ=6S`JD|w!qua#b5F<$mU-Zbx=hW8euVEc;GNt`?!d8NLa%(h!unuA+p
zE7UF^7OMWUys@{s{N&lQQ(L*kyUsDK&==U5a#CofL1L57Y%||?dp@7b3Sa+cNBViW
zo7?l}pP6aweymS6yX;jhzpRzY>uYN#gI4q3xqr7xFaMAqi$DhGgpJ%o=X~!9R@^%^
zq1NjAo|U&0Z^YMSujQ7MdGY?-O6Z*_4(FakzUGcTcx-W)ktDB`-1!^YOH)<#QnmhQ
z)xUU}b!zKl&TTI*<O;Tw<gi0e6xlMhp)cji^yG^ZJEIOAIwVuR`%c}XPIVQ74etVu
zwDC%xnKk)vJAe7EV;d3=KiU0$pD?cjpPWs^owd(P1nm?W9A<M}`MZ0+@9by4o^30g
z79*dUUo99>z97adN<aGNNrj1fF1N3pp4(sjz9#-o@uIM$4EM$Naq@~ju)Z9yaoXzm
zpeT)*JKI&1zc2XetW#^R;Ho<Hb=cL?aC`fD?TJ3CR9wDqFbXT5bT@OpciqC*nzsxE
zHH`{SG#C9@Ay*!|d|ma&+Lhkz$yZr_><bZpSRBh#6aVVc!w7F~Q0s1*e!LzhC#O-#
ziwjlx;qd}N`k*c8v*s+TN-)-3StKbU+jw(A)iR^~3JneJ92Kz&mz1w$xO8*L*aa)D
z{uaWjc>K$U$&Dv_T5<wQ^gx|~iir-ct~*o2Wy}w{30Iu4)UZtVkFZ@K(;FBbuH^K1
z?Ska<-0S6p<gcF1>?&RVBydyG<I9thWAAUw5csr9aR2lT4>XS7%>lKYITRjDX8Qg8
z{dCZLg-PI<latk#mcPGO1X&$wF6s)|^yCZO^kll#c1}M7(^>TgrHv<+rOe5(Gh25h
zh{-bD`{~TB>`VU~+OPV1S<A`4mv?(N?4QkD9-A@a?ear4@lmflx2}KvsWvnI{ASat
z!{y6Nr>uTgxXr-*lHa>6`}^kI(^Y-Wy;|$aCQ&IF#g(3amt<dJ(4M{Z>noE3DI3=<
z-Bnw@K2HDCq3`v&%g@W0{m!|((KOO0nd|=aV=I2Xv#g1)`F_)U+4Gussm0H3KhO9y
z{h7wbjT;wTUS>M`>&3<Hsi&vue)@9R|8#!+?`UJAO)I}&ICCd8HPuw_@%wm7hoj%#
z<?WRcPXZMyGeKLPZu@jeZ{OjtQ?xc_gVJ58t3g@sL`B6E_RpMk>w!W_xA_!l@NmJF
z84i_|Gv}PK%3zhPpP;Pv<41GKQ@PdO>;Ba-UeesRoYSn#S1RM4aMG?>UzfhJ-5JHY
zDL9<@A#@eORhE)lUwR~s-&C6lf1B)Ym$@n3{?CWQ-~RUA?SSl!n!jGzV5^I}`|NVi
zZoEHD3`}y04hol)<(PW|8n^F1IYGW}p0R}0zmM0imrmQ!q40TTJa`)W)^dl$!hMo2
zE1n$Tvn+bVURb^*Ii$k<<*k!k7E#KwU-uR}#dGp;<(jE%3O1Kk6$ke^KQJ=-%1oXy
zBf}`x+`SyJKWfXX^WTNlOEkqMLN`dwJcZ(t8$}xNpdpF&9WOtzNM6!C^bgYOZ2YD;
zVRF3}pX~j#IH?+&(q{pCWw}4_Pde9G>w6%uxzFmVmD;AFjlZh=mw^v|1l9Vh8~ob0
z`Sxy$jbLu8tgM_gXHL%T)O+6E-mb6N+1ah%u7BU0c06u--rStKyF%T1rBc`bd%OMq
zEQOTyaeL3$f%a}40PSDd391_ESxgj+-|w;6y(sI}-3xgSiw>twwSVZu4(fv(*v-1>
zv)`$M$<a>^Y&`ocmU-gWsV_QQgiGFB%bZZ@@A)EGbxLAOO>LfxJE#(KSYXO>ul9Q^
zXgab-+T1TFD9A<lSj~rn>}g*fJvljf?yL_tlKW?BUOR95eNOHFh0g6h7cOm6*4Fk0
zjbb;=2CdpWy(*^Yr0SyA0eW$JZq!`MxhZXyW6*eV_q$!E_kHQw{Wa%1=rogCaSaYB
zx9yqd=Q(CZw*L9<?!I)v4kPcf8kYq&3BD)4eb0_4lA7<f<TL0*4|YzGIj5)neJP##
z|Dtb^Lha_1=iz<}SFP>bwJq7pDgWg(n;oB0S>+ci3uUc7R|jp6W+XSB*4yn<_WqtO
z=y08okdQRV-tO+nH#et)R$I=ETApoX<+t`)bGMl8BxZKL8?RrkaIgIt`JXLjN5R6D
z_V(F=Q|kXbmOpDNrW29yZt?dWkNd2j%*tN3asFy$-McH(?HfU-FBLN~P0anrQL~$I
zeQjmXxA|H|9E@R1TkiXKPhDZKZ`!`UYZrXyP<Y_W^xV7qtjX)WnfD_P9`6lXG;>vb
z#Ew_)1pzZ&cpQJH>AbZ1lR$Rw@qcG`ZCkv$dK2gn8c@4pmj8n2?RjcHmS5hudGlsh
z;bSf?S7O3m-`JSEDBJ4XEYs63pY_}S+j05%ExQ-9CP#(8U(Dz$tN3!&j_C7OcfN6E
zXuKw_@aXcdXLmj}9r$It^V9z5&2Qzl_j^yWJ1P5S{!Ne-0v~)Dd)}DbEKX_8_z<`}
zcKWobS8iQca3DbYg@sF1={}dLrF@&+?7vN9sQ>pXP+Ni>ob?1g2r<gOjHvbXIKE6j
zeqRh5pNxjEnoq%<yAN{r`hN|ax=!y=o^AMZkWZrg8|pc?%rh-760oRS77-T{Y8sm#
z^4?=+k>?&~UdTpt8`lME)?AVLx+AnqK2G00YW<o!t4eEEZx3wlnHBJCk)HCCMOPk9
znsp<diRs5{w^DUGNSS_N9&3(gR>>|i(12rs$b)#cKB=7TT@D|A7R~%0xJxAReU#Nv
zmeYGD2Sq)-cZUUZq)I4gU@mgcpYO|lm;2X8DIJRO&)@V@WcnQA#d76xG3k5jm0eZS
zbKA4_s2?etY!|C<x?b+ul<c{6@WnazMM2yDe!ts&zMS!eB@@RLEeC~7VN!fsrX28|
zKX=07$fM6b9b~Ng6rCM=f=`iAx72zaXxjb9o(9AMhm9BB-ZU1!!r>++Dt_XebNtD^
zzu77Ax4s93)!kb<mrbfVT3POQnRF_vy#C}FCsd|?MLp__!vZu`cqL)?QC852Li**;
zZ@vHA-FfnouHqF~x%5nQg<Q*()!7c0#CmwPT`Ra#`a%2VuJWmGtXCa89yFb|qt|EJ
zKigv-|KBZM>i)c2)j;7ysx8uyaiF4qE9fXV-?qPJ^$H%OEClUwsJqL_oa_Qw7SlLQ
zut2nB%U#driT?jThZ(=xxaCUerkPXv_NF?VFEqMPrCPq{M41+(<qmGXb0{=8EN0<w
zG3)A`ETt6?5R!JSRY!NV!SXVHj*0OxS642azR(WTF>9F31X_SLU1Qs|+BF;gU4E4Q
zcR8pf&a*G0>FchbM~fo%UtjP6e$^sqwA`edq47jo;uED(&XACh6HTJWRgCu+t=-6{
z`0v`T39%{`7xu5aYyrNX>H-U+uTOHc@TPUAGZ>5v3?kI}c6hga+j)!2PVIW=++>(r
z!2`q&i&;5b%x3io-xaM$cW%qEjY(Kv_y5VcNhztPmVp9^W6K<e%$cuWUR(EWhRAhi
zwVoY!uPT011i1+;4I<8}IVfzpsj+i{cB5|lr>A#$XMS@wb~|>uBW~ii^N?e3Oy)aO
zy6${qyUFode!Q0Yc^MP&ZN59#z18b1y!-Us>-p>68vKUz<iOb$bhL`Fg22t3DKRT{
z9e8<1$XNCEw)%qW1v^tq7QI!51o~N(fQUKz_uv1DFnd!Gf9{E_dH7X^CF}mL_<vQb
z=ZeCUH#50alytVuj5?GG$<{EVZ-LGr$~!z!jRUml-&kI5>gJ<QpJ{y*Z2a_K%DG4H
z<7e_L<edHtd=yqAH<MJ!pRCu`n+m@l4=UPs;iPMG|KHvH(-zjMpL~9Qe^l~bkERKJ
zF(^k&HHHZ&2;Ag4v9F@Lb+!MAhdoJ`zaC()|M~W7tcq68`q}z*;xCMuI863C+&cMx
z|6c3H{zW$O7XO~8GzxGCIOIJMakLZ_6mby<4EV53E8*&@&@EwqS6{7Kuy*RIwOyeX
zgSLhRI38#|yhujtL1T>4beW02x!h0G{`p?{l4rN~rkQtDX4}@SpTD7akMZYy_a)2C
z{qH??kK9tzwdP-C<CGn{l6NnEBDHmC`10<h<<kYf9Wl<G{dK~1JDF^DWlpDE-5XJ6
zd=CmK7>Ve-)Yx@yjXd9pL-YA=n(ixfNY1=%aWgI*d@#m=dPdp*AD5qvKXoW|a_Z}K
zq3UxM6#kw3^v&h<Q`W7UxnB5DcEy|P>#lE)`PJm}>xEsR=@gS>r%ST8n>!#UjYDfS
zjwXi26AB9MmsPLjou9T{?A@l-HF3{(71fC!liTbFzWV!*$O-)uQ{P{&d-ba6@4Pqm
zTmH5zzHRzm_3y4&-M7(m3J=+R=hZa5{N&u~xbpi)j6j(UoXkOlKnNq#M8~InZ@Ohq
zXiZ4B|L5BE@4EMf+{G$Cx2`r-0i9s#aG<{N&K{lXZ>|SFJuUj)v+P}BzwnWx$96~A
z@lC3WT|em<@2!eA$)NHWnwA(@1UNz&nI<l*N<XwFhSkdQ?3wr{0c8_4E3=B`NQxUN
z+L@inaw-IkIldCTuwe1Fx+@APd3Dp=6HERaH@1#fs`cCL6O?WG;l^>)rSJl;m{^pY
z|MInZ{!}}6TT{CH`K(K?j@<YjbI0e^bw7^Dmx6sjM`rwD-L%R0EQ?8ZxUY30+ncJD
zzDx42YcGAS>8xtlXjs1be_kLHG<d--=5T3nNKwd=dF-`Ly$yC2fZ~G5m(Ro(*A&gV
z_*dF{dD>Q+PaB#*K^Cy<z{54Qn;x|PKVfcvZc5W3n|_~{rO_uE=3SqicVpwmLb=}&
zke)iYg~h<ga>%#AA!WzijRM;5SM}&r79ae0GV@pYDrM(g*SI$Z1<9}oI4FE!;gh?m
z`+0x8`@Y!E8?$rnGW9dP;<>?Gbx$Go7T<&$5^Xy^97se7<U?T%4k<V8?RusEV_oyl
zPk)ZzUb5p!MC2_qziG4C=Y{-bUCaV1eL1*gEO*84`|&R~a#z(ePR0|<Udle%6KC$R
z{Mug?wPU8|Si!LjbF4sz0wdEz!4l)<$f<AkC{?DpwWU0jovpMxZf(WR{0QU3qFD*|
zSl6{OFg;W$FnK;fC*oV*3yBH$VmCya*oB^ZZRusT%}RUDDwjx<qKk1q3x~_EqoT1h
zxx2ldY@WLAr0_MlNx8rKeO)fEshjlW?F23DZE{m{*+21mIK}kbG2gRu$x;JL-x6EJ
zD`Jc+b2y$nO`q+VA@=XXJI=`$wq)FiWSjppJM;FQ<&%Raf}6f@4{&5NGEGdZ{k>}4
z2lh=|PhP&1+?2Zh`4LX(@~0jDI{vJ;-*)6gZu4vp>G172LZIAmps;b#BB#h#vl^a#
z&i}6(X*u(F`HpF`mTWI)Rmfk&x}=>;8@YZEc*(?~r2LnUJ-|Mf^XGGZ<CNES=M|Pb
zUs>{IlaS=S#rwXzjW}K`o(&3o5$-8drkps%`#I&@q|TxTANcq?+rCE4WJq~#_Pi=5
z9VI>mI@lPQCSEL<{&&sdvg6-mTekQ~D1QyAXwl&X-89#zYaM<{J>G9ZeA)Vs2Ug6!
z6mYJ*^x(UDg&dm`s!u@DCaea!sNx`^IqTiF!@FM1nBaGL`fI+^7v6oHo2D+$#GxQC
zk?A*I-sGFz@e{Aw>wj1ge|AZT<b}soman%=6q29*Vq-r_3FM$~i-p6*?Y3-rKzw$R
z6no@b&zw0=R6)nZ31l+u{OKN>?66NWer-j3R~Pr&SD6<+zPY@<fK_q*<Rwy?-^#>L
ztC<Wj1p&#k<@0xen{zBG3m!Y<-T1h4&-RRCoWd7Na_jfST=;E1Y1%D|1;xeCX&`9e
z3#<f%``2?}3*yecQvaKu_U4oSqDoItFq?3uy!jQFrdJ#FP5$1az_(%Qr4ze<_f1Xf
zwZaHxhX*ql8a?K<2($d!nRf8r4(;bHZ<pp?*aMmrQjlWldnRM_*r9Isv*i9)*9v`I
zjJKT6E!wqO6;c+$6Pd$;97d*zskdF;&U0M8^yHcM-%kEp^Z4=Hscjdv_O@ljffAO$
zNv2!8zi*q$?`)c|-mC0g;_g+28#yoCH)VUW^X~eoM_8iTZyV@<8VgV#HZU-yatL(j
zFsscnUw`Jrq%(_I|0{QBPIYRYz#nt#kSTZ0%irF%9lang&)|G>Z-3;nx{p06Z=&7?
zeiC~byR`gx_LAQ(Yi+h|2A5Q@)WD$-u#KVd#HQRuMdz2@wS<)v4IAscny#!A)wkw*
zBE>H&9JD(*+uNgQLg3GifJ~M}P74+o_}l$|ryIH9jjX1g-lo?v`dd4B?4Rp(p3P6l
zPX<?Wi10Wt6SQN<FK}Y^`Gqw<KY!slsjXx9HFw4=1^>9aQLlC}O#}yU6pPvW2u1lb
z#lCLE8M9-b?zmBLnKycOlKPSB6TZH_e)~7LN<&IB1!@j0Cuas9d4B4Y?j-x#8H(+j
z`nUe^Tq&r{-<#nmVD#v{ji?I)qqo9-h3h@cKfj*hU*r31>s8O?Cr>bb_dHy+7Be&+
z%x7ry_`gTVsJt$5<DXQwwl^ovn1A&y=>1*sUsZRB=Uyqn$at+*(4JN9oLm2zGg&Ji
zeBi4N4@&CdvHflK@@nRcBS#G6*6|*O_3t5ZD6oK`@dU#|rKcMnJrer)d-?6uyL~dj
zs((X&pW~kGb$pqr^3tv=plLCU-~}62I6Tv-^xgL-v1`hXf187jht;N}{Qs?D+PYCe
zR~VGvLEU*s@HTdF33RMkkuXF4|1t61Pj1iezp+)~>i&se@}_64-wcXnmsJPW{hgii
z>5h8J^?&o<YN=gcp?mmO@6>m)?Kf_thv*6!My82VA4^P2pSi1Kea$wb%X+^*%=?;}
zvHjOKE6{QVhaKE0Pg71UnfZNYR*$4zT+pP;XFfd&z5L{{tG;JoVPovkZ@TBEoMyLE
zSh+QWHFNO>kP{$50AhtKVrV?!b%bYmaP2;;;AJ&?uj>`<?<;*0UMqd;H8{CH)LY<q
z;<}xTb~Rs)Vd%xDf#QE7(`x^&TJx`RU+mr=J6v|Ic%T1tjh^z`T(EjX_TUKF$Iy7<
zlsWHD<GTGXJNA6LKex=%KReJnPx?;FNr@amF#!jKJFI(}Cq&8fdf5Fw_jQ?QN{`I!
znq{8NWkqLM`#r0ox(n7DJ%tQ^K*E=i#R)VzapL}>Q@Rg!$=(EIkRzt<y`F2O)lR-|
zH=SH@-RCAa^$M|gaXUqQ)zZ^5>9#WTl@I4W(f#Y*!>a$@TgpD892dx;5YWoRqO@AT
z{EFY+-1>QcQmfjYh|6|6nXQ_vz#n(ZX_D|`r?o4lfT}JIj|1TXm#h|UYxD8-oZgt;
zqsWoD@B^xGERG6h9M>NRDJpDuU(je{nY%jWsp#xWS5``@*Gt?CdUZ`nOqOYTyOKhK
zgDU5XBPQ2oOxWjFX_39&=hurHDrWmWZG??5K=amuPb?fRVe?W?%zNqKw~*6G?u6Af
zRYOh1FgdA<PEyyGS|^>jXTk;UJb@w=5xp)m7#dG->|S{9>PcOVY4-Iq6s?UupVgD)
z{`Aj#miOznllLMcL7{snF5%3FkCzS{JYvlIdg~;^!^hfdYgd9=Pzdt`K!@2Mewp_(
z@|x52hza#`e|G2GnVa2r<z>b(zD%vTv#)>p?2`gE%~`?D%<)mu<JjPffAZbd1$C`;
zJQ3}-M?v#s=F&H*!k~H_VYWjks2i(wGs`Z&(6e)oMfL7AXDqU&KUvnO?)m=PN@y}y
z;S|}KcI4mpHSQ_j|M@P9TFR=->Ew1vcDWu>f>RL4V`5P{{I<_h=e@oCebw&k^4p5z
zud2tg&2@V%FWth*BG6&c`114o$-TGt8GpSrb7TA0-QFf2GE|!;Ok-J(Y*K^6R}O>J
zqOUu`UxupJZ*_mR?#!0;g^Aazif+z)33byFPMv7$=zX!DC&sRIOuwg6>%ZS=*EZ|_
zH{RS>w^6gi$75IWZ5Omm;V7;kAX)Nh)!qloPk%eTCI8z^@t4;(_Vv8Ge*)4Q=`d;B
zJ5$oA_F!?@)?HiWb(pJrjb1~$1lzxFM8pS}6;R7ma(12FZ?FBInoQZB#&eh5e*X5J
zm22Mq1)WEZyf85ZXN6BJUNMg!`u%<+c~bv`;Z*PSx1HR0c9?(C^6G`AFi7TV<PcC0
zkYqFuT>athdG{ys#pO4)zPzCl`EKWqnc3eWnkJZWadRjL6f)gk_cOxmeMI6bQE6%Q
z>pYb)Lc)`j*UbyzKoo?GECL-Ypw?-D`1KrXt@HJpe7n5+LYJjBOMN=9R9D4t-fd~d
z?bEds8XP2<Du3QIs{Xk8+r8plvC6(uTee=01h@7P1cxr8Qs}}``#*YTLDk}yFY!wj
zyoeClR5+LA=iw96f;PL&x&QnT1E_gEheb@M+I>?o|4gOjSM5%k>OFZ;pk<c|T`~oA
z;Udrsn8f{0Z`nURS(zz0DLNo0D{y_-9-Ep-@0G8sR6zp-6Lr9i=BR)3Vvio&n?I@L
zhZH2{5s8<9X`#A<g3*_Eor{IuTE{3nUY0jid8eydy;sm2PA9W9lV7~3FanwNP-jEM
z)eudMGp3;yE9<0R-l_|*2yfp6Zdt+eYoMZof)P*t=Y?;agj;MTgl2fnpCX{l-<zR$
z_SI!64W4{;S2qSmd)80fMNeN(z5HhJukU-}l9Fc3IL(%bTE%k&GBQn6tV%wm6;>8E
zakcfgu$z?z_ftCiyC?o`-#%em?@ZNgI>y_S8yr$N*W55TFDJbzE=&03rDgRgp%ZSw
z9R$u1f?5s=Mm>2s^RjhLEMJ~}V%pxyWmh(?V{<6y&()e6eT8drQ~+qGVL=j;clh}Y
z{sm#v1%;$fKZ!Bp0M$^4z;fW=7U<x4IQwzj7N_fLZk(_C(!J*H#N_;ar2)d0i*r})
zJqN0z1zs{)f6JYcTU}>#wWr&6!aG_0o-bO#_Q<_J2ZbaS4wtrrYjyNACyJ-%Pk$QS
ze`~4i-Tf24*l%42HHVk!{{Js4W6$d4{`Ow`#0pE)={hJFZF%3Xc{lt2T}@D7;a%nW
zzC`lY+I?^%jvjU0l=Qd$?W%7UsVnxL0XYzy@gRi53y_aKR)6_+=<cVVubRs=+sjs~
zhtHXs2d(S74;;(A?;Ym1Y-QftsIN<XH@~|WRQjqD5he^w94;*kjVA>5^<JL#ZfgI&
z`}xy1)GxO(dUeMQ;$jCAPM!GwGh^>wzCBleqhU?UO$D?vB~jr(exYL3<TQPIg~|Kx
zWlw+Cvu&%Z`tr`sLf@&rpm~)=J_{BY_}BfZTp0U$-COpXr_oH{XlVzzVUIueb(tyk
zbsJCX-OSX@I(gT5wr7rxqla`WsN~dYoNrdITFH8I**V@<X4BJntzAO@uGB#(%>_6?
zz5X|Pb-O=q*ke=P9=qzBy6Wk@hi7}&$iU38YJ7kF+@{xe)*eo%p2><5tqhGH1Qi4%
zoxW#<x=pkB|FTR|&oXSqG~TQe&C|C{Si+JQ%yCz(tBHZhQOsh_R{v}1HOcW?quaUP
zq@s3R7+DUvH*kb^+*!?Qy*c&InfN6ez=g$K7jR*rt*PhY<zWaqm;06Ag=-U3RgXS<
zlsl_zdeutxP=CiAS}1;MaA*Zpza8s~_|Dy!u3i7jz`2OKk5%#Y@*}6^^|LigvyX<K
zW3>PccM2?H0wtI)$0f^NR+sHM5toLVEgcm0fQ<V5_g1Mv{Jc54Li?V{X1|?0OGdqa
zN7Dq}AmLRzQ)1*8Sp-(pHO}8wqs!j^#*B64)R6F9Ti(Y1ZCwN!BtT9(jGO`;JRNI`
z_-@rNahUfbVYSQ|JtOrsGbOb7ckfCzUm3o*Nbf)-$e#w{5gXpvm+@B3t=gFVXq`*-
zT#S$h?Va}h{<@%SVNdbamOIb6+_JoS`X{o-2w&ckH6z4V_0c9!XC{O5&z{_wDQ}{3
zxkSaK^=o&<h()n3F##792%?TtpyNyT>LR1`=b|Tr*BL67r#zc2d~El-L$!xzc^_Y9
zs{Nd44ya4r!O(cKJAP~S#m7??PMUS;0HhW~6#Nbfe^_Sls-F0+vwuUxym|8!XMcY(
zOZ)h-jvm=tK7RRAg`P|*umlzRB`lkYj8ZS1`R&tqj7MHy+IZjO__FneuM0PF8Z9{f
zbzyLXR}*sBaVQ8(U}!wiaD&Nu#fB9w|ExZXNA6ZWZg+5P^DK||Ww3_F7S0TTPh0tq
zpPI)U?Q=DLW?8$;S<4LLIkmr@PMUV>2BvduSYOPNUGh6DCP+#D%q_js+vT>dxA=9(
z?b81%yP!FG3ugtp;?{q^jf_>SzfYL5<Dd81sd~)Sy?th4uRxO#;PSU+k3;9{@;iI0
zzk`ltVbaRZ%Uk#6-ri^~ZthyS_?VcSb&J>Un{>Hm-?@W!ECMU47^7Um_HNvH2vnAN
zo5^fjUj{DA_QJ}tT&AV0in`4boraAk6l?30O@$=wuNOTOg;t0HEAkk5fB4R~i+y%(
zu68@W{BPOqesisivaV>nyt})6=h53+GAH}Yu?XCjcQ@<PwH1NRZaor;huitTTbQY<
zyT?^N6$Kr+_vGnQ&!C`5b85fcG)g-o(b;QzZ`r9#yZ*_bZthhz2L&UJFZsGRROhd^
zyLYxAV|!K6(a4vMJB+4-V%#Yh)VS8#$fo?f{(pYv{YN~Wo_?FnkXq{jy-ZRLb4;_R
z#S|Q5y|gaY`f^m^sVSO9iHBG+udSK+Q*(92%$YNd^6pqne!lUz9B4N^=qkdLPft!>
zTHweGS{`H>5*=;#_siu?$;bJGD{}7c+Nu-1&F70%VPT<B)t8L@pQeV&fhxuitQ;<3
z8-H$DTK)8K>hamDzQ2F+%X{K#Z!^#kTt^z?+!@EDgfC5Rem3*V#oD6hQ`i4KbqsNI
zLZbqwN&dZ<dG-G)Jv}Y$9%cmwPTceJ*=*2q&H0TdEQ_DbxYk>KuX4Fb&W#IGeq4*r
zpBlP4?Btu9o8LM-*;V>F<!~Es(eJn0z3=a<^|jmk?%CPdprdDs-fq3_m6Wu|;;gue
zlwLCf6CX?8_Vls|Gj;xPo{6h-P^;g2-R{L1wBjGRk*9Em<<aBEwoMbF{(Sk8Z2Rw&
z^!vi!-`-A|H7ko<@oU7}w7Xlg!-Z3}^u=#V>HN8Or+dHLtfPK+ca;ji?OMy|;p_ML
zrg{P+Bg?8-g*Q<y>*DwCyLEAnNW#x=Nk0>Qemq!m+oWS6_wCfv$9kpb$oS3k65^Qt
zeCecBr!%!Q4tx%Bbg<{Me|{x8^;-GkrwP~i=DT0@%~X0`vMbc->%Eq&oi&R#ZN9})
z5x1(>PDlUDXQ64^*WThf`#C80OU#dYCaZUg)!sV2)y~v*<5kHz5Xd|$?2@6{*3hR5
zo!ghx{r$Bm|GwSlRk7Re1}}CyUL~Go=j-=*=lteW7J(IUpzP83|JL23M!82nDx?%&
zKXPOLD?#m#8@IHqVaoICWME3vm@sFC7W3|V?|yOr_^7|&-qi~VPg-r?3!n7{)uE6;
z<nV2L^CoAedHy_;%u6m-<?r5Xo-o&{bW&3j(@d+<RS}yL@^5cDdo>|_v8A59{rx>z
z3ocr7th8Q}>)t2xQG5Q$Gxi(`0zyow|Jfvjj#_UNczb)hePJ?3Zsg{-D|~(`I(K>Z
ziLP>OmiqKVbnTL`pcsy+MxVNq{)SpynLqu+e&L6K&hw@}xUW8U&9lod>nAOG#8g~3
zcg8VW(>2$<@+3bxo$w1fZ2Y)xdxV~U!}Fy!ir;o~f7r7ldqd1ThV$N)PH(=8T{s!9
zW&QHT1gq+AvE_H48qO}wyl(mZPVv*@^7T_Bjnhu3&#y^Rn|JZRl5I^_mKbMbUs71Q
zZNeA7YdJTst-f4y?|GsuBg-m(g*QwSueyi+n`-{{+{ER}|0}V&9$z$}_qEE2!^+V@
zEjsi2WH=NAT$$Q8eLL~m_}#?4Goxc49#3XGacis8iHVDU_c*O!S6uueEHD(-064I`
zflZ|Jlf>MkyONLh*?oTH_qNZr>`lbZPp7n9k9S`=u-MOOv2ptOxz^Wv<X8U8y1q`=
z>hQMmOL=!^ZPDJYw*040+CN8z#t8xn0+F8E6Mr|_RAxoBJrR?6Jt=lQYQvsGM)=0;
znTq*me$36zIboaT?Bla0rtqKhrF}mo)5>ysz5681>{6ngisTXF;(eTF=G(_F^O>o1
zxSfCc!DjZ~M=$LtOui_u{gUUV)xIUBc}v)&w*D^7%Uh?Ssv3C{becxmPRC}pXIC@r
zezWK(G&pSKHgHQ(z0*|N&i&-%%IK#a?=~)bthp}lhEz*Vg!)FIbLTWcRrLvh8@r09
z{z-n7TP9$1&eZOSskn{WUF#SHXfJTO_4=B*3Mnaf^0HvtWdwB=Y!3CGV-d*4E2R=1
zUt2oU^r~m(nnL;0r?zBW)w<~Lq=Aw7jgFP|wz9Kv`)YRX^%b9{7po=Jl5=@k@6C56
z^N)K*I5IS5i7wbV&-tHIc=_w|VQHrpZEa7v{V%3CWb-f2ORt~YGO9o8cyoSe#x_;e
zBPX1dqdYeMI(}?hK}FRjP!C5?cSF`=aigc3)t7E~af9JWC+EqczpehByT$e@?YbAj
z2dif~Oc>`zq#bJEoHTEq-rHMSC$Hc4>(sg=&?!0Z?%s~8|MT&<ulVcfaaAXCZttnw
z3|eG!Yg=x%+S-dBmG0O7ueJPoC3tE4{<?34cXyXh-?GJIrb*_cBS(&OoSU}xpg*rq
zmU+S5WhXQ3ejkB^xj;ur0XJWY=#FD`XC~-Yf3_*gzcW?&mvT{#&xs#9B6ikSaD(Oo
zmE}Pb2M#9OH6QQZHcCI4ZRY4zG^=Od56R4HEB+L=ylF-no8#bQoclB?TKnD2&F*n^
zKU4dSUaA<~^13*y#O-)V$@{3auk-hQo%XV5E&D6Gx7Tcoo_H7+_Lgosa>S+b%SHF6
zN5$i(h{shpdU<&*iQ8LMbePw?qJ+78)_E)a^&AQTpq*Byce39S`gC4C?Zma(d5#|E
z4}V#2s9N-Vg4(5>uDa)A*MLGiP%9uJMB%dC|8AXV^W$P3>u)=OT0UQcW}^%wa>zIS
z`}@25-<0VkMpCkuKQ5b{w`p_Pt1Bl<Uf$cDKVL;fWyXU=doO1%Og!8MsyT(XTwz$Y
zZGw)j<=OCC8*`i)8Xs^Abm$z9*`55G&nZg1V`8&=f3IL>F1YQ`5!R^e{{8gr&Hof6
zch_y<^vk>DyRNwO__~=Px9=T8^p_k`xX#S6yj-%gO#XLZ_Nu$vx31oLdC6L}yV0T3
zO6OdzNtHcc#v;Jc$1wTol*en5oveKSJt?j7`vmgnL$wXL-=iu&?wxJhG-0n5@8o#?
z`aXq}9d~_B!JA7g3JWG*0iBzpyZw&Pfr~Ot3``Ss9J)^wy<2B$=xcfNOkVvbD@*xG
zP!1~)j@VYV&F6R09$QUcP~I>3mcKOry7u9<T2sVf>C{2Nq4CF$il1-u>!lxDlxYK-
zr(iVcy<REk*2X54fRGrC`8Ae~`{I5!)*gK#we{&OMSqXo&ulSALS5D~G@dAWSG)O_
z=l|J~yXW+*yE|(-=(=5(*#{=RVg5A#X8n}2)?qh7^CQ+z?b-Drb7lPUm3w>9o9HjZ
z6a*sA{e6FZW8Y(kCC|Wv6c<$%OuqQ1`r6^5A1~~7-<o^-%XDovI}KBz>{}S4$qo$;
zDVFCCEVz8>Nw>Ul>gjtn^DU#7UKfB=aEn|MPOjpAy4Y2}qwMrGk;lK@H*Ky{{#*S=
zD~e-<I%=1wL7wT%tXRIVnwTD&f=up<4#|<8-!tVP1}VjYdYkutzww;8?}4Q?N2IZ4
zXr9bJ9mf+M`+r_R9ot;dz@V!n`{1g#=LGxM;!QQ%jDp41+NxZ8bHhq)N!jsh(<ZPe
z$~sJ9Wn?)N_u#-o*-zh=*H4)H+w4|p=B#^;>vn(e^z_cn!I<G-V9W>INu!jyCVRoh
zLwR4%_)A9K04)n}*>YglT5r(kyNdezj@a|_mh(*YKDXCh=+Wss)4cRF^#0l^Rt^`p
zuWy%s0(E_UGO4PnemYv7e=^<s{sf`x^|Kx&3CA#=*!{F8xP5v(QxUk~jzl~VQV=+q
z3?3^8SmqE{x6P-pmwjj2XC-U@xl`JfX_tL=TaJ=fL9Ji`hXpo_OcS4SZUkK*)e!_5
z5Bzj(IseIfXVz{zaME}8$*s<E)2BQ!sg_0^UtwV4un<%bc<It<19I&Y&NX*8-7uAV
z@_5qh`YY=y@2?9#dBJYGXHL!>jHJcLG6%F~Ny`<~f>rQhc~<|w?@Z*MRkm^|H8G1~
z>^?ApMy#fA1c0t4hYS{i^GV|>P<1Q1Y7S^u6^C=<p+z+_t={W@I{a&A*~{10@>H(#
z|D9~&o1c#vLyZnB94>5&jv0d7+QJE%#fYA7qawLG?6zt4-6thKueLsx;J+k>HnQcg
zK#7S(Nqf=pjUat29B(W)xT@8b>`#%qnR)$LPjLHb)#rcw9zFUoV?!WPi46|e6%!ct
zCx&(OH-nZld=R^_C%JXC>XYV4lgp2UsJJCPS+uX*<Nmtvw(_GIwy5dd;RL9sy))XW
z5mbIW;8=6ZB7RwonO{kchcBq2JNv->>6B~f?8_NqK%H8!Z4g3X6=+8G>f2?Y&hr7o
z#{BCwN}wX!*0{{;Y?V>kjS97;4;fJxAqcE6Vq}^a>UO#l<j_~*7d$i6&h9xcl5*z5
z$FxT?^{4OGm#_cX6uX11boS}q!}F(BtyI5>ncEj^0(D`wX*>s&S57Vt%@fwwT7;Dt
zN%`)osoLH6>E<Q#GrRs>R@uAv&n?lGHB)1*BNy1vzH+FdgTf}Q5KB-25O9|1o}-6u
zADhZ^z1q7|eAJg_mIjGSzJ1j<cS^+SS>C6SkE#cGf01K@LyF0r)K?u0Oo6HaQ398k
zE-<8YzTW?=*U#|o#?mG!(A+CHf53=?0v)`^Tz7ys067$})UYb970NI$GXKBgiTJaq
z*%he6xB?CfPJujWX($e|uStD@@a2ePr(e5X-8;iG^UKAJo;fv7ljTt(lYwcfs)NF&
zO)8e4iE)_4h_MTfDVh!nn|!3eXE8ohH%R+Ykr}Z*bSLX|o8%bbs}mqS0g!zV7RNM(
z#uEvi#h~NM6gZePPi7W<URp06Klwt2z^7?~`W=vx8p#3$0UbuBi3cY=16^_JFo8vE
z{T#JQ)|+W%Iq$uNTE2*Z+Sm}YA+{()FtI2#tDY?dr9K6YHMe)U*!_R!dwtIh!)IA1
zJy(7U<#f6wf<CAh(#+6!BFo|VBv4KX<&d%26uqp*?3`Wc?`P>J-mk0lp0%ue!ZKd#
z3$nMTVdOF^mPe}}FNy)>Ylj6ztX<vRPwb23Ccn9J_}P(_TQ5C*b+CR))XCDP=T^t9
zztdd^zkeN8I4}t;a7|&z0M)}BEwdWRj-R`+^_GaXnVMgn>61d?7M`s|L9p#<5Kl5R
zz7SOqklg!y-Yn$?hZc^UyE~(v)&5=<JKHh+UsTk*D@QQ~TNoMxKr<Fx<&8$5QkRkI
ziTIOK)&FaQyu7;3N=BK#)O!ByM`%O(V*^+(1LnL{pz;5!H;d9hi;zySKGUfT{U(1a
zZ{6f6GnB%4t0Iz;E3(%YRp_CmjtAQr_OJcrdyEkjq!}DJ_cl81i~86YJEQyeUCq*L
z^Gz5N7Y+(jKtt7+?k>;)Eths~Y&vA~GvVIlvUhyC)!yfW+o1ETD5)b0G>ZDRF8~xk
z2O1CT$yeLCD<$99a;x{ZROWx@4+f^76&MZ+et`xS=i7$6F)*?)3EkM4zgXu_;-=a+
z7dGclzcPglGV%n?(-6B_Ky$wVd$gy31~fFB7u+zl{<cN`n0KM)#FK?Zm)BidefenW
zlQd)W%(GD0LBXix9jhwH4W~qZq<!`InfhI7vc8^~quZDL{z*wmr)>LpAeMll1;Ps1
z&d_+`)jsAJP_0&=F=6Ul&CTNbv!2Uc_-y6rpPdL9F-NFZXmHQ~jjli4?R*oI7t9;|
z_s>$;`7<)j`>)m6CH4KU?|j?Tf#M^D28Rrgmbbs1UxKtKZ^-;z6uB+0Z*Aero!>ob
zVirNh^-&^qp`L?+(UtcCPn{VWSBPt9=}no*J%79Gt}U_(Z==3oi%=O*gdUDv)We}5
zaFwY$+;4L1Z*$4!BP}UAcf6k)_|_4<7(5i*;E+;r&)ln*fhka_K;?Hs&9*PRySFh{
z_fE6Ygia@-_@o82T()3m@DyQ2mPJ7c*TVI^;~clGtgedkep&r%YT!$UrHHO6$g3=e
z;u{=Ne%yD?YG7az)Y?$`T&tfmt8ISq_9I7+x@Y9BM80DPlz5kL3v~2+vG(~Z;Gm$x
z+U4DqdaUWO@RgFh%kj5N-%Cy_U3dW!Z-^LK0a}a03>s@?Vci#L>s<Ecc7oS5f%wCw
zj%Q^RBfPpmEn0+fg@y*u0{nApPk`n-SX>`uoO7JHIb~7pT1MM-(|2u^z6n`jfNYIG
zA7}#i<GR2!7J-h8#>n{nN|u%GKC-W`XKFn!*{`<fwf9r7cM-%Q=LUzAk~`^HpdlQk
z2^(L#|9rRH|IMXWET$g|JF%tv)eMa%3icLHk!EC3@>{TDhsUz>_1D&gFTeJ8iSy}u
z*mP_L>DX62MV668$?L)Esh4fkR!CmU&vCihe+t>dpxK=54mBm=^KU6PFfd(JpD=Z@
z=H#?{>0AXj53r}ayYyK23eOwUs7pc8;qec5psw$1U|^aGy4G}(qophphr$C`h5b$D
zM$)GJMqkTLYM+=UalM}Ra+K%(b>Y^Qyr9kuxETf`IHVbOrL~`3yJ!K2f`BHdvR)fr
z=h(M0u5-!>&=Q*%nR@lEDZhPf5y1y$^>Kcft>+KwtO>X@UTT_f?dew2l%QUb%n8@-
z+&ZF-UIGXzJ9MAu*f}+Xg^|T67CdHKofkLl<)*dZC0-~g*<}(#;|Y&lv#+o+vN%OK
zs4v@itmR8+z**y$i<2kc_;KnusKp5@mBEfV<k{emVsTgZ6zZx9XgE8};1cNIxh(Cz
zQ4lmW0P67azTT>}{lTpCGaEiWeWuKe?%Ibc4hlwd-if8UGBj=w^YHYW9PPH}0r(jE
zvx^BhIPO5W!6b#06Zh@7(2AM>Mn<NIq6Z!afbxSt<E5sFEQ-t%pGcrqG>rv93IdXT
z<=vZ<8XS&r%t&~$RNv$B7rskd64`epyPui6R0%oxgBF!>9+|$i`7Ky9RC_{@vG2P*
zufDF@%aIORS^*9qD52oOk|8LmWZskn4H}eiR}eS}T7viUU647dlb~tE3AB*5;|@m`
zYzzr(BaCoR0TmBVc6;B2T80us0vv*jOcNE0lr_N3G*o*V&^pQ(1}M0I%Fh$M3nXB+
zp%~z@36x;=?Y@F?R|%-$qa~oBsW}lkA@av+w_Nxw|44OBJw3DQ7sKOEX4=I+PmpKg
z2-)jUb2Yw68zWR4R5&sY<p28e(y07hjAhM_4J(7@T9u|;SrK??cX|H&&^b1ho6gL!
z+<eBy-|pv<IW?b7rq%oT_3im|N_$h$Q?HY!PfuR5M8)#=o6V_bW*7=dSMTwidbuVw
zZi+020(5cqvm|sswX8pIZEbYwwKb7N2U*2Ec9*^N$v&zXyzE2^r|^=<&1uh;uep_}
zurcv)oBEr$Eg2Kn#P5$YS+LSG8gxkJWt@`~Gtc~KW?)hTEf`SAV{V1EprCOJTBFQ5
z%RFE2y#4<@OO`CT(W<MZH3@X}W!RdChsFXckH6}#K6U=Qc&_Hnt=Zu#<M;2oxi#;u
z73fl(J9WR`UfP}?zuC7RH2juv;nS_`^;3@=aVea2{%@6za)ZNHE}8uEF?*jrc!lm)
z1%XGPt9|7hJ#_P`s&;9XCMGVtzchYF0r*;`35w2dlBerLDj6CYURvzVUp-r|<n=Y*
zE!x}I6ihA8rW<|cXX0pSafsO3aV72MFK4F%D;dsr2Wx&>$#9<geB*v58{>anuH|*}
zroY(t|KGKF&yU7$d~xplXQ8{_?M1ToXI@qd=6UP%*8h^;jaz4TXI@@*X{opP?+dlR
zzs<Zh@#M*q-^^k&uB@0CX<zbULS^Z!^C{2dSp+yZ8#iPM-rQIFdji8^0dx<wtakYS
z@2~dO7dLO-G|InclX+=LXUV%eH`f>c|8SUpQ}J`Z{%aGen0QU9*cD56Z+&}WqVld+
z7VuI2#H&i1Hr+RHe#95Rfu0Eug*Y5<yK-~$`(3Z~`fsk88}j_Jzx~vxty!M?>;Bqo
zdVS`O)w?C-o6=5ii<|rGvmO6y4uybPro_uin|^g*Rva7^+-GJO9`=zl2F=&q*tqz6
z-u&0m+j1s?F6gLyJ~v%$Ug7ze-DSBKr%k)(dA$8f%Gq^qP3C{EjBsaYd?l<P5Lx>z
zMiQQUAi2G9gUAf~`h7k#ja=LK<@K7``M>Svn_u&(Gt)8h)<&s}EAOuF+__Wk`PIBT
zv!qNi65{4QGoJaAosq@Kslg$|;|?1adfDPo!SN#Js<67>6vt+^lUKvzW78IvioN~w
z=a29=d5eMrXDaTl4%au<>@8=TD;vE#O+S9$o#gA6mU{aNZ1SCLmbUwHjhs4YW&Ns9
zg*C@I)`V$-HzFhFbcZS2pyPJbd}b)TeEAYIMfmg8>h(DjckHlud3X2ry`VE4LFXau
z`Etqon_27(>+*G+CUF%HTjg%Ao%-(XZttk5S)lW{lai9o<lL0{bLGI37Z(?wH9Py-
zWPWK}oS?&kU!V@>f7=D<lkpratp~Q{-u4kFJU`F&)2Gw=)l(wXCteKeGR?YTaJ$s!
z_>v_m{WiBQ1*YH3yS;7gmi+tolIL%oG-HNFzum7Ddwx9X{&a|2-^0_h^UCUQf6&RH
z{do`kK1V)(D$2;RDqbP&?ygeRsGd#t7*_4?m;#9+<QO~TnehADThN~A)4t|+RhZd$
zK4|PJyWZE|Uv6@GTc7YsM&De;m)e$RpTCxQ<IK>wN;qPF-Cj#eU8U9MW*CFoE6B-T
zU@8;n*yCV-+pjGOOOi6Y-IjYshg5A}rSmpo`A;wFX}KH<0yd0lt2yVHh9l<3AO(@a
zBi52hvmQN4+WB-^w9>wHAp(pne}osfE~$@u0_vck)(P@Vx8DBRzW?vqewjB;42>D0
z3tUsS+^c*AJ_(@#rE*Yca1dbSaA6ai?F||jMs_e*p}<-u7Nx~s&jshB=QpsGO&Sgg
zMjba|xRApQECZ@vGDH;wB-fVDt3nS8h|w;f?KelB1z}hUl6G0`u$4v0+so_7@8j2b
zHT3kRty!ZJ9|^j0uI$|%&7VJi+I`+=Y{NR|PW=0Huj{A1L1$gv-Cgb-7#LU?c~icP
z>E_LwK>+~)X(zu*-rQZj9&{t^8JlZ->gN|soqqj<P{A*|z=#Nq%F4=#p_N&WBOLDM
zf2sD!%UgFoxkCTrN#RoK)4%6za`>{@Xa4$6`}m`OR`&8S-t%Ad*e<+G_vgN#n~Ub~
zGqU^<?fCw^q3ao_Oa|3!>T{lLx$HNYU9RFm%iHX0YbIWgua7NzdrS5IkK^`B{N`H8
zRc_0<sr3Kn`T8fv<?Brjo}Dp6;^o!V)BpUszJJ=St=ZL2QdR%3%()j|KTrFwk$v$q
zpP9DR+hlC3t}IYdS3kYD-%d+6Y72+GidRij0~-_Q-d@l>0-)oZ^7edm>$mxJy!Ykh
z<)=aCQhj)MIBovE?LAVaURB@Uy`5Nod6}<K<|UP%KcCNk`_{Jl+Z538#X-TrZ*z5A
zrZwz;FDxl3`RRmm|BM6QLHGaG{`%6XBajum?7*|Lv!CAo|8M)BFPHtx=DoYS`*eQY
zXX*a;ihlOz-%Q>haFOY0tzYES>*p7MZmqkvK0bfn^H<-B&sn<X?fn|2&AmQQ<3Raj
zjXf`?hNSLWA0ni(+>xP?i<8Axpz_HHK~E2l35LnXDn#}KE_Rc9{fpIi|Bd>ON5w%a
z3^uRdB9;fbzVc={X!hRAtLx<dv*!0bYHIep&~IMyL9C#vey&~ks*kT$uRjGk)^5{j
zy~%lZcX=iyEdrHWCK8@p^^KsV07p87RrU1F<yF3oUA;DX`>8dNo1Zjs>rE(oduwLc
z#NcH<6FG&|JT|ADJ<~6@_`P%e-`DX=)6UK+dcXI(*XppfDPLb*efB4R?^m(+hW9oI
zZh80q_Yu%Jf?r=<HP&5IyY*17g3_u__Kp1Ze*!?a79V7nH)(YLdw9mbg|Fw9-}}fR
zX8G5K+3XYRoEpECO>FDuS3KhU?0)I~-*@HDLZd%eXC9UR*>y46dEac8_j}j(%=%or
z)JVjVorxnPMBzoFhwcV8&fnkPzu)}ke(m?Ue?Fbo|MX<C|Ecfy>-8@$^VK#51<IR?
zUZ1W6`%krgzbClv$HVrZ&zlYRu>9G%-*28auTt&buh$nnmo-Re=)JhaQ@DC&>j$w5
z_6aZc?)~wo+n4+JrL4<)DvLqKaG#aeU-S2tZT$W@Ya=!u;&aLBW_~-Z`lx7l$F_n?
zOLPOjNM5?8x#Wb%hwrtAs^maNi_BYnB4lA$D(4G%r^%Bhy}A2~o%=7}<9kj)<-a~x
zrp@nZ?GP#WWVuxI`uQclzP>)~%x{}wpUf+5*5e_p^)#m8z1q38CthkE_%7<te@y^1
z_OeP<;N_BC>2ph`eR+HPddgLYl*p62S8romyd|`Y&Cv6qe!$J|<p-Ns)e6=gR0&Gq
zviW)?_*uW~zO3c%g>N<8vR%4-`Rq_x^W$D&1rIMQbiSr`@$W6s&8erSeKQkN@;)&C
zJ7@09MY{Jv$9iSn*-@C{7$EJ=bnSObb(-wIgTHN;ZL&XqXZ`V_3Qmikb1r>ceSK}T
z`eOI~ZOs!NhI)HNhcaEO=DY8^%FDv&{ORvgPwZKLg{!eZbj37>C3TMR`)YQ+sOY=(
zHmbhza^948C#&z)&R?HeJNfRu+TC07?%oPF`_{U$Vg2vdPj+4^{O4!)GsU=XcAx#K
z<|D5+Fj$$T<m7BUb5~?pxl&2@TE}A!leQULc=GSw!t-5y@z$lULN1ra|91d2B4;K%
z*?K)r`b4UQ8V}2#%J~=acK(Vid%1M_EWLk;0k&NctxUfxmm~{hU%x4+?Dk{Nr1j^G
z=d*7zegjH^k&lJ8=ia_nv;M06hU=?BPyZ3@`Pg~*pWuoB)*pF6iu+dB&UmjKSp9mX
z1(Twtz>WMjqAR-k_*ZW3vitpJ^EaQPw}d>^CtLjea#_3JS#tZUC&E_6-xfGFYt`ua
z2~;tq-i=>=e(JxX6_2;yExVmt_Vi2Tl|rWa|G)1W|Lj;R6w56&VV-&ZybSTb=jK{h
zhy0sY{m$_5)huz#w|>jl&M7&wZkg}wswc^+MJ#jn`M==V2D(_aqWo;H3}@D(5QpPS
zuYUaV?d|RKeUD#Q+^`Cqwm#(A^O@_DZ;0E14m~lSTKn_q^s_lPrCP2?ZvOhaZ`-62
z`8c(zkQFOc50ndgH-)P+)x;Mra*<;Z;8^Bxfq9~o!j+GTrA-375?R}Y|1$mGzW=Z9
zyvk>i8+W<0H7(fO@G`!73+v>oYpo}IF7V0V`mt-j-+b-bXIs3x{Zg*%tE~<Wl+|}t
z*Sr`xC4a}mwhL=)maYn7<TZNr=4Scb((9bM$=h>pt7TtbXR4dN)q0y>+tT-uR$^=W
z?z(o_FfM;D{Oit(-yPegsJd=%=<{D|Yg6JADZ4moK5y<vi<}!9f)Z<L=S{6*kY4QP
zaKGK;>$|(rZ9I}m|2US-5B}Bu2UJd_ZQ8r5^tIbuZc#h61LeZ=Sn64R?0eKNRw?M9
zAi?DLzI#>d4HJ%)p7Fa&UMk%>8W_FwrA||$nyk8O`u3{_7&fP}uaekxd}=wUB>i<J
z(|a4AtksNnQ>yOVOrM{-Ei+(_NG+3b+L;Ni-C{F4bFIqWykJ}q|7ESD_wjytebBup
ze?Ioto2(5k>Ct~J?%LlR!CB3y{$5xr=hFE#r}g*W*%EYVn%AvOVUz3TMV?OVcVv~}
z{PObh@sgw0rcD5yuJNM!<nH(Tw584SY##pjWOv@rqJcM1God#8n!^&)dn?LL?)z|v
z+xI+Qw#CF1M>;=weZH%5N}j=f_4)6j_6JY&F)%p_a#VGnxRkYY^689A*O(iZEOzfd
zHUIygbmP3+%KbJ;^@-e1Vq}D?m>Tchzcg?4mMtcQ@^@~p$}K7~a#ZD3?uvVUe!f1a
z3V3+9{q%!_&HgKXu8G{dWXTejyq!<Qs+nYX4PNNn`v2#-y>EBk-()V$O)PWv_`m2m
z@hhiC+WcM1sqAdk+**UoODezl^VL(5oR4t5_)-6SUiG>c7Duek&F}k|zSP0~{F=v=
zy>g7T@|Tv}kDO(iofaOme|?6Qme!{28wFySYRo&={f@nO>r?I0MNKmO3{0Vl0z!=*
ze>bgL8M->`+12^=CKW4VcNrTSyEab{eR=Ec`O=fpGL2n#?q8axE&CvP_qA90%~tm&
zspXzr(tKck;W5dBD@DRNIU7~Ir_Ip2c5ChbSF6|SZS}de%2$2<h37}J<}Q-ldUUqh
z_uMq*|1K>JlfQH3PQ9`=+Pwc4cpXOV*HGab?=CK8Ki}T&_hj9R>Xz>*>DAxgnTnSE
z_Y0bMe)EZ|i_=m$U;Li1OjJ9pqwMeYNmr|#)o&`hE@!y!yXf;i_NeTA>shpp7jh^B
zOl5N9b;&Y!dwcK3`gnU|?~VUV%b%W_`fW$w@;OCavEhFw+})7a9C?3l_4dlE2PU!g
z`&qqI$-J>);mu{qzccrB>+SLYEtITVGdUw+GN-Ce?}wVwqWZs;>q<T~9PJiA4Z3zV
zYU|4*rtkOv-}my_lC_UK9_nwX{G4WdZ*i!w?1%XJiI*K3{ahB`{kV1a61!+Al?$C+
z`+mLB*4};O=+T*mJ4>9euZvB6d1)#5Cf`o=FMHkpZ~Ajmef|tX<-6%Ow)r1$y1{Kx
zIsd{nudr^_)rZ2qd)E4W*{S5Z&ml2!VUMi!wLSJPetY*ynVzX`IX7qRefvA=`-?tR
ziv3Kw5&$Z3Up~qFwYTEj9LqE%)7;3__nW_dc5k1Od1Zy*j6f|=>uB#s#<1D%wHXf;
zN-%MRtaJ!qo_H(PlezPk_g=OJlb6%W-U?Y3J@F7$*pRim?r+uQOBbWAhx5v1N?Dbx
zh$+8YniiS9^2(C<GkY$B?(`0iEuH#3?b>0F11JA}eZKS6m6elcF0B3Z<m9Ihhxw&D
zpPijO``Q+kwTE9E{16!O)@bcr#kE^%eimJn=XKck?N;_PTaV-6m+V_IxXtEHykeVq
zASim*%j(Hx>#v+-wEOoXIdWUh%(=exoIC#gdY$<(t=r|A(}MTHVXG~8(<U!+cCfE6
zVX~XcSpDkC%4L^+$$WWp^Ky-UVZQ0xC!ck!uB=!(`MhT6CBySyjlJx5o4ib^em=K+
zUQF>>)3mwui-H^8t6i+Tuf6$NP5eq9-*c@DOpP2zcI>K{@}lt?&!NUSNA4$YVQt(N
z<mKUEpzCGg;NY}i5z{}L@LN;;<~!ydOzGVoa`AO>%@eK{5e-rkuB@ACr8tdE-eaP^
zz=_{2+b)#x+qv!&G7Vv@?Z2Ry^re4|Rkhi{jCtLsL@qpZ+_HRvU35+QI-i>#?8NW;
z9{T++wEX4IeL;828(u35%w@XuARu@vi_+rBbE2^KYHFFn6pYM%t@7(dn^1suixh5v
zrXF?AeTDK-`<)$5j7$>)D=x3Z7|I6sk`97)5a$%GYe(zEfw>MMTml_Ehi3at#cDGL
zXdi4scd;$jp4_5<28R@pdnKzti#n$GRr)e8h(7dmaSTBo3xHU&0n}lPp7R=ehY_^%
zZ}Ep^!KqlSX##B#x$!6lb<ql>lgrSkA)+84*=jyl3wzLlb{!uSdtL<&3UtC{Aw%N{
zjXf_z&_`XsUDL({&^*>Qi|fv);SI4_feW-M<)QELQ&3X{ZZhrMxicszNa*I&C1p^-
z1_q`?(B`B!d6KNqPIu!fp&Ogi`*ZH@y87{D`k5Jur>E<e&#{+~3|||iYJRU`an0AO
z;ZNh<U0CQ0x(~GL+H9mL9fwfvBjI0JE$kr!?Eknxcdb7=JKMJaw21A}#$<O-KfiC^
zO#)~CKg@4GWy=<mm-qMAZ<S0*Pe1K%|5v5@`@5-Arig$p9(b{r=j)ea()lMqcSOA1
zeqV3<idp%mrf7mzJm0P~-7tOP#Kc#3c9mvVS4VRHn)CYey*-u1E2FosoBQ@aBQxkk
z#_GLcYokCNE>B<It=p$=HK_kr)7jlUd0p)8X;Y8hn>S^OO7Zh^Q=6KYc0O#Ae)Cob
zDP07Jf_8g4O)Ul=)5)STVfu9S$!flnTDirmWa1aQ@k*NI%;=G^yp(LMt<EK5TNQGz
z{(r6Tm(}YWo@~Egr!B1RXToT<y2a4YQ0+qLL00jI*-oFX&VP4ibK2QSEiEiBFD`D6
z73WQ<`+m1Pt@g@_z(=e1f$r%MkE=NN#P;(U<EQI(zuR>F^ZELJ!P9i3)7D3G$L=bb
zI6HseO%~O)x$o9nT3SB)b$3^(@xg%awM%th|BnVOb=2SgCurT?Z&987&sQgA`sE;!
z#tIq6eYs(M%ITmPS%DP`8rT%&>wY9&=JIJa0#)iJSywzjXKmd&^tzefZUVRdo(a<?
zKDEd`z4QM6f8T?4m%S}23OoDm%o(3bP)qdd`@P@eGH-5L`sVg_e=(g1h2P)bub<T&
zb~tjY=;E@I*A$jiXUFogWM#YLPPD52mLq9Xu^~fX+m<gE-Q`bus?SxiE`K-W&>^RO
zonQZ(m+k-aRR7rzW%s@gHa+{_Z;V05KHB_xu~_cs+Nn#ur_Z|9`}fz^&1O@7S6z!t
zKl$ir_tW3+_ly6n??*{`;60*|=fKPT9!x*5e12V4(*)->o{uk-Ry9h!P1==sn61B|
zKVH3m)0ua=Uz%dSmcG8$$#!wwzF%3H_xJ7HS#x=ruW$D5gy~DQ)-PWx+TGRV(p<4r
zm3N8%T&vK!KOfy+-r4z?Gtw;YPDYzNsFtWLW6r;}W~S^3o2OHPUHXHQbAPUKOn<*b
zSGsifwvLine)fM$KL4M__J`BODpVP<#Kb{?iA9My@G*EMsL@OGf@GcjzaPoMJUjn<
zI_+&+zPs$L&9>JqO1BpI#DA^ey^--@dHMT$az8;0cwr8!$34cN-3pt^-bP)HdVk4V
z-_%h&xA)sQ>-Q(l+yBprTAnFh@Lr*Bp7ZYY^U7{zrujI?{tk%V^KzS@vYSWFn~yv1
zuX#PU=F`b#vwuE3+<x|m;@+ySMo%v}Oqy1GdYUe1v@!SAmWkTy_gqT;<06|J5Z&<V
zN8_!~9nS51MR!ZD&&+=1dFr-(-Jgofv#wO1v9CXSCFr=rm0#CZ2D@*WI(OTL&r?k-
zmY?)|?Oq@Ab&lVgKPQ(vTJ!FEduywA)YdH3RNLw*zxP|JzGiLqY;InvS}V5PcedK+
zXJ@rd1y<@xZ;k$PGkyMBV}X~odA0Ap?7WbE&st#RGpoF(KcCNkfAQ$9J<nZtPk;SC
zzG^<`tO#)V&A`MFvh={m`*T)((wYN3+E$*)O0&Hz^XjyI)9h<sCVsx5_qOgAcp#|L
zuW6B^-P=QJAHU7qaM3o?+w1K5yZcOEtZ;OjtN7!6{r}xHpH8Z$?e^ojv^m{h_{yKx
z@&B`$TJAmn@$2>arwiNVjE-kD_^E%tAeIk0YP>q^a#8Scjw^awr50RaSXuV?>XO)O
z`RX@@7hm&AnVfiYd1kMC%?HQLzMnI$KU1GqacIidN8S2ncQ0<;6ZT;Bp1)OnUteFJ
zoiJ4|S~I|yx9Vl>MbC(TU)R^4tpEQz{`Hil`(7P!lDcu}qp<0T=h<gm_nP~~&b^V@
zIOo}Au^qQsV|MpuJ47~D+`1dtT;?}vSBCBBSvGF!(=L9L`5GBu{e8*7%(q;3m;1}R
zpWj`&W}bVr^DE=f{dKk3oBytA4E3%3{cY=Z%gQ*D&GYo_?c@36Y%=6egC==F1D2rj
zaH_6D_lZ+tPiw$6MjdxXw~4QnT1uto?!WtfKAWA^_OS5rv6<7Vs(Q9*)qvJzpZ3b_
zT^74*?Gi?P-d8VEWM-LsShALFt7=N-ZPNy`sxKLnum5t74&sxyi&?kpmDc6Zux2wU
zo~s-Aw}z%vRqdL3b;~ZB=W~jmnD77Ddv|SE^oG4(uSG91*33R|dX|U_b5H%R%kxu?
z^+<xY4n^)PTKb~r^7lK%{WCM8{HrdyihC9oZnUhg{QcHxhb~LjvgD$y>xsTn7k2%A
zxBIL_>#axY)+}Mvo$K@TYIyuq(DiH2&dgMv9#hnrSsQgLqSG&C?yaAb{iC(ba&837
zt9qrmJ9Q!3w6E^RE51xM*|976IA4EtT+}~CX0{o>S5DT?^p4hk`FUxw)32f}pZ5KJ
zw>vHHc*hk(P16rA?N;_q^^X_VjZ*2AHs7}U$ZNCZ=etc8?_}G1H~sy!V&ny4D|A2`
zPo}9ncLY`B91#xDOEa}rm(Kj%S^wi9`{gX}bmeRB4uyGnc^R!`H%(Yxd1rFj?yXG|
zcEuh)a(TfFHdgQ3>(*-TojlL^xb2pv%v)=t(wAOaaAj5KYMV{j2JenZ=WqG^%1>51
zAbNJDw}&>z%G+DB*ZY+%Vzl(t)YN<y8f_4D(EV;g>3_Za{gyXg&v!VxMq$Z3zuhd^
z<;A=qQ>SlnoyYcLi|W!c_UqGDN!4t9xB2%+Xh1dZmC`7Af3N0d>hzg;AKpFH&W${t
ze&u&u)M}USf2_im`$>KI`F#FuUFWa!vQ`Iez4Cnho+alS|GluiA~x~W`oj_#3U_RC
zZ*4ir;=XnD_UfWvdv>rZ-R)0DYVS0j5?SDylA2Yd2WosZHn5nSSbEZPd%)_iDcxea
zemlZGKRbKY?7hRHzN63QnXFhId%$$Yi+Lrx*-W;k&Mp6B*Zwa5(vr@T%VO8wom_VM
ztKIg{JX!gm<GdyQQgb%FS{HkKtM~do#T9FBZn-*#?aUgz*H7P;+ppi66T4d}txAt~
zRpx6i-SwgpTh~4OyXyL`|NnmbnwRHtu4)X+ZC%Ca_1$5OaQNy!Pj6bDO=orS{(Rxx
zwWq4De{N{1Nqu^~>eY@}w|MW&+Ts>%`s%BDpG@SnM7i7lzir=tlQH-0rL}7tw~DTd
z`yIaj*VMV&x8&X2b@}Dzq`!g(PTrXJ%{3Czj02?zhXekMOcU#xCdz`^eG5LZuF<<0
zrf~AQXo-%e?^4#DJIpcr&IR7HTYWXT^5>e@mM8OB*OvqdytR8hZ_Cp;sS6nQ{r|oH
zzj3m9*7mfwcI%QO?LHh}Uevhx)3@F8uSc!ZF;@S&WnJdptZsMN=-}OFU$;0|J?!aI
zeyLr#+iGj^EdOZdtWE14uhv=m_Hx2jHC~=+(@i?oG<sxTnzgg|`K$#+k(+aWTg_+V
z-n#q$_WO0(R@+vHc3k0XDp}(@_sWT?zBQjMYU9=v>UeYWL_dE7-%IGg06hmq;W)Ty
z91`K6e*Xf)iA|}e&qTC@ai6^8m(zQ6NBR4E!c0+N-X8BA;xnJG?8yy#5EAV$ZF-4~
zldsjzzTYWIOJ$cIR6e`dUaI6$SfLeX|2BgwA@}Ou7l&=1$@XW<)a7hSYa6DQOWwV{
zH+JqV%d_dW@xORjC#|`*(l3hNEce!xGahRvUwfhAbn8@TyC{drgXOxpTdjAN@o%3r
zFSvP8cuZmI){~E~p8TA&^;PNnRqqOg!jQT-D_9thb*y1=@dHm|1{gB(*1c%av1&Yi
zq*K`ch1A;H>F4HTrd`VeH7{oP{dj2Cwy5vs^0ntoUMxy>2rIiZt>%9H|Gl+Qd$;-V
zEn3U6RW+(|rSEJrwe{O#K2O~u_s%n&<@!dBwG45Uzwh>Moz|SWE$!?q;dk?=MW$C@
zTcWFScd~H!@-n~ATXSz;6LCBqSK@!G_LkJ@%eA||Z?a3i^(jF8Lt#DJ-p`S*Z)pWZ
z>)L(4Q=B$=vS-$s<h}7*YkujxkeD2H>3Kl&UaQ%=%Zq;PiEs@4?m2JI`J+~l7CZ;2
z4iE*+wz;xef_5D{EC^yL`SwawJ8Z_x#;wwu`f``+-q~{X)+AMLpKg8L7a8AE-d@{P
z@iD3L+s$;})sDP8FC{9g_G~lTd@OIxl%}0?U82?aWGpUhIda7)liOUkd$QP!sAd1w
zoy^_$;}Q4I-}nFLom#tD_;p2NR9>#ARmqD0<I7v(Hu=xDOY?E#t;>?j7807<dFy)J
z=F6|=C(L@8b7lXZPu(lyPfyeJEr?uO_v@wl#hYjL?&ix5JY8Ix_1t8BRQbC*H+_u0
zoYG$3!B%aae^1AXZK>a_B-W>UBy7V>7p&4PFxAM|y5Y--2iq1gI?1XBN9$&7FUeJX
zY4Y-jiPW2G4a>KQT-Cd2rE}2qdQ7t4!n<d_N?x4#z&rcwi!YTItzMUUNt<8Jj68|d
zgLSB6Vo^FRoCNL%IRvnj+}V3vuG(jr-`uSJ{uSbV-QC7_tK54e5}As3z1?;@&v-3M
z>9@q}wjAD9FLlm4xA9!mDZBLe>v8MM51Y2U-R1keQa#sox#RKj`?cXEbL?{)mo;t$
zO)sVBzOI_(`8n%C*0nW}X=*929e8g<HoEa@_|7sp>Ep5J_tzS!KUXB@noivw|9MJS
z+bM&~pQoAoEjj13&dqAy(yLJcyN%-Oem*tIxnZC?&%Nl?t0R8?Z%pprEx)g;zwgH)
z&IJ9K9RXW@|B@}glgKp5YFTpS%PYbDrr!gi19z2g4Of1@QT^-9Yc{|3@X6WSczos6
zO8crg)t40Z%!}4F&6Jy~x-b3wyrP#&r+1kePTuxPM?=G4@}nK{`MTDXaV2c;c%{u|
z=smeNSts)OL*#<tlt4#e=~ScI18ef4rxpgC181%V2UpgTrm1Vz=m_ul%=c!;{OD-z
zEN(;IOH-zqcr135d0+hE+oh(7OLO=Cd^X#+`>4Bo?Ugf9Yp-9KR(tRHmDkftZQpOo
z+#Z*Ec3Gom_8G_THn)UA&WGOOxijnh^?#pE39OjOCbo6<p2-PQ{bUxeeX}J`O66Mh
zgSmeSOYOJWSZlAJTodIdn;*D)e|AxndoCyF7Pr~cc7v`;EcLw18ht+SR*IL^<BH5=
z=PZSQ`AaV`J^0pnIzqxcZ%)qbZN6$gGXh?H&X9ffy7K3<+4(-Jue@Hj``ngOTl-Lb
zE_C5u%B&2*$jC)=*ulkp5bLDLlU?gic|Y|P3665`IREl}*=iXnk55;(Zd>y?>Ui{e
zsfI6CmtLQhaO~9kzpt|ED^oeH_%NsXHBE>L%Vm9W`s8lAr#p8&*FS&m)N7Ub(}L^Q
zJlWDG_2U|6Mad!wUXAF3PcB6*j(V=A%dztJoLN!NH^!OnSP^?~>(tat$3pG-`+il$
zZF#+Cn)QU4d+x43h&+h%lylCF?`!rb-{^<6!W9yB&C2EuocngK)ug`cm5(RCy0NlR
zEqCe4!_qG<FzjP`+&FLkW2EA<KzxDglHF{l!Nm;66r}~i&wpeEhMiK(DN+!4x6aCM
ziJ#QuNs}He*fw?k(;nk<0)JO}Tv8M$iMjguob`I8<qso3tpZRuF)*^oa2mKRQC0(=
zr2;V!RCvKy4hl@yBqo-e<#XvzMsfjiHLDM*W(y}GwLYLGgVi&Ej-BX`I*x28+}{li
z@k}gAe;+AfEQN;H&!Xg@U?gDL2X5ja*$J-S8K9>rx`I}kLq(AMB>+3nvKe6=G7EB!
zLiZVnP3X=O=wN6(;c&%*4cRYX4}pn4LJ9&e#l>f09ba=$09{wpxT25;sWw2e<_GA~
z9eq6`a0QNTaRW*(7t{6+-VF{*;$u>v<4$M_8j-gCAbS>S`-ABWjUM}VoB$2&VOR_r
zTovfxap@h6XmA{Zi9sCEkJdJW)>r6$!n&Fl)VW{fkmKojGJI;4n_nB2)Bx(N?%>>!
eG$H<<{qi%Drti5BW5B?`z~JfX=d#Wzp$PztLH64K

literal 35361
zcmeAS@N?(olHy`uVBq!ia0y~yV5wwaU|Pw+#K6F?{6YFG1_lPk;vjb?hIQv;UNSH+
zu%tWsIx;Y9?C1WI$jZRLz**oCS<Jw|cNl~jkLRyQVPIg8EOCt}3C>R|DNig)Whh9@
z%q!8$OD$0_(KFC9G+4{Ub%24PbE2n<V@O5Z+rRzgA>Zdd|5^WkgYEq{DeBgL|DL;P
zcYF8Tyn<tL-JRPlZ+%_EfA?jl@Wr=ZJM!8(FR>gte`8uxuBCufcf;%swS(I}^b08G
zIJamtvoi5ao0!_jvuVPKeHVW(etmkayw=tJ@X*><KP|o&yzBSByQ*rX&fV$xSJ(bO
zFVD!pz`(H8?K;S-4Yw9&gZK__FKz`1FZlK%3PcA~m*|4%6}G#?K=c*4SZ)xV)xQqp
zdxov<wAcPByP~4vtI}-F)eH=|4eMAH>YSaO@7}#DD=S;KXLsJ+UH|_5>+I~@AenmN
zY0<QW8)t6tI@jgp@9&?Up8l!$&c51eW_kagZ$w}8-%LBCwe|_)lE{X=d-s<9;y+jy
z6dN1cTeXkjg3601hNQIP6T|oqEqr=-O;zEfg*9aX?{=ELdQq8>a6sOnP4+^&pzoT8
zvD!aBK3#php5x@_t-pC!Gc3@(xRv2Z&fQ(5b!V<$zC2kbfRB%_iZQ$M@E5g*?&o{8
zR_u()`*?iEt-6Af%p2ODsQcG!oN4NRo$GY>f9Xa0_umgMD=TZ;s-5!l_Sv`hH|#l5
z_HOyawTkVb3>T)oh+<eYRVH4{=E3HvC2PYT+Iv~o<X<eWGfTW)bn@3Jtu24WQ?@_d
zugsv)wvJW7@8ti;^Z)0+%dm{&jQT!fU*_(xsr)_bSQ(arT&Vf8!vE+0!}ngzl%1rO
zZ@p#JwYzuc*7Ll2zvmNI`u9iEvo;*urnb}1Ij#0tPLHk1?I-Rl%;wiDI+K^gf8e;v
zq}`k6=G@<R*FCN6=8PwaxBV{lt0ZRU?EQYesejcMhWayVI?E$mzKQ&4TXsWKyr$u<
z_pd%KyQei~X@&Rs^W?%rAMV~NS<SF?{`$?&r}7wobJna7yE4VTsGz{$XW@+=-D$y@
zH4X=Bf1SVk?ymUT&IpBnOvW$2hl)*Rk(f4Jq&nf-jJNM5?LJW-sH%Uf=gGv1fS>2D
z*Z)%e#=~H^Fq^SsvOM>#i7^pzeX`1G?H46a8m{|%ILx~3+y9mG)2cTtKKAFUnMLh_
z_v}0BHoRlL)OC06N5*4$ucLFfpR9_`{1bU&|I5ekpWKX8Fgw;?a`~Z-wSuJv|7q_x
z7k~ZgIm2wQ@7}TBvP*B;wmG`qSXZ;e_U4&9<C=(1C70f8o4IT1llSMXJdHjp8$9jT
zk?=6G+h48nM>Jdca8Z}N`1-_?{&&Kb$$P%s6|^Q>_4VbGD%yWfO2u!f_Ia0jbKTSK
zna`s?u)hCulhGmNMHIuMC+r>H@+0(4@|jF7GqkXHq5XD+q2&Ufuvt$$uH0a-|K+1+
z{Gk2l&)2zWAFuIO<bRx4w&u<8#or_*9scsAF#XrNH!p7}8=h=<!eDF3;rA{1{L$+Y
z@@fCuo*oqz*Om&{kga-NZ|ApNcX!)vd$RJU!E@!_+^@&y*PT-J>hM1IQgV0bryAp$
zhP$ps`f8PP%ADhqC;glD^WqKO+|*z00sl^@EPWz)Yt|CJnL_@TzdcSi@;_TAu<zcZ
zO|JEN-xhy#P3AxUPD#^}^=Y~8?&&E@&$evsesl1)w(j46+zodZ_imZ*6tQ*1k^0nb
z>$(>|)eLX_cyjU9=Fc@cXOirL88Tu^bQuc0`d%F>@;te*;@`!2^1jQW-HTdg*%g@E
zZMyO6i?V0miM6*?+|Qirx4x{ax^s7lVA08g+0PPh+wEn$(YR*)$Kw-po<)~Ae426i
zlhXd_XFi*rd{Dyw(X?!`kM@V=A7>ucIett2R9*6I#^?IDeJ8)oyg4Ogt4hK8=|B1J
zG5i1L2(vQ!n^jmA9i4yauJU~Q-6e~S>ux`}_t(#OZhGX&)f$K2ZJhI@_r2m@BeQ>-
zPOd5G-d+FVrx>?-<<4j7JPd35Kv}Tcz3OS1u6>G5#fs_m+Z6wE+@2aYzfQ$d^rVRH
z<SqL)>?tX>b~-B`^WnqwpT?UQ_q}M}`R&H1@<-ETC*0pU$@FLI@rq_I_gBrIU(YG;
zG^!8!_Ti1^Qt9wr=Op82*6Vxf`}X}a?(Y1P{;K<F{}~&V$vtQ8d(Lv7SjTzu^H=rR
zHp=y_H%|Ga>Yk0)`f0RxT}zX`S^Z4WKR0#X{ag6_b@r#jhX0Oy&X!=<Vzo=G!Q$t}
zx|!}Dy4f3B`>j9sU+gxW^Xd9?`Nis!d}n5bf9Sm7bvvc~uG!>=>@Uiq<ulJ8x_)DS
zS<LME8T;Ne{5k%H|ID%Wr|p%Mo85(`b(>EU^4}nlAG6PS^1bwbvs&^$CI5Z$GGb#S
z&ztOR$IO4OJtd!MZxnxK|MwJiR{01e$!UMS?0vP|dE4`Och<MYJPJvP5}K}m>)+mc
zGn$?rzcKG^*u#~2wJqn<4n1?-He>%K-FLrVKc8*0_0RNaC;!LuFbJ@NJrKA+c52(x
zNq;QX-zY3d%ifq5@bA}?9mYD#Rc24yYyJ5A#+H)mEy;JjRLnjv^L3isg#R<VZ44&w
zFa3Cp)k$yfe4#fFf7-1rY6(@XpR(`dyK~PbFAw$!%GZ*ZS^r+uEVW{(XI(*Dr15)+
zExV?gs3x07ZY!)jp{Aq%Y3}XE+hyBAyDydMDSuAhbo9^EbH~-sn|mG*H}=YBZMf!o
zok?K%lh2l{_a9Dss66}Cp0J`H(K*|Xg^Aq`=~<d+z2$KB?uCD6%lmC){Mmm~env0n
zY5vu(E7!XG{GL=Z`TC?MFGXZ#hW$J7XS&y-KXZS)zINX?eLds;&|P2Da$X;}6wW>4
zQt4@Dv&71Ye+z0;pG|$gUVDAP()f0}O%Kk$J6IQd-rRG+gW`vK#2O;NWxwTzt;t6=
ztg`sO|A(!r{d&=9-Q~@nuB#uPn`n8IeL1(!#=BDXditO5#Lkj+_-(lBt<9RMh<^=#
zj_0sH+NZXE!^}T_e?R!MDew`e-f92$OY(PDs4u<MC;wXAH0`Fb)6;$vJEQ-xl_&Q;
zx8KmS<o}JwU#`znmE0yeG2Y@cIJ`bGTrQvZr+sqe3f6ibNOV4aJy*q0tmbsmzw?3&
zj~uQu3Fz7jn6UB}yuDy)dF0EbB;MnF9JRiOvS-MiYkT_W?t(vGPfjdfc2|{m`JCOx
zOK<yS%Jsdq(RqH7$3t$j{;Vf2EbG-zGJDTI^1<|{eYcSR29s)rx_`Q|j~~soc`<*c
z{8I5rC7rr~8;rxOj6TP_nfRkB_`}i}51ZebzU<%m;N`U~MND4|)pYbd>w-=)d)Hl<
z$?$jo#4~%R?09{&*5*qMcU$tCtFP^kr_R@8*dnt_tRdrO<39PrlGYkNeZO;${kN~W
zv~|*ATWc8~zxW#l)_O5}zB<occ;jR0&)1U=M<#!N0V<{c+_<%*Kfqh&oRodt*80o+
z7jA6!;F|sR=Df^bHBG$Vp1;<fE}Jmv_?zx?{rh`uJ#Kfd-N;;Go%HSYGU>%1C%#<%
z%*);}o&S7Y%C{wxm=Zq!yVHAr>u1wra?SP?yF2f<Zj_Wyn>1@;TxL%GHnq8KKb3Ru
zx!+p+wLR;+dF33n|1Y0^HosE&+U#X|dQN`Xa!)?9$G`PsS>LMd+rDAWqw*<t?v%Yy
ze%t;!+o$OBnSRa4_xkp~%_|f3+5N4VEb+E=;+~k?rS=TJ&3EcDxHPY0RY)uIm@cz9
z?Z(E6q66uZ7C)(Z*_`?K`1GeGTGRL2z0{5SX>{rMj%7FUVt;YoGThE<yf34sNA^(F
z&yDrD*+nn%jZ^syPA2o6?tasD@&Qlue9Mw=Uw@`9{vupbcf00WgR#AAe7wPpFP95F
z!@sEKO)_{J*y`AQN<MRTO>NYtS6a)nBX@o}c<h_lH9gO7{~tK&oV~sHRLCYC{+lgN
zr=$dLYJYO_R`HhI8|L2LbAS5Z*U2%z7Vdh&nI;x{aDMm3-5&psb1+<7kj>aJNA~0Q
z@88wkmmYhT>${9o!n$Bf^1&w(x6*P9{|j96w@%@+^8NYx@?O>2x?{&~Eb8|Zxt)7x
zUWcsSa_fHHZHJ$JQ9f^DDxI^N_qLd>^#Q)t+TaMkjY^5%UqttwP5;&Z+4);itah=G
z&f&b&^BT4K-#CoVU;G&+ozHJ!>7UVT+^dnOoIAtbESd90(!t~L|2%fDSMij7?0@t6
zl$#op{3iXcI`L;m?)GWU|GF&?$Gd)eaJZ-|^@YFI-<TY`o!qlO`kKxEZ{@SU;q6Ja
z{v|j1t%Vo=&zM&GhvCAa7f}og(%NU&Es&fRXf2oXPtlHnp{hieAz*R#)qZyG>r4zL
z%)7)GR$Scr>Ui_gY(|DzjIrDdS6)PYeSGlJRtAQ%4eMALvQ*a@H)@IQR$+!{W?*0#
z$esYPwlB~uDJ@+acj@wF;cH?>1_lDh*2dkvc~kP5-l?ZWiH8?$C=2ZLb+Ekv>grsm
z*t>VH=YA<EsZDwzYw{{DZZh1L@j2{L&At2#=9-JAXP=*bgXIb*xZC5qeDh}G%mB%m
zzAs;;zP>#BkIS_0tA%DaSS<u~o))~E@*?Wm#H#A*!-o#9)!cmYM%|x35uLscb0HSR
ztYL~Y^}44zBXPEo?8)jW)7SlRN}ap*$g&L#R~lDj&t+#|aJbFU-k|+N^t7mU)Uo!+
z+E1?80o!JjtUYs^Nq$dZ!OCpWJ0fBYRskhzKirpLU|@(kyYu4b^I!UFejl&@aPnEM
zZ{~6FR_23U6{fFhelRs>UYnTH@cC7$?W!XuR}0NP#1z23Yn`ZAfWOOHms?&-be*qw
zEm`YwYwFDS9ruf0cm-|Axp%E4_h{(-tv&PCY894gKeRpNE~XRmukA3zm#(cVrg}to
zZb|Kk>fAEbV>i>xMOVN7`nn;}()48%Gk^Szy)4-QCnYzq=X2>4Z9IroQ}t3Uy{KiI
z)}^{?+^t!|p~`!zI{aYV6wAL;B{QovwoU$`w!rU2RG?y(>ZLHHT**aYO1Y|+;wENw
zO<TDp`)B7emtQg=%hZ<YFHEdSJ;c8Ii=Pi9E*CjLd}9RhT<kurZjcVfj|;QWo$Yf~
zT-W(JlT56(7DO>DBvPyXZNI)+C#r27tHrLc5Qs0M+aR7ko%nRsuSKaZq8b*Xn^+zB
za?#eGTeTB&U9m~;-coY$mF9cyZtn%zjD71wMIoM=2Jz!tp{(dFJh9vbC2Lm*Y!%AX
zp16%CP<!Gwp-l1M&)DtTy`V}2yAOW83c+qx`jzz=lDotnpat#HGQZzPUVK^B{5ZS(
zdCsPp$?3~pMPV}`sCt>Lv2}i^*2>VI!M0t~7GnA&>-?7KUDs}w?Eh8fKVxO^MWYhk
z0~fcV#!K#uZ=Dxk9`*ZLaM8<me_g#1&stL~t}^qfzI^bb&(2dm((K0$Ux-?a#kRv+
zuD?5%dMY$6YICv)E@Nh|V>LmK=PPZQ`oHB4@v`f+F9eN$V3C)%HvYOGSU0xRpx&yc
zD?6FttLybHE=a7L21nA?#9Qy5Ec^dxzMIist(n)}%dWo6dY>0F7K3&#{d@0d^lG!|
zT2aBq-w$1|!jcBER&O~U`}fnuwa@p2*<LMwc;LO=Z3}~aX~$RiO7q3o)nsj|OWz`c
z#qi%tYD<g0eau}Px5aAy>8oG=gc@QC^hw{2e7PgM`&{+KO_Hx;6Pv}b7-hZ0*0lKj
z%6;5%TjcImy*t!vo!E@c$}gGs=SKgy*Dby`W9==QqIa*RCps%%*vjCJ7C=Yme*1Ii
zZ~FImudZv>J6~>C=!hk2Jo2kPJ#ls1mK>|HG_5tcGFXyA$K`vUkM%Cecw1eqv?f;r
zi;9TLb~RZ>no-vMaopL`y_k7d^VF96Cw<r7vU%j1efi+Ws(R<bpV%DZ{rk>U{mF~A
z*1f-RcW3K{g`8Nt<vQ)#)sr{fx6k{$=xfOR)|E4>6P=5(L}{1i+u7Tn&%052uY1~A
zAD{EByuQs?TsCV<dfM~(uXaCheSLB5^J8l7+IY{lU{Tk%<^4I`HTSKbxn^H|HgR)!
z+MzZzEJc`z<E_u!->dmzKQ2nW+<EckhJ`<|`C-DhZ3nYGFIv@P8Li3n!jfXv&MUkB
z`ugNWsh<;bH!s4H`Ce}MzW;Y*(3Uc}y<*qQ46($@HQ(PKR-Rmv@l|G*(f$JaoQxza
z_UO*~X1(*}l8js{i+e(@r?I$oYtpT-En&HG9}&^=@*-wx+ZuCgE!I*rD0}H#y(s^$
zu{%oB?Q${%u{mN&*|H4Zvv;_qqu8-zjMYnI9kG^Wx)aM}u)5i_{?^O)7qebsExc#h
zytU20)3FR|X}rw0y6)jWaO6boFV9Kac66Q9jDF1Yu+sAKKI`opUOuP@+LE(x>pu6@
z5?G?3ZFy}{$*omaZr!z<o%8I*%$2jZKi~KN({ay>x6CSX>mJrg+<k;4A4tvkcIHjZ
z`Gwk^%e|JlZ=2)&?E9WV<(@t!EP=y(IZi7oeRA5@gjbx#tIhglENvy*jx}L%abV_r
ziMeraLiokkUitF*`ug^Tg4pVikXtXk<3;9}@%7+TkX`=V=&6?R+M9+_ZEjdH%gVsa
z%Uc`D+|UXnQ<b+rTYvvAfA2oCXzENenH@52?pSnt&j0pu<8A-1u^e-=Uao5XdHG@R
z#@Ln%SdymZ<$YF`yB{8S>a$$SV(oovv9sUBmt#qrnV0sJrq_Mn=pU9V=XvYO<J)fh
zf8K2dm5kR^CX23JIkWoVv_dRlv8w!*@#fFJ@6FqgHZ?EUx<AhQ)|H8uCrh&*yZ%OE
zYv$p`)9wDgZk2AQvDkT4|80|Q_TPIOxy|3T2)=E{5+QP#;yICX&p-9+@oN`++l58N
zwoL!CcTVR=`oFQN|8eEXoxK_NB_r&xB($idwspm2&o5^8=luNjN_@+j8Z6oD>hjvE
zH)a2(-nstn+{I0wusAw&&bPJJpZ8b2e|G)8*B+DF|4;k<d;HvMbPr}>3I5Ot-)?Ff
z&yL?csdD#&RcDoF^YzW&{VP?X#R*HAKIOmrM&}w+Yq#%v3LpQv5}qj2g{4iQrT(@_
zeN#?V+Wn=%i!aw`tj6XK)k}J{O0Qo%$&qN^gvAr0KC^`*OPw&9m$CNOrkKgf#P7CF
zpL|xv+IXs8b=I?ctJUqRKehH7iFOM|ZVf8D{_54MsJ%;;FIQi4_VUe}l59)AeEat6
zT8y4}nC_>k>yD@`kV9?2y{(!tbMAY~64l^EIZ^*V?F^QmXK!0}d)4(-XKxBe+E+Y1
z$a=?eVyO1iQeACtST|=;-qN25zs+aLOGte1jk{N~?+8Yl`)yT(R#f`s&{wx@`TzYr
z=O2_Uw*2_^Uc3LdUq3dtoEVxswRCOIxpRK2of8+TNT)SV{`qAsQg;ZY#hv}`$cryY
zomD$BL}!7DpX29z3YAv-O^MYm-gfHQWOHGw+x_$9wKsCE5Jqiu?|x<`D|5bN)tN8T
zXS<il?JawFY;FPb75A^Pr?n=8D%VFRWZGSN{x>AFZsDeLVM)Oe46hungF1DuUhTfU
zS^mf=pZ>pJ_!Bi=t$eiZ>Cux@gSQy*u6lslms*g`$j~6M$JXYT{3pAKQ)m8Dj`d#j
zXx-EgSyy&`(Oi?XCiSL)^qcOPubx`0Z)JOA+k)IPc^hSETUPz}fYE!oFQEMR&}_x>
zSG%Wulned!W*YB_ng^>A7Jf2RHDfGwLM@EKU%tC@XyWC`{$FEHh-mG9m2mLohm|J_
zlCK2&?z(p1fWymmp&NR1_i1nVaFoqEhv`)dYNuh{jjt=$|BBoH@5i=_CH+xbD^o5X
z{3yTAXj<INdH<H>r_?oa^J|4%+q#Bh>Fj>dg->i-?(H_(yW)X0gRye1&&Ih+%rRZG
z;K6OywIz{XXU&+mnK9V-`@FmLn#Kpzw4;{WspL*PwQJh^46h~CA<NWe{xRje|HLSD
z4VKjS>FnLz^<SFLf4;Bx;|aICtet6Pd7ffVbkUP9OF}o9TD#@mDtNG|*V5eUmetf!
zT?ISTK2MpY+Op^0_7p0AE_0kc?{59eC#}(m0g@ikofxIl?k)WK=X0zq_GNu`j-UDU
z#5DGJHyg7;a~>_}Ol{0;DgGp1Jm&l7H@8{m-zcs7zkB}OUB>dq)(T)#n;tX&*Qy7%
zS?fQXI<D@veD$6d1#HUH@9nP8{{O0}KS%Or(UVuL(&dL1yqd602&0z#cIM5W_4juF
ze8MfC8Z~WyY(dtuIEirXC2L*K3yHULzTG%-_wI4K%9PX2*Y|G7{CjWXtNVHp0oKdc
zx}z)3o$>9?-rr$M>pq-1KC>%z>FHJBtl{E1@zTrgI-nQ7SHd#=ea`Q-`SNm>?9JD4
zHa`!!gNoTRIjtZa(M#_ZVCYcG{9USV6hAq2^4cxFi2;ANdfxKIsMjCC3bEHUdec`%
z_`k9G|LMYV;mgH|bG+_knoFbC6<tQ4I(Yf<yzer*Ce<sQUSDlkzW&?wy&CRQGR<`{
zRO^7+(BJmjZY(SR=5p=vZMXUV-+ui#dvjt;v&*!y$>=5cQj1IT;&=S_%d0xvczR}6
z>gDh8|9-q+pMQUDG>5aaR^OIrR`kf(T6If2@6OBWzg7R1vgZ04&pB}_<Lj1aZgh2~
ziMQ0<mYXA$-=bzq?(DJs{_5oUd9QX)SQ%kvyZe6-v;D--DB)$Y7!BgARiK7`HDBz>
z67|_;d_DeW?`&o)e=c@U=I5bXA!!Z1VQ1<-hB52u?ojfbTJ{CK23xuE5~!VZSrt+q
z&$bmemzAkc@&2}}X<ORqiL2$~=5g-M$iu3&@{*mQ)!vBta(Yommw&B3-Zyt<)}-#Z
zDJv^4<*{Q#yG>@kmBqZwVAkd8@jo)|-xl`$7k4memipT=2lNEE^s?S_BT-XBW9$8C
zzkm9yJ>_%%rje0Zq4}K!rc?c-x4NQhIC?4Wn~`YfF6-?D?_N!B_xH`SEGoTwo;$|R
zpdQqTzq2D%)LZ&1hDAp&=@riG0`=D&Pj5VAW@tP8_mguswT+LT_j_Aiopk%b*7R?&
zQM;|bU&uQ>`_%sX%R+T>uP~!Wp{P&w&C?-Y<o4&?eHs4#?w_O4^P_4vWj;QzW9o{p
z)yJ*opT7C!#kJy@v!~1p%a!|SAOGXU!9PiJwJl`rOeN*wPixIEdxg<n<XRT{ELCgO
zOu3szpZ-p_ulu+CdjFhxdkP-+)qmX}y6wz{lucsh`!Dpw`|nX=z3c`W3PkBB2dU-$
zm$>@)wwrP2@=YhdUH%#KZf5QDH7;*$s&fDDp1;@fQ|sIR&)yyi7o0O|XZVNeuC*Cg
zpExJ+PWO~9#R%W$Zs+Bz%S&9Zuh@`z^%?tpg+G7t*T1i>e)Qv}=4`*X9i`t+_4o>3
zE;c)R=3KjV#7^bq>T74Oy=j<rxs7@H+l{UTZl^!q3PbDey{g(>ntpH9#naC7*WI_?
z_DlVyT<AHGgQ;3lP1i9ByX%L4oV~eNzGh$Uhg-q5Oa0<(cYU2Bx*`34<;UKd!1!g0
z6f1JkOXpJGGx~SV*A_j$I(dGsMZwN5&)5I^T&!HXKEA&A3HR&dhsSaYW_Gnb*oskJ
zW@2PX5u@_=|88m<gBs0sp^sL*?$42|OuN4{e$UsJFE`#!cjH<v`!`ifD(U0Wv)R$;
zv3d8*n?IMtx$I4HWhDH!&)r?j9X4}Kd}Qq=p{bH{eERdHx32oO`g`6pyPcEmv_q}l
zcIXFR6j*xMEf>AMiPnnZuV47#QTmF1ukGVE)qVYRVYz+9)5oE+yT7egFPnS+&#kG8
z<!kCnKfN|*Pn)n!2(x~%G_=}#W4fGPRI1P1^G~<&##z^uy#h5{<5fXJgXn>{^=8S2
z7fUriEnogi?~UEJ&a0b~?hD2+fd&&%D<q%U?zYCiADmt<r(KuIJ^x?PXL(RV!Y^;v
zDecfLmA8`6tEJ0rf#>h;uCIFYZJv2v&HJO>GyOtyAi32lcSafWM6^WU^V`MNtnmBQ
z$@6V@@4xbuxf?Wu#aF%3@As0sJm@v~vd~3w7tP~U)s{W)n?Lu~pIcMa%jTZHvOMM2
zy>9XOf1e+Hzb$GHv~{%M_^T~mw+a<<RZ;4Rna}!noyp(lb!V4x{?VN88~x|iJY0On
zcarALeXVcr<fm4j?(tmqwfcD0SKIKj^UHiNobYq8-p8}yC!>G=5fZOmAFuyWa1AJm
zik`gsxH(w(GV40|jID2P{_RfRE;nyYMrfsN&z5KY)@m5x^dwOK_u25U30_}TyKkR&
z+rpsk$(NMQ_u_t=Cz{or?F*c}=7g-BY2<3-sC6eV_wk@dxk=>}?O)Hd=ZEFWMeZ-p
zxqn;u`MSEu+si`ss`*<RVX@7A<K`Epx|b$@UHyLlpThgEuixKY@%r5zryYf#Ge2!n
zcD{u+uya=I>yNWH&E5BHxc24EKkxp0>9ZxP{=Bq~c0U(4GxJ&9)N47J$9uO-MXh_J
zq`$7U{(Nl;-~3s3YTrzLzyHt2#nI<eS6$f@ymsGDuf-cPw@Y6_D>DM!YRmH;9_qC|
ze$MCX-nzS1muAVHp1-Z?%ku8GtN-1vS-Q|i8r?&|*H`4<n`d45@S6U;UnQ3heq8=b
zFC{DJ;K}`~D*o@Df0Os^vu(m>&Eqq#nC7OSx3YY47w@zCdewU8OWXWA6=naI7WqZn
zZhCsqR2S51_;KY)`}Fj@yPWrR<}Ca9OuP5ivffMR$v{o^Yv;w6zU;@ZzdQHy<kIBy
zWi_>&b(-Az;ZI{uE&9BZz4{-h!cg6OyKV23h4=2)ES=~l{nZUUkmbHYhE8V2rA)p$
z`^?V8(dEzl<92`wfb(y5Z+Wv+=g*d_pZD+0^VR%*Qg-+B4b#h>X123lkwi}p6<54n
zU+3)7{3)twCbOfawCLKYOVgCY=hr-3+|KsI7gQMWUHks)tGW9=iT#$hyOz&;b?P!7
z_X=b5$k;fizVgof-`@)^YUM|5PA++T;Kyla{(Hg|wXarh2o^cW9o>l@=Q_{#S68ZB
zUf|`^pJ)61%s%hxdpjn^s0%!O+zOgFLTxil`&@r(o6q%M-Sxi?Pg4%>pEFNp_KwrH
znO0*lnKke3O#8C5tiPw9|5I8Yle)~*+U;;|fNb0i&_on+b0OB=Jpa6`o$1dv|GZb5
zP5*uEAgKD6UTn2z184>cxjV4?S>D~5+q<^by^mPtUTdoxSGwUriaAfUV`)VqXc`5%
z9Z<IRjQ*Ya_m9@ja}NJ>KI!JH^zZSn{(gONl3y;y+hDWl%r)~qO0JE1i0RL(()%rU
zKkt?He`7WOrC)!J<i@npH)pP_wdUU!d1LXsSv%ABY8zit(~g??-pI|==Iw?CD`nJ@
z>TTEAGw0<0KKKmEuFFhsemS$x`}ldkyP(FY_|nC8MOBxwZp@NhY?f<L@bkk;&vO}9
z!>n?zpm%51Pno*ta`JZb{bf%l>fZd$weIfR+uy$(Ia2cQ{UIgDq!~&9`S#P@J+|qg
zr?^6wB}KlxRrKUl`}FifJCr)WQ+TL7tLn(l+~4n?^v$;@u>8MB{Pp)fS?kHQ>k|wi
z(`2X>aO|P4E7!-#{WAH#NIbjzdELir%eR^KX!Ap6Nl+`O=d*X0|Nn7wW%{?&^<q1+
zJ~zMS+E@NDEcN<E1xzPr&EMkR<Ckw`v9GNBoZ4*5vNWw6kCU}U>EAc{%iXQgyS&M2
z{^`9{pEhf)KY7nC(3}}GQHbp4taeyq`wF<RU0u7YvijVrE5WtmM$B?Ijgri5Y|Czc
z4_;c<v8xij_6@RLvNvSQxn<Q?wpYvj`E9Nrr&Do}`*rO8s`tz4*$dZhalUf4c?()1
zT;va$MN6s$jd9GByIYm_{9^V_|936Y*F(Mpnv0@4u*>ePFZ*%h)>RKcC2@XVjbZtE
zP?KEq*NWL(=ymqdx!X#Y|KFlqee~OzFLT!_o9CZzmA(>uC(v9P-Q28aTTbsRO4#>0
zIQ}N@@3{T{n#1kR{Z|P4w<Ya(#*Wmvro~r2D(0%96cJ0G`BdN3W>*7cP1~~H;qUL>
z`EzUP`@I#0|BK$9_LJs|;rqR6^RphSFwk5va-DKzPUiF-MGxx#KKBk=7bo}YO4W7Y
z-P0=T7x-q^PpdZATyeYU^26ZC59401v0U6IitaDd#9P|CiW2@k$+x)k|6Tg~*gdAk
zzaK1md+n4_@+45t_h+kB9KZ5f&c%HaAiY6HV^^<Uo&9yvym|9Bn4Ldxz(Hb*imk=;
z)2&;(58ZNAHDmnh03Brs5?&VjY$|hYRm$lT-{b#PJinOT?(aKquTk&^>5a?M-hsMm
z&)Uo)FP_??ym8$ugI68kHdW}gtyR_4lTVqLn54w6h`9S{UFuOyo#j7xa~t%lDnI{3
zp3h#%c{y%(^~c!yqs#Z-`P07d`uhEoXUpxkl+FuoQ(mra&eyXZ+OS?b`{cQdooYQ+
zpr+L=FT}vv!$j3x)9$L&YTHkI`gaxb7+lu8Eo*<)R8*!tznESB)BkjgO+eYx1Glo~
zt+>qy4hrVo)7HL!`<9oxJIB7R4m1)2pEJ*D+fqFLPUXMt*Vj6xT7_=(1nX>Dahn~i
z6Eb$Tc;Ui@8~zx)kK$bIv+tgN=u>g6*Ey<Yt*i_9N@BSgqAs4~cPp2(yS{VxiO4mN
z!uj6({hD!um0`=wuHDnZb;8$Vq*io(+7<dCw~_yz#f~dmx$?NU9b_+TWmwQ)to%IQ
zvg}>{Z?2Fv|9@Pz|Fb>5@6YMz#j*OLe`l@P|5Do0{VLOibz1MDI!l_Prp<r0DKG5N
zlh97zM8*}&_najlljD)M{uQp#bzf(<N%i)ooU_lauiI1pF|24~m)g#vgxr&h+Q7+p
z)xK=W*RJ;#94acTYjl*4+z{}wQrCnFHm~2bMSa=xZ+mS6KfG!>|7Lf|n=@DL?rb&q
zlE}NiC?S_~ky{feAFou4)wYZlo!0$1Y+Cf5kYkT_GjYe~Y(S2WRq?m3b>BPb8|{AT
zi}vh!uXb<vfA@Uey?NZux1Ikka<c>F!=<NoO%q*M@_D1uls)Yis>3&3y;i;1s4hs`
z(sru-rXzlnzzabjv*98ATh{xXdsq3`?O!QqKx*Inudl`P?r=W7<zu_Z%@CZ?rk3j3
zU!3AGzxmV^m3SYO*RfUERqD%-$J|yW-YWk7PTt=7>zRFTp05eZmAhH+;FI;vm(%Ll
z6TW6im`-!O<+WsONaS^<N6xUEVF{XsxmQw9^Y+~wU$f#jXF_glc=GE?IH<c-6aCF4
z?0NCd+I;^lx2svZHPy4OU=&AF{i@T-_C3Ea)u$QMdH!+b%-)}^zu(91nfkv|XaBkf
zFE`#!)Q<?U%DN&3N^r=%kEwpuD>LT$hHL(x_VEAi_fF4?Z+dgD`~9=^@N%{MyEFN>
zyL-J{5f}~jK2jqiMCq;Y;>+E<uO2Q6&4}7sc_ixQ&eid4(TgSs1ulLDT91O<W?kuW
zYc^kBx>e}EFGtpW*5|K1rM~G@pi<Tq84Txm?0&GFfBACv`l`HlanbQn1+HE$y|a|j
z3rL|%`;DJ#mO+~<0aF&bTv=fWj`A0~uN^t!lAr&6SLy38{kn%m{{H7bd?>iVw&VhI
z-9w1M+dJyzX0kH>yZ1n6o$?xtM0%u3oj`FTQht5YqNlp2|Gka6a`9qfx3jZzBFhHY
zXzx;=Tk86EqV|`+S?IU5;_5+2ahj&#td?~JT$~2oiCw*a|NT>;zg(tmT|aN$ymRNy
zZQ#*?t#~<kdEV~w|1a3*+y6Y|KGQ7pQEp4v$!Fp}HeBPXxRS_N>IQYft5>h2BqTVv
zHLq>0P**g9%`jB`fAiw}zo&PEcgwvBS#8#zBfZD0uDC4g*}cub^_QCeOmRJJ)*8FO
z2GS(kGIi1WDAxOW5jnQEB%wJ_Dr_34S<s&=>p6YJ@$J2!6u-<}*3x!oVL}b4OJpXq
zqvppImGmuI2f*!6k7&(z>#p9td-wi*d9fgi^{q9~0pjbok9>)_|N6T8%})WRtCFr)
zY6lu`{+uX~)hiC_Jx|;gbSE}DAz{Jd#mco@r|s9LY9BU&h2z^_JMF$+-F7g0wVC~u
zP1oK@S(c@B<)2z*4rzAY@+vIXO+K6T_0`p|b#gJS8&;ow=6jI8aN$|#;+0tbWZ`mi
zSsDLuo!R@oKROyOCvR)+b&Cth-^XT671zCd_wHHstpNg1&u=aLcFO19SKWCx%R%GV
z+or;nO+~Mi-6a;l2c7H4J{mQxbd}HPTNVa+uMcxv62ol7t&4j%*?Q)*ty!Nv&M(wX
z7A`;Bp$cEU<@K?2?Y(>V)~#C?qc{DG_!H&^7N`TRp7<X#tv>SF*OluJb+p4*6=@&6
zzIE5`-Qnxw-cB#s?)Oyu@QLHgw@q+_ln`a9VYfEPWS#~ua+$a-s3tZ$DXHoGIVV<V
zvWQ!GDr%ZCY++Vd*ZOS6sn7(syXLWZx^`Y<AKa&!@78Ut{r#=!`Ho$?cdM(Z9b($h
z0h!8pTlAz}`=eJhvQfLUOG`^d|HOoC{F;#tjriHZi!aaS>sx<!?&gzeeRF4WN&owC
zeC5pQ-Tk#ewWo^^!LYGx?ZbzO*}<=`t$qFe{q~t#8XFt0dW)ZD5CWSNG<&(Nu{CI!
z+oi>mG9MrKF?IH4P??u<`nv9EHR+hh(?z-Swh2KSuSaif^@?e{5W&v<xIq=BAKWbD
zz6xp<&bFJLdfE85UhIxS^*d{VP<67gvsYJFTU%RKS5@VxCBAO2_^!YO38Gt;;G)d-
z)x$+o&1>Hu?OuL7ul;t&^0}AAlpzh_r4hTQy?*!Z+1@4%VQ@TNIhUEPr!~XAHvRO@
z$Lah3y$Snz%QDvxvV<(GYj-x|Q^<O>Tb6IP?k)z+ZC`sM!Rws81j$fvL3QN70f!3q
zM6T;K?rbolFK<<HgRGnLDlA_cqj&w{MM1rej|O&ITY10<bmiR3{~Z4x2N?^RGH<))
zVZB@zNz2>Y+t){LKexVpV$A=&%a<R&)-HHJ2%^*WvfO^l-*5hTFAN5E%1VA*N!j7p
zyCwY=uOq_Fb?fxBqfYLbe|px8882SEcwpOdVgY!4-7Vd>GjINUUSDlnZ2P_G@~^$g
zpSiyuKAW}V?xj2hnD_T(tG*Z2xv?9X=&yujf_hlTxA!jNzB=vtx<7aCZTuoNe@zBx
zd58Jxx!b&UZ-jPyG~cazI{l!>v)#LQ=N>zsU8q};0x7g}Cw=>I_NM%vPZySN&N2L%
z_XxE)$3K78nxB%o*VQu3nPINjo&B_E=ecu!^}83GT_3mime|^ioBQn;JRk;MTy9(b
z{@-cm`OEH`{5Z1ibADfqpjo!-{Ibu`&d<^vyQfLY$@$sMGPSU{arNp^ahb&m;4svD
zx5dBz?z@_Iueo<eKL)K%Oiz1$IBn;S%X!eHi)%${uQQ!;0cYN$v%Xz9v-j-!SkI_w
zzW3{YzBcDI^IDT>t_XE!*5P$iPe1+j`}f=X8+ddUfkSzb&+i{MSAH=ykh@#8u1@}7
z)I^QTd4ACTo=EC-DLJ`!@7}$Oni5lefrp3ZM%BL460DGdapKb2&)@DGYy7w*_2!nB
z4|c5OnJulmY0GR$SSGr@wP<IIyL<cAm8Gw*{p`7_n;k!Q?%ZzG?5$VVmM}6y*4>E&
zgBH?VUcMRBsVn~&cH^2%lGpB&f{>MvK{c_fw{O256;@=+6YaCk_Qw7D=ffoyOF%*g
zyecZiZtm9KH`KQo<>W~fF1afNi{E|gu3o)rYG5EBCKh?xYrFmeXplB-Ij;83?&l$Q
z&(l%6cfa&YS5@-Z9SSS&ro?K0j$CtQ`L>3p7ob(BOT+wsgKE%CPhY=3_sX*5>9x6S
zv6pHi*Ul^BhOFPrU266+Du$E!G$cTy%-^2*%_e`h>fMc*D>tl-+?sbww;i&Abn2ov
zQLnG9-CQp$D=RzGv~9hy8#E&>%8Z{oC-(biZqJLLk<VP;8`q9RnY;~if#wrP86U9R
zYf-jhGq?cFI=Tfk-gj~B^GV<}xI3$R|G!&Pv?b}5ZWq+HN3WwCQX!s5!&v3{O#I#d
zM{E5jPfP7ReXQl;+66N&_d%DPBD(IT>7W%Tw(WAe+IIW<zp<Hr2Go*xY##lfwmI|c
z%(5xau!c|1uCzp~2l`o6_xM1Ca9!=SO|y*OYCt0t-X07RURIk_QnfL_HfBrE<zwN;
z4_^qo+>&`5=6d)r<SYYlXZfj?ajwjQ>_kau+JsM@UTMi(e|PTbDXY(bdbtv}vSt~)
zjlg1??{%lIQ1@#7T4!o#c=7)I`?J-jpKcXApaf1&pg!F<+ZIrl*E!l(c$us=G~;yb
z&W>F8>cxwQ*b^5n1W2$z^Uf@Tw~OWL{w)Yzy3T6GOuqTEcrdhm{qki^^!B`h0s|f9
zqmXQKb{c45WYhgMQ+-~4@4Gp}VAoZX=v#uY@_)zfu<&qkSMF3ua+;;}wy5jcl{0${
zcCng<-YP^==I;;c1V=D<!By(IuT$H)>iyT(?tcDxG7|Bdldmk}W!ICpGrhSheM?O6
zQdx6^k9hg{%gf6Ae0*9`7eH1!udKYZt!S!VRAO$-EcLf9pkWAUStZ=vRT{Q^*QWwm
zCulk8JE_cCME9~v=60lVFmgH9blEe9OF1S&+7qVEw_YyV`uWAy4Q6g<CzQ=blz3tR
zc91}Sn7O~|(`N8O!Aq~^pU_(SFmpRU)R~K5OAoVhZngXSZu7rr)a$!@EiAKIm#ppV
z>^ykz;JthI8XFnymbE59(mNX{ZCPnXoqw}ir1qi_ug~tgFg;&lPyY&acX$6W;o72i
z@AB69bU@meL5nZdshjW3`rIMD_G|U=cjt6lcmuOTZsm5sveUaLXJ_ZQb!_bHx%a+&
z`xf=}*1p<m2}WphTWZp`ovY*RHmQoNUH(gN%a`lI>ph$=<w4iluN5i3{_5q+jf+IZ
zrt$FeM>9UYA_i?}*WL;Pt++kceeKrWo!>O0+~$|vhPDBhf)m5_fQ8w+#iRS7E8052
z%g)k{uMl6WUN(38(G3f2J1*y?L$ifQ?R6;`86IxU65S_|cEJ?TDz50=*3S`3Omm%Q
zmd!?_q-)>a-mc_Vgw`S_FYUA5{vqT(tA12}j-+Mz*V7vo&OLF74OXh(g_P><;o;%+
z_5Yi-lX-X}e}6KC_ggM40abUu_9n-H)@@d*o6DMQk@US~0CQmZb)&<F56_)Dmw(;Y
zeMh>))VEIP2N!8VOKkTS?0<eiR6oj0_V0tw8y5cMxYP!7=8N6aK2MH1wkkY=)usok
z{_mgs_3EzK|98)C-J0t;!Au6~#;u;$nWjNjY+tp`)eiT(_^SGERmAOeujZNw!Q2rK
z3aB@4-+nFU{8i()r&mA{($I^&Z1?NnbI*&fEK5@B9@gEsu<q3?vrEvDW91`Its-jo
ze@j)VzrTM(v`6Q}oiTbj5hB<0v^K6Z*}r??QSV*L-&-AKXW)dS@4C$WlV`_mtvu3w
z&G@%o;1-|1m)u~12_12|ma_EdD({WELX(#0^YQTfSoB?KzW&C{$is&Z|NZ;-<es;y
z6wbj4{#C)Zp0BI>d16|?7SLj<^5<fQ+P;M?-!icunohM|M@i0|J2$NTkdx=jiDr}c
zO`U(@Q(b71aDY0*gSMAI?XnlwisQD-d$rrZv{*kUqx!3dG%GB_Gw+^ub@{z}ar4W!
zT|Hkl^+rhV!i9>rb?5RzD}Gb|-@mSe`@gYz?|M2d$1sOseJ-qtv1(s-B<rTE6jL=F
z@#%6em#_N7J=Juh(CkA_H{06Vt*xy7ylpDmzb$%u?e8*q29=UnZU@fgb~g8STJI_S
zU~T{N@P(Bd<QN*J1s7ib^yrC~_}V6A?tQu!ZiQR|k1?fg-tG78^4+_+t!JyIPuH_s
z-^#N~>_Wx+`Le!U*Iv#4^YDfB;zVW!2Hh3lC0tNvL_)@w7Uq-*=a*kwlQZA*z1KBn
zPRL->s?b~I&&962m;JnGYu4uzprz`Jnp?f3Ps8%ytKHK!#-;c!oAYgwT;zs;uUEc&
zj=H@)|NXmn+jeiht(LE5^7`7^#qj9yyd|>M=&DNYlxAprWL?_I#>RH)P1MVYvE4O$
zJ@=PxII>K1qjc2KO}A$)*>iL6ZLj(4&`!$N%=7wp?w1tY>7M56?&sgedm^~@mWD7i
zS%*SbbeT%lr!V+uHZ@1Le#u(>^vhn6cVE4K@BiIFJN9Ke3$!dhwPh`6?e!#)wTG8$
zL@f=OX?DsT+L}NbT3RBc+{<6~G@t2JBREg3Qp@eS<`p{GEUX3Ue680}x>+6XuR9e&
zQqR%M^sa03%=21!HP$`avM~sjoyxC2`n?rarf=F}?7I5>*Vl>6UaNF+LmHrFJ$e^a
zvtR5KWCcX%1T)vwNuo=7Pr-`jJF%;~-(PpS2`R&;F7v&(>X_GMx1-R!r}=K((eK#{
zA;tBju1m`@LNi@67fT^r(DmT=R=*y!se=r@*zQA4-H^htYw6tozhA$*a|oOjR|V?i
zUV#-FNAGU+d0n^v+L<>szv};~T|U<MaplbF#DK-2*S1<&TkmC<Eu=1C94`^@XnEK(
zK5vM5pDyct`~7<3{64kMB5O}QS>9^}YZSiN9rjwQV!<cz?*Dlf1(rOkj9(kr+S(>A
zoWQkf+SP?A^RHERZ&lWhI(gGWJ8E0RhP<ge52r#}2tPCR|NgU@{pVAa!Pgqw{r~Tt
zKNPSgpzhWRVQ973wJ+P($LGe!?cq$;HQP<g_T2j;u4rRuHCJY`$eg~q50w&8{-*Dv
z?zJ8|v?!_k;nP#~Dd*hOu4)JV<C_jC7E>?9{rU^ugmasHee1%Aoj$i#$iqzEogKM6
zYJ1*X+3wr>L8ol&TD*V%{@uH8vzx31O<S<5&&+&$ph9Ao(=}(E2`-nWO!|5)H0R=`
zPe)t$z4x!z*W9>I^I`I(=L>4`zvcg{*d4$BIM061O_R?gE&3y?*9}f*r<TO-zaMWf
zb4#E-BKkH(rRttO-+M!Fr|kOQzrL7qPObZT@2vawd8cJcuT)nhUH{pne(=&;)!MQX
z*Ho7Ge>yLCb3;n6YgYHnRgdLF7F?;iz3{vIZ*${&)^QOPGwijb^Z8GvO>&>QZISFW
z$ZGJ^OL4ocr~fpaG85cK-dKd@fW;pU9z2+0_cH2brRr+ina+G?Q@%^fIeP6{x@31)
z)Uxc#=bro5pZ_-Djf$@ErEiaYH8(p4zgai;{qY;ThgY?)EooPUbopj(c^OqY)l>Sb
zGc?OxEMMF7cU9p1^;ai+234y!zn6VenI}G}Bs(g{<mTj%nQF<OXP*1KAXD^J)Uj`A
zz9-ZE=(g6ymwi4{aeH|#FE{_@gD2JIpZ~vdZASZ2NGh4RWqK|D!Z)An0#7aJ{RK;Q
zJ9ba2pT6<@ZNZ)LEBX2PZ*Q!a9546y#!O9Xg^#QG#O8oosp02N_s`Gp`uz2!@3j=I
zcTr|H%x~VCWY~Rp^Hq(_{?p@UzG?fZeER;wO^}>e0xcn{KU8a#UOjjw<m`L>C70b|
zVfDqG*wd$+-QC+|yMME9f3x8Jt?6qw9{y;ss54ha<JbPSw;pMry$0Kh#5_99CcV=#
zGnzYfJ})<ScTUQ(S1N06{z{O3puWTBpsmQC!W(Ois`Vlkor2q~@^)kA?$>p7il4c)
zjYEI_=Jvd`0;v%@^Wnop>mS<=e{?A?FaI3>`L55|JJn_Xm!1ji@-15sbhcdbxB3F3
z{9~KLCa>|lu0GrIy0rbrsV0)Qv$|)xO-b8+wq)TMxtwESxvBru_9uQ?aVfg{?CdXm
z;a%WV`e{r5oOv}Vr#(Kce)V7D%g-xX_4NlUZY45)g>}p>mg}bXp6<Klo9h0MH^p6F
z8f9^Q*w6Zwy$VZjdgbfr?T=X+9@Vz*SVZpTyx>LImGNF(6TI(F=gj^bHTmOg^_+{>
z)7`{wKlFk`?)&+&e|JycpBD+5fq!;FeA~Wf`}ZeQ<if}0?!=zfnkL)P&bmMa+{}1(
z=c@kx-G5&%`np$KKW_dntsH0B54WIO40FK^$yc-9J7j_j@dJMj{r&sCZd=yp>)>L#
z_`5}MX#AdS(0!fAgRl*gKxyDr)$W4F=f21Pv&fA6|8aS}Mdib=8*NpOw!(H!f<})X
zK782M$M;I?6u9Ys{rugXt^2O8U+$m&*Z2O3ll(ubk_6*!L$_yw+QXpc^Yg>viars%
z+|3QHAeWWSowKJP`|Z1!OPl0w8g2T2_x!ouN!!jn@}9j#6jlrTT6Z;+C6-$ftp4oX
zJ+|9lK5)MO>-(F3-gS~ZpmBNVrctE9vFwbxhyNZ1PwvmNoxWv_skPhRRqy&hlRwbC
zo$v{SY}I03p4nw`d(Dik<<0a#dr#qE2p&Xh*+049?yk~r`TqXrFI)(K4fS6=y`Sw^
zaIN^c*uO?OexS)IxV9a;!}O-Ve(@q=Z&hh}`twK2x9s|JNP?M}8P;N6cd7H@%Rku(
zXY@t>z0*PSK<@p0wRd-wUfXf#)1%CF^XAEECnQQnfR~ep=j1$kXZ%}FRrmC=CsGne
zK{MG%=>s%b3hH+*iC}y@7doh>ZD3lQ|NLV1OLN||b&Y{MpeYepum9*>(6I2!D9E_u
zUZvvi??4^1<J)`HbWclNf0sNz1&fw70g-EG&6vS)x|@xSEhjaCVH&sud|Lhf(OUKR
z9~zmFpoOuQew@9zVJFX$wJx`i62PgaMX}xC3U6XJ)&Bl=b#-`od3pO&*O^9b-@xNp
z(+_h^y}GL8^rlOxSG9BWq|qEZiJO1gvEQ7D;PiPZ@9xa|wQnYWao;R=-|W}w?|EXo
zFC}E6StunZw@q%V&bjP^U`HN}m<`$j_xa+Qx$f&hBZSIfD2d|HyC{dBVB?$o`tR1Q
zdhc`zvN>d9=kCPfrJ$K7SdM{?fZQ^Eg>Afg_2kXcd@+98*Qm$;cro`*$&Hw~-+Xol
zdcd|8gQiZJo15?6y&GHE*4}=YBSA1$TkEYDbTQFOt*4;YNcQ~mp#2v!`_n*+A9hwx
ztua}>pv-&sMua(!-bICN30og`_u@rCt}rf0F4+<dUP~0TLe9sQ|DW&nHLvVvg$C?i
zdN%?wdR|z*_T9U8pqcfCM@2j5Ouf|D$T(YGO3Lfm<=2bduXlMxyVin6YrJe@wtQMP
z3uN;)uiXz(Y>thMy(V+W>GZCzPoJz~_P>>4oEW;6bJw)LIyvD>>t*)t-D`HN6m-~C
z<)1*+tWegMQGuDOSD4GnoWHW_%oq7>^Q<cqkKUgZx(~zTzkmPU-k#6Tz4qj<tNn4m
z&eh-iWq%{ZxO7$YQL9kjUDKwUhcC*$xok=N&%a`8qW7JQnyG&)dGpa(S9EuUh1}A5
zg*-0)dhyyzc@~$DvgfqO?Rj%e^{o5ObIhI{y({DD*1W4*vv0~(RaNN}&(^fB+}+u`
zon2ts^opHc>$iJN3t69aVe6txVS$&o-r~wc%5m9ANsD&xzRh>`vuXX^Q~FVMp^@A7
z99G%2YgbO{u3*tQ-^&@K<mXS^*LgZWZ0oD2ee<8}GwQy&Alr3m?IO^^_3iqxXF$VP
z4-Y&w*kyN1{cV~9a(4N2{(r>XO*4D`H2+u@v?k+c$mGq@FQ)}<h*$l5a?!@0P1B_}
z@=aTpIIZBBY=idOsIt#z<b<{r-=2DRuC3PWjYl^uv?^J<VvF;YYn%G!&#n5@+V8X+
zwz#sY_S)sG&bQ7sBhTEVwm<&+_iy4t&OL^A_SZe%Zgh0zz2NVk>wmqQ8GcyVW24&S
zEsHP3YHLOvtM-fV_;@S%aqY#jc`F^XUq$WP{^f7l4~F11{h<x(M5pdp44Q~M@$%&Q
z=&+NSfA1M)r#_taRj~Zl**0Vguim|DYhfWFHml+4JRiYJK4tqK3hI13H6>*6r`^-0
z&w0|8IWs!-*p&NQ|2$(oKhN@YxS4`&{J)o*gkD4icACD5E`Jtp`}3yo?sLm;gLc_{
z-&6Pa{rBFb;lEN`S3kSIY^wgXEwhD@BkXin*stDP-s=-SN7>)`ceeiT-OmpNbv_wQ
zwtN31d)1q$YkfAkw~OoEq?YOKKQ3f%`d=nIA|j<ZyQr*to#@mbi{$oO?*4s49klDM
zyE7M5PGzT+-8(LWKEau?_k70AAD8mdP%_-ZhYw3%UlaYa2Q-N+ab?Y`l3bq2@qVY?
zM~THQd!@3+_h!#q`&!}fwCkG;RlBBbTsxET+P)W2C%QCWT~6M<)?%slG++OHA10cv
z-dWwHwRO#mOL=w37U)`QY)}5)G|l!!KHJaI)xQ=!RbOW0zrW=ADV=F`<?$PhrrqEA
z>3do?YjkkclK1vE&u`*i3F=(A2yFejVzGS9zmWT_KBs>j)Rx~rdG@tA8?=I1GPesL
z=bURFK5USkB7Wu1^Q|$v@<QXc_|*O1GWA|WSE=sr>sl9@7oOfKrSCM;u<o#l{DhUB
zb+>zp+-@yezg{R-TT55=>zOxy_H9>}yKgpYUBqg${x34SCjEZmCvn9m%IfVjXXK>c
z)%<n!+UotkAOAbPN<T`Yah>Q?vEHhzXL0vmUpJONwdqo-w)(Q?hZa1$yeM<K2EvJD
zFQSBng`1n3_wL=x%*?#gNxYPS2V}YU)~#!v*U!!cZGhyPKg&n2_TrW(y|>fc5VqD{
z-&A+?;zhxGx!YFk-n~2Yo&$&KuCS0OjaNIXzklCr`|-uK;+NC5zI!g-H-B!{D*n`|
z7o0NP8;}#U>6Qvxw*S*~|IY}^&tD(9{_XAU(CM)#rL5IKVJnQ{r-9mQ^Y#>I_hbm_
zPAoG)DN${0ZNs)4IyC9w!$j?bIk%iZvju16zuq_!yE+tNb=11lo#55T$PKY|>((uF
zx?ZNgP3~>aI?<_VeN}Z256)%_&;9pnF?ciQ8=upAk`3aGm&?i{!s^BDYY!eIM0hOB
zR+Nv`*5d8|g>*24<m#Y(cEwh&C+aF++db=vcBl5W4_j`dmVUp#z1`C;02;Sm+8B8L
z%sJ2=pDim>Zdn-oJJsobdHH70PNi`5^uuSPBAGAeIU}c4$kgM-t5>hyzyJTiDG6ui
zYx`<^A%m++8w2%4*KYP)US;rg$un{P^uMq6&R+X_*})#RWp~?90xYefV#nsqpAT-m
zH$CFwqa|XWE^b|PX~hcv9zXqUE8DxT9lrc)Z*t+Bb6zG|Z@(e6MQX1X)dii7_{z1q
zp&g<HR4tjTKJ%r1?}tE><(q|iy>{CorqE#nj9!ZufjX3$;WIPO_FXhEQGzSGs`55E
z-tV2&hb6vd!eI+1%v#cGboBaGH8nLWE32ZNF%jo3U%q_#_HAh~@C37oR@N@DSG`+O
zJE~k)y|KKyJoo$W#nbnFj^Fl=-|Qw&>FSnOm)(9odL8xm@84_74ml~-9qie_02+E;
z8W;#a%|b9U<knlz@hrP)u701Rb=l9pAxq9}_6noiH6Aswt9S3-{h&N+>DuV+ef)W#
zd8DasuC;H@Txs_E`XQA4^5uuYg8$y;!;J7TeQ9}h$=v@8HH-2@gMDvBto*Sn%<_Kl
znQ}>GPy*@g`gN$+x<AKq`pfW>Tk76N)QBH5fcby=;)wG<^Q-@TI@Md8Jin&k<Est6
z%E|eA%|Gee?X7-x6;#yP$yODg-j^($Q}ymZ{l=5ezwi0BWxwpk2Px&-KR&OY=kx!<
z_x-ke-`1bGQ*9Kuo$JxowIcD?U%h)L2U@G*T2fYaX)9>ef|v6mJKM6~7uPO@%#)bt
z@p|sgow&_swtH>*w{OocU(fxt>B~d+<Cje{|L2=UY2GS*U|;_B$M%_3mvb&(+k2na
zpVRx+pRKxL@z*ykN)26g#5{wSkMC0@cmUm1{;T!Qm!Y%W_k`K*%iZ$+$Jbuw$Ju2)
zx3)Yy@bvI<wZ%4zpMJ^QZhUFlO3y3XXFWbu5jHcguJEYVW%tMXx1TEc#NWQhNY>)t
z;wLtj`u@(XTlV5*?)?*2rcRqzcjteE2cvh^r(13_AH9xBySwO*ad_B)U%!8^%_x+0
z0*&6g%9QTPSbKMF_nXyS(^dU;pPjhP=WF2d`|;to%{Sj%x5h4ZU){A=mp{B%aCQ0p
zId8n@=2cyIx5q+t>SD#<>*wlU^FRC9T>thx|CW<-OU!L&-;;Rv-CRuW-&=08pMTor
zWxr3(WL@5QUjHYj`TTWvEWY3W_9yjO-Q>>i0%9S5v!$PQZ_4K7=a0S~wYO^P)m7_6
zqLaPimkQ*9MsQNE96#@;>iT-+KJJbC0ynUv-crb&skPWod~H$R@AqfxQ_nuUm2SCO
zIBfo(E0-s3FORaUeCaX$>eTsrE+yX0{Ch5c>G#O}FWYbLf0>(m{GZ?M@3!l0-};`k
zzO*|%Zfnq&-xKS99^d!hw)k*LRN(oQYH$Cns9lr+Nrf7_r%6jlc>J2G{d{puMs&&A
z6(<(i)nr|Y4!bR;tL!b^wk35{=dK$U>%VjVe|_=3ZF;O~W`O;>`ZK?L_TJz2oquor
zv@OfxWope<`sCMcxUY5j_s-<HQzy=g)S8y7+w>Y;S@k?*^0t%p5+ZAbR{2P43l&~x
z3Ii?4^1bpBd<eyvH#Ijdq?u$Mp1AEy*P?kle;@6gEq*?}?)$;p5B>gpd0+nj|E1%9
zx6Zxx{?9bg<scs)UHSgP{is5#f<Nx}=Kis*knjC}uj}$z{dEzAQ4uSCzh64*%N)_A
zu>rpl1Gadrw#%IYJ@SDi@O^c)QtTG+WYk;t31&h|VztY3@?wuJOJaY@x_F=Y|EpWi
z7s=O^{4rPm{q29+<MV9uZf!{qU3<<eviVox|Kx8I;;b$`T|TdG|Mx|u%QuVP|MKq3
z(YK4l|7ERtRqc0hOZcgG<*)C(k7^UOY1kGtc}t)gWOL2R@+-CL<Ndp?9c%nprWdvB
zUZ!&Imh44y@*V`%+tuEkb@jn+``e#yUB1@(M=jLvyxsr(d#ayZeR$C^J0RT7HoZJi
zRPRpq=~bJagGNh03(X+w`GT&mxa_+6`Gu(+`p@E)?ON8$b7@`Nu8f~k)<tu3f1bX6
zer@uO`rr4|=imJL-=AOG@NdCybMv>6Pv^H;{W$h4eg5xwBj!mfH(j>7h`bdcX#Wb$
zsGqN<n|+#CHuY2YH2?oMzCYhzm;U`T`~O{ETK~<v_l<XV<^6^GZNEI5w($G+d3%36
z+j_pJJT1R{ufArPzR21n@K%AKqp{kxo%@T{EqbSX_|T*nz2~oEBX+NVuDM(pd_`n!
z)2k_FTuN`VL{>YfE=#Zf_I_=oY-RQHc6r(Tg`bmd1WJB--@Pc5Nk2#RQrN0B*<ZhX
zQ~R5hk#S;IK<BR1=DqqeH)Kt`Z?KbN_jL35`WqoT-d_otx~`s4wWK%6W4F|9KAV|(
z_D7e^-*c((#aZ3v{BQsNeVP4mnyBY>-L9}q@S3xgo7PRec=KjvsfLb?PNwg@9fxkY
zmQ6<8fWP!v;QPwQY_6+k%v#<n<guH{xO{(weR<CRe6xQAzs)B*g%<n*<*-WU1m8v5
z>W)tRcq$MS{g=X4m0$OIQmz}lWolyL#J9)K_fG{MfTpdrwb$yeZIsB`nytRlODC4i
ze0R3K^xvo5?)UEfoE&at)Vk`%6ifKP*wu2~)ed33ZEbCbiUen_dkUTjD%~aoJ%z0G
z+NIyGFD}Wjy=-5UXR?O<LQ7lScm4f;zS{r2?EU{G`|W?e%e;PWse8VCSJ|K2XS`<r
zd)S)4zy8_xM16(;Wzllo^$~eD7o~EQp`VSmAbVj0bAC<imVe9gpPccC;9pQVr|SRP
z=Hq4Wem&i_|MpM&bg3!+*LK%k`d=TxUj6!ev)MhXsiv#HFm#DESgqWVt-41F)Jc7+
zWU;<g?RYiE;-JYZ;HL-uy|>Zq|Di`hS(D68x!ihp?@zdV@Be=nW=EU7jhve2`|_pw
z`VyJS>gPXCzkgOATwoc#7B=AxI~E{pS@z7P)~@r}3j<$71+KJvwK+U(5_r%qXp7eh
zyWA=3&tCrb=-ZK#_A;-mzidCck2U-8`TsTdH}bxJ-ltow%OxG~Yn5oO+*Zh%cwg{w
z0j#mvA7dL^_01xnvwR_vUw5vKx7+n~jyPyG+6Q#FO@PPL%w*SF#&2iG$NW5da$i#T
z&JFjrKHs|h{;!1pN1jhV#GAFyc5$8vXaEX*F>{^%srOMcCvIy`vi8geA4f1XYtg=f
z$9%5YuB$wywXcR{PG1*cU-i;@{oEVhF8+8gF81s&Z`P`{i}EaB=7G)+IPaL6HK~4o
znA@hS$VayY6<!g(T<i~-Pz0^3mJWzHnz@+i?SyYz&lerly2ih~{&PCB|K6_$>sBWw
zmfVGJ!dSU!9qW<yb)r*GE!tO_{%_?zZqJLmtSqI?7A!e+$t_jM@3z*p2fOXHE7o$a
zj;M~SuBs^cuzII;V#!}unNnfU@E&yU+ElJZ^LCfl|Gj6ZAJv~{TmG=^-Gp^lLnoMN
ziN)Vi)w=d;?)_K)zuxcG4pZ8<Vzwk`EDE}mWsS+JpRK=b+t*cGjM`fHWN-KOLu^wL
zmu4=Oy12x)_<Of`+waNT>zAvqj@WPU>&?yX{Acm2V>M^3h(_L>xyIzxzU%9&FK&AI
zf_;AbR*mysm)%U2Jbr)rx;boV-HyMr&qi((5_Gxi1R8XLj#j3+2Flx+&J<ZYz1@yC
zJ8+xm(q1jo%3Is_&AC(hz;pJe{aaq0d-Ha?-Hrc`{~b3HeLeGT{iP65?Tb$W-P^Vx
zHn5!P|26kcNzj&UGCQTNC8?hBm%f_)Y|Gks)%ToRW-iH#{rTn2zGUf7{wcY?pT>h4
zaA(6d3Z0cHtwD0i(laa0$Nnw4`b<zCwC2KOe}R3@0k0`D&9W9{UiK5$o&WE5cmJNc
zS5Mbg@1Gr)dD(dP|0fTm|Cc;|cC_Gh+SM(A?x6DoVVjXob^dzw<jv#TZhJF8r=h*O
z<8-4zR7*YgidXTnx$#@L{Cw+_v=>{V?kUlc{(9xi-mSZf<F@=b_ee{3wprE+&dYJz
zGXDO3SAShdeUlM<p9f^SuGh;I@6YLicC^NU)?eiPQM(@*GxbvD;%&1G-o~=e0}sVK
z70*6&VcMmZK=&S`AoFsu-Cywk=HKaiKxd$RdiZqa2F9sc6V0;L-MsWK>)pBf-#_D1
zPKBm{YT(2Y@62s09)s6fL)R>+F1lCrWR<w??7sPPxv~RWg)$dEo23rwFZ_G`eqMdr
z_xUNaLesqBCv4bi;(z6B1Cq^Mu7A6?+xd1~+qYf)P*lkBh+8Y#(>!kPy1dYQd&;_p
z|C)3EtL=Re{8~)+GEd-keo)?n?u^ou`1)~ku;;~Fm0zMFx>t$%NS9u^vBiG=zIpdI
z)qV0h{^7*~@$KqH;U_X)E=rY>F5L|p#D-;#KPxWBFWvg^K<YlP)oq_HyZtrM0u>`S
z%X1E2zP)c^Uhr-{8%v{aVG<uduyRK4&6w%tdUqaD`cM`A3Oj)=>U;4%uhqwlG8eD=
zlIdSlw=&`Mu8LBN9*>Q6TT9=U*WdXcv07YrasRHl6G1Dxp>buEl^u3%{ho}-$D8gw
zeI2O%a!X+TsV)0=*ap^}?&>$n0*!q`*R6R8ef@LjZ!hy>@cI+W@~__V4N_j0+8Wf}
z&fFdUq+V}zZPc{OF1+rb)$h<4@w}qXUt9aoaovYFb<bM@E6Q(`r{zD7Ke_jA)U?&*
zS3HpS1oT_gK0LVZ`ug_V6{h~yIt$Ldn*MF?&-HEh?%)3VXa2J2YyNRBGY(IC`bymN
z6OtFYp4Pm%8>nZq;vjeQO1VsZoiqE*Kj}-?|9k#&+SbhTt2T?@=TW{D1mFJwX)qPN
zI{aDo_94l&%YW_okWl;aP}r)<TVX4V?ss4P`)7XC*G)`fZd+E*a_<#Fg!a+ox`+RE
z-79d*KHGQkb#Qzu?+X678(yY9zaL$Fn7jYa>XOq{Y2WAb?A`zUp3VQ0HUWoMYy?j`
zKvIhC8>D{!%&*nQ;fdUUqx3L$^h&kN_}@C;H#aW7q?`TsT>jtJ@8|6|uD0%B(9h9D
zBsks7G|)B?(fqKVm)GChEqQF=yoyBa(3#)P>aW{VvPAptCQz}~e(#RZ!EpZTF;fGR
zT@hZ`x@761QnT2N`|f^zaNqRye*w0I=RmsWd<!owXS@G5@|X7JdH25c)*d&D_|2vK
zVMEtqH&!I=^FSL$o`P0c&jL?}cU3)VT^ka4>+s^{{}+Czd!F8uc|O}e{<n^}+2RSO
z7P+M&>jlkmgI60$@H+?k@7XXlY}U7_{^#G`xIZ&5GWvU6`J2i7htfp0Us@5!i}3H-
z^tbO~;G0CQ2<zu8{d9TW&fiD>-Os71x@|sb8Ysr*{W+|t_bhJNr^Rkxk?fS)6*l=n
z>)MdCTkq#pew}%@e$p15?3nd)ZyZZy3tw_(MWFB!_|Ds?^PAo)-YIxcBmwr-mYiF{
z^W#tL$^7uMx&ADxf!2ncD=QR{-1Yp%%$4kOvp%kBW?g=G`Hr5gO!_%Xg);BY{-5>X
z?);_qO@1t%zOVS-r`?IhVJl!;TcAnd<@)b2XTGdX`89jr#GkFd6J=g?if;?rxJ5rs
zc3aw1kQ=Y<UQ^q8HezQ|;9@x>56xRWdGr6o(>r~RemdE8Z6$waREzkwpt@Ve<@;}x
z=Qv;5lyht2{^CcUy%UYKrplYXYDbiD-818N{NF2n*mLdvTebh><7JVSF;?bHSy3t$
ze|?GWB+uWAKi*%y-vU&v6@B7wKV%l7E^PX$3(26D)qi)1uXW$n({q0gZ}xQXG80vh
z$6sv~zCCGL>Sg^tJL}@_-12R&R0Exnidk(-+p^o>B{<?c7{F__CM~ah{OsubJ(nhK
zSyTVwukpIZz+$=52nVD>Dob+vyEFD1U+)oL+spho@$F&ogr&}_@c*U1`M1{_YerSa
zRnNK{`Sk#Ft4k+%7xU>2bx&PSOHKc}Zo{`k&{~MnqSvQS#<I`bax$%^w{(^6-|WfL
zw$?r0e$V#vs(h!j9}j^~#D$d1SEc&q%=@w^^)hJJRj%BkFr~Lu8|tRU9KM^D^YPf(
zZcy>!dGXe+@4IW93u95WG96QUXSXT!NO#!%*Vhl<asoLwTQ7D?&8-iI=9j+xGwpo+
z|K<PhE9bwDiO{GC65o0V#oe1{?=G*udtSc+vSQgVM+3BCX!o{H-C<R~9)A1(a(n*&
zVn`BoftR$aZ`%I99VA|P9@H#exA2ndYxdj!&(7X&?Q=^C+_i!2MK|5LIXrDo#?6oq
zO7FodeoeQ$J}`M^-PD=?exLu(oSFRrB^dTRdv~|~Q)~a8j9jaTA8;+n_35A-S^ws*
z_oZtOz?-_4tOXbOt1I`~d|4^J_W1VRdwXofuT29@=*K!Qz3-ec`=0&hYINnEy}oy1
zw_3(je*m}7PJ@<PtXr#}=fCFuPy6(!X})1w)^sAq2f?*gmfL6U@AV%}9go{`?Y%5_
z_GyPJUQ1%5*U!B%Ei=-r^5Ukoh!Ie5X+P`Y!{CRryX9{h6_pmv%;sMPT3~Vg!VPtK
zmA|k4|Gc^XyofGhSRCSymp(q{L5HlAudU7ZZ`t}3?69fTpW{{KuYnq@(fdKMZ~v}d
zM>7gB*#b#=mv34ayaSKneCA%dZ>NQPp!USFwJPuBYQClauY2}RJn`*e5BMA<ctN)5
zbm7I9<F@3Ssx4Aqqbm*4;2ZN>=lhp!`4!iz@}I;Xx@Cjzs}pD5{Fx=YIBv_l|8Ku;
zC{qO|G^L+nkDv4ZD~$-{fX~Q48q{i=azD%xU%Pd8@wMHDZcPQJlzUHKr|-=GjRx4y
z*ZcZk9NksjkknH0>CoB@Wvw6!R)4=VQSW^ed*6SJHCj#ZL3xPBgJ<k6|9?{4?$e^H
z#V@=fb{B#2UFfc#M@9cHnf5pPb7HO_x+e~ucAj5#v8v|wiz{dLZYX;Swxi_5S>3vz
z?DN_F?V(4}V}H-a&fTlc`YW!3&$eC50SYTqF|lX!V}G4{ls*6Hp<9p8y>a8up}+Eb
zK5Z0VoBl19D_h$Ylwf-MkJZ0-&AvP@G%?f@%~?`!Ua-%vz6jdqeD&nb4cmf19=Uqs
z|Lop-TS3)iM5qv2=(^3Cwe$OrZ68{re&7GAvt}(5$XQ1(<tyy@^m6BhZ7T5j07wnc
zyXEPLQ2i+Xudy?Bm)paX>&3}_TlAHGZ@pNUZaZ4o9$vCP;Pv6t#)-M5pfJ)dd-8Vf
zy{&xvKKdtKEkgJ3u|J3YF8`%haq-rlsHgEOrh@hb#cq`UZvQOy^`EEZhgUtFuno38
z0g|VB!u{)>xvoB?f8`W7Wt<V;uD%DHGTxu97rmy3?i^-N{@A2iv+&x(;K_-(x}ZuR
z{Mi$EzRK%W{~pA*ho&mP_p*Ukn_p#^&DU3b@z=l8^5^xhJeVZG2`W`jy{UYg`93PY
zc7y#IEoRg()!jN-9CUEJ=J%6xH*9kQ`})JxJ9Fjp{x2&Bl@Tpl(JfImEq`D4yx3Ad
zYIlFF(6wuPpjcpSb7$Y1@%PEpz74C;GtrVbxnEbhug#KO4BGaX`xfjCg-Yg!`F`J8
zL!T<5`eA8tX;InLX9b=;kJFbQx-|>5lr?VU%-!)S`3ie}9zC`16=IqSoFk^4Gybht
zc`<5#xz3tZrXUYbwfc9jJ8sLizn|70TD1u+Z3|TvKjGGoT5Z-3u358tS4{P&b`=wQ
z_J85`^Lw)Q&bJo3HVrhHfpo^iv_og!`~jUoeZ8vk#pMm#_(0)wx)55|y(~{Zd_4=)
zx)(K@j-m5i^8AX6QM;|n%kvc1tOad1c$*q|@z+J~`yac$HZS$hlC6J#bVH>oTJpLY
z`);!JNmWC?xE-R`uDQ>4*LAzKbZK{(5vWU8p8l;&VxtfuLy4BJUAJ!CRqv{*szbM&
z*x1+(?YO$y+S>Z?Emy<}Z_X9$yTWSE>fiZ)4|D={u0?_6nzggb`l9-`cxyy#$@#VZ
z{Qs4?T+LyKB4_2MbysiSp8Z98ebCWY)AD7dq&~UM-ahHs=WUn7a*+=fxO#p4z1=Te
zL33=N6ZCTLZYjP}wItSO<D#dNb5||MLqtO8wXH^0;;pUiH-9aOnOX96)7O{2bxNmy
zheB=}cy;2`)KH!GQS0aZ(OI*0`L^C&iXOXXfV#9_R-f5Y`o8?|1*90gx;s14{T1ji
z0sigF&Zs3@fBc*bIkIxqVqSK=>Wfj|KXZe&-rcIoy1hcWX-oIbjr)y**BM>z|1Hn$
zd>S!j8d7`x)31;<98dE<$vxeEN<SnvHWqfM!0NkyKK)oBt~<MLueH=QrrZaAjrad=
z7vDGcW%$XI**OjpTnrt7Ut>?Nni8t4?UDF1apu}<3ogZKf8KWBXgOcoy3hj9@tzIq
zLdD<DmwkIftm|6+|L4Vtx);puS$@5}y#80O&*@E_i&z=nE;zL=wO3=mcxr_ECc|^9
zr}yd?ep&^-Wr6X%;+pQc?&~Wrg4UAGyeV3rn|<__!7DbUw@LeE?cV%$di~VQNVCwg
zP#$;qJaCBb^-qhYYPv41?EjRVEP`|!!qs~_SI1Xf-1PFui;@WKi+O?OVwvJ8uG)Vq
z*YfVI539Xsgq*l^_v`%b>YBFk<F#2e{|?S(+R3Lli!FBbv1j7%?5~y|?4I_3d#lkc
ztygWzZ);{QGX3%|?sa(d_qy-L|MrIlZ{dL#IYFthr@O-r3j5Y=TAiT3X;JFzKTD>a
z?AgLM?aBto0Tovdz)v!|IYmVGtaw(ci+pLY;@h4-i$u+?Fd-YYTKlWunwIdzKE9v$
zGgKirDs<`uCkY4em#kfN20V%T=&6?R-l9jB4Lmd+t(Yy4x%}$Z3`uxBvGmj~F#-8q
zVWHEyuH7s-{j2PJbN%lBk$>5ogbT0uc5D&;s)y0=0G&CkKW%k;cUYFyuY=DMS9q-n
zG*`b=wte56KZXC3OLZ}IfKGx1t&J&6u;B^qG=25V<yP9G&)%RRM{E{cL%JFOs@yy;
z?oHi4|GlZUd*4bQUfi7MEQ?mTtdfaceRgZ*E%Ehy>+k>6)sHg!{LuaD-`TgGWom<(
zV(`<1PU-%ZbJ`cLo%eRmx8FOH{qujj1#LNI_fsKf#q2V_=pN{DcW{d-6toWz(f?ZY
z>(e!^BT}WsS+}?J@BhANyUy%g^Z#F#HrH?C{d#3v=4%v-R^`ZORAqtAaR&9i=6D?m
zG+$`uQ=ORj?}7CHDI#m-_kNkHpXc9_TY9Z6(;Rw10c0Fx)u}6I_NIT2Kea_?_L_{F
z%OJ5AuzTs>t9RzwuD6{lvR3xD_4_mT_-?;ikF=#0TnUCUW9%SXX}|dCqW)bgw}gU5
z7=7xaKYF|G5)*rN*sK$2S1q_U0o|Ojvi8!sn$Bz4>f2g*o!(9^JB;G56#`p>W-qDz
z`RnGF=^0nw-|q6xp1fr?BXpkwxTXhPx3JauR=WPam4AfR3f)qCs|IQvz`MbqlQb?a
zpZiZ}Eod5sHGWa3)0a$h{zXW=BT>;sVO`d57k>X<b$V0g<$0mP^W(XsrBvQ+nT--u
zAgf&Ge4DtvT+Q{hyMFESYtvulKRqX2c<XE%a#Vs&HBR#VePMR=q(!R#gw_fr`R?Y#
z@Yj^g<=tWT7w-R?_0I3cg^a*ucjthrI>dl$N0jEiEtg$a|G!?Z|8Lu)OOL#FXJVL=
zlDWM5nz#F|S*tQ;p172k25Q(LACh(DQs(_%MMc*e)pI|+jx(veXrw#0EF0AN2L%9R
z5>GK}={4Wm;3ac?=GwC@YaT84joae$dfD9~bQi63z3eBx_RN(nuBW$T+*%9U^9D}A
zAa6$*z7=xKzTWu%4oF4PE%+u=gbKa4LawKm{r~q!`QOd8&#n|@Zr4MPjI5no%4I8z
zF0VHN&$~O%_CLM!?k)_sJiT-exrV{1O7E|n)9oYG9Elhvh+f`i1{zfJIlXD+$?j>H
zN4G?aU?i@LTh{-6{?FODC>43DEx0EJN?dDaeA}HKmwR+kYLwwyF;G(+CGF`>|2FsL
z?elN`39pY>zwh2==-8#Vi0)+^UgwwjKT&*bul@he)t}>Ax9To>dMPg!BVMDxqif*)
zl$2z(_L^MTwNuNym9xOt;XoSYfuM->vi@1L)^@$EY}nQ**SvNw#YjQiOKZP9nholE
z{<$W;UH#ClX_uTbw_9Pv$-*u5pS;@3*MgR0B!;feT(~7#HV{<QWkL!PQ1003b?c<(
z+VryjC+FV0otV2ibLtjlP;V9`MAl9!V^QDgvwDdvBZeiNTOM1iOpQ`{YXNGxf=rL)
zhFo|P<h?}pxTo%Aq0Hlr=$UPn{o4$`teMaJt)(!+=})G6anNa#`db%4{Q#6iujX&P
zY;x4Hlb8EA(LG{XdCPF_6(iqyWj+{*X6EI66{R=2!IMqbrcX}H)y{slMcMfZDBB^O
z^LKVm+5Lt4zpmT*-(33eDzWQlGTkvsiCJcEJJ0J^Ufgu@+2LDa*SBOIhiw6e=a*S#
zZ<&wRKXG0C{=)sX(6#F`FZW>_oo1R2Dr^5d{FYyJ{a41H?}@puv(If=3>vFI3Hh@#
zzwQ6`u2MhBzH+JZnl7i}WwNRmQE+I>`?K|+G03XxQgX69*^4jW*lj(z-r|YtX{qan
z4%I|Rx2pMAhhYSMPG<DZTU*knmal#Mey_x}V~cKH>XX0->u6Bv{n8aYLYMxnEJC_F
z&D%N&i(&ttOyzqYwSMjmu`t&qSdDT91q66n%dhv}EpQxN4r@CrnAx`FHVcNuHo31u
zKrMr~jl0VJM9;S@_~V{f93wTa>^DYQIks%BUew7iU$*7n`SZw2LU8)AWp~3cl15{u
zxK5PW-@EJT#h*%Z_%dJ4Gsp18iY?uuy7O~_r<AS^%-jy!5DBhMK^0L}$Su&^{>$*0
znXm7?Z(9gjs|DX%3{MqOQ@{27ojbE=>P*n`APK37ZcFdBVK^r+^Rt}O6;TX-8@x>_
z)xNeURcc1rZj7qn*s{6t+m-a9mTk=34mo5C=^VJMid!#tiI!h9;`QHMi;+c*m*oD<
zdVTNxza9TK?&zL|HPAs*9k8{~kbxYu+pG|!$v`O$y|Z=Ku3cgJFJHdo%>G<bR@UaI
zxp(j0eWue-w}y7tEY;o!?%tu@`!!YTbyV22Np+?M1_`k%T<&^FOG#}y_$}Wk-~2m{
z+Y>-1NUd6vom!&D#jP5d?d5iB&&SHg>YMh&!`4zjQV)F5=Bag4Eu&LEpPbD(_w5nH
ziVHMVSIc$nUxxSzZZb5x^!#tw&(>9|SFZ;5Y#LW&|Ew=!U|`4)e(114>E41h3aw9-
zjCfCp8|QP!)I3jk5yff_I^9hq_H@htXABGs7uXIdCb+H<eENM+)0)(!+L6nuEYD>x
zY;=hQUGN<-O?<77rq(gHw0r3h8v=gLfb=XF85kC5{%F-Zr4wa#hVA##d&1rCxt>_H
zWQc*U2{)N1zP3qy7T3Pj8z5H=^n8S#nFrGNag9Z!_^A(BQ&xJa)%zYY-{~U>32-q6
z1_lON-z*+_duvryRhWHFLV`k0H0Xps?cKX}9r`3B|HjDN(NHc;Y5M6_-ugeu>FMba
zyH)mHUBZ6DUw6&XBAe|#GhR-weYSP(Psy7}HyT8_IQ2li<?QJZZ???~FZ$}WXNGr<
z)6qB6JD+Cmk2qA+wfCHDuK2Y@Vn5EVNpCNkR~Er`E0lLv*unjh=la`yp1t3qtM>QQ
z|2e_iPbE64vj3gQm(YE*&-$-_^~SXtYCo+LFU6j|roKM?|L?hxK5=L2o*a??I`xyp
z=ii}+%x-e;JCZGz>a~ByUvbw>5symyx_;ibPF{a+LssX}?AM2xvbye{sXF;yIPR*0
z?Cxp*tv3I^_r~5#_}a6DoFT{l<wWG2l<yZhK6mM7cgKI5wp`!vJf}O+S?=^TwjX=;
zKdZgBwBAi4_@&TOdns$bMcG&9?48m5*Uo?cxj@PPsY&{G|LmWA`rkZ9Q;^U08@?%>
zH{a$$+pFrh(>Lpj)O4OK%nm*F-%Pz;*Gs1SllxMs({ju=v#ozdKWd)*KXz86i{&IO
z(P^I}9{dYho_%#rs`quF6aRN-W_$ga>N54mS)FH`w|Qc@4NU*-2|MU4|64fd(fW@6
z=9&N7Ql}iB>~GcZ_i5Z8P8QF3-<}^4GqzW|-%|AB^=6mro7TRZzTG|d|F8QJaW}M|
zHZG6f_;PX3{a2q$*51<k+qKnKwXQeW^-byQmr?(c>OK_3A6nmc>r=(s_&Q^570%0B
z8G>`Kdwo8<;LqauM^}Y@>EH6V_vD|e2RC`m=lNo<^>4P`%cy-P1%7n>SiLLa`X_sp
zng8uyY4aXmCi>xk?%@r8J_PPN`<wgrjng}B)H7+se=0Kd+$PBy|9r)ay?Ms_TXHW7
z@o}@n$^S{awqbhtqz&osK0DlAm3rN%Zi>9vv>WxMN9(r!{2`>y8*rg{TgWE;n_=hg
z><;^tU-t4-Lyu5l<+g9zRdn<>nV#%F_KY`hy+_@Hlku;=%r8i`ygh3}LsUe~!L<5D
z@tV1drM~St`-ka#z2W4_+{k%<(!@T*i+gS>(LHcwN4Dsn_gNdWL|;V3ZMkI1@N|Q{
z#OZ&Zyo|ob*S!26>w7(FVp3t{hM9+zPuu(#I8`s8F`0edzpWGggnbOJv#V>r($zly
zUuocn(mpNGH&HX=MZ~OQSBL#LtMhpOy3Zf2S>CQW7OVZ=eAdRPKlfkxWADK?DeTmw
zEq4w%6~2tmHJkr$_FS2ri)2`LPt#o{?02Kve)FaW-SVmx+g=|2`-eGr`h2rhPtIy_
z?!WO`CiGOjXZp1#|HB)yKFr=3XmO9hCp7l-Ke;9UZGO~;{H&MzRKHSGy7Q8b+v&4O
z{HMKjPJWS}bjINJ6rEr5Ka_lR%AA&~R(#&z^Q5wuD|+R3PWtBcll#VVWB31=C2L<r
zHoUyP+;x^p{G-x7t;jbo?dPg}-hC+PJdcCvkF$3)#EL#?vt~qJop=3Hd}8Mp#g+ff
zr#)mobm;J<?XGtJKTnwW$M##Z%Jl#4xA@~^MYqe;EtvVRezx)Y%ISY@p36~vdumDi
z`ERHAv*pv0b>41h@M@hRzO=q{O5NPWO#kfjj3!MluhJIX{_MxuI|86c`C;1vD)tzh
zuQM?)Ff`m+47x&;!Qt&i(ET+G3%<RG0!ar{g9}y$THLyto0yT2@%7c!y?gg2TK4mw
zcv_UW^ITO`m6f&iVJF3HSC6%@GB895#Bw`mmTkyBexK7?hF|(o66@i4vEkw25$m>=
z^nBet{nE6zQQr<+>OZ@x&;G%NImfpz%TM~e&nR%w&YRbS_>bMVcBz_yVZq6ZTNy-B
z-FMA2=HHf<kf5OBvSeNCX=#s3l55JRzLO{o+Lc|&^iqDE?ye^LLVYK-zg!!CepzJy
zvFY!fZ;?5{hvb8tH!(3RP<s)@z_pqA>6b!dt;;s83rntldN)PHDY^Tfl*SLE4O4$c
z8+ZS^!@ZAx!<q2uyvB))3=Lt<*O>wu<fpq=a(S;QIUK0<*W=Ua{&L;-2{VNQ_G$kv
z-xw|WHtJa0)AF^SelNdY9l^k`;Od2~3?dKa>wC?As&V3&iqUiVoL*Ut-_b|s$gfwQ
zA9KoHWBb86f%lh=KRRi+J>N@y-*2huD_P3K_u2j57xT;TcG5CY6?5~Mwl@~>`q|$S
z+Ixjvgy(YEqyB|AoJ~EG)IM|gzFhnA?ytqV*9vlipFP`lOfLFhaqzYm{g?lJm7E@_
zb8Y3H<umzI{_0$MeY$eBA_IeO_d3=E4Av*MCEwW);PFp!hwife&AAs<Qje8qF#kDm
zJAYn|=|0n&&GISg?Jw&}@-DUCoq7C$xu;eCTdkY>@7ml9{iS9$xyOIK`L-E#72C|C
zg~g_cO?H3Hzdl0s1AE#f>yonmeXE~rGn@bBT18%>;`_j<_h!|dIhpKH<ndX>cy><j
zd);DvHOZXviFI3M9{nS2B|W)rj+m3tnIez;O-G;XV_?XzEYW3Pz40;c*8<D<e+>3I
ze&N%<IBu4Iy_|p6W%nD$o*7$jIhxXY*Pys~@_&g-*`JO}>x-Uj_SyW^^ZF?pv&ost
z-TZGC?)JNHGyndbrO6+yy{4PgFWYy_**o8NedNn)O_Em9)Apad_QUyW?9KiA?tM=_
zf8v?3<&8bLUZ>9=d9QtQ_Qq<@^hwWlPUR3|Xh?Gd#k%b8TZVZN8cQAs7F4CCIs6mc
zmb=xo?nK_F@)>dy?DqMK?Cw1OJNU$Uv3u;7`j0IAo|gQn|KDZp&+Jd^XEf!^@XVWC
zcR(+;x-0i9d;HC7e;j=N`5(VA>q+6V=f;*2^UY_v=6k&~Rr}xgliz&ua!>}2l8WVa
zV61bP^U{pdp6Q%@mcP7MI^V?4{m+ccCral35xB#?<hk&+WeYY`uFRWx=HWiwU%$S5
z+^Z{A{o!0*=!X0qXYP4@aDRIKsPl)fdUMz2pPil;{PWettu^`IZWt-+vOoT;wmBmw
zCGGsSjB0Lf??2C9U$Rg2SFX2VV9;$`$GV{5kMol)N$v+;PMygpTB0le;PcU4Vb9c9
ze-@wAciMM8g@5MHKOe6tO`7_$GW>%Y>(9SY3TE@``t)Q&{$1NLHSeqK^cPVxeYdGq
zx}9t|lPA7Abmh9KH#h&+$yutO_T%-bmegHh3=58e@^aeo9Wx(4+wx~|mVJ-kt&nE|
zH~V)^UVE(n*5z33&Cbz2eP8#^PuVps_w1b|Gm?}qmrtxau<epq?Y&eh=U;8-wxwMY
znY>QhZvH#Dm+4WvW=^^H>i5a}#h*kj?YWd<c5~Jj<4wzRvW*VsEal{`>{k1{YJ+SV
zTgs1SpSlY(Z!j`s=$7a*wEj%Ydv?OYGVfdRizRb@9IX0v!DjE(ANM9D=RG!6wp_KX
za`K(I^2O?pjoTlb`#y7@xb(B`vcpaMYLW>?tjc?}?-!@>ztqUF+j}+Tn0n6tm(o>v
zC+FU>y|rj#^_HW5B;Ib@rlzCA%fWp*ck9n5>)y)cUQ{Wcn>gFcUb+5>+TY*}f7Qzq
zjk=E=Q_nVP+<hi_TeZ*ogYT~#W@K3K^ukt#DM{@6$~MgQkpKECut=$xCpUZ2tE4@9
zRqmdwIP1Z8r?#fZA^+0%r=g0qQ{Ef(E7taV_8PuCm+(39?cvA9-N%maIHT6Rw8Yrc
z+g@mLUEIEtX*H8i-kIoWpCEiqPjj#7n%Jrwv*0z^Hyi%Uno{ZZGy9F&%ji_O9#8wZ
zN%lv+@ZW9O+TC@Rg`r`Z!*!+$B5x*G?N4*je;LKAo?&|Jlu>AIq*>ikb4G>*l^3=$
zn6T~&Oa3W&=u7AETc_+d?$oLGIO=zVk>SFh7f}qem||Byd{rg1vMK$PGzTNY+P-zH
z3p6iml{)8dYwExK<(oG-ho`eJD5%k{qGDiR*y>KxYBIb2&*T5xjix_Nt;k$z0IGOB
MUHx3vIVCg!02^b&<^TWy

diff --git a/doc/images/Dspeed4.png b/doc/images/Dspeed4.png
index eba485d0d1ed779b61c1dd1698049ad6628a8a5e..a0c7f65c25312279b4b25294cbcdb6ecfa51ae4e 100644
GIT binary patch
literal 29425
zcmeAS@N?(olHy`uVBq!ia0y~yV2Wg5V7kx2#=yW3BzV1vfq{XsILO_JVcj{ImkbOH
zoCO|{#S9GMLLkhTKL1h>1A_yDr;B4q1>>8$+%sfCXa4wKt~WPDZTiX7Ne0430vw!d
zte!6G7AZ+MzU$IRixn+3Jb1TM^yleE!l`!~I(E4UbcX*>JiX3_yU2JG*X*eqSQI;5
zm^f8h6lZ!G%~Ua-nSK84{r8fqE*HOk=^Yw=b!EP-|E0TEm;25ATzUIL)w!3KUDxmV
zbn3FJt7|$JI}?XO0|SU?&}OQwt@Rhry}4=W`Kh;7urRU+I52<+1<in0HnYw1=Y5{y
z4ijT&lwsYLcQ<RD&bg0Odd^^VAi_i0VbWB#_U%xu42?0Y9-E4$KDL5sROn^!43m<%
z=LAv>GQUVv;pC~%zSnRaCQK@knFSTxAge)&PJ}k7Xop*_gIjWmV?xT(gAaA#Musy^
zS`+hh2Omtws3Y)%gjez239khl6l9p*zJ2>JLu0Lr0u$5HrAvjnk1AaV-nD{BC9;N3
zU_-=$ZQH_r{raWzPBGS5p@zv_wlw62ly7&jkiyARoxR-x9NQZD;;vr3>Y19lG$bU1
zW%tG{pa|Fy(x7ts(t%5BUvRy-z1=@5I(q4{Wo?<AFY0(+STb?2I5f1rXXIe=bvVG=
zxNe=^&271}SFYN%YZl9C-jG+I^zca_K}DP2M$c72gUPDu>Xj=;UW5iPIav!hFf_I>
zC`Z=t2ypCd=!-l0xKL=#gyR#RDK|9KGWDd~6c4Tv5o8qG?yhp7M3|AqN!wwP=&cJE
zKWK1o*kOC>;_~+#3Ibw`%eW5<Y2NB|aB4XEwuT2}=m!piNuu*2E?(;3HmDN)$j@-s
zouTmpr@<uAT@x-o(BQJ@zI}6+V%Npx=Q$Jv!Wi8)9g?!VCCl0P>{(i7Mn=N(ZyqkQ
z{gfISa+y>jx4BOF7omLM%L3DdOO!bj1OgeCaVtwz?2?UP6x+^jZnlMokwxHyTf@XP
zIa@Tk8;&#e#8vY6eC1GRaA0JWIH{#zw%ti#F2jE78Gh~G!HxsDW8aL6NvB!n9DN%a
z8X6QAmlyf|1s@ZKf<P?eq%|*&&6~&W(D3pg152YCC@afx8pOU3)VZoO!LQ-y+m|I3
z{ERFD8=M;^>R3PW(05Wf@FKLM$u(HefuYfcMdIWs=6-L%6JZTU-`?yBlw)KO;8@R~
z9Qm+UR+oQb!{!}(mo0Nk+8EIh<p<Ki$O6x;CjuH?9^_f5(Z;~U5utXVWML}fQtN|)
z35C@KNsiv2%xuphaq^S%-0CR(123k2Rb1B0q0n$(1yfH-ua^rW%O>H3!s@cPDQ*mm
zEIFbHDyOfVxU{~Bd&7>s51!l+0J&oegK}geAAc`*w?l31-Yr|UaNL*U@jhad{k%`s
z`pIMY|2t~FES8`8|L^_(XWuNEF!j>;xA*o|FI~P|Jw<o<P7ap%hKXw)9Pbcgi*OL%
ze*M}tFIU&rkgzbe9ZOAg#T%C`Q@go2y?<wju;BK-zCOO6KhM|e?f?5W-?!*<|NkHT
zMHgMgQ$uU*N?)vaUHkp6y1(7eB_<{&Gk%MSi=XyXpQ{r8=aKl+9gq7?uhJE9V`zNH
z>anS<{GkrhVy+E4YC{$s5V_#;a&`RQRV8I*r_$|zNB+FfZucbmc3j0n)}3#+-A?)b
z?(Rvmj6+k-PRy6xey6DW&;9>@?>9t$`}XZr8?SWFWVMDr^V=A0_Bbf0GfrAF=f)0=
zS4_Kh#JaCvwR-i<7!wxxHs^M}ljr7I`+C2A^{OU&qnerdor30_|92EVR=NGeOTT1s
z-?nXLmQSYyKe^<sKXq}Rl~-K--_namR&U)JS~BJJ%jNUU-v4Af+AFxhr9tKNB!^4A
zhd4Iu*lTd^T<pB+cb1*UAD=t@<guW;jAHTgbH4koW$xXYeZ6a4uePr4)a`rU=6+gN
zzSp~iE9dvOx0?zdA4`dxd+(~sqBU!L#B`&k*sS;e_v`xpQ{MV}Ra{+NKfNp8Uwxoj
zd2hwjso_t0&F@Xn3|_{wbJ@m?f!Ef@=ie&17MXtXU^Bb#&hs_TjDv!Ll<xn1SMI*5
z?8xW5D<9wH*GH@Q%$Ts}_?pPgDIXsl{S^QIYy7i0vx66(oc)2Nk%MbOimSnk5=(Q&
zzx);P@$%ibiyxo<rRAHke*eE;iR+^`BsAVBJTCjp*7wN1uWR!=`_3(q3y-hesuQ`%
zrS8vT`EI}Umd9tAX1n~)Q2N?#|L34e(ykZ3+wK1>wE1*G+0QU?Yu3~`wcl=@ysm7!
z^ZUJO-=^j7|34DnKf$v2nM(J+FU#$x-v9sa`?Igi{5A^mKMt^;nQxeUOy#^fclwVb
zy;ecOI?uOR{e3HAwd-gj1Jh6L2`NwWJ$R>aZ`g5nK108}{k@(r%afD+*1o;J|GtUa
z{magi@6FENcT*)|mc)zg3|s#gpSPLpv#ZbYnS`<Iw5qjn>y`bjE-gJS>~AyCXG4j~
zn-`1w&6E@TZNE;bjQ@YBnzwvT;W5dRD&Fpw=csrKo2TEM+_%ejwps3u)0^#<bIy`(
z_gnbNoV!#cV87+dn(Cn6|Ned7f4?_6fSqZgxWdV<Kkf_-B}_Vb{>vY~t+txGOxf|=
z#+sj>Qj`|l)_Sq<<HeW8wst=b@}FuIkIR@>|0Y>pIQGQa<Cm6tpRJz%|IhQYuTSgm
zzoS!Uu7B^>YxDg-dn=cDPVdWj=`mB!=l`kjeM*bhKD?B9;C=1;>SuMcQeM88DQER|
z#p1%MJ@0GZ8}~c@dM$nbN86vL`t_0*RAhHv*5}wU^#t#VIpQ2H0S&dAlq5=a&6&wy
zy*>R|NJr4Fwo{UsmjC~JPJMW&_1QKnDbuny5ug9O+x_0`wvt7(p2gyj#asQ|wMrju
zms6itvB-17m!0c=|N1n2{~G_xa+B43z1F?G^fmI_mf31C=LC<aWPf^c5>&`8^PO9^
z>ZASN%l0SN#qORHY@^iRAjhN<S^1!F<y<DKUkf;=<>{=7PwqdOR90r9viFkaTKPW@
z*q3dc74p)~@7%)R>g#dUYdu9u8uzU0|8+#&PEk8-jX`jt-_DZ$mEC(xpRIJydQ-}K
z-Q#%m{onVVL|cWfZ2w&GX5;ZLJstjAAJ6931<O^xG5q=d|G)grdAaxYR4(gWzxUg$
z7u7Nx3KRA-c!vFJyOJ=G!FoHp{*3Z_mFY#g*X;iswm)&CQ<&W(XgSB$9yKegqbstP
zn-pHy8g*07YSq-!3xnIvotW9T>!rEGTwUcRi>|4++)Xd%C&!iFEj@X8R>snIkEhl&
zt8*w!n9AT878WD2Ep)-&y?1-!UY=mBj%QUrwd?P}$NlzsQcF60UUdX!X+J+dKi@6>
z-{1TH@9IQd|30tw+s!B6_*X6tX#T!zmR)VtCat;eylwB*d_H?+y0YDM+skt_eePZe
zo^12{g!;)#M_-;hRKI**j=b^O<PTOlcaL{7GqQXVRycX;eE(`)feWT4R;f>X_@geU
zYVTTbxqg@NE;%dRij%6-XKW4LRd*`Vc**^q%X{aVcwTcBR(pQCwyL-9(u;+!`{y`s
zFTU`^(>?pkg(r_%g#8T8Z_WF=Q}VCcBEO|;V|HGebA7+tud;=~2RxVU+P(X!{r}JQ
zXEWz&f%5uXrA5lAR-$X`gO+Q4HD2+&WWVn73ogFDYd#(opS^e6oX<b6EnN32wV_?U
z?#3JKWuD9L{r-Lb|Gr{w<GnMproqDQzTTOx?n7prFY4FKxi6dYMXO@s)j-v``>r|*
zPrvd~M|Nh^-m0xXV-L#zec}Erx?@*pvs&~yrLw=v=1flUoof}Ec5Y7Qsn^ez%>Q*|
zxzFDEKab_ln%ox+k4fCeyF&e|bnm(CQl+ceW$&IzG4XW2WfFKX-_%Na1)p5y<&{Tf
z=j}Rq$NH<j@2NRQe7;}4^j6L+_g0FK^<6F}-8mCC)x5rN{_ko1{W<@ZY&%%FE-n7|
zt?P59LsEB7%G1W<OCO3}IQn*0g5~1ymE3a<-`3t8wJx~8O3L)k!uuLmQXC#Hx8D6a
z<IJ<OvwfSEUXLj_$oee0=-k#>Q!*z_v$6^f4V@a}zVzgTy2%%A)_bqF{`ceY*(iP8
z<?Ww!-99JH*uQ1(tPIO`zwL92&sm=H{=8!MndR17{Qc&CJwEH}&U@cw-&eSQ0y)y|
zRhih~x3`ztZ(Y2&{FkmbAB(_=_yrlKr|G7(+diMI`ZL^<mxCqxz|Ebp%cps)Ym!~<
z6TRGXv!7y?(<0A{9-SS19hrZ=7Jhqk^JL4ho&9}IFQ?4ytI52yq`gn&CBOIUGWMA=
zvp&2uot0v#oH;YbJVsJ>=4BV{`R6ltS(Oy-_Up}hv^1~zdMfXAwR4IM2VO8mZ_hJr
z_1NULeNl@l(=U1HyAeVEAFqryE&#Q<I20bVHcU?8wHJGTRCc8>qdaR#Vqtdn>X~t;
z(nAg$*DJ^d^;Q}uaBfi3PGMZU^CqXo{UeuFN8Fh=S9Yl&xZNw9prUPWzm9K1Ltos>
z@IR%6CX2%v`9yp{{T>}rg_E01HUz$(R#zM#&NDf|_3vbd{~&$;Sv)rV+5G&R9EU~s
z?b5{EpWhnr=Q&S>^y+%F9447+39=qiI`HV*2A8ffr3MD3ivkKKyWHlieWz-@JzDnO
z8td(ar_Zff|FG!}%dcNmPoF%_F4{d~wLnJ$gJ&2^Q%<pX<ej|YlFjdLcg5Q%?vLJW
z`I~#EQg-9IzOc&Yd$fL@{B%C8R##j>K$LOPniVd$4%NNtzxC?eJ)OMm20J3lGQaOj
z`*~?C|A}|Up6RS#QlZBrd-k{R{);!1_uB5=8FS8*!^N#ZMcZiMw&ja;^0uo_%lq<V
z`u<q;{`Iw;ET?(T1ipIFSME{nKHGDHo93z8910Tz6i#k>lDuI5&TH4MsR^t3NNjYU
zHAlv#;=&(;HyQf_m+fZ_kBOPH&2DetvZro2A=C0V?6CDVINcrpaclg97*UO5R<<{$
zdTg)|a8M{_oV4c5TBhit&(F?&+C2ZS&zIwI@ArH@rx-2%=Eg?nce~%)RlZz0eaZUu
z{#{*NPo@O>O<cWxUzD2P9E%0<udl70{QLd>_-}7+CZBt)_wss7aqpSA*5=ELnDtIQ
zX6?TH`M~B6m+sqs-t_0u!vD$#wH$JO3teuStLxhnCwgF3^bK`~NurNtl$Dg6*!%sS
zw!iJykWcLWrkzqXHXjZ!Kf3~|PESmkR{w72^D}94ug6vAZu)VoS333Ssi{S;RxY1)
zWYzNJ?(cR!my6t()LQf0`u@b1mzU4pG;^AF*qrCWZtFj>Y<W{8wq0CrfmPL2;rA*B
zwPY;IH~BQ&*W)R4m|y>|vhwp;^QX7(|J%0bx$S$&jq0GP`)QkW-UQ?GHo<;YFI6rc
z@iKpPXG7xQhHSaoFM%sptrGG*_U!z8eQq(G38|;2b*dF-Uti}t?d+DAPfa%SUOf6%
zVRP<1-?PMw(@S^lh+WS9^IJlq(yH#;rBwmqJBk$=9P*fYQl35&>sak)|F^{Q^_tB-
z(Qy?ITLo{MR6H;KyL0Bs;N`Pe&hGTM9`<s}V^HhDZO5F?o72ymEl#njDt)<h`Yh9k
znNy0_o&Oqm`|^bg3GZxo{M~u&Wa&fEACKGS7JW}X?;X4+<dm8pZ@#<Jg-;dLtGB#c
zufCJZaZN_j2Ud?wP4bHcqa%WXj2>0Lymw*Z%GljyC+AoePdX|kEq(TL<mNQh^OpXg
z!dFPHc5bHS^II`;rU$JG9xy~3KWR#TX}bQ6&!6`F6{~#aI5s^k?TD6o{p7;FxpDW~
zehGH8FnETk9J1Lk+27`4%giS0_j^81$~Q4Jo%wv%`zsHe&u`tbWya;1)1+hE&DN{?
z&Pw^Vzw2ny%^0^xP|3i^!lZg&)*6S_!@rMRxpwVTGrygN`n-yyqE&(KU+K)azE*)v
ze%I9Ie;1W67d5{=@y(PoY+KS4chL9<$1DcVunS6$601u@UTwRbXZ$;5Y2E68{FiUm
zFRjkywfi!sPw(Z#%$)~IKS+Vc1sYdyPDpW8d9-%z+M>^A&ArRZx5w1~{dzLx<ja3g
zPEJ01d2jW1tL2mWcl{4bO<h_!H*@Ecqc)Bps~i*-F{wlfa_rG7+5h!g^x34MyQdD`
ze6O|jb(NpFT<re3+9I!j`}g<N?tWnxx_oZgEX{eDJFo1j>;sQ5If$@E{E&OJ;<d@W
z)$8|VRXuofVcl)*9(ntFZ^})RkMVrICtH3e@l@@P!}8P2?^PWBQ@E@4%SHF@&%I8u
z9QEJtmY-e~y86kT;`39T+xcdm_1G$Rcfl1)Bi-jyo(n=erolBKrPbmUsH9d7SsA<I
z@3-4$Pjl<-aG0hOnKbY9`ByJK-bn7BdHl+Ly`4{lc78ggeRk#1Zt>ao?PK;<ZCw+&
z`PiH3rup}5HY;Yn+RkUJJH1MNo-%lNOu)2pk#6+18TS(}{-05#@POk*UBoWV6?rkU
z-ksPIv&*W2zwsi=yNZ-<o1H8Fe>ZX0KK=VA=L@^Y-(@+cR!nkLKQl4ZyjE}VCJ`qE
zFD5IFMee`;H@SJX?Bf%dVU~NV;kxqP6I<?hTrURoz#SMEqgf+<<YlM46bFsWF)(rb
z&~ljcRNLMh9N}Pjk4-tfI)7oKXz{Ebn`)jue+DV`6%tl6cure8acMl1{{X~a|L2Yj
zIG8{kZiSPZOgDXjjj`2;DxCZ@b^dIKUmF_Mf`&5OrqwBe{oc^9o=GKg->2eYNJ<sh
z5ZVCluj@nkA3*%@x;#iUGcaxAnvil+D)Lt=INBMQ_Hj)}`FZO6Sx|k&BH(Z!jB%1q
zw6gbp&?o_jAI>;QC;sP7OQ>gWXgN$u9Y&s?@~f&G6gKm?P0Y=!>-g8_3%q~z>6h4*
z`HLHP=dYL9J@0esWHsMYKcn<`rZaek?ReyxEqKB!;r6!Npt!hsS4|yt?p*bqBzk1W
zmaSX8v$L}WW{cf0JDRldz_#ADo%#-wp6=5$ReG?yp-<1m#KgnbxA(?}{$D?gWP7cj
z?AGR$&<Kc&Qwt3ZW%mEX#mF*=NhQ*gYo0<vJ7`$t%h#`wlM`+VidHo;Fa?Szoa{=v
z@^bT3rr6F>@2y+61_cHxPMtb6?At^?P+CY7QaH&Kyd^`MNtxr#?d|8+^lnV8Drm_o
z0u?MAQyHQyTC`$J#2Oo!tg4oF-~PH{-MVc_f3F^p16eEpA6e?((U9AHTUpL;S3d)j
z7}tc9NQsbLDf=0^Z@=v~v~^)<{J=dSrPaRei-Hr=+qZ9n!o!b0`o?i|&N`(AhYD7Y
zO^2kdqvQ-hLw!0AO2ipiob(SI`hKB(0^be21CPpXEBpKhCo(s17TM(F;J$v=tXVfA
zu5@Kw;$#u%0F{?ll>F+Ql@~~NPn$MvQbMa*l8Fc-i-3fN!z9xS&EXtB^d9KsU5~w8
z`n`+~l*k(kKqZTD-j-WIjAGlPr6P8<GB8aPNqAVTa@cQqv)X}2-xj#Gd;_%ve{vg4
znz~=nRAIt&hVI*+A3aWD5pYo0z|@n%YGz`h!^QM#ck{=JIY-|Ha+uY+Ff^V3jqvT9
zaQUGE$A%rY9DxgXITRWiwlk?j-uo3~&E(7yamTKuMHnPFmB~juN;1q!)CDw}XsES?
zlaWQ>gI~i$o%cB_B^#G8bl;vV0xqeQln;1>r8xPz{}oCo+#UbvjyOnVc*8`U`oBAO
zA7wgw_Uxq#7Zl#y$t#@jQi_Q~VFIWT#><zlIAJwI_w8cHfc*hE#%0`ZJ5_Bt8yLE8
zGYhcH0+k0WE)5gcG_W+KwZu1ET>atr1UZnm^SBHqJzb_&>Kb++@=jcAtnS7LolSft
z;1cJ-1_tHGcHN3LhignadFN;KaD#?6PjE~~aaFrgawV5>8T(zarFNjAKo4YNm-=2!
zkd538XLLbj1UHMs$xR9!B?}9fdg4US&9VlkMezg`?Kgr;{;~>RIQq6~!;ZZPPwsGl
z1`f9}C`T^jlke4U0S#cTTIF@>^l9!w?{|%$;wYh!!E+j`;}Y(BoCdZp=IWY)%Dipd
z2C*5{EidE!K<)#LZi8CnK`as{y$(LmWYRkDLUcYeC>=1Gvq+pQa-L|lMlhjpH)N2v
zq2WDKPs&d@CMf|H#`MB!UteDPZsC@O3v3_{F)>ck;coH}|0JAHWngc=4m92=AQ9K_
z^3cOr3u#7BB33w20;<101U5|6k^i`JYdup>+|Ts$b3sG2D?o$OQ#~%9M~Ym54*?Am
zb@&TcT17DF<nf2uWbiU^C?xD=@SOHma9O?Ef_?kqe*OB@lF$FC5#$d6jVTPCVGEb+
z?AK@7wPWwLZDCqkT1z%<x-{LaAQ<GU#thK-nen@cFHE~{D+{Jsbuut<u!J?VzHj8^
z<vs1*aP;lZ7lpc@;<-VZsV8OULJ!$S&`@uJlcO^@D!C`5xc*a4;0I;lPE}h_V<89B
zPFL&_e9zo{TlpX3g5Mkp4Gs>h9-Ek?BxX&W$<Te<xOkBW$V`WatPwxrDvIB|XkyrJ
z{enp;6qKMiDzpxGOk2Ju<XtO6_wBs_OZ`AjW!%mxak41-%JN@T)zwRvE=|3%JG<$T
z`_4e=X^D)nch<d4fBuc<Ab3<-;lXSM<;Z;(cb7jtJKOy9`MPh$H}_U=zf<{qZd&>0
zgIm`}Z})q*|9{=h&FTG>t9R{+TDS9=)J*I0cMXg3rb`D@%IV*_eS7J;b$xShe>Qj$
z1hT#H5SPKE(1`r-_t!37Oq{g3{_pkrsq^N^1#kancmF~1<72&>ik^DSG*0i+iQgBK
zx96jqrmpT(QSC4fXJ_Y4J8nOnB>McPi}?2UcXwa!iTiljqB5xnT<bX;WbxR<<@WYp
z?>vl#`A4>XyI(6pLPJkpTI!wp@6XRo2?v=Xx8=;tn6$0z?X4%JdDFea<~$Y_+y0#6
zcq+KYZxm2C$>kzZlzrso^7(rAe_h*thU2P-=?f{HxqdM_3KmN4Ejo2}p6%^F37h)j
zUOp_dd~UbX?$wK_|2Ax1xA)S;)e$<=vO{CqLHVVjK_684Z`fUYdD5gwf!bL)IVP!T
zXJ?r%d2?o_@zVzfo1g8u{j}|lPPg!^grkoO#kQv>x&?v*>jCG654IJCg<D;HeSMeh
z+q7wu;@4M}&u6#gO_wg(tmC)goffxF7pO}LN^BF?9B4Z>x6P9KVQF{!LHEMKjW6VF
z@93HTh}#3sGY$$_Oe&Gn+-nZCa4u`l&CPYLTJ>DbcUH=|-LZKm&RT$TcZ0(b7LQFj
z{6C(Yob1bA%H49X{oU%PK4*8v=6%>((F^vF!xfN{{vTgnUUr2yT6gcM{atpE^%<zq
zDp;_4&eJs|pm`GqhQ>fvuYF&Z>emK)g9cEq91`J}*5LR3<u{&P-M>M@DBsRp;&uQ2
z{(k<os9t&ddnOUrqyN72uNV5u_Hc@3@R@5I_J3dcFWs{z=HIvc|7JUFn{GdCTI!m8
zNaw@zwY{Hy-MeN`u4t0mzg>RPwq|GdeeJIuzV>JqUHmQ1_g(C{K*yGb&%L$#VkI8+
zAH23U`suakeAx@lxAXVk-LvmO6L-qVNvh9&K04a%D!l3H>hROEOta6_MSgyE)>wMd
zvbxt7-WD-S9peVY1|y4-TELdn(_){kb$-dm^8IEt*}ZPX3W*JdFAMgT?Y>j+{ecYA
zOs+d0Pl#0(1^<7amsZ95v`9E3bIs&hYqQjnkBfw#ome&7ZhBxOm!g0wqb$qC=80=G
zTx~C2_gUV0S5Mq9ZC5uqd>b}=n9I)y%Ge<815kO(z9Ixvq=2*agp`kx;8F=h*a#?`
z{KPO-3)(VdV4S35#|%!wp!$xTNhMNlL69oUEQd)))4|;k5b?pGLFF`a$SM~Q2V|DV
zrXM_D8$g5{$Apy11~2G1h(ZH{r`UXG<5$4p05jtx9sYooLNF19laGu+RU1erM}>mJ
zq^FEpq2PoG5>bh)VFOh|;9%ru@z`YJu+$68VG(d>Q0YDo@+VmPQ1ooTE62H@*kKgP
z$jjpk$S%tE+Ot}FJNM30#f;K+@$-~<cO6{fIhk$l!=<opfot3X?TIt4T)XB~S-JB_
z(#C-5FJHg5?)tmUY~R|ov5!9PSbO*LlK8~`_ZO*ah=qGiN-ZpS8CAmi?d@&#wQJV~
z1qTcNV)0&VQRb6e(k%I4-t_6yJyTOt8=^ff3w#J~Fpd28tGJvcM*Ie7Zg}&qUAMYe
zPM0cZfg+kq<$y<6<AR;MOmW;VZp~<GW6O41zvtVcI#5-c%{WPCed|j3MkbCMX0{Ow
zMtPtzp+fIK$-?JH?l3UEXDKPPzTAB8XOJ<d#naEA90{)0?6?f7o+{gI2Ng3$pxI|;
zl`aJV6Gpf7O=5z#ni-flctjIavR81X3vjFfHH4(4q(IZ2Jc0@*rJN3NvNUN1#K-IJ
z(p;`v9nTs(GYr%`dB-^+WoNplFGq#agEx2L0s{{o>z~IFtjWZo@SvB$bDH_OD_srR
zOgeextrNXKsVkl(;>SB~Yjf9x5=OD@{dq2&pmyU4P`lC6YK!h9CY`+glp8Nim^dOd
z944hE2D}WaV2!vVckjl<A{GIMgbfUy*AfKdlpi!Rbl<LZcs>o3gN}o85Oc6C(_+pI
zJ8Df7?}0jyhcpiy`d)CXH!ND|z@sv6CQoxv9iGS{aZ-w{HJGD9_rRkvP&k5`jPVUB
zr~gY_XzJkHu){Wqartfz1%XJ$No!8D&Fd47TCjI-?5kI=TISy7);<3h<coUHaAe{0
zb%LPj-6KqX<)B7P3j_E4pArfW7B=LaJ@BZEzi}nFzW{0#GV<~Ha&KqozI|BMKB}LA
ziQ|d3!=$O}6|O5A^e}YaZg+eLY9a_2GEQ34!8+$%mG*&0W%;!$WkKz{$qb%hGZwi<
zGwU9B^v$8Y{TL|RS;Z3`Rv$dMb73x%PTqFiMPJw%Sp*8)8z$<M%dAvg1X)s`Vrps%
zTJNyRVLQ0wX%kjBDdpE%%#orH5FM?(bm>x+2+4>*&=Q!AMGT%{B8&aze-<hb+a4Yk
zHtX)~&#QX6!TQ#KhGosRl$_ya6x&|C&}%Lz%;z%c)ND6i_vKV7quBP{JYJ=sh7Svi
z#K|s)2``iCKrPJk{i{LYvVzNClIYbFm*4lWd?{yt{L!NOw(+G!0-)l~VHJaN<Vq<U
z_XoO+V%t9lf(kf+6X6Xi+VPI-wu5H&ueDC$19^BKhe7NMZfkSiMGW1yn<YeVwJ<Po
zw1hWIT=U^r-?ZHt2VP9=o)H4>iYKs0oP5+QPzh?KmX?~@_X_{?XJ!Doxf;}}OZW6u
z6wb)Yo7UFGmiYYJ1lGQ1pfXTVP~jw(=You7yP16WcfIz^1((mxtTXgvvJOdhvqs#>
zD=YwaA_NQ=-8M0a3Cwytmtk@Ey_?{C)^H$z(QQ-Ptb$`spavRy_ibGsy;#t|1(VhR
zk1z*j=goHnK|vcD>RDO2(|T$UHz)uYm?SwSq@*^uOf29su$4Hs<6;&lkAoI)<aVn3
z_2AmD!`AblFt`|&XO%elNpODjZqQ1D-^;FafC}UZpw{2corR$cpj>ib!37miemca|
zlj3UeV_V7H$UAYt!H3U3x*-(u3sg=-C^$??bre{9hjkhIVwu`spur55=!Tbv5{|cD
z>s2`L=$l}I1-JzvAOZ5GFqhP%l?;o+XL<#K*1b3!@Mm<}^yiBHhrQL+)vm%*nA!Py
zs?uYhU%7PYQPj>r?Nb{-P2QG85+L8fx(x577o5DBU-wx$a&OhvlCrW{(qSPXC)DkK
zdV&T=*-R4d?kX+%|M&apdA8MOD*sB(%3inA?b*4xvx9dsia-6>bo6cIgF;Z50&1r9
zr2IS-cVqUycjfyh-~ab*`=*MINk89}@7D$`FOaExGV#;o`F~u>-rky;a|Sw)Y?OXZ
zCURfR&N~&4dxN5)w6w$4OlWIsTXR}f|HNm{+S<L6p^tAjS2{sksgA53o48KBJ%9Gv
z`gr}z%X}yI*S<+M%D$#^F~xQMYmV#L>-SE}xw5$5PV1L+z4vszsXsqIKi$O2opN(i
z>ZOYp6|=9eJG(39Q<Kbmi|*UW8zt=D%vr2B9h8bWeyBT4dOE-M;5(bVI~K;iFMLE_
z_0E0rszbTY;O&K%J3uY?L#^CrUrfEc<L2gc@6^<#FEpmh&74*Y8VkPOclGMknJoeD
z&x2x8p~2w>i^rxzVjE>{RbO-!_pGkoJyY$@-s<fycCBWYt8h4H^V!EZX=$jLnc1va
zrAx9u7#2VCv8?#8z;Z5Vm^9^cl(3F%iS3NOq(V^r&!HgT#wfP0-7qV1+s_}5`=_t3
z|NFY=`P}kTrPpKCZEbCf{{4JDyY;<asIRZ@v&_iInZ;T^S3IASFO?RhS6RsCFR}9!
zV=s733=5O`0gtc;PLJxEO;%odX*c&(_4nQPb%U4tO|}2`vHw%M{U623&HMJ*eU7=F
z$!piu-R=7S1=`rH!6ebfj`dMny+B=soe$fj&wNR+k(&-$kMe1C{9mtQJ(9}rtMC6#
zIn=`GwrK6z+>VZUvrRH5S<cVgsW`QO3Eb#u?BFz*lv;V9l=tfVe_zy%ZCBivxZ*6l
zTEFHYw^8aTk;+#qm!H{ra<cmD<9n;W&pLi(e~IjL<JRe!JFmP(4Ci`m(&^u&S8@Gt
zWbo6H?YnnJe>s0+WAfRRpoxgqXS?n;8>_C!&$++v?i-={TbavKL(hpkgAN)h={QVE
zt^Dv+y2?21%mmZyYbV~<|F7Qsb4A|O51;4%kKvQGQt|t=gy;F(@_BFW><lic3asDf
zcD?X!-S4;0eg*s6nrcqX-1&qRJlrARpwPs$=Hw=u7rPSvX2<`Yb*J|G-DmxmV`G!I
zrkoVAd_JdmPH>ugMQr_2`~8bOXTJMp2Os4veg4Del&bbKPEfvNU=kG3xV0&@`)Ab5
zf5)dB&SQ-Iu&@4qou<CNzg~*`%HzAHdDq_$5MEp2zU=9xs|Tw&dejPzD@Q*$>HBy8
za?7a5d*}TZEZyk$?d^>zfvVkpGn7~7{fco*)ogK?!m=&zZq}~Z|Mo8k6zX({FFm+>
z^WonacdyQWc=E}KEir1Pfo$NYVVunpF*!BZ<R!Em<X{1f%@{0Ppa?E_ITR8mGk8w(
zy|_dl$`_DeoV4aZOH&&pu{JdLGO0wGxlY~(<vS#>cx+-4=8|dxm5U7wOlF)DQf`X)
z{(|uvK_$G8Mg|8Y2sm!2I7}LK0F^_)i}|t;C<f+nn3$V;+sJ)i^3Eyr*0pP4E20bM
z>wp@^)1QiptY5Q+MNtVf$--%Jw`ZP1b@lEmSFd`yy0(Ja+00X>eDV(!V7_tns_3ut
zVFIz4lWm#)oKE%EdCAG-$tW9}k()bp)+{OQf65kRXJ(|_uMm=9^u1@=`P>1tLM>vl
z=^pNML5`&jeL6X}x1HUx7u>kkp3=DBBB+t#)G$%Uj*TNiX~E)fUtiyAJ#mpjV!Ij{
zm;}WVRJ0ErT>knS$BP$J_42l-R$Z8P;({=XK*uHq<;cK3yITIe4RysE7A|!Ba@%W7
zFK4aAOYp)#he@fC4ln&mSaPE8$jv=*F_=Z5ql@8kYhb6z-z{zpN8es+nbfDy(D0P0
zCnZuYVORQehQ;A!M<?G?XlS?#TGc5VUzHA8h&Xqxqz;!>tRn;CYF3Gpo2>SfoMU4Y
z+kRWX^;ZL8<hnS6WriG&?}`i!CJqGymxh;z6jkOp9H?g$+x}agISSNCd!l{7BWzz&
zOn<{^rk=Q+koH-FKWGS#<$SK7gkQsbSs74UP@%!Wf>q)qSNffdt*K1s9(`N2N=s8;
zfBTy95>T76V;O^In8{<m^~@><z9cj>IR=B;zv8Sj^hyLLuL3RdJo@%#MxYp|r8*z9
zq_SI5cbh}QMQzY%AgI9|2x@S%c5D|ch;BIgHm^HKo{2+2z=zRoQ<J24RO&*|;3atV
z<&0L_CEnn?zLH4=+$cPt%(#r*wrOb;i-3c|0VW@DHVX?A-9Mnwz<QpSpuYEn)eOp!
zJ5LqLGA-sXs50de$OnycPU8j@`VBAV*)!?neLp^TH>iE*D3qY0?QwB|?n3c|!s-{!
z9_%2GTxapv6tj5Aq7~d%u3z_#kDveH?ZFlGLNDx@I211EJ4`yN&e&+fT2fe@o4Yn7
zB*Y^%HFe(BLhxW#gDz<L$YoO94^aOi{>DyF14V!fRD~+}m>6|{oS77oAq?`a49L5}
z+)+Y8jAGl{RRT<eLA{R129?v#847+EfO;J<9~W%}wNd9YsYKSjDt><fG)``^aM40g
zl7$s*LLs0baZ{r$peZemZ4BJ^n`Pyro-YOsC_=k-IsyqQr<)Wmv3_TbxbqG)Wdce#
z!U`w5qK>?Lzk*38Pkw3#qy&UDJu^7AY~Su38!KzQ-Cg<47tnaYhnNPH)5S@70-)5_
zuIRM|G<3@`oq_xQVNw04*P9r+Z^yDN1uu7RT*9CXnrd<Jh0H)K0mo*<m0kYz;NF9c
zn8L|V5;I;kYr;Dn2YL9{f||x_K!c}BJta!PptgEy>e9#u^In!t0WAd)a8QV5oU|tA
zsD^wLD9p@COhAL|97`Fv?>kGHNzLtL=)S%A;vyZ8R~n*04SQ8j+eVRu!fJ)XPK!Y)
z&jU25+-cyxdGhUTxsxkw&OQ2;(KbI0ltT7#8%%my&5_Y?8`L$8p7INn7Fdb|6;7UV
z?agM=KJe(<fws0bP?K$<aKbKwBE{{S59{QC`a4{pl)jlkIWn<NF4vq%C+~SPD8DHP
zxPanVLiE;@ji46rvPB9YmpL?o);k+mY%g|Suybdml$2D<+}n3QE)fH_=)bdiY`SB<
z)U6*BRfYyvK~Ce?p>&{Rp?1&1RZkuqY~GZ9Uhd_~my#PFS_NIXbjj$^?{m^Krxl-i
z{`thCZ#7?bfbyNgf(uMNDWXw#mjBLd`t;#2|LIp(S1;YV_39STD%ENF@p)#iOJ;4&
zyKA-c|G(e9Ld%}7TD|(|tn76YcNRalay^s0>?vE!l;hlP>pvZM3?2YxjA!xKRFkOx
z$M^lN*Ls!TZl*s~mjBr?r{>d1qqH*;m2bCRcM;Zoeq%@B;x#clgZym2hD?rl>2clm
z`yFLa+xmUYb8Dm8UnRjNmy7)N{<M4bs4RE6TFu4?o%^qLK<0iMn>Y+&BLvdw^FLkR
z|1Wf2<ul2hzh13=y6Lpu<i-7Vw^Ve}=hv1Q6<!jv`}JaRP-v(s_J+1^nbPH=liWo$
zi-IT4N_hFGOlXaa;7-u`bB6=wjFWWkzu+!^Y?^(|!_~DlBgpj9Le8_#&dvrcq6~_v
zs%R+w_U5MA$%_}YZH;uzFVz~^uD{&O&L?9KJo6T0N{o@^kXpfy{mT-wE#IDvaBy!1
ztxmmI8ac~j>(;F&&&)LTWeSeDGe6zj%xu;#@PKig?&{mBpw_J7)Re+SD_5SJlJ-T5
z+XOlS?AM^8U7%RF-|_eN_vW0}#P|O=n(}n++_^<}3Xh)*-}gy$rb*@`i%#EHQo74G
z%q!lPIRmmjLvkl5WrCAwlbXXM(JdVn7v@#i=siBxJ2`v(-mqt9XQ#hgkiF&Ij>mkJ
zFBY~x37-FJ%9pQSXMWzhcdv8Qg2l1tI>MJdZ3{UB8gO9%jguajwT6QwX20i(%MH6`
z>|L?q#2?GgXN=G8)Q#RI(a0&RHp6|cmrTtIOWC)Vz{@cnn1WI?15+TVFmX7t+-K&b
zIeb2E*ZDD9Nl)^dXLEDU*7EoFt|&eG`R?xSvyaMaC!)5*C#1M4JlORj_WO|{GsUZV
zuccO-->(VovwEeWyr4SarPJrHudk~w=lk0G_V)Jfy36mkT=qM?YL4a^==8ozM1zVp
z)4~4-*zFSB*5vK~TQ=F`rO3nme{b)fdGv#Ld`)4{gFT<mO`dCAeri?d>NEdBcI7t5
z87Cj(+3dJ7*x+)JU!@$lKoaO!#K3)DS)lZ8$d}FY|E~GDbB=WWo{L{1zVH8a%zR(s
zwNy)%ZgG9H+tx4q-@mvQwJUy_-jwUSp27P|XJlF~kAs`y5SSElxMuB{pVuNq1Q%UO
z|NCsgyW*wY*Mlc7d-!Yp(-Q60E4`kdHO=pAo#U(!+-NO#Q^`N?*5u5>Q%@ByT#8T!
zubOB>TQvb%)p0jfMcXOxdalHr`|>htZ(m;KE4{X((*AOhWT=}Wxa45b5lZl#=6Z06
zHn_&*P!Nz|oV4b_k)~<T)^LL>lS-r*>*RG%zC!_v$EGG>?kHGmSd4Q*N~DO-E*SqH
zsCDe8lL74@a72Jw$AJbfxge3w!Q$SaqHVEpfhyF(gozBEqYfZ11R6@2czJm@)%~pk
zEl#`qP4{w9ruIW$P%|fiX(?ki|5--{#%`8<|Np)}z4^SIwsHEoDZk(EzyIaUzTfXA
zAD6540j*p6dF%SVv~#@S=d#=8^{KtI`_LvLI^84Z*T-jum#e>hEt{QP9revCK7Rd_
zDgKjhY)M|SBE@G}=!~Mf?XQ+TzmWIxZO+6;8-<so1Z|z-H)Cd~ENFkn1Fi`vtmdE%
zJmD;_UcZiAsXpDy%F60Ys;#Z<qb-j=9+#iKYnRo{&FTFyrB_2i8yF5x_1+sF9UcAZ
z^qzUyL05i0E57vYmb`1#qh;$(zW>=J(mQ)f;NH1k>nCp0UA=UDcEaqgV}4UO-|uir
z3htBII&a^R+UU4H{x5HRe>GuK@~V59kNtOqbai#L?GfK1{Bhm7l$hpg+ZJq77wZNM
zo(If!-yI{SaI#2p$}0hmE{Edc%`Z&m%>Tb2n`vpg8qd?GPoMpKIz3*`-~R8GJ%8Wk
zPwx~~pH+N#s&W3Fui>66t^bF7-6B8bnlHacdGN27r>|7=*WLT~Yd)WP#L><&Rky8Q
zUc9zZ(e2!&KL2a~;=Zn}xwT3&6OJxB>)VrXcG9}G@FmMr`;WXfS93esH+5sEI^Vw1
z2XWa_FOHZN^e%SfU~xDww|*zn1wqgPf_B!DD=XHo_s`18a```hbG-Y@=#znkg&RXc
zLT038Oj=qW)c^3**6rK9BO_;Onw9yKT`pKzy4<e+{k;?+9p9`jucS`R{jw|b)4%K~
zImDxB`zdyjvft5-g_m}|X3f0&XT#2I>o-SMMM*Cyc_f(m`c>AAq<i{nXXpxx|Ld*1
z7hSwcCZ>3G<-NOGj72=B)oq)zW7%7Sd?kTE&<Hczyu90*3pzXfj=rq_u}AJ;R%Yfz
z{o0q_i-H@Q`$0o*=PVxg99(|(we|Zw!SiZ9d0M{P@i^sZm#Fip7gFow|Nl6iw(-vt
z&EO|{-`B1ekuSYBq3B%awCQ!)vAyeOl?G0}_f_)wmP(r~53etJJ@42V8^>ek?c=@F
zub=pFWXimKdDTxp&Y84^Q@t+dfbFpm{VCU`%X{;r?tS{<+KFooPR(&&zLtEQe{tf5
z?S1>!{aYDY8)=iar+Ah-ivY*Q0}ubVw(k%&k!56YfzGqAO7DH;wdVNEjmgJ1eA#s`
zYsuqY^LqxlrOP;iPiM;S`}cLdy1%SNfrDJt3q{LUEiScJ<-O+l*9OUG8wZ!(?R>fG
z-7_mqUmdyYi<jrtCwb+qu8fm;J%81il)Y1SDs=Dv^+>l}c+DaqO+TF``L`Xu^YfRn
z?&ja4w>G*?{c)C`e@~ljik`ODmeMzCS{H{N{LP^tz{EIdjQ~rhn$iS6hskqq-HI}<
z3XP48-SE;;HZ^K%)>O~{=(CqEE`z33#WwAK9sAzv`V+zXmjgE@_uGd3`}h9;y(`t9
z&zg6uMQxpZ-Sg-cW8wP;UdJDv8r9h6Rk~;6wK-kyYgK2ayp&RZE@52U`1#7$<9+7;
z=d207y~y)^hI?gF$lC2|FZ#rmU9;2v<=+2j)5=B4sfWK7Z?USBXJlzoKVTPmu$xoY
zNg)|DRLwbU-QG(t4?3;ie@W9m_Q1N}_E`xpKc4ij3ragbZ*HM{5O<%vecZn9d*7ez
zRG+7@d`?l<pR@PBtPj7G&r;UAp>EZdq-i4kujAiey?Wt3+gjs)*LE$RbVO>^q>q<_
z^B>>({O(!R%NrlJtn_zZaO%14xfOY_r$ftPlDM{1T&UW4WXj_Q`MPN#imd_;3KN)A
zA{%+Qdz}(WKn^?Ed%yd3X*KKJ=U)AwZC%rJB8{pZyK5LG9%^CaUitj&?CCl;Z(p2K
zWA~%8PvPal-(g?3$WOSpuI!~<MD{t$_cO)y{#~7YBmMP-WAWepMb(yZs_%KcIBorE
zpS+8a+a39A|DQf$F1%alzRDc!)Z_D%C*4RseP!pvxX$<0x|6dsni-fF#T8C+RWxMC
zF*UQ66#m|pd;83aP{rl!?As4l)?SY-pSf14WOm!@b-T}9y=d|`Y*Dd@sBGQ4ImL3p
z!YkJunX)jld#c3WOUY+?{;{0Ve0?lAe^2PF>-UqdHL04dnD8-w|DBxO6Fl$k?cAEY
zR^NV>#;tTS$GHWcgfy+6?G5_)?)+>QZ=tt&^<O)ERxRRT;$VqsFpXs77dY#z5W3((
z_wC^Kws$^@$JYeP)$OSN-Q=ymH^k3Eaes@OxoYq6$41ZA>Pnl;Ea`i+N%P!g#r~zD
z?z1$VWjVXlm+^ET_c2KII;OsiOZ|ym=!)A3JoiMltlu5XxAuSirQ5sC-&y=8SNzls
z<$HEZe9v_rEPe5f=iI%hWTESpUte!omiO|)-ul^*Ti(Z<R|d_&Bs}?_EpgB8ViC(4
z&>AJbLxL?AwOOyFyx4vJ@4AiGTt9@zRW5xYW%zgT`=>=Frlu!*&F^XKE`L8Qc6V9l
zKbC&EqpC|gSyIAoY0bU3<{k6a&X?Q%&Al?W_+0C*ZQkw+zxc-|tvY8}Qnm4a%>QGH
zs^ZGa?0?vAKXGuY_Sr9sgSVw#&KI(8y}ZBs-;Ky_p|@5>8-0(wdm=BpvZ(Ljs|#DB
z&k5fDd)>wQ*Za)6XV2Gao}2XX4aYl)j~xy(K*JuzUoxsySW3QlP3GT!J&yO-y)BuO
z-`trgG1XJ%7w>`o`ah3PDm|Z9z3$Iv`~StCN|*VUJp4WX|DW`qN7U^MA52>8XAwKA
z?PpqImZI+pt9un{g{$;`7F#w?UUM$?_0qRb-GlUv&(EI!cVp!hUN`kUe~muJ)PGvG
ze)r)&7niK6cx9+|)9bIM%-xQV|4Za{iC<q5yiRT--`ymq?Ufhu#b22#@Y|GjPnqIt
zHhYHE*B<LvJkK@zITQqv7~M8G$=J-w+uu-E9N^yCG%aD}o_{KSuV$^hl3{VV_VKY^
z<K=VRYaiN_%YD6bV`K8ygDT<jKTo(%`kM7u{?~=}Cr`e|XWsMwKK<RJb(fpZCC2g3
z(z+tw>{q^I-}>P4UH4Y4*rH?j^v3_iXI(qbI)5#_rTkR7`S7)gH!|yzl4Pg-)7WY$
zq@1<Odym}Fr@?1`tuy$uq%YH;Ua`R;3cP?=<zN1Mk5}6(F2x-@#C}VYfx)QD)5S4l
zHiyE4oei6dcjuiJcs5`6;#ZGb;=U{9wB+n4-n+L`KG*Nf_NRY(`ugs?Y+JTVv}NAz
z#}jowJy|x<+`^Z)W8KV4i&t#1FZ8a}zx{mKI+vg+c^Cg?lrCHCT(1#zed5=zC9_Ra
zk0$f^tM-Mh4}ZVi<l4!7va^j=)m`K)PPytk|MUu-R)LO52d=ICE3If8E3tIN<?8_)
zEV+f%b{Q+}dEQ<zzGLZoU=EA->CB{=*+nniil*kQ=I)Hz^-V-|TkeM}e*NYAHcAZ*
z^-MnEzd-BOBoqXW9DU0ybppKdq;U;sn{ik7A&v@Vfh$Mf-up5w3N-tf0UCwqwYYqm
zf&0ZZ9>>@_atUU$K=bM>aSapK9BA)gyQP(I`cYZ*V`tDx;l>(Pk4>LMpH#6F32ewL
ztmeD>TnN-I6k_rbcT+l3Vx$2YSMpNH03B)YU@wDm<UQ$Pc9tH85cl<QH@`KRytzO1
z`tk*Z=kqi@->4ro+~sh7N3gp-XqsK4gTXV*amG&1E374jyWcU3PPs3u6Jqo4_4o2q
z|Ns3=%=E}9nE77t^meAx>-&%IR=symdug%fCLMm$yWA5QJi|cysSm3!u%CA4!UcuI
z`#Wu;f42QC{j}bG->s=nv~E|sZ>&jopI)-<tINjMUnCnHxF@8rTG^QBonZ=`D_2td
zMeEE*eV5zS)xVakUFuy`UBz8!4O*-i$u%J*mD8<|#SK(?{5pK@*Jgvj*>Zory`4XK
z`u4w-CQA3p9Ua`)@3Q*su_0!|5-yfKLJB88c}=TQ))csUQ9Jg|zsdFcC%!z$RQoD=
zmXN*9*%zUWTXym??F8*V%{xAogGb=P(YJvzdy}dP4jeylS^V6iG9exRnJZ-&;lqER
z?eD8sty;2YkBt$JPM&_wirdkpRTGZBZ4G^%$MHnnVbaw3^5O0=3ac(Ruiv{d?p@sr
zwU;mQrgVxXEC18{u<!TRt?e`9zRa6xt?*zMgXgr@OF|@A8#VOvuK&39t~M|wXR?od
zQjN%=x7qTKJ1?$|UB6jy^?Jt#&p4iFI82(VEHm9TTw&GX@Qb|`wxG2OMZyoZa~Bss
zUe&?%;!&CHqHU(mE{A<Vv-pjBK*_ATzk9LL1D(9}D_2g8=#j7J^t$s>9kSZPGt90k
zMw*jx89Qu=;||c$kk?B>GP)b|^3tm=Ov|{$&m!Qk-~(vX=-wRbHiw3btHBMH22hok
zprZYNaZzQfc*2)eAD-O-4g75gY?!Dcz1VAhkx)WmwO>vQX!2dbpozir8i&E0zG=`U
z)|~g{dcy9!1g)Tau#~}b+VovlWGfo4%)PCxt<8KtP6|9>Eg;7@Y0ZZtUDI~y9C%bV
z-Ek#&S~;PCf%`st!3QNR&;k&zC1Bq?01YVryIGtr&k}Lx9kbPT(ApR!Er&^>7Z12^
zyseYhpLFFVXpzf<`3#=Z>c8FD>A<9ur!Qc#9keo2KtjP`l4(P;_%_ZBJMM1lxFiqC
zM>b44HT?c-GBT%uRwxMdJmLU#kk^5h^=he4Wp!*g`qr_7DHpsD0kmE!VJbuS?X_I$
zb3sNr={igjef8mDg*$Xf$dW~ioNnyA8~6|uN)8A787Jx3f8DtqdBF=yj99|M-KQ6X
zgj+D)oz-~sZR_V}eqc*)avDsUI#+xtGiciyXr(d8B^*7V#o0=|d-F@m%f0>m`+H=q
z%Z~VE2?fW*=zzC@_3WFNxpT|Zl%Hzdw>PsawgC0dp{o~vmtVehE9&Pl^L>g|SIgdR
zy?#nEeU9M*LzF#S;o;$@O|Qo&7e7CDcIBOh?oTxbAAPf7+zA?9by%=~Y0XJ3jqU%<
zcmIC3JN4C-mCF=oWh|AGHqV<fRXhCD9LwUApP!x<J?=I4%FJB3CSs$Ll$6vYS7Y7j
zdk(a!@7huO{@&i8;NZjC*<(K};R26Uyl3^;w8xz9j4Wu7@8+)3)u689;cYK3y30>p
zwMr{;SINpV^X=osbRrZ^Pt%>;*T)yRyDaz9EFaMH{A14U+n?dXlHmOx`ghKn2LAfG
zzFt@U--q_69m;(YMai+zTPr`OMM746a-ErHd%H*G<%_A1sq^Q7?(0jcE=%t1I-2w|
z<Tz-Yoq>r%B&0!Q^@2P9?!Gz5E<a__BBh;QE_t`-x+EtrwzSW_wnp*&`8k%sd~!A!
z=hCC{JX9m+U3j7;*FT%3`-zsfO&55umc<FQe3+wod+&w($F~1|JWi7;xU-}1@VzxF
zSDu`sudOZpY2Uo;%uK`Q#=7Q9Ch7RSuq}CB_V;ijc#hH`0<_FuYNyVvwcU50pPj9~
ze16@pj_|Kvzs~$#RbAaa<>FeIFa2^er%4BSim7|7+jL+NXvU|(A%S&<9#2ljoy;3;
zywWL`m-&9W*k5<0$L(cDNObh<m3uaCHvW0%CjaS5{jcw;@-8j$d=|3oY0&!T;E4;+
zJW_(n=}#;6|M_$}?aRyfe^2AvzI+Ma|7+?CjqCdLKfPz#RBoz_-|i_<^XA^(=#u?9
zpwZDCeBhyT4g~>I#z{J-mFxcfe17_*`h1%O(`R|yExjIF^zo?p=|!&HDQ9LFf<}KQ
zd#sJ$AGdDLC$G&Oar(DF+oiVu(cAy0DA;}3Q?@%3#KE}$wAo$d^rr>>GmTuo_`iDS
z^Yi7rh~u*5F`w3cK4*QtCueQcR<Com-(xIGUQD=CeBRb5`52Go*DJxB^``G>P)C@d
z-Q-v<wsHEDDLgO!K04ZcR%$I`spzhRICB->zt<9%J!K0y2d=L{BcKkGL^n2MmzV16
z#P%<}+|t~CT5q?{m;QI{OYeWWJpZcXyAxaP6kIO?mrx9i8XP?T<1c7@v3XQ0qj%6t
zb*5Qv)T`5i^V6g9j&M~lLuR$TS#KOVc<I0;U2xK80j=~?IUQgB4z$h&l)tBe_JKe)
zR)C%U5436M_4&Jykx7RGL5!1hyqUdWCkq{jXPgAu%wWv~R?QIs+BB4z@KOxQ|Do+L
z>FIj=a!{oK8XWd!_1L7tt8*7Ly8`0ZvwCd$^Y!^Vh;D_1l?<NKmNqVphVmb*XYic1
z|KA<ZLNid22i<^M0-9a|@&AB!OkJP98=Te^8XA^@)+Vz}%L7e}fF`T<GpRt9F@o%3
z5rCbFGh98tblSJ>JjDhFrv<B5dxM6@wr6DJ747xY;+gMY^YQ1ZwQG6f57*`t>WEEV
zwMt7q`oLOlO@~RL9=Y#Y9T-7#-|B1Et_5X{>+h}h<?VT08kG2hrAx?n-I_H#AdMT<
zB4sWLDxB={Tk|rrg=JgrZ8cF*(V*B^-MBxC<Dw4P%L@Lo=)Dp8H)rbf>HR<K@)ZP1
z8UHQq`K8|QFIx4&ojW?byu3ld!H+$QQbonURTgaaO;BS>gR!kgQ>aGaJJ4FsCE^cm
zx4x{c5N|xd{o+yCT)8WUSHC=XK>30LsFrL1t;aObFyU<UVU^f>Dx|9jGz<BVRpO-9
z9?No<1EP#>>thm^fLf*pj2YcF*(_d~#IgspSp>A;lYxn2hpxk<r`t5XDuPx+>fE}1
z{rGlvTa#s3pv7&vjFWV>tE^;a<OjDy*Q~9M-}rNJ`-KqDva=l;4wIfLsf8*&K-v#+
zpqf!^Uv>T&S%DLg4M*QvUM^GwEim29pd7icy@5@^Af(~wTW4PjkjGkl8&tG&1Q+kU
z20C`+m%wF57J&{>%h!d;*SuN(z@u-V({eyF!Z$f4q@*r(jbyO_?H+R95CU4*{X^rx
zp>p|;J58DXyi)+Lr9KeH=(g!iudXfk4u<aA%yJ5|KsyGWXgW-qs;)3yc|td6CsE*I
zDNwk@FsVd7>=IwgyA!&kVPkRiiN_wFK^*}f7LQFvfs1&U^f)%`xXbFY3Y5W|R1O^a
zF2LHotSz|V=-Y=q(rZD>b3chDfLB1eEA%$>#hIF#diwhI9!c70qFM>gnFq`mC+XZ)
z@~UT2hR>-sc5?87+9+Jw4xqgo@5C74bE<NUdY4^6<xyiIi^rxm&|=e_poN9d)5hKi
zCp_F;Yq-?i4&*TQl048Nc9s~>_9ym^XRPrJN8cXo7t{qczW#tFm-$QIW%eG}mU~-8
zu7C56yR$kj34)^4meFm~oy|*@ae!vCoenNr4N5Y7Oe&F<hYBN0SR?Mp-Mw)cw6{`0
znsFKT=8KDRmVg9bez;r-3c74Yw@sVW9ye)#T-Fu1{5(i|9cUx<^W#?q1riFYS(<#r
zLB%9L=)@(4sakIZGGMDX%d8)H>I*n9G&*rlND+;i^Sc#v@YO;N;a-rdnRE}7BrZ7Y
z{FqDkz@u+Y-Np7G_rjv}bWp>^)j9_?z$NsAu!f0iw%F{E6a|G|Y3bG@NgG#`%&r5a
z7mf;z10K`bcZA5+fM((C-L`-aa9Yja85W`JzWcLSLX|<jlNKmi1w51wlq5>Y+}i|-
z*0N($<3J^*Bk1gd48euA^FT|nHT9>0i`69@29u^X9Sq(L$_;WldE2eeeF4=t99;~`
zk&c}#Z$J2e_L_x;sy==Cbl%<eE>IY-2zZDpob<Z-U}q_l4}X++kQJy&-s0Bq^3a8r
zuC_Gg1CPFe&fWqwGaj@uC`ZPv2wJ`#wBri4LG_+cf=YLPQz&Ttu-2Rs(4s63*p{+#
z&?#J|rlx;%`kD_ZgQ^<%-dJ;%8FD4g6Rp4n{vEM|T^Di#Uun-^=)TSEcD5HRS_E2L
z&TgXjF}~rV_WxuD&^9<mmP?=wgZGZFD!+aE_R@X(;vRkcvEuI~Q$Jl@-E~u?w=U8F
z#XD@H%n!8#9@Fx_wC?^0Is|Lq?{|}@$5na$`t@tciWMGymQO`MbH%BTj&w3hZGz5g
zr=Fi@`)toYmb3WUwmm7LQ*O_nZ3{Yi;23B^`Stq!_f#Uz+kT$|T1&?)wWaW}Tjb87
zrDtXuyHC@P*E7FYv3Sa~X{WkGwU;bhs2FJmnrx1#SfpHFwdvS)_SgfEHg01R$AlEo
zmYery*ZliDf4X$u4##sgpM5M}E}8t~R`&X-U0qx^K?e-9+5UR5c+vj%%TM0;^Ye4+
z!6w#CIX8`7zIZWVYxZ@u)1ZZvj&lBUj=tR((Ia1W?(jr!aAb4oJ4_0#_}p|qP<Yi9
zXZPjH{N`%SI$+W6cQp6jo=7phm<+e|b3SiQKR@l%DKE%m_Vbwe=NIectzW&`cyahG
zHt_aNMwUY=4wFQeW$e5XCOh-i*6iss#Y$G?<m8z6r=OkmbdHzZIcS47E*-L@bIwKW
zy&>0IUTTPeh8r3fm=c8(9#-E_dgfF;zv2<+XWqk~&spn7Mh6E^u8a!{n`ZOe=3?<V
zb6#WJ=P|QSCr3w1XRj}61ec8rjSid>QdqTQ?wK#!wk=Gq=7Xc<$0Nc|*K9uLbuVCl
z=?eG!{QOUIJ}=p^BLdv!Enau_Y2k-2X?mpvyr3k=z*NU=5c{H>g{z`owsjZiaIsrk
zGSfa*zgnyAGb17HmByt9&gXq+nVg(+Zp)nqR>=FHl!QKByB4<d=d;;MckjNP^Z0>^
zx8HYl|9Ls{-re1O-EwNpoxRoDBmb;ZH`1NHX9lcM83LMcZoJ<5Zu`Be)iM?Z2XdYo
z)c*RSxc6G|t`jwXe|<fv>8QH}w4*Bj=iIVena^hVoaWuhs1D8r0v$6zCyOxE9hWUX
zv3mVJt@Qb|+xC1sCY^R(`|fwI|1Y-l%ykw&^#0Dy;IOq(s=qFq?#ey<cKdxj&_dB*
zf7`2?YBQ&K#~pyI{bo_pIB@7Y2TN>yn0x<mx#}}E%l?&~RGofeYIt0xpKjcqh?2io
zUtL|DdUlp++Ws|_pP$X-g-lrQyz=`4xNFA%IS@hNk^QfW{YLMercRGl`{n-q@TL5p
zFOMxfEIV_W^t-5YpmK^sL4dXK;eT$a)_IqYZ(;hyd&H;D=X7e2cq+ta8$26K2g%Ay
zgQf%V|2~QDeAK1=<nsJ~UpQ2oN_VXeUh;K;N4d@JvajDdwwS7~%N2V0(yu;ukMokJ
z4IOqxpmum1$A-td#aCVFbU47mCugJa``cUNdPo7Ik)Zn~|J*@arS-P@mo66VsJxu*
z@@$?`(4=Sa+P<ga{&%0)7bWPs<;=tvj|7i*$m|YSqVe><pP5>n@ZYbzoz+|9_PJNK
zo+#|B_Br#WosTd6gfXao>vcF~Z=31$5!7;ju(6>p=5MKQeN(7eV9KX6|D?@SgqFX3
zeffUO={L2u6FZK&sD<vEI^k>Qn|o@TvR^;UE`9Q9>ej!U*M6K-GJf81<d~}4ej(*}
zeS6(Y*Q<BvoCj5XHLREZ)E}-{{j7>bV1w_1l`B2fd}bIdh_+f9KIg~uB^53IPcK{S
zV^t7lm3AQ2Iqpr3YN6IdiQf52pUxHkcAuXWFSPP+wo+r2bILhu_jSoNNh+^?7`rT!
zy;-j>%US*J<G)|CzIDk|*8G3_?Ye5-#2xKwVef6$|CjsqZ`tx+%Xx1LU!UqPb;-mJ
z6uOq26H=ZYIp)gI68`{nZj{a6FPE9E7G3VJ|8bBXv_K5Bs5^3B&CZ$+&GJ(w``bmn
z+w<8Ev~SgCmWij`hli8TOu4tZUhJZZ>+;8Ew%pq-bTZ5{NjG%*32A+`W$*8aTvYMq
zmrY$YOS|Zb^)KOt|2DV(zcx|FR_*+Y_5Sn2&%N{CRMN6i_2a&M=63=OU;Mf8@$cIg
zzH3f<%}py=CM0Y*-*elSi<$G)nl^4ceD$0qD1OWtC#|`2X9ri~1@153zIl0jC%sTB
z{PN{X$G&UIa_{4F@7=nkm7AOU>B(gOQ_lRhDodCC{U2juZhrdk{>W^%^}B?+kC`64
zq>}Nz?}$c75?9`}nu&jRyS$1QmJC)iTDr>qrPUVyl;@|FQac+r%sf6Ln)k=)NVRFZ
zZq)iD9XV<F=<T`959Lc+ylyY_oZQ!y*|fBM-RYt}Nq5y{{M*0uN4<P8Rju~6`M3Sm
zPi}i`l2MlvbT}Z}c*MS6hC@NXwQ+sj*VUhn2>Z{lSD#xlNikwWLZeLen~lsCCM&D{
z|Gu9uwDxx1?z4NYU%s2|*5qdu{$$JPUz4?KotHoUGQ%YHNp5=QoT7;*IMci5d};ib
z;(b3m>%#taxmgQdE_}WEmC)-IC0zx#x&J=@lAkW}>ch;&^JOYx`|LkAoR}}~sZz22
zTmKx{`n04kuR9JuEouDS^!<x^aJ!W2wsqbr4V_EY{MzwPaNA+kO3<M96a51opcCC1
z99FQ(RlhO3xgoJxa^<dfyI!~befE&o{7%BX_$?U|r%azdTX5Yh*7p6q%NK`Q-F@z}
zx7XX}`b&A)sh7S6o~vw?$~@h2v-20<mG9H<?n~6j^h}a6y1TIZse0Hqb>CgvR;e4N
z?tJ=RXuUYE%-JmeoR1H3-Y*EAJ!{WZb+HrKOl3z7{4u)w7JO!?L}-Ibc8C&}Lc)57
z<mAPX*-LF>Hl=jR)PA{mxNMt>>S0Oav>wk*b6(o+b(kz_TXM>e-?yM-Z`k8=hoAqt
zFZnaycaqq=`}Mtf>leIUtR<wJB>jK)f2r8?sqZeZob;SzvhniE1LwB=yJ+CcbX;wj
zUMW|wuto0rz74)JZtYKP*%rLLZ^nd(lJ(CmKxL~r%M3km>xyG#gI>|~t>Lp`VoR@v
zuKW7v>vpld*-1+-x2fy<>Gb%oX_tC?;fR;;(#8I7;%`6gX?VFyKi#Tui`AFEg`K7G
zzkHo-OXg1Ni+dUPJ?sDCb)1)vc)vIQzvbUb*V^MV-@Va4dLOxY&CwF}p#I<U`joe~
zwx(4DEayz#c;x#37^|pn-@}*O=bK};`v1?2>{VZCeV5G<G@2WBXQIcoFBhuj<a53X
zx&ONJ=&Pu@bDo_pnj0<Z>TCZuRmt*Rc6Pt?CA$CI!<^F#IH$|Ww*Qj<n(zB$&P(Tg
zu@yI3(>dU0`!zUdu-5&39Y4EFT-|KPu9wSZPpbW~d;f3i%@=GdmD<&3UCCIqwYvJz
zqaz}V)?K&SU|s7P754qeB~9zOWmjIC{=BI2>V=EZQ<+@}vF4Ijo!u9gyzaQW{%gO}
zOO9#N^7Fmc9Q9I(sybt_>wk3LubQkyd-~Ecqs{)<O`M@RX;bs89@TftqkVi<UJH@|
z4QN<1sYJfB2;ydH6uVFwQnjQntXF#a2{)nky!#u{&&z#|`F|-_`isOnDO>xpoTNV8
zLW|cM&U`+?F-7j&CEdC2F5efp;^MhI_`+HllfX;)41HTNSE{91U0PzlHo5P}zR+M{
z&;C58Rj*ghaTeBme(&6gseb=ou6w&n%=`a~z*!!%Rz2%HQy2X|`)~B^1=gW&D)-ud
zEdKWF()`O8f4@ko1vTOh=t3vh?B|@=Q`uSHYa!rpAgb})Ils@m2d}ukSzKDSBilst
z_u<X^rz|)B+TUVX`eMaoHT!cV^XFY>ePgAyv^x2vVa&{b<-h)4V>#hD$>d?-q?K2U
ze%;A=Idw((hu^!VPxCW=wPn6q*~(ncwa&|>w&pC-HrlqwUeUYO-sAk^xwe}s_fD?t
zySK^kbG=p7LKD>}sn;p@`+PIKWa_e^b8Xf&P3as82`r$!Aaar?A2ByNxUkF-T#>WO
z`i|+WB}b3({9S%H(s*jr{|6HnK0LK#+Vw!a^uHmmejYsUF2#HKh}Zv~vW%i-%1Piz
zna-5Y`>DE;`xU5f49X@fi_{$^iSC_oIT_TeWn>Z1XkhRRW1O&)71B`TaPe<Y(XKLF
zejGZ^6~MqaX$_M?F?8flpkp3`XV{k{zkYD@TEJle1C#Uq_SlBmMcga`AN(JDm#))X
z|L)#|aArQU_tU;zI<hQGCX@Bi+q*%6ukUl1<vQMTVPMo|_1LtAM|-Z*f_Tt$fRvQf
znQrH~zn>iBHTO>Teq^3{$3lYLfAx)vmsE2*?S<8*dz^d_8+<uVa-R9)*w~=xXz6)u
z>`RuKnwm0Za-RJV)u3`ZJMoqK0rke(-`_m5vsZ_Nhj;hI*?xbOT(rXYqqVurJgzTa
zzNpsutuWp=d(U6x+GHVnt+>#sKO8;ySOg@(8dS0)#Qc;5;u_a&cN5pr((-94y)M5`
z>GrG7v*mc!yCp`iTO2<3t?fjQ4Kg>c+&^4$?qdf7(_bc)$QmJm4IT$1_g;G0aqHOh
zC+hrl7x%t&?4Gmdg;%h%`;tl8`aCOz8E><AY|81@_}jS#)caquX3d$NINP7stDl}<
zZ|Bz(+Th=;mzSUaQthBtgXwk$g&Zc8$i!}mx2_2jKnt}Z@5Dt$YT6!s`)MxwdZnFG
zDNnARzP8NI*!D%}-z(h=Ob^8rPI8t1$*4WT8nm2Ua<A5%c15r5+m}~{h5Gq@H+!!r
zPzl<RThGG4vG~A)qi?GpN2hk%C{6AYo~d&A@QtMbTPq(6=eyNaec%qCqbxpmvqnha
z;*A_4Q4K1qFFd-#-)O@c<i38={Wo3RQ~GpIZcfuXAELl@+qfqs(6+YgPU+?6ORCrw
zM<`1c$}ze(sGOeoK(JAO<He)0^z62jCefy{%P!U|dR6yNernY|uX=Ek@|-V=7?@Nd
zSsk8<aXirmoutz%fBN+4&ujZ$3!aEd__<YnV)y<12CrZ5U})6fo{-{d`Rj|V2-9Id
z{<cL=O)jxDx^h1|VZQ%MpxgQ!4z*g19Sojf2T$%)WSYsz6L;s_mxQ#uDMkJVBJZ60
zrTyJ!rDhb9O60{Z^S!*C42#1RIj1Z=n^L$NG?>dOu5ePz!qVJDVJ}1X?aRME<W)8H
z&kdct?|{a8Kh5<Mw_o>3t11vtzvreP%s6R{&lHVj2S!jA|JUwjA6_wrJC~wkD!*Nv
z_N^yRQNRu~J$JN6EL!8hmj$hkOT9T11S%UJo#19@Xy^wW&Agl)bl_1M%jx40;Nu<-
z<bno%KnL3xi6nf{a@Obq^&u2R6I8U9G%mjRP%Pn#)}4=w!KZ(#G4-URE^?7%i2)6{
zc~1xdkJvdhsA#h|F6u1ffN#QZgbnCiWbxSKCj6+D<&%iV-JN?kZ8AE4YX`VLqo4yy
zU!5Xvd6qJC-v;do0FNIk9XM1TF0qoOaUp1{L)IZlP~*-Ev>#UU)|agcpb0__V{_0*
z8I!)lB+(xN7Y`VKMyz};Zd$+g`JB?3wR0D_bF_dK8y`8i_~k*+0Wbwgf>)=-l%6#D
zdE{xm{MC1t^I4cQ9VUsM*l=M5LbLHQc}?wg``y$0=BLI#e<8@E2wFZ=$&k5kKhv%q
zdlxNgx-a|1oM+<R-F<O$KhNu*kl^}F*x`7yp2H;3FB}*5Ie<n$CM0%-EUqiNJy|7u
zVwc5S-o*@_VG@hoX4i@)6z*RCXX5^ydU^X_UDBVJ;QDVegM$QU2dIGREeVdsZ{NyR
zu3l|?x%tf<xsC}g>jZW3`eRPKEI7gHvB^o!VOG2Zqu6%wV>5U2fCfPy##(ecTwwLs
z)Fh{P>-lPjSJ!y1UcD;ReY7T*-<*H`fz<cE|1Vi$v0wiB4AZx=KKyO^U$#gvDxQ4g
z+;D&c6tawMmm@i4Y+uhc+PlbVb+$$i15+8tgp`|t?o|&rA-0DoG=X+`@mR&mfktkX
zZ+`$C>E7T_#-tK?voi2j66l;MnV4Omw&4$j3HP&n<fYE&3Km2=h;M&=4s_np-Q3t$
zpba65KpUD$lKsyMGl9>`2W@VzDW2fZ0xI$wRx_zYt}6<PoWYWnoxOC+mMJXSK8}mm
zf*Ls;EFPPjM094o>TB4%Bep#Ex_tRF@ED!L0dB@gI{G0ijW>YSRODo2fHo~B%w^!d
zzm{85RtmKJ{P4;G&{&+q0dGdPO?$2^edhq$mLrh3KoDf~6VP_|m=lYyCf=Q;2pSBv
zjY{PA$v<Cp+_f>2o7a({@esGcq|l1ucM%Mrz-O2ly+riKoz~M&ZPnxEY~#sS0&V|N
zi7Y#AK51`qVYSL(xfy=1`yJ!=Khdibu`&=`s0iILY+GIy2?~;X;k$I1t+(&)@h+9*
zjQKQAU&U>`p3=cn9^FnHH}oAQrPlW-Uvzd`uO#@)q5RXf)cy%EtX57Ye2s@d1Ecrm
zSntwV(0%*#sZ$bri*8PRWdvGsF@4@&R-rX#c4)LZEMf83q$HZR+v+xCF5%F*w`E67
zefB06R)dZp5Y*Vi;2HMt?9Rp9piS}(9-@}q8+O>HTj{wd1Tm>ZPUPCYd+yt}Z>JtR
z<~GwTcb15_c-m=GvF-fwha(^RPf#tcxA`-BPHF6d;xO^c&FfYNDKdQnZPFAEK3~10
zI^gdUb^D2+1#MQ=)~R=P6c#<3nSLtW?z5!-WL>xQm)grN&3O5e`@_0wrsO-TyJiVE
z9Ef9_q*I;z+VlLcU%#GAi_V+4YnRpJkh3$5-9cNo|9_PKuc)f3`st;A{jJHrUp*?@
zmiD1#nisgzw*f68;kb4!YkSU3rS<!Mt<s6z6>`q%wa(?UH#euBe!YIbUj47j^Pj9*
zy>60W@}1xNe<JqAO`QrkGcZCUU`DHn*df=g-skOpuMrUyJ-NuWn@s?;QD)KQj#(``
zOJ96>(8$bw<~`q}gq=&hY{Bi3Rw0FxT2r>De!qCcU3}N;eIYB4pP6ZV_Vlu4%dT9u
zw7q`xt(ENxcI)lWT~4@yH82V!>@r|*<Omiv>6Dt2kokLVaXX*vsomDOxw&ayw8Xlf
z#)^xA`rRA~52iDCPK*DfxOaWt?F*ML8!!2KPK@u|;|WZWb1tyHlK~sY(GuJ6^3VqN
z4F}%Nw<uin!sGG-=j+KY9h*!d+OC6D1d1x0?8<sl{ARmapq1*4ix&+SwEg;3^*O5k
zQ5$rklf}hj(+`mp)dlyJuDm?dD{aoVBk%66(r4x@{kGq3Fg~wr1dTm6IE1i9OcuR*
z;`xpDt=!_LK&ytQ@Bg#(<|)Vhp(}1%Wn5Y+J@M5yKB&VK6oRJQxW2+)@!8qg?d(jF
zoNw;#4zK&NSpMX<x3^u(8|GV;u8OI6*!pQ9f33#i*P5U~Z-s`2v*1&U?<$|%WO+*N
zyYKbXmrdoeHy=TAIYVO|qx#9DT@(CW&N2NueBoC+%m-~;8$Q&6&O3oA+yh#BrM83#
z+NyL&Si#_VEkO7jBxoBLm?}X_ihMm-!GQ$2=ple{(wc>8b3oMzxMBK9OyT6I*%P?H
z9MGuDLMD|+=*$$@lqb3llct(0LSw6efytTGV^iC#0yf6a#g4xwJIb^QzIgj~YIt0w
zE1#@Y$PDRacR;64ZL0pB_xbR1&E?FWOU}+R{q$77KJtsW80d807^XKr<knSOyv4+E
zr{FN}rsU&%#mgs661pgVaNW9f)4uQfzIRi`#YIe86soqbSi5%W?7Ur`dOIF4MQ%#*
zbYuWu)bM;>^^%1P58he7W{r>Dz8^_DpG@-RD*Eq}f9c8<mFjPACcb<3&PRWt3=;>7
zOM{BGLgNC-gMt<X4;o~O&lo<l-|?{`rtIx4RsDTG7S+73zCZc0zkTd9-DtI=M|qfb
zOB(tnt>5)Z3pCn$cTL%mT_(%y|2*VRy|<_G(^37pz@&{ca&B!odBifq^IFH;2fQo-
z9H3I>fwK$qUx5qqd+WaMzCU-*SJCho#qam3*RP4&8wEO?7jz2!<o6#{>Kp&>-)qc$
z^=0+rACKoxunbP&6L(qYvdqItL&f=&L?_SFHlFY{rxQLZ=BMT;K4mhWqUkJI<kP9~
z(5X%3=kGOj=WpBn{?7N?;?K9r`}<bcrSE@#FT3Je`rJ3~-&fAt>enk}nsa4E;MDgT
ziTvg7?r_dq7`ZtuvRh2oX*Hj$)r}d3$wJ>2WGN{yDFw`Ea0yFvTcyZ!u()-3tH9-p
zi`{cyTv!;kHfpQGv*Z2pWuKmS?k;;fYj6Gkdr{kRGL_wWHtehYopxfPfANzOg1c*f
zZ=1+`Wm|6aY=gw6(wCQ1uPCa&JTud{?C-DA>c79Xnr2-&v8(iTny|W`$)SiT`tkd2
zbct%`oSS3$?Z?OD-4!2`P9z@MZI*k>r25~VN{;%yRbNlt+M1ot(Gj*bYHGH1{ym%O
zA0HOZwXeUoulBbX%i}XMjSp8`G|Z^}`6+dG(bKN4Z*E=|(~pz+<!KcD#;W|?oV~Tb
z&AwRY-La6iC`ibd|5~y*dS}tnURmpFzrMehe-$=`^Yi|KhfWEXwq}PX$CbXi!dZK?
z{>QDom7mp=H$5tyQ?8h{#ru$|r|dD6md@u}s=mHzWQ{Wu6%=TEq@pk}bk1wF)xin}
zyw{h%zgPC{O=R`=cXLg1Z<$1FEPWkT{oz5Q?<|v(Qf4_B)AeFEy}iA?JzZ~$S>Bxt
z|M_;j^ClhZmA-v<cX{speYM*%FE0zozr8KD?D4VQ36o8#zGNu7cNU&Hbt>oUtE-Mr
zCQf#4GJC6WxSfA{`uTaRiH;q@(rmm^B5`Mq_sMSNl{UNa?Ck8*Tkr0z-mVz;;l_lN
zx>r|LUa<cr$n@2aPsT!^g?W*B6xZ3Q6QsW>@(E7RkKf0$XrkRG+vFG){-5q~T8C2p
z|NDFJo}zPGOQmAO%^e#G9y+~WcSrPL#g7k(x3^|bKRd%vxur3-qS7@zutV}IccEug
z`rlt)9d#y4hpi4<d*;?I-(6h|93tY3oogON=||2sYD_yji<Mizx?_!dzZ`2}%ktxg
zyH$>FmVWc)<>iC3TNgMnOuXQmWX_u3s~)p?HJ^UOm&*BewLFGx6$f@7E!VFw18w{)
zeSM90yFgOQelgvsl)Y77KV_ADcyLhR+J~%4MV)r@HDzyaJroOn^)Rtp?Q8wNKR2(f
zjTU!VyxrF*JSTB8!$SLYbFE50J##d8RyA$qm-FpiMhowUt`3XbTlLk6zd~ev++Hb`
z)NOxuf=X-CTRV%>1&*lu&Drqr@$u=8-<XLeO>6O<Wc8=-K>n*MD;*t-?Plv<TN9bA
zAGfEVxI~muP(z97)IHrrM<=a(DXj3sd1d70v>i%p8ZApJ9Dmif@OZ8}mi^_)$;koB
zi=Ur+_{#o{aM}BNdkaoGXZ^dgH{ssB_sSPy5(?M*&Nfrj5f_b+Q#*24RQK<%uctY5
z-aWp!@JHUM4^OZ2?@6h6x=8h8jHgPwV4Q|c@Wn~*Be%%S*FKeUpn*}c(Y1O;g8M#Y
z#a-p^^P;!qa6aPVm%6vYw))$JJu#X`bU3H0l-A5$+%&6HO=gV}lTyGOmM15*&XrES
zswr6TUU;5BSN;8s$;bEWBpsh~UGa*CT-Y`z`HJO>4s}*NNm6|F$Vu}ad+l-Vd9qwe
z`tg|;7C2VOh%4Xx<zp27=|tN3d9qH0-qUnAce5_{pP%>P)OVe{<kXovILZQL-rwK<
z_@r`rPcILL-nk`8Dm@IRLm!=)RNxu({BS#eqQ`st>pynsGbshwu>AYGzWCz}J#W_s
z_Noqj=g!VHZ@#{w?(eU}oc)ucUHN>s9qOL5ZO@0zt?LBB@9(cS@9S1DdD{A3Wx24~
zpXjHTm-{cwE(;dZ@_gnc-^|W$X5-!R`o_eaWp8gOB+RH@m;Q0%|7^7$cRyK0_fK~|
zb*{14tP(Tn%12(l`2BUd&vSb=Un~dZXT=2ti67TY)$yIkAg4I#<W0lldd~VSteS6b
zoDRLS_^G17`sezuudR)4kA4#BdU|d2_CweEWUbxu!(SO!+6TVx>wjtX<h9Mon7y|1
z3=YjwIk(wU;Z^VH?`LlBw#}P=|9`NLUEQA-v1#k-&L7_KZ-D^B5%(wm{{H^=g@eK;
ze`qNwFdg-Dn78IpjCthW>6`+)4hlD$cV6ChGwA#~2OGnA+O3=|)B5D?<%F(Sx-~lc
zWI8W0j$4s<xQ%t=!HxVX8z*1sN$2|LkkMtMP*k^v-zKU>^yEY(#l5w^zdfCFQ`<UM
z=+4bjk0dL_L(c7dtpRa%=X?8SrmU-2C*aY-_ORi3{|E7Tn`+L-6#R;)pUrvC)XZ?h
zv^DHMi`N8BR`UgA;ykw<VvsD6Gv~n%wrjGAUPAVV=H0hODG&cEF`irT=!`0hz(ebQ
zYxvm1{N~wM7O$JifBtmA%}uF}4ihgwu758OcreeDE79fEhRMBFB9l&8K5KBY6SMyJ
z?cH7JR~Oj7d!#(CV6=}q;M`ls+gtzlLG_<`&r^=RS6(+mTB-RE;~Z`=ofBKW|ElAi
z`tRq&lyw!20-XQKzdbnS=l$#S_cO;ozn-7abn{+(iCoRIg2=vtgx<Xcw``Ow=1GTl
zL<;G7zM9~^t>opU4VeszJj^Z%&leSnwEvgeu@_W^h14=#t@|rq{zH4mn?HeqjDkOE
znV!T>eBi?uw(d!)jhT!^=Ytd9E*<%OIB{u3$R<vfd7nS^Zd09dvVPBr#jO6b)Ek7k
zW?Pr9^POpQ)U8iOlF#>PWK6&XyW0{M>weD3U)Q4iuwh5f`+zgwb*}H&f0$)qSGd8f
z$71uD?>{_LC|a@kQK|N!Gr!LrU#e8fv3`@;8dFxb!ry!BV_h9sR>?7z%?dvCe|5~)
zH&a}d0!&y0EdQxT6-l1$HlDrV<F7p)e|7Zsi|<XVzNmC;6Q_}Q#Kmv_EaQ!8w;Ar4
z8~^#NsQ#??`@a0DI}5d1aMo)3?XB9JFXv5>+dKblv0Yl6z5Mj9E1mf+9!BEt<HH37
z8do_xbiNNw*G=i<=x6{V2Ts8W>Z@DCf`bJcV^}`SJ3HV0{=X-FM`Mzwo~kv}o;vl4
zjf;XU)2WkQ{d?WS7zG8uNW+n7-sGhPiJW@tmZ>m-+8YW?N)zlDJJ)=<?jQy=x`AVg
z0%PYIp_mX~PZk#kFjA;x5{i7ezEKBajsT;eh9i?ur0R|pvnGMv)4<W;@QX!d)1`Rk
zNClY50Zl9_o4g7FO;w@x3p9S=^hjB{pKTMwSO*rD1uUE%DN`RT%JPCbM}g_3@Prdy
z^}H#KaFaQOCY;bZ=z4Vu)Hx0;m(&#|PW>l!f(dT25U4TG)V)fx6B0rV983Hil(hev
zPGE(btm@&Qw3<acG*}2690H7j9`hYa%@?j&bH@Ia7R=e8W|$|_|KC49KcDLLZQ(Px
mb|nQSL8kp*u0H+G{3+0M+n*_yjxaDVFnGH9xvX<aXaWH7!=b(a

literal 8984
zcmeAS@N?(olHy`uVBq!ia0y~yU}9ikU|Pb#%)r3ls9kQrz`(#*9OUlAu<o49O9lo8
zmUKs7M+SzC{oH>NSs56Z83KGlT#bUNj6-To!|HwF)cg|E1Clj@)3w5LbRu$eBl2{k
z3iKQt92}k9on0K<y&Rl8{5?F~z5E<JJw3g=yqvwm{6ZXD0^$NA9YW$9!otELBO_yC
zV&dZBTtiaa!gJiCi#_72{4#tak{qJb9pZBwB1(gU3X_rw9g>S2Q_CDOs~r*&60)+g
za&mHti;K(3%4%wA>gwvuBAU&kTFs-{tm3+?6MAft`aP4IywW>-GP=F9C-~$~_br|u
zS~l0KVx51*ih$ZpX?1gos+!_jjgs0;lDkdQdd<=&n&(Wn%9&}MH_N(Uu1)C@`<w=c
z{3egQ*66}Ehtgh$%J$fzDLysR9kN=M<aVtt?OasVx4eGxnxNK$8B<QSOi7+FyP{!5
zNYl#D_9bakw&l*=TtD?{NMmDTcXxMBPfu@eZ$sDAi4!MInKEVCv}tqZ%$Yxb{)`oS
zmadz$X8W{-3m2|ly?V>el^Zr}*tTuk+zrQ<?l`|{@0E3jW^6w<chA)Y>kr@DcI4{T
z6ZdwWd9?51^MfZh96ht`(8Wy$4<0;x`0&xAM~@vlcIM2PGgt0ixOVW;^^;d_AH8<_
z^p!hju3x`?>(;G1ckZ0K@%Z|KGq<0eyZ7|`l?U%1Jb3W%;lpRoo;`i}?&a$zuiid=
z`SRuK*RP+y{`mIu^S580eERk3!-o%FzkdDo>(~GP{~1OBI0Rxkru|}IVBjq9h%9Dc
z;5!V$jK}j=q%bfrNS3%plmzFem6RtIr7{#GX6BXX<)xM=nCKbk85*qR;yS><AYbF@
z;uum9_jYb)y~^>><Gc^Kw#Fs*>+>Gr>pWOdF2>8^H0OqZvxU=v2fkuuk%!hsw74FS
zvTV_g(H2NgJEY1ui)G2o`pMx}^P`M|JTG63{Tj0V+4sLSYu3%Xx-D#7e)#`gyLa7B
zHr{Z}p}~}$X^o{o!r4ZKY(AEVVub^<m>I9haBO&nQ|dz3L__|aD`hw?bh#h1d9bWV
z!6CVdyOxjf+JvKa?F>7OZC{>v-urar<jMR0#wG7d{{E!=`Ro5bYyD?3uC1N7-%#<-
zZk440jB1Y$_tmU>_2KaT>QknC^~ZJRS=sz4yKeBT_)qW486Wf~Pf=o>A?Nb5{`s+=
z?Z@7nm&?77W%_D=@|kOI0{Pn;dS>=K=9wqm_G_-ypMw*l*Z!(GEfG~K&XnT4<ZiuL
zb;6m&H{ZNa<NZGS_m;S?KXsE|Xgeiro8xlp@7t~Oba&fSZAkRVXJITcuzcW_o;Nej
z^vn4iz6I~r{gP>KnA2(YXSZJ6aXtB*zO>)(4y`xbp7xug(Nb9ZZ)C=b?QepG6y7K%
zTsBK{FL7A#m6v0JtYCTlp;B|sf-PGUtMpjpF1l~mkiL*qTrX_iT%;WJD_XxxP$BMD
zv_6+$f|c0LyeNfK4gur8Yb8}V1kC@gm1N~;_;Q`~FO$OGQm5Sv9`&+;dJLE1!$Y_m
zzFe0*%cStv)nOxpN4;TyHp8WOnJruj6aUHGF?qIZwn)Io3D>HlmE&fg{bpY6{aWjy
zW`oDC+pF?8u7Ceqxp$uWmiy6h*E_u!T`t{Mw*H#FC9wR%i5X`X-@Ki-Y{lbgFW=st
zxp-H4TZV{2;;+?e^*4Ve{JwJa%2)p0%I&|Dg_@$iOl7q&dX^jY<;>ZvSj}H79<%<f
z2sh8%m|3-@`Sv{9x&NwNVr{J!**_FqDAbhB`Py|Z!{m=sqCIbv{I2bH`#*2)|E&rQ
zbNRB&&a};yO<TC}U>~c1!;~j4`>TG+R<l%G_hpI`Iv|-)?BM$K4hM^XYVEJZ$p^$#
z_r{rW*LX5mao<?<|5-Z&heH36t@hPF?r%8Ha#gZn`Tt!T7gp&U2ux>~<Z9T(GGXU8
zciR}%|605kwB)~J_HXabN>F&wa&R7N&W<Z9#BG^W{OXHeNH`p}F}<_TuE?Lm{?$Z5
z6^33`mE+TDEn0rnHLqvZiO~+}5MzAu?$0fCr#l+?^4w}K9Q^nGNibWb_vdDNOU9Sw
zi4BVuwX(CU)ev;}aBltE@bb0KGrD)xTsFJQVQ_o<Yw2&d>P?x>+*5Tm`|*@9>!KpV
zyFY5q%?vv}&lX^1;#j)hRJEGX;Jv=?PVR=v`p%Ov4bDsUA4$<|$ocjAmH47hqW5y1
zJ<$R2PVxT_@Ui>iz31+kli>^xzkFwXx5J|5$7{J}hPxAd>*N2rzT0V0^J3$11qbt#
z%lGFOA3yr=aJ>Ite#Tu2bN)Sg_s>3Kw>*=<;eYd@`F{OfRl2WG?(WO=uj)AxZq6<*
zs;@S?z47el-eQjB`~Ux#xZ)4PcYBr%U$%dbk$?Z??X85{mo3`AY~8<qkNnj4&;PYE
zh)!iVyf8PP-=^2thkwcXzm5${LYR0~y?a+Jm2M%n|0^@&q(e+Q7S3z?`?*(}ok>Nt
zgk=JVGGRW!%s45Cv%v1p^<Ebrsn4qKc6wZ4y7Tny_UAL|r!P6dVX!Iv@9n=6mrrbY
zdGN^&&6O-Wj^BRI@ZZeSQ`_ObW325a@82hXx-s=R>#05v2#{)=E~Ma)IH%`un;%Dj
z*g^A23J#uIc1&bp<Wkc3YbdZl;?`Y{CWfT~v;IkN1aM4lF1y^J;2^kVz8edp*8<;P
z$qEg1%h=oRWHGV?_-~JF5pb~1y)4hnSaP{i$dV<%xBbg;2Zp01UiCaI7rdvWdnhzS
zSuL|?W71H)rraXnpneym*hEPAuc3g0qTzgnHilmvzuskVEa;7R+26=;s$<$e362F_
z9U#suj}IVDhsacCg$605<@Rh$8H!~fC-6N2aaJhYz0IuHz$SF9x0&JRWVOGB0t(e?
zC)?_|Sx(GJ0hv%aSq~(beJPx`jX`p<35XMa3FMw9Ua!6!cWChOocB+HV}klikh6+h
zlt9j6`JI*V``(9}6Qp)~^YSZ!%n`bx-@bjSQ(5lu>%E^jmfEv1acp?Z#XNy^_c}wF
zd1mL7r~Z@RP;dy9YTLCt>&+K`>E{C8^*k&B3$*xBy;%$Q_rGe3)lrxMQgk4${`fVH
znb*4(ecYdS<0zB*qQm=HnLIXRpJ&?EzS^CkQlUZO@LM%W2PqDPqbv4bf1%?b!J*Ki
zEn@yUczXEL$Ip9JeE9iieR74RgYt&@nM*uc5B%CRKX)f{{aud(Cx84{qFH~?R=hK+
zp?c5XZ$~OvuX(8$H%K^67b@V;=sn=gDX_r6DPP60VG+mvNgRw`i;niHa0CeC=BYR~
zB+cl%eFu~TE)+=#vS>74`#w<-o&XM;C~+*9Uj_=3S1-*vWtcRUzt(Z$STOtC<P(Yw
zS-bp|+8MfDP60*Rbd7!iCx*2yRc$Qr*uN;J*uo&yIT0j3;iSdADVZD#`aD3U-Rk(m
z#L2OsCj-P;)d32s1)VcMoT`r5Amwc*K%6Lxo;e_1^A8YD%VPqF)1U(4z!HEED0))-
zHi4pdkLPqy^crh|qSr_*^H;Kh!@ecH^*k&mrd|PQnmNe^lqS4cF3B@97CnhjfFyvt
z53;v2g3JrFJ}>*i#i7u+R`dZEyXi{l3M0E`(^v!?8f?QQlWwfZTMz<DjSP!dW!>;=
zp5<5sGE(TxH}>jp1{*eI%{a1kf2u+Q$F>X}-B(48rHA#z1Z4lp3OF<=e*H2*N&Xev
zv$h_FQ1^U&nO}kC2Er*UD|YWb8QEYU;Lz}@<^D7-kyX+aMFx4N<O|QcE)sj7m%pD`
zsL?}%Ib>^d?rF0-jr;Rd6rKbzxiviE*gb`T(M$P*n-Gge_sfHd+ohNoyOjQTDY0mD
zo^&iIYGZhM;T1@-4V<49SwQ(`isS3wCj=I7L@lvrV-j(gp6MdsU_V!FqBFzWEub(8
z@VgGm;O1{Zp=TnT2+H6-J?<Qe&^(=?ddXNtz(I4PR=Wek)Fag`0!$eykGNG78tfi{
zj9j7oPWXs`gY?AL#~c}AkAQMSz)_V~AMzU+x;jAR%YybDpb*RIh&A28#H68E1qw|_
z-p){P1#y@rfed=$KMNF_cRWGaY=Y&<OY+Q&o756Pv3YKZ4=6TgECCsGbCLxpHp7EJ
zzI)>N3#3U$&;z7EuoF};F_yhqeeic}wCRG#yAEIxL$=#zU$Jq4(u~K(+xHj$4-4ZF
zy!)4vL!tHV^YH6DlR&N(NIKv5U3+z#>}ilXj)%MU=!r*|ze!^3G_pMHz#tj(HR1~I
z89qbCZFe8al`<DQdo=`x8m~DR=^(SL*HiU??Y%noALX81Qy4xUj9ZcSAf@KQ6#XJZ
zoU(avCj8!=C2+2Fm*D&b-kcUJBJMYqvTy`QHG<0LNT1`4;gb{{0$c8TG%>JVd<Kfh
z_Aro?;g;EMER0-=Ab&65iSk!&Vo<%12+Fq&dY3yC8tSZkmD(9@WrDNNoRd3l#|CpO
znDq{nS<{q!K$*4kBZneOfcJ4w@T@HXMf(NMEuc8|dSvUw!Du4%kyS{*LB0?a=2rwY
zLHR@SB8XEWs1M?ZwtociL<CJiJpMvZTG=9C4dQTK1aV3P>_Hr6O|Y^FDxesu24~VI
zeycz+bjA}@=1(wHe+g1iq?QVbS7<Js_IL{@VrLrJdVuo%1a<Yt$$6@5OeviXAXRN0
zpyY8PA)fDDR@;T5(7O&ZLH^+U7V}(~_Z6ELD7rinvfZMjLU;thF_~bZ&%0??+JqQT
z>SEaaH`nS>@ci}bq%}YVg~EY#-3)&pzS`CJ$$^1!Ro^m3d2nnp%w`nh|GPqZ24|4s
zg?aA-mz!H~cO3q*Lo@!-ylxj=c>MM-Y*u{xYF*V9pSuTM9(=e&v;LT^cxNzU#c$aM
z_ti9=n9i`3h&`y9J?(1a{=6gV8Dffjj7JSQwRUncaw&fS#cKBhX-|O#DjI(aR~rf}
zP`G8|%*1#~Q3q5pi$wV;H!-wcC<DcAlNcyiR4+W_OyUS&h`lGv%XsB-u8<|m1;68-
zPXrtwc{b$oUr^8+3xYD}UYE)i0j3qI=Roza=3H>p2)%vVDBz&_@zpU$hSnoBjVvq|
zj;mY)Wzbt4pu7exk9T!MfHG)?QW_}Kloo+1&=rbBAdXlPD6c`YE|(A}Iv`os;olNZ
zP{y0*0&?lj$y%Uz&%XqUkrdxUpm^``-1l2pKmk%8r+7aCiTO;F_@^tN;C~5Z>XVKu
z@BAGYIN!`(_<Nm&!{kkcMj*3<&a6IWswu4wa-hP&m<BagWtR4OZk7oNdJfH#43ofW
zc5rNP-~DG#*cDgT#VzIaOiUhzD$K943PFXi#WZjRcdM69eZ0vzsNta5sbi__3mBBW
zntabOwKOs?y}2>Dq4DnB)KkYU?mUth95l6e_i0e0O3zbJit&x7!`AJ$r&)iv-pk^1
zTzK8y9a18FI{n~$JH_n*DBnsf1ZB=h7Epdwb$r<$-P;Juw{2x0Da|c&K>2pzTN5RY
z02W<P!uLur$_oSq^9yyAzi*{C$8VLJH80kI;VaA1{qDzXX4$^_`YoNmXQTWNmWr>O
zpLNVTuiq;_8&my|H*R<R|78E!OTVfrG*~3QJkRM+`+naI{&U<PehDAb;rL*+R?z?R
ztH1pruesZFm>63)ed|99CX{SscwhhMYP$HZ?_1O3cmJ3A`XhUf-{Qm4-|wfNIbK;S
z$)Vs~@T-`~LeG-rPQ1v0k8f5o9NROWkNMc1bFWW3FnBUuy1z_%`~7t+1)dXFD!wm!
z`8VQf;g<f}a&_@nKTqfUux97CU()`M1tu^mzRb@KY^W3{*c0*fj_Kz^e}Csod=}hY
z6xPrm{O0kqzt`7Ger~ChQv7g=bMLqB7v6pMX3CN6HG5|JyD9g=iFbT&(^(fd?-M?p
z$lO>d$P{CE@cO@uJM|X)jXDgqUST20)?fb~KhdQ1X1?HqzsLCa&#d0!<a8yS^|S+n
zV$<dO7kxK-c5h}1n9TpqKR`YHv21N5!>do1-z{6rSj#_`d*3N}9cD(CjKb&Tr@!=N
zJd|X#IJZAz-PwMI(@Ym8>@PU-e9Mb-tTqk|oKbgv)?WW+xl!dn659sxnpfNnItPxQ
z+1h{mg8BRZ%QX!rG3f6}bZ@vEuz`a`;K7EYbMHs%eY_tfwBWhjYU@jJ3|k&s$$pew
zfBRbYS1rwl`)p#@#uZ30FiyJs?p%JU?1QjU&I7fT8FDsv45as;wS8{&Z`RwZ!Hjn}
z4ot6Gy>EH(G4nWu;CTo3HmqKBcy7G@4(SzLWuO1)F*9W>db(%-=>~?bjLHAP7#Xiz
zsJnMR)qz3xh##mG?)V2(B#OHD)c^l;Q?>5j?p+`6-ucYK;&IR<>DTY({N9t*`yX2G
zd@ji`p<!~x%lGwmr)|aC^Q+ERD>xJ>E!)5UQD67r>ir*W1r#g=FULQ*`+xSz---@d
zeag%B&wo6xo0<2&fP(4e=9<g#SN{trsH#7%cz^2mck95PV(;oXCQMjy{hva^^d8oZ
znz#H+6(_?RI$oY<WZd&a%i+wIa7M;GDImsi2L}BjCZ6B7uP$=DdqAYTPO(AUkg<%7
zS=(XquExxFf1DWfgP3}LRfjdGi8_PJoQjD;2|IGV*-TeRihydE1KkrCc3-(1)-W~n
zu;0EptNhqlJ}9X)Sig#9yfef9asAy5-K>6-&ivl&z@Tr$lym!Co(a<uW~PdXf(Z%Q
zE`rtJ5#|C+6%)A{T`q5KaB*PJKg8s5m3NMu+?=QDcRp9z7}T))PqFm`9e!N}-3Fh#
z2OfX?_(kWE@&Vg_JKsKxSJQ1`>M*qZaP`g+#RJ}rOfesLI9Waf&10C%%{N!zfOjTS
zOpP)pQ-!8agLj^aBZIyx=L7$G9+nS5lNhGkJMu8@5m7nNRqpQ0pnsHOLy?pq%ZH#Y
zhSkdj9U1gfISN26*M{jzEE!+^NpL(^%ECA+l&_H??hE&Y5+O^L4~ya&j)CfQ@uy5C
zpi=k4qUeSR+u5BM^jEQRtdeGD+@m3;@Ilat<ALjXhRF>N?=vy($q-clwRR752QfzN
zv6f=0xTxunaW#RP<-?-DhBEyL4GeK2T;Oit1J}6>4?(4B+!oFYpf1vZZX?E9prXDa
zP}N~KD0%76V#$~Za++&D!&*?)vS)?hf?7}oA+F0*0&0PMSmfN`2R0;x<AUyALxBU`
zOpHly{;{xpn6#e(TpjI6(RcU`Hf<)iK<1C_4h;I0+ybf~wch8LT<-kk<anT(%$NkK
zLqG`$+*gPz5><Eys<GmXL>0jGlei*d+1uR*V^@3LJ@8|<JtO0u6C4Jc=Gqs;w_R&H
z{hG}Ulr26eRd8%zZJHIr(>WLH?uZ7qQs(2Fpw8n5CG`XI*2?bLlohdP(?S+dGCClq
zY8P#|4ASgtEGZ3AXb?Z>d|<==_FauP6*UfY9Amh`dxqDMF-^r`G9>vJF}=CfcP~y$
ze8#rC2Pc2XJSt`W`Fz{*CA%8GZHh15V}IYH;e8O38-xC&b_UHq(}fforZchbc;F_)
z@*!vrgZMp<CWbgK;RlbTJp~SUCo;tpfs>C{gLghC`KWRlNXC~v;$hq~Mft$0Oc#Lz
z-iAzTK$Xg#DM|-kfdwR)OlG>VFzyjiJn$48@>~K79;y^^JaFC5;Hy5-nL+;*t3{4g
zrwmg?pq|44u*`ObUQlJUCqqo(4LH4QWM~BS<MgXoGe9k{2d=9b9)bnDSUDg`EvO+3
zoLWq{F1%wE5;)N9#OMS`0>TQQ-qnF_Ge&S1qvE2f!)kE+u3~usPROnk87?=2dy{cr
zI0}sHo`qQ}G>DrrZ2@PEMJ^3`V0V{r2t0n<C~%;gjS)PUP!Xu$a2;&WPwoqr;Pmm1
z$pxIsChcSpyf4ekxF<!|VGdY{CAR>m)q24D7}F8Zu*8Q+YZ<^zR!|Z2=aixVsNhIU
zeVp;#{z;gPLW8&@W6Vv9bWn3cclqCS3``Y*HY_(@G4yh|`ApiQA<tAHD7L`y<ct?!
zr?Id~1m&;SlbX6FPlg4QaN_FI?Ver!5pVt`sqrwlmm2qkWrJ%|fSI245tbLb<=k)X
zxHCa0;epkjn~@Gu3Jv0lj4>}Ox&v<RxcTLY&i^B};+<2O?mV7<oAF=lBqimB-2ykt
zH4o_BZQP%?B*Dne=CpmmdDo<+4COzcmnj^5I$`sPRtLvDpq~AQphXP-yg3C9cvmvT
zlz@|qUjsKdxh&-@D10iw@nESAqu%a`pfsU+V5#{eg@)-(ED?si9849O?hT=!9>eq`
zmWW7mKBfvymj*VlfDy|KlNq3NG)2K-v*#0m1Kx~GCUac)827voPbj_mfQ#dS>u!d#
z-~@GwHDeMuJ8flf1gDZ&tQ??zVMU;h!)0)EWU+G8wFod(T-0&^HQ^h?=Q3@nY-C~i
zun3Wk1VG*Y2d?uOdN1AIXLx5-BSYL3&I>w!ZL>5EynQZj-fv$&`})0E>+jb6+hutE
z&V&BF4h`B1U!IH)W}Ig-ExqDx;r4HL=31ZMaqMya$LDqm2SP7c{52JM&}L}<Zchr&
z_b*?kzrRy=>{Y@U?ecqD>dOoT9&lyM`!|QdcDHo?Ik{Qv`QOj1wXb=(tMb!X>+-lo
zd+Y38)n9n~XWQ=Qd%iBIyjNHB_}trD-1-6zb0%chcQe^+;7;Cmwr*#h^>wGcK6`S`
z%q|Q6zaV<EZnB+2-i7BP>~ZVtzA`f|;oSA@czeU&c{jH+*=&iQx8Jwfwp5Szjr@bd
z|DyfcQW?*9U#Xfm%|FhJ!GR%>N&jy+lg!sM*2b@XN55l!Woo_Ue#N;o+jF(+FMNEk
z^EG#SgZay5^OgVSSN@c2Incwg_ggq;!R0-^@zYr!%&n9A!)bLR*ks0MuG;h3-vS)d
zIcy9n8W|?B#Q!d4$_Zppn8vyzaozoG)fHEJ*Y7EPzV`W>Q>VW?Wt;o+@~q0w&Cd$6
zV%r&J3e-H`F7)8U+gIDqaRkUdf6lby+hY@k3p4HA89v9z@)k(VV0~C#x7zz)F{4}*
z;|q{0Z|twR8?)Z;e+T~!@A_{H3GNNn>nE`J-@5yct(W<kWen$;MzP)d<?nERn6#T=
z?Ylo!jSO){;tTH1jn@}A;C+qB=lDc$Av|d_L++*fM;#dSe{u<cD-7>#OyEI;50h3i
z2wu9s|F4ga-Pg&WwhTwgZ0{qctED9r|NiCt9wTG-vs3>0ymSQzfyI^i=Bq&BwQsNQ
zc>d@^@cagbxe`3?>o(60;pv<R8t0w=tJB}1VO<E5$qGpk#lN+0&38P1<gnYG<%N&x
zfmf>%e=fD({oA?W+y;icGs_`^cE|6w|F{2pb4JakS9Kg0rY=)<NdNbK`=U>m@B9~7
zpxkTh5U$`LaEQsolKTY*3x`t#L*uT-og4+_m!>BF>z$;ea^OH1=aiMwGrAeR?~t}W
zus<;9h#P}p0S5;Y(;5b*jK}pmpDQskPBHu`{%)s-14F0}zuHV0Cc9tX|M;Jpvx#Mc
z`J_(*58QvoPqB67e2}M-s(9di=zj%P5fui1<x>s~{r{%_W?#8LhEeVD%ILVg3{_?I
zi$oaxmJ7yiWr(^YAKbyfeYxWZ>yM|Zb&dZeqcofw4!35yTw<!3RlhFCOCSL>l*_S*
zf$<rrh;v*a{@{*E5r;ra8RI$7_@1MNc!D9QH^*_6sX|_{g~2gH?12xcJ1$Vgy5ohQ
z6Nf-c6r)~EivSbL!cYePU&$@3KjzgxnZH_OE>p}mCeBDkyTAAUByU|5#8Ce$*@g8-
z?Z1Upff@(8#638;7S#UO{zCXc#ZhjRCoDfi|8=gqsCM8>!c}gSB`g|=-_@sZ78u3-
zJhEg0!~CoB{z=3##mxFQBZR4@ZF{`LES3n+(4s(#5@Q&sk-)Oht>G%z4;g|B9KkO1
zVgVOW0xevOvmi<w8`{81p6EL~26aIdHi<uYa=J0!yP3i9i5{qs3gY}=zUS|u6VVL|
zz8qg7_`vx8soDCyYgjqF>wSb6>n5AW$w_h>*jhXZ6X0agDEqGdNpwN((+NMA{#fPj
z^w=btP$V$x-;5Vbe+=_?_!x<TM$whHKdffu|37WDaKiHY@AHd)>#V&bpK*99=Z3r6
zO<DG^ZSkpJz#FdW5NdxY+GttsFXr4GT8yhE8CK7mq`3C7e8%BW&VZ}jw^zS9p>sj;
zZ=+evT!wGj;zCgmBo6P_+1bnBFyoIAgTT{OEIXd)FnAP&GM#C=^1b@6Y#ej=(W#sc
zY+oiatedx5m?4D`|77L0C<bf&joQzbo4jypWY}GM+Eut?cfm}C+r0Uq4h>I2g4us<
zD({;s&HTGLoPlvtFsH$5{=2gTnwKf_v3T%tKTw<a_TmAX6?SiSpJe&Q{F~jH`L<N=
zi|)B8Ta35pzM3_cvG)0kFYhm2`nNUf;j_hOwjY@NK+}u)`(2m4OE2eM;r*S{{Vg)L
zie<z9<*~&c|38=Kx?kkj``T(|SXs_=o?QQ32WRhE_Dk*i&zJW%TYoDsiH~4>r5keJ
zs-Ja<@70Z8r-{{lJ7nMVrh%a|QXnDV?U(AW9I?7DSKpp_w|rM++tnE3?>qmVPX8~b
z|EBzE^ooDyUh25sd;eN@ZeH>|iCfJ=e2gbovfkJ{H)&zpTb4ypLH-r2GwSPpeXltF
zto85VD(<V>^}annu<f<()!P=iH}-QePCCqVqqg$i`-4np{?Gd>yxns9hWd#7g}<&X
z{U>wAzLaUs-<zS#Oe*cH8}=S_{+_v5?m(>lT+xJoAomxrUpn+Jac}FZ=;^F8>a(K1
znoX1DXgs-+rQkYa*_;1w1)u6qzoo&l>#5oMGu})WszmwTsy(Ye|1b2FVcZV;HQNJf
zwYfK>-<IKht$WqJ`k{QIzzn(SW8ri66y7#l5r4=1Gygfx1ItUMGH~BN_Pl=i@<#62
zOY}br9;nSax_W!buinzbak_IH8)P2V^*ij*eagua!N?N8$&%r<kf~uA&RJ}%6Wme8
bv;W%vKKi=K{hOo|Xe!^+)z4*}Q$iB}E~7xZ


From 8a7f416871842c055a9810f810f94e321e18604f Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 17 Mar 2017 15:33:09 -0700
Subject: [PATCH 007/255] fixed typo in server type

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index f1d8eda1b..7caee5fd3 100644
--- a/README.md
+++ b/README.md
@@ -12,7 +12,7 @@ you can consult a list of known ports on [Zstandard homepage](http://www.zstd.ne
 |dev         | [![Build Status](https://travis-ci.org/facebook/zstd.svg?branch=dev)](https://travis-ci.org/facebook/zstd) |
 
 As a reference, several fast compression algorithms were tested and compared
-on a server running Linux Mint Debian Edition (`Linux version 4.8.0-1-amd64`),
+on a server running Linux Debian (`Linux version 4.8.0-1-amd64`),
 with a Core i7-6700K CPU @ 4.0GHz,
 using [lzbench], an open-source in-memory benchmark by @inikep
 compiled with GCC 6.3.0,
@@ -39,7 +39,7 @@ Zstd can also offer stronger compression ratios at the cost of compression speed
 Speed vs Compression trade-off is configurable by small increments. Decompression speed is preserved and remains roughly the same at all settings, a property shared by most LZ compression algorithms, such as [zlib] or lzma.
 
 The following tests were run
-on a server running Linux Mint Debian Edition (`Linux version 4.8.0-1-amd64`)
+on a server running Linux Debian (`Linux version 4.8.0-1-amd64`)
 with a Core i7-6700K CPU @ 4.0GHz,
 using [lzbench], an open-source in-memory benchmark by @inikep
 compiled with GCC 6.3.0,

From 8086d623ca8c2d4fe4bd63e853e088d0ff7ccfa1 Mon Sep 17 00:00:00 2001
From: Przemyslaw Skibinski <inikep@gmail.com>
Date: Sat, 18 Mar 2017 11:19:09 +0100
Subject: [PATCH 008/255] updated build of Windows packages

---
 lib/dll/example/README.md         | 10 +++++-----
 lib/dll/example/build_package.bat |  1 +
 2 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/lib/dll/example/README.md b/lib/dll/example/README.md
index 957a29f35..e231f59c5 100644
--- a/lib/dll/example/README.md
+++ b/lib/dll/example/README.md
@@ -4,11 +4,11 @@ ZSTD Windows binary package
 #### The package contents
 
 - `zstd.exe`                  : Command Line Utility, supporting gzip-like arguments
-- `dll\libzstd.dll`           : The DLL of ZSTD library
-- `dll\libzstd.lib`           : The import library of ZSTD library for Visual C++
-- `example\`                  : The example of usage of ZSTD library
-- `include\`                  : Header files required with ZSTD library
-- `static\libzstd_static.lib` : The static ZSTD library
+- `dll\libzstd.dll`           : The ZSTD dynamic library (DLL)
+- `dll\libzstd.lib`           : The import library of the ZSTD dynamic library (DLL) for Visual C++
+- `example\`                  : The example of usage of the ZSTD library
+- `include\`                  : Header files required by the ZSTD library
+- `static\libzstd_static.lib` : The static ZSTD library (LIB)
 
 
 #### Usage of Command Line Interface
diff --git a/lib/dll/example/build_package.bat b/lib/dll/example/build_package.bat
index b225af8d8..cae0a15cb 100644
--- a/lib/dll/example/build_package.bat
+++ b/lib/dll/example/build_package.bat
@@ -9,6 +9,7 @@ COPY lib\common\mem.h bin\example\
 COPY lib\common\zstd_errors.h bin\example\
 COPY lib\common\zstd_internal.h bin\example\
 COPY lib\common\error_private.h bin\example\
+COPY lib\common\xxhash.h bin\example\
 COPY lib\zstd.h bin\include\
 COPY lib\libzstd.a bin\static\libzstd_static.lib
 COPY lib\dll\libzstd.* bin\dll\

From 7ebf2de02d5b919c68e5e8b68fc98ab6e13c2996 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 20 Mar 2017 11:25:00 -0700
Subject: [PATCH 009/255] Add ability to strongly limit fuzzer test size with
 flag

---
 tests/fuzzer.c      | 21 +++++++++++++++++----
 tests/zstreamtest.c | 22 ++++++++++++++++------
 2 files changed, 33 insertions(+), 10 deletions(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index def7542b5..1d8be17af 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -616,7 +616,7 @@ static size_t FUZ_randomLength(U32* seed, U32 maxLog)
 #define CHECK(cond, ...) if (cond) { DISPLAY("Error => "); DISPLAY(__VA_ARGS__); \
                          DISPLAY(" (seed %u, test nb %u)  \n", seed, testNb); goto _output_error; }
 
-static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxDurationS, double compressibility)
+static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxDurationS, double compressibility, int bigTests)
 {
     static const U32 maxSrcLog = 23;
     static const U32 maxSampleLog = 22;
@@ -636,6 +636,7 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
     U32 coreSeed = seed, lseed = 0;
     clock_t const startClock = clock();
     clock_t const maxClockSpan = maxDurationS * CLOCKS_PER_SEC;
+    int const cLevelLimiter = bigTests ? 3 : 2;
 
     /* allocation */
     cNoiseBuffer[0] = (BYTE*)malloc (srcBufferSize);
@@ -701,7 +702,12 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
         crcOrig = XXH64(sampleBuffer, sampleSize, 0);
 
         /* compression tests */
-        {   unsigned const cLevel = (FUZ_rand(&lseed) % (ZSTD_maxCLevel() - (FUZ_highbit32((U32)sampleSize)/3))) + 1;
+        {
+            unsigned const cLevel =
+                    (FUZ_rand(&lseed) %
+                     (ZSTD_maxCLevel() -
+                      (FUZ_highbit32((U32)sampleSize) / cLevelLimiter))) +
+                    1;
             cSize = ZSTD_compressCCtx(ctx, cBuffer, cBufferSize, sampleBuffer, sampleSize, cLevel);
             CHECK(ZSTD_isError(cSize), "ZSTD_compressCCtx failed : %s", ZSTD_getErrorName(cSize));
 
@@ -801,7 +807,10 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
 
         {   U32 const testLog = FUZ_rand(&lseed) % maxSrcLog;
             U32 const dictLog = FUZ_rand(&lseed) % maxSrcLog;
-            int const cLevel = (FUZ_rand(&lseed) % (ZSTD_maxCLevel() - (MAX(testLog, dictLog)/3))) + 1;
+            int const cLevel = (FUZ_rand(&lseed) %
+                                (ZSTD_maxCLevel() -
+                                 (MAX(testLog, dictLog) / cLevelLimiter))) +
+                               1;
             maxTestSize = FUZ_rLogLength(&lseed, testLog);
             if (maxTestSize >= dstBufferSize) maxTestSize = dstBufferSize-1;
 
@@ -927,6 +936,7 @@ int main(int argc, const char** argv)
     int result=0;
     U32 mainPause = 0;
     U32 maxDuration = 0;
+    int bigTests = 1;
     const char* programName = argv[0];
 
     /* Check command line */
@@ -936,6 +946,9 @@ int main(int argc, const char** argv)
 
         /* Handle commands. Aggregated commands are allowed */
         if (argument[0]=='-') {
+
+            if (!strcmp(argument, "--no-big-tests")) { bigTests=0; continue; }
+
             argument++;
             while (*argument!=0) {
                 switch(*argument)
@@ -1030,7 +1043,7 @@ int main(int argc, const char** argv)
     if (testNb==0)
         result = basicUnitTests(0, ((double)proba) / 100);  /* constant seed for predictability */
     if (!result)
-        result = fuzzerTests(seed, nbTests, testNb, maxDuration, ((double)proba) / 100);
+        result = fuzzerTests(seed, nbTests, testNb, maxDuration, ((double)proba) / 100, bigTests);
     if (mainPause) {
         int unused;
         DISPLAY("Press Enter \n");
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index aa7367bcf..a03ee9b1f 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -552,7 +552,7 @@ static size_t FUZ_randomLength(U32* seed, U32 maxLog)
 #define CHECK(cond, ...) if (cond) { DISPLAY("Error => "); DISPLAY(__VA_ARGS__); \
                          DISPLAY(" (seed %u, test nb %u)  \n", seed, testNb); goto _output_error; }
 
-static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compressibility)
+static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compressibility, int bigTests)
 {
     static const U32 maxSrcLog = 24;
     static const U32 maxSampleLog = 19;
@@ -574,6 +574,7 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compres
     const BYTE* dict=NULL;   /* can keep same dict on 2 consecutive tests */
     size_t dictSize = 0;
     U32 oldTestLog = 0;
+    int const cLevelLimiter = bigTests ? 3 : 2;
 
     /* allocations */
     cNoiseBuffer[0] = (BYTE*)malloc (srcBufferSize);
@@ -646,7 +647,10 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compres
         } else {
             U32 const testLog = FUZ_rand(&lseed) % maxSrcLog;
             U32 const dictLog = FUZ_rand(&lseed) % maxSrcLog;
-            U32 const cLevel = (FUZ_rand(&lseed) % (ZSTD_maxCLevel() - (MAX(testLog, dictLog)/3))) + 1;
+            U32 const cLevel = (FUZ_rand(&lseed) %
+                                (ZSTD_maxCLevel() -
+                                 (MAX(testLog, dictLog) / cLevelLimiter))) +
+                               1;
             maxTestSize = FUZ_rLogLength(&lseed, testLog);
             oldTestLog = testLog;
             /* random dictionary selection */
@@ -785,7 +789,7 @@ _output_error:
 
 
 /* Multi-threading version of fuzzer Tests */
-static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double compressibility)
+static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double compressibility, int bigTests)
 {
     static const U32 maxSrcLog = 24;
     static const U32 maxSampleLog = 19;
@@ -807,6 +811,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
     const BYTE* dict=NULL;   /* can keep same dict on 2 consecutive tests */
     size_t dictSize = 0;
     U32 oldTestLog = 0;
+    int const cLevelLimiter = bigTests ? 3 : 2;
 
     /* allocations */
     cNoiseBuffer[0] = (BYTE*)malloc (srcBufferSize);
@@ -888,7 +893,10 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
         } else {
             U32 const testLog = FUZ_rand(&lseed) % maxSrcLog;
             U32 const dictLog = FUZ_rand(&lseed) % maxSrcLog;
-            U32 const cLevel = (FUZ_rand(&lseed) % (ZSTD_maxCLevel() - (MAX(testLog, dictLog)/3))) + 1;
+            U32 const cLevel = (FUZ_rand(&lseed) %
+                                (ZSTD_maxCLevel() -
+                                 (MAX(testLog, dictLog) / cLevelLimiter))) +
+                               1;
             maxTestSize = FUZ_rLogLength(&lseed, testLog);
             oldTestLog = testLog;
             /* random dictionary selection */
@@ -1063,6 +1071,7 @@ int main(int argc, const char** argv)
     int result=0;
     int mainPause = 0;
     int mtOnly = 0;
+    int bigTests = 1;
     const char* const programName = argv[0];
     ZSTD_customMem const customMem = { allocFunction, freeFunction, NULL };
     ZSTD_customMem const customNULL = { NULL, NULL, NULL };
@@ -1076,6 +1085,7 @@ int main(int argc, const char** argv)
         if (argument[0]=='-') {
 
             if (!strcmp(argument, "--mt")) { mtOnly=1; continue; }
+            if (!strcmp(argument, "--no-big-tests")) { bigTests=0; continue; }
 
             argument++;
             while (*argument!=0) {
@@ -1181,8 +1191,8 @@ int main(int argc, const char** argv)
             result = basicUnitTests(0, ((double)proba) / 100, customMem);  /* use custom memory allocation functions */
     }   }
 
-    if (!result && !mtOnly) result = fuzzerTests(seed, nbTests, testNb, ((double)proba) / 100);
-    if (!result) result = fuzzerTests_MT(seed, nbTests, testNb, ((double)proba) / 100);
+    if (!result && !mtOnly) result = fuzzerTests(seed, nbTests, testNb, ((double)proba) / 100, bigTests);
+    if (!result) result = fuzzerTests_MT(seed, nbTests, testNb, ((double)proba) / 100, bigTests);
 
     if (mainPause) {
         int unused;

From 0b0b10ec83ee7b9739f8f1954746f1e46fab2683 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 20 Mar 2017 11:32:24 -0700
Subject: [PATCH 010/255] Add --no-big-tests flag for qemu fuzz-tests

---
 Makefile       | 16 ++++++++--------
 tests/Makefile |  8 ++++----
 2 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/Makefile b/Makefile
index 49f29d782..631b884ad 100644
--- a/Makefile
+++ b/Makefile
@@ -152,16 +152,16 @@ ppc64build: clean
 	CC=powerpc-linux-gnu-gcc CFLAGS="-m64 -Werror" $(MAKE) allarch
 
 armfuzz: clean
-	CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static MOREFLAGS="-static" $(MAKE) -C $(TESTDIR) fuzztest
+	CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest
 
 aarch64fuzz: clean
-	CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static MOREFLAGS="-static" $(MAKE) -C $(TESTDIR) fuzztest
+	CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest
 
 ppcfuzz: clean
-	CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static MOREFLAGS="-static" $(MAKE) -C $(TESTDIR) fuzztest
+	CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest
 
 ppc64fuzz: clean
-	CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static MOREFLAGS="-m64 -static" $(MAKE) -C $(TESTDIR) fuzztest
+	CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static MOREFLAGS="-m64 -static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest
 
 gpptest: clean
 	CC=g++ $(MAKE) -C $(PRGDIR) all CFLAGS="-O3 -Wall -Wextra -Wundef -Wshadow -Wcast-align -Werror"
@@ -180,19 +180,19 @@ clangtest: clean
 
 armtest: clean
 	$(MAKE) -C $(TESTDIR) datagen   # use native, faster
-	$(MAKE) -C $(TESTDIR) test CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static ZSTDRTTEST= MOREFLAGS="-Werror -static"
+	$(MAKE) -C $(TESTDIR) test CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static ZSTDRTTEST= MOREFLAGS="-Werror -static" FUZZER_FLAGS=--no-big-tests
 
 aarch64test:
 	$(MAKE) -C $(TESTDIR) datagen   # use native, faster
-	$(MAKE) -C $(TESTDIR) test CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static ZSTDRTTEST= MOREFLAGS="-Werror -static"
+	$(MAKE) -C $(TESTDIR) test CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static ZSTDRTTEST= MOREFLAGS="-Werror -static" FUZZER_FLAGS=--no-big-tests
 
 ppctest: clean
 	$(MAKE) -C $(TESTDIR) datagen   # use native, faster
-	$(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static ZSTDRTTEST= MOREFLAGS="-Werror -Wno-attributes -static"
+	$(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static ZSTDRTTEST= MOREFLAGS="-Werror -Wno-attributes -static" FUZZER_FLAGS=--no-big-tests
 
 ppc64test: clean
 	$(MAKE) -C $(TESTDIR) datagen   # use native, faster
-	$(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static ZSTDRTTEST= MOREFLAGS="-m64 -static"
+	$(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static ZSTDRTTEST= MOREFLAGS="-m64 -static" FUZZER_FLAGS=--no-big-tests
 
 arm-ppc-compilation:
 	$(MAKE) -C $(PRGDIR) clean zstd CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static ZSTDRTTEST= MOREFLAGS="-Werror -static"
diff --git a/tests/Makefile b/tests/Makefile
index 9382fe80d..8a12a7324 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -300,10 +300,10 @@ test-fullbench32: fullbench32 datagen
 	$(QEMU_SYS) ./fullbench32 -i1 -P0
 
 test-fuzzer: fuzzer
-	$(QEMU_SYS) ./fuzzer $(FUZZERTEST)
+	$(QEMU_SYS) ./fuzzer $(FUZZERTEST) $(FUZZER_FLAGS)
 
 test-fuzzer32: fuzzer32
-	$(QEMU_SYS) ./fuzzer32 $(FUZZERTEST)
+	$(QEMU_SYS) ./fuzzer32 $(FUZZERTEST) $(FUZZER_FLAGS)
 
 test-zbuff: zbufftest
 	$(QEMU_SYS) ./zbufftest $(ZSTREAM_TESTTIME)
@@ -312,10 +312,10 @@ test-zbuff32: zbufftest32
 	$(QEMU_SYS) ./zbufftest32 $(ZSTREAM_TESTTIME)
 
 test-zstream: zstreamtest
-	$(QEMU_SYS) ./zstreamtest $(ZSTREAM_TESTTIME)
+	$(QEMU_SYS) ./zstreamtest $(ZSTREAM_TESTTIME) $(FUZZER_FLAGS)
 
 test-zstream32: zstreamtest32
-	$(QEMU_SYS) ./zstreamtest32 $(ZSTREAM_TESTTIME)
+	$(QEMU_SYS) ./zstreamtest32 $(ZSTREAM_TESTTIME) $(FUZZER_FLAGS)
 
 test-longmatch: longmatch
 	$(QEMU_SYS) ./longmatch

From 2f6c7e6a53501a5285e13d67721ae738140a175a Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 20 Mar 2017 12:38:19 -0700
Subject: [PATCH 011/255] Fix windows compiler warnings for decodecorpus

---
 tests/decodecorpus.c | 26 +++++++++++++-------------
 1 file changed, 13 insertions(+), 13 deletions(-)

diff --git a/tests/decodecorpus.c b/tests/decodecorpus.c
index 183d20f74..4acd055af 100644
--- a/tests/decodecorpus.c
+++ b/tests/decodecorpus.c
@@ -325,7 +325,7 @@ static void writeFrameHeader(U32* seed, frame_t* frame)
         }
     }
 
-    DISPLAYLEVEL(2, " frame content size:\t%zu\n", fh.contentSize);
+    DISPLAYLEVEL(2, " frame content size:\t%u\n", (U32)fh.contentSize);
     DISPLAYLEVEL(2, " frame window size:\t%u\n", fh.windowSize);
     DISPLAYLEVEL(2, " content size flag:\t%d\n", contentSizeFlag);
     DISPLAYLEVEL(2, " single segment flag:\t%d\n", singleSegment);
@@ -542,8 +542,8 @@ static size_t writeLiteralsBlockCompressed(U32* seed, frame_t* frame, size_t con
         op += compressedSize;
 
         compressedSize += hufHeaderSize;
-        DISPLAYLEVEL(5, "    regenerated size: %zu\n", litSize);
-        DISPLAYLEVEL(5, "    compressed size: %zu\n", compressedSize);
+        DISPLAYLEVEL(5, "    regenerated size: %u\n", (U32)litSize);
+        DISPLAYLEVEL(5, "    compressed size: %u\n", (U32)compressedSize);
         if (compressedSize >= litSize) {
             DISPLAYLEVEL(5, "     trying again\n");
             /* if we have to try again, reset the stats so we don't accidentally
@@ -611,7 +611,7 @@ static U32 generateSequences(U32* seed, frame_t* frame, seqStore_t* seqStore,
     size_t const remainingMatch = contentSize - literalsSize;
     size_t excessMatch = 0;
     U32 numSequences = 0;
-  
+
     U32 i;
 
 
@@ -628,7 +628,7 @@ static U32 generateSequences(U32* seed, frame_t* frame, seqStore_t* seqStore,
         excessMatch = remainingMatch - numSequences * MIN_SEQ_LEN;
     }
 
-    DISPLAYLEVEL(5, "    total match lengths: %zu\n", remainingMatch);
+    DISPLAYLEVEL(5, "    total match lengths: %u\n", (U32)remainingMatch);
 
     for (i = 0; i < numSequences; i++) {
         /* Generate match and literal lengths by exponential distribution to
@@ -694,8 +694,8 @@ static U32 generateSequences(U32* seed, frame_t* frame, seqStore_t* seqStore,
         }
 
         DISPLAYLEVEL(6, "      LL: %5u OF: %5u ML: %5u", literalLen, offset, matchLen);
-        DISPLAYLEVEL(7, " srcPos: %8tu seqNb: %3u",
-                     (BYTE*)srcPtr - (BYTE*)frame->srcStart, i);
+        DISPLAYLEVEL(7, " srcPos: %8u seqNb: %3u",
+                     (U32)((BYTE*)srcPtr - (BYTE*)frame->srcStart), i);
         DISPLAYLEVEL(6, "\n");
         if (offsetCode < 3) {
             DISPLAYLEVEL(7, "        repeat offset: %d\n", repIndex);
@@ -711,8 +711,8 @@ static U32 generateSequences(U32* seed, frame_t* frame, seqStore_t* seqStore,
 
     memcpy(srcPtr, literals, literalsSize);
     srcPtr += literalsSize;
-    DISPLAYLEVEL(6, "      excess literals: %5zu", literalsSize);
-    DISPLAYLEVEL(7, " srcPos: %8tu", (BYTE*)srcPtr - (BYTE*)frame->srcStart);
+    DISPLAYLEVEL(6, "      excess literals: %5u", (U32)literalsSize);
+    DISPLAYLEVEL(7, " srcPos: %8u", (U32)((BYTE*)srcPtr - (BYTE*)frame->srcStart));
     DISPLAYLEVEL(6, "\n");
 
     return numSequences;
@@ -957,11 +957,11 @@ static size_t writeCompressedBlock(U32* seed, frame_t* frame, size_t contentSize
 
     literalsSize = writeLiteralsBlock(seed, frame, contentSize);
 
-    DISPLAYLEVEL(4, "   literals size: %zu\n", literalsSize);
+    DISPLAYLEVEL(4, "   literals size: %u\n", (U32)literalsSize);
 
     nbSeq = writeSequencesBlock(seed, frame, contentSize, literalsSize);
 
-    DISPLAYLEVEL(4, "   number of sequences: %zu\n", nbSeq);
+    DISPLAYLEVEL(4, "   number of sequences: %u\n", (U32)nbSeq);
 
     return (BYTE*)frame->data - blockStart;
 }
@@ -977,7 +977,7 @@ static void writeBlock(U32* seed, frame_t* frame, size_t contentSize,
     BYTE *op = header + 3;
 
     DISPLAYLEVEL(3, " block:\n");
-    DISPLAYLEVEL(3, "  block content size: %zu\n", contentSize);
+    DISPLAYLEVEL(3, "  block content size: %u\n", (U32)contentSize);
     DISPLAYLEVEL(3, "  last block: %s\n", lastBlock ? "yes" : "no");
 
     if (blockTypeDesc == 0) {
@@ -1025,7 +1025,7 @@ static void writeBlock(U32* seed, frame_t* frame, size_t contentSize,
     frame->src = (BYTE*)frame->src + contentSize;
 
     DISPLAYLEVEL(3, "  block type: %s\n", BLOCK_TYPES[blockType]);
-    DISPLAYLEVEL(3, "  block size field: %zu\n", blockSize);
+    DISPLAYLEVEL(3, "  block size field: %u\n", (U32)blockSize);
 
     header[0] = (lastBlock | (blockType << 1) | (blockSize << 3)) & 0xff;
     MEM_writeLE16(header + 1, blockSize >> 5);

From c771977489d9971ab2b2811778ad819771159043 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 20 Mar 2017 16:02:24 -0700
Subject: [PATCH 012/255] Fix decodecorpus clang compile errors

---
 tests/decodecorpus.c | 34 +++++++++++++++++-----------------
 1 file changed, 17 insertions(+), 17 deletions(-)

diff --git a/tests/decodecorpus.c b/tests/decodecorpus.c
index 4acd055af..f7b3c854f 100644
--- a/tests/decodecorpus.c
+++ b/tests/decodecorpus.c
@@ -98,7 +98,7 @@ static void RAND_bufferMaxSymb(U32* seed, void* ptr, size_t size, int maxSymb)
     BYTE* op = ptr;
 
     for (i = 0; i < size; i++) {
-        op[i] = RAND(seed) % (maxSymb + 1);
+        op[i] = (BYTE) (RAND(seed) % (maxSymb + 1));
     }
 }
 
@@ -134,8 +134,8 @@ static void RAND_genDist(U32* seed, BYTE* dist, double weight)
 {
     size_t i = 0;
     size_t statesLeft = DISTSIZE;
-    BYTE symb = RAND(seed) % 256;
-    BYTE step = (RAND(seed) % 256) | 1; /* force it to be odd so it's relatively prime to 256 */
+    BYTE symb = (BYTE) (RAND(seed) % 256);
+    BYTE step = (BYTE) ((RAND(seed) % 256) | 1); /* force it to be odd so it's relatively prime to 256 */
 
     while (i < DISTSIZE) {
         size_t states = ((size_t)(weight * statesLeft)) + 1;
@@ -259,7 +259,7 @@ static void writeFrameHeader(U32* seed, frame_t* frame)
         /* Follow window algorithm from specification */
         int const exponent = RAND(seed) % (MAX_WINDOW_LOG - 10);
         int const mantissa = RAND(seed) % 8;
-        windowByte = (exponent << 3) | mantissa;
+        windowByte = (BYTE) ((exponent << 3) | mantissa);
         fh.windowSize = (1U << (exponent + 10));
         fh.windowSize += fh.windowSize / 8 * mantissa;
     }
@@ -284,7 +284,7 @@ static void writeFrameHeader(U32* seed, frame_t* frame)
 
         if (contentSizeFlag && (fh.contentSize == 0 || !(RAND(seed) & 7))) {
             /* do single segment sometimes */
-            fh.windowSize = fh.contentSize;
+            fh.windowSize = (U32) fh.contentSize;
             singleSegment = 1;
         }
     }
@@ -307,7 +307,7 @@ static void writeFrameHeader(U32* seed, frame_t* frame)
 
     {
         BYTE const frameHeaderDescriptor =
-                (fcsCode << 6) | (singleSegment << 5) | (1 << 2);
+                (BYTE) ((fcsCode << 6) | (singleSegment << 5) | (1 << 2));
         op[pos++] = frameHeaderDescriptor;
     }
 
@@ -318,10 +318,10 @@ static void writeFrameHeader(U32* seed, frame_t* frame)
     if (contentSizeFlag) {
         switch (fcsCode) {
         default: /* Impossible */
-        case 0: op[pos++] = fh.contentSize; break;
-        case 1: MEM_writeLE16(op + pos, fh.contentSize - 256); pos += 2; break;
-        case 2: MEM_writeLE32(op + pos, fh.contentSize); pos += 4; break;
-        case 3: MEM_writeLE64(op + pos, fh.contentSize); pos += 8; break;
+        case 0: op[pos++] = (BYTE) fh.contentSize; break;
+        case 1: MEM_writeLE16(op + pos, (U16) (fh.contentSize - 256)); pos += 2; break;
+        case 2: MEM_writeLE32(op + pos, (U32) fh.contentSize); pos += 4; break;
+        case 3: MEM_writeLE64(op + pos, (U64) fh.contentSize); pos += 8; break;
         }
     }
 
@@ -385,7 +385,7 @@ static size_t writeLiteralsBlockSimple(U32* seed, frame_t* frame, size_t content
         op += litSize;
     } else {
         /* RLE literals */
-        BYTE const symb = RAND(seed) % 256;
+        BYTE const symb = (BYTE) (RAND(seed) % 256);
 
         DISPLAYLEVEL(4, "   rle literals: 0x%02x\n", (U32)symb);
 
@@ -647,10 +647,10 @@ static U32 generateSequences(U32* seed, frame_t* frame, seqStore_t* seqStore,
         U32 offset, offsetCode, repIndex;
 
         /* bounds checks */
-        matchLen = MIN(matchLen, excessMatch + MIN_SEQ_LEN);
-        literalLen = MIN(literalLen, literalsSize);
+        matchLen = (U32) MIN(matchLen, excessMatch + MIN_SEQ_LEN);
+        literalLen = MIN(literalLen, (U32) literalsSize);
         if (i == 0 && srcPtr == frame->srcStart && literalLen == 0) literalLen = 1;
-        if (i + 1 == numSequences) matchLen = MIN_SEQ_LEN + excessMatch;
+        if (i + 1 == numSequences) matchLen = MIN_SEQ_LEN + (U32) excessMatch;
 
         memcpy(srcPtr, literals, literalLen);
         srcPtr += literalLen;
@@ -1027,8 +1027,8 @@ static void writeBlock(U32* seed, frame_t* frame, size_t contentSize,
     DISPLAYLEVEL(3, "  block type: %s\n", BLOCK_TYPES[blockType]);
     DISPLAYLEVEL(3, "  block size field: %u\n", (U32)blockSize);
 
-    header[0] = (lastBlock | (blockType << 1) | (blockSize << 3)) & 0xff;
-    MEM_writeLE16(header + 1, blockSize >> 5);
+    header[0] = (BYTE) ((lastBlock | (blockType << 1) | (blockSize << 3)) & 0xff);
+    MEM_writeLE16(header + 1, (U16) (blockSize >> 5));
 
     frame->data = op;
 }
@@ -1300,7 +1300,7 @@ static int generateCorpus(U32 seed, unsigned numFiles, const char* const path,
 *********************************************************/
 static U32 makeSeed(void)
 {
-    U32 t = time(NULL);
+    U32 t = (U32) time(NULL);
     return XXH32(&t, sizeof(t), 0) % 65536;
 }
 

From 5a2b85702931e0d37e4c633f22328b18ea434c1f Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 14 Mar 2017 15:59:57 -0700
Subject: [PATCH 013/255] Update appveyor.yml to have short and long tests

---
 appveyor.yml     | 246 +++++++++++++++++++++++++++++------------------
 appveyor_old.yml | 187 +++++++++++++++++++++++++++++++++++
 tests/Makefile   |   6 +-
 3 files changed, 342 insertions(+), 97 deletions(-)
 create mode 100644 appveyor_old.yml

diff --git a/appveyor.yml b/appveyor.yml
index 9507fec6e..26ad31002 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -1,66 +1,81 @@
-version: 1.0.{build}
-environment:
-  matrix:
-  - COMPILER: "gcc"
-    PLATFORM: "mingw64"
-    MAKE_PARAMS: '"make test && make lib && make -C tests test-symbols fullbench-dll fullbench-lib"'
-  - COMPILER: "gcc"
-    PLATFORM: "mingw32"
-    MAKE_PARAMS: '"make -C tests test-zstd test-fullbench test-fuzzer test-invalidDictionaries"'
-  - COMPILER: "gcc"
-    PLATFORM: "clang"
-    MAKE_PARAMS: '"make -C tests zstd fullbench fuzzer paramgrill datagen CC=clang MOREFLAGS="--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion""'
-  - COMPILER: "visual"
-    CONFIGURATION: "Debug"
-    PLATFORM: "x64"
-  - COMPILER: "visual"
-    CONFIGURATION: "Debug"
-    PLATFORM: "Win32"
-  - COMPILER: "visual"
-    CONFIGURATION: "Release"
-    PLATFORM: "x64"
-  - COMPILER: "visual"
-    CONFIGURATION: "Release"
-    PLATFORM: "Win32"
+-
+  version: 1.0.{build}
+  branches:
+    only:
+    - dev
+    - master
+  environment:
+    matrix:
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   "make allarch && make -C tests test-symbols fullbench-dll fullbench-lib"
+      ARTIFACT: "true"
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x86"
+      SCRIPT:   "make lib && make zstd && make -C tests allnothread"
+      ARTIFACT: "true"
+    - COMPILER: "clang"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   "MOREFLAGS='--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion' make allarch"
 
-install:
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   ""
+      TEST:     "cmake"
+
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   ""
+      TEST:     "pzstd"
+
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "x64"
+      CONFIGURATION: "Debug"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "Win32"
+      CONFIGURATION: "Debug"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "x64"
+      CONFIGURATION: "Release"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "Win32"
+      CONFIGURATION: "Release"
+
+  install:
   - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
-  - MKDIR bin
-  - if [%COMPILER%]==[gcc] SET PATH_ORIGINAL=%PATH%
-  - if [%COMPILER%]==[gcc] (
-      SET "PATH_MINGW32=c:\MinGW\bin;c:\MinGW\usr\bin" &&
-      SET "PATH_MINGW64=c:\msys64\mingw64\bin;c:\msys64\usr\bin" &&
+  - SET PATH_ORIGINAL=%PATH%
+  - if [%HOST%]==[mingw] (
+      SET "PATH_MINGW32=C:\MinGW\bin;C:\MinGW\usr\bin" &&
+      SET "PATH_MINGW64=C:\msys64\mingw64\bin;C:\msys64\usr\bin" &&
       COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
       COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
-    ) else (
-      IF [%PLATFORM%]==[x64] (SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;")
+    )
+  - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] (
+      SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;"
     )
 
-build_script:
-  - ECHO Building %COMPILER% %PLATFORM% %CONFIGURATION%
-  - if [%PLATFORM%]==[mingw32] SET PATH=%PATH_MINGW32%;%PATH_ORIGINAL%
-  - if [%PLATFORM%]==[mingw64] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
-  - if [%PLATFORM%]==[clang] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
-  - if [%COMPILER%]==[gcc] (
-      ECHO *** &&
-      ECHO *** Building %PLATFORM% &&
-      ECHO *** &&
+  build_script:
+  - if [%HOST%]==[mingw] (
+      ( if [%PLATFORM%]==[x64] (
+        SET "PATH=%PATH_MINGW64%;%PATH_ORIGINAL%"
+      ) else if [%PLATFORM%]==[x86] (
+        SET "PATH=%PATH_MINGW32%;%PATH_ORIGINAL%"
+      ) ) &&
       make -v &&
-      cc -v &&
-      ECHO %MAKE_PARAMS% &&
-      sh -c %MAKE_PARAMS%
+      sh -c "%COMPILER% -v" &&
+      sh -c "CC=%COMPILER% %SCRIPT%" &&
+      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe )
     )
-  - if [%PLATFORM%]==[clang] COPY tests\fuzzer.exe tests\fuzzer_clang.exe
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw64] (
-      COPY programs\zstd.exe bin\zstd.exe &&
-      appveyor PushArtifact bin\zstd.exe
-    )
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw32] (
-      COPY programs\zstd.exe bin\zstd32.exe &&
-      appveyor PushArtifact bin\zstd32.exe
-    )
-  - if [%COMPILER%]==[gcc] make clean
-  - if [%COMPILER%]==[visual] (
+  - if [%HOST%]==[visual] (
       ECHO *** &&
       ECHO *** Building Visual Studio 2008 %PLATFORM%\%CONFIGURATION% in %APPVEYOR_BUILD_FOLDER% &&
       ECHO *** &&
@@ -111,29 +126,24 @@ build_script:
       COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\
     )
 
-test_script:
+  test_script:
   - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION%
-  - SET FUZZERTEST=-T1mn
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[clang] (
-      tests\fuzzer_clang.exe %FUZZERTEST% &&
-      ECHO *** &&
-      ECHO *** Building cmake for %PLATFORM% &&
-      ECHO *** &&
+  - if [%TEST%]==[cmake] (
       mkdir build\cmake\build &&
       cd build\cmake\build &&
       cmake -G "Visual Studio 14 2015 Win64" .. &&
       cd ..\..\.. &&
-      make clean &&
-      ECHO *** &&
-      ECHO *** Building pzstd for %PLATFORM% &&
-      ECHO *** &&
+      make clean
+    )
+  - if [%TEST%]==[pzstd] (
       make -C contrib\pzstd googletest-mingw64 &&
       make -C contrib\pzstd pzstd.exe &&
       make -C contrib\pzstd tests &&
       make -C contrib\pzstd check &&
       make -C contrib\pzstd clean
     )
-  - if [%COMPILER%]==[visual] if [%CONFIGURATION%]==[Release] (
+  - if [%HOST%]==[visual] if [%CONFIGURATION%]==[Release] (
+      SET FUZZERTEST=-T1mn &&
       CD tests &&
       SET ZSTD=./zstd.exe &&
       sh -e playTests.sh --test-large-data &&
@@ -146,33 +156,79 @@ test_script:
       fuzzer_VS2015_%PLATFORM%_Release.exe %FUZZERTEST%
     )
 
-branches:
-  only:
-  - dev
-  - master
+-
+  version: 1.0.{build}
+  branches:
+    except:
+    - dev
+    - master
+  environment:
+    matrix:
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   "make allarch"
+    - COMPILER: "gcc"
+      HOST:     "mingw"
+      PLATFORM: "x86"
+      SCRIPT:   "make lib && make zstd && make -C tests allnothread"
+    - COMPILER: "clang"
+      HOST:     "mingw"
+      PLATFORM: "x64"
+      SCRIPT:   "MOREFLAGS='--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion' make allarch"
 
-artifacts:
-  - path: bin\zstd.exe
-  - path: bin\zstd32.exe
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "x64"
+      CONFIGURATION: "Debug"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "Win32"
+      CONFIGURATION: "Debug"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "x64"
+      CONFIGURATION: "Release"
+    - COMPILER: "visual"
+      HOST:     "visual"
+      PLATFORM: "Win32"
+      CONFIGURATION: "Release"
 
-deploy:
-- provider: GitHub
-  auth_token:
-    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
-  artifact: bin\zstd.exe
-  force_update: true
-  on:
-    branch: autobuild
-    COMPILER: gcc
-    PLATFORM: "mingw64"
-    appveyor_repo_tag: true
-- provider: GitHub
-  auth_token:
-    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
-  artifact: bin\zstd32.exe
-  force_update: true
-  on:
-    branch: autobuild
-    COMPILER: gcc
-    PLATFORM: "mingw32"
-    appveyor_repo_tag: true
+  install:
+  - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
+  - SET PATH_ORIGINAL=%PATH%
+  - if [%HOST%]==[mingw] (
+      SET "PATH_MINGW32=C:\MinGW\bin;C:\MinGW\usr\bin" &&
+      SET "PATH_MINGW64=C:\msys64\mingw64\bin;C:\msys64\usr\bin" &&
+      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
+      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
+    )
+  - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] (
+      SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;"
+    )
+
+  build_script:
+  - ECHO Building %COMPILER% %PLATFORM% %CONFIGURATION%
+  - if [%HOST%]==[mingw] (
+      ( if [%PLATFORM%]==[x64] (
+        SET "PATH=%PATH_MINGW64%;%PATH_ORIGINAL%"
+      ) else if [%PLATFORM%]==[x86] (
+        SET "PATH=%PATH_MINGW32%;%PATH_ORIGINAL%"
+      ) ) &&
+      make -v &&
+      sh -c "%COMPILER% -v" &&
+      sh -c "CC=%COMPILER% %SCRIPT%"
+    )
+  - if [%HOST%]==[visual] (
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2015 %PLATFORM%\%CONFIGURATION% &&
+      ECHO *** &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2015_%PLATFORM%_%CONFIGURATION%.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\
+    )
diff --git a/appveyor_old.yml b/appveyor_old.yml
new file mode 100644
index 000000000..124850a2f
--- /dev/null
+++ b/appveyor_old.yml
@@ -0,0 +1,187 @@
+version: 1.0.{build}
+environment:
+  -
+    branches:
+      only:
+        - dev
+        - master
+    matrix:
+    - COMPILER: "gcc"
+      PLATFORM: "mingw64"
+      MAKE_PARAMS: '"make test && make lib && make -C tests test-symbols fullbench-dll fullbench-lib"'
+    - COMPILER: "gcc"
+      PLATFORM: "mingw32"
+      MAKE_PARAMS: '"make -C tests test-zstd test-fullbench test-fuzzer test-invalidDictionaries"'
+    - COMPILER: "gcc"
+      PLATFORM: "clang"
+      MAKE_PARAMS: '"make -C tests zstd fullbench fuzzer paramgrill datagen CC=clang MOREFLAGS="--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion""'
+    - COMPILER: "visual"
+      CONFIGURATION: "Debug"
+      PLATFORM: "x64"
+    - COMPILER: "visual"
+      CONFIGURATION: "Debug"
+      PLATFORM: "Win32"
+    - COMPILER: "visual"
+      CONFIGURATION: "Release"
+      PLATFORM: "x64"
+    - COMPILER: "visual"
+      CONFIGURATION: "Release"
+      PLATFORM: "Win32"
+
+  -
+    branches:
+      only:
+        - ci
+    matrix:
+    - COMPILER: "gcc"
+      PLATFORM: "mingw64"
+      MAKE_PARAMS: '"make all"'
+
+install:
+  - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
+  - MKDIR bin
+  - if [%COMPILER%]==[gcc] SET PATH_ORIGINAL=%PATH%
+  - if [%COMPILER%]==[gcc] (
+      SET "PATH_MINGW32=c:\MinGW\bin;c:\MinGW\usr\bin" &&
+      SET "PATH_MINGW64=c:\msys64\mingw64\bin;c:\msys64\usr\bin" &&
+      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
+      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
+    ) else (
+      IF [%PLATFORM%]==[x64] (SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;")
+    )
+
+build_script:
+  - ECHO Building %COMPILER% %PLATFORM% %CONFIGURATION%
+  - if [%PLATFORM%]==[mingw32] SET PATH=%PATH_MINGW32%;%PATH_ORIGINAL%
+  - if [%PLATFORM%]==[mingw64] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
+  - if [%PLATFORM%]==[clang] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
+  - if [%COMPILER%]==[gcc] (
+      ECHO *** &&
+      ECHO *** Building %PLATFORM% &&
+      ECHO *** &&
+      make -v &&
+      cc -v &&
+      ECHO %MAKE_PARAMS% &&
+      sh -c %MAKE_PARAMS%
+    )
+  - if [%PLATFORM%]==[clang] COPY tests\fuzzer.exe tests\fuzzer_clang.exe
+  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw64] (
+      COPY programs\zstd.exe bin\zstd.exe &&
+      appveyor PushArtifact bin\zstd.exe
+    )
+  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw32] (
+      COPY programs\zstd.exe bin\zstd32.exe &&
+      appveyor PushArtifact bin\zstd32.exe
+    )
+  - if [%COMPILER%]==[gcc] make clean
+  - if [%COMPILER%]==[visual] (
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2008 %PLATFORM%\%CONFIGURATION% in %APPVEYOR_BUILD_FOLDER% &&
+      ECHO *** &&
+      msbuild "build\VS2008\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v90 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2008/bin/%PLATFORM%/%CONFIGURATION%/*.exe &&
+      COPY build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2008_%PLATFORM%_%CONFIGURATION%.exe &&
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2010 %PLATFORM%\%CONFIGURATION% &&
+      ECHO *** &&
+      msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2010_%PLATFORM%_%CONFIGURATION%.exe &&
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2012 %PLATFORM%\%CONFIGURATION% &&
+      ECHO *** &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2012_%PLATFORM%_%CONFIGURATION%.exe &&
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2013 %PLATFORM%\%CONFIGURATION% &&
+      ECHO *** &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2013_%PLATFORM%_%CONFIGURATION%.exe &&
+      ECHO *** &&
+      ECHO *** Building Visual Studio 2015 %PLATFORM%\%CONFIGURATION% &&
+      ECHO *** &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
+      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
+      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2015_%PLATFORM%_%CONFIGURATION%.exe &&
+      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\
+    )
+
+test_script:
+  - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION%
+  - SET FUZZERTEST=-T1mn
+  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[clang] (
+      tests\fuzzer_clang.exe %FUZZERTEST% &&
+      ECHO *** &&
+      ECHO *** Building cmake for %PLATFORM% &&
+      ECHO *** &&
+      mkdir build\cmake\build &&
+      cd build\cmake\build &&
+      cmake -G "Visual Studio 14 2015 Win64" .. &&
+      cd ..\..\.. &&
+      make clean &&
+      ECHO *** &&
+      ECHO *** Building pzstd for %PLATFORM% &&
+      ECHO *** &&
+      make -C contrib\pzstd googletest-mingw64 &&
+      make -C contrib\pzstd pzstd.exe &&
+      make -C contrib\pzstd tests &&
+      make -C contrib\pzstd check &&
+      make -C contrib\pzstd clean
+    )
+  - if [%COMPILER%]==[visual] if [%CONFIGURATION%]==[Release] (
+      CD tests &&
+      SET ZSTD=./zstd.exe &&
+      sh -e playTests.sh --test-large-data &&
+      fullbench.exe -i1 &&
+      fullbench.exe -i1 -P0 &&
+      fuzzer_VS2008_%PLATFORM%_Release.exe %FUZZERTEST% &&
+      fuzzer_VS2010_%PLATFORM%_Release.exe %FUZZERTEST% &&
+      fuzzer_VS2012_%PLATFORM%_Release.exe %FUZZERTEST% &&
+      fuzzer_VS2013_%PLATFORM%_Release.exe %FUZZERTEST% &&
+      fuzzer_VS2015_%PLATFORM%_Release.exe %FUZZERTEST%
+    )
+
+artifacts:
+  - path: bin\zstd.exe
+  - path: bin\zstd32.exe
+
+deploy:
+- provider: GitHub
+  auth_token:
+    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
+  artifact: bin\zstd.exe
+  force_update: true
+  on:
+    branch: autobuild
+    COMPILER: gcc
+    PLATFORM: "mingw64"
+    appveyor_repo_tag: true
+- provider: GitHub
+  auth_token:
+    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
+  artifact: bin\zstd32.exe
+  force_update: true
+  on:
+    branch: autobuild
+    COMPILER: gcc
+    PLATFORM: "mingw32"
+    appveyor_repo_tag: true
diff --git a/tests/Makefile b/tests/Makefile
index 8a12a7324..809c90df5 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -65,14 +65,16 @@ FUZZERTEST ?= -T5mn
 ZSTDRTTEST = --test-large-data
 DECODECORPUS_TESTTIME ?= -T30
 
-.PHONY: default all all32 dll clean test test32 test-all namespaceTest versionsTest
+.PHONY: default all all32 allnothread dll clean test test32 test-all namespaceTest versionsTest
 
 default: fullbench
 
-all: fullbench fuzzer zstreamtest paramgrill datagen zbufftest
+all: fullbench fuzzer zstreamtest paramgrill datagen zbufftest decodecorpus
 
 all32: fullbench32 fuzzer32 zstreamtest32 zbufftest32
 
+allnothread: fullbench fuzzer paramgrill datagen zbufftest decodecorpus
+
 dll: fuzzer-dll zstreamtest-dll zbufftest-dll
 
 zstd:

From 8013c86c7d9985b9d120930e6bca63f9206ef856 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 14:03:54 +0100
Subject: [PATCH 014/255] Improve resolving ROOT_DIR

---
 build/cmake/CMakeLists.txt               | 1 +
 build/cmake/contrib/pzstd/CMakeLists.txt | 9 +++------
 build/cmake/lib/CMakeLists.txt           | 7 ++-----
 build/cmake/programs/CMakeLists.txt      | 9 +++------
 build/cmake/tests/CMakeLists.txt         | 9 +++------
 5 files changed, 12 insertions(+), 23 deletions(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index 4805cc2c9..d0f6daade 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -9,6 +9,7 @@
 
 PROJECT(zstd)
 CMAKE_MINIMUM_REQUIRED(VERSION 2.8.7)
+SET(ZSTD_SOURCE_DIR "${CMAKE_SOURCE_DIR}/../..")
 
 OPTION(ZSTD_LEGACY_SUPPORT "LEGACY SUPPORT" OFF)
 OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON)
diff --git a/build/cmake/contrib/pzstd/CMakeLists.txt b/build/cmake/contrib/pzstd/CMakeLists.txt
index 2a3663f31..f89be8901 100644
--- a/build/cmake/contrib/pzstd/CMakeLists.txt
+++ b/build/cmake/contrib/pzstd/CMakeLists.txt
@@ -14,13 +14,10 @@ PROJECT(pzstd)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
-# Define project root directory
-SET(ROOT_DIR ../../../..)
-
 # Define programs directory, where sources and header files are located
-SET(LIBRARY_DIR ${ROOT_DIR}/lib)
-SET(PROGRAMS_DIR ${ROOT_DIR}/programs)
-SET(PZSTD_DIR ${ROOT_DIR}/contrib/pzstd)
+SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
+SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs)
+SET(PZSTD_DIR ${ZSTD_SOURCE_DIR}/contrib/pzstd)
 INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${PZSTD_DIR})
 
 ADD_EXECUTABLE(pzstd ${PZSTD_DIR}/main.cpp ${PZSTD_DIR}/Options.cpp ${PZSTD_DIR}/Pzstd.cpp ${PZSTD_DIR}/SkippableFrame.cpp)
diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 1950d97cd..ffb6bd4a3 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -22,11 +22,8 @@ PROJECT(libzstd)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
-# Define project root directory
-SET(ROOT_DIR ../../..)
-
 # Define library directory, where sources and header files are located
-SET(LIBRARY_DIR ${ROOT_DIR}/lib)
+SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
 INCLUDE_DIRECTORIES(${LIBRARY_DIR} ${LIBRARY_DIR}/common)
 
 # Read file content
@@ -97,7 +94,7 @@ IF (ZSTD_LEGACY_SUPPORT)
 ENDIF (ZSTD_LEGACY_SUPPORT)
 
 IF (MSVC)
-    SET(MSVC_RESOURCE_DIR ${ROOT_DIR}/build/VS2010/libzstd-dll)
+    SET(MSVC_RESOURCE_DIR ${ZSTD_SOURCE_DIR}/build/VS2010/libzstd-dll)
     SET(PlatformDependResources ${MSVC_RESOURCE_DIR}/libzstd-dll.rc)
 ENDIF (MSVC)
 
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index c88ee5cc9..38b4c1e7d 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -14,12 +14,9 @@ PROJECT(programs)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
-# Define project root directory
-SET(ROOT_DIR ../../..)
-
 # Define programs directory, where sources and header files are located
-SET(LIBRARY_DIR ${ROOT_DIR}/lib)
-SET(PROGRAMS_DIR ${ROOT_DIR}/programs)
+SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
+SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs)
 INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${LIBRARY_DIR}/compress ${LIBRARY_DIR}/dictBuilder)
 
 IF (ZSTD_LEGACY_SUPPORT)
@@ -28,7 +25,7 @@ IF (ZSTD_LEGACY_SUPPORT)
 ENDIF (ZSTD_LEGACY_SUPPORT)
 
 IF (MSVC)
-    SET(MSVC_RESOURCE_DIR ${ROOT_DIR}/build/VS2010/zstd)
+    SET(MSVC_RESOURCE_DIR ${ZSTD_SOURCE_DIR}/build/VS2010/zstd)
     SET(PlatformDependResources ${MSVC_RESOURCE_DIR}/zstd.rc)
 ENDIF (MSVC)
 
diff --git a/build/cmake/tests/CMakeLists.txt b/build/cmake/tests/CMakeLists.txt
index 53a699449..cb327e48c 100644
--- a/build/cmake/tests/CMakeLists.txt
+++ b/build/cmake/tests/CMakeLists.txt
@@ -34,13 +34,10 @@ PROJECT(tests)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
-# Define project root directory
-SET(ROOT_DIR ../../..)
-
 # Define programs directory, where sources and header files are located
-SET(LIBRARY_DIR ${ROOT_DIR}/lib)
-SET(PROGRAMS_DIR ${ROOT_DIR}/programs)
-SET(TESTS_DIR ${ROOT_DIR}/tests)
+SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
+SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs)
+SET(TESTS_DIR ${ZSTD_SOURCE_DIR}/tests)
 INCLUDE_DIRECTORIES(${TESTS_DIR} ${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${LIBRARY_DIR}/compress ${LIBRARY_DIR}/dictBuilder)
 
 ADD_EXECUTABLE(fullbench ${PROGRAMS_DIR}/datagen.c ${TESTS_DIR}/fullbench.c)

From 623baf513e9331954ab76c44eabe63881476969a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 14:06:49 +0100
Subject: [PATCH 015/255] Move GetLibraryVersion function to its own module
 file

---
 build/cmake/CMakeModules/GetLibraryVersion.cmake |  9 +++++++++
 build/cmake/lib/CMakeLists.txt                   | 14 ++------------
 2 files changed, 11 insertions(+), 12 deletions(-)
 create mode 100644 build/cmake/CMakeModules/GetLibraryVersion.cmake

diff --git a/build/cmake/CMakeModules/GetLibraryVersion.cmake b/build/cmake/CMakeModules/GetLibraryVersion.cmake
new file mode 100644
index 000000000..a3e2fd25f
--- /dev/null
+++ b/build/cmake/CMakeModules/GetLibraryVersion.cmake
@@ -0,0 +1,9 @@
+function(GetLibraryVersion _header _major _minor _release)
+    # Read file content
+    FILE(READ ${_header} CONTENT)
+
+    string(REGEX MATCHALL ".*define ZSTD_VERSION_MAJOR+.* ([0-9]+).*define ZSTD_VERSION_MINOR+.* ([0-9]+).*define ZSTD_VERSION_RELEASE+.* ([0-9]+)" VERSION_REGEX "${CONTENT}")
+    SET(${_major} ${CMAKE_MATCH_1} PARENT_SCOPE)
+    SET(${_minor} ${CMAKE_MATCH_2} PARENT_SCOPE)
+    SET(${_release} ${CMAKE_MATCH_3} PARENT_SCOPE)
+endfunction()
diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index ffb6bd4a3..ed5b36b21 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -10,15 +10,8 @@
 #  - zstd homepage : http://www.zstd.net/
 # ################################################################
 
-# Get library version based on information from input content (use regular exp)
-function(GetLibraryVersion _content _outputVar1 _outputVar2 _outputVar3)
-    string(REGEX MATCHALL ".*define ZSTD_VERSION_MAJOR+.* ([0-9]+).*define ZSTD_VERSION_MINOR+.* ([0-9]+).*define ZSTD_VERSION_RELEASE+.* ([0-9]+)" VERSION_REGEX "${_content}")
-    SET(${_outputVar1} ${CMAKE_MATCH_1} PARENT_SCOPE)
-    SET(${_outputVar2} ${CMAKE_MATCH_2} PARENT_SCOPE)
-    SET(${_outputVar3} ${CMAKE_MATCH_3} PARENT_SCOPE)
-endfunction()
-
 PROJECT(libzstd)
+INCLUDE(${CMAKE_SOURCE_DIR}/CMakeModules/GetLibraryVersion.cmake)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
@@ -26,11 +19,8 @@ SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
 INCLUDE_DIRECTORIES(${LIBRARY_DIR} ${LIBRARY_DIR}/common)
 
-# Read file content
-FILE(READ ${LIBRARY_DIR}/zstd.h HEADER_CONTENT)
-
 # Parse version
-GetLibraryVersion("${HEADER_CONTENT}" LIBVER_MAJOR LIBVER_MINOR LIBVER_RELEASE)
+GetLibraryVersion(${LIBRARY_DIR}/zstd.h LIBVER_MAJOR LIBVER_MINOR LIBVER_RELEASE)
 MESSAGE("ZSTD VERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}")
 
 SET(Sources

From c03d7b898d87d50bd2d7dc625f59a4ab60863fb5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 14:08:13 +0100
Subject: [PATCH 016/255] Cleanup lib rules

---
 build/cmake/lib/CMakeLists.txt | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index ed5b36b21..65b00b9ed 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -101,17 +101,15 @@ ENDIF (MSVC)
 # Define library base name
 IF (MSVC)
     SET(LIBRARY_BASE_NAME zstdlib)
-ELSE ()
-    SET(LIBRARY_BASE_NAME libzstd)
-ENDIF (MSVC)
 
-IF (MSVC)
     IF (CMAKE_SIZEOF_VOID_P MATCHES "8")
         SET(LIBRARY_ARCH_SUFFIX "_x64")
     ELSE ()
         SET(LIBRARY_ARCH_SUFFIX "_x86")
     ENDIF (CMAKE_SIZEOF_VOID_P MATCHES "8")
 ELSE ()
+    SET(LIBRARY_BASE_NAME libzstd)
+
     SET(LIBRARY_ARCH_SUFFIX "")
 ENDIF (MSVC)
 

From e8517a95f328163f8f8653682d1894339bbf055c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 14:08:35 +0100
Subject: [PATCH 017/255] Add build documentation by gen_html

---
 build/cmake/contrib/CMakeLists.txt          |  1 +
 build/cmake/contrib/gen_html/CMakeLists.txt | 31 +++++++++++++++++++++
 2 files changed, 32 insertions(+)
 create mode 100644 build/cmake/contrib/gen_html/CMakeLists.txt

diff --git a/build/cmake/contrib/CMakeLists.txt b/build/cmake/contrib/CMakeLists.txt
index 68e0881c5..c7d97aa95 100644
--- a/build/cmake/contrib/CMakeLists.txt
+++ b/build/cmake/contrib/CMakeLists.txt
@@ -13,4 +13,5 @@
 PROJECT(contrib)
 
 ADD_SUBDIRECTORY(pzstd)
+ADD_SUBDIRECTORY(gen_html)
 
diff --git a/build/cmake/contrib/gen_html/CMakeLists.txt b/build/cmake/contrib/gen_html/CMakeLists.txt
new file mode 100644
index 000000000..14f52c68d
--- /dev/null
+++ b/build/cmake/contrib/gen_html/CMakeLists.txt
@@ -0,0 +1,31 @@
+# ################################################################
+# * Copyright (c) 2015-present, Yann Collet, Facebook, Inc.
+# * All rights reserved.
+# *
+# * This source code is licensed under the BSD-style license found in the
+# * LICENSE file in the root directory of this source tree. An additional grant
+# * of patent rights can be found in the PATENTS file in the same directory.
+#
+# You can contact the author at :
+#  - zstd homepage : http://www.zstd.net/
+# ################################################################
+
+PROJECT(gen_html)
+INCLUDE(${CMAKE_SOURCE_DIR}/CMakeModules/GetLibraryVersion.cmake)
+
+SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
+
+# Define programs directory, where sources and header files are located
+SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
+SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs)
+SET(GENHTML_DIR ${ZSTD_SOURCE_DIR}/contrib/gen_html)
+SET(GENHTML_BINARY ${PROJECT_BINARY_DIR}/gen_html${CMAKE_EXECUTABLE_SUFFIX})
+INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${GENHTML_DIR})
+
+ADD_EXECUTABLE(gen_html ${GENHTML_DIR}/gen_html.cpp)
+
+GetLibraryVersion(${LIBRARY_DIR}/zstd.h VMAJOR VMINOR VRELEASE)
+SET(LIBVERSION "${VMAJOR}.${VMINOR}.${VRELEASE}")
+ADD_CUSTOM_TARGET(zstd_manual.html ALL
+                  ${GENHTML_BINARY} "${LIBVERSION}" "${LIBRARY_DIR}/zstd.h" "${PROJECT_BINARY_DIR}/zstd_manual.html"
+                  DEPENDS gen_html COMMENT "Update zstd manual")

From 56ef200fcb71dcbc97ab40e83e959940d742cfdc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 14:09:39 +0100
Subject: [PATCH 018/255] .gitignore only build directory

---
 build/.gitignore | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/build/.gitignore b/build/.gitignore
index f03aac8b3..85bc9287d 100644
--- a/build/.gitignore
+++ b/build/.gitignore
@@ -17,4 +17,4 @@ VS2013/bin/
 VS2015/bin/
 
 # CMake
-cmake/
+cmake/build/

From 0184d80e8ee73011f22ded71d5090703e985b386 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 16:24:33 +0100
Subject: [PATCH 019/255] Refactored AddExtraCompilationFlags

 - Easier addition of new flags
 - Removed flags not used by default
 - Removed implicit PIC flag for all targets
---
 .../AddExtraCompilationFlags.cmake            | 345 +++---------------
 1 file changed, 57 insertions(+), 288 deletions(-)

diff --git a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake b/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
index e480c7ead..db5b48124 100644
--- a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
+++ b/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
@@ -1,316 +1,85 @@
+include(CheckCXXCompilerFlag)
+include(CheckCCompilerFlag)
+
+function(EnableCompilerFlag _flag _C _CXX)
+    message("Checking flag ${_flag}")
+    if (_C)
+        CHECK_C_COMPILER_FLAG(${_flag} C_FLAG)
+        if (C_FLAG)
+            set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_flag}" CACHE INTERNAL "C Flags")
+        endif ()
+        unset(C_FLAG CACHE)
+    endif ()
+    if (_CXX)
+        CHECK_CXX_COMPILER_FLAG(${_flag} CXX_FLAG)
+        if (CXX_FLAG)
+            set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${_flag}" CACHE INTERNAL "CXX Flags")
+        endif ()
+        unset(CXX_FLAG CACHE)
+    endif ()
+endfunction()
+
 MACRO(ADD_EXTRA_COMPILATION_FLAGS)
-    include(CheckCXXCompilerFlag)
-    include(CheckCCompilerFlag)
     if (CMAKE_COMPILER_IS_GNUCXX OR MINGW) #Not only UNIX but also WIN32 for MinGW
-
-        set(POSITION_INDEPENDENT_CODE_FLAG "-fPIC")
-        CHECK_C_COMPILER_FLAG(${POSITION_INDEPENDENT_CODE_FLAG} POSITION_INDEPENDENT_CODE_FLAG_ALLOWED)
-        if (POSITION_INDEPENDENT_CODE_FLAG_ALLOWED)
-            MESSAGE("Compiler flag ${POSITION_INDEPENDENT_CODE_FLAG} allowed")
-            set(ACTIVATE_POSITION_INDEPENDENT_CODE_FLAG "ON" CACHE BOOL "activate -fPIC flag")
-        else ()
-            MESSAGE("Compiler flag ${POSITION_INDEPENDENT_CODE_FLAG} not allowed")
-        endif (POSITION_INDEPENDENT_CODE_FLAG_ALLOWED)
-
-        set(WARNING_UNDEF "-Wundef")
-        CHECK_C_COMPILER_FLAG(${WARNING_UNDEF} WARNING_UNDEF_ALLOWED)
-        if (WARNING_UNDEF_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_UNDEF} allowed")
-            set(ACTIVATE_WARNING_UNDEF "ON" CACHE BOOL "activate -Wundef flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_UNDEF} not allowed")
-        endif (WARNING_UNDEF_ALLOWED)
-
-        set(WARNING_SHADOW "-Wshadow")
-        CHECK_C_COMPILER_FLAG(${WARNING_SHADOW} WARNING_SHADOW_ALLOWED)
-        if (WARNING_SHADOW_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_SHADOW} allowed")
-            set(ACTIVATE_WARNING_SHADOW "ON" CACHE BOOL "activate -Wshadow flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_SHADOW} not allowed")
-        endif (WARNING_SHADOW_ALLOWED)
-
-        set(WARNING_CAST_ALIGN "-Wcast-align")
-        CHECK_C_COMPILER_FLAG(${WARNING_CAST_ALIGN} WARNING_CAST_ALIGN_ALLOWED)
-        if (WARNING_CAST_ALIGN_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_CAST_ALIGN} allowed")
-            set(ACTIVATE_WARNING_CAST_ALIGN "ON" CACHE BOOL "activate -Wcast-align flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_CAST_ALIGN} not allowed")
-        endif (WARNING_CAST_ALIGN_ALLOWED)
-
-        set(WARNING_CAST_QUAL "-Wcast-qual")
-        CHECK_C_COMPILER_FLAG(${WARNING_CAST_QUAL} WARNING_CAST_QUAL_ALLOWED)
-        if (WARNING_CAST_QUAL_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_CAST_QUAL} allowed")
-            set(ACTIVATE_WARNING_CAST_QUAL "ON" CACHE BOOL "activate -Wcast-qual flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_CAST_QUAL} not allowed")
-        endif (WARNING_CAST_QUAL_ALLOWED)
-
-        set(WARNING_STRICT_PROTOTYPES "-Wstrict-prototypes")
-        CHECK_C_COMPILER_FLAG(${WARNING_STRICT_PROTOTYPES} WARNING_STRICT_PROTOTYPES_ALLOWED)
-        if (WARNING_STRICT_PROTOTYPES_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_STRICT_PROTOTYPES} allowed")
-            set(ACTIVATE_WARNING_STRICT_PROTOTYPES "ON" CACHE BOOL "activate -Wstrict-prototypes flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_STRICT_PROTOTYPES} not allowed")
-        endif (WARNING_STRICT_PROTOTYPES_ALLOWED)
-
-        set(WARNING_ALL "-Wall")
-        CHECK_C_COMPILER_FLAG(${WARNING_ALL} WARNING_ALL_ALLOWED)
-        if (WARNING_ALL_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_ALL} allowed")
-            set(ACTIVATE_WARNING_ALL "ON" CACHE BOOL "activate -Wall flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_ALL} not allowed")
-        endif (WARNING_ALL_ALLOWED)
-
-        set(WARNING_EXTRA "-Wextra")
-        CHECK_C_COMPILER_FLAG(${WARNING_EXTRA} WARNING_EXTRA_ALLOWED)
-        if (WARNING_EXTRA_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_EXTRA} allowed")
-            set(ACTIVATE_WARNING_EXTRA "ON" CACHE BOOL "activate -Wextra flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_EXTRA} not allowed")
-        endif (WARNING_EXTRA_ALLOWED)
-
-        set(WARNING_FLOAT_EQUAL "-Wfloat-equal")
-        CHECK_C_COMPILER_FLAG(${WARNING_FLOAT_EQUAL} WARNING_FLOAT_EQUAL_ALLOWED)
-        if (WARNING_FLOAT_EQUAL_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_FLOAT_EQUAL} allowed")
-            set(ACTIVATE_WARNING_FLOAT_EQUAL "OFF" CACHE BOOL "activate -Wfloat-equal flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_FLOAT_EQUAL} not allowed")
-        endif (WARNING_FLOAT_EQUAL_ALLOWED)
-
-        set(WARNING_SIGN_CONVERSION "-Wsign-conversion")
-        CHECK_C_COMPILER_FLAG(${WARNING_SIGN_CONVERSION} WARNING_SIGN_CONVERSION_ALLOWED)
-        if (WARNING_SIGN_CONVERSION_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_SIGN_CONVERSION} allowed")
-            set(ACTIVATE_WARNING_SIGN_CONVERSION "OFF" CACHE BOOL "activate -Wsign-conversion flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_SIGN_CONVERSION} not allowed")
-        endif (WARNING_SIGN_CONVERSION_ALLOWED)
-
-        if (ACTIVATE_POSITION_INDEPENDENT_CODE_FLAG)
-            list(APPEND CMAKE_C_FLAGS ${POSITION_INDEPENDENT_CODE_FLAG})
-        else ()
-            string(REPLACE ${POSITION_INDEPENDENT_CODE_FLAG} "" CMAKE_C_FLAGS "${POSITION_INDEPENDENT_CODE_FLAG}")
-        endif (ACTIVATE_POSITION_INDEPENDENT_CODE_FLAG)
-
-        if (ACTIVATE_WARNING_UNDEF)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_UNDEF})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_UNDEF})
-        else ()
-            string(REPLACE ${WARNING_UNDEF} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_UNDEF} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_UNDEF)
-
-        if (ACTIVATE_WARNING_SHADOW)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_SHADOW})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_SHADOW})
-        else ()
-            string(REPLACE ${WARNING_SHADOW} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_SHADOW} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_SHADOW)
-
-        if (ACTIVATE_WARNING_CAST_QUAL)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_CAST_QUAL})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_CAST_QUAL})
-        else ()
-            string(REPLACE ${WARNING_CAST_QUAL} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_CAST_QUAL} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_CAST_QUAL)
-
-        if (ACTIVATE_WARNING_CAST_ALIGN)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_CAST_ALIGN})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_CAST_ALIGN})
-        else ()
-            string(REPLACE ${WARNING_CAST_ALIGN} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_CAST_ALIGN} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_CAST_ALIGN)
-
-        if (ACTIVATE_WARNING_STRICT_PROTOTYPES)
-            list(APPEND CMAKE_C_FLAGS ${WARNING_STRICT_PROTOTYPES})
-        else ()
-            string(REPLACE ${WARNING_STRICT_PROTOTYPES} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_STRICT_PROTOTYPES)
-
-        if (ACTIVATE_WARNING_ALL)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_ALL})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_ALL})
-        else ()
-            string(REPLACE ${WARNING_ALL} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_ALL} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_ALL)
-
-        if (ACTIVATE_WARNING_EXTRA)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_EXTRA})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_EXTRA})
-        else ()
-            string(REPLACE ${WARNING_EXTRA} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_EXTRA} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_EXTRA)
-
-        if (ACTIVATE_WARNING_FLOAT_EQUAL)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_FLOAT_EQUAL})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_FLOAT_EQUAL})
-        else ()
-            string(REPLACE ${WARNING_FLOAT_EQUAL} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_FLOAT_EQUAL} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_FLOAT_EQUAL)
-
-        if (ACTIVATE_WARNING_SIGN_CONVERSION)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_SIGN_CONVERSION})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_SIGN_CONVERSION})
-        else ()
-            string(REPLACE ${WARNING_SIGN_CONVERSION} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_SIGN_CONVERSION} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_SIGN_CONVERSION)
-
         #Set c++11 by default
-        list(APPEND CMAKE_CXX_FLAGS "-std=c++11")
-
+        EnableCompilerFlag("-std=c++11" false true)
         #Set c99 by default
-        list(APPEND CMAKE_C_FLAGS "-std=c99")
+        EnableCompilerFlag("-std=c99" true false)
+        EnableCompilerFlag("-Wall" true true)
+        EnableCompilerFlag("-Wextra" true true)
+        EnableCompilerFlag("-Wundef" true true)
+        EnableCompilerFlag("-Wshadow" true true)
+        EnableCompilerFlag("-Wcast-align" true true)
+        EnableCompilerFlag("-Wcast-qual" true true)
+        EnableCompilerFlag("-Wstrict-prototypes" true false)
+    elseif (MSVC) # Add specific compilation flags for Windows Visual
+        EnableCompilerFlag("/Wall" true true)
 
-    elseif (MSVC)
-        # Add specific compilation flags for Windows Visual
-
-        set(WARNING_ALL "/Wall")
-        CHECK_C_COMPILER_FLAG(${WARNING_ALL} WARNING_ALL_ALLOWED)
-        if (WARNING_ALL_ALLOWED)
-            MESSAGE("Compiler flag ${WARNING_ALL} allowed")
-            set(ACTIVATE_WARNING_ALL "OFF" CACHE BOOL "activate /Wall flag")
-        else ()
-            MESSAGE("Compiler flag ${WARNING_ALL} not allowed")
-        endif (WARNING_ALL_ALLOWED)
-        	
-        set(RTC_FLAG "/RTC1")
-        CHECK_C_COMPILER_FLAG(${RTC_FLAG} RTC_FLAG_ALLOWED)
-        if (RTC_FLAG_ALLOWED)
-            MESSAGE("Compiler flag ${RTC_FLAG} allowed")
-            set(ACTIVATE_RTC_FLAG "ON" CACHE BOOL "activate /RTC1 flag")
-        else ()
-            MESSAGE("Compiler flag ${RTC_FLAG} not allowed")
-        endif (RTC_FLAG_ALLOWED)
-        	
-        set(ZC_FLAG "/Zc:forScope")
-        CHECK_C_COMPILER_FLAG(${ZC_FLAG} ZC_FLAG_ALLOWED)
-        if (ZC_FLAG_ALLOWED)
-            MESSAGE("Compiler flag ${ZC_FLAG} allowed")
-            set(ACTIVATE_ZC_FLAG "ON" CACHE BOOL "activate /Zc:forScope flag")
-        else ()
-            MESSAGE("Compiler flag ${ZC_FLAG} not allowed")
-        endif (ZC_FLAG_ALLOWED)
-        	
-        set(GD_FLAG "/Gd")
-        CHECK_C_COMPILER_FLAG(${GD_FLAG} GD_FLAG_ALLOWED)
-        if (GD_FLAG_ALLOWED)
-            MESSAGE("Compiler flag ${GD_FLAG} allowed")
-            set(ACTIVATE_GD_FLAG "ON" CACHE BOOL "activate /Gd flag")
-        else ()
-            MESSAGE("Compiler flag ${GD_FLAG} not allowed")
-        endif (GD_FLAG_ALLOWED)
-        	
-        set(ANALYZE_FLAG "/analyze:stacksize25000")
-        CHECK_C_COMPILER_FLAG(${ANALYZE_FLAG} ANALYZE_FLAG_ALLOWED)
-        if (ANALYZE_FLAG_ALLOWED)
-            MESSAGE("Compiler flag ${ANALYZE_FLAG} allowed")
-            set(ACTIVATE_ANALYZE_FLAG "ON" CACHE BOOL "activate /ANALYZE flag")
-        else ()
-            MESSAGE("Compiler flag ${ANALYZE_FLAG} not allowed")
-        endif (ANALYZE_FLAG_ALLOWED)
-
-        if (ACTIVATE_WARNING_ALL)
-            list(APPEND CMAKE_CXX_FLAGS ${WARNING_ALL})
-            list(APPEND CMAKE_C_FLAGS ${WARNING_ALL})
-        else ()
-            string(REPLACE ${WARNING_ALL} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${WARNING_ALL} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_WARNING_ALL)
-        	
         # Only for DEBUG version
-        if (ACTIVATE_RTC_FLAG)
-            list(APPEND CMAKE_CXX_FLAGS_DEBUG ${RTC_FLAG})
-            list(APPEND CMAKE_C_FLAGS_DEBUG ${RTC_FLAG})
-        else ()
-            string(REPLACE ${RTC_FLAG} "" CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG}")
-            string(REPLACE ${RTC_FLAG} "" CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS_DEBUG}")
-        endif (ACTIVATE_RTC_FLAG)
-        	
-        if (ACTIVATE_ZC_FLAG)
-            list(APPEND CMAKE_CXX_FLAGS ${ZC_FLAG})
-            list(APPEND CMAKE_C_FLAGS ${ZC_FLAG})
-        else ()
-            string(REPLACE ${ZC_FLAG} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${ZC_FLAG} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_ZC_FLAG)
-        	
-        if (ACTIVATE_GD_FLAG)
-            list(APPEND CMAKE_CXX_FLAGS ${GD_FLAG})
-            list(APPEND CMAKE_C_FLAGS ${GD_FLAG})
-        else ()
-            string(REPLACE ${GD_FLAG} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${GD_FLAG} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_GD_FLAG)
-        	
-        if (ACTIVATE_ANALYZE_FLAG)
-            list(APPEND CMAKE_CXX_FLAGS ${ANALYZE_FLAG})
-            list(APPEND CMAKE_C_FLAGS ${ANALYZE_FLAG})
-        else ()
-            string(REPLACE ${ANALYZE_FLAG} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${ANALYZE_FLAG} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_ANALYZE_FLAG)
-        	
+        EnableCompilerFlag("/RTC1" true true)
+        EnableCompilerFlag("/Zc:forScope" true true)
+        EnableCompilerFlag("/Gd" true true)
+        EnableCompilerFlag("/analyze:stacksize25000" true true)
+
         if (MSVC80 OR MSVC90 OR MSVC10 OR MSVC11)
             # To avoid compiler warning (level 4) C4571, compile with /EHa if you still want
             # your catch(...) blocks to catch structured exceptions.
-            list(APPEND CMAKE_CXX_FLAGS "/EHa")
+            EnableCompilerFlag("/EHa" false true)
         endif (MSVC80 OR MSVC90 OR MSVC10 OR MSVC11)
 
-        set(MULTITHREADED_COMPILATION "/MP")
-        MESSAGE("Compiler flag ${MULTITHREADED_COMPILATION} allowed")
-        set(ACTIVATE_MULTITHREADED_COMPILATION "ON" CACHE BOOL "activate /MP flag")
-
+        set(ACTIVATE_MULTITHREADED_COMPILATION "ON" CACHE BOOL "activate multi-threaded compilation (/MP flag)")
         if (ACTIVATE_MULTITHREADED_COMPILATION)
-            list(APPEND CMAKE_CXX_FLAGS ${MULTITHREADED_COMPILATION})
-            list(APPEND CMAKE_C_FLAGS ${MULTITHREADED_COMPILATION})
-        else ()
-            string(REPLACE ${MULTITHREADED_COMPILATION} "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
-            string(REPLACE ${MULTITHREADED_COMPILATION} "" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
-        endif (ACTIVATE_MULTITHREADED_COMPILATION)
+            EnableCompilerFlag("/MP" true true)
+        endif ()
 
         #For exceptions
-        list(APPEND CMAKE_CXX_FLAGS "/EHsc")
-        list(APPEND CMAKE_C_FLAGS "/EHsc")
+        EnableCompilerFlag("/EHsc" true true)
         
         # UNICODE SUPPORT
-        list(APPEND CMAKE_CXX_FLAGS "/D_UNICODE /DUNICODE")
-        list(APPEND CMAKE_C_FLAGS "/D_UNICODE /DUNICODE")
+        EnableCompilerFlag("/D_UNICODE" true true)
+        EnableCompilerFlag("/DUNICODE" true true)
     endif ()
 
     # Remove duplicates compilation flags
-	FOREACH (flag_var CMAKE_C_FLAGS CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_RELEASE
-                CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO
-		        CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
-		                CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
-	    separate_arguments(${flag_var})
-	    list(REMOVE_DUPLICATES ${flag_var})
-	    string(REPLACE ";" " " ${flag_var} "${${flag_var}}")
-	    set(${flag_var} "${${flag_var}}" CACHE STRING "common build flags" FORCE)
+    FOREACH (flag_var CMAKE_C_FLAGS CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_RELEASE
+             CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO
+             CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
+             CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
+        separate_arguments(${flag_var})
+        list(REMOVE_DUPLICATES ${flag_var})
+        string(REPLACE ";" " " ${flag_var} "${${flag_var}}")
+        set(${flag_var} "${${flag_var}}" CACHE STRING "common build flags" FORCE)
     ENDFOREACH (flag_var)  
 
     if (MSVC)
         # Replace /MT to /MD flag
-    	# Replace /O2 to /O3 flag
+        # Replace /O2 to /O3 flag
         FOREACH (flag_var CMAKE_C_FLAGS CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_RELEASE
-                CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO
-		        CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
-		                CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
+                 CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO
+                 CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
+                 CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
             STRING(REGEX REPLACE "/MT" "/MD" ${flag_var} "${${flag_var}}")
-        	STRING(REGEX REPLACE "/O2" "/Ox" ${flag_var} "${${flag_var}}")
+            STRING(REGEX REPLACE "/O2" "/Ox" ${flag_var} "${${flag_var}}")
         ENDFOREACH (flag_var)      
     endif ()
 

From a8c0c2af10ad87d67583c95d2e1b36cdaf75b006 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Thu, 16 Mar 2017 22:59:11 +0100
Subject: [PATCH 020/255] Fix cmake install prefix with cmake-3.x

---
 Makefile | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Makefile b/Makefile
index 49f29d782..518ea5c2d 100644
--- a/Makefile
+++ b/Makefile
@@ -275,7 +275,7 @@ cmakebuild:
 	cmake --version
 	$(RM) -r $(BUILDIR)/cmake/build
 	mkdir $(BUILDIR)/cmake/build
-	cd $(BUILDIR)/cmake/build ; cmake -DPREFIX:STRING=~/install_test_dir $(CMAKE_PARAMS) .. ; $(MAKE) install ; $(MAKE) uninstall
+	cd $(BUILDIR)/cmake/build ; cmake -DCMAKE_INSTALL_PREFIX:PATH=~/install_test_dir $(CMAKE_PARAMS) .. ; $(MAKE) install ; $(MAKE) uninstall
 
 c90build: clean
 	gcc -v

From ce11d77e4db6e5166fea22f78b846ad36dbcff05 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 14:12:28 +0100
Subject: [PATCH 021/255] Use shared library in programs

---
 build/cmake/contrib/pzstd/CMakeLists.txt | 2 +-
 build/cmake/programs/CMakeLists.txt      | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/build/cmake/contrib/pzstd/CMakeLists.txt b/build/cmake/contrib/pzstd/CMakeLists.txt
index f89be8901..f9cffa2a9 100644
--- a/build/cmake/contrib/pzstd/CMakeLists.txt
+++ b/build/cmake/contrib/pzstd/CMakeLists.txt
@@ -21,7 +21,7 @@ SET(PZSTD_DIR ${ZSTD_SOURCE_DIR}/contrib/pzstd)
 INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${PZSTD_DIR})
 
 ADD_EXECUTABLE(pzstd ${PZSTD_DIR}/main.cpp ${PZSTD_DIR}/Options.cpp ${PZSTD_DIR}/Pzstd.cpp ${PZSTD_DIR}/SkippableFrame.cpp)
-TARGET_LINK_LIBRARIES(pzstd libzstd_static pthread)
+TARGET_LINK_LIBRARIES(pzstd libzstd_shared pthread)
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_DEFINITIONS "NDEBUG")
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_OPTIONS "-Wno-shadow")
 
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index 38b4c1e7d..122163a95 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -30,17 +30,17 @@ IF (MSVC)
 ENDIF (MSVC)
 
 ADD_EXECUTABLE(zstd ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
-TARGET_LINK_LIBRARIES(zstd libzstd_static)
+TARGET_LINK_LIBRARIES(zstd libzstd_shared)
 IF (UNIX)
     ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c)
-    TARGET_LINK_LIBRARIES(zstd-frugal libzstd_static)
+    TARGET_LINK_LIBRARIES(zstd-frugal libzstd_shared)
     SET_TARGET_PROPERTIES(zstd-frugal PROPERTIES COMPILE_DEFINITIONS "ZSTD_NOBENCH;ZSTD_NODICT")
 ENDIF (UNIX)
 
 IF (ZSTD_MULTITHREAD_SUPPORT)
     ADD_EXECUTABLE(zstdmt ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
     SET_TARGET_PROPERTIES(zstdmt PROPERTIES COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
-    TARGET_LINK_LIBRARIES(zstdmt libzstd_static)
+    TARGET_LINK_LIBRARIES(zstdmt libzstd_shared)
     IF (UNIX)
         TARGET_LINK_LIBRARIES(zstdmt pthread)
     ENDIF (UNIX)

From c2430434df7079e5db418d2b928b7b1b2da48888 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 14:13:47 +0100
Subject: [PATCH 022/255] Install everything, not only libraries

---
 build/cmake/contrib/gen_html/CMakeLists.txt | 2 ++
 build/cmake/contrib/pzstd/CMakeLists.txt    | 1 +
 build/cmake/programs/CMakeLists.txt         | 3 +++
 3 files changed, 6 insertions(+)

diff --git a/build/cmake/contrib/gen_html/CMakeLists.txt b/build/cmake/contrib/gen_html/CMakeLists.txt
index 14f52c68d..dff8c7a11 100644
--- a/build/cmake/contrib/gen_html/CMakeLists.txt
+++ b/build/cmake/contrib/gen_html/CMakeLists.txt
@@ -29,3 +29,5 @@ SET(LIBVERSION "${VMAJOR}.${VMINOR}.${VRELEASE}")
 ADD_CUSTOM_TARGET(zstd_manual.html ALL
                   ${GENHTML_BINARY} "${LIBVERSION}" "${LIBRARY_DIR}/zstd.h" "${PROJECT_BINARY_DIR}/zstd_manual.html"
                   DEPENDS gen_html COMMENT "Update zstd manual")
+
+INSTALL(FILES "${PROJECT_BINARY_DIR}/zstd_manual.html" DESTINATION "share/doc")
diff --git a/build/cmake/contrib/pzstd/CMakeLists.txt b/build/cmake/contrib/pzstd/CMakeLists.txt
index f9cffa2a9..f581c6aa4 100644
--- a/build/cmake/contrib/pzstd/CMakeLists.txt
+++ b/build/cmake/contrib/pzstd/CMakeLists.txt
@@ -25,3 +25,4 @@ TARGET_LINK_LIBRARIES(pzstd libzstd_shared pthread)
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_DEFINITIONS "NDEBUG")
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_OPTIONS "-Wno-shadow")
 
+INSTALL(TARGETS pzstd RUNTIME DESTINATION "bin")
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index 122163a95..3f8c3b0f2 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -31,6 +31,8 @@ ENDIF (MSVC)
 
 ADD_EXECUTABLE(zstd ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
 TARGET_LINK_LIBRARIES(zstd libzstd_shared)
+INSTALL(TARGETS zstd RUNTIME DESTINATION "bin")
+
 IF (UNIX)
     ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c)
     TARGET_LINK_LIBRARIES(zstd-frugal libzstd_shared)
@@ -44,4 +46,5 @@ IF (ZSTD_MULTITHREAD_SUPPORT)
     IF (UNIX)
         TARGET_LINK_LIBRARIES(zstdmt pthread)
     ENDIF (UNIX)
+    INSTALL(TARGETS zstdmt RUNTIME DESTINATION "bin")
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)

From 0d3daffa2ffaab6070fa509b408e74fe216ebecd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 14:14:46 +0100
Subject: [PATCH 023/255] Much easier way of installing libraries with correct
 names

---
 build/cmake/lib/CMakeLists.txt | 56 ++++++----------------------------
 1 file changed, 9 insertions(+), 47 deletions(-)

diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 65b00b9ed..874111287 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -100,71 +100,33 @@ ENDIF (MSVC)
 
 # Define library base name
 IF (MSVC)
-    SET(LIBRARY_BASE_NAME zstdlib)
 
     IF (CMAKE_SIZEOF_VOID_P MATCHES "8")
-        SET(LIBRARY_ARCH_SUFFIX "_x64")
+        SET(LIBRARY_BASE_NAME "zstdlib_x64")
     ELSE ()
-        SET(LIBRARY_ARCH_SUFFIX "_x86")
+        SET(LIBRARY_BASE_NAME "zstdlib_x86")
     ENDIF (CMAKE_SIZEOF_VOID_P MATCHES "8")
 ELSE ()
-    SET(LIBRARY_BASE_NAME libzstd)
-
-    SET(LIBRARY_ARCH_SUFFIX "")
+    SET(LIBRARY_BASE_NAME zstd)
 ENDIF (MSVC)
 
 # Define static and shared library names
-SET(STATIC_LIBRARY_OUTPUT_NAME ${LIBRARY_BASE_NAME}${LIBRARY_ARCH_SUFFIX} CACHE STRING "Static library output name")
-SET(SHARED_LIBRARY_OUTPUT_NAME ${LIBRARY_BASE_NAME}.${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}${LIBRARY_ARCH_SUFFIX} CACHE STRING "Shared library output name")
-
 SET_TARGET_PROPERTIES(
         libzstd_static
         PROPERTIES
-        PREFIX ""
-        OUTPUT_NAME ${STATIC_LIBRARY_OUTPUT_NAME})
+        OUTPUT_NAME ${LIBRARY_BASE_NAME})
 
 SET_TARGET_PROPERTIES(
         libzstd_shared
         PROPERTIES
-        PREFIX ""
-        OUTPUT_NAME ${SHARED_LIBRARY_OUTPUT_NAME})
+        OUTPUT_NAME ${LIBRARY_BASE_NAME}
+        SOVERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE})
 
 IF (UNIX)
-    IF ("${PREFIX}" STREQUAL "")
-        SET(PREFIX /usr/local)
-    ENDIF()
-    MESSAGE("the variable PREFIX=${PREFIX}")
-    SET(INSTALL_LIBRARY_DIR ${PREFIX}/lib)
-    SET(INSTALL_INCLUDE_DIR ${PREFIX}/include)
-
     # install target
-    INSTALL(FILES ${LIBRARY_DIR}/zstd.h ${LIBRARY_DIR}/deprecated/zbuff.h ${LIBRARY_DIR}/dictBuilder/zdict.h DESTINATION ${INSTALL_INCLUDE_DIR})
-    INSTALL(TARGETS libzstd_static DESTINATION ${INSTALL_LIBRARY_DIR})
-    INSTALL(TARGETS libzstd_shared LIBRARY DESTINATION ${INSTALL_LIBRARY_DIR})
-
-    # Create symlinks and setup this files
-    SET(SHARED_LIBRARY_LINK ${SHARED_LIBRARY_OUTPUT_NAME}${CMAKE_SHARED_LIBRARY_SUFFIX})
-    SET(SHARED_LIBRARY_SYMLINK1 ${LIBRARY_BASE_NAME}${CMAKE_SHARED_LIBRARY_SUFFIX})
-    SET(SHARED_LIBRARY_SYMLINK2 ${LIBRARY_BASE_NAME}${CMAKE_SHARED_LIBRARY_SUFFIX}.${LIBVER_MAJOR})
-
-    SET(SHARED_LIBRARY_LINK_PATH ${CMAKE_CURRENT_BINARY_DIR}/${SHARED_LIBRARY_LINK})
-    SET(SHARED_LIBRARY_SYMLINK1_PATH ${CMAKE_CURRENT_BINARY_DIR}/${SHARED_LIBRARY_SYMLINK1})
-    SET(SHARED_LIBRARY_SYMLINK2_PATH ${CMAKE_CURRENT_BINARY_DIR}/${SHARED_LIBRARY_SYMLINK2})
-
-    ADD_CUSTOM_COMMAND(TARGET libzstd_shared POST_BUILD
-            COMMAND ${CMAKE_COMMAND} -E create_symlink ${SHARED_LIBRARY_LINK} ${SHARED_LIBRARY_SYMLINK1}
-            DEPENDS  ${SHARED_LIBRARY_LINK_PATH}
-            COMMENT "Generating symbolic link ${SHARED_LIBRARY_LINK} -> ${SHARED_LIBRARY_SYMLINK1}")
-
-    ADD_CUSTOM_COMMAND(TARGET libzstd_shared POST_BUILD
-            COMMAND ${CMAKE_COMMAND} -E create_symlink ${SHARED_LIBRARY_LINK} ${SHARED_LIBRARY_SYMLINK2}
-            DEPENDS  ${SHARED_LIBRARY_LINK_PATH}
-            COMMENT "Generating symbolic link ${SHARED_LIBRARY_LINK} -> ${SHARED_LIBRARY_SYMLINK2}")
-
-    SET_DIRECTORY_PROPERTIES(PROPERTIES ADDITIONAL_MAKE_CLEAN_FILES "${SHARED_LIBRARY_SYMLINK1};${SHARED_LIBRARY_SYMLINK2}")
-
-    INSTALL(FILES ${SHARED_LIBRARY_SYMLINK1_PATH} DESTINATION ${INSTALL_LIBRARY_DIR})
-    INSTALL(FILES ${SHARED_LIBRARY_SYMLINK2_PATH} DESTINATION ${INSTALL_LIBRARY_DIR})
+    INSTALL(FILES ${LIBRARY_DIR}/zstd.h ${LIBRARY_DIR}/deprecated/zbuff.h ${LIBRARY_DIR}/dictBuilder/zdict.h DESTINATION "include")
+    INSTALL(TARGETS libzstd_static ARCHIVE DESTINATION "lib")
+    INSTALL(TARGETS libzstd_shared LIBRARY DESTINATION "lib")
 
     # uninstall target
     CONFIGURE_FILE(

From b98b6fcf41bda6089ca0df821eaf90c4d272642a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 14:27:01 +0100
Subject: [PATCH 024/255] Check for pthreads library

---
 build/cmake/contrib/pzstd/CMakeLists.txt |  9 ++++++++-
 build/cmake/programs/CMakeLists.txt      | 12 ++++++++----
 2 files changed, 16 insertions(+), 5 deletions(-)

diff --git a/build/cmake/contrib/pzstd/CMakeLists.txt b/build/cmake/contrib/pzstd/CMakeLists.txt
index f581c6aa4..b4fbe1689 100644
--- a/build/cmake/contrib/pzstd/CMakeLists.txt
+++ b/build/cmake/contrib/pzstd/CMakeLists.txt
@@ -21,8 +21,15 @@ SET(PZSTD_DIR ${ZSTD_SOURCE_DIR}/contrib/pzstd)
 INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${PZSTD_DIR})
 
 ADD_EXECUTABLE(pzstd ${PZSTD_DIR}/main.cpp ${PZSTD_DIR}/Options.cpp ${PZSTD_DIR}/Pzstd.cpp ${PZSTD_DIR}/SkippableFrame.cpp)
-TARGET_LINK_LIBRARIES(pzstd libzstd_shared pthread)
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_DEFINITIONS "NDEBUG")
 SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_OPTIONS "-Wno-shadow")
 
+SET(THREADS_PREFER_PTHREAD_FLAG ON)
+FIND_PACKAGE(Threads REQUIRED)
+IF (CMAKE_USE_PTHREADS_INIT)
+    TARGET_LINK_LIBRARIES(pzstd libzstd_shared ${CMAKE_THREAD_LIBS_INIT})
+ELSE()
+    MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads")
+ENDIF()
+
 INSTALL(TARGETS pzstd RUNTIME DESTINATION "bin")
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index 3f8c3b0f2..bc20a265f 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -43,8 +43,12 @@ IF (ZSTD_MULTITHREAD_SUPPORT)
     ADD_EXECUTABLE(zstdmt ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
     SET_TARGET_PROPERTIES(zstdmt PROPERTIES COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
     TARGET_LINK_LIBRARIES(zstdmt libzstd_shared)
-    IF (UNIX)
-        TARGET_LINK_LIBRARIES(zstdmt pthread)
-    ENDIF (UNIX)
-    INSTALL(TARGETS zstdmt RUNTIME DESTINATION "bin")
+
+    SET(THREADS_PREFER_PTHREAD_FLAG ON)
+    FIND_PACKAGE(Threads REQUIRED)
+    IF (CMAKE_USE_PTHREADS_INIT)
+        TARGET_LINK_LIBRARIES(zstdmt ${CMAKE_THREAD_LIBS_INIT})
+    ELSE()
+        MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads")
+    ENDIF()
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)

From 8d562311c1869f5b081b8fe34cb8b142ad7b73c7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 14:42:44 +0100
Subject: [PATCH 025/255] Test new cmake stuff

---
 Makefile | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Makefile b/Makefile
index 518ea5c2d..985bff587 100644
--- a/Makefile
+++ b/Makefile
@@ -106,6 +106,7 @@ clean:
 #------------------------------------------------------------------------------
 ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU FreeBSD DragonFly NetBSD))
 HOST_OS = POSIX
+CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON
 .PHONY: install uninstall travis-install clangtest gpptest armtest usan asan uasan
 
 install:
@@ -263,7 +264,7 @@ endif
 
 ifneq (,$(filter MSYS%,$(shell uname)))
 HOST_OS = MSYS
-CMAKE_PARAMS = -G"MSYS Makefiles"
+CMAKE_PARAMS = -G"MSYS Makefiles" -DZSTD_MULTITHREAD_SUPPORT:BOOL=OFF
 endif
 
 

From f0076adccb5c6750283aba478d83efb52741a475 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Fri, 17 Mar 2017 15:36:37 +0100
Subject: [PATCH 026/255] Add_extra_compilation_flags macro needs to run before
 adding sources

Also adding comments in the top-level CMakeLists.txt
---
 build/cmake/CMakeLists.txt | 17 +++++++++++++----
 1 file changed, 13 insertions(+), 4 deletions(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index d0f6daade..7fa8bbc79 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -11,6 +11,15 @@ PROJECT(zstd)
 CMAKE_MINIMUM_REQUIRED(VERSION 2.8.7)
 SET(ZSTD_SOURCE_DIR "${CMAKE_SOURCE_DIR}/../..")
 
+#-----------------------------------------------------------------------------
+# Add extra compilation flags
+#-----------------------------------------------------------------------------
+INCLUDE(CMakeModules/AddExtraCompilationFlags.cmake)
+ADD_EXTRA_COMPILATION_FLAGS()
+
+#-----------------------------------------------------------------------------
+# Options
+#-----------------------------------------------------------------------------
 OPTION(ZSTD_LEGACY_SUPPORT "LEGACY SUPPORT" OFF)
 OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON)
 OPTION(ZSTD_BUILD_CONTRIB "BUILD CONTRIB" OFF)
@@ -23,6 +32,9 @@ ELSE (ZSTD_LEGACY_SUPPORT)
     ADD_DEFINITIONS(-DZSTD_LEGACY_SUPPORT=0)
 ENDIF (ZSTD_LEGACY_SUPPORT)
 
+#-----------------------------------------------------------------------------
+# Add source directories
+#-----------------------------------------------------------------------------
 ADD_SUBDIRECTORY(lib)
 ADD_SUBDIRECTORY(programs)
 ADD_SUBDIRECTORY(tests)
@@ -31,11 +43,8 @@ IF (ZSTD_BUILD_CONTRIB)
 ENDIF (ZSTD_BUILD_CONTRIB)
 
 #-----------------------------------------------------------------------------
-# Add extra compilation flags
+# Add clean-all target
 #-----------------------------------------------------------------------------
-INCLUDE(CMakeModules/AddExtraCompilationFlags.cmake)
-ADD_EXTRA_COMPILATION_FLAGS()
-
 ADD_CUSTOM_TARGET(clean-all
    COMMAND ${CMAKE_BUILD_TOOL} clean
    COMMAND rm -rf ${CMAKE_BINARY_DIR}/

From 16f771dfb152e09801adeccb857ea6e4c666feed Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Mon, 20 Mar 2017 15:47:02 +0100
Subject: [PATCH 027/255] Install forgotten zstdmt tool and zstd.1 man page

---
 build/cmake/programs/CMakeLists.txt | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index bc20a265f..b3cd1d129 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -34,6 +34,8 @@ TARGET_LINK_LIBRARIES(zstd libzstd_shared)
 INSTALL(TARGETS zstd RUNTIME DESTINATION "bin")
 
 IF (UNIX)
+    INSTALL(FILES ${PROGRAMS_DIR}/zstd.1 DESTINATION "share/man/man1")
+
     ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c)
     TARGET_LINK_LIBRARIES(zstd-frugal libzstd_shared)
     SET_TARGET_PROPERTIES(zstd-frugal PROPERTIES COMPILE_DEFINITIONS "ZSTD_NOBENCH;ZSTD_NODICT")
@@ -51,4 +53,6 @@ IF (ZSTD_MULTITHREAD_SUPPORT)
     ELSE()
         MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads")
     ENDIF()
+
+    INSTALL(TARGETS zstdmt RUNTIME DESTINATION "bin")
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)

From 01d7ea27e9430248522b848d43fbf38c81413608 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Mon, 20 Mar 2017 15:47:28 +0100
Subject: [PATCH 028/255] Added options for building programs, static library
 and tests

---
 build/cmake/CMakeLists.txt     | 17 +++++++++++++++--
 build/cmake/lib/CMakeLists.txt | 25 +++++++++++++++++--------
 2 files changed, 32 insertions(+), 10 deletions(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index 7fa8bbc79..e338e6cc1 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -22,7 +22,9 @@ ADD_EXTRA_COMPILATION_FLAGS()
 #-----------------------------------------------------------------------------
 OPTION(ZSTD_LEGACY_SUPPORT "LEGACY SUPPORT" OFF)
 OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON)
+OPTION(ZSTD_BUILD_PROGRAMS "BUILD PROGRAMS" ON)
 OPTION(ZSTD_BUILD_CONTRIB "BUILD CONTRIB" OFF)
+OPTION(ZSTD_BUILD_TESTS "BUILD TESTS" OFF)
 
 IF (ZSTD_LEGACY_SUPPORT)
     MESSAGE(STATUS "ZSTD_LEGACY_SUPPORT defined!")
@@ -36,8 +38,19 @@ ENDIF (ZSTD_LEGACY_SUPPORT)
 # Add source directories
 #-----------------------------------------------------------------------------
 ADD_SUBDIRECTORY(lib)
-ADD_SUBDIRECTORY(programs)
-ADD_SUBDIRECTORY(tests)
+
+IF (ZSTD_BUILD_PROGRAMS)
+    ADD_SUBDIRECTORY(programs)
+ENDIF (ZSTD_BUILD_PROGRAMS)
+
+IF (ZSTD_BUILD_TESTS)
+    IF (NOT ZSTD_BUILD_STATIC)
+        MESSAGE(SEND_ERROR "You need to build static library to build tests")
+    ENDIF (NOT ZSTD_BUILD_STATIC)
+
+    ADD_SUBDIRECTORY(tests)
+ENDIF (ZSTD_BUILD_TESTS)
+
 IF (ZSTD_BUILD_CONTRIB)
     ADD_SUBDIRECTORY(contrib)
 ENDIF (ZSTD_BUILD_CONTRIB)
diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 874111287..7a345bf56 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -14,6 +14,7 @@ PROJECT(libzstd)
 INCLUDE(${CMAKE_SOURCE_DIR}/CMakeModules/GetLibraryVersion.cmake)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
+OPTION(ZSTD_BUILD_STATIC "BUILD STATIC LIBRARIES" OFF)
 
 # Define library directory, where sources and header files are located
 SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
@@ -89,13 +90,17 @@ IF (MSVC)
 ENDIF (MSVC)
 
 # Split project to static and shared libraries build
-ADD_LIBRARY(libzstd_static STATIC ${Sources} ${Headers})
 ADD_LIBRARY(libzstd_shared SHARED ${Sources} ${Headers} ${PlatformDependResources})
+IF (ZSTD_BUILD_STATIC)
+    ADD_LIBRARY(libzstd_static STATIC ${Sources} ${Headers})
+ENDIF (ZSTD_BUILD_STATIC)
 
 # Add specific compile definitions for MSVC project
 IF (MSVC)
-    SET_TARGET_PROPERTIES(libzstd_static PROPERTIES COMPILE_DEFINITIONS "ZSTD_HEAPMODE=0;_CRT_SECURE_NO_WARNINGS")
     SET_TARGET_PROPERTIES(libzstd_shared PROPERTIES COMPILE_DEFINITIONS "ZSTD_DLL_EXPORT=1;ZSTD_HEAPMODE=0;_CONSOLE;_CRT_SECURE_NO_WARNINGS")
+    IF (ZSTD_BUILD_STATIC)
+        SET_TARGET_PROPERTIES(libzstd_static PROPERTIES COMPILE_DEFINITIONS "ZSTD_HEAPMODE=0;_CRT_SECURE_NO_WARNINGS")
+    ENDIF (ZSTD_BUILD_STATIC)
 ENDIF (MSVC)
 
 # Define library base name
@@ -111,22 +116,26 @@ ELSE ()
 ENDIF (MSVC)
 
 # Define static and shared library names
-SET_TARGET_PROPERTIES(
-        libzstd_static
-        PROPERTIES
-        OUTPUT_NAME ${LIBRARY_BASE_NAME})
-
 SET_TARGET_PROPERTIES(
         libzstd_shared
         PROPERTIES
         OUTPUT_NAME ${LIBRARY_BASE_NAME}
         SOVERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE})
 
+IF (ZSTD_BUILD_STATIC)
+    SET_TARGET_PROPERTIES(
+            libzstd_static
+            PROPERTIES
+            OUTPUT_NAME ${LIBRARY_BASE_NAME})
+ENDIF (ZSTD_BUILD_STATIC)
+
 IF (UNIX)
     # install target
     INSTALL(FILES ${LIBRARY_DIR}/zstd.h ${LIBRARY_DIR}/deprecated/zbuff.h ${LIBRARY_DIR}/dictBuilder/zdict.h DESTINATION "include")
-    INSTALL(TARGETS libzstd_static ARCHIVE DESTINATION "lib")
     INSTALL(TARGETS libzstd_shared LIBRARY DESTINATION "lib")
+    IF (ZSTD_BUILD_STATIC)
+        INSTALL(TARGETS libzstd_static ARCHIVE DESTINATION "lib")
+    ENDIF (ZSTD_BUILD_STATIC)
 
     # uninstall target
     CONFIGURE_FILE(

From 0d09c778a525530f21eaaa3dbf2c85ca12db8874 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Mon, 20 Mar 2017 15:57:08 +0100
Subject: [PATCH 029/255] Add build of new cmake branches to Makefile

---
 Makefile | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Makefile b/Makefile
index 985bff587..81cf51670 100644
--- a/Makefile
+++ b/Makefile
@@ -106,7 +106,7 @@ clean:
 #------------------------------------------------------------------------------
 ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU FreeBSD DragonFly NetBSD))
 HOST_OS = POSIX
-CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON
+CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON
 .PHONY: install uninstall travis-install clangtest gpptest armtest usan asan uasan
 
 install:
@@ -264,7 +264,7 @@ endif
 
 ifneq (,$(filter MSYS%,$(shell uname)))
 HOST_OS = MSYS
-CMAKE_PARAMS = -G"MSYS Makefiles" -DZSTD_MULTITHREAD_SUPPORT:BOOL=OFF
+CMAKE_PARAMS = -G"MSYS Makefiles" -DZSTD_MULTITHREAD_SUPPORT:BOOL=OFF -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON
 endif
 
 

From a2286a333c3d1f40c2da1e7e5ad9fc187bdc693f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Mon, 20 Mar 2017 22:58:02 +0100
Subject: [PATCH 030/255] Install zstdcat and unzstd symlinks by cmake

---
 build/cmake/programs/CMakeLists.txt | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index b3cd1d129..a481a8e1d 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -31,10 +31,19 @@ ENDIF (MSVC)
 
 ADD_EXECUTABLE(zstd ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
 TARGET_LINK_LIBRARIES(zstd libzstd_shared)
+ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd zstdcat COMMENT "Creating zstdcat symlink")
+ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd unzstd COMMENT "Creating unzstd symlink")
 INSTALL(TARGETS zstd RUNTIME DESTINATION "bin")
+INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat DESTINATION "bin")
+INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd DESTINATION "bin")
 
 IF (UNIX)
-    INSTALL(FILES ${PROGRAMS_DIR}/zstd.1 DESTINATION "share/man/man1")
+    FILE(COPY ${PROGRAMS_DIR}/zstd.1 DESTINATION .)
+    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd.1 zstdcat.1 COMMENT "Creating zstdcat.1 symlink")
+    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd.1 unzstd.1 COMMENT "Creating unzstd.1 symlink")
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstd.1 DESTINATION "share/man/man1")
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat.1 DESTINATION "share/man/man1")
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd.1 DESTINATION "share/man/man1")
 
     ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c)
     TARGET_LINK_LIBRARIES(zstd-frugal libzstd_shared)

From 5b3a9cbed2c8459b0127a8453aacb9b485d4f7b7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Tue, 21 Mar 2017 13:00:05 +0100
Subject: [PATCH 031/255] Remove multithreading support by default on non UNIX
 platforms

---
 build/cmake/CMakeLists.txt | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index e338e6cc1..9ce52ed21 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -21,7 +21,11 @@ ADD_EXTRA_COMPILATION_FLAGS()
 # Options
 #-----------------------------------------------------------------------------
 OPTION(ZSTD_LEGACY_SUPPORT "LEGACY SUPPORT" OFF)
-OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON)
+IF (UNIX)
+    OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON)
+ELSE (UNIX)
+    OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" OFF)
+ENDIF (UNIX)
 OPTION(ZSTD_BUILD_PROGRAMS "BUILD PROGRAMS" ON)
 OPTION(ZSTD_BUILD_CONTRIB "BUILD CONTRIB" OFF)
 OPTION(ZSTD_BUILD_TESTS "BUILD TESTS" OFF)

From ad92b5544859eaf4017b800803fdc1de7b728b68 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 21 Mar 2017 11:19:48 -0700
Subject: [PATCH 032/255] Fix msvc fuzzer test runtime

---
 appveyor.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/appveyor.yml b/appveyor.yml
index 26ad31002..7ffc2c2b0 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -143,7 +143,7 @@
       make -C contrib\pzstd clean
     )
   - if [%HOST%]==[visual] if [%CONFIGURATION%]==[Release] (
-      SET FUZZERTEST=-T1mn &&
+      SET "FUZZERTEST=-T1mn" &&
       CD tests &&
       SET ZSTD=./zstd.exe &&
       sh -e playTests.sh --test-large-data &&

From f3dfcdccd10d69519d6bf3304a0e953d8cfe6780 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 21 Mar 2017 12:18:28 -0700
Subject: [PATCH 033/255] bump version number

---
 NEWS       | 4 ++++
 lib/zstd.h | 2 +-
 2 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/NEWS b/NEWS
index bbd9e1688..fe0c64624 100644
--- a/NEWS
+++ b/NEWS
@@ -1,3 +1,7 @@
+v1.1.5
+cli : fix : does not output compressed data on console, by Sean Purcell
+build: improved cmake script, by @Majlen
+
 v1.1.4
 cli : new : can compress in *.gz format, using --format=gzip command, by Przemyslaw Skibinski
 cli : new : advanced benchmark command --priority=rt
diff --git a/lib/zstd.h b/lib/zstd.h
index a3237c77e..4531a84bf 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -56,7 +56,7 @@ extern "C" {
 /*------   Version   ------*/
 #define ZSTD_VERSION_MAJOR    1
 #define ZSTD_VERSION_MINOR    1
-#define ZSTD_VERSION_RELEASE  4
+#define ZSTD_VERSION_RELEASE  5
 
 #define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE
 #define ZSTD_QUOTE(str) #str

From eaf69b07f0ceeb8d1e8dabd7b4570e2ff3cb182a Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 21 Mar 2017 13:20:59 -0700
Subject: [PATCH 034/255] Zero pointers after freeing

---
 lib/compress/zstd_compress.c     | 4 ++++
 lib/decompress/zstd_decompress.c | 4 ++++
 2 files changed, 8 insertions(+)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 450e5970a..1aab3553f 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2970,9 +2970,13 @@ size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
     if (zcs==NULL) return 0;   /* support free on NULL */
     {   ZSTD_customMem const cMem = zcs->customMem;
         ZSTD_freeCCtx(zcs->cctx);
+        zcs->cctx = NULL;
         ZSTD_freeCDict(zcs->cdictLocal);
+        zcs->cdictLocal = NULL;
         ZSTD_free(zcs->inBuff, cMem);
+        zcs->inBuff = NULL;
         ZSTD_free(zcs->outBuff, cMem);
+        zcs->outBuff = NULL;
         ZSTD_free(zcs, cMem);
         return 0;
     }
diff --git a/lib/decompress/zstd_decompress.c b/lib/decompress/zstd_decompress.c
index 2aaa4a3df..65e6eda70 100644
--- a/lib/decompress/zstd_decompress.c
+++ b/lib/decompress/zstd_decompress.c
@@ -2209,9 +2209,13 @@ size_t ZSTD_freeDStream(ZSTD_DStream* zds)
     if (zds==NULL) return 0;   /* support free on null */
     {   ZSTD_customMem const cMem = zds->customMem;
         ZSTD_freeDCtx(zds->dctx);
+        zds->dctx = NULL;
         ZSTD_freeDDict(zds->ddictLocal);
+        zds->ddictLocal = NULL;
         ZSTD_free(zds->inBuff, cMem);
+        zds->inBuff = NULL;
         ZSTD_free(zds->outBuff, cMem);
+        zds->outBuff = NULL;
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
         if (zds->legacyContext)
             ZSTD_freeLegacyStreamContext(zds->legacyContext, zds->previousLegacyVersion);

From f7a78609e79ca3c8a0a621f8038ca0f83efb363f Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 21 Mar 2017 13:44:33 -0700
Subject: [PATCH 035/255] CMake: Fix version parsing and allow Unix flags on
 Clang

---
 build/cmake/CMakeModules/AddExtraCompilationFlags.cmake | 2 +-
 build/cmake/CMakeModules/GetLibraryVersion.cmake        | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake b/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
index db5b48124..e099a01da 100644
--- a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
+++ b/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
@@ -20,7 +20,7 @@ function(EnableCompilerFlag _flag _C _CXX)
 endfunction()
 
 MACRO(ADD_EXTRA_COMPILATION_FLAGS)
-    if (CMAKE_COMPILER_IS_GNUCXX OR MINGW) #Not only UNIX but also WIN32 for MinGW
+    if (CMAKE_CXX_COMPILER_ID MATCHES "GNU|Clang" OR MINGW) #Not only UNIX but also WIN32 for MinGW
         #Set c++11 by default
         EnableCompilerFlag("-std=c++11" false true)
         #Set c99 by default
diff --git a/build/cmake/CMakeModules/GetLibraryVersion.cmake b/build/cmake/CMakeModules/GetLibraryVersion.cmake
index a3e2fd25f..95d84a89f 100644
--- a/build/cmake/CMakeModules/GetLibraryVersion.cmake
+++ b/build/cmake/CMakeModules/GetLibraryVersion.cmake
@@ -2,7 +2,7 @@ function(GetLibraryVersion _header _major _minor _release)
     # Read file content
     FILE(READ ${_header} CONTENT)
 
-    string(REGEX MATCHALL ".*define ZSTD_VERSION_MAJOR+.* ([0-9]+).*define ZSTD_VERSION_MINOR+.* ([0-9]+).*define ZSTD_VERSION_RELEASE+.* ([0-9]+)" VERSION_REGEX "${CONTENT}")
+    string(REGEX MATCH ".*define ZSTD_VERSION_MAJOR *([0-9]+).*define ZSTD_VERSION_MINOR *([0-9]+).*define ZSTD_VERSION_RELEASE *([0-9]+)" VERSION_REGEX "${CONTENT}")
     SET(${_major} ${CMAKE_MATCH_1} PARENT_SCOPE)
     SET(${_minor} ${CMAKE_MATCH_2} PARENT_SCOPE)
     SET(${_release} ${CMAKE_MATCH_3} PARENT_SCOPE)

From 4cfed3c526bfb1eb1989035d751d3e999f5e1c66 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 21 Mar 2017 14:21:00 -0700
Subject: [PATCH 036/255] Attempt to fix FUZZERTEST variable set and remove
 appveyor_old.yml

---
 appveyor.yml     |   2 +-
 appveyor_old.yml | 187 -----------------------------------------------
 2 files changed, 1 insertion(+), 188 deletions(-)
 delete mode 100644 appveyor_old.yml

diff --git a/appveyor.yml b/appveyor.yml
index 7ffc2c2b0..7239e2e13 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -142,8 +142,8 @@
       make -C contrib\pzstd check &&
       make -C contrib\pzstd clean
     )
+  - SET "FUZZERTEST=-T1mn"
   - if [%HOST%]==[visual] if [%CONFIGURATION%]==[Release] (
-      SET "FUZZERTEST=-T1mn" &&
       CD tests &&
       SET ZSTD=./zstd.exe &&
       sh -e playTests.sh --test-large-data &&
diff --git a/appveyor_old.yml b/appveyor_old.yml
deleted file mode 100644
index 124850a2f..000000000
--- a/appveyor_old.yml
+++ /dev/null
@@ -1,187 +0,0 @@
-version: 1.0.{build}
-environment:
-  -
-    branches:
-      only:
-        - dev
-        - master
-    matrix:
-    - COMPILER: "gcc"
-      PLATFORM: "mingw64"
-      MAKE_PARAMS: '"make test && make lib && make -C tests test-symbols fullbench-dll fullbench-lib"'
-    - COMPILER: "gcc"
-      PLATFORM: "mingw32"
-      MAKE_PARAMS: '"make -C tests test-zstd test-fullbench test-fuzzer test-invalidDictionaries"'
-    - COMPILER: "gcc"
-      PLATFORM: "clang"
-      MAKE_PARAMS: '"make -C tests zstd fullbench fuzzer paramgrill datagen CC=clang MOREFLAGS="--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion""'
-    - COMPILER: "visual"
-      CONFIGURATION: "Debug"
-      PLATFORM: "x64"
-    - COMPILER: "visual"
-      CONFIGURATION: "Debug"
-      PLATFORM: "Win32"
-    - COMPILER: "visual"
-      CONFIGURATION: "Release"
-      PLATFORM: "x64"
-    - COMPILER: "visual"
-      CONFIGURATION: "Release"
-      PLATFORM: "Win32"
-
-  -
-    branches:
-      only:
-        - ci
-    matrix:
-    - COMPILER: "gcc"
-      PLATFORM: "mingw64"
-      MAKE_PARAMS: '"make all"'
-
-install:
-  - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
-  - MKDIR bin
-  - if [%COMPILER%]==[gcc] SET PATH_ORIGINAL=%PATH%
-  - if [%COMPILER%]==[gcc] (
-      SET "PATH_MINGW32=c:\MinGW\bin;c:\MinGW\usr\bin" &&
-      SET "PATH_MINGW64=c:\msys64\mingw64\bin;c:\msys64\usr\bin" &&
-      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
-      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
-    ) else (
-      IF [%PLATFORM%]==[x64] (SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;")
-    )
-
-build_script:
-  - ECHO Building %COMPILER% %PLATFORM% %CONFIGURATION%
-  - if [%PLATFORM%]==[mingw32] SET PATH=%PATH_MINGW32%;%PATH_ORIGINAL%
-  - if [%PLATFORM%]==[mingw64] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
-  - if [%PLATFORM%]==[clang] SET PATH=%PATH_MINGW64%;%PATH_ORIGINAL%
-  - if [%COMPILER%]==[gcc] (
-      ECHO *** &&
-      ECHO *** Building %PLATFORM% &&
-      ECHO *** &&
-      make -v &&
-      cc -v &&
-      ECHO %MAKE_PARAMS% &&
-      sh -c %MAKE_PARAMS%
-    )
-  - if [%PLATFORM%]==[clang] COPY tests\fuzzer.exe tests\fuzzer_clang.exe
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw64] (
-      COPY programs\zstd.exe bin\zstd.exe &&
-      appveyor PushArtifact bin\zstd.exe
-    )
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[mingw32] (
-      COPY programs\zstd.exe bin\zstd32.exe &&
-      appveyor PushArtifact bin\zstd32.exe
-    )
-  - if [%COMPILER%]==[gcc] make clean
-  - if [%COMPILER%]==[visual] (
-      ECHO *** &&
-      ECHO *** Building Visual Studio 2008 %PLATFORM%\%CONFIGURATION% in %APPVEYOR_BUILD_FOLDER% &&
-      ECHO *** &&
-      msbuild "build\VS2008\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v90 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2008/bin/%PLATFORM%/%CONFIGURATION%/*.exe &&
-      COPY build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2008_%PLATFORM%_%CONFIGURATION%.exe &&
-      ECHO *** &&
-      ECHO *** Building Visual Studio 2010 %PLATFORM%\%CONFIGURATION% &&
-      ECHO *** &&
-      msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2010_%PLATFORM%_%CONFIGURATION%.exe &&
-      ECHO *** &&
-      ECHO *** Building Visual Studio 2012 %PLATFORM%\%CONFIGURATION% &&
-      ECHO *** &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2012_%PLATFORM%_%CONFIGURATION%.exe &&
-      ECHO *** &&
-      ECHO *** Building Visual Studio 2013 %PLATFORM%\%CONFIGURATION% &&
-      ECHO *** &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2013_%PLATFORM%_%CONFIGURATION%.exe &&
-      ECHO *** &&
-      ECHO *** Building Visual Studio 2015 %PLATFORM%\%CONFIGURATION% &&
-      ECHO *** &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" &&
-      DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe &&
-      MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe &&
-      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2015_%PLATFORM%_%CONFIGURATION%.exe &&
-      COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\
-    )
-
-test_script:
-  - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION%
-  - SET FUZZERTEST=-T1mn
-  - if [%COMPILER%]==[gcc] if [%PLATFORM%]==[clang] (
-      tests\fuzzer_clang.exe %FUZZERTEST% &&
-      ECHO *** &&
-      ECHO *** Building cmake for %PLATFORM% &&
-      ECHO *** &&
-      mkdir build\cmake\build &&
-      cd build\cmake\build &&
-      cmake -G "Visual Studio 14 2015 Win64" .. &&
-      cd ..\..\.. &&
-      make clean &&
-      ECHO *** &&
-      ECHO *** Building pzstd for %PLATFORM% &&
-      ECHO *** &&
-      make -C contrib\pzstd googletest-mingw64 &&
-      make -C contrib\pzstd pzstd.exe &&
-      make -C contrib\pzstd tests &&
-      make -C contrib\pzstd check &&
-      make -C contrib\pzstd clean
-    )
-  - if [%COMPILER%]==[visual] if [%CONFIGURATION%]==[Release] (
-      CD tests &&
-      SET ZSTD=./zstd.exe &&
-      sh -e playTests.sh --test-large-data &&
-      fullbench.exe -i1 &&
-      fullbench.exe -i1 -P0 &&
-      fuzzer_VS2008_%PLATFORM%_Release.exe %FUZZERTEST% &&
-      fuzzer_VS2010_%PLATFORM%_Release.exe %FUZZERTEST% &&
-      fuzzer_VS2012_%PLATFORM%_Release.exe %FUZZERTEST% &&
-      fuzzer_VS2013_%PLATFORM%_Release.exe %FUZZERTEST% &&
-      fuzzer_VS2015_%PLATFORM%_Release.exe %FUZZERTEST%
-    )
-
-artifacts:
-  - path: bin\zstd.exe
-  - path: bin\zstd32.exe
-
-deploy:
-- provider: GitHub
-  auth_token:
-    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
-  artifact: bin\zstd.exe
-  force_update: true
-  on:
-    branch: autobuild
-    COMPILER: gcc
-    PLATFORM: "mingw64"
-    appveyor_repo_tag: true
-- provider: GitHub
-  auth_token:
-    secure: LgJo8emYc3sFnlNWkGl4/VYK3nk/8+RagcsqDlAi3xeqNGNutnKjcftjg84uJoT4
-  artifact: bin\zstd32.exe
-  force_update: true
-  on:
-    branch: autobuild
-    COMPILER: gcc
-    PLATFORM: "mingw32"
-    appveyor_repo_tag: true

From ea14b737955b2620cbc02955126cc1cba8409d8f Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 21 Mar 2017 15:03:23 -0700
Subject: [PATCH 037/255] Educational decoder: Clarify IO_rewind_bits

---
 doc/educational_decoder/zstd_decompress.c | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/doc/educational_decoder/zstd_decompress.c b/doc/educational_decoder/zstd_decompress.c
index ae4eaa81c..5a94fc4aa 100644
--- a/doc/educational_decoder/zstd_decompress.c
+++ b/doc/educational_decoder/zstd_decompress.c
@@ -1598,11 +1598,16 @@ static inline void IO_rewind_bits(istream_t *const in, int num) {
         ERROR("Attempting to rewind stream by a negative number of bits");
     }
 
+    /* move the offset back by `num` bits */
     const int new_offset = in->bit_offset - num;
-    const i64 bytes = (new_offset - 7) / 8;
+    /* determine the number of whole bytes we have to rewind, rounding up to an
+     * integer number (e.g. if `new_offset == -5`, `bytes == 1`) */
+    const i64 bytes = -(new_offset - 7) / 8;
 
-    in->ptr += bytes;
-    in->len -= bytes;
+    in->ptr -= bytes;
+    in->len += bytes;
+    /* make sure the resulting `bit_offset` is positive, as mod in C does not
+     * convert numbers from negative to positive (e.g. -22 % 8 == -6) */
     in->bit_offset = ((new_offset % 8) + 8) % 8;
 }
 

From 9f048cb74ac463baf293b30af278620af3e45373 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 21 Mar 2017 17:01:51 -0700
Subject: [PATCH 038/255] Educational decoder: Some more minor clarity fixes

---
 doc/educational_decoder/zstd_decompress.c | 61 +++++++++++------------
 1 file changed, 30 insertions(+), 31 deletions(-)

diff --git a/doc/educational_decoder/zstd_decompress.c b/doc/educational_decoder/zstd_decompress.c
index 5a94fc4aa..346cd296a 100644
--- a/doc/educational_decoder/zstd_decompress.c
+++ b/doc/educational_decoder/zstd_decompress.c
@@ -87,9 +87,9 @@ typedef struct {
 /// non-byte aligned
 
 /// Reads `num` bits from a bitstream, and updates the internal offset
-static inline u64 IO_read_bits(istream_t *const in, const int num);
+static inline u64 IO_read_bits(istream_t *const in, const int num_bits);
 /// Rewinds the stream by `num` bits
-static inline void IO_rewind_bits(istream_t *const in, const int num);
+static inline void IO_rewind_bits(istream_t *const in, const int num_bits);
 /// If the remaining bits in a byte will be unused, advance to the end of the
 /// byte
 static inline void IO_align_stream(istream_t *const in);
@@ -124,7 +124,7 @@ static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len);
 
 /*** BITSTREAM OPERATIONS *************/
 /// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits
-static inline u64 read_bits_LE(const u8 *src, const int num,
+static inline u64 read_bits_LE(const u8 *src, const int num_bits,
                                const size_t offset);
 
 /// Read bits from the end of a HUF or FSE bitstream.  `offset` is in bits, so
@@ -136,9 +136,8 @@ static inline u64 STREAM_read_bits(const u8 *src, const int bits,
 /*** END BITSTREAM OPERATIONS *********/
 
 /*** BIT COUNTING OPERATIONS **********/
-/// Returns `x`, where `2^x` is the largest power of 2 less than or equal to
-/// `num`, or `-1` if `num == 0`.
-static inline int log2inf(const u64 num);
+/// Returns the index of the highest set bit in `num`, or `-1` if `num == 0`
+static inline int highest_set_bit(const u64 num);
 /*** END BIT COUNTING OPERATIONS ******/
 
 /*** HUFFMAN PRIMITIVES ***************/
@@ -1157,7 +1156,7 @@ static void decompress_sequences(frame_context_t *const ctx, istream_t *in,
 
     // "After writing the last bit containing information, the compressor writes
     // a single 1-bit and then fills the byte with 0-7 0 bits of padding."
-    const int padding = 8 - log2inf(src[len - 1]);
+    const int padding = 8 - highest_set_bit(src[len - 1]);
     i64 offset = len * 8 - padding;
 
     // "The bitstream starts with initial state values, each using the required
@@ -1571,20 +1570,20 @@ static void free_dictionary(dictionary_t *const dict) {
 /******* IO STREAM OPERATIONS *************************************************/
 #define UNALIGNED() ERROR("Attempting to operate on a non-byte aligned stream")
 /// Reads `num` bits from a bitstream, and updates the internal offset
-static inline u64 IO_read_bits(istream_t *const in, const int num) {
-    if (num > 64 || num <= 0) {
+static inline u64 IO_read_bits(istream_t *const in, const int num_bits) {
+    if (num_bits > 64 || num_bits <= 0) {
         ERROR("Attempt to read an invalid number of bits");
     }
 
-    const size_t bytes = (num + in->bit_offset + 7) / 8;
-    const size_t full_bytes = (num + in->bit_offset) / 8;
+    const size_t bytes = (num_bits + in->bit_offset + 7) / 8;
+    const size_t full_bytes = (num_bits + in->bit_offset) / 8;
     if (bytes > in->len) {
         INP_SIZE();
     }
 
-    const u64 result = read_bits_LE(in->ptr, num, in->bit_offset);
+    const u64 result = read_bits_LE(in->ptr, num_bits, in->bit_offset);
 
-    in->bit_offset = (num + in->bit_offset) % 8;
+    in->bit_offset = (num_bits + in->bit_offset) % 8;
     in->ptr += full_bytes;
     in->len -= full_bytes;
 
@@ -1593,21 +1592,21 @@ static inline u64 IO_read_bits(istream_t *const in, const int num) {
 
 /// If a non-zero number of bits have been read from the current byte, advance
 /// the offset to the next byte
-static inline void IO_rewind_bits(istream_t *const in, int num) {
-    if (num < 0) {
+static inline void IO_rewind_bits(istream_t *const in, int num_bits) {
+    if (num_bits < 0) {
         ERROR("Attempting to rewind stream by a negative number of bits");
     }
 
-    /* move the offset back by `num` bits */
-    const int new_offset = in->bit_offset - num;
-    /* determine the number of whole bytes we have to rewind, rounding up to an
-     * integer number (e.g. if `new_offset == -5`, `bytes == 1`) */
+    // move the offset back by `num_bits` bits
+    const int new_offset = in->bit_offset - num_bits;
+    // determine the number of whole bytes we have to rewind, rounding up to an
+    // integer number (e.g. if `new_offset == -5`, `bytes == 1`)
     const i64 bytes = -(new_offset - 7) / 8;
 
     in->ptr -= bytes;
     in->len += bytes;
-    /* make sure the resulting `bit_offset` is positive, as mod in C does not
-     * convert numbers from negative to positive (e.g. -22 % 8 == -6) */
+    // make sure the resulting `bit_offset` is positive, as mod in C does not
+    // convert numbers from negative to positive (e.g. -22 % 8 == -6)
     in->bit_offset = ((new_offset % 8) + 8) % 8;
 }
 
@@ -1712,9 +1711,9 @@ static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len) {
 
 /******* BITSTREAM OPERATIONS *************************************************/
 /// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits
-static inline u64 read_bits_LE(const u8 *src, const int num,
+static inline u64 read_bits_LE(const u8 *src, const int num_bits,
                                const size_t offset) {
-    if (num > 64) {
+    if (num_bits > 64) {
         ERROR("Attempt to read an invalid number of bits");
     }
 
@@ -1724,7 +1723,7 @@ static inline u64 read_bits_LE(const u8 *src, const int num,
     u64 res = 0;
 
     int shift = 0;
-    int left = num;
+    int left = num_bits;
     while (left > 0) {
         u64 mask = left >= 8 ? 0xff : (((u64)1 << left) - 1);
         // Dead the next byte, shift it to account for the offset, and then mask
@@ -1766,7 +1765,7 @@ static inline u64 STREAM_read_bits(const u8 *const src, const int bits,
 /******* BIT COUNTING OPERATIONS **********************************************/
 /// Returns `x`, where `2^x` is the largest power of 2 less than or equal to
 /// `num`, or `-1` if `num == 0`.
-static inline int log2inf(const u64 num) {
+static inline int highest_set_bit(const u64 num) {
     for (int i = 63; i >= 0; i--) {
         if (((u64)1 << i) <= num) {
             return i;
@@ -1818,7 +1817,7 @@ static size_t HUF_decompress_1stream(const HUF_dtable *const dtable,
     // final-bit-flag. Consequently, a last byte of 0 is not possible. And the
     // final-bit-flag itself is not part of the useful bitstream. Hence, the
     // last byte contains between 0 and 7 useful bits."
-    const int padding = 8 - log2inf(src[len - 1]);
+    const int padding = 8 - highest_set_bit(src[len - 1]);
 
     i64 offset = len * 8 - padding;
     u16 state;
@@ -1965,7 +1964,7 @@ static void HUF_init_dtable_usingweights(HUF_dtable *const table,
     }
 
     // Find the first power of 2 larger than the sum
-    const int max_bits = log2inf(weight_sum) + 1;
+    const int max_bits = highest_set_bit(weight_sum) + 1;
     const u64 left_over = ((u64)1 << max_bits) - weight_sum;
     // If the left over isn't a power of 2, the weights are invalid
     if (left_over & (left_over - 1)) {
@@ -1974,7 +1973,7 @@ static void HUF_init_dtable_usingweights(HUF_dtable *const table,
 
     // left_over is used to find the last weight as it's not transmitted
     // by inverting 2^(weight - 1) we can determine the value of last_weight
-    const int last_weight = log2inf(left_over) + 1;
+    const int last_weight = highest_set_bit(left_over) + 1;
 
     for (int i = 0; i < num_symbs; i++) {
         // "Number_of_Bits = Number_of_Bits ? Max_Number_of_Bits + 1 - Weight : 0"
@@ -2068,7 +2067,7 @@ static size_t FSE_decompress_interleaved2(const FSE_dtable *const dtable,
     // final-bit-flag. Consequently, a last byte of 0 is not possible. And the
     // final-bit-flag itself is not part of the useful bitstream. Hence, the
     // last byte contains between 0 and 7 useful bits."
-    const int padding = 8 - log2inf(src[len - 1]);
+    const int padding = 8 - highest_set_bit(src[len - 1]);
     i64 offset = len * 8 - padding;
 
     u16 state1, state2;
@@ -2189,7 +2188,7 @@ static void FSE_init_dtable(FSE_dtable *const dtable,
         u16 next_state_desc = state_desc[symbol]++;
         // Fills in the table appropriately, next_state_desc increases by symbol
         // over time, decreasing number of bits
-        dtable->num_bits[i] = (u8)(accuracy_log - log2inf(next_state_desc));
+        dtable->num_bits[i] = (u8)(accuracy_log - highest_set_bit(next_state_desc));
         // Baseline increases until the bit threshold is passed, at which point
         // it resets to 0
         dtable->new_state_base[i] =
@@ -2240,7 +2239,7 @@ static void FSE_decode_header(FSE_dtable *const dtable, istream_t *const in,
     int symb = 0;
     while (remaining > 0 && symb < FSE_MAX_SYMBS) {
         // Log of the number of possible values we could read
-        int bits = log2inf(remaining + 1) + 1;
+        int bits = highest_set_bit(remaining + 1) + 1;
 
         u16 val = IO_read_bits(in, bits);
 

From 35fc66f2571bc125e5d23708fdac259fdb40ac31 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 21 Mar 2017 17:52:42 -0700
Subject: [PATCH 039/255] updated .gitignore for new cmake script

---
 .gitignore             | 11 ++++++-----
 build/cmake/.gitignore |  3 ++-
 2 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/.gitignore b/.gitignore
index e02119883..5fe9afd41 100644
--- a/.gitignore
+++ b/.gitignore
@@ -24,6 +24,12 @@ zstdmt
 tmp*
 dictionary*
 
+# Build artefacts
+projects/
+bin/
+.buckd/
+buck-out/
+
 # Other files
 .directory
 _codelite/
@@ -34,8 +40,3 @@ _zstdbench/
 .DS_Store
 googletest/
 *.d
-
-# Directories
-bin/
-.buckd/
-buck-out/
diff --git a/build/cmake/.gitignore b/build/cmake/.gitignore
index 98f29c79d..ad4283f99 100644
--- a/build/cmake/.gitignore
+++ b/build/cmake/.gitignore
@@ -1,6 +1,7 @@
-# cmake producted
+# cmake artefacts
 CMakeCache.txt
 CMakeFiles
 Makefile
 cmake_install.cmake
 cmake_uninstall.cmake
+*.1

From 741e3e831489266c8174cb157ca59b1f9bafd5bc Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 22 Mar 2017 12:33:08 -0700
Subject: [PATCH 040/255] Add $(FLAGS) when testing for zlib/lzma support.

* If zlib/lzma isn't in the usual spot, it won't be used,
  even if `$CFLAGS` and `$LDFLAGS` add the location it is in.
* Update the test code snippets to not trigger any warnings.
---
 programs/Makefile | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index bb91e069a..5c3fd19e7 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -85,7 +85,7 @@ endif
 # zlib detection
 NO_ZLIB_MSG := ==> no zlib, building zstd without .gz support
 VOID = /dev/null
-HAVE_ZLIB := $(shell printf '\#include <zlib.h>\nint main(){}' | $(CC) -o have_zlib -x c - -lz 2> $(VOID) && rm have_zlib$(EXT) && echo 1 || echo 0)
+HAVE_ZLIB := $(shell printf '\#include <zlib.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_zlib -x c - -lz 2> $(VOID) && rm have_zlib$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_ZLIB), 1)
 ZLIB_MSG := ==> building zstd with .gz compression support
 ZLIBCPP = -DZSTD_GZCOMPRESS -DZSTD_GZDECOMPRESS
@@ -95,7 +95,7 @@ ZLIB_MSG := $(NO_ZLIB_MSG)
 endif
 # lzma detection
 NO_LZMA_MSG := ==> no liblzma, building zstd without .xz/.lzma support
-HAVE_LZMA := $(shell printf '\#include <lzma.h>\nint main(){}' | $(CC) -o have_lzma -x c - -llzma 2> $(VOID) && rm have_lzma$(EXT) && echo 1 || echo 0)
+HAVE_LZMA := $(shell printf '\#include <lzma.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lzma -x c - -llzma 2> $(VOID) && rm have_lzma$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_LZMA), 1)
 LZMA_MSG := ==> building zstd with .xz/.lzma compression support
 LZMACPP = -DZSTD_LZMACOMPRESS -DZSTD_LZMADECOMPRESS

From dfc75f74da75d83c7fa57ab9e8cb187a1b04972c Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 22 Mar 2017 13:24:52 -0700
Subject: [PATCH 041/255] Add $(EXT) to binary to fix zlib detection for some
 MinGW versions

---
 programs/Makefile | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 5c3fd19e7..b8e976b21 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -85,7 +85,7 @@ endif
 # zlib detection
 NO_ZLIB_MSG := ==> no zlib, building zstd without .gz support
 VOID = /dev/null
-HAVE_ZLIB := $(shell printf '\#include <zlib.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_zlib -x c - -lz 2> $(VOID) && rm have_zlib$(EXT) && echo 1 || echo 0)
+HAVE_ZLIB := $(shell printf '\#include <zlib.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_zlib$(EXT) -x c - -lz 2> $(VOID) && rm have_zlib$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_ZLIB), 1)
 ZLIB_MSG := ==> building zstd with .gz compression support
 ZLIBCPP = -DZSTD_GZCOMPRESS -DZSTD_GZDECOMPRESS
@@ -95,7 +95,7 @@ ZLIB_MSG := $(NO_ZLIB_MSG)
 endif
 # lzma detection
 NO_LZMA_MSG := ==> no liblzma, building zstd without .xz/.lzma support
-HAVE_LZMA := $(shell printf '\#include <lzma.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lzma -x c - -llzma 2> $(VOID) && rm have_lzma$(EXT) && echo 1 || echo 0)
+HAVE_LZMA := $(shell printf '\#include <lzma.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lzma$(EXT) -x c - -llzma 2> $(VOID) && rm have_lzma$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_LZMA), 1)
 LZMA_MSG := ==> building zstd with .xz/.lzma compression support
 LZMACPP = -DZSTD_LZMACOMPRESS -DZSTD_LZMADECOMPRESS

From 042ba122ae753dd770db44d8730a6a2dc3bf98df Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 23 Mar 2017 11:13:52 -0700
Subject: [PATCH 042/255] Change g_displayLevel to int and fix DISPLAYUPDATE
 flush

---
 lib/dictBuilder/cover.c           |  2 --
 lib/dictBuilder/zdict.c           |  2 +-
 programs/bench.c                  |  4 +--
 programs/dibio.c                  |  4 +--
 programs/fileio.c                 |  4 +--
 programs/zstdcli.c                | 48 +++++++++++++++----------------
 tests/fuzzer.c                    |  2 +-
 tests/zbufftest.c                 |  2 +-
 tests/zstreamtest.c               |  2 +-
 zlibWrapper/examples/zwrapbench.c |  4 +--
 10 files changed, 36 insertions(+), 38 deletions(-)

diff --git a/lib/dictBuilder/cover.c b/lib/dictBuilder/cover.c
index 3a7b9f39f..1db42f95b 100644
--- a/lib/dictBuilder/cover.c
+++ b/lib/dictBuilder/cover.c
@@ -59,8 +59,6 @@ static int g_displayLevel = 2;
     if ((clock() - g_time > refreshRate) || (displayLevel >= 4)) {             \
       g_time = clock();                                                        \
       DISPLAY(__VA_ARGS__);                                                    \
-      if (displayLevel >= 4)                                                   \
-        fflush(stdout);                                                        \
     }                                                                          \
   }
 #define DISPLAYUPDATE(l, ...) LOCALDISPLAYUPDATE(g_displayLevel, l, __VA_ARGS__)
diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 0757dbbbb..c84195791 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -480,7 +480,7 @@ static size_t ZDICT_trainBuffer(dictItem* dictList, U32 dictListSize,
 #   define DISPLAYUPDATE(l, ...) if (notificationLevel>=l) { \
             if (ZDICT_clockSpan(displayClock) > refreshRate)  \
             { displayClock = clock(); DISPLAY(__VA_ARGS__); \
-            if (notificationLevel>=4) fflush(stdout); } }
+            if (notificationLevel>=4) fflush(stderr); } }
 
     /* init */
     DISPLAYLEVEL(2, "\r%70s\r", "");   /* clean display line */
diff --git a/programs/bench.c b/programs/bench.c
index 2dd1cfb0f..2643dd45a 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -70,12 +70,12 @@ static U32 g_compressibilityDefault = 50;
 ***************************************/
 #define DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
 #define DISPLAYLEVEL(l, ...) if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); }
-static U32 g_displayLevel = 2;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
+static int g_displayLevel = 2;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
 
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((clock() - g_time > refreshRate) || (g_displayLevel>=4)) \
             { g_time = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(stderr); } }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_time = 0;
 
diff --git a/programs/dibio.c b/programs/dibio.c
index 5ef202c8a..b7ed280ea 100644
--- a/programs/dibio.c
+++ b/programs/dibio.c
@@ -53,12 +53,12 @@ static const size_t maxMemory = (sizeof(size_t) == 4) ? (2 GB - 64 MB) : ((size_
 ***************************************/
 #define DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
 #define DISPLAYLEVEL(l, ...) if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); }
-static unsigned g_displayLevel = 0;   /* 0 : no display;   1: errors;   2: default;  4: full information */
+static int g_displayLevel = 0;   /* 0 : no display;   1: errors;   2: default;  4: full information */
 
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((DIB_clockSpan(g_time) > refreshRate) || (g_displayLevel>=4)) \
             { g_time = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(stderr); } }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 2 / 10;
 static clock_t g_time = 0;
 
diff --git a/programs/fileio.c b/programs/fileio.c
index e6481f1fa..572e9c9ac 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -81,13 +81,13 @@
 ***************************************/
 #define DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
 #define DISPLAYLEVEL(l, ...) { if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); } }
-static U32 g_displayLevel = 2;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
+static int g_displayLevel = 2;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
 void FIO_setNotificationLevel(unsigned level) { g_displayLevel=level; }
 
 #define DISPLAYUPDATE(l, ...) { if (g_displayLevel>=l) { \
             if ((clock() - g_time > refreshRate) || (g_displayLevel>=4)) \
             { g_time = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } } }
+            if (g_displayLevel>=4) fflush(stderr); } } }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_time = 0;
 
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index cd53d4c36..29bc76377 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -74,10 +74,10 @@ static U32 g_overlapLog = OVERLAP_LOG_DEFAULT;
 /*-************************************
 *  Display Macros
 **************************************/
-#define DISPLAY(...)           fprintf(displayOut, __VA_ARGS__)
-#define DISPLAYLEVEL(l, ...)   if (displayLevel>=l) { DISPLAY(__VA_ARGS__); }
-static FILE* displayOut;
-static unsigned displayLevel = DEFAULT_DISPLAY_LEVEL;   /* 0 : no display,  1: errors,  2 : + result + interaction + warnings,  3 : + progression,  4 : + information */
+#define DISPLAY(...)         fprintf(g_displayOut, __VA_ARGS__)
+#define DISPLAYLEVEL(l, ...) { if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); } }
+static int g_displayLevel = DEFAULT_DISPLAY_LEVEL;   /* 0 : no display,  1: errors,  2 : + result + interaction + warnings,  3 : + progression,  4 : + information */
+static FILE* g_displayOut;
 
 
 /*-************************************
@@ -167,7 +167,7 @@ static int usage_advanced(const char* programName)
 static int badusage(const char* programName)
 {
     DISPLAYLEVEL(1, "Incorrect parameters\n");
-    if (displayLevel >= 2) usage(programName);
+    if (g_displayLevel >= 2) usage(programName);
     return 1;
 }
 
@@ -316,7 +316,7 @@ int main(int argCount, const char* argv[])
     (void)memLimit;   /* not used when ZSTD_NODECOMPRESS set */
     if (filenameTable==NULL) { DISPLAY("zstd: %s \n", strerror(errno)); exit(1); }
     filenameTable[0] = stdinmark;
-    displayOut = stderr;
+    g_displayOut = stderr;
     /* Pick out program name from path. Don't rely on stdlib because of conflicting behavior */
     {   size_t pos;
         for (pos = (int)strlen(programName); pos > 0; pos--) { if (programName[pos] == '/') { pos++; break; } }
@@ -325,10 +325,10 @@ int main(int argCount, const char* argv[])
 
     /* preset behaviors */
     if (!strcmp(programName, ZSTD_UNZSTD)) operation=zom_decompress;
-    if (!strcmp(programName, ZSTD_CAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; displayLevel=1; }
+    if (!strcmp(programName, ZSTD_CAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }
     if (!strcmp(programName, ZSTD_GZ)) { suffix = GZ_EXTENSION; FIO_setCompressionType(FIO_gzipCompression); FIO_setRemoveSrcFile(1); }    /* behave like gzip */
     if (!strcmp(programName, ZSTD_GUNZIP)) { operation=zom_decompress; FIO_setRemoveSrcFile(1); }                                          /* behave like gunzip */
-    if (!strcmp(programName, ZSTD_GZCAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; displayLevel=1; }  /* behave like gzcat */
+    if (!strcmp(programName, ZSTD_GZCAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }  /* behave like gzcat */
     if (!strcmp(programName, ZSTD_LZMA)) { suffix = LZMA_EXTENSION; FIO_setCompressionType(FIO_lzmaCompression); FIO_setRemoveSrcFile(1); }    /* behave like lzma */
     if (!strcmp(programName, ZSTD_XZ)) { suffix = XZ_EXTENSION; FIO_setCompressionType(FIO_xzCompression); FIO_setRemoveSrcFile(1); }    /* behave like xz */
     memset(&compressionParams, 0, sizeof(compressionParams));
@@ -344,7 +344,7 @@ int main(int argCount, const char* argv[])
                 if (!filenameIdx) {
                     filenameIdx=1, filenameTable[0]=stdinmark;
                     outFileName=stdoutmark;
-                    displayLevel-=(displayLevel==2);
+                    g_displayLevel-=(g_displayLevel==2);
                     continue;
             }   }
 
@@ -358,11 +358,11 @@ int main(int argCount, const char* argv[])
                     if (!strcmp(argument, "--decompress")) { operation=zom_decompress; continue; }
                     if (!strcmp(argument, "--uncompress")) { operation=zom_decompress; continue; }
                     if (!strcmp(argument, "--force")) { FIO_overwriteMode(); continue; }
-                    if (!strcmp(argument, "--version")) { displayOut=stdout; DISPLAY(WELCOME_MESSAGE); CLEAN_RETURN(0); }
-                    if (!strcmp(argument, "--help")) { displayOut=stdout; CLEAN_RETURN(usage_advanced(programName)); }
-                    if (!strcmp(argument, "--verbose")) { displayLevel++; continue; }
-                    if (!strcmp(argument, "--quiet")) { displayLevel--; continue; }
-                    if (!strcmp(argument, "--stdout")) { forceStdout=1; outFileName=stdoutmark; displayLevel-=(displayLevel==2); continue; }
+                    if (!strcmp(argument, "--version")) { g_displayOut=stdout; DISPLAY(WELCOME_MESSAGE); CLEAN_RETURN(0); }
+                    if (!strcmp(argument, "--help")) { g_displayOut=stdout; CLEAN_RETURN(usage_advanced(programName)); }
+                    if (!strcmp(argument, "--verbose")) { g_displayLevel++; continue; }
+                    if (!strcmp(argument, "--quiet")) { g_displayLevel--; continue; }
+                    if (!strcmp(argument, "--stdout")) { forceStdout=1; outFileName=stdoutmark; g_displayLevel-=(g_displayLevel==2); continue; }
                     if (!strcmp(argument, "--ultra")) { ultra=1; continue; }
                     if (!strcmp(argument, "--check")) { FIO_setChecksumFlag(2); continue; }
                     if (!strcmp(argument, "--no-check")) { FIO_setChecksumFlag(0); continue; }
@@ -424,9 +424,9 @@ int main(int argCount, const char* argv[])
                     switch(argument[0])
                     {
                         /* Display help */
-                    case 'V': displayOut=stdout; DISPLAY(WELCOME_MESSAGE); CLEAN_RETURN(0);   /* Version Only */
+                    case 'V': g_displayOut=stdout; DISPLAY(WELCOME_MESSAGE); CLEAN_RETURN(0);   /* Version Only */
                     case 'H':
-                    case 'h': displayOut=stdout; CLEAN_RETURN(usage_advanced(programName));
+                    case 'h': g_displayOut=stdout; CLEAN_RETURN(usage_advanced(programName));
 
                          /* Compress */
                     case 'z': operation=zom_compress; argument++; break;
@@ -448,10 +448,10 @@ int main(int argCount, const char* argv[])
                     case 'f': FIO_overwriteMode(); forceStdout=1; argument++; break;
 
                         /* Verbose mode */
-                    case 'v': displayLevel++; argument++; break;
+                    case 'v': g_displayLevel++; argument++; break;
 
                         /* Quiet mode */
-                    case 'q': displayLevel--; argument++; break;
+                    case 'q': g_displayLevel--; argument++; break;
 
                         /* keep source file (default); for gzip/xz compatibility */
                     case 'k': FIO_setRemoveSrcFile(0); argument++; break;
@@ -597,7 +597,7 @@ int main(int argCount, const char* argv[])
     /* Check if benchmark is selected */
     if (operation==zom_bench) {
 #ifndef ZSTD_NOBENCH
-        BMK_setNotificationLevel(displayLevel);
+        BMK_setNotificationLevel(g_displayLevel);
         BMK_setBlockSize(blockSize);
         BMK_setNbThreads(nbThreads);
         BMK_setNbSeconds(bench_nbSeconds);
@@ -613,7 +613,7 @@ int main(int argCount, const char* argv[])
         if (cover) {
             coverParams.nbThreads = nbThreads;
             coverParams.compressionLevel = dictCLevel;
-            coverParams.notificationLevel = displayLevel;
+            coverParams.notificationLevel = g_displayLevel;
             coverParams.dictID = dictID;
             DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, NULL, &coverParams, cover - 1);
         } else {
@@ -621,7 +621,7 @@ int main(int argCount, const char* argv[])
             memset(&dictParams, 0, sizeof(dictParams));
             dictParams.compressionLevel = dictCLevel;
             dictParams.selectivityLevel = dictSelect;
-            dictParams.notificationLevel = displayLevel;
+            dictParams.notificationLevel = g_displayLevel;
             dictParams.dictID = dictID;
             DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, &dictParams, NULL, 0);
         }
@@ -654,11 +654,11 @@ int main(int argCount, const char* argv[])
 #endif
 
     /* No status message in pipe mode (stdin - stdout) or multi-files mode */
-    if (!strcmp(filenameTable[0], stdinmark) && outFileName && !strcmp(outFileName,stdoutmark) && (displayLevel==2)) displayLevel=1;
-    if ((filenameIdx>1) & (displayLevel==2)) displayLevel=1;
+    if (!strcmp(filenameTable[0], stdinmark) && outFileName && !strcmp(outFileName,stdoutmark) && (g_displayLevel==2)) g_displayLevel=1;
+    if ((filenameIdx>1) & (g_displayLevel==2)) g_displayLevel=1;
 
     /* IO Stream/File */
-    FIO_setNotificationLevel(displayLevel);
+    FIO_setNotificationLevel(g_displayLevel);
     if (operation==zom_compress) {
 #ifndef ZSTD_NOCOMPRESS
         FIO_setNbThreads(nbThreads);
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 1d8be17af..111ca8243 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -57,7 +57,7 @@ static U32 g_displayLevel = 2;
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((FUZ_clockSpan(g_displayClock) > g_refreshRate) || (g_displayLevel>=4)) \
             { g_displayClock = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(stderr); } }
 static const clock_t g_refreshRate = CLOCKS_PER_SEC / 6;
 static clock_t g_displayClock = 0;
 
diff --git a/tests/zbufftest.c b/tests/zbufftest.c
index 14b739233..601aa808d 100644
--- a/tests/zbufftest.c
+++ b/tests/zbufftest.c
@@ -60,7 +60,7 @@ static U32 g_displayLevel = 2;
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((FUZ_GetClockSpan(g_displayClock) > g_refreshRate) || (g_displayLevel>=4)) \
             { g_displayClock = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(stderr); } }
 static const clock_t g_refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_displayClock = 0;
 
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index a03ee9b1f..370859ca9 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -59,7 +59,7 @@ static U32 g_displayLevel = 2;
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((FUZ_GetClockSpan(g_displayClock) > g_refreshRate) || (g_displayLevel>=4)) \
             { g_displayClock = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(stderr); } }
 static const clock_t g_refreshRate = CLOCKS_PER_SEC / 6;
 static clock_t g_displayClock = 0;
 
diff --git a/zlibWrapper/examples/zwrapbench.c b/zlibWrapper/examples/zwrapbench.c
index 23c3ca4da..951c315b8 100644
--- a/zlibWrapper/examples/zwrapbench.c
+++ b/zlibWrapper/examples/zwrapbench.c
@@ -73,13 +73,13 @@ static U32 g_compressibilityDefault = 50;
 #define DEFAULT_DISPLAY_LEVEL 2
 #define DISPLAY(...)         fprintf(displayOut, __VA_ARGS__)
 #define DISPLAYLEVEL(l, ...) if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); }
-static U32 g_displayLevel = DEFAULT_DISPLAY_LEVEL;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
+static int g_displayLevel = DEFAULT_DISPLAY_LEVEL;   /* 0 : no display;   1: errors;   2 : + result + interaction + warnings;   3 : + progression;   4 : + information */
 static FILE* displayOut;
 
 #define DISPLAYUPDATE(l, ...) if (g_displayLevel>=l) { \
             if ((clock() - g_time > refreshRate) || (g_displayLevel>=4)) \
             { g_time = clock(); DISPLAY(__VA_ARGS__); \
-            if (g_displayLevel>=4) fflush(stdout); } }
+            if (g_displayLevel>=4) fflush(displayOut); } }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_time = 0;
 

From 680e4e0953bf7c895165e41098a37c3279870c1f Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 23 Mar 2017 11:52:09 -0700
Subject: [PATCH 043/255] Ignore symbolic links unless --force specified

---
 programs/util.h                   | 41 ++++++++++++++++++++++++-------
 programs/zstd.1                   |  4 +--
 programs/zstd.1.md                |  2 +-
 programs/zstdcli.c                | 21 +++++++++++++---
 tests/playTests.sh                | 13 ++++++++++
 zlibWrapper/examples/zwrapbench.c |  2 +-
 6 files changed, 66 insertions(+), 17 deletions(-)

diff --git a/programs/util.h b/programs/util.h
index 59e19d027..e0b705117 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -1,6 +1,6 @@
 /**
  * util.h - utility functions
- * 
+ *
  * Copyright (c) 2016-present, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
  * All rights reserved.
  *
@@ -228,6 +228,20 @@ UTIL_STATIC U32 UTIL_isDirectory(const char* infilename)
     return 0;
 }
 
+UTIL_STATIC U32 UTIL_isLink(const char* infilename)
+{
+#if defined(_WIN32)
+    /* no symlinks on windows */
+    (void)infilename;
+#else
+    int r;
+    stat_t statbuf;
+    r = lstat(infilename, &statbuf);
+    if (!r && S_ISLNK(statbuf.st_mode)) return 1;
+#endif
+    return 0;
+}
+
 
 UTIL_STATIC U64 UTIL_getFileSize(const char* infilename)
 {
@@ -271,11 +285,10 @@ UTIL_STATIC void *UTIL_realloc(void *ptr, size_t size)
     return NULL;
 }
 
-
 #ifdef _WIN32
 #  define UTIL_HAS_CREATEFILELIST
 
-UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd)
+UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd, int followLinks)
 {
     char* path;
     int dirLength, fnameLength, pathLength, nbFiles = 0;
@@ -311,7 +324,7 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
             if (strcmp (cFile.cFileName, "..") == 0 ||
                 strcmp (cFile.cFileName, ".") == 0) continue;
 
-            nbFiles += UTIL_prepareFileList(path, bufStart, pos, bufEnd);  /* Recursively call "UTIL_prepareFileList" with the new path. */
+            nbFiles += UTIL_prepareFileList(path, bufStart, pos, bufEnd, followLinks);  /* Recursively call "UTIL_prepareFileList" with the new path. */
             if (*bufStart == NULL) { free(path); FindClose(hFile); return 0; }
         }
         else if ((cFile.dwFileAttributes & FILE_ATTRIBUTE_NORMAL) || (cFile.dwFileAttributes & FILE_ATTRIBUTE_ARCHIVE) || (cFile.dwFileAttributes & FILE_ATTRIBUTE_COMPRESSED)) {
@@ -339,7 +352,11 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
 #  include <dirent.h>       /* opendir, readdir */
 #  include <string.h>       /* strerror, memcpy */
 
-UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd)
+static int g_displayLevel;
+#define UTIL_DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
+#define UTIL_DISPLAYLEVEL(l, ...) { if (g_displayLevel>=l) { UTIL_DISPLAY(__VA_ARGS__); } }
+
+UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd, int followLinks)
 {
     DIR *dir;
     struct dirent *entry;
@@ -360,13 +377,19 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
         path = (char*) malloc(dirLength + fnameLength + 2);
         if (!path) { closedir(dir); return 0; }
         memcpy(path, dirName, dirLength);
+
         path[dirLength] = '/';
         memcpy(path+dirLength+1, entry->d_name, fnameLength);
         pathLength = dirLength+1+fnameLength;
         path[pathLength] = 0;
 
+        if (!followLinks && UTIL_isLink(path)) {
+            UTIL_DISPLAYLEVEL(2, "Warning : %s is a symbolic link, ignoring\n", path);
+            continue;
+        }
+
         if (UTIL_isDirectory(path)) {
-            nbFiles += UTIL_prepareFileList(path, bufStart, pos, bufEnd);  /* Recursively call "UTIL_prepareFileList" with the new path. */
+            nbFiles += UTIL_prepareFileList(path, bufStart, pos, bufEnd, followLinks);  /* Recursively call "UTIL_prepareFileList" with the new path. */
             if (*bufStart == NULL) { free(path); closedir(dir); return 0; }
         } else {
             if (*bufStart + *pos + pathLength >= *bufEnd) {
@@ -396,7 +419,7 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
 
 #else
 
-UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd)
+UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd, int followLinks)
 {
     (void)bufStart; (void)bufEnd; (void)pos;
     fprintf(stderr, "Directory %s ignored (compiled without _WIN32 or _POSIX_C_SOURCE)\n", dirName);
@@ -411,7 +434,7 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
  * After finishing usage of the list the structures should be freed with UTIL_freeFileList(params: return value, allocatedBuffer)
  * In case of error UTIL_createFileList returns NULL and UTIL_freeFileList should not be called.
  */
-UTIL_STATIC const char** UTIL_createFileList(const char **inputNames, unsigned inputNamesNb, char** allocatedBuffer, unsigned* allocatedNamesNb)
+UTIL_STATIC const char** UTIL_createFileList(const char **inputNames, unsigned inputNamesNb, char** allocatedBuffer, unsigned* allocatedNamesNb, int followLinks)
 {
     size_t pos;
     unsigned i, nbFiles;
@@ -436,7 +459,7 @@ UTIL_STATIC const char** UTIL_createFileList(const char **inputNames, unsigned i
                 nbFiles++;
             }
         } else {
-            nbFiles += UTIL_prepareFileList(inputNames[i], &buf, &pos, &bufend);
+            nbFiles += UTIL_prepareFileList(inputNames[i], &buf, &pos, &bufend, followLinks);
             if (buf == NULL) return NULL;
     }   }
 
diff --git a/programs/zstd.1 b/programs/zstd.1
index f79b3ce16..02423358d 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -1,5 +1,5 @@
 .
-.TH "ZSTD" "1" "March 2017" "zstd 1.1.4" "User Commands"
+.TH "ZSTD" "1" "March 2017" "zstd 1.1.5" "User Commands"
 .
 .SH "NAME"
 \fBzstd\fR \- zstd, unzstd, zstdcat \- Compress or decompress \.zst files
@@ -110,7 +110,7 @@ save result into \fBfile\fR (only possible with a single INPUT\-FILE)
 .
 .TP
 \fB\-f\fR, \fB\-\-force\fR
-overwrite output without prompting
+overwrite output without prompting, and (de)compress symbolic links
 .
 .TP
 \fB\-c\fR, \fB\-\-stdout\fR
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index bb5b22664..c9ff33276 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -108,7 +108,7 @@ the last one takes effect.
 * `-o file`:
     save result into `file` (only possible with a single INPUT-FILE)
 * `-f`, `--force`:
-    overwrite output without prompting
+    overwrite output without prompting, and (de)compress symbolic links
 * `-c`, `--stdout`:
     force write to standard output, even if it is the console
 * `--[no-]sparse`:
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 29bc76377..38b8394a0 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -99,7 +99,7 @@ static int usage(const char* programName)
 #endif
     DISPLAY( " -D file: use `file` as Dictionary \n");
     DISPLAY( " -o file: result stored into `file` (only if 1 input file) \n");
-    DISPLAY( " -f     : overwrite output without prompting \n");
+    DISPLAY( " -f     : overwrite output without prompting and (de)compress links \n");
     DISPLAY( "--rm    : remove source file(s) after successful de/compression \n");
     DISPLAY( " -k     : preserve source file(s) (default) \n");
     DISPLAY( " -h/-H  : display help/long help and exit\n");
@@ -270,6 +270,7 @@ int main(int argCount, const char* argv[])
 {
     int argNb,
         forceStdout=0,
+        followLinks=0,
         main_pause=0,
         nextEntryIsDictionary=0,
         operationResult=0,
@@ -357,7 +358,7 @@ int main(int argCount, const char* argv[])
                     if (!strcmp(argument, "--compress")) { operation=zom_compress; continue; }
                     if (!strcmp(argument, "--decompress")) { operation=zom_decompress; continue; }
                     if (!strcmp(argument, "--uncompress")) { operation=zom_decompress; continue; }
-                    if (!strcmp(argument, "--force")) { FIO_overwriteMode(); continue; }
+                    if (!strcmp(argument, "--force")) { FIO_overwriteMode(); forceStdout=1; followLinks=1; continue; }
                     if (!strcmp(argument, "--version")) { g_displayOut=stdout; DISPLAY(WELCOME_MESSAGE); CLEAN_RETURN(0); }
                     if (!strcmp(argument, "--help")) { g_displayOut=stdout; CLEAN_RETURN(usage_advanced(programName)); }
                     if (!strcmp(argument, "--verbose")) { g_displayLevel++; continue; }
@@ -445,7 +446,7 @@ int main(int argCount, const char* argv[])
                     case 'D': nextEntryIsDictionary = 1; lastCommand = 1; argument++; break;
 
                         /* Overwrite */
-                    case 'f': FIO_overwriteMode(); forceStdout=1; argument++; break;
+                    case 'f': FIO_overwriteMode(); forceStdout=1; followLinks=1; argument++; break;
 
                         /* Verbose mode */
                     case 'v': g_displayLevel++; argument++; break;
@@ -581,9 +582,21 @@ int main(int argCount, const char* argv[])
     DISPLAYLEVEL(4, "PLATFORM_POSIX_VERSION defined: %ldL\n", (long) PLATFORM_POSIX_VERSION);
 #endif
 
+
+    if (!followLinks) {
+        unsigned u;
+        for (u=0, fileNamesNb=0; u<filenameIdx; u++) {
+            if (UTIL_isLink(filenameTable[u])) {
+                DISPLAYLEVEL(2, "Warning : %s is a symbolic link, ignoring\n", filenameTable[u]);
+            } else {
+                filenameTable[fileNamesNb++] = filenameTable[u];
+            }
+        }
+        filenameIdx = fileNamesNb;
+    }
 #ifdef UTIL_HAS_CREATEFILELIST
     if (recursive) {  /* at this stage, filenameTable is a list of paths, which can contain both files and directories */
-        extendedFileList = UTIL_createFileList(filenameTable, filenameIdx, &fileNamesBuf, &fileNamesNb);
+        extendedFileList = UTIL_createFileList(filenameTable, filenameIdx, &fileNamesBuf, &fileNamesNb, followLinks);
         if (extendedFileList) {
             unsigned u;
             for (u=0; u<fileNamesNb; u++) DISPLAYLEVEL(4, "%u %s\n", u, extendedFileList[u]);
diff --git a/tests/playTests.sh b/tests/playTests.sh
index 38a66d327..e98e0f44e 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -169,6 +169,19 @@ $ECHO "$ECHO foo | $ZSTD > /dev/full"
 $ECHO foo | $ZSTD > /dev/full && die "write error not detected!"
 $ECHO "$ECHO foo | $ZSTD | $ZSTD -d > /dev/full"
 $ECHO foo | $ZSTD | $ZSTD -d > /dev/full && die "write error not detected!"
+
+$ECHO "\n**** symbolic link test **** "
+
+rm -f hello.tmp world.tmp hello.tmp.zst world.tmp.zst
+$ECHO "hello world" > hello.tmp
+ln -s hello.tmp world.tmp
+$ZSTD world.tmp hello.tmp
+ls hello.tmp.zst || die "regular file should have been compressed!"
+ls world.tmp.zst && die "symbolic link should not have been compressed!"
+$ZSTD world.tmp hello.tmp -f
+ls world.tmp.zst || die "symbol link should have been compressed with --force"
+rm -f hello.tmp world.tmp hello.tmp.zst world.tmp.zst
+
 fi
 
 
diff --git a/zlibWrapper/examples/zwrapbench.c b/zlibWrapper/examples/zwrapbench.c
index 951c315b8..1c3391e90 100644
--- a/zlibWrapper/examples/zwrapbench.c
+++ b/zlibWrapper/examples/zwrapbench.c
@@ -982,7 +982,7 @@ int main(int argCount, char** argv)
 
 #ifdef UTIL_HAS_CREATEFILELIST
     if (recursive) {
-        fileNamesTable = UTIL_createFileList(filenameTable, filenameIdx, &fileNamesBuf, &fileNamesNb);
+        fileNamesTable = UTIL_createFileList(filenameTable, filenameIdx, &fileNamesBuf, &fileNamesNb, 1);
         if (fileNamesTable) {
             unsigned u;
             for (u=0; u<fileNamesNb; u++) DISPLAYLEVEL(4, "%u %s\n", u, fileNamesTable[u]);

From dee08caabb1b9139a59a51babf614dc39019c09e Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 23 Mar 2017 12:09:35 -0700
Subject: [PATCH 044/255] Fix displayLevel redefinition issues

---
 programs/util.h    | 8 ++++----
 programs/zstdcli.c | 1 +
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/programs/util.h b/programs/util.h
index e0b705117..9d23cbb8e 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -285,6 +285,10 @@ UTIL_STATIC void *UTIL_realloc(void *ptr, size_t size)
     return NULL;
 }
 
+static int g_utilDisplayLevel;
+#define UTIL_DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
+#define UTIL_DISPLAYLEVEL(l, ...) { if (g_utilDisplayLevel>=l) { UTIL_DISPLAY(__VA_ARGS__); } }
+
 #ifdef _WIN32
 #  define UTIL_HAS_CREATEFILELIST
 
@@ -352,10 +356,6 @@ UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_
 #  include <dirent.h>       /* opendir, readdir */
 #  include <string.h>       /* strerror, memcpy */
 
-static int g_displayLevel;
-#define UTIL_DISPLAY(...)         fprintf(stderr, __VA_ARGS__)
-#define UTIL_DISPLAYLEVEL(l, ...) { if (g_displayLevel>=l) { UTIL_DISPLAY(__VA_ARGS__); } }
-
 UTIL_STATIC int UTIL_prepareFileList(const char *dirName, char** bufStart, size_t* pos, char** bufEnd, int followLinks)
 {
     DIR *dir;
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 38b8394a0..4d7fbb357 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -583,6 +583,7 @@ int main(int argCount, const char* argv[])
 #endif
 
 
+    g_utilDisplayLevel = g_displayLevel;
     if (!followLinks) {
         unsigned u;
         for (u=0, fileNamesNb=0; u<filenameIdx; u++) {

From 793e7bb6ddf0d1a531573ece1e1ce769c1e0dca5 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 23 Mar 2017 12:41:51 -0700
Subject: [PATCH 045/255] Add symbolic link checking to pzstd

---
 contrib/pzstd/Options.cpp | 22 ++++++++++++++++++++--
 1 file changed, 20 insertions(+), 2 deletions(-)

diff --git a/contrib/pzstd/Options.cpp b/contrib/pzstd/Options.cpp
index a0d969393..1f53f2bff 100644
--- a/contrib/pzstd/Options.cpp
+++ b/contrib/pzstd/Options.cpp
@@ -91,7 +91,7 @@ void usage() {
   std::fprintf(stderr, "  -#                     : # compression level (1-%d, default:%d)\n", kMaxNonUltraCompressionLevel, kDefaultCompressionLevel);
   std::fprintf(stderr, "  -d, --decompress       : decompression\n");
   std::fprintf(stderr, "  -o                file : result stored into `file` (only if 1 input file)\n");
-  std::fprintf(stderr, "  -f, --force            : overwrite output without prompting\n");
+  std::fprintf(stderr, "  -f, --force            : overwrite output without prompting, (de)compress links\n");
   std::fprintf(stderr, "      --rm               : remove source file(s) after successful (de)compression\n");
   std::fprintf(stderr, "  -k, --keep             : preserve source file(s) (default)\n");
   std::fprintf(stderr, "  -h, --help             : display help and exit\n");
@@ -121,6 +121,7 @@ Options::Status Options::parse(int argc, const char **argv) {
   bool recursive = false;
   bool ultra = false;
   bool forceStdout = false;
+  bool followLinks = false;
   // Local copy of input files, which are pointers into argv.
   std::vector<const char *> localInputFiles;
   for (int i = 1; i < argc; ++i) {
@@ -255,6 +256,7 @@ Options::Status Options::parse(int argc, const char **argv) {
       case 'f':
         overwrite = true;
         forceStdout = true;
+        followLinks = true;
         break;
       case 't':
         test = true;
@@ -328,13 +330,29 @@ Options::Status Options::parse(int argc, const char **argv) {
     }
   }
 
+  g_utilDisplayLevel = verbosity;
+  // Remove local input files that are symbolic links
+  if (!followLinks) {
+      std::remove_if(localInputFiles.begin(), localInputFiles.end(),
+                     [&](const char *path) {
+                        bool isLink = UTIL_isLink(path);
+                        if (isLink && verbosity >= 2) {
+                            std::fprintf(
+                                    stderr,
+                                    "Warning : %s is symbolic link, ignoring\n",
+                                    path);
+                        }
+                        return isLink;
+                    });
+  }
+
   // Translate input files/directories into files to (de)compress
   if (recursive) {
     char *scratchBuffer = nullptr;
     unsigned numFiles = 0;
     const char **files =
         UTIL_createFileList(localInputFiles.data(), localInputFiles.size(),
-                            &scratchBuffer, &numFiles);
+                            &scratchBuffer, &numFiles, followLinks);
     if (files == nullptr) {
       std::fprintf(stderr, "Error traversing directories\n");
       return Status::Failure;

From 7f67f8dce6acb18d2f8da90435040659ba4cd040 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 23 Mar 2017 14:33:38 -0700
Subject: [PATCH 046/255] Educational decoder polish updates

---
 doc/educational_decoder/zstd_decompress.c | 181 ++++++++++++----------
 1 file changed, 95 insertions(+), 86 deletions(-)

diff --git a/doc/educational_decoder/zstd_decompress.c b/doc/educational_decoder/zstd_decompress.c
index 346cd296a..7c8d8114d 100644
--- a/doc/educational_decoder/zstd_decompress.c
+++ b/doc/educational_decoder/zstd_decompress.c
@@ -27,16 +27,19 @@ size_t ZSTD_decompress_with_dict(void *const dst, const size_t dst_len,
 
 /// Get the decompressed size of an input stream so memory can be allocated in
 /// advance
+/// Returns -1 if the size can't be determined
 size_t ZSTD_get_decompressed_size(const void *const src, const size_t src_len);
 
 /******* UTILITY MACROS AND TYPES *********************************************/
-// Max block size decompressed size is 128 KB and literal blocks must be smaller
-// than that
+// Max block size decompressed size is 128 KB and literal blocks can't be
+// larger than their block
 #define MAX_LITERALS_SIZE ((size_t)128 * 1024)
 
 #define MAX(a, b) ((a) > (b) ? (a) : (b))
 #define MIN(a, b) ((a) < (b) ? (a) : (b))
 
+/// This decoder calls exit(1) when it encounters an error, however a production
+/// library should propagate error codes
 #define ERROR(s)                                                               \
     do {                                                                       \
         fprintf(stderr, "Error: %s\n", s);                                     \
@@ -67,20 +70,22 @@ typedef int64_t i64;
 /// decompression functions.
 
 /*** IO STREAM OPERATIONS *************/
-/// These structs are the interface for IO, and do bounds checking on all
-/// operations.  They should be used opaquely to ensure safety.
 
-/// Output is always done byte-by-byte
+/// ostream_t/istream_t are used to wrap the pointers/length data passed into
+/// ZSTD_decompress, so that all IO operations are safely bounds checked
+/// They are written/read forward, and reads are treated as little-endian
+/// They should be used opaquely to ensure safety
 typedef struct {
     u8 *ptr;
     size_t len;
 } ostream_t;
 
-/// Input often reads a few bits at a time, so maintain an internal offset
 typedef struct {
     const u8 *ptr;
-    int bit_offset;
     size_t len;
+
+    // Input often reads a few bits at a time, so maintain an internal offset
+    int bit_offset;
 } istream_t;
 
 /// The following two functions are the only ones that allow the istream to be
@@ -88,7 +93,7 @@ typedef struct {
 
 /// Reads `num` bits from a bitstream, and updates the internal offset
 static inline u64 IO_read_bits(istream_t *const in, const int num_bits);
-/// Rewinds the stream by `num` bits
+/// Backs-up the stream by `num` bits so they can be read again
 static inline void IO_rewind_bits(istream_t *const in, const int num_bits);
 /// If the remaining bits in a byte will be unused, advance to the end of the
 /// byte
@@ -101,29 +106,30 @@ static inline void IO_write_byte(ostream_t *const out, u8 symb);
 /// be byte aligned.
 static inline size_t IO_istream_len(const istream_t *const in);
 
-/// Returns a pointer where `len` bytes can be read, and advances the internal
-/// state.  The stream must be byte aligned.
+/// Advances the stream by `len` bytes, and returns a pointer to the chunk that
+/// was skipped.  The stream must be byte aligned.
 static inline const u8 *IO_read_bytes(istream_t *const in, size_t len);
-/// Returns a pointer where `len` bytes can be written, and advances the internal
-/// state.  The stream must be byte aligned.
+/// Advances the stream by `len` bytes, and returns a pointer to the chunk that
+/// was skipped so it can be written to.
 static inline u8 *IO_write_bytes(ostream_t *const out, size_t len);
 
 /// Advance the inner state by `len` bytes.  The stream must be byte aligned.
 static inline void IO_advance_input(istream_t *const in, size_t len);
 
-/// Returns an `ostream_t` constructed from the given pointer and length
+/// Returns an `ostream_t` constructed from the given pointer and length.
 static inline ostream_t IO_make_ostream(u8 *out, size_t len);
-/// Returns an `istream_t` constructed from the given pointer and length
+/// Returns an `istream_t` constructed from the given pointer and length.
 static inline istream_t IO_make_istream(const u8 *in, size_t len);
 
-/// Returns an `istream_t` with the same base as `in`, and length `len`
-/// Then, advance `in` to account for the consumed bytes
-/// `in` must be byte aligned
+/// Returns an `istream_t` with the same base as `in`, and length `len`.
+/// Then, advance `in` to account for the consumed bytes.
+/// `in` must be byte aligned.
 static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len);
 /*** END IO STREAM OPERATIONS *********/
 
 /*** BITSTREAM OPERATIONS *************/
-/// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits
+/// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits,
+/// and return them interpreted as a little-endian unsigned integer.
 static inline u64 read_bits_LE(const u8 *src, const int num_bits,
                                const size_t offset);
 
@@ -383,8 +389,8 @@ size_t ZSTD_decompress_with_dict(void *const dst, const size_t dst_len,
         parse_dictionary(&parsed_dict, (const u8 *)dict, dict_len);
     }
 
-    istream_t in = {(const u8 *)src, 0, src_len};
-    ostream_t out = {(u8 *)dst, dst_len};
+    istream_t in = IO_make_istream(src, src_len);
+    ostream_t out = IO_make_ostream(dst, dst_len);
 
     // "A content compressed by Zstandard is transformed into a Zstandard frame.
     // Multiple frames can be appended into a single file or stream. A frame is
@@ -632,6 +638,7 @@ static void frame_context_apply_dict(frame_context_t *const ctx,
         FSE_copy_dtable(&ctx->of_dtable, &dict->of_dtable);
         FSE_copy_dtable(&ctx->ml_dtable, &dict->ml_dtable);
 
+        // Copy the repeated offsets
         memcpy(ctx->previous_offsets, dict->previous_offsets,
                sizeof(ctx->previous_offsets));
     }
@@ -667,7 +674,7 @@ static void decompress_data(frame_context_t *const ctx, ostream_t *const out,
             // number of bytes to read and copy."
             const u8 *const read_ptr = IO_read_bytes(in, block_len);
             u8 *const write_ptr = IO_write_bytes(out, block_len);
-            //
+
             // Copy the raw data into the output
             memcpy(write_ptr, read_ptr, block_len);
 
@@ -681,7 +688,7 @@ static void decompress_data(frame_context_t *const ctx, ostream_t *const out,
             const u8 *const read_ptr = IO_read_bytes(in, 1);
             u8 *const write_ptr = IO_write_bytes(out, block_len);
 
-            // Copy `block_len` copies of `streams->src[0]` to the output
+            // Copy `block_len` copies of `read_ptr[0]` to the output
             memset(write_ptr, read_ptr[0], block_len);
 
             ctx->current_total_output += block_len;
@@ -750,7 +757,7 @@ static size_t decode_literals_compressed(frame_context_t *const ctx,
                                          u8 **const literals,
                                          const int block_type,
                                          const int size_format);
-static void decode_huf_table(istream_t *const in, HUF_dtable *const dtable);
+static void decode_huf_table(HUF_dtable *const dtable, istream_t *const in);
 static void fse_decode_hufweights(ostream_t *weights, istream_t *const in,
                                     int *const num_symbs);
 
@@ -893,12 +900,12 @@ static size_t decode_literals_compressed(frame_context_t *const ctx,
     istream_t huf_stream = IO_make_sub_istream(in, compressed_size);
 
     if (block_type == 2) {
-        // Decode provided Huffman table
+        // Decode the provided Huffman table
         // "This section is only present when Literals_Block_Type type is
         // Compressed_Literals_Block (2)."
 
         HUF_free_dtable(&ctx->literals_dtable);
-        decode_huf_table(&huf_stream, &ctx->literals_dtable);
+        decode_huf_table(&ctx->literals_dtable, &huf_stream);
     } else {
         // If the previous Huffman table is being repeated, ensure it exists
         if (!ctx->literals_dtable.symbols) {
@@ -921,13 +928,13 @@ static size_t decode_literals_compressed(frame_context_t *const ctx,
 }
 
 // Decode the Huffman table description
-static void decode_huf_table(istream_t *const in, HUF_dtable *const dtable) {
-    const u8 header = IO_read_bits(in, 8);
-
+static void decode_huf_table(HUF_dtable *const dtable, istream_t *const in) {
     // "All literal values from zero (included) to last present one (excluded)
     // are represented by Weight with values from 0 to Max_Number_of_Bits."
 
     // "This is a single byte value (0-255), which describes how to decode the list of weights."
+    const u8 header = IO_read_bits(in, 8);
+
     u8 weights[HUF_MAX_SYMBS];
     memset(weights, 0, sizeof(weights));
 
@@ -996,7 +1003,7 @@ typedef struct {
     u16 ll_state;
     u16 of_state;
     u16 ml_state;
-} sequence_state_t;
+} sequence_states_t;
 
 /// Different modes to signal to decode_seq_tables what to do
 typedef enum {
@@ -1051,10 +1058,10 @@ static void decompress_sequences(frame_context_t *const ctx,
                                  istream_t *const in,
                                  sequence_command_t *const sequences,
                                  const size_t num_sequences);
-static sequence_command_t decode_sequence(sequence_state_t *const state,
+static sequence_command_t decode_sequence(sequence_states_t *const state,
                                           const u8 *const src,
                                           i64 *const offset);
-static void decode_seq_table(istream_t *const in, FSE_dtable *const table,
+static void decode_seq_table(FSE_dtable *const table, istream_t *const in,
                                const seq_part_t type, const seq_mode_t mode);
 
 static size_t decode_sequences(frame_context_t *const ctx, istream_t *in,
@@ -1130,34 +1137,33 @@ static void decompress_sequences(frame_context_t *const ctx, istream_t *in,
     // Offsets
     // Match Lengths"
     // Update the tables we have stored in the context
-    decode_seq_table(in, &ctx->ll_dtable, seq_literal_length,
+    decode_seq_table(&ctx->ll_dtable, in, seq_literal_length,
                      (compression_modes >> 6) & 3);
 
-    decode_seq_table(in, &ctx->of_dtable, seq_offset,
+    decode_seq_table(&ctx->of_dtable, in, seq_offset,
                      (compression_modes >> 4) & 3);
 
-    decode_seq_table(in, &ctx->ml_dtable, seq_match_length,
+    decode_seq_table(&ctx->ml_dtable, in, seq_match_length,
                      (compression_modes >> 2) & 3);
 
-    // Check to make sure none of the tables are uninitialized
-    if (!ctx->ll_dtable.symbols || !ctx->of_dtable.symbols ||
-        !ctx->ml_dtable.symbols) {
-        CORRUPTION();
+
+    sequence_states_t states;
+
+    // Initialize the decoding tables
+    {
+        states.ll_table = ctx->ll_dtable;
+        states.of_table = ctx->of_dtable;
+        states.ml_table = ctx->ml_dtable;
     }
 
-    sequence_state_t state;
-    // Copy the context's tables into the local state
-    memcpy(&state.ll_table, &ctx->ll_dtable, sizeof(FSE_dtable));
-    memcpy(&state.of_table, &ctx->of_dtable, sizeof(FSE_dtable));
-    memcpy(&state.ml_table, &ctx->ml_dtable, sizeof(FSE_dtable));
-
-    size_t len = IO_istream_len(in);
+    const size_t len = IO_istream_len(in);
     const u8 *const src = IO_read_bytes(in, len);
 
     // "After writing the last bit containing information, the compressor writes
     // a single 1-bit and then fills the byte with 0-7 0 bits of padding."
     const int padding = 8 - highest_set_bit(src[len - 1]);
-    i64 offset = len * 8 - padding;
+    // The offset starts at the end because FSE streams are read backwards
+    i64 bit_offset = len * 8 - padding;
 
     // "The bitstream starts with initial state values, each using the required
     // number of bits in their respective accuracy, decoded previously from
@@ -1165,24 +1171,22 @@ static void decompress_sequences(frame_context_t *const ctx, istream_t *in,
     //
     // It starts by Literals_Length_State, followed by Offset_State, and finally
     // Match_Length_State."
-    FSE_init_state(&state.ll_table, &state.ll_state, src, &offset);
-    FSE_init_state(&state.of_table, &state.of_state, src, &offset);
-    FSE_init_state(&state.ml_table, &state.ml_state, src, &offset);
+    FSE_init_state(&states.ll_table, &states.ll_state, src, &bit_offset);
+    FSE_init_state(&states.of_table, &states.of_state, src, &bit_offset);
+    FSE_init_state(&states.ml_table, &states.ml_state, src, &bit_offset);
 
     for (size_t i = 0; i < num_sequences; i++) {
         // Decode sequences one by one
-        sequences[i] = decode_sequence(&state, src, &offset);
+        sequences[i] = decode_sequence(&states, src, &bit_offset);
     }
 
-    if (offset != 0) {
+    if (bit_offset != 0) {
         CORRUPTION();
     }
-
-    // Don't free tables so they can be used in the next block
 }
 
 // Decode a single sequence and update the state
-static sequence_command_t decode_sequence(sequence_state_t *const state,
+static sequence_command_t decode_sequence(sequence_states_t *const states,
                                           const u8 *const src,
                                           i64 *const offset) {
     // "Each symbol is a code in its own context, which specifies Baseline and
@@ -1190,9 +1194,9 @@ static sequence_command_t decode_sequence(sequence_state_t *const state,
     // additional bits in the same bitstream."
 
     // Decode symbols, but don't update states
-    const u8 of_code = FSE_peek_symbol(&state->of_table, state->of_state);
-    const u8 ll_code = FSE_peek_symbol(&state->ll_table, state->ll_state);
-    const u8 ml_code = FSE_peek_symbol(&state->ml_table, state->ml_state);
+    const u8 of_code = FSE_peek_symbol(&states->of_table, states->of_state);
+    const u8 ll_code = FSE_peek_symbol(&states->ll_table, states->ll_state);
+    const u8 ml_code = FSE_peek_symbol(&states->ml_table, states->ml_state);
 
     // Offset doesn't need a max value as it's not decoded using a table
     if (ll_code > SEQ_MAX_CODES[seq_literal_length] ||
@@ -1220,17 +1224,18 @@ static sequence_command_t decode_sequence(sequence_state_t *const state,
     // then Offset_State."
     // If the stream is complete don't read bits to update state
     if (*offset != 0) {
-        FSE_update_state(&state->ll_table, &state->ll_state, src, offset);
-        FSE_update_state(&state->ml_table, &state->ml_state, src, offset);
-        FSE_update_state(&state->of_table, &state->of_state, src, offset);
+        FSE_update_state(&states->ll_table, &states->ll_state, src, offset);
+        FSE_update_state(&states->ml_table, &states->ml_state, src, offset);
+        FSE_update_state(&states->of_table, &states->of_state, src, offset);
     }
 
     return seq;
 }
 
 /// Given a sequence part and table mode, decode the FSE distribution
-static void decode_seq_table(istream_t *const in, FSE_dtable *const table,
-                               const seq_part_t type, const seq_mode_t mode) {
+/// Errors if the mode is `seq_repeat` without a pre-existing table in `table`
+static void decode_seq_table(FSE_dtable *const table, istream_t *const in,
+                             const seq_part_t type, const seq_mode_t mode) {
     // Constant arrays indexed by seq_part_t
     const i16 *const default_distributions[] = {SEQ_LITERAL_LENGTH_DEFAULT_DIST,
                                                 SEQ_OFFSET_DEFAULT_DIST,
@@ -1271,12 +1276,17 @@ static void decode_seq_table(istream_t *const in, FSE_dtable *const table,
         // "Repeat_Mode : re-use distribution table from previous compressed
         // block."
         // Nothing to do here, table will be unchanged
+        if (!table->symbols) {
+            // This mode is invalid if we don't already have a table
+            CORRUPTION();
+        }
         break;
     default:
         // Impossible, as mode is from 0-3
         IMPOSSIBLE();
         break;
     }
+
 }
 /******* END SEQUENCE DECODING ************************************************/
 
@@ -1295,6 +1305,8 @@ static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
         const sequence_command_t seq = sequences[i];
 
         {
+            // If the sequence asks for more literals than are left, the
+            // sequence must be corrupted
             if (seq.literal_length > IO_istream_len(&litstream)) {
                 CORRUPTION();
             }
@@ -1335,7 +1347,8 @@ static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
                 // as per the exception listed above
                 offset = idx < 3 ? offset_hist[idx] : offset_hist[0] - 1;
 
-                // If idx == 1 we don't need to modify offset_hist[2]
+                // If idx == 1 we don't need to modify offset_hist[2], since
+                // we're using the second-most recent code
                 if (idx > 1) {
                     offset_hist[2] = offset_hist[1];
                 }
@@ -1343,6 +1356,8 @@ static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
                 offset_hist[0] = offset;
             }
         } else {
+            // When it's not a repeat offset:
+            // "if (Offset_Value > 3) offset = Offset_Value - 3;"
             offset = seq.offset - 3;
 
             // Shift back history
@@ -1390,11 +1405,11 @@ static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
         total_output += seq.match_length;
     }
 
+    // Copy any leftover literals
     {
         size_t len = IO_istream_len(&litstream);
         u8 *const write_ptr = IO_write_bytes(out, len);
         const u8 *const read_ptr = IO_read_bytes(&litstream, len);
-        // Copy any leftover literals
         memcpy(write_ptr, read_ptr, len);
 
         total_output += len;
@@ -1516,10 +1531,10 @@ static void parse_dictionary(dictionary_t *const dict, const u8 *src,
     // recent offsets (instead of using {1,4,8}), stored in order, 4-bytes
     // little-endian each, for a total of 12 bytes. Each recent offset must have
     // a value < dictionary size."
-    decode_huf_table(&in, &dict->literals_dtable);
-    decode_seq_table(&in, &dict->of_dtable, seq_offset, seq_fse);
-    decode_seq_table(&in, &dict->ml_dtable, seq_match_length, seq_fse);
-    decode_seq_table(&in, &dict->ll_dtable, seq_literal_length, seq_fse);
+    decode_huf_table(&dict->literals_dtable, &in);
+    decode_seq_table(&dict->of_dtable, &in, seq_offset, seq_fse);
+    decode_seq_table(&dict->ml_dtable, &in, seq_match_length, seq_fse);
+    decode_seq_table(&dict->ll_dtable, &in, seq_literal_length, seq_fse);
 
     // Read in the previous offset history
     dict->previous_offsets[0] = IO_read_bits(&in, 32);
@@ -1687,25 +1702,18 @@ static inline ostream_t IO_make_ostream(u8 *out, size_t len) {
 
 /// Returns an `istream_t` constructed from the given pointer and length
 static inline istream_t IO_make_istream(const u8 *in, size_t len) {
-    return (istream_t) { in, 0, len };
+    return (istream_t) { in, len, 0 };
 }
 
 /// Returns an `istream_t` with the same base as `in`, and length `len`
 /// Then, advance `in` to account for the consumed bytes
 /// `in` must be byte aligned
 static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len) {
-    if (len > in->len) {
-        INP_SIZE();
-    }
-    if (in->bit_offset != 0) {
-        UNALIGNED();
-    }
-    const istream_t sub = { in->ptr, in->bit_offset, len };
+    // Consume `len` bytes of the parent stream
+    const u8 *const ptr = IO_read_bytes(in, len);
 
-    in->ptr += len;
-    in->len -= len;
-
-    return sub;
+    // Make a substream using the pointer to those `len` bytes
+    return IO_make_istream(ptr, len);
 }
 /******* END IO STREAM OPERATIONS *********************************************/
 
@@ -1726,7 +1734,7 @@ static inline u64 read_bits_LE(const u8 *src, const int num_bits,
     int left = num_bits;
     while (left > 0) {
         u64 mask = left >= 8 ? 0xff : (((u64)1 << left) - 1);
-        // Dead the next byte, shift it to account for the offset, and then mask
+        // Read the next byte, shift it to account for the offset, and then mask
         // out the top part if we don't need all the bits
         res += (((u64)*src++ >> bit_offset) & mask) << shift;
         shift += 8 - bit_offset;
@@ -1819,15 +1827,16 @@ static size_t HUF_decompress_1stream(const HUF_dtable *const dtable,
     // last byte contains between 0 and 7 useful bits."
     const int padding = 8 - highest_set_bit(src[len - 1]);
 
-    i64 offset = len * 8 - padding;
+    // Offset starts at the end because HUF streams are read backwards
+    i64 bit_offset = len * 8 - padding;
     u16 state;
 
-    HUF_init_state(dtable, &state, src, &offset);
+    HUF_init_state(dtable, &state, src, &bit_offset);
 
     size_t symbols_written = 0;
-    while (offset > -dtable->max_bits) {
+    while (bit_offset > -dtable->max_bits) {
         // Iterate over the stream, decoding one symbol at a time
-        IO_write_byte(out, HUF_decode_symbol(dtable, &state, src, &offset));
+        IO_write_byte(out, HUF_decode_symbol(dtable, &state, src, &bit_offset));
         symbols_written++;
     }
     // "The process continues up to reading the required number of symbols per
@@ -1840,7 +1849,7 @@ static size_t HUF_decompress_1stream(const HUF_dtable *const dtable,
     // before the start of `src`
     // Therefore `offset`, the edge to start reading new bits at, should be
     // dtable->max_bits before the start of the stream
-    if (offset != -dtable->max_bits) {
+    if (bit_offset != -dtable->max_bits) {
         CORRUPTION();
     }
 

From bea78e8fc26bd9d46bc2d98a3d9099586c4ad29d Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 22 Mar 2017 18:09:11 -0700
Subject: [PATCH 047/255] limited CDict acceptation criteria to be the same as
 DDict

---
 lib/compress/zstd_compress.c | 55 ++++++++++++++++++------------------
 1 file changed, 28 insertions(+), 27 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 1aab3553f..eecc76950 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2567,18 +2567,15 @@ static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSym
 
 
 /* Dictionary format :
-    Magic == ZSTD_DICT_MAGIC (4 bytes)
-    HUF_writeCTable(256)
-    FSE_writeNCount(off)
-    FSE_writeNCount(ml)
-    FSE_writeNCount(ll)
-    RepOffsets
-    Dictionary content
-*/
-/*! ZSTD_loadDictEntropyStats() :
-    @return : size read from dictionary
-    note : magic number supposed already checked */
-static size_t ZSTD_loadDictEntropyStats(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+ * See :
+ * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
+ */
+/*! ZSTD_loadDictionary() :
+ * @return : size read from dictionary
+ *  note : magic number supposed already checked
+ *         dictSize supposed > 8
+ */
+static size_t ZSTD_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
 {
     const BYTE* dictPtr = (const BYTE*)dict;
     const BYTE* const dictEnd = dictPtr + dictSize;
@@ -2586,7 +2583,11 @@ static size_t ZSTD_loadDictEntropyStats(ZSTD_CCtx* cctx, const void* dict, size_
     unsigned offcodeMaxValue = MaxOff;
     BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
 
-    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dict, dictSize);
+    dictPtr += 4;   /* skip magic number */
+    cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
+    dictPtr += 4;
+
+    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dictPtr, dictEnd-dictPtr);
         if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
         dictPtr += hufHeaderSize;
     }
@@ -2628,15 +2629,20 @@ static size_t ZSTD_loadDictEntropyStats(ZSTD_CCtx* cctx, const void* dict, size_
     cctx->rep[2] = MEM_readLE32(dictPtr+8); if (cctx->rep[2] == 0 || cctx->rep[2] >= dictSize) return ERROR(dictionary_corrupted);
     dictPtr += 12;
 
-    {   U32 offcodeMax = MaxOff;
-        if ((size_t)(dictEnd - dictPtr) <= ((U32)-1) - 128 KB) {
-            U32 const maxOffset = (U32)(dictEnd - dictPtr) + 128 KB; /* The maximum offset that must be supported */
-            /* Calculate minimum offset code required to represent maxOffset */
-            offcodeMax = ZSTD_highbit32(maxOffset);
+    {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
+        U32 offcodeMax = MaxOff;
+        if (dictContentSize <= ((U32)-1) - 128 KB) {
+            U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
+            offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
         }
-        /* Every possible supported offset <= dictContentSize + 128 KB must be representable */
+        /* All offset values <= dictContentSize + 128 KB must be representable */
         CHECK_F (ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
-    }
+        /* All repCodes must be <= dictContentSize and != 0*/
+        {   U32 u;
+            for (u=0; u<3; u++) {
+                if (cctx->rep[u] == 0) return ERROR(dictionary_corrupted);
+                if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
+    }   }   }
 
     cctx->flagStaticTables = 1;
     cctx->flagStaticHufTable = HUF_repeat_valid;
@@ -2652,14 +2658,9 @@ static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* zc, const void* dict, si
     /* dict as pure content */
     if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (zc->forceRawDict))
         return ZSTD_loadDictionaryContent(zc, dict, dictSize);
-    zc->dictID = zc->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32((const char*)dict+4);
 
-    /* known magic number : dict is parsed for entropy stats and content */
-    {   size_t const loadError = ZSTD_loadDictEntropyStats(zc, (const char*)dict+8 /* skip dictHeader */, dictSize-8);
-        size_t const eSize = loadError + 8;
-        if (ZSTD_isError(loadError)) return loadError;
-        return ZSTD_loadDictionaryContent(zc, (const char*)dict+eSize, dictSize-eSize);
-    }
+    /* dict as zstd dictionary */
+    return ZSTD_loadDictionary(zc, dict, dictSize);
 }
 
 /*! ZSTD_compressBegin_internal() :

From f332ece468f2368001c6e593c8f2dade56cadd8e Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 23 Mar 2017 16:24:02 -0700
Subject: [PATCH 048/255] dictBuilder fails to create dictionary on certain
 input

Properly expressed with an error code (see zstd_errors.h)
and a cli return code != 0
---
 lib/common/error_private.c | 1 +
 lib/common/zstd_errors.h   | 1 +
 lib/dictBuilder/zdict.c    | 8 +++++---
 programs/zstdcli.c         | 4 ++--
 tests/playTests.sh         | 5 +++++
 5 files changed, 14 insertions(+), 5 deletions(-)

diff --git a/lib/common/error_private.c b/lib/common/error_private.c
index a0fa1724a..44ae20104 100644
--- a/lib/common/error_private.c
+++ b/lib/common/error_private.c
@@ -37,6 +37,7 @@ const char* ERR_getErrorString(ERR_enum code)
     case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
     case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
     case PREFIX(dictionary_wrong): return "Dictionary mismatch";
+    case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
     case PREFIX(maxCode):
     default: return notErrorCode;
     }
diff --git a/lib/common/zstd_errors.h b/lib/common/zstd_errors.h
index 949dbd0ff..3d579d969 100644
--- a/lib/common/zstd_errors.h
+++ b/lib/common/zstd_errors.h
@@ -57,6 +57,7 @@ typedef enum {
   ZSTD_error_maxSymbolValue_tooSmall,
   ZSTD_error_dictionary_corrupted,
   ZSTD_error_dictionary_wrong,
+  ZSTD_error_dictionaryCreation_failed,
   ZSTD_error_maxCode
 } ZSTD_ErrorCode;
 
diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index c84195791..842167db6 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -62,8 +62,9 @@
 #define MINRATIO 4
 static const int g_compressionLevel_default = 6;
 static const U32 g_selectivity_default = 9;
-static const size_t g_provision_entropySize = 200;
+static const size_t g_provision_entropySize = 192;
 static const size_t g_min_fast_dictContent = 192;
+static const size_t g_dictContentSize_min = 32;
 
 
 /*-*************************************
@@ -929,8 +930,8 @@ size_t ZDICT_trainFromBuffer_unsafe(
 
     /* checks */
     if (!dictList) return ERROR(memory_allocation);
-    if (maxDictSize <= g_provision_entropySize + g_min_fast_dictContent) { free(dictList); return ERROR(dstSize_tooSmall); }
-    if (samplesBuffSize < ZDICT_MIN_SAMPLES_SIZE) { free(dictList); return 0; }   /* not enough source to create dictionary */
+    if (maxDictSize <= g_provision_entropySize + g_min_fast_dictContent) { free(dictList); return ERROR(dstSize_tooSmall); }   /* requested dictionary size is too small */
+    if (samplesBuffSize < ZDICT_MIN_SAMPLES_SIZE) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* not enough source to create dictionary */
 
     /* init */
     ZDICT_initDictItem(dictList);
@@ -963,6 +964,7 @@ size_t ZDICT_trainFromBuffer_unsafe(
 
     /* create dictionary */
     {   U32 dictContentSize = ZDICT_dictSize(dictList);
+        if (dictContentSize < g_dictContentSize_min) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* dictionary content too small */
         if (dictContentSize < targetDictSize/3) {
             DISPLAYLEVEL(2, "!  warning : selected content significantly smaller than requested (%u < %u) \n", dictContentSize, (U32)maxDictSize);
             if (minRep > MINRATIO) {
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 4d7fbb357..281301bd1 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -629,7 +629,7 @@ int main(int argCount, const char* argv[])
             coverParams.compressionLevel = dictCLevel;
             coverParams.notificationLevel = g_displayLevel;
             coverParams.dictID = dictID;
-            DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, NULL, &coverParams, cover - 1);
+            operationResult = DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, NULL, &coverParams, cover - 1);
         } else {
             ZDICT_params_t dictParams;
             memset(&dictParams, 0, sizeof(dictParams));
@@ -637,7 +637,7 @@ int main(int argCount, const char* argv[])
             dictParams.selectivityLevel = dictSelect;
             dictParams.notificationLevel = g_displayLevel;
             dictParams.dictID = dictID;
-            DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, &dictParams, NULL, 0);
+            operationResult = DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, &dictParams, NULL, 0);
         }
 #endif
         goto _end;
diff --git a/tests/playTests.sh b/tests/playTests.sh
index e98e0f44e..897a90155 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -281,6 +281,11 @@ case "$UNAME" in
   *) $MD5SUM -c tmph1 ;;
 esac
 rm -rf dirTestDict
+$ECHO "- dictionary builder on bogus input"
+$ECHO "Hello World" > tmp
+$ZSTD --train -q tmp && die "Dictionary training should fail : not enough input source"
+./datagen -P0 -g10M > tmp
+$ZSTD --train -q tmp && die "Dictionary training should fail : source is pure noise"
 rm tmp*
 
 

From 23776ce29022a68170e4cbea042f5616a4093507 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 23 Mar 2017 17:59:50 -0700
Subject: [PATCH 049/255] fixed ERROR_GENERIC on dstSize_tooSmall

required by users which depends on this error code to size dest buffer
---
 lib/compress/fse_compress.c  | 2 +-
 lib/compress/zstd_compress.c | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/lib/compress/fse_compress.c b/lib/compress/fse_compress.c
index 6708fb9d7..e520e802b 100644
--- a/lib/compress/fse_compress.c
+++ b/lib/compress/fse_compress.c
@@ -291,7 +291,7 @@ static size_t FSE_writeNCount_generic (void* header, size_t headerBufferSize,
 
 size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
 {
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
     if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
 
     if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 1aab3553f..b37425dad 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -653,7 +653,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             if (count[llCodeTable[nbSeq-1]]>1) { count[llCodeTable[nbSeq-1]]--; nbSeq_1--; }
             FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
             { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return ERROR(GENERIC);
+              if (FSE_isError(NCountSize)) return NCountSize;
               op += NCountSize; }
             FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
             LLtype = set_compressed;
@@ -677,7 +677,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             if (count[ofCodeTable[nbSeq-1]]>1) { count[ofCodeTable[nbSeq-1]]--; nbSeq_1--; }
             FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
             { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return ERROR(GENERIC);
+              if (FSE_isError(NCountSize)) return NCountSize;
               op += NCountSize; }
             FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
             Offtype = set_compressed;
@@ -701,7 +701,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             if (count[mlCodeTable[nbSeq-1]]>1) { count[mlCodeTable[nbSeq-1]]--; nbSeq_1--; }
             FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
             { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return ERROR(GENERIC);
+              if (FSE_isError(NCountSize)) return NCountSize;
               op += NCountSize; }
             FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
             MLtype = set_compressed;

From 16a0b10781a62dfbd8ed137d435b5022f389f955 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 24 Mar 2017 12:46:46 -0700
Subject: [PATCH 050/255] fixed ZSTD_loadZstdDictionary()

forgot to add the dictionary content
(tests were not failing, just compressing less).

Also : added size protections when adding dict content
since hc/bt table filling would fail if size < 8
---
 lib/compress/zstd_compress.c | 43 ++++++++++++++++++++----------------
 1 file changed, 24 insertions(+), 19 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index eecc76950..c1ef526b4 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2504,7 +2504,9 @@ size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const
     return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
 }
 
-
+/*! ZSTD_loadDictionaryContent() :
+ *  @return : 0, or an error code
+ */
 static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t srcSize)
 {
     const BYTE* const ip = (const BYTE*) src;
@@ -2534,13 +2536,15 @@ static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t
     case ZSTD_greedy:
     case ZSTD_lazy:
     case ZSTD_lazy2:
-        ZSTD_insertAndFindFirstIndex (zc, iend-HASH_READ_SIZE, zc->params.cParams.searchLength);
+        if (srcSize >= HASH_READ_SIZE)
+            ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->params.cParams.searchLength);
         break;
 
     case ZSTD_btlazy2:
     case ZSTD_btopt:
     case ZSTD_btopt2:
-        ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
+        if (srcSize >= HASH_READ_SIZE)
+            ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
         break;
 
     default:
@@ -2570,12 +2574,12 @@ static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSym
  * See :
  * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
  */
-/*! ZSTD_loadDictionary() :
- * @return : size read from dictionary
- *  note : magic number supposed already checked
- *         dictSize supposed > 8
+/*! ZSTD_loadZstdDictionary() :
+ * @return : 0, or an error code
+ *  assumptions : magic number supposed already checked
+ *                dictSize supposed > 8
  */
-static size_t ZSTD_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
 {
     const BYTE* dictPtr = (const BYTE*)dict;
     const BYTE* const dictEnd = dictPtr + dictSize;
@@ -2624,9 +2628,9 @@ static size_t ZSTD_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dict
     }
 
     if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
-    cctx->rep[0] = MEM_readLE32(dictPtr+0); if (cctx->rep[0] == 0 || cctx->rep[0] >= dictSize) return ERROR(dictionary_corrupted);
-    cctx->rep[1] = MEM_readLE32(dictPtr+4); if (cctx->rep[1] == 0 || cctx->rep[1] >= dictSize) return ERROR(dictionary_corrupted);
-    cctx->rep[2] = MEM_readLE32(dictPtr+8); if (cctx->rep[2] == 0 || cctx->rep[2] >= dictSize) return ERROR(dictionary_corrupted);
+    cctx->rep[0] = MEM_readLE32(dictPtr+0);
+    cctx->rep[1] = MEM_readLE32(dictPtr+4);
+    cctx->rep[2] = MEM_readLE32(dictPtr+8);
     dictPtr += 12;
 
     {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
@@ -2642,25 +2646,26 @@ static size_t ZSTD_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dict
             for (u=0; u<3; u++) {
                 if (cctx->rep[u] == 0) return ERROR(dictionary_corrupted);
                 if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
-    }   }   }
+        }   }
 
-    cctx->flagStaticTables = 1;
-    cctx->flagStaticHufTable = HUF_repeat_valid;
-    return dictPtr - (const BYTE*)dict;
+        cctx->flagStaticTables = 1;
+        cctx->flagStaticHufTable = HUF_repeat_valid;
+        return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
+    }
 }
 
 /** ZSTD_compress_insertDictionary() :
 *   @return : 0, or an error code */
-static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* zc, const void* dict, size_t dictSize)
+static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
 {
     if ((dict==NULL) || (dictSize<=8)) return 0;
 
     /* dict as pure content */
-    if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (zc->forceRawDict))
-        return ZSTD_loadDictionaryContent(zc, dict, dictSize);
+    if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
+        return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
 
     /* dict as zstd dictionary */
-    return ZSTD_loadDictionary(zc, dict, dictSize);
+    return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
 }
 
 /*! ZSTD_compressBegin_internal() :

From 8d2c63980e698f64df7ff16a8f5c8f03f36c0cb8 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Fri, 24 Mar 2017 11:45:02 -0700
Subject: [PATCH 051/255] Statically build and link zlib on appveyor

---
 appveyor.yml | 20 ++++++++++++++------
 1 file changed, 14 insertions(+), 6 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index 7239e2e13..a53bce708 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -11,15 +11,18 @@
       PLATFORM: "x64"
       SCRIPT:   "make allarch && make -C tests test-symbols fullbench-dll fullbench-lib"
       ARTIFACT: "true"
+      BUILD:    "true"
     - COMPILER: "gcc"
       HOST:     "mingw"
       PLATFORM: "x86"
       SCRIPT:   "make lib && make zstd && make -C tests allnothread"
       ARTIFACT: "true"
+      BUILD:    "true"
     - COMPILER: "clang"
       HOST:     "mingw"
       PLATFORM: "x64"
       SCRIPT:   "MOREFLAGS='--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion' make allarch"
+      BUILD:    "true"
 
     - COMPILER: "gcc"
       HOST:     "mingw"
@@ -69,10 +72,19 @@
         SET "PATH=%PATH_MINGW64%;%PATH_ORIGINAL%"
       ) else if [%PLATFORM%]==[x86] (
         SET "PATH=%PATH_MINGW32%;%PATH_ORIGINAL%"
-      ) ) &&
+      ) )
+    )
+  - if [%HOST%]==[mingw] if [%BUILD%]==[true] (
       make -v &&
       sh -c "%COMPILER% -v" &&
-      sh -c "CC=%COMPILER% %SCRIPT%" &&
+      ECHO Building zlib to static link &&
+      SET "CC=%COMPILER%" &&
+      sh -c "cd .. && git clone --depth 1 --branch v1.2.11 https://github.com/madler/zlib" &&
+      sh -c "cd ../zlib && make -f win32/Makefile.gcc libz.a"
+      ECHO Building zstd &&
+      SET "CPPFLAGS=-I../../zlib" &&
+      SET "LDFLAGS=../../zlib/libz.a" &&
+      sh -c "%SCRIPT%" &&
       ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe )
     )
   - if [%HOST%]==[visual] (
@@ -158,10 +170,6 @@
 
 -
   version: 1.0.{build}
-  branches:
-    except:
-    - dev
-    - master
   environment:
     matrix:
     - COMPILER: "gcc"

From 9da3b215ec5d088da3c7a40d1779b076cdd2a26b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 24 Mar 2017 15:02:09 -0700
Subject: [PATCH 052/255] Ensure all limits derived from same constants

Now uses ZDICT_DICTSIZE_MIN and ZDICT_CONTENTSIZE_MIN
from zdict.h.

Also : reduced values to 256 and 128 respectively
---
 lib/dictBuilder/zdict.c | 19 ++++++++-----------
 lib/dictBuilder/zdict.h | 12 ++++++------
 2 files changed, 14 insertions(+), 17 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 842167db6..ed53197ae 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -11,8 +11,9 @@
 /*-**************************************
 *  Tuning parameters
 ****************************************/
+#define MINRATIO 4   /* minimum nb of apparition to be selected in dictionary */
 #define ZDICT_MAX_SAMPLES_SIZE (2000U << 20)
-#define ZDICT_MIN_SAMPLES_SIZE 512
+#define ZDICT_MIN_SAMPLES_SIZE (ZDICT_CONTENTSIZE_MIN * MINRATIO)
 
 
 /*-**************************************
@@ -59,12 +60,8 @@
 
 #define NOISELENGTH 32
 
-#define MINRATIO 4
 static const int g_compressionLevel_default = 6;
 static const U32 g_selectivity_default = 9;
-static const size_t g_provision_entropySize = 192;
-static const size_t g_min_fast_dictContent = 192;
-static const size_t g_dictContentSize_min = 32;
 
 
 /*-*************************************
@@ -930,7 +927,7 @@ size_t ZDICT_trainFromBuffer_unsafe(
 
     /* checks */
     if (!dictList) return ERROR(memory_allocation);
-    if (maxDictSize <= g_provision_entropySize + g_min_fast_dictContent) { free(dictList); return ERROR(dstSize_tooSmall); }   /* requested dictionary size is too small */
+    if (maxDictSize < ZDICT_DICTSIZE_MIN) { free(dictList); return ERROR(dstSize_tooSmall); }   /* requested dictionary size is too small */
     if (samplesBuffSize < ZDICT_MIN_SAMPLES_SIZE) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* not enough source to create dictionary */
 
     /* init */
@@ -964,15 +961,15 @@ size_t ZDICT_trainFromBuffer_unsafe(
 
     /* create dictionary */
     {   U32 dictContentSize = ZDICT_dictSize(dictList);
-        if (dictContentSize < g_dictContentSize_min) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* dictionary content too small */
-        if (dictContentSize < targetDictSize/3) {
+        if (dictContentSize < ZDICT_CONTENTSIZE_MIN) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* dictionary content too small */
+        if (dictContentSize < targetDictSize/4) {
             DISPLAYLEVEL(2, "!  warning : selected content significantly smaller than requested (%u < %u) \n", dictContentSize, (U32)maxDictSize);
+            if (samplesBuffSize < 10 * targetDictSize)
+                DISPLAYLEVEL(2, "!  consider increasing the number of samples (total size : %u MB)\n", (U32)(samplesBuffSize>>20));
             if (minRep > MINRATIO) {
                 DISPLAYLEVEL(2, "!  consider increasing selectivity to produce larger dictionary (-s%u) \n", selectivity+1);
                 DISPLAYLEVEL(2, "!  note : larger dictionaries are not necessarily better, test its efficiency on samples \n");
             }
-            if (samplesBuffSize < 10 * targetDictSize)
-                DISPLAYLEVEL(2, "!  consider increasing the number of samples (total size : %u MB)\n", (U32)(samplesBuffSize>>20));
         }
 
         if ((dictContentSize > targetDictSize*3) && (nbSamples > 2*MINRATIO) && (selectivity>1)) {
@@ -980,7 +977,7 @@ size_t ZDICT_trainFromBuffer_unsafe(
             while ((nbSamples >> proposedSelectivity) <= MINRATIO) { proposedSelectivity--; }
             DISPLAYLEVEL(2, "!  note : calculated dictionary significantly larger than requested (%u > %u) \n", dictContentSize, (U32)maxDictSize);
             DISPLAYLEVEL(2, "!  consider increasing dictionary size, or produce denser dictionary (-s%u) \n", proposedSelectivity);
-            DISPLAYLEVEL(2, "!  always test dictionary efficiency on samples \n");
+            DISPLAYLEVEL(2, "!  always test dictionary efficiency on real samples \n");
         }
 
         /* limit dictionary size */
diff --git a/lib/dictBuilder/zdict.h b/lib/dictBuilder/zdict.h
index 4ead4474f..669b78d08 100644
--- a/lib/dictBuilder/zdict.h
+++ b/lib/dictBuilder/zdict.h
@@ -147,18 +147,18 @@ ZDICTLIB_API size_t COVER_optimizeTrainFromBuffer(void* dictBuffer, size_t dictB
     Samples must be stored concatenated in a flat buffer `samplesBuffer`,
     supplied with an array of sizes `samplesSizes`, providing the size of each sample in order.
 
-    dictContentSize must be > ZDICT_CONTENTSIZE_MIN bytes.
-    maxDictSize must be >= dictContentSize, and must be > ZDICT_DICTSIZE_MIN bytes.
+    dictContentSize must be >= ZDICT_CONTENTSIZE_MIN bytes.
+    maxDictSize must be >= dictContentSize, and must be >= ZDICT_DICTSIZE_MIN bytes.
 
     @return : size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`),
               or an error code, which can be tested by ZDICT_isError().
     note : ZDICT_finalizeDictionary() will push notifications into stderr if instructed to, using notificationLevel>0.
-    note 2 : dictBuffer and customDictContent can overlap
+    note 2 : dictBuffer and dictContent can overlap
 */
-#define ZDICT_CONTENTSIZE_MIN 256
-#define ZDICT_DICTSIZE_MIN    512
+#define ZDICT_CONTENTSIZE_MIN 128
+#define ZDICT_DICTSIZE_MIN    256
 ZDICTLIB_API size_t ZDICT_finalizeDictionary(void* dictBuffer, size_t dictBufferCapacity,
-                                const void* customDictContent, size_t dictContentSize,
+                                const void* dictContent, size_t dictContentSize,
                                 const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
                                 ZDICT_params_t parameters);
 

From 96aa3019b25bfa6c016e935e8f4e7a4944b766d8 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 24 Mar 2017 16:04:29 -0700
Subject: [PATCH 053/255] changed advanced commands --maxdict= and --dictID=

now works with the `=` variant, which is the recommended one.
Old variant `--dictID #` still works, for compatibility with existing scripts.
Long term objective is to remove the old variant..
---
 lib/dictBuilder/zdict.c | 17 ++++++++---------
 programs/zstd.1         |  4 ++--
 programs/zstd.1.md      |  4 ++--
 programs/zstdcli.c      | 14 ++++++++------
 4 files changed, 20 insertions(+), 19 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index ed53197ae..0824b94d1 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -361,11 +361,11 @@ static dictItem ZDICT_analyzePos(
 }
 
 
-/*! ZDICT_checkMerge
-    check if dictItem can be merged, do it if possible
-    @return : id of destination elt, 0 if not merged
-*/
-static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip)
+/*! ZDICT_tryMerge() :
+ *  check if dictItem can be merged, do it if possible
+ *  @return : id of destination elt, 0 if not merged
+ */
+static U32 ZDICT_tryMerge(dictItem* table, dictItem elt, U32 eltNbToSkip)
 {
     const U32 tableSize = table->pos;
     const U32 eltEnd = elt.pos + elt.length;
@@ -426,11 +426,11 @@ static void ZDICT_removeDictItem(dictItem* table, U32 id)
 static void ZDICT_insertDictItem(dictItem* table, U32 maxSize, dictItem elt)
 {
     /* merge if possible */
-    U32 mergeId = ZDICT_checkMerge(table, elt, 0);
+    U32 mergeId = ZDICT_tryMerge(table, elt, 0);
     if (mergeId) {
         U32 newMerge = 1;
         while (newMerge) {
-            newMerge = ZDICT_checkMerge(table, table[mergeId], mergeId);
+            newMerge = ZDICT_tryMerge(table, table[mergeId], mergeId);  /* merge existing elt */
             if (newMerge) ZDICT_removeDictItem(table, mergeId);
             mergeId = newMerge;
         }
@@ -810,7 +810,6 @@ static size_t ZDICT_analyzeEntropy(void*  dstBuffer, size_t maxDstSize,
     MEM_writeLE32(dstPtr+4, repStartValue[1]);
     MEM_writeLE32(dstPtr+8, repStartValue[2]);
 #endif
-    //dstPtr += 12;
     eSize += 12;
 
 _cleanup:
@@ -829,7 +828,7 @@ size_t ZDICT_finalizeDictionary(void* dictBuffer, size_t dictBufferCapacity,
                           ZDICT_params_t params)
 {
     size_t hSize;
-#define HBUFFSIZE 256
+#define HBUFFSIZE 256   /* should prove large enough for all entropy headers */
     BYTE header[HBUFFSIZE];
     int const compressionLevel = (params.compressionLevel <= 0) ? g_compressionLevel_default : params.compressionLevel;
     U32 const notificationLevel = params.notificationLevel;
diff --git a/programs/zstd.1 b/programs/zstd.1
index 02423358d..8b418a0ee 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -168,11 +168,11 @@ use FILEs as training set to create a dictionary\. The training set should conta
 dictionary saved into \fBfile\fR (default: dictionary)
 .
 .TP
-\fB\-\-maxdict #\fR
+\fB\-\-maxdict=#\fR
 limit dictionary to specified size (default : (112640)
 .
 .TP
-\fB\-\-dictID #\fR
+\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
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index c9ff33276..d1161a522 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -157,9 +157,9 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     (for example, 10 MB for a 100 KB dictionary).
 * `-o file`:
     dictionary saved into `file` (default: dictionary)
-* `--maxdict #`:
+* `--maxdict=#`:
     limit dictionary to specified size (default : (112640)
-* `--dictID #`:
+* `--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.
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 281301bd1..a35485085 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -148,9 +148,9 @@ static int usage_advanced(const char* programName)
     DISPLAY( "--cover=k=#,d=# : use the cover algorithm with parameters k and d \n");
     DISPLAY( "--optimize-cover[=steps=#,k=#,d=#] : optimize cover parameters with optional parameters\n");
     DISPLAY( " -o file : `file` is dictionary name (default: %s) \n", g_defaultDictName);
-    DISPLAY( "--maxdict ## : limit dictionary to specified size (default : %u) \n", g_defaultMaxDictSize);
+    DISPLAY( "--maxdict=# : limit dictionary to specified size (default : %u) \n", g_defaultMaxDictSize);
     DISPLAY( " -s#    : dictionary selectivity level (default: %u)\n", g_defaultSelectivityLevel);
-    DISPLAY( "--dictID ## : force dictionary ID to specified value (default: random)\n");
+    DISPLAY( "--dictID=# : force dictionary ID to specified value (default: random)\n");
 #endif
 #ifndef ZSTD_NOBENCH
     DISPLAY( "\n");
@@ -371,8 +371,8 @@ int main(int argCount, const char* argv[])
                     if (!strcmp(argument, "--no-sparse")) { FIO_setSparseWrite(0); continue; }
                     if (!strcmp(argument, "--test")) { operation=zom_test; continue; }
                     if (!strcmp(argument, "--train")) { operation=zom_train; outFileName=g_defaultDictName; continue; }
-                    if (!strcmp(argument, "--maxdict")) { nextArgumentIsMaxDict=1; lastCommand=1; continue; }
-                    if (!strcmp(argument, "--dictID")) { nextArgumentIsDictID=1; lastCommand=1; continue; }
+                    if (!strcmp(argument, "--maxdict")) { nextArgumentIsMaxDict=1; lastCommand=1; continue; }  /* kept available for compatibility with old syntax ; will be removed one day */
+                    if (!strcmp(argument, "--dictID")) { nextArgumentIsDictID=1; lastCommand=1; continue; }  /* kept available for compatibility with old syntax ; will be removed one day */
                     if (!strcmp(argument, "--no-dictID")) { FIO_setDictIDFlag(0); continue; }
                     if (!strcmp(argument, "--keep")) { FIO_setRemoveSrcFile(0); continue; }
                     if (!strcmp(argument, "--rm")) { FIO_setRemoveSrcFile(1); continue; }
@@ -404,6 +404,8 @@ int main(int argCount, const char* argv[])
                     if (longCommandWArg(&argument, "--memory=")) { memLimit = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--memlimit-decompress=")) { memLimit = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--block-size=")) { blockSize = readU32FromChar(&argument); continue; }
+                    if (longCommandWArg(&argument, "--maxdict=")) { maxDictSize = readU32FromChar(&argument); continue; }
+                    if (longCommandWArg(&argument, "--dictID=")) { dictID = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--zstd=")) { if (!parseCompressionParameters(argument, &compressionParams)) CLEAN_RETURN(badusage(programName)); continue; }
                     /* fall-through, will trigger bad_usage() later on */
                 }
@@ -533,14 +535,14 @@ int main(int argCount, const char* argv[])
                 continue;
             }   /* if (argument[0]=='-') */
 
-            if (nextArgumentIsMaxDict) {
+            if (nextArgumentIsMaxDict) {  /* kept available for compatibility with old syntax ; will be removed one day */
                 nextArgumentIsMaxDict = 0;
                 lastCommand = 0;
                 maxDictSize = readU32FromChar(&argument);
                 continue;
             }
 
-            if (nextArgumentIsDictID) {
+            if (nextArgumentIsDictID) {  /* kept available for compatibility with old syntax ; will be removed one day */
                 nextArgumentIsDictID = 0;
                 lastCommand = 0;
                 dictID = readU32FromChar(&argument);

From ef30af843fb6120cb89424ffbe90e184dfd017b2 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Fri, 24 Mar 2017 17:06:09 -0700
Subject: [PATCH 054/255] Ignore extension in command name matching

---
 programs/zstdcli.c | 38 ++++++++++++++++++++++++++------------
 1 file changed, 26 insertions(+), 12 deletions(-)

diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 281301bd1..cd7ea193c 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -179,6 +179,23 @@ static void waitEnter(void)
     (void)unused;
 }
 
+static const char* lastNameFromPath(const char* path)
+{
+    const char* name = path;
+    if (strrchr(name, '/')) name = strrchr(name, '/') + 1;
+    if (strrchr(name, '\\')) name = strrchr(name, '\\') + 1; /* windows */
+    return name;
+}
+
+/*! exeNameMatch() :
+    @return : a non-zero value if exeName matches test, excluding the extension
+   */
+static int exeNameMatch(const char* exeName, const char* test)
+{
+    return !strncmp(exeName, test, strlen(test)) &&
+        (exeName[strlen(test)] == '\0' || exeName[strlen(test)] == '.');
+}
+
 /*! readU32FromChar() :
     @return : unsigned integer value read from input in `char` format
     allows and interprets K, KB, KiB, M, MB and MiB suffix.
@@ -318,20 +335,17 @@ int main(int argCount, const char* argv[])
     if (filenameTable==NULL) { DISPLAY("zstd: %s \n", strerror(errno)); exit(1); }
     filenameTable[0] = stdinmark;
     g_displayOut = stderr;
-    /* Pick out program name from path. Don't rely on stdlib because of conflicting behavior */
-    {   size_t pos;
-        for (pos = (int)strlen(programName); pos > 0; pos--) { if (programName[pos] == '/') { pos++; break; } }
-        programName += pos;
-    }
+
+    programName = lastNameFromPath(programName);
 
     /* preset behaviors */
-    if (!strcmp(programName, ZSTD_UNZSTD)) operation=zom_decompress;
-    if (!strcmp(programName, ZSTD_CAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }
-    if (!strcmp(programName, ZSTD_GZ)) { suffix = GZ_EXTENSION; FIO_setCompressionType(FIO_gzipCompression); FIO_setRemoveSrcFile(1); }    /* behave like gzip */
-    if (!strcmp(programName, ZSTD_GUNZIP)) { operation=zom_decompress; FIO_setRemoveSrcFile(1); }                                          /* behave like gunzip */
-    if (!strcmp(programName, ZSTD_GZCAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }  /* behave like gzcat */
-    if (!strcmp(programName, ZSTD_LZMA)) { suffix = LZMA_EXTENSION; FIO_setCompressionType(FIO_lzmaCompression); FIO_setRemoveSrcFile(1); }    /* behave like lzma */
-    if (!strcmp(programName, ZSTD_XZ)) { suffix = XZ_EXTENSION; FIO_setCompressionType(FIO_xzCompression); FIO_setRemoveSrcFile(1); }    /* behave like xz */
+    if (exeNameMatch(programName, ZSTD_UNZSTD)) operation=zom_decompress;
+    if (exeNameMatch(programName, ZSTD_CAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }
+    if (exeNameMatch(programName, ZSTD_GZ)) { suffix = GZ_EXTENSION; FIO_setCompressionType(FIO_gzipCompression); FIO_setRemoveSrcFile(1); }    /* behave like gzip */
+    if (exeNameMatch(programName, ZSTD_GUNZIP)) { operation=zom_decompress; FIO_setRemoveSrcFile(1); }                                          /* behave like gunzip */
+    if (exeNameMatch(programName, ZSTD_GZCAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }  /* behave like gzcat */
+    if (exeNameMatch(programName, ZSTD_LZMA)) { suffix = LZMA_EXTENSION; FIO_setCompressionType(FIO_lzmaCompression); FIO_setRemoveSrcFile(1); }    /* behave like lzma */
+    if (exeNameMatch(programName, ZSTD_XZ)) { suffix = XZ_EXTENSION; FIO_setCompressionType(FIO_xzCompression); FIO_setRemoveSrcFile(1); }    /* behave like xz */
     memset(&compressionParams, 0, sizeof(compressionParams));
 
     /* command switches */

From d41f707e884f54bd2662b759b2bb96c55f9a12f0 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 24 Mar 2017 17:56:45 -0700
Subject: [PATCH 055/255] minor improvement : remove duplicates with 1 char
 prefix difference

---
 lib/dictBuilder/zdict.c | 38 ++++++++++++++++++++++++++++++++------
 1 file changed, 32 insertions(+), 6 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index ed53197ae..1b3c74f16 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -361,14 +361,28 @@ static dictItem ZDICT_analyzePos(
 }
 
 
+static int isIncluded(const void* in, const void* container, size_t length)
+{
+    const char* const ip = (const char*) in;
+    const char* const into = (const char*) container;
+    size_t u;
+
+    for (u=0; u<length; u++) {
+        if (ip[u] != into[u]) break;
+    }
+
+    return u==length;
+}
+
 /*! ZDICT_checkMerge
     check if dictItem can be merged, do it if possible
     @return : id of destination elt, 0 if not merged
 */
-static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip)
+static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, const void* buffer)
 {
     const U32 tableSize = table->pos;
     const U32 eltEnd = elt.pos + elt.length;
+    const char* const buf = buffer;
 
     /* tail overlap */
     U32 u; for (u=1; u<tableSize; u++) {
@@ -391,6 +405,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip)
     /* front overlap */
     for (u=1; u<tableSize; u++) {
         if (u==eltNbToSkip) continue;
+
         if ((table[u].pos + table[u].length >= elt.pos) && (table[u].pos < elt.pos)) {  /* overlap, existing < new */
             /* append */
             int addedLength = (int)eltEnd - (table[u].pos + table[u].length);
@@ -405,7 +420,18 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip)
                 table[u] = table[u-1], u--;
             table[u] = elt;
             return u;
-    }   }
+        }
+
+        if (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1)) {
+            if (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) {
+                size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
+                table[u].pos = elt.pos;
+                table[u].savings += elt.savings * addedLength / elt.length;
+                table[u].length = MIN(elt.length, table[u].length + 1);
+                return u;
+            }
+        }
+    }
 
     return 0;
 }
@@ -423,14 +449,14 @@ static void ZDICT_removeDictItem(dictItem* table, U32 id)
 }
 
 
-static void ZDICT_insertDictItem(dictItem* table, U32 maxSize, dictItem elt)
+static void ZDICT_insertDictItem(dictItem* table, U32 maxSize, dictItem elt, const void* buffer)
 {
     /* merge if possible */
-    U32 mergeId = ZDICT_checkMerge(table, elt, 0);
+    U32 mergeId = ZDICT_checkMerge(table, elt, 0, buffer);
     if (mergeId) {
         U32 newMerge = 1;
         while (newMerge) {
-            newMerge = ZDICT_checkMerge(table, table[mergeId], mergeId);
+            newMerge = ZDICT_checkMerge(table, table[mergeId], mergeId, buffer);
             if (newMerge) ZDICT_removeDictItem(table, mergeId);
             mergeId = newMerge;
         }
@@ -519,7 +545,7 @@ static size_t ZDICT_trainBuffer(dictItem* dictList, U32 dictListSize,
             if (doneMarks[cursor]) { cursor++; continue; }
             solution = ZDICT_analyzePos(doneMarks, suffix, reverseSuffix[cursor], buffer, minRatio, notificationLevel);
             if (solution.length==0) { cursor++; continue; }
-            ZDICT_insertDictItem(dictList, dictListSize, solution);
+            ZDICT_insertDictItem(dictList, dictListSize, solution, buffer);
             cursor += solution.length;
             DISPLAYUPDATE(2, "\r%4.2f %% \r", (double)cursor / bufferSize * 100);
     }   }

From 4c41d37fcca57130127ca84f89e8cec401d718d0 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 24 Mar 2017 18:36:56 -0700
Subject: [PATCH 056/255] changed test for new syntax

--dictID= and --maxdict=
---
 lib/dictBuilder/zdict.c | 2 +-
 tests/playTests.sh      | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 0824b94d1..6bc42526a 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -427,7 +427,7 @@ static void ZDICT_insertDictItem(dictItem* table, U32 maxSize, dictItem elt)
 {
     /* merge if possible */
     U32 mergeId = ZDICT_tryMerge(table, elt, 0);
-    if (mergeId) {
+    if (mergeId) {  /* recursive : re-merge the newly merged elt */
         U32 newMerge = 1;
         while (newMerge) {
             newMerge = ZDICT_tryMerge(table, table[mergeId], mergeId);  /* merge existing elt */
diff --git a/tests/playTests.sh b/tests/playTests.sh
index 897a90155..5abbb14e3 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -253,12 +253,12 @@ $ECHO "- Create second (different) dictionary "
 $ZSTD --train *.c ../programs/*.c ../programs/*.h -o tmpDictC
 $ZSTD -d tmp.zst -D tmpDictC -fo result && die "wrong dictionary not detected!"
 $ECHO "- Create dictionary with short dictID"
-$ZSTD --train *.c ../programs/*.c --dictID 1 -o tmpDict1
+$ZSTD --train *.c ../programs/*.c --dictID=1 -o tmpDict1
 cmp tmpDict tmpDict1 && die "dictionaries should have different ID !"
 $ECHO "- Create dictionary with wrong dictID parameter order (must fail)"
 $ZSTD --train *.c ../programs/*.c --dictID -o 1 tmpDict1 && die "wrong order : --dictID must be followed by argument "
 $ECHO "- Create dictionary with size limit"
-$ZSTD --train *.c ../programs/*.c -o tmpDict2 --maxdict 4K -v
+$ZSTD --train *.c ../programs/*.c -o tmpDict2 --maxdict=4K -v
 $ECHO "- Create dictionary with wrong parameter order (must fail)"
 $ZSTD --train *.c ../programs/*.c -o tmpDict2 --maxdict -v 4K && die "wrong order : --maxdict must be followed by argument "
 $ECHO "- Compress without dictID"
@@ -303,10 +303,10 @@ $ECHO "- Create second (different) dictionary"
 $ZSTD --train --cover=k=56,d=8 *.c ../programs/*.c ../programs/*.h -o tmpDictC
 $ZSTD -d tmp.zst -D tmpDictC -fo result && die "wrong dictionary not detected!"
 $ECHO "- Create dictionary with short dictID"
-$ZSTD --train --cover=k=46,d=8 *.c ../programs/*.c --dictID 1 -o tmpDict1
+$ZSTD --train --cover=k=46,d=8 *.c ../programs/*.c --dictID=1 -o tmpDict1
 cmp tmpDict tmpDict1 && die "dictionaries should have different ID !"
 $ECHO "- Create dictionary with size limit"
-$ZSTD --train --optimize-cover=steps=8 *.c ../programs/*.c -o tmpDict2 --maxdict 4K
+$ZSTD --train --optimize-cover=steps=8 *.c ../programs/*.c -o tmpDict2 --maxdict=4K
 rm tmp*
 
 

From ecee9f2ef8ec41ad5fa5bf8f23f430d094722e52 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sun, 26 Mar 2017 00:59:14 -0700
Subject: [PATCH 057/255] fixed conversion warnings

---
 lib/dictBuilder/zdict.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 1b3c74f16..955d98aa6 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -382,7 +382,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
 {
     const U32 tableSize = table->pos;
     const U32 eltEnd = elt.pos + elt.length;
-    const char* const buf = buffer;
+    const char* const buf = (const char*) buffer;
 
     /* tail overlap */
     U32 u; for (u=1; u<tableSize; u++) {
@@ -426,7 +426,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
             if (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) {
                 size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
                 table[u].pos = elt.pos;
-                table[u].savings += elt.savings * addedLength / elt.length;
+                table[u].savings += (U32)(elt.savings * addedLength / elt.length);
                 table[u].length = MIN(elt.length, table[u].length + 1);
                 return u;
             }

From 858f72eeb8d3b03722b76238bad61b8fd58bc7c7 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sun, 26 Mar 2017 02:50:00 -0700
Subject: [PATCH 058/255] fixed dictBuilder issue

dictionary loading would fail during entropy analysis
---
 lib/dictBuilder/zdict.c | 51 +++++++++++++++++++----------------------
 1 file changed, 24 insertions(+), 27 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 955d98aa6..0cd9cc88e 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -393,7 +393,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
             table[u].length += addedLength;
             table[u].pos = elt.pos;
             table[u].savings += elt.savings * addedLength / elt.length;   /* rough approx */
-            table[u].savings += elt.length / 8;    /* rough approx bonus */
+            // table[u].savings += elt.length / 8;    /* rough approx bonus */
             elt = table[u];
             /* sort : improve rank */
             while ((u>1) && (table[u-1].savings < elt.savings))
@@ -422,14 +422,13 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
             return u;
         }
 
-        if (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1)) {
-            if (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) {
-                size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
-                table[u].pos = elt.pos;
-                table[u].savings += (U32)(elt.savings * addedLength / elt.length);
-                table[u].length = MIN(elt.length, table[u].length + 1);
-                return u;
-            }
+        if ( (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1))
+            && (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) ) {
+            size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
+            table[u].pos = elt.pos;
+            table[u].savings += (U32)(elt.savings * addedLength / elt.length);
+            table[u].length = MIN(elt.length, table[u].length + 1);
+            return u;
         }
     }
 
@@ -707,19 +706,19 @@ static size_t ZDICT_analyzeEntropy(void*  dstBuffer, size_t maxDstSize,
         goto _cleanup;
     }
     if (offcodeMax>OFFCODE_MAX) { eSize = ERROR(dictionary_wrong); goto _cleanup; }   /* too large dictionary */
-    for (u=0; u<256; u++) countLit[u]=1;   /* any character must be described */
-    for (u=0; u<=offcodeMax; u++) offcodeCount[u]=1;
-    for (u=0; u<=MaxML; u++) matchLengthCount[u]=1;
-    for (u=0; u<=MaxLL; u++) litLengthCount[u]=1;
+    for (u=0; u<256; u++) countLit[u] = 1;   /* any character must be described */
+    for (u=0; u<=offcodeMax; u++) offcodeCount[u] = 1;
+    for (u=0; u<=MaxML; u++) matchLengthCount[u] = 1;
+    for (u=0; u<=MaxLL; u++) litLengthCount[u] = 1;
     memset(repOffset, 0, sizeof(repOffset));
     repOffset[1] = repOffset[4] = repOffset[8] = 1;
     memset(bestRepOffset, 0, sizeof(bestRepOffset));
-    if (compressionLevel==0) compressionLevel=g_compressionLevel_default;
+    if (compressionLevel==0) compressionLevel = g_compressionLevel_default;
     params = ZSTD_getParams(compressionLevel, averageSampleSize, dictBufferSize);
     {   size_t const beginResult = ZSTD_compressBegin_advanced(esr.ref, dictBuffer, dictBufferSize, params, 0);
-            if (ZSTD_isError(beginResult)) {
+        if (ZSTD_isError(beginResult)) {
+            DISPLAYLEVEL(1, "error : ZSTD_compressBegin_advanced() failed : %s \n", ZSTD_getErrorName(beginResult));
             eSize = ERROR(GENERIC);
-            DISPLAYLEVEL(1, "error : ZSTD_compressBegin_advanced failed \n");
             goto _cleanup;
     }   }
 
@@ -901,20 +900,11 @@ size_t ZDICT_addEntropyTablesFromBuffer_advanced(void* dictBuffer, size_t dictCo
                                                  const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
                                                  ZDICT_params_t params)
 {
-    size_t hSize;
     int const compressionLevel = (params.compressionLevel <= 0) ? g_compressionLevel_default : params.compressionLevel;
     U32 const notificationLevel = params.notificationLevel;
+    size_t hSize = 8;
 
-    /* dictionary header */
-    MEM_writeLE32(dictBuffer, ZSTD_DICT_MAGIC);
-    {   U64 const randomID = XXH64((char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize, 0);
-        U32 const compliantID = (randomID % ((1U<<31)-32768)) + 32768;
-        U32 const dictID = params.dictID ? params.dictID : compliantID;
-        MEM_writeLE32((char*)dictBuffer+4, dictID);
-    }
-    hSize = 8;
-
-    /* entropy tables */
+    /* calculate entropy tables */
     DISPLAYLEVEL(2, "\r%70s\r", "");   /* clean display line */
     DISPLAYLEVEL(2, "statistics ... \n");
     {   size_t const eSize = ZDICT_analyzeEntropy((char*)dictBuffer+hSize, dictBufferCapacity-hSize,
@@ -926,6 +916,13 @@ size_t ZDICT_addEntropyTablesFromBuffer_advanced(void* dictBuffer, size_t dictCo
         hSize += eSize;
     }
 
+    /* add dictionary header (after entropy tables) */
+    MEM_writeLE32(dictBuffer, ZSTD_DICT_MAGIC);
+    {   U64 const randomID = XXH64((char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize, 0);
+        U32 const compliantID = (randomID % ((1U<<31)-32768)) + 32768;
+        U32 const dictID = params.dictID ? params.dictID : compliantID;
+        MEM_writeLE32((char*)dictBuffer+4, dictID);
+    }
 
     if (hSize + dictContentSize < dictBufferCapacity)
         memmove((char*)dictBuffer + hSize, (char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize);

From 582760818f2573106dee003d779cafd4f46a7420 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sun, 26 Mar 2017 02:59:13 -0700
Subject: [PATCH 059/255] minor refactor

add const
changed if for easier to add new conditions
---
 lib/dictBuilder/zdict.c | 19 ++++++++++---------
 1 file changed, 10 insertions(+), 9 deletions(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index 0cd9cc88e..2c87084ac 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -389,7 +389,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
         if (u==eltNbToSkip) continue;
         if ((table[u].pos > elt.pos) && (table[u].pos <= eltEnd)) {  /* overlap, existing > new */
             /* append */
-            U32 addedLength = table[u].pos - elt.pos;
+            U32 const addedLength = table[u].pos - elt.pos;
             table[u].length += addedLength;
             table[u].pos = elt.pos;
             table[u].savings += elt.savings * addedLength / elt.length;   /* rough approx */
@@ -408,7 +408,7 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
 
         if ((table[u].pos + table[u].length >= elt.pos) && (table[u].pos < elt.pos)) {  /* overlap, existing < new */
             /* append */
-            int addedLength = (int)eltEnd - (table[u].pos + table[u].length);
+            int const addedLength = (int)eltEnd - (table[u].pos + table[u].length);
             table[u].savings += elt.length / 8;    /* rough approx bonus */
             if (addedLength > 0) {   /* otherwise, elt fully included into existing */
                 table[u].length += addedLength;
@@ -422,13 +422,14 @@ static U32 ZDICT_checkMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, cons
             return u;
         }
 
-        if ( (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1))
-            && (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) ) {
-            size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
-            table[u].pos = elt.pos;
-            table[u].savings += (U32)(elt.savings * addedLength / elt.length);
-            table[u].length = MIN(elt.length, table[u].length + 1);
-            return u;
+        if (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1)) {
+            if (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) {
+                size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
+                table[u].pos = elt.pos;
+                table[u].savings += (U32)(elt.savings * addedLength / elt.length);
+                table[u].length = MIN(elt.length, table[u].length + 1);
+                return u;
+            }
         }
     }
 

From 4cf0093571f2aece4ae6f5d1047d8633323aac95 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sun, 26 Mar 2017 14:51:00 -0700
Subject: [PATCH 060/255] restored bonus rule

---
 lib/dictBuilder/zdict.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index cd2e3a2f5..bee5e059d 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -393,7 +393,7 @@ static U32 ZDICT_tryMerge(dictItem* table, dictItem elt, U32 eltNbToSkip, const
             table[u].length += addedLength;
             table[u].pos = elt.pos;
             table[u].savings += elt.savings * addedLength / elt.length;   /* rough approx */
-            // table[u].savings += elt.length / 8;    /* rough approx bonus */
+            table[u].savings += elt.length / 8;    /* rough approx bonus */
             elt = table[u];
             /* sort : improve rank */
             while ((u>1) && (table[u-1].savings < elt.savings))

From 41fefd573add4e4e92555c978504070b1f1123d1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sun, 26 Mar 2017 23:52:19 -0700
Subject: [PATCH 061/255] Improved speed tests

Better compatibility with Mac OS-X
Force attribution to a selected core # (Linux)
---
 tests/test-zstd-speed.py | 20 +++++++++++++-------
 1 file changed, 13 insertions(+), 7 deletions(-)

diff --git a/tests/test-zstd-speed.py b/tests/test-zstd-speed.py
index 23d4f477c..56108a5ca 100755
--- a/tests/test-zstd-speed.py
+++ b/tests/test-zstd-speed.py
@@ -14,14 +14,15 @@
 # - dir1/zstd and dir2/zstd will be merged in a single results file
 
 import argparse
-import os
+import os           # getloadavg
 import string
 import subprocess
-import time
+import time         # strftime
 import traceback
 import hashlib
+import platform     # system
 
-script_version = 'v1.1.1 (2016-10-28)'
+script_version = 'v1.1.2 (2017-03-26)'
 default_repo_url = 'https://github.com/facebook/zstd.git'
 working_dir_name = 'speedTest'
 working_path = os.getcwd() + '/' + working_dir_name     # /path/to/zstd/tests/speedTest
@@ -152,10 +153,15 @@ def benchmark_and_compare(branch, commit, last_commit, args, executableName, md5
             % (os.getloadavg()[0], args.maxLoadAvg, sleepTime))
         time.sleep(sleepTime)
     start_load = str(os.getloadavg())
-    if args.dictionary:
-        result = execute('programs/%s -rqi5b1e%s -D %s %s' % (executableName, args.lastCLevel, args.dictionary, testFilePath), print_output=True)
+    osType = platform.system()
+    if osType == 'Linux':
+        cpuSelector = "taskset --cpu-list 0"
     else:
-        result = execute('programs/%s -rqi5b1e%s %s' % (executableName, args.lastCLevel, testFilePath), print_output=True)   
+        cpuSelector = ""
+    if args.dictionary:
+        result = execute('%s programs/%s -rqi5b1e%s -D %s %s' % (cpuSelector, executableName, args.lastCLevel, args.dictionary, testFilePath), print_output=True)
+    else:
+        result = execute('%s programs/%s -rqi5b1e%s %s' % (cpuSelector, executableName, args.lastCLevel, testFilePath), print_output=True)
     end_load = str(os.getloadavg())
     linesExpected = args.lastCLevel + 1
     if len(result) != linesExpected:
@@ -291,7 +297,7 @@ if __name__ == '__main__':
         log("ERROR: e-mail senders 'mail' or 'mutt' not found")
         exit(1)
 
-    clang_version = execute("clang -v 2>&1 | grep 'clang version' | sed -e 's:.*version \\([0-9.]*\\).*:\\1:' -e 's:\\.\\([0-9][0-9]\\):\\1:g'", verbose)[0];
+    clang_version = execute("clang -v 2>&1 | grep ' version ' | sed -e 's:.*version \\([0-9.]*\\).*:\\1:' -e 's:\\.\\([0-9][0-9]\\):\\1:g'", verbose)[0];
     gcc_version = execute("gcc -dumpversion", verbose)[0];
 
     if verbose:

From 894bf4971374be233df7e954aabb3b19116c1ac7 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 27 Mar 2017 12:19:30 -0700
Subject: [PATCH 062/255] Fix IS_CONSOLE returning 1 for NUL on windows

---
 programs/platform.h | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/programs/platform.h b/programs/platform.h
index 89a9f6cd4..819bec873 100644
--- a/programs/platform.h
+++ b/programs/platform.h
@@ -100,9 +100,18 @@ extern "C" {
 #if (defined(__linux__) && (PLATFORM_POSIX_VERSION >= 1)) || (PLATFORM_POSIX_VERSION >= 200112L) || defined(__DJGPP__)
 #  include <unistd.h>   /* isatty */
 #  define IS_CONSOLE(stdStream) isatty(fileno(stdStream))
-#elif defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) || defined(__CYGWIN__)
+#elif defined(MSDOS) || defined(OS2) || defined(__CYGWIN__)
 #  include <io.h>       /* _isatty */
 #  define IS_CONSOLE(stdStream) _isatty(_fileno(stdStream))
+#elif defined(WIN32) || defined(_WIN32)
+#  include <io.h>      /* _isatty */
+#  include <windows.h> /* DeviceIoControl, HANDLE, FSCTL_SET_SPARSE */
+#  include <stdio.h>   /* FILE */
+static inline int IS_CONSOLE(FILE* stdStream)
+{
+    DWORD dummy;
+    return _isatty(_fileno(stdStream)) && GetConsoleMode((HANDLE)_get_osfhandle(_fileno(stdStream)), &dummy);
+}
 #else
 #  define IS_CONSOLE(stdStream) 0
 #endif

From efdaf8bb7ca36c80be96226775927b69dfa0cc11 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 27 Mar 2017 12:26:40 -0700
Subject: [PATCH 063/255] Fix inline compile errors

---
 programs/platform.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/programs/platform.h b/programs/platform.h
index 819bec873..ee7819512 100644
--- a/programs/platform.h
+++ b/programs/platform.h
@@ -107,7 +107,7 @@ extern "C" {
 #  include <io.h>      /* _isatty */
 #  include <windows.h> /* DeviceIoControl, HANDLE, FSCTL_SET_SPARSE */
 #  include <stdio.h>   /* FILE */
-static inline int IS_CONSOLE(FILE* stdStream)
+static __inline int IS_CONSOLE(FILE* stdStream)
 {
     DWORD dummy;
     return _isatty(_fileno(stdStream)) && GetConsoleMode((HANDLE)_get_osfhandle(_fileno(stdStream)), &dummy);

From 4708394bdd22530da32601eddd906b645f63961c Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 29 Mar 2017 11:46:57 -0700
Subject: [PATCH 064/255] Remove extra 'F' from skippable magic mask

---
 lib/decompress/zstd_decompress.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/decompress/zstd_decompress.c b/lib/decompress/zstd_decompress.c
index 65e6eda70..06337dbd5 100644
--- a/lib/decompress/zstd_decompress.c
+++ b/lib/decompress/zstd_decompress.c
@@ -1476,7 +1476,7 @@ size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
     if (ZSTD_isLegacy(src, srcSize)) return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
 #endif
     if (srcSize >= ZSTD_skippableHeaderSize &&
-            (MEM_readLE32(src) & 0xFFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+            (MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
         return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + 4);
     } else {
         const BYTE* ip = (const BYTE*)src;

From 5bde4be5a19aa9c08a389d4becd45b40731b252d Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 12:10:38 -0700
Subject: [PATCH 065/255] fix : bench automatically adapts parameters to
 srcSize

---
 programs/bench.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/bench.c b/programs/bench.c
index 2643dd45a..d0dac497a 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -156,7 +156,7 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                         ZSTD_compressionParameters *comprParams)
 {
     size_t const blockSize = ((g_blockSize>=32 && !g_decodeOnly) ? g_blockSize : srcSize) + (!srcSize) /* avoid div by 0 */ ;
-    size_t const avgSize = MIN(g_blockSize, (srcSize / nbFiles));
+    size_t const avgSize = MIN(blockSize, (srcSize / nbFiles));
     U32 const maxNbBlocks = (U32) ((srcSize + (blockSize-1)) / blockSize) + nbFiles;
     blockParam_t* const blockTable = (blockParam_t*) malloc(maxNbBlocks * sizeof(blockParam_t));
     size_t const maxCompressedSize = ZSTD_compressBound(srcSize) + (maxNbBlocks * 1024);   /* add some room for safety */
@@ -179,7 +179,7 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
     if (strlen(displayName)>17) displayName += strlen(displayName)-17;   /* can only display 17 characters */
     UTIL_initTimer(&ticksPerSecond);
 
-    if (g_decodeOnly) {
+    if (g_decodeOnly) {  /* benchmark only decompression : source must be already compressed */
         const char* srcPtr = (const char*) srcBuffer;
         U64 dSize64 = 0;
         U32 fileNb;

From fcc55ccae44e3c2101cb7d5febb56374f2db47e5 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 29 Mar 2017 13:08:10 -0700
Subject: [PATCH 066/255] Build windows releases on appveyor as artifacts

---
 appveyor.yml | 17 ++++++++++++-----
 1 file changed, 12 insertions(+), 5 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index a53bce708..7e06cfdfe 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -57,10 +57,10 @@
   - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
   - SET PATH_ORIGINAL=%PATH%
   - if [%HOST%]==[mingw] (
-      SET "PATH_MINGW32=C:\MinGW\bin;C:\MinGW\usr\bin" &&
-      SET "PATH_MINGW64=C:\msys64\mingw64\bin;C:\msys64\usr\bin" &&
-      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
-      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
+      SET "PATH_MINGW32=C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin" &&
+      SET "PATH_MINGW64=C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin" &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin\make.exe &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin\make.exe
     )
   - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] (
       SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;"
@@ -85,7 +85,14 @@
       SET "CPPFLAGS=-I../../zlib" &&
       SET "LDFLAGS=../../zlib/libz.a" &&
       sh -c "%SCRIPT%" &&
-      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe )
+      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe ) &&
+      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true]
+          lib\dll\example\build_package.bat &&
+          make -C programs DEBUGFLAGS= clean zstdmt &&
+          cp programs\zstd.exe bin\zstdmt.exe &&
+          cd bin\ && 7z a -tzip zstd-win-release-%PLATFORM%.zip * &&
+          appveyor PushArtifact zstd-win-release-%PLATFORM%.zip
+      )
     )
   - if [%HOST%]==[visual] (
       ECHO *** &&

From 933ce4a1dd101b8e4d8df2e17d52e232be945e12 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 14:32:15 -0700
Subject: [PATCH 067/255] fix : minmatch 7 conversion

minmatch 7 now converted to minmatch 6 for strategies which do not support 7
Used to folded into "default", which applied minmatch 4
---
 lib/compress/zstd_compress.c | 22 +++++++++++++---------
 lib/compress/zstd_opt.h      |  2 ++
 2 files changed, 15 insertions(+), 9 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index f8e3de3fb..bc88baee4 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -962,7 +962,7 @@ static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
 {
     switch(mls)
     {
-    default:
+    default: /* includes case 3 */
     case 4: return ZSTD_hash4Ptr(p, hBits);
     case 5: return ZSTD_hash5Ptr(p, hBits);
     case 6: return ZSTD_hash6Ptr(p, hBits);
@@ -1085,7 +1085,7 @@ static void ZSTD_compressBlock_fast(ZSTD_CCtx* ctx,
     const U32 mls = ctx->params.cParams.searchLength;
     switch(mls)
     {
-    default:
+    default: /* includes case 3 */
     case 4 :
         ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
     case 5 :
@@ -1199,7 +1199,7 @@ static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
     U32 const mls = ctx->params.cParams.searchLength;
     switch(mls)
     {
-    default:
+    default: /* includes case 3 */
     case 4 :
         ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
     case 5 :
@@ -1353,7 +1353,7 @@ static void ZSTD_compressBlock_doubleFast(ZSTD_CCtx* ctx, const void* src, size_
     const U32 mls = ctx->params.cParams.searchLength;
     switch(mls)
     {
-    default:
+    default: /* includes case 3 */
     case 4 :
         ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
     case 5 :
@@ -1503,7 +1503,7 @@ static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx,
     U32 const mls = ctx->params.cParams.searchLength;
     switch(mls)
     {
-    default:
+    default: /* includes case 3 */
     case 4 :
         ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
     case 5 :
@@ -1733,9 +1733,10 @@ static size_t ZSTD_BtFindBestMatch_selectMLS (
 {
     switch(matchLengthSearch)
     {
-    default :
+    default : /* includes case 3 */
     case 4 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
     case 5 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+    case 7 :
     case 6 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
     }
 }
@@ -1772,9 +1773,10 @@ static size_t ZSTD_BtFindBestMatch_selectMLS_extDict (
 {
     switch(matchLengthSearch)
     {
-    default :
+    default : /* includes case 3 */
     case 4 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
     case 5 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+    case 7 :
     case 6 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
     }
 }
@@ -1868,9 +1870,10 @@ FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS (
 {
     switch(matchLengthSearch)
     {
-    default :
+    default : /* includes case 3 */
     case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
     case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
+    case 7 :
     case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
     }
 }
@@ -1884,9 +1887,10 @@ FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
 {
     switch(matchLengthSearch)
     {
-    default :
+    default : /* includes case 3 */
     case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
     case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
+    case 7 :
     case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
     }
 }
diff --git a/lib/compress/zstd_opt.h b/lib/compress/zstd_opt.h
index ac418b61c..61cdc912a 100644
--- a/lib/compress/zstd_opt.h
+++ b/lib/compress/zstd_opt.h
@@ -360,6 +360,7 @@ static U32 ZSTD_BtGetAllMatches_selectMLS (
     default :
     case 4 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
     case 5 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+    case 7 :
     case 6 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
     }
 }
@@ -387,6 +388,7 @@ static U32 ZSTD_BtGetAllMatches_selectMLS_extDict (
     default :
     case 4 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
     case 5 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+    case 7 :
     case 6 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
     }
 }

From dd79c5c9e874f575b98ee5b5a3e947f63b475168 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 29 Mar 2017 14:40:11 -0700
Subject: [PATCH 068/255] Make pzstd and cmake use gcc/g++

---
 appveyor.yml | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/appveyor.yml b/appveyor.yml
index 7e06cfdfe..81f76926e 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -147,6 +147,8 @@
 
   test_script:
   - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION%
+  - SET "CC=gcc"
+  - SET "CXX=g++"
   - if [%TEST%]==[cmake] (
       mkdir build\cmake\build &&
       cd build\cmake\build &&

From 2e2e78de47934963d7723ce821043c3a8ad84a32 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 16:02:47 -0700
Subject: [PATCH 069/255] removed unnecessary restriction on minmatchLength

it's now transparently translated to nearest value when unsupported
(7->6) (3->4)
---
 doc/zstd_manual.html         | 4 ++--
 lib/compress/zstd_compress.c | 7 +++----
 2 files changed, 5 insertions(+), 6 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 204f56ea5..a66f0a49c 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -1,10 +1,10 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>zstd 1.1.4 Manual</title>
+<title>zstd 1.1.5 Manual</title>
 </head>
 <body>
-<h1>zstd 1.1.4 Manual</h1>
+<h1>zstd 1.1.5 Manual</h1>
 <hr>
 <a name="Contents"></a><h2>Contents</h2>
 <ol>
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index bc88baee4..27b11b8ef 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -150,9 +150,7 @@ size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
     CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
     CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
     CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-    { U32 const searchLengthMin = ((cParams.strategy == ZSTD_fast) | (cParams.strategy == ZSTD_greedy)) ? ZSTD_SEARCHLENGTH_MIN+1 : ZSTD_SEARCHLENGTH_MIN;
-      U32 const searchLengthMax = (cParams.strategy == ZSTD_fast) ? ZSTD_SEARCHLENGTH_MAX : ZSTD_SEARCHLENGTH_MAX-1;
-      CLAMPCHECK(cParams.searchLength, searchLengthMin, searchLengthMax); }
+    CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
     CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
     if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2) return ERROR(compressionParameter_unsupported);
     return 0;
@@ -962,7 +960,8 @@ static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
 {
     switch(mls)
     {
-    default: /* includes case 3 */
+    //case 3: return ZSTD_hash3Ptr(p, hBits);
+    default:
     case 4: return ZSTD_hash4Ptr(p, hBits);
     case 5: return ZSTD_hash5Ptr(p, hBits);
     case 6: return ZSTD_hash6Ptr(p, hBits);

From 0ef680370798f368f4e7eb2121101cf4b1edcb48 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 16:58:57 -0700
Subject: [PATCH 070/255] added ZSTD_getFrameContentSize() to ZSTDMT unit test
 in fuzzer

Now tests fail, because ZSTDMT_compress() doesn't fill frame content size correctly.
---
 tests/fuzzer.c | 55 +++++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 54 insertions(+), 1 deletion(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 111ca8243..9d8121806 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -28,6 +28,7 @@
 #define ZSTD_STATIC_LINKING_ONLY   /* ZSTD_compressContinue, ZSTD_compressBlock */
 #include "zstd.h"         /* ZSTD_VERSION_STRING */
 #include "zstd_errors.h"  /* ZSTD_getErrorCode */
+#include "zstdmt_compress.h"
 #define ZDICT_STATIC_LINKING_ONLY
 #include "zdict.h"        /* ZDICT_trainFromBuffer */
 #include "datagen.h"      /* RDG_genBuffer */
@@ -133,13 +134,21 @@ static int basicUnitTests(U32 seed, double compressibility)
         DISPLAYLEVEL(4, "OK : %s \n", errorString);
     }
 
+
     DISPLAYLEVEL(4, "test%3i : compress %u bytes : ", testNb++, (U32)CNBuffSize);
     CHECKPLUS(r, ZSTD_compress(compressedBuffer, ZSTD_compressBound(CNBuffSize),
                                CNBuffer, CNBuffSize, 1),
               cSize=r );
     DISPLAYLEVEL(4, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBuffSize*100);
 
-    DISPLAYLEVEL(4, "test%3i : decompressed size test : ", testNb++);
+
+    DISPLAYLEVEL(4, "test%3i : ZSTD_getFrameContentSize test : ", testNb++);
+    {   unsigned long long const rSize = ZSTD_getFrameContentSize(compressedBuffer, cSize);
+        if (rSize != CNBuffSize) goto _output_error;
+    }
+    DISPLAYLEVEL(4, "OK \n");
+
+    DISPLAYLEVEL(4, "test%3i : ZSTD_findDecompressedSize test : ", testNb++);
     {   unsigned long long const rSize = ZSTD_findDecompressedSize(compressedBuffer, cSize);
         if (rSize != CNBuffSize) goto _output_error;
     }
@@ -157,6 +166,7 @@ static int basicUnitTests(U32 seed, double compressibility)
     }   }
     DISPLAYLEVEL(4, "OK \n");
 
+
     DISPLAYLEVEL(4, "test%3i : decompress with null dict : ", testNb++);
     { size_t const r = ZSTD_decompress_usingDict(dctx, decodedBuffer, CNBuffSize, compressedBuffer, cSize, NULL, 0);
       if (r != CNBuffSize) goto _output_error; }
@@ -179,6 +189,49 @@ static int basicUnitTests(U32 seed, double compressibility)
       if (ZSTD_getErrorCode(r) != ZSTD_error_srcSize_wrong) goto _output_error; }
     DISPLAYLEVEL(4, "OK \n");
 
+
+    /* ZSTDMT Multi-threading test */
+    DISPLAYLEVEL(4, "test%3i : create ZSTDMT CCtx : ", testNb++);
+    {   ZSTDMT_CCtx* mtctx = ZSTDMT_createCCtx(2);
+        if (mtctx==NULL) {
+            DISPLAY("mtctx : mot enough memory, aborting \n");
+            testResult = 1;
+            goto _end;
+        }
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : compress %u bytes with 2 threads : ", testNb++, (U32)CNBuffSize);
+        CHECKPLUS(r, ZSTDMT_compressCCtx(mtctx,
+                                compressedBuffer, ZSTD_compressBound(CNBuffSize),
+                                CNBuffer, CNBuffSize,
+                                1),
+                  cSize=r );
+        DISPLAYLEVEL(4, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBuffSize*100);
+
+        DISPLAYLEVEL(4, "test%3i : decompressed size test : ", testNb++);
+        {   unsigned long long const rSize = ZSTD_getFrameContentSize(compressedBuffer, cSize);
+            if (rSize != CNBuffSize)  {
+                DISPLAY("ZSTD_getFrameContentSize incorrect : %u != %u \n", (U32)rSize, (U32)CNBuffSize);
+                goto _output_error;
+        }   }
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : decompress %u bytes : ", testNb++, (U32)CNBuffSize);
+        { size_t const r = ZSTD_decompress(decodedBuffer, CNBuffSize, compressedBuffer, cSize);
+          if (r != CNBuffSize) goto _output_error; }
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : check decompressed result : ", testNb++);
+        {   size_t u;
+            for (u=0; u<CNBuffSize; u++) {
+                if (((BYTE*)decodedBuffer)[u] != ((BYTE*)CNBuffer)[u]) goto _output_error;;
+        }   }
+        DISPLAYLEVEL(4, "OK \n");
+
+        ZSTDMT_freeCCtx(mtctx);
+    }
+
+
     /* Simple API multiframe test */
     DISPLAYLEVEL(4, "test%3i : compress multiple frames : ", testNb++);
     {   size_t off = 0;

From 1e1e26f2acd9aac3fd6b51cd55e9b07d3562211c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 17:09:59 -0700
Subject: [PATCH 071/255] fixed #634 : ZSTDMT_compressCCtx() doesn't provide
 frame content size in header

---
 tests/fuzzer.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 9d8121806..fed875843 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -190,7 +190,7 @@ static int basicUnitTests(U32 seed, double compressibility)
     DISPLAYLEVEL(4, "OK \n");
 
 
-    /* ZSTDMT Multi-threading test */
+    /* ZSTDMT simple MT compression test */
     DISPLAYLEVEL(4, "test%3i : create ZSTDMT CCtx : ", testNb++);
     {   ZSTDMT_CCtx* mtctx = ZSTDMT_createCCtx(2);
         if (mtctx==NULL) {

From ca5a8bbe360db56f7d24326854dbefce7fe03b86 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 17:15:27 -0700
Subject: [PATCH 072/255] re-added patch ...

---
 lib/compress/zstdmt_compress.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 45514a81a..90f79509b 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -33,7 +33,7 @@
 #  include <stdio.h>
 #  include <unistd.h>
 #  include <sys/times.h>
-   static unsigned g_debugLevel = 3;
+   static unsigned g_debugLevel = 2;
 #  define DEBUGLOGRAW(l, ...) if (l<=g_debugLevel) { fprintf(stderr, __VA_ARGS__); }
 #  define DEBUGLOG(l, ...) if (l<=g_debugLevel) { fprintf(stderr, __FILE__ ": "); fprintf(stderr, __VA_ARGS__); fprintf(stderr, " \n"); }
 
@@ -235,7 +235,7 @@ void ZSTDMT_compressChunk(void* jobDescription)
         if (ZSTD_isError(initError)) { job->cSize = initError; goto _endJob; }
     } else {  /* srcStart points at reloaded section */
         size_t const dictModeError = ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceRawDict, 1);  /* Force loading dictionary in "content-only" mode (no header analysis) */
-        size_t const initError = ZSTD_compressBegin_advanced(job->cctx, job->srcStart, job->dictSize, job->params, 0);
+        size_t const initError = ZSTD_compressBegin_advanced(job->cctx, job->srcStart, job->dictSize, job->params, job->fullFrameSize);
         if (ZSTD_isError(initError) || ZSTD_isError(dictModeError)) { job->cSize = initError; goto _endJob; }
         ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceWindow, 1);
     }

From 5152fb2cb26d9d7cf1269d20c8bf29ab5403a44c Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 29 Mar 2017 18:51:58 -0700
Subject: [PATCH 073/255] Convert all tabs to spaces

---
 lib/common/bitstream.h       |  4 ++--
 lib/common/mem.h             |  2 +-
 lib/compress/fse_compress.c  | 16 +++++++-------
 lib/compress/zstd_compress.c |  8 +++----
 lib/compress/zstd_opt.h      |  8 +++----
 lib/dictBuilder/zdict.c      |  8 +++----
 lib/legacy/zstd_v01.c        |  2 +-
 lib/legacy/zstd_v02.c        | 42 ++++++++++++++++++------------------
 lib/legacy/zstd_v03.c        | 40 +++++++++++++++++-----------------
 lib/legacy/zstd_v04.c        |  8 +++----
 lib/legacy/zstd_v05.c        |  4 ++--
 lib/legacy/zstd_v06.c        |  4 ++--
 programs/util.h              | 10 ++++-----
 tests/fullbench.c            |  4 ++--
 14 files changed, 80 insertions(+), 80 deletions(-)

diff --git a/lib/common/bitstream.h b/lib/common/bitstream.h
index d3873002e..0e3d2fc55 100644
--- a/lib/common/bitstream.h
+++ b/lib/common/bitstream.h
@@ -376,8 +376,8 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
               if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
-		return BIT_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
+        return BIT_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
         bitD->ptr -= bitD->bitsConsumed >> 3;
diff --git a/lib/common/mem.h b/lib/common/mem.h
index 3cacd216a..f049d181b 100644
--- a/lib/common/mem.h
+++ b/lib/common/mem.h
@@ -122,7 +122,7 @@ MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
 /* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
 /* currently only defined for gcc and icc */
 #if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
-	__pragma( pack(push, 1) )
+    __pragma( pack(push, 1) )
     typedef union { U16 u16; U32 u32; U64 u64; size_t st; } unalign;
     __pragma( pack(pop) )
 #else
diff --git a/lib/compress/fse_compress.c b/lib/compress/fse_compress.c
index e520e802b..13654d6e6 100644
--- a/lib/compress/fse_compress.c
+++ b/lib/compress/fse_compress.c
@@ -476,20 +476,20 @@ void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
 /* provides the minimum logSize to safely represent a distribution */
 static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
 {
-	U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
-	U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
-	U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
-	return minBits;
+    U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
+    U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
+    U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
+    return minBits;
 }
 
 unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
 {
-	U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
+    U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
     U32 tableLog = maxTableLog;
-	U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
+    U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
     if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
-	if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
-	if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
+    if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
+    if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
     if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
     if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
     return tableLog;
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 27b11b8ef..c31f8db91 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -1461,8 +1461,8 @@ static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx* ctx,
 
         if (ip <= ilimit) {
             /* Fill Table */
-			hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
-			hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
+            hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
+            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
             hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
             hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
             /* check immediate repcode */
@@ -1587,7 +1587,7 @@ static U32 ZSTD_insertBt1(ZSTD_CCtx* zc, const BYTE* const ip, const U32 mls, co
             match = dictBase + matchIndex;
             matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
             if (matchIndex+matchLength >= dictLimit)
-				match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
         }
 
         if (matchLength > bestLength) {
@@ -1666,7 +1666,7 @@ static size_t ZSTD_insertBtAndFindBestMatch (
             match = dictBase + matchIndex;
             matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
             if (matchIndex+matchLength >= dictLimit)
-				match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
         }
 
         if (matchLength > bestLength) {
diff --git a/lib/compress/zstd_opt.h b/lib/compress/zstd_opt.h
index 61cdc912a..543761191 100644
--- a/lib/compress/zstd_opt.h
+++ b/lib/compress/zstd_opt.h
@@ -175,10 +175,10 @@ MEM_STATIC void ZSTD_updatePrice(seqStore_t* seqStorePtr, U32 litLength, const B
     }
 
     /* match offset */
-	{   BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
-		seqStorePtr->offCodeSum++;
-		seqStorePtr->offCodeFreq[offCode]++;
-	}
+    {   BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
+        seqStorePtr->offCodeSum++;
+        seqStorePtr->offCodeFreq[offCode]++;
+    }
 
     /* match Length */
     {   const BYTE ML_deltaCode = 36;
diff --git a/lib/dictBuilder/zdict.c b/lib/dictBuilder/zdict.c
index bee5e059d..179e02eff 100644
--- a/lib/dictBuilder/zdict.c
+++ b/lib/dictBuilder/zdict.c
@@ -306,10 +306,10 @@ static dictItem ZDICT_analyzePos(
         /* look backward */
         length = MINMATCHLENGTH;
         while ((length >= MINMATCHLENGTH) & (start > 0)) {
-        	length = ZDICT_count(b + pos, b + suffix[start - 1]);
-        	if (length >= LLIMIT) length = LLIMIT - 1;
-        	lengthList[length]++;
-        	if (length >= MINMATCHLENGTH) start--;
+            length = ZDICT_count(b + pos, b + suffix[start - 1]);
+            if (length >= LLIMIT) length = LLIMIT - 1;
+            lengthList[length]++;
+            if (length >= MINMATCHLENGTH) start--;
         }
 
         /* largest useful length */
diff --git a/lib/legacy/zstd_v01.c b/lib/legacy/zstd_v01.c
index bcacb8d5d..cf5354d6a 100644
--- a/lib/legacy/zstd_v01.c
+++ b/lib/legacy/zstd_v01.c
@@ -1432,7 +1432,7 @@ typedef struct ZSTD_Cctx_s
 #else
     U32 hashTable[HASH_TABLESIZE];
 #endif
-	BYTE buffer[WORKPLACESIZE];
+    BYTE buffer[WORKPLACESIZE];
 } cctxi_t;
 
 
diff --git a/lib/legacy/zstd_v02.c b/lib/legacy/zstd_v02.c
index 2297b28c8..3cf8f4778 100644
--- a/lib/legacy/zstd_v02.c
+++ b/lib/legacy/zstd_v02.c
@@ -475,8 +475,8 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
 
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-		return BIT_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
+        return BIT_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
     {
@@ -1334,8 +1334,8 @@ static size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsi
                 else
                 {
                     bitCount -= (int)(8 * (iend - 4 - ip));
-					ip = iend - 4;
-				}
+                    ip = iend - 4;
+                }
                 bitStream = MEM_readLE32(ip) >> (bitCount & 31);
             }
         }
@@ -2040,7 +2040,7 @@ static size_t HUF_readDTableX4 (U32* DTable, const void* src, size_t srcSize)
         rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
     }
 
-	/* Build rankVal */
+    /* Build rankVal */
     {
         const U32 minBits = tableLog+1 - maxW;
         U32 nextRankVal = 0;
@@ -2374,7 +2374,7 @@ static size_t HUF_readDTableX6 (U32* DTable, const void* src, size_t srcSize)
         rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
     }
 
-	/* Build rankVal */
+    /* Build rankVal */
     {
         const U32 minBits = tableLog+1 - maxW;
         U32 nextRankVal = 0;
@@ -2948,14 +2948,14 @@ static size_t ZSTD_decodeLiteralsBlock(void* ctx,
             const size_t litSize = (MEM_readLE32(istart) & 0xFFFFFF) >> 2;   /* no buffer issue : srcSize >= MIN_CBLOCK_SIZE */
             if (litSize > srcSize-11)   /* risk of reading too far with wildcopy */
             {
-				if (litSize > srcSize-3) return ERROR(corruption_detected);
-				memcpy(dctx->litBuffer, istart, litSize);
-				dctx->litPtr = dctx->litBuffer;
-				dctx->litSize = litSize;
-				memset(dctx->litBuffer + dctx->litSize, 0, 8);
-				return litSize+3;
-			}
-			/* direct reference into compressed stream */
+                if (litSize > srcSize-3) return ERROR(corruption_detected);
+                memcpy(dctx->litBuffer, istart, litSize);
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                memset(dctx->litBuffer + dctx->litSize, 0, 8);
+                return litSize+3;
+            }
+            /* direct reference into compressed stream */
             dctx->litPtr = istart+3;
             dctx->litSize = litSize;
             return litSize+3;
@@ -3515,13 +3515,13 @@ static size_t ZSTD_decompressContinue(ZSTD_DCtx* ctx, void* dst, size_t maxDstSi
 
 unsigned ZSTDv02_isError(size_t code)
 {
-	return ZSTD_isError(code);
+    return ZSTD_isError(code);
 }
 
 size_t ZSTDv02_decompress( void* dst, size_t maxOriginalSize,
                      const void* src, size_t compressedSize)
 {
-	return ZSTD_decompress(dst, maxOriginalSize, src, compressedSize);
+    return ZSTD_decompress(dst, maxOriginalSize, src, compressedSize);
 }
 
 size_t ZSTDv02_findFrameCompressedSize(const void *src, size_t compressedSize)
@@ -3531,25 +3531,25 @@ size_t ZSTDv02_findFrameCompressedSize(const void *src, size_t compressedSize)
 
 ZSTDv02_Dctx* ZSTDv02_createDCtx(void)
 {
-	return (ZSTDv02_Dctx*)ZSTD_createDCtx();
+    return (ZSTDv02_Dctx*)ZSTD_createDCtx();
 }
 
 size_t ZSTDv02_freeDCtx(ZSTDv02_Dctx* dctx)
 {
-	return ZSTD_freeDCtx((ZSTD_DCtx*)dctx);
+    return ZSTD_freeDCtx((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv02_resetDCtx(ZSTDv02_Dctx* dctx)
 {
-	return ZSTD_resetDCtx((ZSTD_DCtx*)dctx);
+    return ZSTD_resetDCtx((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv02_nextSrcSizeToDecompress(ZSTDv02_Dctx* dctx)
 {
-	return ZSTD_nextSrcSizeToDecompress((ZSTD_DCtx*)dctx);
+    return ZSTD_nextSrcSizeToDecompress((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv02_decompressContinue(ZSTDv02_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
 {
-	return ZSTD_decompressContinue((ZSTD_DCtx*)dctx, dst, maxDstSize, src, srcSize);
+    return ZSTD_decompressContinue((ZSTD_DCtx*)dctx, dst, maxDstSize, src, srcSize);
 }
diff --git a/lib/legacy/zstd_v03.c b/lib/legacy/zstd_v03.c
index ef654931f..f438330a4 100644
--- a/lib/legacy/zstd_v03.c
+++ b/lib/legacy/zstd_v03.c
@@ -477,8 +477,8 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
 
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-		return BIT_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
+        return BIT_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
     {
@@ -1335,8 +1335,8 @@ static size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsi
                 else
                 {
                     bitCount -= (int)(8 * (iend - 4 - ip));
-					ip = iend - 4;
-				}
+                    ip = iend - 4;
+                }
                 bitStream = MEM_readLE32(ip) >> (bitCount & 31);
             }
         }
@@ -2037,7 +2037,7 @@ static size_t HUF_readDTableX4 (U32* DTable, const void* src, size_t srcSize)
         rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
     }
 
-	/* Build rankVal */
+    /* Build rankVal */
     {
         const U32 minBits = tableLog+1 - maxW;
         U32 nextRankVal = 0;
@@ -2589,14 +2589,14 @@ static size_t ZSTD_decodeLiteralsBlock(void* ctx,
             const size_t litSize = (MEM_readLE32(istart) & 0xFFFFFF) >> 2;   /* no buffer issue : srcSize >= MIN_CBLOCK_SIZE */
             if (litSize > srcSize-11)   /* risk of reading too far with wildcopy */
             {
-				if (litSize > srcSize-3) return ERROR(corruption_detected);
-				memcpy(dctx->litBuffer, istart, litSize);
-				dctx->litPtr = dctx->litBuffer;
-				dctx->litSize = litSize;
-				memset(dctx->litBuffer + dctx->litSize, 0, 8);
-				return litSize+3;
-			}
-			/* direct reference into compressed stream */
+                if (litSize > srcSize-3) return ERROR(corruption_detected);
+                memcpy(dctx->litBuffer, istart, litSize);
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                memset(dctx->litBuffer + dctx->litSize, 0, 8);
+                return litSize+3;
+            }
+            /* direct reference into compressed stream */
             dctx->litPtr = istart+3;
             dctx->litSize = litSize;
             return litSize+3;
@@ -3156,13 +3156,13 @@ static size_t ZSTD_decompressContinue(ZSTD_DCtx* ctx, void* dst, size_t maxDstSi
 
 unsigned ZSTDv03_isError(size_t code)
 {
-	return ZSTD_isError(code);
+    return ZSTD_isError(code);
 }
 
 size_t ZSTDv03_decompress( void* dst, size_t maxOriginalSize,
                      const void* src, size_t compressedSize)
 {
-	return ZSTD_decompress(dst, maxOriginalSize, src, compressedSize);
+    return ZSTD_decompress(dst, maxOriginalSize, src, compressedSize);
 }
 
 size_t ZSTDv03_findFrameCompressedSize(const void* src, size_t srcSize)
@@ -3172,25 +3172,25 @@ size_t ZSTDv03_findFrameCompressedSize(const void* src, size_t srcSize)
 
 ZSTDv03_Dctx* ZSTDv03_createDCtx(void)
 {
-	return (ZSTDv03_Dctx*)ZSTD_createDCtx();
+    return (ZSTDv03_Dctx*)ZSTD_createDCtx();
 }
 
 size_t ZSTDv03_freeDCtx(ZSTDv03_Dctx* dctx)
 {
-	return ZSTD_freeDCtx((ZSTD_DCtx*)dctx);
+    return ZSTD_freeDCtx((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv03_resetDCtx(ZSTDv03_Dctx* dctx)
 {
-	return ZSTD_resetDCtx((ZSTD_DCtx*)dctx);
+    return ZSTD_resetDCtx((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv03_nextSrcSizeToDecompress(ZSTDv03_Dctx* dctx)
 {
-	return ZSTD_nextSrcSizeToDecompress((ZSTD_DCtx*)dctx);
+    return ZSTD_nextSrcSizeToDecompress((ZSTD_DCtx*)dctx);
 }
 
 size_t ZSTDv03_decompressContinue(ZSTDv03_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
 {
-	return ZSTD_decompressContinue((ZSTD_DCtx*)dctx, dst, maxDstSize, src, srcSize);
+    return ZSTD_decompressContinue((ZSTD_DCtx*)dctx, dst, maxDstSize, src, srcSize);
 }
diff --git a/lib/legacy/zstd_v04.c b/lib/legacy/zstd_v04.c
index 09040e68e..1a29da92d 100644
--- a/lib/legacy/zstd_v04.c
+++ b/lib/legacy/zstd_v04.c
@@ -882,8 +882,8 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
 
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-		return BIT_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
+        return BIT_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
     {
@@ -1451,8 +1451,8 @@ static size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsi
                 else
                 {
                     bitCount -= (int)(8 * (iend - 4 - ip));
-					ip = iend - 4;
-				}
+                    ip = iend - 4;
+                }
                 bitStream = MEM_readLE32(ip) >> (bitCount & 31);
             }
         }
diff --git a/lib/legacy/zstd_v05.c b/lib/legacy/zstd_v05.c
index a6f5f5dbb..674f5b0e4 100644
--- a/lib/legacy/zstd_v05.c
+++ b/lib/legacy/zstd_v05.c
@@ -884,8 +884,8 @@ MEM_STATIC size_t BITv05_readBitsFast(BITv05_DStream_t* bitD, U32 nbBits)
 
 MEM_STATIC BITv05_DStream_status BITv05_reloadDStream(BITv05_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-		return BITv05_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
+        return BITv05_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
         bitD->ptr -= bitD->bitsConsumed >> 3;
diff --git a/lib/legacy/zstd_v06.c b/lib/legacy/zstd_v06.c
index a4258b67a..ad8c4cd31 100644
--- a/lib/legacy/zstd_v06.c
+++ b/lib/legacy/zstd_v06.c
@@ -982,8 +982,8 @@ MEM_STATIC size_t BITv06_readBitsFast(BITv06_DStream_t* bitD, U32 nbBits)
               if status == unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
 MEM_STATIC BITv06_DStream_status BITv06_reloadDStream(BITv06_DStream_t* bitD)
 {
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-		return BITv06_DStream_overflow;
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
+        return BITv06_DStream_overflow;
 
     if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
         bitD->ptr -= bitD->bitsConsumed >> 3;
diff --git a/programs/util.h b/programs/util.h
index 9d23cbb8e..9992d79da 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -166,8 +166,8 @@ UTIL_STATIC void UTIL_waitForNextTick(UTIL_freq_t ticksPerSecond)
 *  File functions
 ******************************************/
 #if defined(_MSC_VER)
-	#define chmod _chmod
-	typedef struct __stat64 stat_t;
+    #define chmod _chmod
+    typedef struct __stat64 stat_t;
 #else
     typedef struct stat stat_t;
 #endif
@@ -178,9 +178,9 @@ UTIL_STATIC int UTIL_setFileStat(const char *filename, stat_t *statbuf)
     int res = 0;
     struct utimbuf timebuf;
 
-	timebuf.actime = time(NULL);
-	timebuf.modtime = statbuf->st_mtime;
-	res += utime(filename, &timebuf);  /* set access and modification times */
+    timebuf.actime = time(NULL);
+    timebuf.modtime = statbuf->st_mtime;
+    res += utime(filename, &timebuf);  /* set access and modification times */
 
 #if !defined(_WIN32)
     res += chown(filename, statbuf->st_uid, statbuf->st_gid);  /* Copy ownership */
diff --git a/tests/fullbench.c b/tests/fullbench.c
index 940d315a7..38cf22fa7 100644
--- a/tests/fullbench.c
+++ b/tests/fullbench.c
@@ -251,14 +251,14 @@ static size_t benchMem(const void* src, size_t srcSize, U32 benchNb)
     case 13:
         benchFunction = local_ZSTD_decompressContinue; benchName = "ZSTD_decompressContinue";
         break;
-	case 31:
+    case 31:
         benchFunction = local_ZSTD_decodeLiteralsBlock; benchName = "ZSTD_decodeLiteralsBlock";
         break;
     case 32:
         benchFunction = local_ZSTD_decodeSeqHeaders; benchName = "ZSTD_decodeSeqHeaders";
         break;
 #endif
-	case 41:
+    case 41:
         benchFunction = local_ZSTD_compressStream; benchName = "ZSTD_compressStream";
         break;
     case 42:

From 2bcefcc50d8230dad87a7a90f10e3d7f67c4052f Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 29 Mar 2017 22:03:27 -0700
Subject: [PATCH 074/255] fixed Visual Studio projects

---
 build/VS2008/fuzzer/fuzzer.vcproj  | 2 +-
 build/VS2010/fuzzer/fuzzer.vcxproj | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/build/VS2008/fuzzer/fuzzer.vcproj b/build/VS2008/fuzzer/fuzzer.vcproj
index 72540d243..a13624b8a 100644
--- a/build/VS2008/fuzzer/fuzzer.vcproj
+++ b/build/VS2008/fuzzer/fuzzer.vcproj
@@ -271,7 +271,7 @@
 				Optimization="2"
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
-				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
+				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\compression;$(SolutionDir)..\..\programs"
 				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
diff --git a/build/VS2010/fuzzer/fuzzer.vcxproj b/build/VS2010/fuzzer/fuzzer.vcxproj
index e30511a78..fff3a6a4f 100644
--- a/build/VS2010/fuzzer/fuzzer.vcxproj
+++ b/build/VS2010/fuzzer/fuzzer.vcxproj
@@ -67,22 +67,22 @@
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
     <LinkIncremental>true</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
     <LinkIncremental>true</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
     <LinkIncremental>false</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
     <LinkIncremental>false</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
     <ClCompile>

From 3d58a1f9b934914ea05abd93aaf1c3304f18d2e1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 12:28:09 -0700
Subject: [PATCH 075/255] fixed Visual fuzzer project

---
 build/VS2008/fuzzer/fuzzer.vcproj  | 8 ++++----
 build/VS2010/fuzzer/fuzzer.vcxproj | 8 ++++----
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/build/VS2008/fuzzer/fuzzer.vcproj b/build/VS2008/fuzzer/fuzzer.vcproj
index a13624b8a..f1719e8ac 100644
--- a/build/VS2008/fuzzer/fuzzer.vcproj
+++ b/build/VS2008/fuzzer/fuzzer.vcproj
@@ -44,7 +44,7 @@
 			<Tool
 				Name="VCCLCompilerTool"
 				Optimization="0"
-				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
+				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\compress;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
 				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
@@ -120,7 +120,7 @@
 				Optimization="2"
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
-				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
+				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\compress;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
 				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
@@ -194,7 +194,7 @@
 			<Tool
 				Name="VCCLCompilerTool"
 				Optimization="0"
-				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
+				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\compress;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs"
 				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
@@ -271,7 +271,7 @@
 				Optimization="2"
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
-				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\compression;$(SolutionDir)..\..\programs"
+				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\compress;$(SolutionDir)..\..\programs"
 				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
diff --git a/build/VS2010/fuzzer/fuzzer.vcxproj b/build/VS2010/fuzzer/fuzzer.vcxproj
index fff3a6a4f..12a4b9313 100644
--- a/build/VS2010/fuzzer/fuzzer.vcxproj
+++ b/build/VS2010/fuzzer/fuzzer.vcxproj
@@ -67,22 +67,22 @@
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
     <LinkIncremental>true</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
     <LinkIncremental>true</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
     <LinkIncremental>false</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
     <LinkIncremental>false</LinkIncremental>
     <RunCodeAnalysis>false</RunCodeAnalysis>
-    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compression;$(UniversalCRT_IncludePath);</IncludePath>
+    <IncludePath>$(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath);</IncludePath>
   </PropertyGroup>
   <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
     <ClCompile>

From 6851db48e00452c4228f8ea2d0c5bda5df9f8e42 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 12:42:44 -0700
Subject: [PATCH 076/255] created contrib/cleanTabs

---
 Makefile          | 4 ++++
 contrib/cleanTabs | 2 ++
 2 files changed, 6 insertions(+)
 create mode 100755 contrib/cleanTabs

diff --git a/Makefile b/Makefile
index 030fd3fb0..7e57e1680 100644
--- a/Makefile
+++ b/Makefile
@@ -90,6 +90,10 @@ examples:
 manual:
 	$(MAKE) -C contrib/gen_html $@
 
+.PHONY: cleanTabs
+cleanTabs:
+	cd contrib; ./cleanTabs
+
 .PHONY: clean
 clean:
 	@$(MAKE) -C $(ZSTDDIR) $@ > $(VOID)
diff --git a/contrib/cleanTabs b/contrib/cleanTabs
new file mode 100755
index 000000000..215913a90
--- /dev/null
+++ b/contrib/cleanTabs
@@ -0,0 +1,2 @@
+#!/bin/sh
+sed -i '' $'s/\t/    /g' ../lib/**/*.{h,c} ../programs/*.{h,c} ../tests/*.c ./**/*.{h,cpp} ../examples/*.c ../zlibWrapper/*.{h,c}

From 274f59919db06b63c021a3a949076c59643ad355 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 12:52:14 -0700
Subject: [PATCH 077/255] Changed memory strategy to __packed for gcc

Method 1 __packed is always as good or better than memcpy().
But it's not portable, as it depends on compiler extension.

For gcc, __pakced directive works fine.
Furthermore, gcc has serious performance issues with memcpy() on ARM 32 bits.
See #620
---
 lib/common/mem.h | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/lib/common/mem.h b/lib/common/mem.h
index f049d181b..4773a8b93 100644
--- a/lib/common/mem.h
+++ b/lib/common/mem.h
@@ -89,8 +89,7 @@ MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (size
 #ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
 #  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
 #    define MEM_FORCE_MEMORY_ACCESS 2
-#  elif defined(__INTEL_COMPILER) /*|| defined(_MSC_VER)*/ || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
+#  elif defined(__INTEL_COMPILER) || defined(__GNUC__)
 #    define MEM_FORCE_MEMORY_ACCESS 1
 #  endif
 #endif

From 0fcb5d70b6073454a732bb40ad2398ac36e1ae7a Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 29 Mar 2017 13:08:10 -0700
Subject: [PATCH 078/255] Build windows releases on appveyor as artifacts

---
 appveyor.yml | 17 ++++++++++++-----
 1 file changed, 12 insertions(+), 5 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index a53bce708..7e06cfdfe 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -57,10 +57,10 @@
   - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
   - SET PATH_ORIGINAL=%PATH%
   - if [%HOST%]==[mingw] (
-      SET "PATH_MINGW32=C:\MinGW\bin;C:\MinGW\usr\bin" &&
-      SET "PATH_MINGW64=C:\msys64\mingw64\bin;C:\msys64\usr\bin" &&
-      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
-      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
+      SET "PATH_MINGW32=C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin" &&
+      SET "PATH_MINGW64=C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin" &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin\make.exe &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin\make.exe
     )
   - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] (
       SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;"
@@ -85,7 +85,14 @@
       SET "CPPFLAGS=-I../../zlib" &&
       SET "LDFLAGS=../../zlib/libz.a" &&
       sh -c "%SCRIPT%" &&
-      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe )
+      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe ) &&
+      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true]
+          lib\dll\example\build_package.bat &&
+          make -C programs DEBUGFLAGS= clean zstdmt &&
+          cp programs\zstd.exe bin\zstdmt.exe &&
+          cd bin\ && 7z a -tzip zstd-win-release-%PLATFORM%.zip * &&
+          appveyor PushArtifact zstd-win-release-%PLATFORM%.zip
+      )
     )
   - if [%HOST%]==[visual] (
       ECHO *** &&

From 137efc007773e5b5a25bb3cccc7c7a5748985675 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 29 Mar 2017 14:40:11 -0700
Subject: [PATCH 079/255] Make pzstd and cmake use gcc/g++

---
 appveyor.yml | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/appveyor.yml b/appveyor.yml
index 7e06cfdfe..81f76926e 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -147,6 +147,8 @@
 
   test_script:
   - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION%
+  - SET "CC=gcc"
+  - SET "CXX=g++"
   - if [%TEST%]==[cmake] (
       mkdir build\cmake\build &&
       cd build\cmake\build &&

From b1c6bb87022404da56cc3015c85494c0ffcec520 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 29 Mar 2017 18:35:21 -0700
Subject: [PATCH 080/255] Copy files into contrib/linux-kernel/

---
 contrib/linux-kernel/include/zstd.h        |  775 +++++
 contrib/linux-kernel/lib/bitstream.h       |  417 +++
 contrib/linux-kernel/lib/entropy_common.c  |  221 ++
 contrib/linux-kernel/lib/error_private.c   |   44 +
 contrib/linux-kernel/lib/error_private.h   |   76 +
 contrib/linux-kernel/lib/fse.h             |  694 ++++
 contrib/linux-kernel/lib/fse_compress.c    |  857 +++++
 contrib/linux-kernel/lib/fse_decompress.c  |  328 ++
 contrib/linux-kernel/lib/huf.h             |  260 ++
 contrib/linux-kernel/lib/huf_compress.c    |  684 ++++
 contrib/linux-kernel/lib/huf_decompress.c  |  888 +++++
 contrib/linux-kernel/lib/mem.h             |  374 +++
 contrib/linux-kernel/lib/xxhash.c          |  869 +++++
 contrib/linux-kernel/lib/xxhash.h          |  305 ++
 contrib/linux-kernel/lib/zstd_common.c     |   73 +
 contrib/linux-kernel/lib/zstd_compress.c   | 3400 ++++++++++++++++++++
 contrib/linux-kernel/lib/zstd_decompress.c | 2484 ++++++++++++++
 contrib/linux-kernel/lib/zstd_errors.h     |   75 +
 contrib/linux-kernel/lib/zstd_internal.h   |  283 ++
 contrib/linux-kernel/lib/zstd_opt.h        |  921 ++++++
 20 files changed, 14028 insertions(+)
 create mode 100644 contrib/linux-kernel/include/zstd.h
 create mode 100644 contrib/linux-kernel/lib/bitstream.h
 create mode 100644 contrib/linux-kernel/lib/entropy_common.c
 create mode 100644 contrib/linux-kernel/lib/error_private.c
 create mode 100644 contrib/linux-kernel/lib/error_private.h
 create mode 100644 contrib/linux-kernel/lib/fse.h
 create mode 100644 contrib/linux-kernel/lib/fse_compress.c
 create mode 100644 contrib/linux-kernel/lib/fse_decompress.c
 create mode 100644 contrib/linux-kernel/lib/huf.h
 create mode 100644 contrib/linux-kernel/lib/huf_compress.c
 create mode 100644 contrib/linux-kernel/lib/huf_decompress.c
 create mode 100644 contrib/linux-kernel/lib/mem.h
 create mode 100644 contrib/linux-kernel/lib/xxhash.c
 create mode 100644 contrib/linux-kernel/lib/xxhash.h
 create mode 100644 contrib/linux-kernel/lib/zstd_common.c
 create mode 100644 contrib/linux-kernel/lib/zstd_compress.c
 create mode 100644 contrib/linux-kernel/lib/zstd_decompress.c
 create mode 100644 contrib/linux-kernel/lib/zstd_errors.h
 create mode 100644 contrib/linux-kernel/lib/zstd_internal.h
 create mode 100644 contrib/linux-kernel/lib/zstd_opt.h

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
new file mode 100644
index 000000000..4531a84bf
--- /dev/null
+++ b/contrib/linux-kernel/include/zstd.h
@@ -0,0 +1,775 @@
+/*
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+#ifndef ZSTD_H_235446
+#define ZSTD_H_235446
+
+/* ======   Dependency   ======*/
+#include <stddef.h>   /* size_t */
+
+
+/* =====   ZSTDLIB_API : control library symbols visibility   ===== */
+#if defined(__GNUC__) && (__GNUC__ >= 4)
+#  define ZSTDLIB_VISIBILITY __attribute__ ((visibility ("default")))
+#else
+#  define ZSTDLIB_VISIBILITY
+#endif
+#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
+#  define ZSTDLIB_API __declspec(dllexport) ZSTDLIB_VISIBILITY
+#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
+#  define ZSTDLIB_API __declspec(dllimport) ZSTDLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define ZSTDLIB_API ZSTDLIB_VISIBILITY
+#endif
+
+
+/*******************************************************************************************************
+  Introduction
+
+  zstd, short for Zstandard, is a fast lossless compression algorithm, targeting real-time compression scenarios
+  at zlib-level and better compression ratios. The zstd compression library provides in-memory compression and
+  decompression functions. The library supports compression levels from 1 up to ZSTD_maxCLevel() which is 22.
+  Levels >= 20, labeled `--ultra`, should be used with caution, as they require more memory.
+  Compression can be done in:
+    - a single step (described as Simple API)
+    - a single step, reusing a context (described as Explicit memory management)
+    - unbounded multiple steps (described as Streaming compression)
+  The compression ratio achievable on small data can be highly improved using compression with a dictionary in:
+    - a single step (described as Simple dictionary API)
+    - a single step, reusing a dictionary (described as Fast dictionary API)
+
+  Advanced experimental functions can be accessed using #define ZSTD_STATIC_LINKING_ONLY before including zstd.h.
+  These APIs shall never be used with a dynamic library.
+  They are not "stable", their definition may change in the future. Only static linking is allowed.
+*********************************************************************************************************/
+
+/*------   Version   ------*/
+#define ZSTD_VERSION_MAJOR    1
+#define ZSTD_VERSION_MINOR    1
+#define ZSTD_VERSION_RELEASE  5
+
+#define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE
+#define ZSTD_QUOTE(str) #str
+#define ZSTD_EXPAND_AND_QUOTE(str) ZSTD_QUOTE(str)
+#define ZSTD_VERSION_STRING ZSTD_EXPAND_AND_QUOTE(ZSTD_LIB_VERSION)
+
+#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
+ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< library version number; to be used when checking dll version */
+
+
+/***************************************
+*  Simple API
+***************************************/
+/*! ZSTD_compress() :
+    Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
+    Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+    @return : compressed size written into `dst` (<= `dstCapacity),
+              or an error code if it fails (which can be tested using ZSTD_isError()). */
+ZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                                  int compressionLevel);
+
+/*! ZSTD_decompress() :
+    `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
+    `dstCapacity` is an upper bound of originalSize.
+    If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
+    @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
+              or an errorCode if it fails (which can be tested using ZSTD_isError()). */
+ZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,
+                              const void* src, size_t compressedSize);
+
+/*! ZSTD_getDecompressedSize() :
+*   NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
+*   ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
+*   frame, but distinguishes empty frames from frames with an unknown size, or errors.
+*
+*   Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
+*   concatenated frames in one buffer, and so is more general.
+*   As a result however, it requires more computation and entire frames to be passed to it,
+*   as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
+*
+*   'src' is the start of a zstd compressed frame.
+*   @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
+*    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
+*             When `return==0`, data to decompress could be any size.
+*             In which case, it's necessary to use streaming mode to decompress data.
+*             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
+*             (For example, data may be necessarily cut into blocks <= 16 KB).
+*    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
+*    note 3 : decompressed size can be very large (64-bits value),
+*             potentially larger than what local system can handle as a single memory segment.
+*             In which case, it's necessary to use streaming mode to decompress data.
+*    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+*             Always ensure result fits within application's authorized limits.
+*             Each application can set its own limits.
+*    note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. */
+ZSTDLIB_API unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
+
+
+/*======  Helper functions  ======*/
+ZSTDLIB_API int         ZSTD_maxCLevel(void);               /*!< maximum compression level available */
+ZSTDLIB_API size_t      ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case scenario */
+ZSTDLIB_API unsigned    ZSTD_isError(size_t code);          /*!< tells if a `size_t` function result is an error code */
+ZSTDLIB_API const char* ZSTD_getErrorName(size_t code);     /*!< provides readable string from an error code */
+
+
+/***************************************
+*  Explicit memory management
+***************************************/
+/*= Compression context
+*   When compressing many times,
+*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+*   This will make workload friendlier for system's memory.
+*   Use one context per thread for parallel execution in multi-threaded environments. */
+typedef struct ZSTD_CCtx_s ZSTD_CCtx;
+ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);
+ZSTDLIB_API size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
+
+/*! ZSTD_compressCCtx() :
+    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
+ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel);
+
+/*= Decompression context
+*   When decompressing many times,
+*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+*   This will make workload friendlier for system's memory.
+*   Use one context per thread for parallel execution in multi-threaded environments. */
+typedef struct ZSTD_DCtx_s ZSTD_DCtx;
+ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void);
+ZSTDLIB_API size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
+
+/*! ZSTD_decompressDCtx() :
+*   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
+ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+
+/**************************
+*  Simple dictionary API
+***************************/
+/*! ZSTD_compress_usingDict() :
+*   Compression using a predefined Dictionary (see dictBuilder/zdict.h).
+*   Note : This function loads the dictionary, resulting in significant startup delay.
+*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
+ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
+                                           void* dst, size_t dstCapacity,
+                                     const void* src, size_t srcSize,
+                                     const void* dict,size_t dictSize,
+                                           int compressionLevel);
+
+/*! ZSTD_decompress_usingDict() :
+*   Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
+*   Dictionary must be identical to the one used during compression.
+*   Note : This function loads the dictionary, resulting in significant startup delay.
+*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
+ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
+                                             void* dst, size_t dstCapacity,
+                                       const void* src, size_t srcSize,
+                                       const void* dict,size_t dictSize);
+
+
+/****************************
+*  Fast dictionary API
+****************************/
+typedef struct ZSTD_CDict_s ZSTD_CDict;
+
+/*! ZSTD_createCDict() :
+*   When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
+*   ZSTD_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
+*   ZSTD_CDict can be created once and used by multiple threads concurrently, as its usage is read-only.
+*   `dictBuffer` can be released after ZSTD_CDict creation, as its content is copied within CDict */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize, int compressionLevel);
+
+/*! ZSTD_freeCDict() :
+*   Function frees memory allocated by ZSTD_createCDict(). */
+ZSTDLIB_API size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
+
+/*! ZSTD_compress_usingCDict() :
+*   Compression using a digested Dictionary.
+*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+*   Note that compression level is decided during dictionary creation. */
+ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
+                                            void* dst, size_t dstCapacity,
+                                      const void* src, size_t srcSize,
+                                      const ZSTD_CDict* cdict);
+
+
+typedef struct ZSTD_DDict_s ZSTD_DDict;
+
+/*! ZSTD_createDDict() :
+*   Create a digested dictionary, ready to start decompression operation without startup delay.
+*   dictBuffer can be released after DDict creation, as its content is copied inside DDict */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);
+
+/*! ZSTD_freeDDict() :
+*   Function frees memory allocated with ZSTD_createDDict() */
+ZSTDLIB_API size_t      ZSTD_freeDDict(ZSTD_DDict* ddict);
+
+/*! ZSTD_decompress_usingDDict() :
+*   Decompression using a digested Dictionary.
+*   Faster startup than ZSTD_decompress_usingDict(), recommended when same dictionary is used multiple times. */
+ZSTDLIB_API size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
+                                              void* dst, size_t dstCapacity,
+                                        const void* src, size_t srcSize,
+                                        const ZSTD_DDict* ddict);
+
+
+/****************************
+*  Streaming
+****************************/
+
+typedef struct ZSTD_inBuffer_s {
+  const void* src;    /**< start of input buffer */
+  size_t size;        /**< size of input buffer */
+  size_t pos;         /**< position where reading stopped. Will be updated. Necessarily 0 <= pos <= size */
+} ZSTD_inBuffer;
+
+typedef struct ZSTD_outBuffer_s {
+  void*  dst;         /**< start of output buffer */
+  size_t size;        /**< size of output buffer */
+  size_t pos;         /**< position where writing stopped. Will be updated. Necessarily 0 <= pos <= size */
+} ZSTD_outBuffer;
+
+
+
+/*-***********************************************************************
+*  Streaming compression - HowTo
+*
+*  A ZSTD_CStream object is required to track streaming operation.
+*  Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.
+*  ZSTD_CStream objects can be reused multiple times on consecutive compression operations.
+*  It is recommended to re-use ZSTD_CStream in situations where many streaming operations will be achieved consecutively,
+*  since it will play nicer with system's memory, by re-using already allocated memory.
+*  Use one separate ZSTD_CStream per thread for parallel execution.
+*
+*  Start a new compression by initializing ZSTD_CStream.
+*  Use ZSTD_initCStream() to start a new compression operation.
+*  Use ZSTD_initCStream_usingDict() or ZSTD_initCStream_usingCDict() for a compression which requires a dictionary (experimental section)
+*
+*  Use ZSTD_compressStream() repetitively to consume input stream.
+*  The function will automatically update both `pos` fields.
+*  Note that it may not consume the entire input, in which case `pos < size`,
+*  and it's up to the caller to present again remaining data.
+*  @return : a size hint, preferred nb of bytes to use as input for next function call
+*            or an error code, which can be tested using ZSTD_isError().
+*            Note 1 : it's just a hint, to help latency a little, any other value will work fine.
+*            Note 2 : size hint is guaranteed to be <= ZSTD_CStreamInSize()
+*
+*  At any moment, it's possible to flush whatever data remains within internal buffer, using ZSTD_flushStream().
+*  `output->pos` will be updated.
+*  Note that some content might still be left within internal buffer if `output->size` is too small.
+*  @return : nb of bytes still present within internal buffer (0 if it's empty)
+*            or an error code, which can be tested using ZSTD_isError().
+*
+*  ZSTD_endStream() instructs to finish a frame.
+*  It will perform a flush and write frame epilogue.
+*  The epilogue is required for decoders to consider a frame completed.
+*  Similar to ZSTD_flushStream(), it may not be able to flush the full content if `output->size` is too small.
+*  In which case, call again ZSTD_endStream() to complete the flush.
+*  @return : nb of bytes still present within internal buffer (0 if it's empty, hence compression completed)
+*            or an error code, which can be tested using ZSTD_isError().
+*
+* *******************************************************************/
+
+typedef struct ZSTD_CStream_s ZSTD_CStream;
+/*===== ZSTD_CStream management functions =====*/
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void);
+ZSTDLIB_API size_t ZSTD_freeCStream(ZSTD_CStream* zcs);
+
+/*===== Streaming compression functions =====*/
+ZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
+ZSTDLIB_API size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
+ZSTDLIB_API size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
+
+ZSTDLIB_API size_t ZSTD_CStreamInSize(void);    /**< recommended size for input buffer */
+ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output buffer. Guarantee to successfully flush at least one complete compressed block in all circumstances. */
+
+
+
+/*-***************************************************************************
+*  Streaming decompression - HowTo
+*
+*  A ZSTD_DStream object is required to track streaming operations.
+*  Use ZSTD_createDStream() and ZSTD_freeDStream() to create/release resources.
+*  ZSTD_DStream objects can be re-used multiple times.
+*
+*  Use ZSTD_initDStream() to start a new decompression operation,
+*   or ZSTD_initDStream_usingDict() if decompression requires a dictionary.
+*   @return : recommended first input size
+*
+*  Use ZSTD_decompressStream() repetitively to consume your input.
+*  The function will update both `pos` fields.
+*  If `input.pos < input.size`, some input has not been consumed.
+*  It's up to the caller to present again remaining data.
+*  If `output.pos < output.size`, decoder has flushed everything it could.
+*  @return : 0 when a frame is completely decoded and fully flushed,
+*            an error code, which can be tested using ZSTD_isError(),
+*            any other value > 0, which means there is still some decoding to do to complete current frame.
+*            The return value is a suggested next input size (a hint to improve latency) that will never load more than the current frame.
+* *******************************************************************************/
+
+typedef struct ZSTD_DStream_s ZSTD_DStream;
+/*===== ZSTD_DStream management functions =====*/
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void);
+ZSTDLIB_API size_t ZSTD_freeDStream(ZSTD_DStream* zds);
+
+/*===== Streaming decompression functions =====*/
+ZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds);
+ZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
+
+ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
+ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
+
+#endif  /* ZSTD_H_235446 */
+
+
+#if defined(ZSTD_STATIC_LINKING_ONLY) && !defined(ZSTD_H_ZSTD_STATIC_LINKING_ONLY)
+#define ZSTD_H_ZSTD_STATIC_LINKING_ONLY
+
+/****************************************************************************************
+ * START OF ADVANCED AND EXPERIMENTAL FUNCTIONS
+ * The definitions in this section are considered experimental.
+ * They should never be used with a dynamic library, as they may change in the future.
+ * They are provided for advanced usages.
+ * Use them only in association with static linking.
+ * ***************************************************************************************/
+
+/* --- Constants ---*/
+#define ZSTD_MAGICNUMBER            0xFD2FB528   /* >= v0.8.0 */
+#define ZSTD_MAGIC_SKIPPABLE_START  0x184D2A50U
+
+#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)
+#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
+
+#define ZSTD_WINDOWLOG_MAX_32  27
+#define ZSTD_WINDOWLOG_MAX_64  27
+#define ZSTD_WINDOWLOG_MAX    ((unsigned)(sizeof(size_t) == 4 ? ZSTD_WINDOWLOG_MAX_32 : ZSTD_WINDOWLOG_MAX_64))
+#define ZSTD_WINDOWLOG_MIN     10
+#define ZSTD_HASHLOG_MAX       ZSTD_WINDOWLOG_MAX
+#define ZSTD_HASHLOG_MIN        6
+#define ZSTD_CHAINLOG_MAX     (ZSTD_WINDOWLOG_MAX+1)
+#define ZSTD_CHAINLOG_MIN      ZSTD_HASHLOG_MIN
+#define ZSTD_HASHLOG3_MAX      17
+#define ZSTD_SEARCHLOG_MAX    (ZSTD_WINDOWLOG_MAX-1)
+#define ZSTD_SEARCHLOG_MIN      1
+#define ZSTD_SEARCHLENGTH_MAX   7   /* only for ZSTD_fast, other strategies are limited to 6 */
+#define ZSTD_SEARCHLENGTH_MIN   3   /* only for ZSTD_btopt, other strategies are limited to 4 */
+#define ZSTD_TARGETLENGTH_MIN   4
+#define ZSTD_TARGETLENGTH_MAX 999
+
+#define ZSTD_FRAMEHEADERSIZE_MAX 18    /* for static allocation */
+#define ZSTD_FRAMEHEADERSIZE_MIN  6
+static const size_t ZSTD_frameHeaderSize_prefix = 5;
+static const size_t ZSTD_frameHeaderSize_min = ZSTD_FRAMEHEADERSIZE_MIN;
+static const size_t ZSTD_frameHeaderSize_max = ZSTD_FRAMEHEADERSIZE_MAX;
+static const size_t ZSTD_skippableHeaderSize = 8;  /* magic number + skippable frame length */
+
+
+/*--- Advanced types ---*/
+typedef enum { ZSTD_fast, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2, ZSTD_btlazy2, ZSTD_btopt, ZSTD_btopt2 } ZSTD_strategy;   /* from faster to stronger */
+
+typedef struct {
+    unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
+    unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
+    unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
+    unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
+    unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
+    unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
+    ZSTD_strategy strategy;
+} ZSTD_compressionParameters;
+
+typedef struct {
+    unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
+    unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
+    unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
+} ZSTD_frameParameters;
+
+typedef struct {
+    ZSTD_compressionParameters cParams;
+    ZSTD_frameParameters fParams;
+} ZSTD_parameters;
+
+/*= Custom memory allocation functions */
+typedef void* (*ZSTD_allocFunction) (void* opaque, size_t size);
+typedef void  (*ZSTD_freeFunction) (void* opaque, void* address);
+typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;
+
+/***************************************
+*  Compressed size functions
+***************************************/
+
+/*! ZSTD_findFrameCompressedSize() :
+ *  `src` should point to the start of a ZSTD encoded frame or skippable frame
+ *  `srcSize` must be at least as large as the frame
+ *  @return : the compressed size of the frame pointed to by `src`, suitable to pass to
+ *      `ZSTD_decompress` or similar, or an error code if given invalid input. */
+ZSTDLIB_API size_t ZSTD_findFrameCompressedSize(const void* src, size_t srcSize);
+
+/***************************************
+*  Decompressed size functions
+***************************************/
+/*! ZSTD_getFrameContentSize() :
+*   `src` should point to the start of a ZSTD encoded frame
+*   `srcSize` must be at least as large as the frame header.  A value greater than or equal
+*       to `ZSTD_frameHeaderSize_max` is guaranteed to be large enough in all cases.
+*   @return : decompressed size of the frame pointed to be `src` if known, otherwise
+*             - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
+*             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
+ZSTDLIB_API unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
+
+/*! ZSTD_findDecompressedSize() :
+*   `src` should point the start of a series of ZSTD encoded and/or skippable frames
+*   `srcSize` must be the _exact_ size of this series
+*       (i.e. there should be a frame boundary exactly `srcSize` bytes after `src`)
+*   @return : the decompressed size of all data in the contained frames, as a 64-bit value _if known_
+*             - if the decompressed size cannot be determined: ZSTD_CONTENTSIZE_UNKNOWN
+*             - if an error occurred: ZSTD_CONTENTSIZE_ERROR
+*
+*    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
+*             When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
+*             In which case, it's necessary to use streaming mode to decompress data.
+*             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
+*             (For example, data may be necessarily cut into blocks <= 16 KB).
+*    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
+*    note 3 : decompressed size can be very large (64-bits value),
+*             potentially larger than what local system can handle as a single memory segment.
+*             In which case, it's necessary to use streaming mode to decompress data.
+*    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+*             Always ensure result fits within application's authorized limits.
+*             Each application can set its own limits.
+*    note 5 : ZSTD_findDecompressedSize handles multiple frames, and so it must traverse the input to
+*             read each contained frame header.  This is efficient as most of the data is skipped,
+*             however it does mean that all frame data must be present and valid. */
+ZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);
+
+
+/***************************************
+*  Advanced compression functions
+***************************************/
+/*! ZSTD_estimateCCtxSize() :
+ *  Gives the amount of memory allocated for a ZSTD_CCtx given a set of compression parameters.
+ *  `frameContentSize` is an optional parameter, provide `0` if unknown */
+ZSTDLIB_API size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams);
+
+/*! ZSTD_createCCtx_advanced() :
+ *  Create a ZSTD compression context using external alloc and free functions */
+ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem);
+
+/*! ZSTD_sizeofCCtx() :
+ *  Gives the amount of memory used by a given ZSTD_CCtx */
+ZSTDLIB_API size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);
+
+typedef enum {
+    ZSTD_p_forceWindow,   /* Force back-references to remain < windowSize, even when referencing Dictionary content (default:0) */
+    ZSTD_p_forceRawDict   /* Force loading dictionary in "content-only" mode (no header analysis) */
+} ZSTD_CCtxParameter;
+/*! ZSTD_setCCtxParameter() :
+ *  Set advanced parameters, selected through enum ZSTD_CCtxParameter
+ *  @result : 0, or an error code (which can be tested with ZSTD_isError()) */
+ZSTDLIB_API size_t ZSTD_setCCtxParameter(ZSTD_CCtx* cctx, ZSTD_CCtxParameter param, unsigned value);
+
+/*! ZSTD_createCDict_byReference() :
+ *  Create a digested dictionary for compression
+ *  Dictionary content is simply referenced, and therefore stays in dictBuffer.
+ *  It is important that dictBuffer outlives CDict, it must remain read accessible throughout the lifetime of CDict */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, size_t dictSize, int compressionLevel);
+
+/*! ZSTD_createCDict_advanced() :
+ *  Create a ZSTD_CDict using external alloc and free, and customized compression parameters */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize, unsigned byReference,
+                                                  ZSTD_parameters params, ZSTD_customMem customMem);
+
+/*! ZSTD_sizeof_CDict() :
+ *  Gives the amount of memory used by a given ZSTD_sizeof_CDict */
+ZSTDLIB_API size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict);
+
+/*! ZSTD_getCParams() :
+*   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
+*   `estimatedSrcSize` value is optional, select 0 if not known */
+ZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+/*! ZSTD_getParams() :
+*   same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
+*   All fields of `ZSTD_frameParameters` are set to default (0) */
+ZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+/*! ZSTD_checkCParams() :
+*   Ensure param values remain within authorized range */
+ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
+
+/*! ZSTD_adjustCParams() :
+*   optimize params for a given `srcSize` and `dictSize`.
+*   both values are optional, select `0` if unknown. */
+ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
+
+/*! ZSTD_compress_advanced() :
+*   Same as ZSTD_compress_usingDict(), with fine-tune control of each compression parameter */
+ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
+                                           void* dst, size_t dstCapacity,
+                                     const void* src, size_t srcSize,
+                                     const void* dict,size_t dictSize,
+                                           ZSTD_parameters params);
+
+
+/*--- Advanced decompression functions ---*/
+
+/*! ZSTD_isFrame() :
+ *  Tells if the content of `buffer` starts with a valid Frame Identifier.
+ *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
+ *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
+ *  Note 3 : Skippable Frame Identifiers are considered valid. */
+ZSTDLIB_API unsigned ZSTD_isFrame(const void* buffer, size_t size);
+
+/*! ZSTD_estimateDCtxSize() :
+ *  Gives the potential amount of memory allocated to create a ZSTD_DCtx */
+ZSTDLIB_API size_t ZSTD_estimateDCtxSize(void);
+
+/*! ZSTD_createDCtx_advanced() :
+ *  Create a ZSTD decompression context using external alloc and free functions */
+ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem);
+
+/*! ZSTD_sizeof_DCtx() :
+ *  Gives the amount of memory used by a given ZSTD_DCtx */
+ZSTDLIB_API size_t ZSTD_sizeof_DCtx(const ZSTD_DCtx* dctx);
+
+/*! ZSTD_createDDict_byReference() :
+ *  Create a digested dictionary, ready to start decompression operation without startup delay.
+ *  Dictionary content is simply referenced, and therefore stays in dictBuffer.
+ *  It is important that dictBuffer outlives DDict, it must remain read accessible throughout the lifetime of DDict */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize);
+
+/*! ZSTD_createDDict_advanced() :
+ *  Create a ZSTD_DDict using external alloc and free, optionally by reference */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
+                                                  unsigned byReference, ZSTD_customMem customMem);
+
+/*! ZSTD_sizeof_DDict() :
+ *  Gives the amount of memory used by a given ZSTD_DDict */
+ZSTDLIB_API size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict);
+
+/*! ZSTD_getDictID_fromDict() :
+ *  Provides the dictID stored within dictionary.
+ *  if @return == 0, the dictionary is not conformant with Zstandard specification.
+ *  It can still be loaded, but as a content-only dictionary. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize);
+
+/*! ZSTD_getDictID_fromDDict() :
+ *  Provides the dictID of the dictionary loaded into `ddict`.
+ *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
+ *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
+
+/*! ZSTD_getDictID_fromFrame() :
+ *  Provides the dictID required to decompressed the frame stored within `src`.
+ *  If @return == 0, the dictID could not be decoded.
+ *  This could for one of the following reasons :
+ *  - The frame does not require a dictionary to be decoded (most common case).
+ *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
+ *    Note : this use case also happens when using a non-conformant dictionary.
+ *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
+ *  - This is not a Zstandard frame.
+ *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
+
+
+/********************************************************************
+*  Advanced streaming functions
+********************************************************************/
+
+/*=====   Advanced Streaming compression functions  =====*/
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   /**< pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
+ZSTDLIB_API size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
+ZSTDLIB_API size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
+                                             ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
+ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
+ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
+ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
+
+
+/*=====   Advanced Streaming decompression functions  =====*/
+typedef enum { DStream_p_maxWindowSize } ZSTD_DStreamParameter_e;
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
+ZSTDLIB_API size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds, ZSTD_DStreamParameter_e paramType, unsigned paramValue);
+ZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict);  /**< note : ddict will just be referenced, and must outlive decompression session */
+ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
+ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
+
+
+/*********************************************************************
+*  Buffer-less and synchronous inner streaming functions
+*
+*  This is an advanced API, giving full control over buffer management, for users which need direct control over memory.
+*  But it's also a complex one, with many restrictions (documented below).
+*  Prefer using normal streaming API for an easier experience
+********************************************************************* */
+
+/**
+  Buffer-less streaming compression (synchronous mode)
+
+  A ZSTD_CCtx object is required to track streaming operations.
+  Use ZSTD_createCCtx() / ZSTD_freeCCtx() to manage resource.
+  ZSTD_CCtx object can be re-used multiple times within successive compression operations.
+
+  Start by initializing a context.
+  Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary compression,
+  or ZSTD_compressBegin_advanced(), for finer parameter control.
+  It's also possible to duplicate a reference context which has already been initialized, using ZSTD_copyCCtx()
+
+  Then, consume your input using ZSTD_compressContinue().
+  There are some important considerations to keep in mind when using this advanced function :
+  - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffer only.
+  - Interface is synchronous : input is consumed entirely and produce 1+ (or more) compressed blocks.
+  - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.
+    Worst case evaluation is provided by ZSTD_compressBound().
+    ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
+  - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).
+    It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
+  - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.
+    In which case, it will "discard" the relevant memory section from its history.
+
+  Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.
+  It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.
+  Without last block mark, frames will be considered unfinished (corrupted) by decoders.
+
+  `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress some new frame.
+*/
+
+/*=====   Buffer-less streaming compression functions  =====*/
+ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
+ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
+ZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+
+
+/*-
+  Buffer-less streaming decompression (synchronous mode)
+
+  A ZSTD_DCtx object is required to track streaming operations.
+  Use ZSTD_createDCtx() / ZSTD_freeDCtx() to manage it.
+  A ZSTD_DCtx object can be re-used multiple times.
+
+  First typical operation is to retrieve frame parameters, using ZSTD_getFrameParams().
+  It fills a ZSTD_frameParams structure which provide important information to correctly decode the frame,
+  such as the minimum rolling buffer size to allocate to decompress data (`windowSize`),
+  and the dictionary ID used.
+  (Note : content size is optional, it may not be present. 0 means : content size unknown).
+  Note that these values could be wrong, either because of data malformation, or because an attacker is spoofing deliberate false information.
+  As a consequence, check that values remain within valid application range, especially `windowSize`, before allocation.
+  Each application can set its own limit, depending on local restrictions. For extended interoperability, it is recommended to support at least 8 MB.
+  Frame parameters are extracted from the beginning of the compressed frame.
+  Data fragment must be large enough to ensure successful decoding, typically `ZSTD_frameHeaderSize_max` bytes.
+  @result : 0 : successful decoding, the `ZSTD_frameParams` structure is correctly filled.
+           >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
+           errorCode, which can be tested using ZSTD_isError().
+
+  Start decompression, with ZSTD_decompressBegin() or ZSTD_decompressBegin_usingDict().
+  Alternatively, you can copy a prepared context, using ZSTD_copyDCtx().
+
+  Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue() alternatively.
+  ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize' to ZSTD_decompressContinue().
+  ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will fail.
+
+  @result of ZSTD_decompressContinue() is the number of bytes regenerated within 'dst' (necessarily <= dstCapacity).
+  It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some metadata item.
+  It can also be an error code, which can be tested with ZSTD_isError().
+
+  ZSTD_decompressContinue() needs previous data blocks during decompression, up to `windowSize`.
+  They should preferably be located contiguously, prior to current block.
+  Alternatively, a round buffer of sufficient size is also possible. Sufficient size is determined by frame parameters.
+  ZSTD_decompressContinue() is very sensitive to contiguity,
+  if 2 blocks don't follow each other, make sure that either the compressor breaks contiguity at the same place,
+  or that previous contiguous segment is large enough to properly handle maximum back-reference.
+
+  A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
+  Context can then be reset to start a new decompression.
+
+  Note : it's possible to know if next input to present is a header or a block, using ZSTD_nextInputType().
+  This information is not required to properly decode a frame.
+
+  == Special case : skippable frames ==
+
+  Skippable frames allow integration of user-defined data into a flow of concatenated frames.
+  Skippable frames will be ignored (skipped) by a decompressor. The format of skippable frames is as follows :
+  a) Skippable frame ID - 4 Bytes, Little endian format, any value from 0x184D2A50 to 0x184D2A5F
+  b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
+  c) Frame Content - any content (User Data) of length equal to Frame Size
+  For skippable frames ZSTD_decompressContinue() always returns 0.
+  For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0 what means that a frame is skippable.
+    Note : If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might actually be a Zstd encoded frame with no content.
+           For purposes of decompression, it is valid in both cases to skip the frame using
+           ZSTD_findFrameCompressedSize to find its size in bytes.
+  It also returns Frame Size as fparamsPtr->frameContentSize.
+*/
+
+typedef struct {
+    unsigned long long frameContentSize;
+    unsigned windowSize;
+    unsigned dictID;
+    unsigned checksumFlag;
+} ZSTD_frameParams;
+
+/*=====   Buffer-less streaming decompression functions  =====*/
+ZSTDLIB_API size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t srcSize);   /**< doesn't consume input, see details below */
+ZSTDLIB_API size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx);
+ZSTDLIB_API size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);
+ZSTDLIB_API void   ZSTD_copyDCtx(ZSTD_DCtx* dctx, const ZSTD_DCtx* preparedDCtx);
+ZSTDLIB_API size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx);
+ZSTDLIB_API size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+typedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_lastBlock, ZSTDnit_checksum, ZSTDnit_skippableFrame } ZSTD_nextInputType_e;
+ZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
+
+/**
+    Block functions
+
+    Block functions produce and decode raw zstd blocks, without frame metadata.
+    Frame metadata cost is typically ~18 bytes, which can be non-negligible for very small blocks (< 100 bytes).
+    User will have to take in charge required information to regenerate data, such as compressed and content sizes.
+
+    A few rules to respect :
+    - Compressing and decompressing require a context structure
+      + Use ZSTD_createCCtx() and ZSTD_createDCtx()
+    - It is necessary to init context before starting
+      + compression : ZSTD_compressBegin()
+      + decompression : ZSTD_decompressBegin()
+      + variants _usingDict() are also allowed
+      + copyCCtx() and copyDCtx() work too
+    - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
+      + If you need to compress more, cut data into multiple blocks
+      + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
+    - When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
+      In which case, nothing is produced into `dst`.
+      + User must test for such outcome and deal directly with uncompressed data
+      + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
+      + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
+        Use ZSTD_insertBlock() in such a case.
+*/
+
+#define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)   /* define, for static allocation */
+/*=====   Raw zstd block functions  =====*/
+ZSTDLIB_API size_t ZSTD_getBlockSizeMax(ZSTD_CCtx* cctx);
+ZSTDLIB_API size_t ZSTD_compressBlock  (ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize);  /**< insert block into `dctx` history. Useful for uncompressed blocks */
+
+
+#endif   /* ZSTD_H_ZSTD_STATIC_LINKING_ONLY */
+
+#if defined (__cplusplus)
+}
+#endif
diff --git a/contrib/linux-kernel/lib/bitstream.h b/contrib/linux-kernel/lib/bitstream.h
new file mode 100644
index 000000000..0e3d2fc55
--- /dev/null
+++ b/contrib/linux-kernel/lib/bitstream.h
@@ -0,0 +1,417 @@
+/* ******************************************************************
+   bitstream
+   Part of FSE library
+   header file (to include)
+   Copyright (C) 2013-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+****************************************************************** */
+#ifndef BITSTREAM_H_MODULE
+#define BITSTREAM_H_MODULE
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+
+/*
+*  This API consists of small unitary functions, which must be inlined for best performance.
+*  Since link-time-optimization is not available for all compilers,
+*  these functions are defined into a .h to be included.
+*/
+
+/*-****************************************
+*  Dependencies
+******************************************/
+#include "mem.h"            /* unaligned access routines */
+#include "error_private.h"  /* error codes and messages */
+
+
+/*=========================================
+*  Target specific
+=========================================*/
+#if defined(__BMI__) && defined(__GNUC__)
+#  include <immintrin.h>   /* support for bextr (experimental) */
+#endif
+
+#define STREAM_ACCUMULATOR_MIN_32  25
+#define STREAM_ACCUMULATOR_MIN_64  57
+#define STREAM_ACCUMULATOR_MIN    ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
+
+/*-******************************************
+*  bitStream encoding API (write forward)
+********************************************/
+/* bitStream can mix input from multiple sources.
+*  A critical property of these streams is that they encode and decode in **reverse** direction.
+*  So the first bit sequence you add will be the last to be read, like a LIFO stack.
+*/
+typedef struct
+{
+    size_t bitContainer;
+    int    bitPos;
+    char*  startPtr;
+    char*  ptr;
+    char*  endPtr;
+} BIT_CStream_t;
+
+MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
+MEM_STATIC void   BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
+MEM_STATIC void   BIT_flushBits(BIT_CStream_t* bitC);
+MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
+
+/* Start with initCStream, providing the size of buffer to write into.
+*  bitStream will never write outside of this buffer.
+*  `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
+*
+*  bits are first added to a local register.
+*  Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
+*  Writing data into memory is an explicit operation, performed by the flushBits function.
+*  Hence keep track how many bits are potentially stored into local register to avoid register overflow.
+*  After a flushBits, a maximum of 7 bits might still be stored into local register.
+*
+*  Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
+*
+*  Last operation is to close the bitStream.
+*  The function returns the final size of CStream in bytes.
+*  If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
+*/
+
+
+/*-********************************************
+*  bitStream decoding API (read backward)
+**********************************************/
+typedef struct
+{
+    size_t   bitContainer;
+    unsigned bitsConsumed;
+    const char* ptr;
+    const char* start;
+} BIT_DStream_t;
+
+typedef enum { BIT_DStream_unfinished = 0,
+               BIT_DStream_endOfBuffer = 1,
+               BIT_DStream_completed = 2,
+               BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
+               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
+
+MEM_STATIC size_t   BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
+MEM_STATIC size_t   BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
+MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
+MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
+
+
+/* Start by invoking BIT_initDStream().
+*  A chunk of the bitStream is then stored into a local register.
+*  Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
+*  You can then retrieve bitFields stored into the local register, **in reverse order**.
+*  Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
+*  A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
+*  Otherwise, it can be less than that, so proceed accordingly.
+*  Checking if DStream has reached its end can be performed with BIT_endOfDStream().
+*/
+
+
+/*-****************************************
+*  unsafe API
+******************************************/
+MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
+/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
+
+MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC);
+/* unsafe version; does not check buffer overflow */
+
+MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
+/* faster, but works only if nbBits >= 1 */
+
+
+
+/*-**************************************************************
+*  Internal functions
+****************************************************************/
+MEM_STATIC unsigned BIT_highbit32 (register U32 val)
+{
+#   if defined(_MSC_VER)   /* Visual */
+    unsigned long r=0;
+    _BitScanReverse ( &r, val );
+    return (unsigned) r;
+#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
+    return 31 - __builtin_clz (val);
+#   else   /* Software version */
+    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+    U32 v = val;
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+    return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
+#   endif
+}
+
+/*=====    Local Constants   =====*/
+static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F, 0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF, 0x1FFFF, 0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF,  0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF };   /* up to 26 bits */
+
+
+/*-**************************************************************
+*  bitStream encoding
+****************************************************************/
+/*! BIT_initCStream() :
+ *  `dstCapacity` must be > sizeof(void*)
+ *  @return : 0 if success,
+              otherwise an error code (can be tested using ERR_isError() ) */
+MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* startPtr, size_t dstCapacity)
+{
+    bitC->bitContainer = 0;
+    bitC->bitPos = 0;
+    bitC->startPtr = (char*)startPtr;
+    bitC->ptr = bitC->startPtr;
+    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
+    if (dstCapacity <= sizeof(bitC->ptr)) return ERROR(dstSize_tooSmall);
+    return 0;
+}
+
+/*! BIT_addBits() :
+    can add up to 26 bits into `bitC`.
+    Does not check for register overflow ! */
+MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
+{
+    bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
+    bitC->bitPos += nbBits;
+}
+
+/*! BIT_addBitsFast() :
+ *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
+MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
+{
+    bitC->bitContainer |= value << bitC->bitPos;
+    bitC->bitPos += nbBits;
+}
+
+/*! BIT_flushBitsFast() :
+ *  unsafe version; does not check buffer overflow */
+MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
+{
+    size_t const nbBytes = bitC->bitPos >> 3;
+    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+    bitC->ptr += nbBytes;
+    bitC->bitPos &= 7;
+    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+}
+
+/*! BIT_flushBits() :
+ *  safe version; check for buffer overflow, and prevents it.
+ *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
+MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
+{
+    size_t const nbBytes = bitC->bitPos >> 3;
+    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+    bitC->ptr += nbBytes;
+    if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
+    bitC->bitPos &= 7;
+    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+}
+
+/*! BIT_closeCStream() :
+ *  @return : size of CStream, in bytes,
+              or 0 if it could not fit into dstBuffer */
+MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
+{
+    BIT_addBitsFast(bitC, 1, 1);   /* endMark */
+    BIT_flushBits(bitC);
+
+    if (bitC->ptr >= bitC->endPtr) return 0; /* doesn't fit within authorized budget : cancel */
+
+    return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
+}
+
+
+/*-********************************************************
+* bitStream decoding
+**********************************************************/
+/*! BIT_initDStream() :
+*   Initialize a BIT_DStream_t.
+*   `bitD` : a pointer to an already allocated BIT_DStream_t structure.
+*   `srcSize` must be the *exact* size of the bitStream, in bytes.
+*   @return : size of stream (== srcSize) or an errorCode if a problem is detected
+*/
+MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
+{
+    if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
+
+    if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
+        bitD->start = (const char*)srcBuffer;
+        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);
+        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
+          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
+    } else {
+        bitD->start = (const char*)srcBuffer;
+        bitD->ptr   = bitD->start;
+        bitD->bitContainer = *(const BYTE*)(bitD->start);
+        switch(srcSize)
+        {
+            case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
+            case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
+            case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
+            case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
+            case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
+            case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) <<  8;
+            default:;
+        }
+        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
+          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
+        bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
+    }
+
+    return srcSize;
+}
+
+MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
+{
+    return bitContainer >> start;
+}
+
+MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
+{
+#if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008  /* experimental */
+#  if defined(__x86_64__)
+    if (sizeof(bitContainer)==8)
+        return _bextr_u64(bitContainer, start, nbBits);
+    else
+#  endif
+        return _bextr_u32(bitContainer, start, nbBits);
+#else
+    return (bitContainer >> start) & BIT_mask[nbBits];
+#endif
+}
+
+MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
+{
+    return bitContainer & BIT_mask[nbBits];
+}
+
+/*! BIT_lookBits() :
+ *  Provides next n bits from local register.
+ *  local register is not modified.
+ *  On 32-bits, maxNbBits==24.
+ *  On 64-bits, maxNbBits==56.
+ *  @return : value extracted
+ */
+ MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
+{
+#if defined(__BMI__) && defined(__GNUC__)   /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
+    return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
+#else
+    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
+#endif
+}
+
+/*! BIT_lookBitsFast() :
+*   unsafe version; only works only if nbBits >= 1 */
+MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
+{
+    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
+}
+
+MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
+{
+    bitD->bitsConsumed += nbBits;
+}
+
+/*! BIT_readBits() :
+ *  Read (consume) next n bits from local register and update.
+ *  Pay attention to not read more than nbBits contained into local register.
+ *  @return : extracted value.
+ */
+MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
+{
+    size_t const value = BIT_lookBits(bitD, nbBits);
+    BIT_skipBits(bitD, nbBits);
+    return value;
+}
+
+/*! BIT_readBitsFast() :
+*   unsafe version; only works only if nbBits >= 1 */
+MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
+{
+    size_t const value = BIT_lookBitsFast(bitD, nbBits);
+    BIT_skipBits(bitD, nbBits);
+    return value;
+}
+
+/*! BIT_reloadDStream() :
+*   Refill `bitD` from buffer previously set in BIT_initDStream() .
+*   This function is safe, it guarantees it will not read beyond src buffer.
+*   @return : status of `BIT_DStream_t` internal register.
+              if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
+MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
+{
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
+        return BIT_DStream_overflow;
+
+    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
+        bitD->ptr -= bitD->bitsConsumed >> 3;
+        bitD->bitsConsumed &= 7;
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);
+        return BIT_DStream_unfinished;
+    }
+    if (bitD->ptr == bitD->start) {
+        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
+        return BIT_DStream_completed;
+    }
+    {   U32 nbBytes = bitD->bitsConsumed >> 3;
+        BIT_DStream_status result = BIT_DStream_unfinished;
+        if (bitD->ptr - nbBytes < bitD->start) {
+            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
+            result = BIT_DStream_endOfBuffer;
+        }
+        bitD->ptr -= nbBytes;
+        bitD->bitsConsumed -= nbBytes*8;
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
+        return result;
+    }
+}
+
+/*! BIT_endOfDStream() :
+*   @return Tells if DStream has exactly reached its end (all bits consumed).
+*/
+MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
+{
+    return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
+}
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif /* BITSTREAM_H_MODULE */
diff --git a/contrib/linux-kernel/lib/entropy_common.c b/contrib/linux-kernel/lib/entropy_common.c
new file mode 100644
index 000000000..b37a082fe
--- /dev/null
+++ b/contrib/linux-kernel/lib/entropy_common.c
@@ -0,0 +1,221 @@
+/*
+   Common functions of New Generation Entropy library
+   Copyright (C) 2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    You can contact the author at :
+    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+*************************************************************************** */
+
+/* *************************************
+*  Dependencies
+***************************************/
+#include "mem.h"
+#include "error_private.h"       /* ERR_*, ERROR */
+#define FSE_STATIC_LINKING_ONLY  /* FSE_MIN_TABLELOG */
+#include "fse.h"
+#define HUF_STATIC_LINKING_ONLY  /* HUF_TABLELOG_ABSOLUTEMAX */
+#include "huf.h"
+
+
+/*===   Version   ===*/
+unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
+
+
+/*===   Error Management   ===*/
+unsigned FSE_isError(size_t code) { return ERR_isError(code); }
+const char* FSE_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+unsigned HUF_isError(size_t code) { return ERR_isError(code); }
+const char* HUF_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+
+/*-**************************************************************
+*  FSE NCount encoding-decoding
+****************************************************************/
+size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
+                 const void* headerBuffer, size_t hbSize)
+{
+    const BYTE* const istart = (const BYTE*) headerBuffer;
+    const BYTE* const iend = istart + hbSize;
+    const BYTE* ip = istart;
+    int nbBits;
+    int remaining;
+    int threshold;
+    U32 bitStream;
+    int bitCount;
+    unsigned charnum = 0;
+    int previous0 = 0;
+
+    if (hbSize < 4) return ERROR(srcSize_wrong);
+    bitStream = MEM_readLE32(ip);
+    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
+    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
+    bitStream >>= 4;
+    bitCount = 4;
+    *tableLogPtr = nbBits;
+    remaining = (1<<nbBits)+1;
+    threshold = 1<<nbBits;
+    nbBits++;
+
+    while ((remaining>1) & (charnum<=*maxSVPtr)) {
+        if (previous0) {
+            unsigned n0 = charnum;
+            while ((bitStream & 0xFFFF) == 0xFFFF) {
+                n0 += 24;
+                if (ip < iend-5) {
+                    ip += 2;
+                    bitStream = MEM_readLE32(ip) >> bitCount;
+                } else {
+                    bitStream >>= 16;
+                    bitCount   += 16;
+            }   }
+            while ((bitStream & 3) == 3) {
+                n0 += 3;
+                bitStream >>= 2;
+                bitCount += 2;
+            }
+            n0 += bitStream & 3;
+            bitCount += 2;
+            if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
+            while (charnum < n0) normalizedCounter[charnum++] = 0;
+            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+                ip += bitCount>>3;
+                bitCount &= 7;
+                bitStream = MEM_readLE32(ip) >> bitCount;
+            } else {
+                bitStream >>= 2;
+        }   }
+        {   int const max = (2*threshold-1) - remaining;
+            int count;
+
+            if ((bitStream & (threshold-1)) < (U32)max) {
+                count = bitStream & (threshold-1);
+                bitCount += nbBits-1;
+            } else {
+                count = bitStream & (2*threshold-1);
+                if (count >= threshold) count -= max;
+                bitCount += nbBits;
+            }
+
+            count--;   /* extra accuracy */
+            remaining -= count < 0 ? -count : count;   /* -1 means +1 */
+            normalizedCounter[charnum++] = (short)count;
+            previous0 = !count;
+            while (remaining < threshold) {
+                nbBits--;
+                threshold >>= 1;
+            }
+
+            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+                ip += bitCount>>3;
+                bitCount &= 7;
+            } else {
+                bitCount -= (int)(8 * (iend - 4 - ip));
+                ip = iend - 4;
+            }
+            bitStream = MEM_readLE32(ip) >> (bitCount & 31);
+    }   }   /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
+    if (remaining != 1) return ERROR(corruption_detected);
+    if (bitCount > 32) return ERROR(corruption_detected);
+    *maxSVPtr = charnum-1;
+
+    ip += (bitCount+7)>>3;
+    return ip-istart;
+}
+
+
+/*! HUF_readStats() :
+    Read compact Huffman tree, saved by HUF_writeCTable().
+    `huffWeight` is destination buffer.
+    `rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
+    @return : size read from `src` , or an error Code .
+    Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
+*/
+size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
+                     U32* nbSymbolsPtr, U32* tableLogPtr,
+                     const void* src, size_t srcSize)
+{
+    U32 weightTotal;
+    const BYTE* ip = (const BYTE*) src;
+    size_t iSize;
+    size_t oSize;
+
+    if (!srcSize) return ERROR(srcSize_wrong);
+    iSize = ip[0];
+    /* memset(huffWeight, 0, hwSize);   *//* is not necessary, even though some analyzer complain ... */
+
+    if (iSize >= 128) {  /* special header */
+        oSize = iSize - 127;
+        iSize = ((oSize+1)/2);
+        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+        if (oSize >= hwSize) return ERROR(corruption_detected);
+        ip += 1;
+        {   U32 n;
+            for (n=0; n<oSize; n+=2) {
+                huffWeight[n]   = ip[n/2] >> 4;
+                huffWeight[n+1] = ip[n/2] & 15;
+    }   }   }
+    else  {   /* header compressed with FSE (normal case) */
+        FSE_DTable fseWorkspace[FSE_DTABLE_SIZE_U32(6)];  /* 6 is max possible tableLog for HUF header (maybe even 5, to be tested) */
+        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+        oSize = FSE_decompress_wksp(huffWeight, hwSize-1, ip+1, iSize, fseWorkspace, 6);   /* max (hwSize-1) values decoded, as last one is implied */
+        if (FSE_isError(oSize)) return oSize;
+    }
+
+    /* collect weight stats */
+    memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
+    weightTotal = 0;
+    {   U32 n; for (n=0; n<oSize; n++) {
+            if (huffWeight[n] >= HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+            rankStats[huffWeight[n]]++;
+            weightTotal += (1 << huffWeight[n]) >> 1;
+    }   }
+    if (weightTotal == 0) return ERROR(corruption_detected);
+
+    /* get last non-null symbol weight (implied, total must be 2^n) */
+    {   U32 const tableLog = BIT_highbit32(weightTotal) + 1;
+        if (tableLog > HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+        *tableLogPtr = tableLog;
+        /* determine last weight */
+        {   U32 const total = 1 << tableLog;
+            U32 const rest = total - weightTotal;
+            U32 const verif = 1 << BIT_highbit32(rest);
+            U32 const lastWeight = BIT_highbit32(rest) + 1;
+            if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
+            huffWeight[oSize] = (BYTE)lastWeight;
+            rankStats[lastWeight]++;
+    }   }
+
+    /* check tree construction validity */
+    if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
+
+    /* results */
+    *nbSymbolsPtr = (U32)(oSize+1);
+    return iSize+1;
+}
diff --git a/contrib/linux-kernel/lib/error_private.c b/contrib/linux-kernel/lib/error_private.c
new file mode 100644
index 000000000..44ae20104
--- /dev/null
+++ b/contrib/linux-kernel/lib/error_private.c
@@ -0,0 +1,44 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+/* The purpose of this file is to have a single list of error strings embedded in binary */
+
+#include "error_private.h"
+
+const char* ERR_getErrorString(ERR_enum code)
+{
+    static const char* const notErrorCode = "Unspecified error code";
+    switch( code )
+    {
+    case PREFIX(no_error): return "No error detected";
+    case PREFIX(GENERIC):  return "Error (generic)";
+    case PREFIX(prefix_unknown): return "Unknown frame descriptor";
+    case PREFIX(version_unsupported): return "Version not supported";
+    case PREFIX(parameter_unknown): return "Unknown parameter type";
+    case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
+    case PREFIX(frameParameter_unsupportedBy32bits): return "Frame parameter unsupported in 32-bits mode";
+    case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
+    case PREFIX(compressionParameter_unsupported): return "Compression parameter is out of bound";
+    case PREFIX(init_missing): return "Context should be init first";
+    case PREFIX(memory_allocation): return "Allocation error : not enough memory";
+    case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
+    case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
+    case PREFIX(srcSize_wrong): return "Src size incorrect";
+    case PREFIX(corruption_detected): return "Corrupted block detected";
+    case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
+    case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
+    case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
+    case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
+    case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
+    case PREFIX(dictionary_wrong): return "Dictionary mismatch";
+    case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
+    case PREFIX(maxCode):
+    default: return notErrorCode;
+    }
+}
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
new file mode 100644
index 000000000..1bc2e4954
--- /dev/null
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -0,0 +1,76 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+/* Note : this module is expected to remain private, do not expose it */
+
+#ifndef ERROR_H_MODULE
+#define ERROR_H_MODULE
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+
+/* ****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>        /* size_t */
+#include "zstd_errors.h"  /* enum list */
+
+
+/* ****************************************
+*  Compiler-specific
+******************************************/
+#if defined(__GNUC__)
+#  define ERR_STATIC static __attribute__((unused))
+#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#  define ERR_STATIC static inline
+#elif defined(_MSC_VER)
+#  define ERR_STATIC static __inline
+#else
+#  define ERR_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
+#endif
+
+
+/*-****************************************
+*  Customization (error_public.h)
+******************************************/
+typedef ZSTD_ErrorCode ERR_enum;
+#define PREFIX(name) ZSTD_error_##name
+
+
+/*-****************************************
+*  Error codes handling
+******************************************/
+#ifdef ERROR
+#  undef ERROR   /* reported already defined on VS 2015 (Rich Geldreich) */
+#endif
+#define ERROR(name) ((size_t)-PREFIX(name))
+
+ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
+
+ERR_STATIC ERR_enum ERR_getErrorCode(size_t code) { if (!ERR_isError(code)) return (ERR_enum)0; return (ERR_enum) (0-code); }
+
+
+/*-****************************************
+*  Error Strings
+******************************************/
+
+const char* ERR_getErrorString(ERR_enum code);   /* error_private.c */
+
+ERR_STATIC const char* ERR_getErrorName(size_t code)
+{
+    return ERR_getErrorString(ERR_getErrorCode(code));
+}
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif /* ERROR_H_MODULE */
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
new file mode 100644
index 000000000..baac39032
--- /dev/null
+++ b/contrib/linux-kernel/lib/fse.h
@@ -0,0 +1,694 @@
+/* ******************************************************************
+   FSE : Finite State Entropy codec
+   Public Prototypes declaration
+   Copyright (C) 2013-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+****************************************************************** */
+#ifndef FSE_H
+#define FSE_H
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+
+/*-*****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>    /* size_t, ptrdiff_t */
+
+
+/*-*****************************************
+*  FSE_PUBLIC_API : control library symbols visibility
+******************************************/
+#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
+#  define FSE_PUBLIC_API __attribute__ ((visibility ("default")))
+#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
+#  define FSE_PUBLIC_API __declspec(dllexport)
+#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
+#  define FSE_PUBLIC_API __declspec(dllimport) /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define FSE_PUBLIC_API
+#endif
+
+/*------   Version   ------*/
+#define FSE_VERSION_MAJOR    0
+#define FSE_VERSION_MINOR    9
+#define FSE_VERSION_RELEASE  0
+
+#define FSE_LIB_VERSION FSE_VERSION_MAJOR.FSE_VERSION_MINOR.FSE_VERSION_RELEASE
+#define FSE_QUOTE(str) #str
+#define FSE_EXPAND_AND_QUOTE(str) FSE_QUOTE(str)
+#define FSE_VERSION_STRING FSE_EXPAND_AND_QUOTE(FSE_LIB_VERSION)
+
+#define FSE_VERSION_NUMBER  (FSE_VERSION_MAJOR *100*100 + FSE_VERSION_MINOR *100 + FSE_VERSION_RELEASE)
+FSE_PUBLIC_API unsigned FSE_versionNumber(void);   /**< library version number; to be used when checking dll version */
+
+/*-****************************************
+*  FSE simple functions
+******************************************/
+/*! FSE_compress() :
+    Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
+    'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
+    @return : size of compressed data (<= dstCapacity).
+    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
+                     if FSE_isError(return), compression failed (more details using FSE_getErrorName())
+*/
+FSE_PUBLIC_API size_t FSE_compress(void* dst, size_t dstCapacity,
+                             const void* src, size_t srcSize);
+
+/*! FSE_decompress():
+    Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
+    into already allocated destination buffer 'dst', of size 'dstCapacity'.
+    @return : size of regenerated data (<= maxDstSize),
+              or an error code, which can be tested using FSE_isError() .
+
+    ** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
+    Why ? : making this distinction requires a header.
+    Header management is intentionally delegated to the user layer, which can better manage special cases.
+*/
+FSE_PUBLIC_API size_t FSE_decompress(void* dst,  size_t dstCapacity,
+                               const void* cSrc, size_t cSrcSize);
+
+
+/*-*****************************************
+*  Tool functions
+******************************************/
+FSE_PUBLIC_API size_t FSE_compressBound(size_t size);       /* maximum compressed size */
+
+/* Error Management */
+FSE_PUBLIC_API unsigned    FSE_isError(size_t code);        /* tells if a return value is an error code */
+FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error code string (useful for debugging) */
+
+
+/*-*****************************************
+*  FSE advanced functions
+******************************************/
+/*! FSE_compress2() :
+    Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
+    Both parameters can be defined as '0' to mean : use default value
+    @return : size of compressed data
+    Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
+                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
+                     if FSE_isError(return), it's an error code.
+*/
+FSE_PUBLIC_API size_t FSE_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+
+
+/*-*****************************************
+*  FSE detailed API
+******************************************/
+/*!
+FSE_compress() does the following:
+1. count symbol occurrence from source[] into table count[]
+2. normalize counters so that sum(count[]) == Power_of_2 (2^tableLog)
+3. save normalized counters to memory buffer using writeNCount()
+4. build encoding table 'CTable' from normalized counters
+5. encode the data stream using encoding table 'CTable'
+
+FSE_decompress() does the following:
+1. read normalized counters with readNCount()
+2. build decoding table 'DTable' from normalized counters
+3. decode the data stream using decoding table 'DTable'
+
+The following API allows targeting specific sub-functions for advanced tasks.
+For example, it's possible to compress several blocks using the same 'CTable',
+or to save and provide normalized distribution using external method.
+*/
+
+/* *** COMPRESSION *** */
+
+/*! FSE_count():
+    Provides the precise count of each byte within a table 'count'.
+    'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
+    *maxSymbolValuePtr will be updated if detected smaller than initial value.
+    @return : the count of the most frequent symbol (which is not identified).
+              if return == srcSize, there is only one symbol.
+              Can also return an error code, which can be tested with FSE_isError(). */
+FSE_PUBLIC_API size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
+
+/*! FSE_optimalTableLog():
+    dynamically downsize 'tableLog' when conditions are met.
+    It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
+    @return : recommended tableLog (necessarily <= 'maxTableLog') */
+FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
+
+/*! FSE_normalizeCount():
+    normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
+    'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
+    @return : tableLog,
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_normalizeCount(short* normalizedCounter, unsigned tableLog, const unsigned* count, size_t srcSize, unsigned maxSymbolValue);
+
+/*! FSE_NCountWriteBound():
+    Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
+    Typically useful for allocation purpose. */
+FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_writeNCount():
+    Compactly save 'normalizedCounter' into 'buffer'.
+    @return : size of the compressed table,
+              or an errorCode, which can be tested using FSE_isError(). */
+FSE_PUBLIC_API size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
+
+
+/*! Constructor and Destructor of FSE_CTable.
+    Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
+typedef unsigned FSE_CTable;   /* don't allocate that. It's only meant to be more restrictive than void* */
+FSE_PUBLIC_API FSE_CTable* FSE_createCTable (unsigned tableLog, unsigned maxSymbolValue);
+FSE_PUBLIC_API void        FSE_freeCTable (FSE_CTable* ct);
+
+/*! FSE_buildCTable():
+    Builds `ct`, which must be already allocated, using FSE_createCTable().
+    @return : 0, or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_compress_usingCTable():
+    Compress `src` using `ct` into `dst` which must be already allocated.
+    @return : size of compressed data (<= `dstCapacity`),
+              or 0 if compressed data could not fit into `dst`,
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_compress_usingCTable (void* dst, size_t dstCapacity, const void* src, size_t srcSize, const FSE_CTable* ct);
+
+/*!
+Tutorial :
+----------
+The first step is to count all symbols. FSE_count() does this job very fast.
+Result will be saved into 'count', a table of unsigned int, which must be already allocated, and have 'maxSymbolValuePtr[0]+1' cells.
+'src' is a table of bytes of size 'srcSize'. All values within 'src' MUST be <= maxSymbolValuePtr[0]
+maxSymbolValuePtr[0] will be updated, with its real value (necessarily <= original value)
+FSE_count() will return the number of occurrence of the most frequent symbol.
+This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
+
+The next step is to normalize the frequencies.
+FSE_normalizeCount() will ensure that sum of frequencies is == 2 ^'tableLog'.
+It also guarantees a minimum of 1 to any Symbol with frequency >= 1.
+You can use 'tableLog'==0 to mean "use default tableLog value".
+If you are unsure of which tableLog value to use, you can ask FSE_optimalTableLog(),
+which will provide the optimal valid tableLog given sourceSize, maxSymbolValue, and a user-defined maximum (0 means "default").
+
+The result of FSE_normalizeCount() will be saved into a table,
+called 'normalizedCounter', which is a table of signed short.
+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValue+1' cells.
+The return value is tableLog if everything proceeded as expected.
+It is 0 if there is a single symbol within distribution.
+If there is an error (ex: invalid tableLog value), the function will return an ErrorCode (which can be tested using FSE_isError()).
+
+'normalizedCounter' can be saved in a compact manner to a memory area using FSE_writeNCount().
+'buffer' must be already allocated.
+For guaranteed success, buffer size must be at least FSE_headerBound().
+The result of the function is the number of bytes written into 'buffer'.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError(); ex : buffer size too small).
+
+'normalizedCounter' can then be used to create the compression table 'CTable'.
+The space required by 'CTable' must be already allocated, using FSE_createCTable().
+You can then use FSE_buildCTable() to fill 'CTable'.
+If there is an error, both functions will return an ErrorCode (which can be tested using FSE_isError()).
+
+'CTable' can then be used to compress 'src', with FSE_compress_usingCTable().
+Similar to FSE_count(), the convention is that 'src' is assumed to be a table of char of size 'srcSize'
+The function returns the size of compressed data (without header), necessarily <= `dstCapacity`.
+If it returns '0', compressed data could not fit into 'dst'.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
+*/
+
+
+/* *** DECOMPRESSION *** */
+
+/*! FSE_readNCount():
+    Read compactly saved 'normalizedCounter' from 'rBuffer'.
+    @return : size read from 'rBuffer',
+              or an errorCode, which can be tested using FSE_isError().
+              maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
+FSE_PUBLIC_API size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSymbolValuePtr, unsigned* tableLogPtr, const void* rBuffer, size_t rBuffSize);
+
+/*! Constructor and Destructor of FSE_DTable.
+    Note that its size depends on 'tableLog' */
+typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
+FSE_PUBLIC_API FSE_DTable* FSE_createDTable(unsigned tableLog);
+FSE_PUBLIC_API void        FSE_freeDTable(FSE_DTable* dt);
+
+/*! FSE_buildDTable():
+    Builds 'dt', which must be already allocated, using FSE_createDTable().
+    return : 0, or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_buildDTable (FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_decompress_usingDTable():
+    Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
+    into `dst` which must be already allocated.
+    @return : size of regenerated data (necessarily <= `dstCapacity`),
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, const FSE_DTable* dt);
+
+/*!
+Tutorial :
+----------
+(Note : these functions only decompress FSE-compressed blocks.
+ If block is uncompressed, use memcpy() instead
+ If block is a single repeated byte, use memset() instead )
+
+The first step is to obtain the normalized frequencies of symbols.
+This can be performed by FSE_readNCount() if it was saved using FSE_writeNCount().
+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValuePtr[0]+1' cells of signed short.
+In practice, that means it's necessary to know 'maxSymbolValue' beforehand,
+or size the table to handle worst case situations (typically 256).
+FSE_readNCount() will provide 'tableLog' and 'maxSymbolValue'.
+The result of FSE_readNCount() is the number of bytes read from 'rBuffer'.
+Note that 'rBufferSize' must be at least 4 bytes, even if useful information is less than that.
+If there is an error, the function will return an error code, which can be tested using FSE_isError().
+
+The next step is to build the decompression tables 'FSE_DTable' from 'normalizedCounter'.
+This is performed by the function FSE_buildDTable().
+The space required by 'FSE_DTable' must be already allocated using FSE_createDTable().
+If there is an error, the function will return an error code, which can be tested using FSE_isError().
+
+`FSE_DTable` can then be used to decompress `cSrc`, with FSE_decompress_usingDTable().
+`cSrcSize` must be strictly correct, otherwise decompression will fail.
+FSE_decompress_usingDTable() result will tell how many bytes were regenerated (<=`dstCapacity`).
+If there is an error, the function will return an error code, which can be tested using FSE_isError(). (ex: dst buffer too small)
+*/
+
+
+#ifdef FSE_STATIC_LINKING_ONLY
+
+/* *** Dependency *** */
+#include "bitstream.h"
+
+
+/* *****************************************
+*  Static allocation
+*******************************************/
+/* FSE buffer bounds */
+#define FSE_NCOUNTBOUND 512
+#define FSE_BLOCKBOUND(size) (size + (size>>7))
+#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
+
+/* It is possible to statically allocate FSE CTable/DTable as a table of FSE_CTable/FSE_DTable using below macros */
+#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue)   (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))
+#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<<maxTableLog))
+
+
+/* *****************************************
+*  FSE advanced API
+*******************************************/
+/* FSE_count_wksp() :
+ * Same as FSE_count(), but using an externally provided scratch buffer.
+ * `workSpace` size must be table of >= `1024` unsigned
+ */
+size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                 const void* source, size_t sourceSize, unsigned* workSpace);
+
+/** FSE_countFast() :
+ *  same as FSE_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr
+ */
+size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
+
+/* FSE_countFast_wksp() :
+ * Same as FSE_countFast(), but using an externally provided scratch buffer.
+ * `workSpace` must be a table of minimum `1024` unsigned
+ */
+size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize, unsigned* workSpace);
+
+/*! FSE_count_simple
+ * Same as FSE_countFast(), but does not use any additional memory (not even on stack).
+ * This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr` (presuming it's also the size of `count`).
+*/
+size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
+
+
+
+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus);
+/**< same as FSE_optimalTableLog(), which used `minus==2` */
+
+/* FSE_compress_wksp() :
+ * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
+ * FSE_WKSP_SIZE_U32() provides the minimum size required for `workSpace` as a table of FSE_CTable.
+ */
+#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + (1<<((maxTableLog>2)?(maxTableLog-2):0)) )
+size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
+
+size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits);
+/**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
+
+size_t FSE_buildCTable_rle (FSE_CTable* ct, unsigned char symbolValue);
+/**< build a fake FSE_CTable, designed to compress always the same symbolValue */
+
+/* FSE_buildCTable_wksp() :
+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
+ * `wkspSize` must be >= `(1<<tableLog)`.
+ */
+size_t FSE_buildCTable_wksp(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
+
+size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits);
+/**< build a fake FSE_DTable, designed to read a flat distribution where each symbol uses nbBits */
+
+size_t FSE_buildDTable_rle (FSE_DTable* dt, unsigned char symbolValue);
+/**< build a fake FSE_DTable, designed to always generate the same symbolValue */
+
+size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog);
+/**< same as FSE_decompress(), using an externally allocated `workSpace` produced with `FSE_DTABLE_SIZE_U32(maxLog)` */
+
+
+/* *****************************************
+*  FSE symbol compression API
+*******************************************/
+/*!
+   This API consists of small unitary functions, which highly benefit from being inlined.
+   Hence their body are included in next section.
+*/
+typedef struct {
+    ptrdiff_t   value;
+    const void* stateTable;
+    const void* symbolTT;
+    unsigned    stateLog;
+} FSE_CState_t;
+
+static void FSE_initCState(FSE_CState_t* CStatePtr, const FSE_CTable* ct);
+
+static void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* CStatePtr, unsigned symbol);
+
+static void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* CStatePtr);
+
+/**<
+These functions are inner components of FSE_compress_usingCTable().
+They allow the creation of custom streams, mixing multiple tables and bit sources.
+
+A key property to keep in mind is that encoding and decoding are done **in reverse direction**.
+So the first symbol you will encode is the last you will decode, like a LIFO stack.
+
+You will need a few variables to track your CStream. They are :
+
+FSE_CTable    ct;         // Provided by FSE_buildCTable()
+BIT_CStream_t bitStream;  // bitStream tracking structure
+FSE_CState_t  state;      // State tracking structure (can have several)
+
+
+The first thing to do is to init bitStream and state.
+    size_t errorCode = BIT_initCStream(&bitStream, dstBuffer, maxDstSize);
+    FSE_initCState(&state, ct);
+
+Note that BIT_initCStream() can produce an error code, so its result should be tested, using FSE_isError();
+You can then encode your input data, byte after byte.
+FSE_encodeSymbol() outputs a maximum of 'tableLog' bits at a time.
+Remember decoding will be done in reverse direction.
+    FSE_encodeByte(&bitStream, &state, symbol);
+
+At any time, you can also add any bit sequence.
+Note : maximum allowed nbBits is 25, for compatibility with 32-bits decoders
+    BIT_addBits(&bitStream, bitField, nbBits);
+
+The above methods don't commit data to memory, they just store it into local register, for speed.
+Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
+Writing data to memory is a manual operation, performed by the flushBits function.
+    BIT_flushBits(&bitStream);
+
+Your last FSE encoding operation shall be to flush your last state value(s).
+    FSE_flushState(&bitStream, &state);
+
+Finally, you must close the bitStream.
+The function returns the size of CStream in bytes.
+If data couldn't fit into dstBuffer, it will return a 0 ( == not compressible)
+If there is an error, it returns an errorCode (which can be tested using FSE_isError()).
+    size_t size = BIT_closeCStream(&bitStream);
+*/
+
+
+/* *****************************************
+*  FSE symbol decompression API
+*******************************************/
+typedef struct {
+    size_t      state;
+    const void* table;   /* precise table may vary, depending on U16 */
+} FSE_DState_t;
+
+
+static void     FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt);
+
+static unsigned char FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD);
+
+static unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr);
+
+/**<
+Let's now decompose FSE_decompress_usingDTable() into its unitary components.
+You will decode FSE-encoded symbols from the bitStream,
+and also any other bitFields you put in, **in reverse order**.
+
+You will need a few variables to track your bitStream. They are :
+
+BIT_DStream_t DStream;    // Stream context
+FSE_DState_t  DState;     // State context. Multiple ones are possible
+FSE_DTable*   DTablePtr;  // Decoding table, provided by FSE_buildDTable()
+
+The first thing to do is to init the bitStream.
+    errorCode = BIT_initDStream(&DStream, srcBuffer, srcSize);
+
+You should then retrieve your initial state(s)
+(in reverse flushing order if you have several ones) :
+    errorCode = FSE_initDState(&DState, &DStream, DTablePtr);
+
+You can then decode your data, symbol after symbol.
+For information the maximum number of bits read by FSE_decodeSymbol() is 'tableLog'.
+Keep in mind that symbols are decoded in reverse order, like a LIFO stack (last in, first out).
+    unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
+
+You can retrieve any bitfield you eventually stored into the bitStream (in reverse order)
+Note : maximum allowed nbBits is 25, for 32-bits compatibility
+    size_t bitField = BIT_readBits(&DStream, nbBits);
+
+All above operations only read from local register (which size depends on size_t).
+Refueling the register from memory is manually performed by the reload method.
+    endSignal = FSE_reloadDStream(&DStream);
+
+BIT_reloadDStream() result tells if there is still some more data to read from DStream.
+BIT_DStream_unfinished : there is still some data left into the DStream.
+BIT_DStream_endOfBuffer : Dstream reached end of buffer. Its container may no longer be completely filled.
+BIT_DStream_completed : Dstream reached its exact end, corresponding in general to decompression completed.
+BIT_DStream_tooFar : Dstream went too far. Decompression result is corrupted.
+
+When reaching end of buffer (BIT_DStream_endOfBuffer), progress slowly, notably if you decode multiple symbols per loop,
+to properly detect the exact end of stream.
+After each decoded symbol, check if DStream is fully consumed using this simple test :
+    BIT_reloadDStream(&DStream) >= BIT_DStream_completed
+
+When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
+Checking if DStream has reached its end is performed by :
+    BIT_endOfDStream(&DStream);
+Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
+    FSE_endOfDState(&DState);
+*/
+
+
+/* *****************************************
+*  FSE unsafe API
+*******************************************/
+static unsigned char FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD);
+/* faster, but works only if nbBits is always >= 1 (otherwise, result will be corrupted) */
+
+
+/* *****************************************
+*  Implementation of inlined functions
+*******************************************/
+typedef struct {
+    int deltaFindState;
+    U32 deltaNbBits;
+} FSE_symbolCompressionTransform; /* total 8 bytes */
+
+MEM_STATIC void FSE_initCState(FSE_CState_t* statePtr, const FSE_CTable* ct)
+{
+    const void* ptr = ct;
+    const U16* u16ptr = (const U16*) ptr;
+    const U32 tableLog = MEM_read16(ptr);
+    statePtr->value = (ptrdiff_t)1<<tableLog;
+    statePtr->stateTable = u16ptr+2;
+    statePtr->symbolTT = ((const U32*)ct + 1 + (tableLog ? (1<<(tableLog-1)) : 1));
+    statePtr->stateLog = tableLog;
+}
+
+
+/*! FSE_initCState2() :
+*   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
+*   uses the smallest state value possible, saving the cost of this symbol */
+MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol)
+{
+    FSE_initCState(statePtr, ct);
+    {   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+        const U16* stateTable = (const U16*)(statePtr->stateTable);
+        U32 nbBitsOut  = (U32)((symbolTT.deltaNbBits + (1<<15)) >> 16);
+        statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
+        statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+    }
+}
+
+MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, U32 symbol)
+{
+    const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+    const U16* const stateTable = (const U16*)(statePtr->stateTable);
+    U32 nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
+    BIT_addBits(bitC, statePtr->value, nbBitsOut);
+    statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+}
+
+MEM_STATIC void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* statePtr)
+{
+    BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
+    BIT_flushBits(bitC);
+}
+
+
+/* ======    Decompression    ====== */
+
+typedef struct {
+    U16 tableLog;
+    U16 fastMode;
+} FSE_DTableHeader;   /* sizeof U32 */
+
+typedef struct
+{
+    unsigned short newState;
+    unsigned char  symbol;
+    unsigned char  nbBits;
+} FSE_decode_t;   /* size == U32 */
+
+MEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)
+{
+    const void* ptr = dt;
+    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
+    DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
+    BIT_reloadDStream(bitD);
+    DStatePtr->table = dt + 1;
+}
+
+MEM_STATIC BYTE FSE_peekSymbol(const FSE_DState_t* DStatePtr)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    return DInfo.symbol;
+}
+
+MEM_STATIC void FSE_updateState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+    DStatePtr->state = DInfo.newState + lowBits;
+}
+
+MEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    BYTE const symbol = DInfo.symbol;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+
+    DStatePtr->state = DInfo.newState + lowBits;
+    return symbol;
+}
+
+/*! FSE_decodeSymbolFast() :
+    unsafe, only works if no symbol has a probability > 50% */
+MEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    BYTE const symbol = DInfo.symbol;
+    size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
+
+    DStatePtr->state = DInfo.newState + lowBits;
+    return symbol;
+}
+
+MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
+{
+    return DStatePtr->state == 0;
+}
+
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+/* **************************************************************
+*  Tuning parameters
+****************************************************************/
+/*!MEMORY_USAGE :
+*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
+*  Increasing memory usage improves compression ratio
+*  Reduced memory usage can improve speed, due to cache effect
+*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
+#ifndef FSE_MAX_MEMORY_USAGE
+#  define FSE_MAX_MEMORY_USAGE 14
+#endif
+#ifndef FSE_DEFAULT_MEMORY_USAGE
+#  define FSE_DEFAULT_MEMORY_USAGE 13
+#endif
+
+/*!FSE_MAX_SYMBOL_VALUE :
+*  Maximum symbol value authorized.
+*  Required for proper stack allocation */
+#ifndef FSE_MAX_SYMBOL_VALUE
+#  define FSE_MAX_SYMBOL_VALUE 255
+#endif
+
+/* **************************************************************
+*  template functions type & suffix
+****************************************************************/
+#define FSE_FUNCTION_TYPE BYTE
+#define FSE_FUNCTION_EXTENSION
+#define FSE_DECODE_TYPE FSE_decode_t
+
+
+#endif   /* !FSE_COMMONDEFS_ONLY */
+
+
+/* ***************************************************************
+*  Constants
+*****************************************************************/
+#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
+#define FSE_MAX_TABLESIZE (1U<<FSE_MAX_TABLELOG)
+#define FSE_MAXTABLESIZE_MASK (FSE_MAX_TABLESIZE-1)
+#define FSE_DEFAULT_TABLELOG (FSE_DEFAULT_MEMORY_USAGE-2)
+#define FSE_MIN_TABLELOG 5
+
+#define FSE_TABLELOG_ABSOLUTE_MAX 15
+#if FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX
+#  error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
+#endif
+
+#define FSE_TABLESTEP(tableSize) ((tableSize>>1) + (tableSize>>3) + 3)
+
+
+#endif /* FSE_STATIC_LINKING_ONLY */
+
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif  /* FSE_H */
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
new file mode 100644
index 000000000..13654d6e6
--- /dev/null
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -0,0 +1,857 @@
+/* ******************************************************************
+   FSE : Finite State Entropy encoder
+   Copyright (C) 2013-2015, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    You can contact the author at :
+    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+****************************************************************** */
+
+/* **************************************************************
+*  Compiler specifics
+****************************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  define FORCE_INLINE static __forceinline
+#  include <intrin.h>                    /* For Visual 2005 */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
+#else
+#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#    ifdef __GNUC__
+#      define FORCE_INLINE static inline __attribute__((always_inline))
+#    else
+#      define FORCE_INLINE static inline
+#    endif
+#  else
+#    define FORCE_INLINE static
+#  endif /* __STDC_VERSION__ */
+#endif
+
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <stdlib.h>     /* malloc, free, qsort */
+#include <string.h>     /* memcpy, memset */
+#include <stdio.h>      /* printf (debug) */
+#include "bitstream.h"
+#define FSE_STATIC_LINKING_ONLY
+#include "fse.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
+
+
+/* **************************************************************
+*  Templates
+****************************************************************/
+/*
+  designed to be included
+  for type-specific functions (template emulation in C)
+  Objective is to write these functions only once, for improved maintenance
+*/
+
+/* safety checks */
+#ifndef FSE_FUNCTION_EXTENSION
+#  error "FSE_FUNCTION_EXTENSION must be defined"
+#endif
+#ifndef FSE_FUNCTION_TYPE
+#  error "FSE_FUNCTION_TYPE must be defined"
+#endif
+
+/* Function names */
+#define FSE_CAT(X,Y) X##Y
+#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
+#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
+
+
+/* Function templates */
+
+/* FSE_buildCTable_wksp() :
+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
+ * wkspSize should be sized to handle worst case situation, which is `1<<max_tableLog * sizeof(FSE_FUNCTION_TYPE)`
+ * workSpace must also be properly aligned with FSE_FUNCTION_TYPE requirements
+ */
+size_t FSE_buildCTable_wksp(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize)
+{
+    U32 const tableSize = 1 << tableLog;
+    U32 const tableMask = tableSize - 1;
+    void* const ptr = ct;
+    U16* const tableU16 = ( (U16*) ptr) + 2;
+    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableLog ? tableSize>>1 : 1) ;
+    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+    U32 const step = FSE_TABLESTEP(tableSize);
+    U32 cumul[FSE_MAX_SYMBOL_VALUE+2];
+
+    FSE_FUNCTION_TYPE* const tableSymbol = (FSE_FUNCTION_TYPE*)workSpace;
+    U32 highThreshold = tableSize-1;
+
+    /* CTable header */
+    if (((size_t)1 << tableLog) * sizeof(FSE_FUNCTION_TYPE) > wkspSize) return ERROR(tableLog_tooLarge);
+    tableU16[-2] = (U16) tableLog;
+    tableU16[-1] = (U16) maxSymbolValue;
+
+    /* For explanations on how to distribute symbol values over the table :
+    *  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
+
+    /* symbol start positions */
+    {   U32 u;
+        cumul[0] = 0;
+        for (u=1; u<=maxSymbolValue+1; u++) {
+            if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */
+                cumul[u] = cumul[u-1] + 1;
+                tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);
+            } else {
+                cumul[u] = cumul[u-1] + normalizedCounter[u-1];
+        }   }
+        cumul[maxSymbolValue+1] = tableSize+1;
+    }
+
+    /* Spread symbols */
+    {   U32 position = 0;
+        U32 symbol;
+        for (symbol=0; symbol<=maxSymbolValue; symbol++) {
+            int nbOccurences;
+            for (nbOccurences=0; nbOccurences<normalizedCounter[symbol]; nbOccurences++) {
+                tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
+                position = (position + step) & tableMask;
+                while (position > highThreshold) position = (position + step) & tableMask;   /* Low proba area */
+        }   }
+
+        if (position!=0) return ERROR(GENERIC);   /* Must have gone through all positions */
+    }
+
+    /* Build table */
+    {   U32 u; for (u=0; u<tableSize; u++) {
+        FSE_FUNCTION_TYPE s = tableSymbol[u];   /* note : static analyzer may not understand tableSymbol is properly initialized */
+        tableU16[cumul[s]++] = (U16) (tableSize+u);   /* TableU16 : sorted by symbol order; gives next state value */
+    }   }
+
+    /* Build Symbol Transformation Table */
+    {   unsigned total = 0;
+        unsigned s;
+        for (s=0; s<=maxSymbolValue; s++) {
+            switch (normalizedCounter[s])
+            {
+            case  0: break;
+
+            case -1:
+            case  1:
+                symbolTT[s].deltaNbBits = (tableLog << 16) - (1<<tableLog);
+                symbolTT[s].deltaFindState = total - 1;
+                total ++;
+                break;
+            default :
+                {
+                    U32 const maxBitsOut = tableLog - BIT_highbit32 (normalizedCounter[s]-1);
+                    U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
+                    symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
+                    symbolTT[s].deltaFindState = total - normalizedCounter[s];
+                    total +=  normalizedCounter[s];
+    }   }   }   }
+
+    return 0;
+}
+
+
+size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    FSE_FUNCTION_TYPE tableSymbol[FSE_MAX_TABLESIZE];   /* memset() is not necessary, even if static analyzer complain about it */
+    return FSE_buildCTable_wksp(ct, normalizedCounter, maxSymbolValue, tableLog, tableSymbol, sizeof(tableSymbol));
+}
+
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+/*-**************************************************************
+*  FSE NCount encoding-decoding
+****************************************************************/
+size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)
+{
+    size_t const maxHeaderSize = (((maxSymbolValue+1) * tableLog) >> 3) + 3;
+    return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */
+}
+
+static size_t FSE_writeNCount_generic (void* header, size_t headerBufferSize,
+                                       const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
+                                       unsigned writeIsSafe)
+{
+    BYTE* const ostart = (BYTE*) header;
+    BYTE* out = ostart;
+    BYTE* const oend = ostart + headerBufferSize;
+    int nbBits;
+    const int tableSize = 1 << tableLog;
+    int remaining;
+    int threshold;
+    U32 bitStream;
+    int bitCount;
+    unsigned charnum = 0;
+    int previous0 = 0;
+
+    bitStream = 0;
+    bitCount  = 0;
+    /* Table Size */
+    bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;
+    bitCount  += 4;
+
+    /* Init */
+    remaining = tableSize+1;   /* +1 for extra accuracy */
+    threshold = tableSize;
+    nbBits = tableLog+1;
+
+    while (remaining>1) {  /* stops at 1 */
+        if (previous0) {
+            unsigned start = charnum;
+            while (!normalizedCounter[charnum]) charnum++;
+            while (charnum >= start+24) {
+                start+=24;
+                bitStream += 0xFFFFU << bitCount;
+                if ((!writeIsSafe) && (out > oend-2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+                out[0] = (BYTE) bitStream;
+                out[1] = (BYTE)(bitStream>>8);
+                out+=2;
+                bitStream>>=16;
+            }
+            while (charnum >= start+3) {
+                start+=3;
+                bitStream += 3 << bitCount;
+                bitCount += 2;
+            }
+            bitStream += (charnum-start) << bitCount;
+            bitCount += 2;
+            if (bitCount>16) {
+                if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+                out[0] = (BYTE)bitStream;
+                out[1] = (BYTE)(bitStream>>8);
+                out += 2;
+                bitStream >>= 16;
+                bitCount -= 16;
+        }   }
+        {   int count = normalizedCounter[charnum++];
+            int const max = (2*threshold-1)-remaining;
+            remaining -= count < 0 ? -count : count;
+            count++;   /* +1 for extra accuracy */
+            if (count>=threshold) count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
+            bitStream += count << bitCount;
+            bitCount  += nbBits;
+            bitCount  -= (count<max);
+            previous0  = (count==1);
+            if (remaining<1) return ERROR(GENERIC);
+            while (remaining<threshold) nbBits--, threshold>>=1;
+        }
+        if (bitCount>16) {
+            if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+            out[0] = (BYTE)bitStream;
+            out[1] = (BYTE)(bitStream>>8);
+            out += 2;
+            bitStream >>= 16;
+            bitCount -= 16;
+    }   }
+
+    /* flush remaining bitStream */
+    if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+    out[0] = (BYTE)bitStream;
+    out[1] = (BYTE)(bitStream>>8);
+    out+= (bitCount+7) /8;
+
+    if (charnum > maxSymbolValue + 1) return ERROR(GENERIC);
+
+    return (out-ostart);
+}
+
+
+size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
+    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
+
+    if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
+        return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
+
+    return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
+}
+
+
+
+/*-**************************************************************
+*  Counting histogram
+****************************************************************/
+/*! FSE_count_simple
+    This function counts byte values within `src`, and store the histogram into table `count`.
+    It doesn't use any additional memory.
+    But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
+    For this reason, prefer using a table `count` with 256 elements.
+    @return : count of most numerous element
+*/
+size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
+                        const void* src, size_t srcSize)
+{
+    const BYTE* ip = (const BYTE*)src;
+    const BYTE* const end = ip + srcSize;
+    unsigned maxSymbolValue = *maxSymbolValuePtr;
+    unsigned max=0;
+
+    memset(count, 0, (maxSymbolValue+1)*sizeof(*count));
+    if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }
+
+    while (ip<end) count[*ip++]++;
+
+    while (!count[maxSymbolValue]) maxSymbolValue--;
+    *maxSymbolValuePtr = maxSymbolValue;
+
+    { U32 s; for (s=0; s<=maxSymbolValue; s++) if (count[s] > max) max = count[s]; }
+
+    return (size_t)max;
+}
+
+
+/* FSE_count_parallel_wksp() :
+ * Same as FSE_count_parallel(), but using an externally provided scratch buffer.
+ * `workSpace` size must be a minimum of `1024 * sizeof(unsigned)`` */
+static size_t FSE_count_parallel_wksp(
+                                unsigned* count, unsigned* maxSymbolValuePtr,
+                                const void* source, size_t sourceSize,
+                                unsigned checkMax, unsigned* const workSpace)
+{
+    const BYTE* ip = (const BYTE*)source;
+    const BYTE* const iend = ip+sourceSize;
+    unsigned maxSymbolValue = *maxSymbolValuePtr;
+    unsigned max=0;
+    U32* const Counting1 = workSpace;
+    U32* const Counting2 = Counting1 + 256;
+    U32* const Counting3 = Counting2 + 256;
+    U32* const Counting4 = Counting3 + 256;
+
+    memset(Counting1, 0, 4*256*sizeof(unsigned));
+
+    /* safety checks */
+    if (!sourceSize) {
+        memset(count, 0, maxSymbolValue + 1);
+        *maxSymbolValuePtr = 0;
+        return 0;
+    }
+    if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */
+
+    /* by stripes of 16 bytes */
+    {   U32 cached = MEM_read32(ip); ip += 4;
+        while (ip < iend-15) {
+            U32 c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+        }
+        ip-=4;
+    }
+
+    /* finish last symbols */
+    while (ip<iend) Counting1[*ip++]++;
+
+    if (checkMax) {   /* verify stats will fit into destination table */
+        U32 s; for (s=255; s>maxSymbolValue; s--) {
+            Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
+            if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);
+    }   }
+
+    {   U32 s; for (s=0; s<=maxSymbolValue; s++) {
+            count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
+            if (count[s] > max) max = count[s];
+    }   }
+
+    while (!count[maxSymbolValue]) maxSymbolValue--;
+    *maxSymbolValuePtr = maxSymbolValue;
+    return (size_t)max;
+}
+
+/* FSE_countFast_wksp() :
+ * Same as FSE_countFast(), but using an externally provided scratch buffer.
+ * `workSpace` size must be table of >= `1024` unsigned */
+size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                     const void* source, size_t sourceSize, unsigned* workSpace)
+{
+    if (sourceSize < 1500) return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
+    return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
+}
+
+/* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
+size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
+                     const void* source, size_t sourceSize)
+{
+    unsigned tmpCounters[1024];
+    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters);
+}
+
+/* FSE_count_wksp() :
+ * Same as FSE_count(), but using an externally provided scratch buffer.
+ * `workSpace` size must be table of >= `1024` unsigned */
+size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                 const void* source, size_t sourceSize, unsigned* workSpace)
+{
+    if (*maxSymbolValuePtr < 255)
+        return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
+    *maxSymbolValuePtr = 255;
+    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
+}
+
+size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,
+                 const void* src, size_t srcSize)
+{
+    unsigned tmpCounters[1024];
+    return FSE_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters);
+}
+
+
+
+/*-**************************************************************
+*  FSE Compression Code
+****************************************************************/
+/*! FSE_sizeof_CTable() :
+    FSE_CTable is a variable size structure which contains :
+    `U16 tableLog;`
+    `U16 maxSymbolValue;`
+    `U16 nextStateNumber[1 << tableLog];`                         // This size is variable
+    `FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
+Allocation is manual (C standard does not support variable-size structures).
+*/
+size_t FSE_sizeof_CTable (unsigned maxSymbolValue, unsigned tableLog)
+{
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+    return FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
+}
+
+FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)
+{
+    size_t size;
+    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+    size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
+    return (FSE_CTable*)malloc(size);
+}
+
+void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
+
+/* provides the minimum logSize to safely represent a distribution */
+static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
+{
+    U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
+    U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
+    U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
+    return minBits;
+}
+
+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
+{
+    U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
+    U32 tableLog = maxTableLog;
+    U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
+    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+    if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
+    if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
+    if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
+    if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
+    return tableLog;
+}
+
+unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
+{
+    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
+}
+
+
+/* Secondary normalization method.
+   To be used when primary method fails. */
+
+static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue)
+{
+    short const NOT_YET_ASSIGNED = -2;
+    U32 s;
+    U32 distributed = 0;
+    U32 ToDistribute;
+
+    /* Init */
+    U32 const lowThreshold = (U32)(total >> tableLog);
+    U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
+
+    for (s=0; s<=maxSymbolValue; s++) {
+        if (count[s] == 0) {
+            norm[s]=0;
+            continue;
+        }
+        if (count[s] <= lowThreshold) {
+            norm[s] = -1;
+            distributed++;
+            total -= count[s];
+            continue;
+        }
+        if (count[s] <= lowOne) {
+            norm[s] = 1;
+            distributed++;
+            total -= count[s];
+            continue;
+        }
+
+        norm[s]=NOT_YET_ASSIGNED;
+    }
+    ToDistribute = (1 << tableLog) - distributed;
+
+    if ((total / ToDistribute) > lowOne) {
+        /* risk of rounding to zero */
+        lowOne = (U32)((total * 3) / (ToDistribute * 2));
+        for (s=0; s<=maxSymbolValue; s++) {
+            if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
+                norm[s] = 1;
+                distributed++;
+                total -= count[s];
+                continue;
+        }   }
+        ToDistribute = (1 << tableLog) - distributed;
+    }
+
+    if (distributed == maxSymbolValue+1) {
+        /* all values are pretty poor;
+           probably incompressible data (should have already been detected);
+           find max, then give all remaining points to max */
+        U32 maxV = 0, maxC = 0;
+        for (s=0; s<=maxSymbolValue; s++)
+            if (count[s] > maxC) maxV=s, maxC=count[s];
+        norm[maxV] += (short)ToDistribute;
+        return 0;
+    }
+
+    if (total == 0) {
+        /* all of the symbols were low enough for the lowOne or lowThreshold */
+        for (s=0; ToDistribute > 0; s = (s+1)%(maxSymbolValue+1))
+            if (norm[s] > 0) ToDistribute--, norm[s]++;
+        return 0;
+    }
+
+    {   U64 const vStepLog = 62 - tableLog;
+        U64 const mid = (1ULL << (vStepLog-1)) - 1;
+        U64 const rStep = ((((U64)1<<vStepLog) * ToDistribute) + mid) / total;   /* scale on remaining */
+        U64 tmpTotal = mid;
+        for (s=0; s<=maxSymbolValue; s++) {
+            if (norm[s]==NOT_YET_ASSIGNED) {
+                U64 const end = tmpTotal + (count[s] * rStep);
+                U32 const sStart = (U32)(tmpTotal >> vStepLog);
+                U32 const sEnd = (U32)(end >> vStepLog);
+                U32 const weight = sEnd - sStart;
+                if (weight < 1)
+                    return ERROR(GENERIC);
+                norm[s] = (short)weight;
+                tmpTotal = end;
+    }   }   }
+
+    return 0;
+}
+
+
+size_t FSE_normalizeCount (short* normalizedCounter, unsigned tableLog,
+                           const unsigned* count, size_t total,
+                           unsigned maxSymbolValue)
+{
+    /* Sanity checks */
+    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported size */
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported size */
+    if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC);   /* Too small tableLog, compression potentially impossible */
+
+    {   U32 const rtbTable[] = {     0, 473195, 504333, 520860, 550000, 700000, 750000, 830000 };
+        U64 const scale = 62 - tableLog;
+        U64 const step = ((U64)1<<62) / total;   /* <== here, one division ! */
+        U64 const vStep = 1ULL<<(scale-20);
+        int stillToDistribute = 1<<tableLog;
+        unsigned s;
+        unsigned largest=0;
+        short largestP=0;
+        U32 lowThreshold = (U32)(total >> tableLog);
+
+        for (s=0; s<=maxSymbolValue; s++) {
+            if (count[s] == total) return 0;   /* rle special case */
+            if (count[s] == 0) { normalizedCounter[s]=0; continue; }
+            if (count[s] <= lowThreshold) {
+                normalizedCounter[s] = -1;
+                stillToDistribute--;
+            } else {
+                short proba = (short)((count[s]*step) >> scale);
+                if (proba<8) {
+                    U64 restToBeat = vStep * rtbTable[proba];
+                    proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
+                }
+                if (proba > largestP) largestP=proba, largest=s;
+                normalizedCounter[s] = proba;
+                stillToDistribute -= proba;
+        }   }
+        if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
+            /* corner case, need another normalization method */
+            size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
+            if (FSE_isError(errorCode)) return errorCode;
+        }
+        else normalizedCounter[largest] += (short)stillToDistribute;
+    }
+
+#if 0
+    {   /* Print Table (debug) */
+        U32 s;
+        U32 nTotal = 0;
+        for (s=0; s<=maxSymbolValue; s++)
+            printf("%3i: %4i \n", s, normalizedCounter[s]);
+        for (s=0; s<=maxSymbolValue; s++)
+            nTotal += abs(normalizedCounter[s]);
+        if (nTotal != (1U<<tableLog))
+            printf("Warning !!! Total == %u != %u !!!", nTotal, 1U<<tableLog);
+        getchar();
+    }
+#endif
+
+    return tableLog;
+}
+
+
+/* fake FSE_CTable, for raw (uncompressed) input */
+size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits)
+{
+    const unsigned tableSize = 1 << nbBits;
+    const unsigned tableMask = tableSize - 1;
+    const unsigned maxSymbolValue = tableMask;
+    void* const ptr = ct;
+    U16* const tableU16 = ( (U16*) ptr) + 2;
+    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableSize>>1);   /* assumption : tableLog >= 1 */
+    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+    unsigned s;
+
+    /* Sanity checks */
+    if (nbBits < 1) return ERROR(GENERIC);             /* min size */
+
+    /* header */
+    tableU16[-2] = (U16) nbBits;
+    tableU16[-1] = (U16) maxSymbolValue;
+
+    /* Build table */
+    for (s=0; s<tableSize; s++)
+        tableU16[s] = (U16)(tableSize + s);
+
+    /* Build Symbol Transformation Table */
+    {   const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
+        for (s=0; s<=maxSymbolValue; s++) {
+            symbolTT[s].deltaNbBits = deltaNbBits;
+            symbolTT[s].deltaFindState = s-1;
+    }   }
+
+    return 0;
+}
+
+/* fake FSE_CTable, for rle input (always same symbol) */
+size_t FSE_buildCTable_rle (FSE_CTable* ct, BYTE symbolValue)
+{
+    void* ptr = ct;
+    U16* tableU16 = ( (U16*) ptr) + 2;
+    void* FSCTptr = (U32*)ptr + 2;
+    FSE_symbolCompressionTransform* symbolTT = (FSE_symbolCompressionTransform*) FSCTptr;
+
+    /* header */
+    tableU16[-2] = (U16) 0;
+    tableU16[-1] = (U16) symbolValue;
+
+    /* Build table */
+    tableU16[0] = 0;
+    tableU16[1] = 0;   /* just in case */
+
+    /* Build Symbol Transformation Table */
+    symbolTT[symbolValue].deltaNbBits = 0;
+    symbolTT[symbolValue].deltaFindState = 0;
+
+    return 0;
+}
+
+
+static size_t FSE_compress_usingCTable_generic (void* dst, size_t dstSize,
+                           const void* src, size_t srcSize,
+                           const FSE_CTable* ct, const unsigned fast)
+{
+    const BYTE* const istart = (const BYTE*) src;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* ip=iend;
+
+    BIT_CStream_t bitC;
+    FSE_CState_t CState1, CState2;
+
+    /* init */
+    if (srcSize <= 2) return 0;
+    { size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
+      if (FSE_isError(initError)) return 0; /* not enough space available to write a bitstream */ }
+
+#define FSE_FLUSHBITS(s)  (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
+
+    if (srcSize & 1) {
+        FSE_initCState2(&CState1, ct, *--ip);
+        FSE_initCState2(&CState2, ct, *--ip);
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        FSE_FLUSHBITS(&bitC);
+    } else {
+        FSE_initCState2(&CState2, ct, *--ip);
+        FSE_initCState2(&CState1, ct, *--ip);
+    }
+
+    /* join to mod 4 */
+    srcSize -= 2;
+    if ((sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) && (srcSize & 2)) {  /* test bit 2 */
+        FSE_encodeSymbol(&bitC, &CState2, *--ip);
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        FSE_FLUSHBITS(&bitC);
+    }
+
+    /* 2 or 4 encoding per loop */
+    while ( ip>istart ) {
+
+        FSE_encodeSymbol(&bitC, &CState2, *--ip);
+
+        if (sizeof(bitC.bitContainer)*8 < FSE_MAX_TABLELOG*2+7 )   /* this test must be static */
+            FSE_FLUSHBITS(&bitC);
+
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+
+        if (sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) {  /* this test must be static */
+            FSE_encodeSymbol(&bitC, &CState2, *--ip);
+            FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        }
+
+        FSE_FLUSHBITS(&bitC);
+    }
+
+    FSE_flushCState(&bitC, &CState2);
+    FSE_flushCState(&bitC, &CState1);
+    return BIT_closeCStream(&bitC);
+}
+
+size_t FSE_compress_usingCTable (void* dst, size_t dstSize,
+                           const void* src, size_t srcSize,
+                           const FSE_CTable* ct)
+{
+    unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
+
+    if (fast)
+        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
+    else
+        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
+}
+
+
+size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
+
+#define CHECK_V_F(e, f) size_t const e = f; if (ERR_isError(e)) return f
+#define CHECK_F(f)   { CHECK_V_F(_var_err__, f); }
+
+/* FSE_compress_wksp() :
+ * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
+ * `wkspSize` size must be `(1<<tableLog)`.
+ */
+size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const oend = ostart + dstSize;
+
+    U32   count[FSE_MAX_SYMBOL_VALUE+1];
+    S16   norm[FSE_MAX_SYMBOL_VALUE+1];
+    FSE_CTable* CTable = (FSE_CTable*)workSpace;
+    size_t const CTableSize = FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue);
+    void* scratchBuffer = (void*)(CTable + CTableSize);
+    size_t const scratchBufferSize = wkspSize - (CTableSize * sizeof(FSE_CTable));
+
+    /* init conditions */
+    if (wkspSize < FSE_WKSP_SIZE_U32(tableLog, maxSymbolValue)) return ERROR(tableLog_tooLarge);
+    if (srcSize <= 1) return 0;  /* Not compressible */
+    if (!maxSymbolValue) maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+    if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
+
+    /* Scan input and build symbol stats */
+    {   CHECK_V_F(maxCount, FSE_count(count, &maxSymbolValue, src, srcSize) );
+        if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
+        if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
+        if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
+    }
+
+    tableLog = FSE_optimalTableLog(tableLog, srcSize, maxSymbolValue);
+    CHECK_F( FSE_normalizeCount(norm, tableLog, count, srcSize, maxSymbolValue) );
+
+    /* Write table description header */
+    {   CHECK_V_F(nc_err, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
+        op += nc_err;
+    }
+
+    /* Compress */
+    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, scratchBufferSize) );
+    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, src, srcSize, CTable) );
+        if (cSize == 0) return 0;   /* not enough space for compressed data */
+        op += cSize;
+    }
+
+    /* check compressibility */
+    if ( (size_t)(op-ostart) >= srcSize-1 ) return 0;
+
+    return op-ostart;
+}
+
+typedef struct {
+    FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
+    BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
+} fseWkspMax_t;
+
+size_t FSE_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog)
+{
+    fseWkspMax_t scratchBuffer;
+    FSE_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+    return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
+}
+
+size_t FSE_compress (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
+}
+
+
+#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
new file mode 100644
index 000000000..8474a4c07
--- /dev/null
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -0,0 +1,328 @@
+/* ******************************************************************
+   FSE : Finite State Entropy decoder
+   Copyright (C) 2013-2015, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    You can contact the author at :
+    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+****************************************************************** */
+
+
+/* **************************************************************
+*  Compiler specifics
+****************************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  define FORCE_INLINE static __forceinline
+#  include <intrin.h>                    /* For Visual 2005 */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
+#else
+#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#    ifdef __GNUC__
+#      define FORCE_INLINE static inline __attribute__((always_inline))
+#    else
+#      define FORCE_INLINE static inline
+#    endif
+#  else
+#    define FORCE_INLINE static
+#  endif /* __STDC_VERSION__ */
+#endif
+
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <stdlib.h>     /* malloc, free, qsort */
+#include <string.h>     /* memcpy, memset */
+#include "bitstream.h"
+#define FSE_STATIC_LINKING_ONLY
+#include "fse.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+#define FSE_isError ERR_isError
+#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
+
+/* check and forward error code */
+#define CHECK_F(f) { size_t const e = f; if (FSE_isError(e)) return e; }
+
+
+/* **************************************************************
+*  Templates
+****************************************************************/
+/*
+  designed to be included
+  for type-specific functions (template emulation in C)
+  Objective is to write these functions only once, for improved maintenance
+*/
+
+/* safety checks */
+#ifndef FSE_FUNCTION_EXTENSION
+#  error "FSE_FUNCTION_EXTENSION must be defined"
+#endif
+#ifndef FSE_FUNCTION_TYPE
+#  error "FSE_FUNCTION_TYPE must be defined"
+#endif
+
+/* Function names */
+#define FSE_CAT(X,Y) X##Y
+#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
+#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
+
+
+/* Function templates */
+FSE_DTable* FSE_createDTable (unsigned tableLog)
+{
+    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+    return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
+}
+
+void FSE_freeDTable (FSE_DTable* dt)
+{
+    free(dt);
+}
+
+size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    void* const tdPtr = dt+1;   /* because *dt is unsigned, 32-bits aligned on 32-bits */
+    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*) (tdPtr);
+    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
+
+    U32 const maxSV1 = maxSymbolValue + 1;
+    U32 const tableSize = 1 << tableLog;
+    U32 highThreshold = tableSize-1;
+
+    /* Sanity Checks */
+    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+
+    /* Init, lay down lowprob symbols */
+    {   FSE_DTableHeader DTableH;
+        DTableH.tableLog = (U16)tableLog;
+        DTableH.fastMode = 1;
+        {   S16 const largeLimit= (S16)(1 << (tableLog-1));
+            U32 s;
+            for (s=0; s<maxSV1; s++) {
+                if (normalizedCounter[s]==-1) {
+                    tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
+                    symbolNext[s] = 1;
+                } else {
+                    if (normalizedCounter[s] >= largeLimit) DTableH.fastMode=0;
+                    symbolNext[s] = normalizedCounter[s];
+        }   }   }
+        memcpy(dt, &DTableH, sizeof(DTableH));
+    }
+
+    /* Spread symbols */
+    {   U32 const tableMask = tableSize-1;
+        U32 const step = FSE_TABLESTEP(tableSize);
+        U32 s, position = 0;
+        for (s=0; s<maxSV1; s++) {
+            int i;
+            for (i=0; i<normalizedCounter[s]; i++) {
+                tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
+                position = (position + step) & tableMask;
+                while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
+        }   }
+        if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
+    }
+
+    /* Build Decoding table */
+    {   U32 u;
+        for (u=0; u<tableSize; u++) {
+            FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
+            U16 nextState = symbolNext[symbol]++;
+            tableDecode[u].nbBits = (BYTE) (tableLog - BIT_highbit32 ((U32)nextState) );
+            tableDecode[u].newState = (U16) ( (nextState << tableDecode[u].nbBits) - tableSize);
+    }   }
+
+    return 0;
+}
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+/*-*******************************************************
+*  Decompression (Byte symbols)
+*********************************************************/
+size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
+{
+    void* ptr = dt;
+    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+    void* dPtr = dt + 1;
+    FSE_decode_t* const cell = (FSE_decode_t*)dPtr;
+
+    DTableH->tableLog = 0;
+    DTableH->fastMode = 0;
+
+    cell->newState = 0;
+    cell->symbol = symbolValue;
+    cell->nbBits = 0;
+
+    return 0;
+}
+
+
+size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
+{
+    void* ptr = dt;
+    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+    void* dPtr = dt + 1;
+    FSE_decode_t* const dinfo = (FSE_decode_t*)dPtr;
+    const unsigned tableSize = 1 << nbBits;
+    const unsigned tableMask = tableSize - 1;
+    const unsigned maxSV1 = tableMask+1;
+    unsigned s;
+
+    /* Sanity checks */
+    if (nbBits < 1) return ERROR(GENERIC);         /* min size */
+
+    /* Build Decoding Table */
+    DTableH->tableLog = (U16)nbBits;
+    DTableH->fastMode = 1;
+    for (s=0; s<maxSV1; s++) {
+        dinfo[s].newState = 0;
+        dinfo[s].symbol = (BYTE)s;
+        dinfo[s].nbBits = (BYTE)nbBits;
+    }
+
+    return 0;
+}
+
+FORCE_INLINE size_t FSE_decompress_usingDTable_generic(
+          void* dst, size_t maxDstSize,
+    const void* cSrc, size_t cSrcSize,
+    const FSE_DTable* dt, const unsigned fast)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const omax = op + maxDstSize;
+    BYTE* const olimit = omax-3;
+
+    BIT_DStream_t bitD;
+    FSE_DState_t state1;
+    FSE_DState_t state2;
+
+    /* Init */
+    CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
+
+    FSE_initDState(&state1, &bitD, dt);
+    FSE_initDState(&state2, &bitD, dt);
+
+#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
+
+    /* 4 symbols per loop */
+    for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) & (op<olimit) ; op+=4) {
+        op[0] = FSE_GETSYMBOL(&state1);
+
+        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            BIT_reloadDStream(&bitD);
+
+        op[1] = FSE_GETSYMBOL(&state2);
+
+        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
+
+        op[2] = FSE_GETSYMBOL(&state1);
+
+        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            BIT_reloadDStream(&bitD);
+
+        op[3] = FSE_GETSYMBOL(&state2);
+    }
+
+    /* tail */
+    /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
+    while (1) {
+        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+        *op++ = FSE_GETSYMBOL(&state1);
+        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+            *op++ = FSE_GETSYMBOL(&state2);
+            break;
+        }
+
+        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+        *op++ = FSE_GETSYMBOL(&state2);
+        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+            *op++ = FSE_GETSYMBOL(&state1);
+            break;
+    }   }
+
+    return op-ostart;
+}
+
+
+size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
+                            const void* cSrc, size_t cSrcSize,
+                            const FSE_DTable* dt)
+{
+    const void* ptr = dt;
+    const FSE_DTableHeader* DTableH = (const FSE_DTableHeader*)ptr;
+    const U32 fastMode = DTableH->fastMode;
+
+    /* select fast mode (static) */
+    if (fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
+    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
+}
+
+
+size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog)
+{
+    const BYTE* const istart = (const BYTE*)cSrc;
+    const BYTE* ip = istart;
+    short counting[FSE_MAX_SYMBOL_VALUE+1];
+    unsigned tableLog;
+    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+
+    /* normal FSE decoding mode */
+    size_t const NCountLength = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
+    if (FSE_isError(NCountLength)) return NCountLength;
+    //if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining case : NCountLength==cSrcSize */
+    if (tableLog > maxLog) return ERROR(tableLog_tooLarge);
+    ip += NCountLength;
+    cSrcSize -= NCountLength;
+
+    CHECK_F( FSE_buildDTable (workSpace, counting, maxSymbolValue, tableLog) );
+
+    return FSE_decompress_usingDTable (dst, dstCapacity, ip, cSrcSize, workSpace);   /* always return, even if it is an error code */
+}
+
+
+typedef FSE_DTable DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
+
+size_t FSE_decompress(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize)
+{
+    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
+    return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
+}
+
+
+
+#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
new file mode 100644
index 000000000..e5572760a
--- /dev/null
+++ b/contrib/linux-kernel/lib/huf.h
@@ -0,0 +1,260 @@
+/* ******************************************************************
+   Huffman coder, part of New Generation Entropy library
+   header file
+   Copyright (C) 2013-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+****************************************************************** */
+#ifndef HUF_H_298734234
+#define HUF_H_298734234
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+
+/* *** Dependencies *** */
+#include <stddef.h>    /* size_t */
+
+
+/* *** simple functions *** */
+/**
+HUF_compress() :
+    Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
+    'dst' buffer must be already allocated.
+    Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
+    `srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
+    @return : size of compressed data (<= `dstCapacity`).
+    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+                     if return == 1, srcData is a single repeated byte symbol (RLE compression).
+                     if HUF_isError(return), compression failed (more details using HUF_getErrorName())
+*/
+size_t HUF_compress(void* dst, size_t dstCapacity,
+              const void* src, size_t srcSize);
+
+/**
+HUF_decompress() :
+    Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
+    into already allocated buffer 'dst', of minimum size 'dstSize'.
+    `originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
+    Note : in contrast with FSE, HUF_decompress can regenerate
+           RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
+           because it knows size to regenerate.
+    @return : size of regenerated data (== originalSize),
+              or an error code, which can be tested using HUF_isError()
+*/
+size_t HUF_decompress(void* dst,  size_t originalSize,
+                const void* cSrc, size_t cSrcSize);
+
+
+/* ***   Tool functions *** */
+#define HUF_BLOCKSIZE_MAX (128 * 1024)       /**< maximum input size for a single block compressed with HUF_compress */
+size_t HUF_compressBound(size_t size);       /**< maximum compressed size (worst case) */
+
+/* Error Management */
+unsigned    HUF_isError(size_t code);        /**< tells if a return value is an error code */
+const char* HUF_getErrorName(size_t code);   /**< provides error code string (useful for debugging) */
+
+
+/* ***   Advanced function   *** */
+
+/** HUF_compress2() :
+ *   Same as HUF_compress(), but offers direct control over `maxSymbolValue` and `tableLog` .
+ *   `tableLog` must be `<= HUF_TABLELOG_MAX` . */
+size_t HUF_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+
+/** HUF_compress4X_wksp() :
+*   Same as HUF_compress2(), but uses externally allocated `workSpace`, which must be a table of >= 1024 unsigned */
+size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+
+
+
+#ifdef HUF_STATIC_LINKING_ONLY
+
+/* *** Dependencies *** */
+#include "mem.h"   /* U32 */
+
+
+/* *** Constants *** */
+#define HUF_TABLELOG_MAX      12       /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
+#define HUF_TABLELOG_DEFAULT  11       /* tableLog by default, when not specified */
+#define HUF_SYMBOLVALUE_MAX  255
+
+#define HUF_TABLELOG_ABSOLUTEMAX  15   /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
+#if (HUF_TABLELOG_MAX > HUF_TABLELOG_ABSOLUTEMAX)
+#  error "HUF_TABLELOG_MAX is too large !"
+#endif
+
+
+/* ****************************************
+*  Static allocation
+******************************************/
+/* HUF buffer bounds */
+#define HUF_CTABLEBOUND 129
+#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true if incompressible pre-filtered with fast heuristic */
+#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
+
+/* static allocation of HUF's Compression Table */
+#define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
+    U32 name##hb[maxSymbolValue+1]; \
+    void* name##hv = &(name##hb); \
+    HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
+
+/* static allocation of HUF's DTable */
+typedef U32 HUF_DTable;
+#define HUF_DTABLE_SIZE(maxTableLog)   (1 + (1<<(maxTableLog)))
+#define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) \
+        HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = { ((U32)((maxTableLog)-1) * 0x01000001) }
+#define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) \
+        HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
+
+/* The workspace must have alignment at least 4 and be at least this large */
+#define HUF_WORKSPACE_SIZE (6 << 10)
+#define HUF_WORKSPACE_SIZE_U32 (HUF_WORKSPACE_SIZE / sizeof(U32))
+
+
+/* ****************************************
+*  Advanced decompression functions
+******************************************/
+size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+
+size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< decodes RLE and uncompressed */
+size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize); /**< considers RLE and uncompressed as errors */
+size_t HUF_decompress4X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+size_t HUF_decompress4X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+
+
+/* ****************************************
+*  HUF detailed API
+******************************************/
+/*!
+HUF_compress() does the following:
+1. count symbol occurrence from source[] into table count[] using FSE_count()
+2. (optional) refine tableLog using HUF_optimalTableLog()
+3. build Huffman table from count using HUF_buildCTable()
+4. save Huffman table to memory buffer using HUF_writeCTable()
+5. encode the data stream using HUF_compress4X_usingCTable()
+
+The following API allows targeting specific sub-functions for advanced tasks.
+For example, it's possible to compress several blocks using the same 'CTable',
+or to save and regenerate 'CTable' using external methods.
+*/
+/* FSE_count() : find it within "fse.h" */
+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
+typedef struct HUF_CElt_s HUF_CElt;   /* incomplete type */
+size_t HUF_buildCTable (HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue, unsigned maxNbBits);
+size_t HUF_writeCTable (void* dst, size_t maxDstSize, const HUF_CElt* CTable, unsigned maxSymbolValue, unsigned huffLog);
+size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
+
+typedef enum {
+   HUF_repeat_none,  /**< Cannot use the previous table */
+   HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1, 4}X_repeat */
+   HUF_repeat_valid  /**< Can use the previous table and it is asumed to be valid */
+ } HUF_repeat;
+/** HUF_compress4X_repeat() :
+*   Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
+*   If it uses hufTable it does not modify hufTable or repeat.
+*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
+*   If preferRepeat then the old table will always be used if valid. */
+size_t HUF_compress4X_repeat(void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize, HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+
+/** HUF_buildCTable_wksp() :
+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
+ *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
+ */
+size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize);
+
+/*! HUF_readStats() :
+    Read compact Huffman tree, saved by HUF_writeCTable().
+    `huffWeight` is destination buffer.
+    @return : size read from `src` , or an error Code .
+    Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
+size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
+                     U32* nbSymbolsPtr, U32* tableLogPtr,
+                     const void* src, size_t srcSize);
+
+/** HUF_readCTable() :
+*   Loading a CTable saved with HUF_writeCTable() */
+size_t HUF_readCTable (HUF_CElt* CTable, unsigned maxSymbolValue, const void* src, size_t srcSize);
+
+
+/*
+HUF_decompress() does the following:
+1. select the decompression algorithm (X2, X4) based on pre-computed heuristics
+2. build Huffman table from save, using HUF_readDTableXn()
+3. decode 1 or 4 segments in parallel using HUF_decompressSXn_usingDTable
+*/
+
+/** HUF_selectDecoder() :
+*   Tells which decoder is likely to decode faster,
+*   based on a set of pre-determined metrics.
+*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
+*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
+U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize);
+
+size_t HUF_readDTableX2 (HUF_DTable* DTable, const void* src, size_t srcSize);
+size_t HUF_readDTableX4 (HUF_DTable* DTable, const void* src, size_t srcSize);
+
+size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+size_t HUF_decompress4X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+size_t HUF_decompress4X4_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+
+
+/* single stream variants */
+
+size_t HUF_compress1X (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+size_t HUF_compress1X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
+/** HUF_compress1X_repeat() :
+*   Same as HUF_compress1X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
+*   If it uses hufTable it does not modify hufTable or repeat.
+*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
+*   If preferRepeat then the old table will always be used if valid. */
+size_t HUF_compress1X_repeat(void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize, HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+
+size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* single-symbol decoder */
+size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* double-symbol decoder */
+
+size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
+size_t HUF_decompress1X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+size_t HUF_decompress1X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+
+size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);   /**< automatic selection of sing or double symbol decoder, based on DTable */
+size_t HUF_decompress1X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+size_t HUF_decompress1X4_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+
+#endif /* HUF_STATIC_LINKING_ONLY */
+
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif   /* HUF_H_298734234 */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
new file mode 100644
index 000000000..fe11aafb8
--- /dev/null
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -0,0 +1,684 @@
+/* ******************************************************************
+   Huffman encoder, part of New Generation Entropy library
+   Copyright (C) 2013-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    You can contact the author at :
+    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+****************************************************************** */
+
+/* **************************************************************
+*  Compiler specifics
+****************************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#endif
+
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <string.h>     /* memcpy, memset */
+#include <stdio.h>      /* printf (debug) */
+#include "bitstream.h"
+#define FSE_STATIC_LINKING_ONLY   /* FSE_optimalTableLog_internal */
+#include "fse.h"        /* header compression */
+#define HUF_STATIC_LINKING_ONLY
+#include "huf.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
+#define CHECK_V_F(e, f) size_t const e = f; if (ERR_isError(e)) return f
+#define CHECK_F(f)   { CHECK_V_F(_var_err__, f); }
+
+
+/* **************************************************************
+*  Utils
+****************************************************************/
+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
+{
+    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
+}
+
+
+/* *******************************************************
+*  HUF : Huffman block compression
+*********************************************************/
+/* HUF_compressWeights() :
+ * Same as FSE_compress(), but dedicated to huff0's weights compression.
+ * The use case needs much less stack memory.
+ * Note : all elements within weightTable are supposed to be <= HUF_TABLELOG_MAX.
+ */
+#define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
+size_t HUF_compressWeights (void* dst, size_t dstSize, const void* weightTable, size_t wtSize)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const oend = ostart + dstSize;
+
+    U32 maxSymbolValue = HUF_TABLELOG_MAX;
+    U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
+
+    FSE_CTable CTable[FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX)];
+    BYTE scratchBuffer[1<<MAX_FSE_TABLELOG_FOR_HUFF_HEADER];
+
+    U32 count[HUF_TABLELOG_MAX+1];
+    S16 norm[HUF_TABLELOG_MAX+1];
+
+    /* init conditions */
+    if (wtSize <= 1) return 0;  /* Not compressible */
+
+    /* Scan input and build symbol stats */
+    {   CHECK_V_F(maxCount, FSE_count_simple(count, &maxSymbolValue, weightTable, wtSize) );
+        if (maxCount == wtSize) return 1;   /* only a single symbol in src : rle */
+        if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
+    }
+
+    tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
+    CHECK_F( FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue) );
+
+    /* Write table description header */
+    {   CHECK_V_F(hSize, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
+        op += hSize;
+    }
+
+    /* Compress */
+    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, sizeof(scratchBuffer)) );
+    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable) );
+        if (cSize == 0) return 0;   /* not enough space for compressed data */
+        op += cSize;
+    }
+
+    return op-ostart;
+}
+
+
+struct HUF_CElt_s {
+  U16  val;
+  BYTE nbBits;
+};   /* typedef'd to HUF_CElt within "huf.h" */
+
+/*! HUF_writeCTable() :
+    `CTable` : Huffman tree to save, using huf representation.
+    @return : size of saved CTable */
+size_t HUF_writeCTable (void* dst, size_t maxDstSize,
+                        const HUF_CElt* CTable, U32 maxSymbolValue, U32 huffLog)
+{
+    BYTE bitsToWeight[HUF_TABLELOG_MAX + 1];   /* precomputed conversion table */
+    BYTE huffWeight[HUF_SYMBOLVALUE_MAX];
+    BYTE* op = (BYTE*)dst;
+    U32 n;
+
+     /* check conditions */
+    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
+
+    /* convert to weight */
+    bitsToWeight[0] = 0;
+    for (n=1; n<huffLog+1; n++)
+        bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
+    for (n=0; n<maxSymbolValue; n++)
+        huffWeight[n] = bitsToWeight[CTable[n].nbBits];
+
+    /* attempt weights compression by FSE */
+    {   CHECK_V_F(hSize, HUF_compressWeights(op+1, maxDstSize-1, huffWeight, maxSymbolValue) );
+        if ((hSize>1) & (hSize < maxSymbolValue/2)) {   /* FSE compressed */
+            op[0] = (BYTE)hSize;
+            return hSize+1;
+    }   }
+
+    /* write raw values as 4-bits (max : 15) */
+    if (maxSymbolValue > (256-128)) return ERROR(GENERIC);   /* should not happen : likely means source cannot be compressed */
+    if (((maxSymbolValue+1)/2) + 1 > maxDstSize) return ERROR(dstSize_tooSmall);   /* not enough space within dst buffer */
+    op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue-1));
+    huffWeight[maxSymbolValue] = 0;   /* to be sure it doesn't cause msan issue in final combination */
+    for (n=0; n<maxSymbolValue; n+=2)
+        op[(n/2)+1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n+1]);
+    return ((maxSymbolValue+1)/2) + 1;
+}
+
+
+size_t HUF_readCTable (HUF_CElt* CTable, U32 maxSymbolValue, const void* src, size_t srcSize)
+{
+    BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];   /* init not required, even though some static analyzer may complain */
+    U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
+    U32 tableLog = 0;
+    U32 nbSymbols = 0;
+
+    /* get symbol weights */
+    CHECK_V_F(readSize, HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX+1, rankVal, &nbSymbols, &tableLog, src, srcSize));
+
+    /* check result */
+    if (tableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    if (nbSymbols > maxSymbolValue+1) return ERROR(maxSymbolValue_tooSmall);
+
+    /* Prepare base value per rank */
+    {   U32 n, nextRankStart = 0;
+        for (n=1; n<=tableLog; n++) {
+            U32 current = nextRankStart;
+            nextRankStart += (rankVal[n] << (n-1));
+            rankVal[n] = current;
+    }   }
+
+    /* fill nbBits */
+    {   U32 n; for (n=0; n<nbSymbols; n++) {
+            const U32 w = huffWeight[n];
+            CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
+    }   }
+
+    /* fill val */
+    {   U16 nbPerRank[HUF_TABLELOG_MAX+2]  = {0};  /* support w=0=>n=tableLog+1 */
+        U16 valPerRank[HUF_TABLELOG_MAX+2] = {0};
+        { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[CTable[n].nbBits]++; }
+        /* determine stating value per rank */
+        valPerRank[tableLog+1] = 0;   /* for w==0 */
+        {   U16 min = 0;
+            U32 n; for (n=tableLog; n>0; n--) {  /* start at n=tablelog <-> w=1 */
+                valPerRank[n] = min;     /* get starting value within each rank */
+                min += nbPerRank[n];
+                min >>= 1;
+        }   }
+        /* assign value within rank, symbol order */
+        { U32 n; for (n=0; n<=maxSymbolValue; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; }
+    }
+
+    return readSize;
+}
+
+
+typedef struct nodeElt_s {
+    U32 count;
+    U16 parent;
+    BYTE byte;
+    BYTE nbBits;
+} nodeElt;
+
+static U32 HUF_setMaxHeight(nodeElt* huffNode, U32 lastNonNull, U32 maxNbBits)
+{
+    const U32 largestBits = huffNode[lastNonNull].nbBits;
+    if (largestBits <= maxNbBits) return largestBits;   /* early exit : no elt > maxNbBits */
+
+    /* there are several too large elements (at least >= 2) */
+    {   int totalCost = 0;
+        const U32 baseCost = 1 << (largestBits - maxNbBits);
+        U32 n = lastNonNull;
+
+        while (huffNode[n].nbBits > maxNbBits) {
+            totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
+            huffNode[n].nbBits = (BYTE)maxNbBits;
+            n --;
+        }  /* n stops at huffNode[n].nbBits <= maxNbBits */
+        while (huffNode[n].nbBits == maxNbBits) n--;   /* n end at index of smallest symbol using < maxNbBits */
+
+        /* renorm totalCost */
+        totalCost >>= (largestBits - maxNbBits);  /* note : totalCost is necessarily a multiple of baseCost */
+
+        /* repay normalized cost */
+        {   U32 const noSymbol = 0xF0F0F0F0;
+            U32 rankLast[HUF_TABLELOG_MAX+2];
+            int pos;
+
+            /* Get pos of last (smallest) symbol per rank */
+            memset(rankLast, 0xF0, sizeof(rankLast));
+            {   U32 currentNbBits = maxNbBits;
+                for (pos=n ; pos >= 0; pos--) {
+                    if (huffNode[pos].nbBits >= currentNbBits) continue;
+                    currentNbBits = huffNode[pos].nbBits;   /* < maxNbBits */
+                    rankLast[maxNbBits-currentNbBits] = pos;
+            }   }
+
+            while (totalCost > 0) {
+                U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
+                for ( ; nBitsToDecrease > 1; nBitsToDecrease--) {
+                    U32 highPos = rankLast[nBitsToDecrease];
+                    U32 lowPos = rankLast[nBitsToDecrease-1];
+                    if (highPos == noSymbol) continue;
+                    if (lowPos == noSymbol) break;
+                    {   U32 const highTotal = huffNode[highPos].count;
+                        U32 const lowTotal = 2 * huffNode[lowPos].count;
+                        if (highTotal <= lowTotal) break;
+                }   }
+                /* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
+                while ((nBitsToDecrease<=HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))  /* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
+                    nBitsToDecrease ++;
+                totalCost -= 1 << (nBitsToDecrease-1);
+                if (rankLast[nBitsToDecrease-1] == noSymbol)
+                    rankLast[nBitsToDecrease-1] = rankLast[nBitsToDecrease];   /* this rank is no longer empty */
+                huffNode[rankLast[nBitsToDecrease]].nbBits ++;
+                if (rankLast[nBitsToDecrease] == 0)    /* special case, reached largest symbol */
+                    rankLast[nBitsToDecrease] = noSymbol;
+                else {
+                    rankLast[nBitsToDecrease]--;
+                    if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits-nBitsToDecrease)
+                        rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */
+            }   }   /* while (totalCost > 0) */
+
+            while (totalCost < 0) {  /* Sometimes, cost correction overshoot */
+                if (rankLast[1] == noSymbol) {  /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0 (using maxNbBits) */
+                    while (huffNode[n].nbBits == maxNbBits) n--;
+                    huffNode[n+1].nbBits--;
+                    rankLast[1] = n+1;
+                    totalCost++;
+                    continue;
+                }
+                huffNode[ rankLast[1] + 1 ].nbBits--;
+                rankLast[1]++;
+                totalCost ++;
+    }   }   }   /* there are several too large elements (at least >= 2) */
+
+    return maxNbBits;
+}
+
+
+typedef struct {
+    U32 base;
+    U32 current;
+} rankPos;
+
+static void HUF_sort(nodeElt* huffNode, const U32* count, U32 maxSymbolValue)
+{
+    rankPos rank[32];
+    U32 n;
+
+    memset(rank, 0, sizeof(rank));
+    for (n=0; n<=maxSymbolValue; n++) {
+        U32 r = BIT_highbit32(count[n] + 1);
+        rank[r].base ++;
+    }
+    for (n=30; n>0; n--) rank[n-1].base += rank[n].base;
+    for (n=0; n<32; n++) rank[n].current = rank[n].base;
+    for (n=0; n<=maxSymbolValue; n++) {
+        U32 const c = count[n];
+        U32 const r = BIT_highbit32(c+1) + 1;
+        U32 pos = rank[r].current++;
+        while ((pos > rank[r].base) && (c > huffNode[pos-1].count)) huffNode[pos]=huffNode[pos-1], pos--;
+        huffNode[pos].count = c;
+        huffNode[pos].byte  = (BYTE)n;
+    }
+}
+
+
+/** HUF_buildCTable_wksp() :
+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
+ *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
+ */
+#define STARTNODE (HUF_SYMBOLVALUE_MAX+1)
+typedef nodeElt huffNodeTable[2*HUF_SYMBOLVALUE_MAX+1 +1];
+size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize)
+{
+    nodeElt* const huffNode0 = (nodeElt*)workSpace;
+    nodeElt* const huffNode = huffNode0+1;
+    U32 n, nonNullRank;
+    int lowS, lowN;
+    U16 nodeNb = STARTNODE;
+    U32 nodeRoot;
+
+    /* safety checks */
+    if (wkspSize < sizeof(huffNodeTable)) return ERROR(GENERIC);   /* workSpace is not large enough */
+    if (maxNbBits == 0) maxNbBits = HUF_TABLELOG_DEFAULT;
+    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(GENERIC);
+    memset(huffNode0, 0, sizeof(huffNodeTable));
+
+    /* sort, decreasing order */
+    HUF_sort(huffNode, count, maxSymbolValue);
+
+    /* init for parents */
+    nonNullRank = maxSymbolValue;
+    while(huffNode[nonNullRank].count == 0) nonNullRank--;
+    lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
+    huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count;
+    huffNode[lowS].parent = huffNode[lowS-1].parent = nodeNb;
+    nodeNb++; lowS-=2;
+    for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30);
+    huffNode0[0].count = (U32)(1U<<31);  /* fake entry, strong barrier */
+
+    /* create parents */
+    while (nodeNb <= nodeRoot) {
+        U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+        U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+        huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
+        huffNode[n1].parent = huffNode[n2].parent = nodeNb;
+        nodeNb++;
+    }
+
+    /* distribute weights (unlimited tree height) */
+    huffNode[nodeRoot].nbBits = 0;
+    for (n=nodeRoot-1; n>=STARTNODE; n--)
+        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+    for (n=0; n<=nonNullRank; n++)
+        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+
+    /* enforce maxTableLog */
+    maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
+
+    /* fill result into tree (val, nbBits) */
+    {   U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0};
+        U16 valPerRank[HUF_TABLELOG_MAX+1] = {0};
+        if (maxNbBits > HUF_TABLELOG_MAX) return ERROR(GENERIC);   /* check fit into table */
+        for (n=0; n<=nonNullRank; n++)
+            nbPerRank[huffNode[n].nbBits]++;
+        /* determine stating value per rank */
+        {   U16 min = 0;
+            for (n=maxNbBits; n>0; n--) {
+                valPerRank[n] = min;      /* get starting value within each rank */
+                min += nbPerRank[n];
+                min >>= 1;
+        }   }
+        for (n=0; n<=maxSymbolValue; n++)
+            tree[huffNode[n].byte].nbBits = huffNode[n].nbBits;   /* push nbBits per symbol, symbol order */
+        for (n=0; n<=maxSymbolValue; n++)
+            tree[n].val = valPerRank[tree[n].nbBits]++;   /* assign value within rank, symbol order */
+    }
+
+    return maxNbBits;
+}
+
+/** HUF_buildCTable() :
+ *  Note : count is used before tree is written, so they can safely overlap
+ */
+size_t HUF_buildCTable (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits)
+{
+    huffNodeTable nodeTable;
+    return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, nodeTable, sizeof(nodeTable));
+}
+
+static size_t HUF_estimateCompressedSize(HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue)
+{
+    size_t nbBits = 0;
+    int s;
+    for (s = 0; s <= (int)maxSymbolValue; ++s) {
+        nbBits += CTable[s].nbBits * count[s];
+    }
+    return nbBits >> 3;
+}
+
+static int HUF_validateCTable(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue) {
+  int bad = 0;
+  int s;
+  for (s = 0; s <= (int)maxSymbolValue; ++s) {
+    bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
+  }
+  return !bad;
+}
+
+static void HUF_encodeSymbol(BIT_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable)
+{
+    BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
+}
+
+size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
+
+#define HUF_FLUSHBITS(s)  (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
+
+#define HUF_FLUSHBITS_1(stream) \
+    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*2+7) HUF_FLUSHBITS(stream)
+
+#define HUF_FLUSHBITS_2(stream) \
+    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*4+7) HUF_FLUSHBITS(stream)
+
+size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
+{
+    const BYTE* ip = (const BYTE*) src;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+    size_t n;
+    const unsigned fast = (dstSize >= HUF_BLOCKBOUND(srcSize));
+    BIT_CStream_t bitC;
+
+    /* init */
+    if (dstSize < 8) return 0;   /* not enough space to compress */
+    { size_t const initErr = BIT_initCStream(&bitC, op, oend-op);
+      if (HUF_isError(initErr)) return 0; }
+
+    n = srcSize & ~3;  /* join to mod 4 */
+    switch (srcSize & 3)
+    {
+        case 3 : HUF_encodeSymbol(&bitC, ip[n+ 2], CTable);
+                 HUF_FLUSHBITS_2(&bitC);
+        case 2 : HUF_encodeSymbol(&bitC, ip[n+ 1], CTable);
+                 HUF_FLUSHBITS_1(&bitC);
+        case 1 : HUF_encodeSymbol(&bitC, ip[n+ 0], CTable);
+                 HUF_FLUSHBITS(&bitC);
+        case 0 :
+        default: ;
+    }
+
+    for (; n>0; n-=4) {  /* note : n&3==0 at this stage */
+        HUF_encodeSymbol(&bitC, ip[n- 1], CTable);
+        HUF_FLUSHBITS_1(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 2], CTable);
+        HUF_FLUSHBITS_2(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 3], CTable);
+        HUF_FLUSHBITS_1(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 4], CTable);
+        HUF_FLUSHBITS(&bitC);
+    }
+
+    return BIT_closeCStream(&bitC);
+}
+
+
+size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
+{
+    size_t const segmentSize = (srcSize+3)/4;   /* first 3 segments */
+    const BYTE* ip = (const BYTE*) src;
+    const BYTE* const iend = ip + srcSize;
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+
+    if (dstSize < 6 + 1 + 1 + 1 + 8) return 0;   /* minimum space to compress successfully */
+    if (srcSize < 12) return 0;   /* no saving possible : too small input */
+    op += 6;   /* jumpTable */
+
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+        if (cSize==0) return 0;
+        MEM_writeLE16(ostart, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+        if (cSize==0) return 0;
+        MEM_writeLE16(ostart+2, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+        if (cSize==0) return 0;
+        MEM_writeLE16(ostart+4, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, iend-ip, CTable) );
+        if (cSize==0) return 0;
+        op += cSize;
+    }
+
+    return op-ostart;
+}
+
+
+static size_t HUF_compressCTable_internal(
+                BYTE* const ostart, BYTE* op, BYTE* const oend,
+                const void* src, size_t srcSize,
+                unsigned singleStream, const HUF_CElt* CTable)
+{
+    size_t const cSize = singleStream ?
+                         HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) :
+                         HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
+    if (HUF_isError(cSize)) { return cSize; }
+    if (cSize==0) { return 0; }   /* uncompressible */
+    op += cSize;
+    /* check compressibility */
+    if ((size_t)(op-ostart) >= srcSize-1) { return 0; }
+    return op-ostart;
+}
+
+
+/* `workSpace` must a table of at least 1024 unsigned */
+static size_t HUF_compress_internal (
+                void* dst, size_t dstSize,
+                const void* src, size_t srcSize,
+                unsigned maxSymbolValue, unsigned huffLog,
+                unsigned singleStream,
+                void* workSpace, size_t wkspSize,
+                HUF_CElt* oldHufTable, HUF_repeat* repeat, int preferRepeat)
+{
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+
+    U32* count;
+    size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
+    HUF_CElt* CTable;
+    size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
+
+    /* checks & inits */
+    if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize) return ERROR(GENERIC);
+    if (!srcSize) return 0;  /* Uncompressed (note : 1 means rle, so first byte must be correct) */
+    if (!dstSize) return 0;  /* cannot fit within dst budget */
+    if (srcSize > HUF_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);   /* current block size limit */
+    if (huffLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    if (!maxSymbolValue) maxSymbolValue = HUF_SYMBOLVALUE_MAX;
+    if (!huffLog) huffLog = HUF_TABLELOG_DEFAULT;
+
+    count = (U32*)workSpace;
+    workSpace = (BYTE*)workSpace + countSize;
+    wkspSize -= countSize;
+    CTable = (HUF_CElt*)workSpace;
+    workSpace = (BYTE*)workSpace + CTableSize;
+    wkspSize -= CTableSize;
+
+    /* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
+    if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
+        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+    }
+
+    /* Scan input and build symbol stats */
+    {   CHECK_V_F(largest, FSE_count_wksp (count, &maxSymbolValue, (const BYTE*)src, srcSize, (U32*)workSpace) );
+        if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; }   /* single symbol, rle */
+        if (largest <= (srcSize >> 7)+1) return 0;   /* Fast heuristic : not compressible enough */
+    }
+
+    /* Check validity of previous table */
+    if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
+        *repeat = HUF_repeat_none;
+    }
+    /* Heuristic : use existing table for small inputs */
+    if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
+        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+    }
+
+    /* Build Huffman Tree */
+    huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
+    {   CHECK_V_F(maxBits, HUF_buildCTable_wksp (CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize) );
+        huffLog = (U32)maxBits;
+        /* Zero the unused symbols so we can check it for validity */
+        memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
+    }
+
+    /* Write table description header */
+    {   CHECK_V_F(hSize, HUF_writeCTable (op, dstSize, CTable, maxSymbolValue, huffLog) );
+        /* Check if using the previous table will be beneficial */
+        if (repeat && *repeat != HUF_repeat_none) {
+            size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
+            size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
+            if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
+                return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+            }
+        }
+        /* Use the new table */
+        if (hSize + 12ul >= srcSize) { return 0; }
+        op += hSize;
+        if (repeat) { *repeat = HUF_repeat_none; }
+        if (oldHufTable) { memcpy(oldHufTable, CTable, CTableSize); } /* Save the new table */
+    }
+    return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
+}
+
+
+size_t HUF_compress1X_wksp (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
+}
+
+size_t HUF_compress1X_repeat (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize,
+                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
+}
+
+size_t HUF_compress1X (void* dst, size_t dstSize,
+                 const void* src, size_t srcSize,
+                 unsigned maxSymbolValue, unsigned huffLog)
+{
+    unsigned workSpace[1024];
+    return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+}
+
+size_t HUF_compress4X_wksp (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
+}
+
+size_t HUF_compress4X_repeat (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize,
+                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
+}
+
+size_t HUF_compress2 (void* dst, size_t dstSize,
+                const void* src, size_t srcSize,
+                unsigned maxSymbolValue, unsigned huffLog)
+{
+    unsigned workSpace[1024];
+    return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+}
+
+size_t HUF_compress (void* dst, size_t maxDstSize, const void* src, size_t srcSize)
+{
+    return HUF_compress2(dst, maxDstSize, src, (U32)srcSize, 255, HUF_TABLELOG_DEFAULT);
+}
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/huf_decompress.c
new file mode 100644
index 000000000..ea35c3620
--- /dev/null
+++ b/contrib/linux-kernel/lib/huf_decompress.c
@@ -0,0 +1,888 @@
+/* ******************************************************************
+   Huffman decoder, part of New Generation Entropy library
+   Copyright (C) 2013-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    You can contact the author at :
+    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+****************************************************************** */
+
+/* **************************************************************
+*  Compiler specifics
+****************************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  define FORCE_INLINE static __forceinline
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#else
+#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#    ifdef __GNUC__
+#      define FORCE_INLINE static inline __attribute__((always_inline))
+#    else
+#      define FORCE_INLINE static inline
+#    endif
+#  else
+#    define FORCE_INLINE static
+#  endif /* __STDC_VERSION__ */
+#endif
+
+
+/* **************************************************************
+*  Dependencies
+****************************************************************/
+#include <string.h>     /* memcpy, memset */
+#include "bitstream.h"  /* BIT_* */
+#include "fse.h"        /* header compression */
+#define HUF_STATIC_LINKING_ONLY
+#include "huf.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
+
+
+/*-***************************/
+/*  generic DTableDesc       */
+/*-***************************/
+
+typedef struct { BYTE maxTableLog; BYTE tableType; BYTE tableLog; BYTE reserved; } DTableDesc;
+
+static DTableDesc HUF_getDTableDesc(const HUF_DTable* table)
+{
+    DTableDesc dtd;
+    memcpy(&dtd, table, sizeof(dtd));
+    return dtd;
+}
+
+
+/*-***************************/
+/*  single-symbol decoding   */
+/*-***************************/
+
+typedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX2;   /* single-symbol decoding */
+
+size_t HUF_readDTableX2 (HUF_DTable* DTable, const void* src, size_t srcSize)
+{
+    BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];
+    U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
+    U32 tableLog = 0;
+    U32 nbSymbols = 0;
+    size_t iSize;
+    void* const dtPtr = DTable + 1;
+    HUF_DEltX2* const dt = (HUF_DEltX2*)dtPtr;
+
+    HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
+    /* memset(huffWeight, 0, sizeof(huffWeight)); */   /* is not necessary, even though some analyzer complain ... */
+
+    iSize = HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
+    if (HUF_isError(iSize)) return iSize;
+
+    /* Table header */
+    {   DTableDesc dtd = HUF_getDTableDesc(DTable);
+        if (tableLog > (U32)(dtd.maxTableLog+1)) return ERROR(tableLog_tooLarge);   /* DTable too small, Huffman tree cannot fit in */
+        dtd.tableType = 0;
+        dtd.tableLog = (BYTE)tableLog;
+        memcpy(DTable, &dtd, sizeof(dtd));
+    }
+
+    /* Calculate starting value for each rank */
+    {   U32 n, nextRankStart = 0;
+        for (n=1; n<tableLog+1; n++) {
+            U32 const current = nextRankStart;
+            nextRankStart += (rankVal[n] << (n-1));
+            rankVal[n] = current;
+    }   }
+
+    /* fill DTable */
+    {   U32 n;
+        for (n=0; n<nbSymbols; n++) {
+            U32 const w = huffWeight[n];
+            U32 const length = (1 << w) >> 1;
+            U32 u;
+            HUF_DEltX2 D;
+            D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);
+            for (u = rankVal[w]; u < rankVal[w] + length; u++)
+                dt[u] = D;
+            rankVal[w] += length;
+    }   }
+
+    return iSize;
+}
+
+
+static BYTE HUF_decodeSymbolX2(BIT_DStream_t* Dstream, const HUF_DEltX2* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
+    BYTE const c = dt[val].byte;
+    BIT_skipBits(Dstream, dt[val].nbBits);
+    return c;
+}
+
+#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \
+    *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \
+    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
+
+#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
+    if (MEM_64bits()) \
+        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
+
+FORCE_INLINE size_t HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX2* const dt, const U32 dtLog)
+{
+    BYTE* const pStart = p;
+
+    /* up to 4 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4)) {
+        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+    }
+
+    /* closer to the end */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+
+    /* no more data to retrieve from bitstream, hence no need to reload */
+    while (p < pEnd)
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+
+    return pEnd-pStart;
+}
+
+static size_t HUF_decompress1X2_usingDTable_internal(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    BYTE* op = (BYTE*)dst;
+    BYTE* const oend = op + dstSize;
+    const void* dtPtr = DTable + 1;
+    const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+    BIT_DStream_t bitD;
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+    U32 const dtLog = dtd.tableLog;
+
+    { size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
+      if (HUF_isError(errorCode)) return errorCode; }
+
+    HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
+
+    /* check */
+    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+
+    return dstSize;
+}
+
+size_t HUF_decompress1X2_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 0) return ERROR(GENERIC);
+    return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+}
+
+size_t HUF_decompress1X2_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX2 (DCtx, cSrc, cSrcSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress1X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
+}
+
+size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress1X2_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+
+static size_t HUF_decompress4X2_usingDTable_internal(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    /* Check */
+    if (cSrcSize < 10) return ERROR(corruption_detected);  /* strict minimum : jump table + 1 byte per stream */
+
+    {   const BYTE* const istart = (const BYTE*) cSrc;
+        BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        const void* const dtPtr = DTable + 1;
+        const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+
+        /* Init */
+        BIT_DStream_t bitD1;
+        BIT_DStream_t bitD2;
+        BIT_DStream_t bitD3;
+        BIT_DStream_t bitD4;
+        size_t const length1 = MEM_readLE16(istart);
+        size_t const length2 = MEM_readLE16(istart+2);
+        size_t const length3 = MEM_readLE16(istart+4);
+        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+        const BYTE* const istart1 = istart + 6;  /* jumpTable */
+        const BYTE* const istart2 = istart1 + length1;
+        const BYTE* const istart3 = istart2 + length2;
+        const BYTE* const istart4 = istart3 + length3;
+        const size_t segmentSize = (dstSize+3) / 4;
+        BYTE* const opStart2 = ostart + segmentSize;
+        BYTE* const opStart3 = opStart2 + segmentSize;
+        BYTE* const opStart4 = opStart3 + segmentSize;
+        BYTE* op1 = ostart;
+        BYTE* op2 = opStart2;
+        BYTE* op3 = opStart3;
+        BYTE* op4 = opStart4;
+        U32 endSignal;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        U32 const dtLog = dtd.tableLog;
+
+        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
+          if (HUF_isError(errorCode)) return errorCode; }
+
+        /* 16-32 symbols per loop (4-8 symbols per stream) */
+        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+        for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; ) {
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
+            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+        }
+
+        /* check corruption */
+        if (op1 > opStart2) return ERROR(corruption_detected);
+        if (op2 > opStart3) return ERROR(corruption_detected);
+        if (op3 > opStart4) return ERROR(corruption_detected);
+        /* note : op4 supposed already verified within main loop */
+
+        /* finish bitStreams one by one */
+        HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
+        HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
+        HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
+        HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
+
+        /* check */
+        endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+        if (!endSignal) return ERROR(corruption_detected);
+
+        /* decoded size */
+        return dstSize;
+    }
+}
+
+
+size_t HUF_decompress4X2_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 0) return ERROR(GENERIC);
+    return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+}
+
+
+size_t HUF_decompress4X2_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX2 (dctx, cSrc, cSrcSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress4X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, dctx);
+}
+
+size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+
+/* *************************/
+/* double-symbols decoding */
+/* *************************/
+typedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX4;  /* double-symbols decoding */
+
+typedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;
+
+/* HUF_fillDTableX4Level2() :
+ * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
+static void HUF_fillDTableX4Level2(HUF_DEltX4* DTable, U32 sizeLog, const U32 consumed,
+                           const U32* rankValOrigin, const int minWeight,
+                           const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
+                           U32 nbBitsBaseline, U16 baseSeq)
+{
+    HUF_DEltX4 DElt;
+    U32 rankVal[HUF_TABLELOG_MAX + 1];
+
+    /* get pre-calculated rankVal */
+    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+
+    /* fill skipped values */
+    if (minWeight>1) {
+        U32 i, skipSize = rankVal[minWeight];
+        MEM_writeLE16(&(DElt.sequence), baseSeq);
+        DElt.nbBits   = (BYTE)(consumed);
+        DElt.length   = 1;
+        for (i = 0; i < skipSize; i++)
+            DTable[i] = DElt;
+    }
+
+    /* fill DTable */
+    {   U32 s; for (s=0; s<sortedListSize; s++) {   /* note : sortedSymbols already skipped */
+            const U32 symbol = sortedSymbols[s].symbol;
+            const U32 weight = sortedSymbols[s].weight;
+            const U32 nbBits = nbBitsBaseline - weight;
+            const U32 length = 1 << (sizeLog-nbBits);
+            const U32 start = rankVal[weight];
+            U32 i = start;
+            const U32 end = start + length;
+
+            MEM_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
+            DElt.nbBits = (BYTE)(nbBits + consumed);
+            DElt.length = 2;
+            do { DTable[i++] = DElt; } while (i<end);   /* since length >= 1 */
+
+            rankVal[weight] += length;
+    }   }
+}
+
+typedef U32 rankVal_t[HUF_TABLELOG_MAX][HUF_TABLELOG_MAX + 1];
+
+static void HUF_fillDTableX4(HUF_DEltX4* DTable, const U32 targetLog,
+                           const sortedSymbol_t* sortedList, const U32 sortedListSize,
+                           const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
+                           const U32 nbBitsBaseline)
+{
+    U32 rankVal[HUF_TABLELOG_MAX + 1];
+    const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
+    const U32 minBits  = nbBitsBaseline - maxWeight;
+    U32 s;
+
+    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+
+    /* fill DTable */
+    for (s=0; s<sortedListSize; s++) {
+        const U16 symbol = sortedList[s].symbol;
+        const U32 weight = sortedList[s].weight;
+        const U32 nbBits = nbBitsBaseline - weight;
+        const U32 start = rankVal[weight];
+        const U32 length = 1 << (targetLog-nbBits);
+
+        if (targetLog-nbBits >= minBits) {   /* enough room for a second symbol */
+            U32 sortedRank;
+            int minWeight = nbBits + scaleLog;
+            if (minWeight < 1) minWeight = 1;
+            sortedRank = rankStart[minWeight];
+            HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,
+                           rankValOrigin[nbBits], minWeight,
+                           sortedList+sortedRank, sortedListSize-sortedRank,
+                           nbBitsBaseline, symbol);
+        } else {
+            HUF_DEltX4 DElt;
+            MEM_writeLE16(&(DElt.sequence), symbol);
+            DElt.nbBits = (BYTE)(nbBits);
+            DElt.length = 1;
+            {   U32 const end = start + length;
+                U32 u;
+                for (u = start; u < end; u++) DTable[u] = DElt;
+        }   }
+        rankVal[weight] += length;
+    }
+}
+
+size_t HUF_readDTableX4 (HUF_DTable* DTable, const void* src, size_t srcSize)
+{
+    BYTE weightList[HUF_SYMBOLVALUE_MAX + 1];
+    sortedSymbol_t sortedSymbol[HUF_SYMBOLVALUE_MAX + 1];
+    U32 rankStats[HUF_TABLELOG_MAX + 1] = { 0 };
+    U32 rankStart0[HUF_TABLELOG_MAX + 2] = { 0 };
+    U32* const rankStart = rankStart0+1;
+    rankVal_t rankVal;
+    U32 tableLog, maxW, sizeOfSort, nbSymbols;
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    U32 const maxTableLog = dtd.maxTableLog;
+    size_t iSize;
+    void* dtPtr = DTable+1;   /* force compiler to avoid strict-aliasing */
+    HUF_DEltX4* const dt = (HUF_DEltX4*)dtPtr;
+
+    HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable));   /* if compiler fails here, assertion is wrong */
+    if (maxTableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    /* memset(weightList, 0, sizeof(weightList)); */  /* is not necessary, even though some analyzer complain ... */
+
+    iSize = HUF_readStats(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
+    if (HUF_isError(iSize)) return iSize;
+
+    /* check result */
+    if (tableLog > maxTableLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
+
+    /* find maxWeight */
+    for (maxW = tableLog; rankStats[maxW]==0; maxW--) {}  /* necessarily finds a solution before 0 */
+
+    /* Get start index of each weight */
+    {   U32 w, nextRankStart = 0;
+        for (w=1; w<maxW+1; w++) {
+            U32 current = nextRankStart;
+            nextRankStart += rankStats[w];
+            rankStart[w] = current;
+        }
+        rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
+        sizeOfSort = nextRankStart;
+    }
+
+    /* sort symbols by weight */
+    {   U32 s;
+        for (s=0; s<nbSymbols; s++) {
+            U32 const w = weightList[s];
+            U32 const r = rankStart[w]++;
+            sortedSymbol[r].symbol = (BYTE)s;
+            sortedSymbol[r].weight = (BYTE)w;
+        }
+        rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
+    }
+
+    /* Build rankVal */
+    {   U32* const rankVal0 = rankVal[0];
+        {   int const rescale = (maxTableLog-tableLog) - 1;   /* tableLog <= maxTableLog */
+            U32 nextRankVal = 0;
+            U32 w;
+            for (w=1; w<maxW+1; w++) {
+                U32 current = nextRankVal;
+                nextRankVal += rankStats[w] << (w+rescale);
+                rankVal0[w] = current;
+        }   }
+        {   U32 const minBits = tableLog+1 - maxW;
+            U32 consumed;
+            for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
+                U32* const rankValPtr = rankVal[consumed];
+                U32 w;
+                for (w = 1; w < maxW+1; w++) {
+                    rankValPtr[w] = rankVal0[w] >> consumed;
+    }   }   }   }
+
+    HUF_fillDTableX4(dt, maxTableLog,
+                   sortedSymbol, sizeOfSort,
+                   rankStart0, rankVal, maxW,
+                   tableLog+1);
+
+    dtd.tableLog = (BYTE)maxTableLog;
+    dtd.tableType = 1;
+    memcpy(DTable, &dtd, sizeof(dtd));
+    return iSize;
+}
+
+
+static U32 HUF_decodeSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+    memcpy(op, dt+val, 2);
+    BIT_skipBits(DStream, dt[val].nbBits);
+    return dt[val].length;
+}
+
+static U32 HUF_decodeLastSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+    memcpy(op, dt+val, 1);
+    if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
+    else {
+        if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8)) {
+            BIT_skipBits(DStream, dt[val].nbBits);
+            if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
+                DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);   /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
+    }   }
+    return 1;
+}
+
+
+#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) \
+    ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr) \
+    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
+    if (MEM_64bits()) \
+        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+
+FORCE_INLINE size_t HUF_decodeStreamX4(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd, const HUF_DEltX4* const dt, const U32 dtLog)
+{
+    BYTE* const pStart = p;
+
+    /* up to 8 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-(sizeof(bitDPtr->bitContainer)-1))) {
+        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
+        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
+    }
+
+    /* closer to end : up to 2 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd-2))
+        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
+
+    while (p <= pEnd-2)
+        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
+
+    if (p < pEnd)
+        p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
+
+    return p-pStart;
+}
+
+
+static size_t HUF_decompress1X4_usingDTable_internal(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    BIT_DStream_t bitD;
+
+    /* Init */
+    {   size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
+        if (HUF_isError(errorCode)) return errorCode;
+    }
+
+    /* decode */
+    {   BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        const void* const dtPtr = DTable+1;   /* force compiler to not use strict-aliasing */
+        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
+    }
+
+    /* check */
+    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+
+    /* decoded size */
+    return dstSize;
+}
+
+size_t HUF_decompress1X4_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 1) return ERROR(GENERIC);
+    return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+}
+
+size_t HUF_decompress1X4_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX4 (DCtx, cSrc, cSrcSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress1X4_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
+}
+
+size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress1X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+static size_t HUF_decompress4X4_usingDTable_internal(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
+
+    {   const BYTE* const istart = (const BYTE*) cSrc;
+        BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        const void* const dtPtr = DTable+1;
+        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
+
+        /* Init */
+        BIT_DStream_t bitD1;
+        BIT_DStream_t bitD2;
+        BIT_DStream_t bitD3;
+        BIT_DStream_t bitD4;
+        size_t const length1 = MEM_readLE16(istart);
+        size_t const length2 = MEM_readLE16(istart+2);
+        size_t const length3 = MEM_readLE16(istart+4);
+        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+        const BYTE* const istart1 = istart + 6;  /* jumpTable */
+        const BYTE* const istart2 = istart1 + length1;
+        const BYTE* const istart3 = istart2 + length2;
+        const BYTE* const istart4 = istart3 + length3;
+        size_t const segmentSize = (dstSize+3) / 4;
+        BYTE* const opStart2 = ostart + segmentSize;
+        BYTE* const opStart3 = opStart2 + segmentSize;
+        BYTE* const opStart4 = opStart3 + segmentSize;
+        BYTE* op1 = ostart;
+        BYTE* op2 = opStart2;
+        BYTE* op3 = opStart3;
+        BYTE* op4 = opStart4;
+        U32 endSignal;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        U32 const dtLog = dtd.tableLog;
+
+        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
+          if (HUF_isError(errorCode)) return errorCode; }
+        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
+          if (HUF_isError(errorCode)) return errorCode; }
+
+        /* 16-32 symbols per loop (4-8 symbols per stream) */
+        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+        for ( ; (endSignal==BIT_DStream_unfinished) & (op4<(oend-(sizeof(bitD4.bitContainer)-1))) ; ) {
+            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
+            HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
+            HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
+            HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
+            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
+            HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
+            HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
+            HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
+
+            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+        }
+
+        /* check corruption */
+        if (op1 > opStart2) return ERROR(corruption_detected);
+        if (op2 > opStart3) return ERROR(corruption_detected);
+        if (op3 > opStart4) return ERROR(corruption_detected);
+        /* note : op4 already verified within main loop */
+
+        /* finish bitStreams one by one */
+        HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
+        HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
+        HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
+        HUF_decodeStreamX4(op4, &bitD4, oend,     dt, dtLog);
+
+        /* check */
+        { U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+          if (!endCheck) return ERROR(corruption_detected); }
+
+        /* decoded size */
+        return dstSize;
+    }
+}
+
+
+size_t HUF_decompress4X4_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 1) return ERROR(GENERIC);
+    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+}
+
+
+size_t HUF_decompress4X4_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t hSize = HUF_readDTableX4 (dctx, cSrc, cSrcSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
+}
+
+size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress4X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+
+/* ********************************/
+/* Generic decompression selector */
+/* ********************************/
+
+size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize,
+                                    const void* cSrc, size_t cSrcSize,
+                                    const HUF_DTable* DTable)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+    return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
+                           HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
+}
+
+size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize,
+                                    const void* cSrc, size_t cSrcSize,
+                                    const HUF_DTable* DTable)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+    return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
+                           HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
+}
+
+
+typedef struct { U32 tableTime; U32 decode256Time; } algo_time_t;
+static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] =
+{
+    /* single, double, quad */
+    {{0,0}, {1,1}, {2,2}},  /* Q==0 : impossible */
+    {{0,0}, {1,1}, {2,2}},  /* Q==1 : impossible */
+    {{  38,130}, {1313, 74}, {2151, 38}},   /* Q == 2 : 12-18% */
+    {{ 448,128}, {1353, 74}, {2238, 41}},   /* Q == 3 : 18-25% */
+    {{ 556,128}, {1353, 74}, {2238, 47}},   /* Q == 4 : 25-32% */
+    {{ 714,128}, {1418, 74}, {2436, 53}},   /* Q == 5 : 32-38% */
+    {{ 883,128}, {1437, 74}, {2464, 61}},   /* Q == 6 : 38-44% */
+    {{ 897,128}, {1515, 75}, {2622, 68}},   /* Q == 7 : 44-50% */
+    {{ 926,128}, {1613, 75}, {2730, 75}},   /* Q == 8 : 50-56% */
+    {{ 947,128}, {1729, 77}, {3359, 77}},   /* Q == 9 : 56-62% */
+    {{1107,128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
+    {{1177,128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
+    {{1242,128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
+    {{1349,128}, {2644,106}, {5260,106}},   /* Q ==13 : 81-87% */
+    {{1455,128}, {2422,124}, {4174,124}},   /* Q ==14 : 87-93% */
+    {{ 722,128}, {1891,145}, {1936,146}},   /* Q ==15 : 93-99% */
+};
+
+/** HUF_selectDecoder() :
+*   Tells which decoder is likely to decode faster,
+*   based on a set of pre-determined metrics.
+*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
+*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
+U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize)
+{
+    /* decoder timing evaluation */
+    U32 const Q = (U32)(cSrcSize * 16 / dstSize);   /* Q < 16 since dstSize > cSrcSize */
+    U32 const D256 = (U32)(dstSize >> 8);
+    U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
+    U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
+    DTime1 += DTime1 >> 3;  /* advantage to algorithm using less memory, for cache eviction */
+
+    return DTime1 < DTime0;
+}
+
+
+typedef size_t (*decompressionAlgo)(void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
+
+size_t HUF_decompress (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    static const decompressionAlgo decompress[2] = { HUF_decompress4X2, HUF_decompress4X4 };
+
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+        return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
+    }
+}
+
+size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+        return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+                        HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+    }
+}
+
+size_t HUF_decompress4X_hufOnly (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if ((cSrcSize >= dstSize) || (cSrcSize <= 1)) return ERROR(corruption_detected);   /* invalid */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+        return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+                        HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+    }
+}
+
+size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+        return algoNb ? HUF_decompress1X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+                        HUF_decompress1X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+    }
+}
diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
new file mode 100644
index 000000000..f049d181b
--- /dev/null
+++ b/contrib/linux-kernel/lib/mem.h
@@ -0,0 +1,374 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+#ifndef MEM_H_MODULE
+#define MEM_H_MODULE
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+/*-****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>     /* size_t, ptrdiff_t */
+#include <string.h>     /* memcpy */
+
+
+/*-****************************************
+*  Compiler specifics
+******************************************/
+#if defined(_MSC_VER)   /* Visual Studio */
+#   include <stdlib.h>  /* _byteswap_ulong */
+#   include <intrin.h>  /* _byteswap_* */
+#endif
+#if defined(__GNUC__)
+#  define MEM_STATIC static __inline __attribute__((unused))
+#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#  define MEM_STATIC static inline
+#elif defined(_MSC_VER)
+#  define MEM_STATIC static __inline
+#else
+#  define MEM_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
+#endif
+
+/* code only tested on 32 and 64 bits systems */
+#define MEM_STATIC_ASSERT(c)   { enum { MEM_static_assert = 1/(int)(!!(c)) }; }
+MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (sizeof(size_t)==8)); }
+
+
+/*-**************************************************************
+*  Basic Types
+*****************************************************************/
+#if  !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
+# include <stdint.h>
+  typedef   uint8_t BYTE;
+  typedef  uint16_t U16;
+  typedef   int16_t S16;
+  typedef  uint32_t U32;
+  typedef   int32_t S32;
+  typedef  uint64_t U64;
+  typedef   int64_t S64;
+  typedef  intptr_t iPtrDiff;
+  typedef uintptr_t uPtrDiff;
+#else
+  typedef unsigned char      BYTE;
+  typedef unsigned short      U16;
+  typedef   signed short      S16;
+  typedef unsigned int        U32;
+  typedef   signed int        S32;
+  typedef unsigned long long  U64;
+  typedef   signed long long  S64;
+  typedef ptrdiff_t      iPtrDiff;
+  typedef size_t         uPtrDiff;
+#endif
+
+
+/*-**************************************************************
+*  Memory I/O
+*****************************************************************/
+/* MEM_FORCE_MEMORY_ACCESS :
+ * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
+ * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
+ * The below switch allow to select different access method for improved performance.
+ * Method 0 (default) : use `memcpy()`. Safe and portable.
+ * Method 1 : `__packed` statement. It depends on compiler extension (i.e., not portable).
+ *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
+ * Method 2 : direct access. This method is portable but violate C standard.
+ *            It can generate buggy code on targets depending on alignment.
+ *            In some circumstances, it's the only known way to get the most performance (i.e. GCC + ARMv6)
+ * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
+ * Prefer these methods in priority order (0 > 1 > 2)
+ */
+#ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
+#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
+#    define MEM_FORCE_MEMORY_ACCESS 2
+#  elif defined(__INTEL_COMPILER) /*|| defined(_MSC_VER)*/ || \
+  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
+#    define MEM_FORCE_MEMORY_ACCESS 1
+#  endif
+#endif
+
+MEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }
+MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
+
+MEM_STATIC unsigned MEM_isLittleEndian(void)
+{
+    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
+    return one.c[0];
+}
+
+#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
+
+/* violates C standard, by lying on structure alignment.
+Only use if no other choice to achieve best performance on target platform */
+MEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }
+MEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }
+MEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }
+MEM_STATIC U64 MEM_readST(const void* memPtr) { return *(const size_t*) memPtr; }
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
+MEM_STATIC void MEM_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }
+MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
+
+#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)
+
+/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
+/* currently only defined for gcc and icc */
+#if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
+    __pragma( pack(push, 1) )
+    typedef union { U16 u16; U32 u32; U64 u64; size_t st; } unalign;
+    __pragma( pack(pop) )
+#else
+    typedef union { U16 u16; U32 u32; U64 u64; size_t st; } __attribute__((packed)) unalign;
+#endif
+
+MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }
+MEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
+MEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
+MEM_STATIC U64 MEM_readST(const void* ptr) { return ((const unalign*)ptr)->st; }
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign*)memPtr)->u16 = value; }
+MEM_STATIC void MEM_write32(void* memPtr, U32 value) { ((unalign*)memPtr)->u32 = value; }
+MEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign*)memPtr)->u64 = value; }
+
+#else
+
+/* default method, safe and standard.
+   can sometimes prove slower */
+
+MEM_STATIC U16 MEM_read16(const void* memPtr)
+{
+    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC U32 MEM_read32(const void* memPtr)
+{
+    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC U64 MEM_read64(const void* memPtr)
+{
+    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC size_t MEM_readST(const void* memPtr)
+{
+    size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+MEM_STATIC void MEM_write32(void* memPtr, U32 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+MEM_STATIC void MEM_write64(void* memPtr, U64 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+#endif /* MEM_FORCE_MEMORY_ACCESS */
+
+MEM_STATIC U32 MEM_swap32(U32 in)
+{
+#if defined(_MSC_VER)     /* Visual Studio */
+    return _byteswap_ulong(in);
+#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
+    return __builtin_bswap32(in);
+#else
+    return  ((in << 24) & 0xff000000 ) |
+            ((in <<  8) & 0x00ff0000 ) |
+            ((in >>  8) & 0x0000ff00 ) |
+            ((in >> 24) & 0x000000ff );
+#endif
+}
+
+MEM_STATIC U64 MEM_swap64(U64 in)
+{
+#if defined(_MSC_VER)     /* Visual Studio */
+    return _byteswap_uint64(in);
+#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
+    return __builtin_bswap64(in);
+#else
+    return  ((in << 56) & 0xff00000000000000ULL) |
+            ((in << 40) & 0x00ff000000000000ULL) |
+            ((in << 24) & 0x0000ff0000000000ULL) |
+            ((in << 8)  & 0x000000ff00000000ULL) |
+            ((in >> 8)  & 0x00000000ff000000ULL) |
+            ((in >> 24) & 0x0000000000ff0000ULL) |
+            ((in >> 40) & 0x000000000000ff00ULL) |
+            ((in >> 56) & 0x00000000000000ffULL);
+#endif
+}
+
+MEM_STATIC size_t MEM_swapST(size_t in)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_swap32((U32)in);
+    else
+        return (size_t)MEM_swap64((U64)in);
+}
+
+/*=== Little endian r/w ===*/
+
+MEM_STATIC U16 MEM_readLE16(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read16(memPtr);
+    else {
+        const BYTE* p = (const BYTE*)memPtr;
+        return (U16)(p[0] + (p[1]<<8));
+    }
+}
+
+MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
+{
+    if (MEM_isLittleEndian()) {
+        MEM_write16(memPtr, val);
+    } else {
+        BYTE* p = (BYTE*)memPtr;
+        p[0] = (BYTE)val;
+        p[1] = (BYTE)(val>>8);
+    }
+}
+
+MEM_STATIC U32 MEM_readLE24(const void* memPtr)
+{
+    return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
+}
+
+MEM_STATIC void MEM_writeLE24(void* memPtr, U32 val)
+{
+    MEM_writeLE16(memPtr, (U16)val);
+    ((BYTE*)memPtr)[2] = (BYTE)(val>>16);
+}
+
+MEM_STATIC U32 MEM_readLE32(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read32(memPtr);
+    else
+        return MEM_swap32(MEM_read32(memPtr));
+}
+
+MEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)
+{
+    if (MEM_isLittleEndian())
+        MEM_write32(memPtr, val32);
+    else
+        MEM_write32(memPtr, MEM_swap32(val32));
+}
+
+MEM_STATIC U64 MEM_readLE64(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read64(memPtr);
+    else
+        return MEM_swap64(MEM_read64(memPtr));
+}
+
+MEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)
+{
+    if (MEM_isLittleEndian())
+        MEM_write64(memPtr, val64);
+    else
+        MEM_write64(memPtr, MEM_swap64(val64));
+}
+
+MEM_STATIC size_t MEM_readLEST(const void* memPtr)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_readLE32(memPtr);
+    else
+        return (size_t)MEM_readLE64(memPtr);
+}
+
+MEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)
+{
+    if (MEM_32bits())
+        MEM_writeLE32(memPtr, (U32)val);
+    else
+        MEM_writeLE64(memPtr, (U64)val);
+}
+
+/*=== Big endian r/w ===*/
+
+MEM_STATIC U32 MEM_readBE32(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_swap32(MEM_read32(memPtr));
+    else
+        return MEM_read32(memPtr);
+}
+
+MEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)
+{
+    if (MEM_isLittleEndian())
+        MEM_write32(memPtr, MEM_swap32(val32));
+    else
+        MEM_write32(memPtr, val32);
+}
+
+MEM_STATIC U64 MEM_readBE64(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_swap64(MEM_read64(memPtr));
+    else
+        return MEM_read64(memPtr);
+}
+
+MEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)
+{
+    if (MEM_isLittleEndian())
+        MEM_write64(memPtr, MEM_swap64(val64));
+    else
+        MEM_write64(memPtr, val64);
+}
+
+MEM_STATIC size_t MEM_readBEST(const void* memPtr)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_readBE32(memPtr);
+    else
+        return (size_t)MEM_readBE64(memPtr);
+}
+
+MEM_STATIC void MEM_writeBEST(void* memPtr, size_t val)
+{
+    if (MEM_32bits())
+        MEM_writeBE32(memPtr, (U32)val);
+    else
+        MEM_writeBE64(memPtr, (U64)val);
+}
+
+
+/* function safe only for comparisons */
+MEM_STATIC U32 MEM_readMINMATCH(const void* memPtr, U32 length)
+{
+    switch (length)
+    {
+    default :
+    case 4 : return MEM_read32(memPtr);
+    case 3 : if (MEM_isLittleEndian())
+                return MEM_read32(memPtr)<<8;
+             else
+                return MEM_read32(memPtr)>>8;
+    }
+}
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif /* MEM_H_MODULE */
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
new file mode 100644
index 000000000..eb44222c5
--- /dev/null
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -0,0 +1,869 @@
+/*
+*  xxHash - Fast Hash algorithm
+*  Copyright (C) 2012-2016, Yann Collet
+*
+*  BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+*
+*  Redistribution and use in source and binary forms, with or without
+*  modification, are permitted provided that the following conditions are
+*  met:
+*
+*  * Redistributions of source code must retain the above copyright
+*  notice, this list of conditions and the following disclaimer.
+*  * Redistributions in binary form must reproduce the above
+*  copyright notice, this list of conditions and the following disclaimer
+*  in the documentation and/or other materials provided with the
+*  distribution.
+*
+*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+*  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+*  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+*  OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+*  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+*  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+*  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+*  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+*  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+*  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*
+*  You can contact the author at :
+*  - xxHash homepage: http://www.xxhash.com
+*  - xxHash source repository : https://github.com/Cyan4973/xxHash
+*/
+
+
+/* *************************************
+*  Tuning parameters
+***************************************/
+/*!XXH_FORCE_MEMORY_ACCESS :
+ * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
+ * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
+ * The below switch allow to select different access method for improved performance.
+ * Method 0 (default) : use `memcpy()`. Safe and portable.
+ * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
+ *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
+ * Method 2 : direct access. This method doesn't depend on compiler but violate C standard.
+ *            It can generate buggy code on targets which do not support unaligned memory accesses.
+ *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
+ * See http://stackoverflow.com/a/32095106/646947 for details.
+ * Prefer these methods in priority order (0 > 1 > 2)
+ */
+#ifndef XXH_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
+#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
+#    define XXH_FORCE_MEMORY_ACCESS 2
+#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
+  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
+#    define XXH_FORCE_MEMORY_ACCESS 1
+#  endif
+#endif
+
+/*!XXH_ACCEPT_NULL_INPUT_POINTER :
+ * If the input pointer is a null pointer, xxHash default behavior is to trigger a memory access error, since it is a bad pointer.
+ * When this option is enabled, xxHash output for null input pointers will be the same as a null-length input.
+ * By default, this option is disabled. To enable it, uncomment below define :
+ */
+/* #define XXH_ACCEPT_NULL_INPUT_POINTER 1 */
+
+/*!XXH_FORCE_NATIVE_FORMAT :
+ * By default, xxHash library provides endian-independant Hash values, based on little-endian convention.
+ * Results are therefore identical for little-endian and big-endian CPU.
+ * This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format.
+ * Should endian-independance be of no importance for your application, you may set the #define below to 1,
+ * to improve speed for Big-endian CPU.
+ * This option has no impact on Little_Endian CPU.
+ */
+#ifndef XXH_FORCE_NATIVE_FORMAT   /* can be defined externally */
+#  define XXH_FORCE_NATIVE_FORMAT 0
+#endif
+
+/*!XXH_FORCE_ALIGN_CHECK :
+ * This is a minor performance trick, only useful with lots of very small keys.
+ * It means : check for aligned/unaligned input.
+ * The check costs one initial branch per hash; set to 0 when the input data
+ * is guaranteed to be aligned.
+ */
+#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */
+#  if defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)
+#    define XXH_FORCE_ALIGN_CHECK 0
+#  else
+#    define XXH_FORCE_ALIGN_CHECK 1
+#  endif
+#endif
+
+
+/* *************************************
+*  Includes & Memory related functions
+***************************************/
+/* Modify the local functions below should you wish to use some other memory routines */
+/* for malloc(), free() */
+#include <stdlib.h>
+static void* XXH_malloc(size_t s) { return malloc(s); }
+static void  XXH_free  (void* p)  { free(p); }
+/* for memcpy() */
+#include <string.h>
+static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
+
+#ifndef XXH_STATIC_LINKING_ONLY
+#  define XXH_STATIC_LINKING_ONLY
+#endif
+#include "xxhash.h"
+
+
+/* *************************************
+*  Compiler Specific Options
+***************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  pragma warning(disable : 4127)      /* disable: C4127: conditional expression is constant */
+#  define FORCE_INLINE static __forceinline
+#else
+#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#    ifdef __GNUC__
+#      define FORCE_INLINE static inline __attribute__((always_inline))
+#    else
+#      define FORCE_INLINE static inline
+#    endif
+#  else
+#    define FORCE_INLINE static
+#  endif /* __STDC_VERSION__ */
+#endif
+
+
+/* *************************************
+*  Basic Types
+***************************************/
+#ifndef MEM_MODULE
+# define MEM_MODULE
+# if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
+#   include <stdint.h>
+    typedef uint8_t  BYTE;
+    typedef uint16_t U16;
+    typedef uint32_t U32;
+    typedef  int32_t S32;
+    typedef uint64_t U64;
+#  else
+    typedef unsigned char      BYTE;
+    typedef unsigned short     U16;
+    typedef unsigned int       U32;
+    typedef   signed int       S32;
+    typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
+#  endif
+#endif
+
+
+#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))
+
+/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */
+static U32 XXH_read32(const void* memPtr) { return *(const U32*) memPtr; }
+static U64 XXH_read64(const void* memPtr) { return *(const U64*) memPtr; }
+
+#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))
+
+/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
+/* currently only defined for gcc and icc */
+typedef union { U32 u32; U64 u64; } __attribute__((packed)) unalign;
+
+static U32 XXH_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
+static U64 XXH_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
+
+#else
+
+/* portable and safe solution. Generally efficient.
+ * see : http://stackoverflow.com/a/32095106/646947
+ */
+
+static U32 XXH_read32(const void* memPtr)
+{
+    U32 val;
+    memcpy(&val, memPtr, sizeof(val));
+    return val;
+}
+
+static U64 XXH_read64(const void* memPtr)
+{
+    U64 val;
+    memcpy(&val, memPtr, sizeof(val));
+    return val;
+}
+
+#endif   /* XXH_FORCE_DIRECT_MEMORY_ACCESS */
+
+
+/* ****************************************
+*  Compiler-specific Functions and Macros
+******************************************/
+#define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
+
+/* Note : although _rotl exists for minGW (GCC under windows), performance seems poor */
+#if defined(_MSC_VER)
+#  define XXH_rotl32(x,r) _rotl(x,r)
+#  define XXH_rotl64(x,r) _rotl64(x,r)
+#else
+#  define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
+#  define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
+#endif
+
+#if defined(_MSC_VER)     /* Visual Studio */
+#  define XXH_swap32 _byteswap_ulong
+#  define XXH_swap64 _byteswap_uint64
+#elif GCC_VERSION >= 403
+#  define XXH_swap32 __builtin_bswap32
+#  define XXH_swap64 __builtin_bswap64
+#else
+static U32 XXH_swap32 (U32 x)
+{
+    return  ((x << 24) & 0xff000000 ) |
+            ((x <<  8) & 0x00ff0000 ) |
+            ((x >>  8) & 0x0000ff00 ) |
+            ((x >> 24) & 0x000000ff );
+}
+static U64 XXH_swap64 (U64 x)
+{
+    return  ((x << 56) & 0xff00000000000000ULL) |
+            ((x << 40) & 0x00ff000000000000ULL) |
+            ((x << 24) & 0x0000ff0000000000ULL) |
+            ((x << 8)  & 0x000000ff00000000ULL) |
+            ((x >> 8)  & 0x00000000ff000000ULL) |
+            ((x >> 24) & 0x0000000000ff0000ULL) |
+            ((x >> 40) & 0x000000000000ff00ULL) |
+            ((x >> 56) & 0x00000000000000ffULL);
+}
+#endif
+
+
+/* *************************************
+*  Architecture Macros
+***************************************/
+typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
+
+/* XXH_CPU_LITTLE_ENDIAN can be defined externally, for example on the compiler command line */
+#ifndef XXH_CPU_LITTLE_ENDIAN
+    static const int g_one = 1;
+#   define XXH_CPU_LITTLE_ENDIAN   (*(const char*)(&g_one))
+#endif
+
+
+/* ***************************
+*  Memory reads
+*****************************/
+typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
+
+FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
+{
+    if (align==XXH_unaligned)
+        return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
+    else
+        return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
+}
+
+FORCE_INLINE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
+{
+    return XXH_readLE32_align(ptr, endian, XXH_unaligned);
+}
+
+static U32 XXH_readBE32(const void* ptr)
+{
+    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
+}
+
+FORCE_INLINE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
+{
+    if (align==XXH_unaligned)
+        return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
+    else
+        return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
+}
+
+FORCE_INLINE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
+{
+    return XXH_readLE64_align(ptr, endian, XXH_unaligned);
+}
+
+static U64 XXH_readBE64(const void* ptr)
+{
+    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
+}
+
+
+/* *************************************
+*  Macros
+***************************************/
+#define XXH_STATIC_ASSERT(c)   { enum { XXH_static_assert = 1/(int)(!!(c)) }; }    /* use only *after* variable declarations */
+
+
+/* *************************************
+*  Constants
+***************************************/
+static const U32 PRIME32_1 = 2654435761U;
+static const U32 PRIME32_2 = 2246822519U;
+static const U32 PRIME32_3 = 3266489917U;
+static const U32 PRIME32_4 =  668265263U;
+static const U32 PRIME32_5 =  374761393U;
+
+static const U64 PRIME64_1 = 11400714785074694791ULL;
+static const U64 PRIME64_2 = 14029467366897019727ULL;
+static const U64 PRIME64_3 =  1609587929392839161ULL;
+static const U64 PRIME64_4 =  9650029242287828579ULL;
+static const U64 PRIME64_5 =  2870177450012600261ULL;
+
+XXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }
+
+
+/* **************************
+*  Utils
+****************************/
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dstState, const XXH32_state_t* restrict srcState)
+{
+    memcpy(dstState, srcState, sizeof(*dstState));
+}
+
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dstState, const XXH64_state_t* restrict srcState)
+{
+    memcpy(dstState, srcState, sizeof(*dstState));
+}
+
+
+/* ***************************
+*  Simple Hash Functions
+*****************************/
+
+static U32 XXH32_round(U32 seed, U32 input)
+{
+    seed += input * PRIME32_2;
+    seed  = XXH_rotl32(seed, 13);
+    seed *= PRIME32_1;
+    return seed;
+}
+
+FORCE_INLINE U32 XXH32_endian_align(const void* input, size_t len, U32 seed, XXH_endianess endian, XXH_alignment align)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* bEnd = p + len;
+    U32 h32;
+#define XXH_get32bits(p) XXH_readLE32_align(p, endian, align)
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (p==NULL) {
+        len=0;
+        bEnd=p=(const BYTE*)(size_t)16;
+    }
+#endif
+
+    if (len>=16) {
+        const BYTE* const limit = bEnd - 16;
+        U32 v1 = seed + PRIME32_1 + PRIME32_2;
+        U32 v2 = seed + PRIME32_2;
+        U32 v3 = seed + 0;
+        U32 v4 = seed - PRIME32_1;
+
+        do {
+            v1 = XXH32_round(v1, XXH_get32bits(p)); p+=4;
+            v2 = XXH32_round(v2, XXH_get32bits(p)); p+=4;
+            v3 = XXH32_round(v3, XXH_get32bits(p)); p+=4;
+            v4 = XXH32_round(v4, XXH_get32bits(p)); p+=4;
+        } while (p<=limit);
+
+        h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);
+    } else {
+        h32  = seed + PRIME32_5;
+    }
+
+    h32 += (U32) len;
+
+    while (p+4<=bEnd) {
+        h32 += XXH_get32bits(p) * PRIME32_3;
+        h32  = XXH_rotl32(h32, 17) * PRIME32_4 ;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h32 += (*p) * PRIME32_5;
+        h32 = XXH_rotl32(h32, 11) * PRIME32_1 ;
+        p++;
+    }
+
+    h32 ^= h32 >> 15;
+    h32 *= PRIME32_2;
+    h32 ^= h32 >> 13;
+    h32 *= PRIME32_3;
+    h32 ^= h32 >> 16;
+
+    return h32;
+}
+
+
+XXH_PUBLIC_API unsigned int XXH32 (const void* input, size_t len, unsigned int seed)
+{
+#if 0
+    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+    XXH32_CREATESTATE_STATIC(state);
+    XXH32_reset(state, seed);
+    XXH32_update(state, input, len);
+    return XXH32_digest(state);
+#else
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if (XXH_FORCE_ALIGN_CHECK) {
+        if ((((size_t)input) & 3) == 0) {   /* Input is 4-bytes aligned, leverage the speed benefit */
+            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+                return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+            else
+                return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+    }   }
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+    else
+        return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+#endif
+}
+
+
+static U64 XXH64_round(U64 acc, U64 input)
+{
+    acc += input * PRIME64_2;
+    acc  = XXH_rotl64(acc, 31);
+    acc *= PRIME64_1;
+    return acc;
+}
+
+static U64 XXH64_mergeRound(U64 acc, U64 val)
+{
+    val  = XXH64_round(0, val);
+    acc ^= val;
+    acc  = acc * PRIME64_1 + PRIME64_4;
+    return acc;
+}
+
+FORCE_INLINE U64 XXH64_endian_align(const void* input, size_t len, U64 seed, XXH_endianess endian, XXH_alignment align)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+    U64 h64;
+#define XXH_get64bits(p) XXH_readLE64_align(p, endian, align)
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (p==NULL) {
+        len=0;
+        bEnd=p=(const BYTE*)(size_t)32;
+    }
+#endif
+
+    if (len>=32) {
+        const BYTE* const limit = bEnd - 32;
+        U64 v1 = seed + PRIME64_1 + PRIME64_2;
+        U64 v2 = seed + PRIME64_2;
+        U64 v3 = seed + 0;
+        U64 v4 = seed - PRIME64_1;
+
+        do {
+            v1 = XXH64_round(v1, XXH_get64bits(p)); p+=8;
+            v2 = XXH64_round(v2, XXH_get64bits(p)); p+=8;
+            v3 = XXH64_round(v3, XXH_get64bits(p)); p+=8;
+            v4 = XXH64_round(v4, XXH_get64bits(p)); p+=8;
+        } while (p<=limit);
+
+        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+        h64 = XXH64_mergeRound(h64, v1);
+        h64 = XXH64_mergeRound(h64, v2);
+        h64 = XXH64_mergeRound(h64, v3);
+        h64 = XXH64_mergeRound(h64, v4);
+
+    } else {
+        h64  = seed + PRIME64_5;
+    }
+
+    h64 += (U64) len;
+
+    while (p+8<=bEnd) {
+        U64 const k1 = XXH64_round(0, XXH_get64bits(p));
+        h64 ^= k1;
+        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+        p+=8;
+    }
+
+    if (p+4<=bEnd) {
+        h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1;
+        h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h64 ^= (*p) * PRIME64_5;
+        h64 = XXH_rotl64(h64, 11) * PRIME64_1;
+        p++;
+    }
+
+    h64 ^= h64 >> 33;
+    h64 *= PRIME64_2;
+    h64 ^= h64 >> 29;
+    h64 *= PRIME64_3;
+    h64 ^= h64 >> 32;
+
+    return h64;
+}
+
+
+XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned long long seed)
+{
+#if 0
+    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+    XXH64_CREATESTATE_STATIC(state);
+    XXH64_reset(state, seed);
+    XXH64_update(state, input, len);
+    return XXH64_digest(state);
+#else
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if (XXH_FORCE_ALIGN_CHECK) {
+        if ((((size_t)input) & 7)==0) {  /* Input is aligned, let's leverage the speed advantage */
+            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+                return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+            else
+                return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+    }   }
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+    else
+        return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+#endif
+}
+
+
+/* **************************************************
+*  Advanced Hash Functions
+****************************************************/
+
+XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)
+{
+    return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
+}
+XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)
+{
+    XXH_free(statePtr);
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)
+{
+    return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
+}
+XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
+{
+    XXH_free(statePtr);
+    return XXH_OK;
+}
+
+
+/*** Hash feed ***/
+
+XXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, unsigned int seed)
+{
+    XXH32_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+    memset(&state, 0, sizeof(state)-4);   /* do not write into reserved, for future removal */
+    state.v1 = seed + PRIME32_1 + PRIME32_2;
+    state.v2 = seed + PRIME32_2;
+    state.v3 = seed + 0;
+    state.v4 = seed - PRIME32_1;
+    memcpy(statePtr, &state, sizeof(state));
+    return XXH_OK;
+}
+
+
+XXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH64_state_t* statePtr, unsigned long long seed)
+{
+    XXH64_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+    memset(&state, 0, sizeof(state)-8);   /* do not write into reserved, for future removal */
+    state.v1 = seed + PRIME64_1 + PRIME64_2;
+    state.v2 = seed + PRIME64_2;
+    state.v3 = seed + 0;
+    state.v4 = seed - PRIME64_1;
+    memcpy(statePtr, &state, sizeof(state));
+    return XXH_OK;
+}
+
+
+FORCE_INLINE XXH_errorcode XXH32_update_endian (XXH32_state_t* state, const void* input, size_t len, XXH_endianess endian)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (input==NULL) return XXH_ERROR;
+#endif
+
+    state->total_len_32 += (unsigned)len;
+    state->large_len |= (len>=16) | (state->total_len_32>=16);
+
+    if (state->memsize + len < 16)  {   /* fill in tmp buffer */
+        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len);
+        state->memsize += (unsigned)len;
+        return XXH_OK;
+    }
+
+    if (state->memsize) {   /* some data left from previous update */
+        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize);
+        {   const U32* p32 = state->mem32;
+            state->v1 = XXH32_round(state->v1, XXH_readLE32(p32, endian)); p32++;
+            state->v2 = XXH32_round(state->v2, XXH_readLE32(p32, endian)); p32++;
+            state->v3 = XXH32_round(state->v3, XXH_readLE32(p32, endian)); p32++;
+            state->v4 = XXH32_round(state->v4, XXH_readLE32(p32, endian)); p32++;
+        }
+        p += 16-state->memsize;
+        state->memsize = 0;
+    }
+
+    if (p <= bEnd-16) {
+        const BYTE* const limit = bEnd - 16;
+        U32 v1 = state->v1;
+        U32 v2 = state->v2;
+        U32 v3 = state->v3;
+        U32 v4 = state->v4;
+
+        do {
+            v1 = XXH32_round(v1, XXH_readLE32(p, endian)); p+=4;
+            v2 = XXH32_round(v2, XXH_readLE32(p, endian)); p+=4;
+            v3 = XXH32_round(v3, XXH_readLE32(p, endian)); p+=4;
+            v4 = XXH32_round(v4, XXH_readLE32(p, endian)); p+=4;
+        } while (p<=limit);
+
+        state->v1 = v1;
+        state->v2 = v2;
+        state->v3 = v3;
+        state->v4 = v4;
+    }
+
+    if (p < bEnd) {
+        XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));
+        state->memsize = (unsigned)(bEnd-p);
+    }
+
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* state_in, const void* input, size_t len)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_update_endian(state_in, input, len, XXH_littleEndian);
+    else
+        return XXH32_update_endian(state_in, input, len, XXH_bigEndian);
+}
+
+
+
+FORCE_INLINE U32 XXH32_digest_endian (const XXH32_state_t* state, XXH_endianess endian)
+{
+    const BYTE * p = (const BYTE*)state->mem32;
+    const BYTE* const bEnd = (const BYTE*)(state->mem32) + state->memsize;
+    U32 h32;
+
+    if (state->large_len) {
+        h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18);
+    } else {
+        h32 = state->v3 /* == seed */ + PRIME32_5;
+    }
+
+    h32 += state->total_len_32;
+
+    while (p+4<=bEnd) {
+        h32 += XXH_readLE32(p, endian) * PRIME32_3;
+        h32  = XXH_rotl32(h32, 17) * PRIME32_4;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h32 += (*p) * PRIME32_5;
+        h32  = XXH_rotl32(h32, 11) * PRIME32_1;
+        p++;
+    }
+
+    h32 ^= h32 >> 15;
+    h32 *= PRIME32_2;
+    h32 ^= h32 >> 13;
+    h32 *= PRIME32_3;
+    h32 ^= h32 >> 16;
+
+    return h32;
+}
+
+
+XXH_PUBLIC_API unsigned int XXH32_digest (const XXH32_state_t* state_in)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_digest_endian(state_in, XXH_littleEndian);
+    else
+        return XXH32_digest_endian(state_in, XXH_bigEndian);
+}
+
+
+
+/* **** XXH64 **** */
+
+FORCE_INLINE XXH_errorcode XXH64_update_endian (XXH64_state_t* state, const void* input, size_t len, XXH_endianess endian)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (input==NULL) return XXH_ERROR;
+#endif
+
+    state->total_len += len;
+
+    if (state->memsize + len < 32) {  /* fill in tmp buffer */
+        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len);
+        state->memsize += (U32)len;
+        return XXH_OK;
+    }
+
+    if (state->memsize) {   /* tmp buffer is full */
+        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize);
+        state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0, endian));
+        state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1, endian));
+        state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2, endian));
+        state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3, endian));
+        p += 32-state->memsize;
+        state->memsize = 0;
+    }
+
+    if (p+32 <= bEnd) {
+        const BYTE* const limit = bEnd - 32;
+        U64 v1 = state->v1;
+        U64 v2 = state->v2;
+        U64 v3 = state->v3;
+        U64 v4 = state->v4;
+
+        do {
+            v1 = XXH64_round(v1, XXH_readLE64(p, endian)); p+=8;
+            v2 = XXH64_round(v2, XXH_readLE64(p, endian)); p+=8;
+            v3 = XXH64_round(v3, XXH_readLE64(p, endian)); p+=8;
+            v4 = XXH64_round(v4, XXH_readLE64(p, endian)); p+=8;
+        } while (p<=limit);
+
+        state->v1 = v1;
+        state->v2 = v2;
+        state->v3 = v3;
+        state->v4 = v4;
+    }
+
+    if (p < bEnd) {
+        XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));
+        state->memsize = (unsigned)(bEnd-p);
+    }
+
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* state_in, const void* input, size_t len)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_update_endian(state_in, input, len, XXH_littleEndian);
+    else
+        return XXH64_update_endian(state_in, input, len, XXH_bigEndian);
+}
+
+
+
+FORCE_INLINE U64 XXH64_digest_endian (const XXH64_state_t* state, XXH_endianess endian)
+{
+    const BYTE * p = (const BYTE*)state->mem64;
+    const BYTE* const bEnd = (const BYTE*)state->mem64 + state->memsize;
+    U64 h64;
+
+    if (state->total_len >= 32) {
+        U64 const v1 = state->v1;
+        U64 const v2 = state->v2;
+        U64 const v3 = state->v3;
+        U64 const v4 = state->v4;
+
+        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+        h64 = XXH64_mergeRound(h64, v1);
+        h64 = XXH64_mergeRound(h64, v2);
+        h64 = XXH64_mergeRound(h64, v3);
+        h64 = XXH64_mergeRound(h64, v4);
+    } else {
+        h64  = state->v3 + PRIME64_5;
+    }
+
+    h64 += (U64) state->total_len;
+
+    while (p+8<=bEnd) {
+        U64 const k1 = XXH64_round(0, XXH_readLE64(p, endian));
+        h64 ^= k1;
+        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+        p+=8;
+    }
+
+    if (p+4<=bEnd) {
+        h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1;
+        h64  = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h64 ^= (*p) * PRIME64_5;
+        h64  = XXH_rotl64(h64, 11) * PRIME64_1;
+        p++;
+    }
+
+    h64 ^= h64 >> 33;
+    h64 *= PRIME64_2;
+    h64 ^= h64 >> 29;
+    h64 *= PRIME64_3;
+    h64 ^= h64 >> 32;
+
+    return h64;
+}
+
+
+XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_digest_endian(state_in, XXH_littleEndian);
+    else
+        return XXH64_digest_endian(state_in, XXH_bigEndian);
+}
+
+
+/* **************************
+*  Canonical representation
+****************************/
+
+/*! Default XXH result types are basic unsigned 32 and 64 bits.
+*   The canonical representation follows human-readable write convention, aka big-endian (large digits first).
+*   These functions allow transformation of hash result into and from its canonical format.
+*   This way, hash values can be written into a file or buffer, and remain comparable across different systems and programs.
+*/
+
+XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
+{
+    XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
+    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
+    memcpy(dst, &hash, sizeof(*dst));
+}
+
+XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
+{
+    XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
+    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
+    memcpy(dst, &hash, sizeof(*dst));
+}
+
+XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)
+{
+    return XXH_readBE32(src);
+}
+
+XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src)
+{
+    return XXH_readBE64(src);
+}
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
new file mode 100644
index 000000000..9bad1f59f
--- /dev/null
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -0,0 +1,305 @@
+/*
+   xxHash - Extremely Fast Hash algorithm
+   Header File
+   Copyright (C) 2012-2016, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+   - xxHash source repository : https://github.com/Cyan4973/xxHash
+*/
+
+/* Notice extracted from xxHash homepage :
+
+xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
+It also successfully passes all tests from the SMHasher suite.
+
+Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)
+
+Name            Speed       Q.Score   Author
+xxHash          5.4 GB/s     10
+CrapWow         3.2 GB/s      2       Andrew
+MumurHash 3a    2.7 GB/s     10       Austin Appleby
+SpookyHash      2.0 GB/s     10       Bob Jenkins
+SBox            1.4 GB/s      9       Bret Mulvey
+Lookup3         1.2 GB/s      9       Bob Jenkins
+SuperFastHash   1.2 GB/s      1       Paul Hsieh
+CityHash64      1.05 GB/s    10       Pike & Alakuijala
+FNV             0.55 GB/s     5       Fowler, Noll, Vo
+CRC32           0.43 GB/s     9
+MD5-32          0.33 GB/s    10       Ronald L. Rivest
+SHA1-32         0.28 GB/s    10
+
+Q.Score is a measure of quality of the hash function.
+It depends on successfully passing SMHasher test set.
+10 is a perfect score.
+
+A 64-bits version, named XXH64, is available since r35.
+It offers much better speed, but for 64-bits applications only.
+Name     Speed on 64 bits    Speed on 32 bits
+XXH64       13.8 GB/s            1.9 GB/s
+XXH32        6.8 GB/s            6.0 GB/s
+*/
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+#ifndef XXHASH_H_5627135585666179
+#define XXHASH_H_5627135585666179 1
+
+
+/* ****************************
+*  Definitions
+******************************/
+#include <stddef.h>   /* size_t */
+typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
+
+
+/* ****************************
+*  API modifier
+******************************/
+/** XXH_PRIVATE_API
+*   This is useful if you want to include xxhash functions in `static` mode
+*   in order to inline them, and remove their symbol from the public list.
+*   Methodology :
+*     #define XXH_PRIVATE_API
+*     #include "xxhash.h"
+*   `xxhash.c` is automatically included.
+*   It's not useful to compile and link it as a separate module anymore.
+*/
+#ifdef XXH_PRIVATE_API
+#  ifndef XXH_STATIC_LINKING_ONLY
+#    define XXH_STATIC_LINKING_ONLY
+#  endif
+#  if defined(__GNUC__)
+#    define XXH_PUBLIC_API static __inline __attribute__((unused))
+#  elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#    define XXH_PUBLIC_API static inline
+#  elif defined(_MSC_VER)
+#    define XXH_PUBLIC_API static __inline
+#  else
+#    define XXH_PUBLIC_API static   /* this version may generate warnings for unused static functions; disable the relevant warning */
+#  endif
+#else
+#  define XXH_PUBLIC_API   /* do nothing */
+#endif /* XXH_PRIVATE_API */
+
+/*!XXH_NAMESPACE, aka Namespace Emulation :
+
+If you want to include _and expose_ xxHash functions from within your own library,
+but also want to avoid symbol collisions with another library which also includes xxHash,
+
+you can use XXH_NAMESPACE, to automatically prefix any public symbol from xxhash library
+with the value of XXH_NAMESPACE (so avoid to keep it NULL and avoid numeric values).
+
+Note that no change is required within the calling program as long as it includes `xxhash.h` :
+regular symbol name will be automatically translated by this header.
+*/
+#ifdef XXH_NAMESPACE
+#  define XXH_CAT(A,B) A##B
+#  define XXH_NAME2(A,B) XXH_CAT(A,B)
+#  define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)
+#  define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)
+#  define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)
+#  define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)
+#  define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)
+#  define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)
+#  define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)
+#  define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)
+#  define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)
+#  define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)
+#  define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)
+#  define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)
+#  define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)
+#  define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)
+#  define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)
+#  define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)
+#  define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)
+#  define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)
+#  define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)
+#endif
+
+
+/* *************************************
+*  Version
+***************************************/
+#define XXH_VERSION_MAJOR    0
+#define XXH_VERSION_MINOR    6
+#define XXH_VERSION_RELEASE  2
+#define XXH_VERSION_NUMBER  (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)
+XXH_PUBLIC_API unsigned XXH_versionNumber (void);
+
+
+/* ****************************
+*  Simple Hash Functions
+******************************/
+typedef unsigned int       XXH32_hash_t;
+typedef unsigned long long XXH64_hash_t;
+
+XXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, unsigned int seed);
+XXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, unsigned long long seed);
+
+/*!
+XXH32() :
+    Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
+    The memory between input & input+length must be valid (allocated and read-accessible).
+    "seed" can be used to alter the result predictably.
+    Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
+XXH64() :
+    Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
+    "seed" can be used to alter the result predictably.
+    This function runs 2x faster on 64-bits systems, but slower on 32-bits systems (see benchmark).
+*/
+
+
+/* ****************************
+*  Streaming Hash Functions
+******************************/
+typedef struct XXH32_state_s XXH32_state_t;   /* incomplete type */
+typedef struct XXH64_state_s XXH64_state_t;   /* incomplete type */
+
+/*! State allocation, compatible with dynamic libraries */
+
+XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);
+XXH_PUBLIC_API XXH_errorcode  XXH32_freeState(XXH32_state_t* statePtr);
+
+XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);
+XXH_PUBLIC_API XXH_errorcode  XXH64_freeState(XXH64_state_t* statePtr);
+
+
+/* hash streaming */
+
+XXH_PUBLIC_API XXH_errorcode XXH32_reset  (XXH32_state_t* statePtr, unsigned int seed);
+XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);
+XXH_PUBLIC_API XXH32_hash_t  XXH32_digest (const XXH32_state_t* statePtr);
+
+XXH_PUBLIC_API XXH_errorcode XXH64_reset  (XXH64_state_t* statePtr, unsigned long long seed);
+XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);
+XXH_PUBLIC_API XXH64_hash_t  XXH64_digest (const XXH64_state_t* statePtr);
+
+/*
+These functions generate the xxHash of an input provided in multiple segments.
+Note that, for small input, they are slower than single-call functions, due to state management.
+For small input, prefer `XXH32()` and `XXH64()` .
+
+XXH state must first be allocated, using XXH*_createState() .
+
+Start a new hash by initializing state with a seed, using XXH*_reset().
+
+Then, feed the hash state by calling XXH*_update() as many times as necessary.
+Obviously, input must be allocated and read accessible.
+The function returns an error code, with 0 meaning OK, and any other value meaning there is an error.
+
+Finally, a hash value can be produced anytime, by using XXH*_digest().
+This function returns the nn-bits hash as an int or long long.
+
+It's still possible to continue inserting input into the hash state after a digest,
+and generate some new hashes later on, by calling again XXH*_digest().
+
+When done, free XXH state space if it was allocated dynamically.
+*/
+
+
+/* **************************
+*  Utils
+****************************/
+#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L))   /* ! C99 */
+#  define restrict   /* disable restrict */
+#endif
+
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dst_state, const XXH32_state_t* restrict src_state);
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dst_state, const XXH64_state_t* restrict src_state);
+
+
+/* **************************
+*  Canonical representation
+****************************/
+/* Default result type for XXH functions are primitive unsigned 32 and 64 bits.
+*  The canonical representation uses human-readable write convention, aka big-endian (large digits first).
+*  These functions allow transformation of hash result into and from its canonical format.
+*  This way, hash values can be written into a file / memory, and remain comparable on different systems and programs.
+*/
+typedef struct { unsigned char digest[4]; } XXH32_canonical_t;
+typedef struct { unsigned char digest[8]; } XXH64_canonical_t;
+
+XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
+XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
+
+XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);
+XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);
+
+#endif /* XXHASH_H_5627135585666179 */
+
+
+
+/* ================================================================================================
+   This section contains definitions which are not guaranteed to remain stable.
+   They may change in future versions, becoming incompatible with a different version of the library.
+   They shall only be used with static linking.
+   Never use these definitions in association with dynamic linking !
+=================================================================================================== */
+#if defined(XXH_STATIC_LINKING_ONLY) && !defined(XXH_STATIC_H_3543687687345)
+#define XXH_STATIC_H_3543687687345
+
+/* These definitions are only meant to allow allocation of XXH state
+   statically, on stack, or in a struct for example.
+   Do not use members directly. */
+
+   struct XXH32_state_s {
+       unsigned total_len_32;
+       unsigned large_len;
+       unsigned v1;
+       unsigned v2;
+       unsigned v3;
+       unsigned v4;
+       unsigned mem32[4];   /* buffer defined as U32 for alignment */
+       unsigned memsize;
+       unsigned reserved;   /* never read nor write, will be removed in a future version */
+   };   /* typedef'd to XXH32_state_t */
+
+   struct XXH64_state_s {
+       unsigned long long total_len;
+       unsigned long long v1;
+       unsigned long long v2;
+       unsigned long long v3;
+       unsigned long long v4;
+       unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
+       unsigned memsize;
+       unsigned reserved[2];          /* never read nor write, will be removed in a future version */
+   };   /* typedef'd to XXH64_state_t */
+
+
+#  ifdef XXH_PRIVATE_API
+#    include "xxhash.c"   /* include xxhash functions as `static`, for inlining */
+#  endif
+
+#endif /* XXH_STATIC_LINKING_ONLY && XXH_STATIC_H_3543687687345 */
+
+
+#if defined (__cplusplus)
+}
+#endif
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
new file mode 100644
index 000000000..8408a589a
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -0,0 +1,73 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include <stdlib.h>         /* malloc */
+#include "error_private.h"
+#define ZSTD_STATIC_LINKING_ONLY
+#include "zstd.h"           /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
+
+
+/*-****************************************
+*  Version
+******************************************/
+unsigned ZSTD_versionNumber (void) { return ZSTD_VERSION_NUMBER; }
+
+
+/*-****************************************
+*  ZSTD Error Management
+******************************************/
+/*! ZSTD_isError() :
+*   tells if a return value is an error code */
+unsigned ZSTD_isError(size_t code) { return ERR_isError(code); }
+
+/*! ZSTD_getErrorName() :
+*   provides error code string from function result (useful for debugging) */
+const char* ZSTD_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+/*! ZSTD_getError() :
+*   convert a `size_t` function result into a proper ZSTD_errorCode enum */
+ZSTD_ErrorCode ZSTD_getErrorCode(size_t code) { return ERR_getErrorCode(code); }
+
+/*! ZSTD_getErrorString() :
+*   provides error code string from enum */
+const char* ZSTD_getErrorString(ZSTD_ErrorCode code) { return ERR_getErrorString(code); }
+
+
+/*=**************************************************************
+*  Custom allocator
+****************************************************************/
+/* default uses stdlib */
+void* ZSTD_defaultAllocFunction(void* opaque, size_t size)
+{
+    void* address = malloc(size);
+    (void)opaque;
+    return address;
+}
+
+void ZSTD_defaultFreeFunction(void* opaque, void* address)
+{
+    (void)opaque;
+    free(address);
+}
+
+void* ZSTD_malloc(size_t size, ZSTD_customMem customMem)
+{
+    return customMem.customAlloc(customMem.opaque, size);
+}
+
+void ZSTD_free(void* ptr, ZSTD_customMem customMem)
+{
+    if (ptr!=NULL)
+        customMem.customFree(customMem.opaque, ptr);
+}
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
new file mode 100644
index 000000000..c31f8db91
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -0,0 +1,3400 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include <string.h>         /* memset */
+#include "mem.h"
+#define FSE_STATIC_LINKING_ONLY   /* FSE_encodeSymbol */
+#include "fse.h"
+#define HUF_STATIC_LINKING_ONLY
+#include "huf.h"
+#include "zstd_internal.h"  /* includes zstd.h */
+
+
+/*-*************************************
+*  Constants
+***************************************/
+static const U32 g_searchStrength = 8;   /* control skip over incompressible data */
+#define HASH_READ_SIZE 8
+typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
+
+
+/*-*************************************
+*  Helper functions
+***************************************/
+#define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
+size_t ZSTD_compressBound(size_t srcSize) { return FSE_compressBound(srcSize) + 12; }
+
+
+/*-*************************************
+*  Sequence storage
+***************************************/
+static void ZSTD_resetSeqStore(seqStore_t* ssPtr)
+{
+    ssPtr->lit = ssPtr->litStart;
+    ssPtr->sequences = ssPtr->sequencesStart;
+    ssPtr->longLengthID = 0;
+}
+
+
+/*-*************************************
+*  Context memory management
+***************************************/
+struct ZSTD_CCtx_s {
+    const BYTE* nextSrc;    /* next block here to continue on current prefix */
+    const BYTE* base;       /* All regular indexes relative to this position */
+    const BYTE* dictBase;   /* extDict indexes relative to this position */
+    U32   dictLimit;        /* below that point, need extDict */
+    U32   lowLimit;         /* below that point, no more data */
+    U32   nextToUpdate;     /* index from which to continue dictionary update */
+    U32   nextToUpdate3;    /* index from which to continue dictionary update */
+    U32   hashLog3;         /* dispatch table : larger == faster, more memory */
+    U32   loadedDictEnd;    /* index of end of dictionary */
+    U32   forceWindow;      /* force back-references to respect limit of 1<<wLog, even for dictionary */
+    U32   forceRawDict;     /* Force loading dictionary in "content-only" mode (no header analysis) */
+    ZSTD_compressionStage_e stage;
+    U32   rep[ZSTD_REP_NUM];
+    U32   repToConfirm[ZSTD_REP_NUM];
+    U32   dictID;
+    ZSTD_parameters params;
+    void* workSpace;
+    size_t workSpaceSize;
+    size_t blockSize;
+    U64 frameContentSize;
+    XXH64_state_t xxhState;
+    ZSTD_customMem customMem;
+
+    seqStore_t seqStore;    /* sequences storage ptrs */
+    U32* hashTable;
+    U32* hashTable3;
+    U32* chainTable;
+    HUF_CElt* hufTable;
+    U32 flagStaticTables;
+    HUF_repeat flagStaticHufTable;
+    FSE_CTable offcodeCTable  [FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
+    FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
+    FSE_CTable litlengthCTable  [FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
+    unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
+};
+
+ZSTD_CCtx* ZSTD_createCCtx(void)
+{
+    return ZSTD_createCCtx_advanced(defaultCustomMem);
+}
+
+ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
+{
+    ZSTD_CCtx* cctx;
+
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    cctx = (ZSTD_CCtx*) ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
+    if (!cctx) return NULL;
+    memset(cctx, 0, sizeof(ZSTD_CCtx));
+    cctx->customMem = customMem;
+    return cctx;
+}
+
+size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
+{
+    if (cctx==NULL) return 0;   /* support free on NULL */
+    ZSTD_free(cctx->workSpace, cctx->customMem);
+    ZSTD_free(cctx, cctx->customMem);
+    return 0;   /* reserved as a potential error code in the future */
+}
+
+size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx)
+{
+    if (cctx==NULL) return 0;   /* support sizeof on NULL */
+    return sizeof(*cctx) + cctx->workSpaceSize;
+}
+
+size_t ZSTD_setCCtxParameter(ZSTD_CCtx* cctx, ZSTD_CCtxParameter param, unsigned value)
+{
+    switch(param)
+    {
+    case ZSTD_p_forceWindow : cctx->forceWindow = value>0; cctx->loadedDictEnd = 0; return 0;
+    case ZSTD_p_forceRawDict : cctx->forceRawDict = value>0; return 0;
+    default: return ERROR(parameter_unknown);
+    }
+}
+
+const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx)   /* hidden interface */
+{
+    return &(ctx->seqStore);
+}
+
+static ZSTD_parameters ZSTD_getParamsFromCCtx(const ZSTD_CCtx* cctx)
+{
+    return cctx->params;
+}
+
+
+/** ZSTD_checkParams() :
+    ensure param values remain within authorized range.
+    @return : 0, or an error code if one value is beyond authorized range */
+size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
+{
+#   define CLAMPCHECK(val,min,max) { if ((val<min) | (val>max)) return ERROR(compressionParameter_unsupported); }
+    CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
+    CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
+    CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
+    CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
+    CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
+    CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
+    if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2) return ERROR(compressionParameter_unsupported);
+    return 0;
+}
+
+
+/** ZSTD_cycleLog() :
+ *  condition for correct operation : hashLog > 1 */
+static U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
+{
+    U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
+    return hashLog - btScale;
+}
+
+/** ZSTD_adjustCParams() :
+    optimize `cPar` for a given input (`srcSize` and `dictSize`).
+    mostly downsizing to reduce memory consumption and initialization.
+    Both `srcSize` and `dictSize` are optional (use 0 if unknown),
+    but if both are 0, no optimization can be done.
+    Note : cPar is considered validated at this stage. Use ZSTD_checkParams() to ensure that. */
+ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
+{
+    if (srcSize+dictSize == 0) return cPar;   /* no size information available : no adjustment */
+
+    /* resize params, to use less memory when necessary */
+    {   U32 const minSrcSize = (srcSize==0) ? 500 : 0;
+        U64 const rSize = srcSize + dictSize + minSrcSize;
+        if (rSize < ((U64)1<<ZSTD_WINDOWLOG_MAX)) {
+            U32 const srcLog = MAX(ZSTD_HASHLOG_MIN, ZSTD_highbit32((U32)(rSize)-1) + 1);
+            if (cPar.windowLog > srcLog) cPar.windowLog = srcLog;
+    }   }
+    if (cPar.hashLog > cPar.windowLog) cPar.hashLog = cPar.windowLog;
+    {   U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
+        if (cycleLog > cPar.windowLog) cPar.chainLog -= (cycleLog - cPar.windowLog);
+    }
+
+    if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN) cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN;  /* required for frame header */
+
+    return cPar;
+}
+
+
+size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
+{
+    size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << cParams.windowLog);
+    U32    const divider = (cParams.searchLength==3) ? 3 : 4;
+    size_t const maxNbSeq = blockSize / divider;
+    size_t const tokenSpace = blockSize + 11*maxNbSeq;
+
+    size_t const chainSize = (cParams.strategy == ZSTD_fast) ? 0 : (1 << cParams.chainLog);
+    size_t const hSize = ((size_t)1) << cParams.hashLog;
+    U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
+    size_t const h3Size = ((size_t)1) << hashLog3;
+    size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+
+    size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
+                          + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
+    size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+                             + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+
+    return sizeof(ZSTD_CCtx) + neededSpace;
+}
+
+
+static U32 ZSTD_equivalentParams(ZSTD_parameters param1, ZSTD_parameters param2)
+{
+    return (param1.cParams.hashLog  == param2.cParams.hashLog)
+         & (param1.cParams.chainLog == param2.cParams.chainLog)
+         & (param1.cParams.strategy == param2.cParams.strategy)
+         & ((param1.cParams.searchLength==3) == (param2.cParams.searchLength==3));
+}
+
+/*! ZSTD_continueCCtx() :
+    reuse CCtx without reset (note : requires no dictionary) */
+static size_t ZSTD_continueCCtx(ZSTD_CCtx* cctx, ZSTD_parameters params, U64 frameContentSize)
+{
+    U32 const end = (U32)(cctx->nextSrc - cctx->base);
+    cctx->params = params;
+    cctx->frameContentSize = frameContentSize;
+    cctx->lowLimit = end;
+    cctx->dictLimit = end;
+    cctx->nextToUpdate = end+1;
+    cctx->stage = ZSTDcs_init;
+    cctx->dictID = 0;
+    cctx->loadedDictEnd = 0;
+    { int i; for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = repStartValue[i]; }
+    cctx->seqStore.litLengthSum = 0;  /* force reset of btopt stats */
+    XXH64_reset(&cctx->xxhState, 0);
+    return 0;
+}
+
+typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset, ZSTDcrp_fullReset } ZSTD_compResetPolicy_e;
+
+/*! ZSTD_resetCCtx_advanced() :
+    note : `params` must be validated */
+static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
+                                       ZSTD_parameters params, U64 frameContentSize,
+                                       ZSTD_compResetPolicy_e const crp)
+{
+    if (crp == ZSTDcrp_continue)
+        if (ZSTD_equivalentParams(params, zc->params)) {
+            zc->flagStaticTables = 0;
+            zc->flagStaticHufTable = HUF_repeat_none;
+            return ZSTD_continueCCtx(zc, params, frameContentSize);
+        }
+
+    {   size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << params.cParams.windowLog);
+        U32    const divider = (params.cParams.searchLength==3) ? 3 : 4;
+        size_t const maxNbSeq = blockSize / divider;
+        size_t const tokenSpace = blockSize + 11*maxNbSeq;
+        size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ? 0 : (1 << params.cParams.chainLog);
+        size_t const hSize = ((size_t)1) << params.cParams.hashLog;
+        U32    const hashLog3 = (params.cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
+        size_t const h3Size = ((size_t)1) << hashLog3;
+        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+        void* ptr;
+
+        /* Check if workSpace is large enough, alloc a new one if needed */
+        {   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
+                                  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
+            size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+                                  + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+            if (zc->workSpaceSize < neededSpace) {
+                ZSTD_free(zc->workSpace, zc->customMem);
+                zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
+                if (zc->workSpace == NULL) return ERROR(memory_allocation);
+                zc->workSpaceSize = neededSpace;
+        }   }
+
+        if (crp!=ZSTDcrp_noMemset) memset(zc->workSpace, 0, tableSpace);   /* reset tables only */
+        XXH64_reset(&zc->xxhState, 0);
+        zc->hashLog3 = hashLog3;
+        zc->hashTable = (U32*)(zc->workSpace);
+        zc->chainTable = zc->hashTable + hSize;
+        zc->hashTable3 = zc->chainTable + chainSize;
+        ptr = zc->hashTable3 + h3Size;
+        zc->hufTable = (HUF_CElt*)ptr;
+        zc->flagStaticTables = 0;
+        zc->flagStaticHufTable = HUF_repeat_none;
+        ptr = ((U32*)ptr) + 256;  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
+
+        zc->nextToUpdate = 1;
+        zc->nextSrc = NULL;
+        zc->base = NULL;
+        zc->dictBase = NULL;
+        zc->dictLimit = 0;
+        zc->lowLimit = 0;
+        zc->params = params;
+        zc->blockSize = blockSize;
+        zc->frameContentSize = frameContentSize;
+        { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = repStartValue[i]; }
+
+        if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
+            zc->seqStore.litFreq = (U32*)ptr;
+            zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1<<Litbits);
+            zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL+1);
+            zc->seqStore.offCodeFreq = zc->seqStore.matchLengthFreq + (MaxML+1);
+            ptr = zc->seqStore.offCodeFreq + (MaxOff+1);
+            zc->seqStore.matchTable = (ZSTD_match_t*)ptr;
+            ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM+1;
+            zc->seqStore.priceTable = (ZSTD_optimal_t*)ptr;
+            ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM+1;
+            zc->seqStore.litLengthSum = 0;
+        }
+        zc->seqStore.sequencesStart = (seqDef*)ptr;
+        ptr = zc->seqStore.sequencesStart + maxNbSeq;
+        zc->seqStore.llCode = (BYTE*) ptr;
+        zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
+        zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
+        zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
+
+        zc->stage = ZSTDcs_init;
+        zc->dictID = 0;
+        zc->loadedDictEnd = 0;
+
+        return 0;
+    }
+}
+
+/* ZSTD_invalidateRepCodes() :
+ * ensures next compression will not use repcodes from previous block.
+ * Note : only works with regular variant;
+ *        do not use with extDict variant ! */
+void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
+    int i;
+    for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = 0;
+}
+
+/*! ZSTD_copyCCtx() :
+*   Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
+*   Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
+*   @return : 0, or an error code */
+size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
+{
+    if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
+
+
+    memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
+    {   ZSTD_parameters params = srcCCtx->params;
+        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+        ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
+    }
+
+    /* copy tables */
+    {   size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
+        size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
+        size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
+        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+        memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
+    }
+
+    /* copy dictionary offsets */
+    dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
+    dstCCtx->nextToUpdate3= srcCCtx->nextToUpdate3;
+    dstCCtx->nextSrc      = srcCCtx->nextSrc;
+    dstCCtx->base         = srcCCtx->base;
+    dstCCtx->dictBase     = srcCCtx->dictBase;
+    dstCCtx->dictLimit    = srcCCtx->dictLimit;
+    dstCCtx->lowLimit     = srcCCtx->lowLimit;
+    dstCCtx->loadedDictEnd= srcCCtx->loadedDictEnd;
+    dstCCtx->dictID       = srcCCtx->dictID;
+
+    /* copy entropy tables */
+    dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
+    dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
+    if (srcCCtx->flagStaticTables) {
+        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
+        memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
+        memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
+    }
+    if (srcCCtx->flagStaticHufTable) {
+        memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256*4);
+    }
+
+    return 0;
+}
+
+
+/*! ZSTD_reduceTable() :
+*   reduce table indexes by `reducerValue` */
+static void ZSTD_reduceTable (U32* const table, U32 const size, U32 const reducerValue)
+{
+    U32 u;
+    for (u=0 ; u < size ; u++) {
+        if (table[u] < reducerValue) table[u] = 0;
+        else table[u] -= reducerValue;
+    }
+}
+
+/*! ZSTD_reduceIndex() :
+*   rescale all indexes to avoid future overflow (indexes are U32) */
+static void ZSTD_reduceIndex (ZSTD_CCtx* zc, const U32 reducerValue)
+{
+    { U32 const hSize = 1 << zc->params.cParams.hashLog;
+      ZSTD_reduceTable(zc->hashTable, hSize, reducerValue); }
+
+    { U32 const chainSize = (zc->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << zc->params.cParams.chainLog);
+      ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue); }
+
+    { U32 const h3Size = (zc->hashLog3) ? 1 << zc->hashLog3 : 0;
+      ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue); }
+}
+
+
+/*-*******************************************************
+*  Block entropic compression
+*********************************************************/
+
+/* See doc/zstd_compression_format.md for detailed format description */
+
+size_t ZSTD_noCompressBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    if (srcSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
+    memcpy((BYTE*)dst + ZSTD_blockHeaderSize, src, srcSize);
+    MEM_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
+    return ZSTD_blockHeaderSize+srcSize;
+}
+
+
+static size_t ZSTD_noCompressLiterals (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    BYTE* const ostart = (BYTE* const)dst;
+    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+
+    if (srcSize + flSize > dstCapacity) return ERROR(dstSize_tooSmall);
+
+    switch(flSize)
+    {
+        case 1: /* 2 - 1 - 5 */
+            ostart[0] = (BYTE)((U32)set_basic + (srcSize<<3));
+            break;
+        case 2: /* 2 - 2 - 12 */
+            MEM_writeLE16(ostart, (U16)((U32)set_basic + (1<<2) + (srcSize<<4)));
+            break;
+        default:   /*note : should not be necessary : flSize is within {1,2,3} */
+        case 3: /* 2 - 2 - 20 */
+            MEM_writeLE32(ostart, (U32)((U32)set_basic + (3<<2) + (srcSize<<4)));
+            break;
+    }
+
+    memcpy(ostart + flSize, src, srcSize);
+    return srcSize + flSize;
+}
+
+static size_t ZSTD_compressRleLiteralsBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    BYTE* const ostart = (BYTE* const)dst;
+    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+
+    (void)dstCapacity;  /* dstCapacity already guaranteed to be >=4, hence large enough */
+
+    switch(flSize)
+    {
+        case 1: /* 2 - 1 - 5 */
+            ostart[0] = (BYTE)((U32)set_rle + (srcSize<<3));
+            break;
+        case 2: /* 2 - 2 - 12 */
+            MEM_writeLE16(ostart, (U16)((U32)set_rle + (1<<2) + (srcSize<<4)));
+            break;
+        default:   /*note : should not be necessary : flSize is necessarily within {1,2,3} */
+        case 3: /* 2 - 2 - 20 */
+            MEM_writeLE32(ostart, (U32)((U32)set_rle + (3<<2) + (srcSize<<4)));
+            break;
+    }
+
+    ostart[flSize] = *(const BYTE*)src;
+    return flSize+1;
+}
+
+
+static size_t ZSTD_minGain(size_t srcSize) { return (srcSize >> 6) + 2; }
+
+static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
+                                     void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize)
+{
+    size_t const minGain = ZSTD_minGain(srcSize);
+    size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
+    BYTE*  const ostart = (BYTE*)dst;
+    U32 singleStream = srcSize < 256;
+    symbolEncodingType_e hType = set_compressed;
+    size_t cLitSize;
+
+
+    /* small ? don't even attempt compression (speed opt) */
+#   define LITERAL_NOENTROPY 63
+    {   size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
+        if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+    }
+
+    if (dstCapacity < lhSize+1) return ERROR(dstSize_tooSmall);   /* not enough space for compression */
+    {   HUF_repeat repeat = zc->flagStaticHufTable;
+        int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
+        if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
+        cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
+                                : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
+        if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
+        else { zc->flagStaticHufTable = HUF_repeat_check; }       /* now have a table to reuse */
+    }
+
+    if ((cLitSize==0) | (cLitSize >= srcSize - minGain)) {
+        zc->flagStaticHufTable = HUF_repeat_none;
+        return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+    }
+    if (cLitSize==1) {
+        zc->flagStaticHufTable = HUF_repeat_none;
+        return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
+    }
+
+    /* Build header */
+    switch(lhSize)
+    {
+    case 3: /* 2 - 2 - 10 - 10 */
+        {   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<14);
+            MEM_writeLE24(ostart, lhc);
+            break;
+        }
+    case 4: /* 2 - 2 - 14 - 14 */
+        {   U32 const lhc = hType + (2 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<18);
+            MEM_writeLE32(ostart, lhc);
+            break;
+        }
+    default:   /* should not be necessary, lhSize is only {3,4,5} */
+    case 5: /* 2 - 2 - 18 - 18 */
+        {   U32 const lhc = hType + (3 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<22);
+            MEM_writeLE32(ostart, lhc);
+            ostart[4] = (BYTE)(cLitSize >> 10);
+            break;
+        }
+    }
+    return lhSize+cLitSize;
+}
+
+static const BYTE LL_Code[64] = {  0,  1,  2,  3,  4,  5,  6,  7,
+                                   8,  9, 10, 11, 12, 13, 14, 15,
+                                  16, 16, 17, 17, 18, 18, 19, 19,
+                                  20, 20, 20, 20, 21, 21, 21, 21,
+                                  22, 22, 22, 22, 22, 22, 22, 22,
+                                  23, 23, 23, 23, 23, 23, 23, 23,
+                                  24, 24, 24, 24, 24, 24, 24, 24,
+                                  24, 24, 24, 24, 24, 24, 24, 24 };
+
+static const BYTE ML_Code[128] = { 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+                                  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+                                  32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
+                                  38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
+                                  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+                                  41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
+                                  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
+                                  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 };
+
+
+void ZSTD_seqToCodes(const seqStore_t* seqStorePtr)
+{
+    BYTE const LL_deltaCode = 19;
+    BYTE const ML_deltaCode = 36;
+    const seqDef* const sequences = seqStorePtr->sequencesStart;
+    BYTE* const llCodeTable = seqStorePtr->llCode;
+    BYTE* const ofCodeTable = seqStorePtr->ofCode;
+    BYTE* const mlCodeTable = seqStorePtr->mlCode;
+    U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    U32 u;
+    for (u=0; u<nbSeq; u++) {
+        U32 const llv = sequences[u].litLength;
+        U32 const mlv = sequences[u].matchLength;
+        llCodeTable[u] = (llv> 63) ? (BYTE)ZSTD_highbit32(llv) + LL_deltaCode : LL_Code[llv];
+        ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
+        mlCodeTable[u] = (mlv>127) ? (BYTE)ZSTD_highbit32(mlv) + ML_deltaCode : ML_Code[mlv];
+    }
+    if (seqStorePtr->longLengthID==1)
+        llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
+    if (seqStorePtr->longLengthID==2)
+        mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
+}
+
+MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
+                              void* dst, size_t dstCapacity,
+                              size_t srcSize)
+{
+    const int longOffsets = zc->params.cParams.windowLog > STREAM_ACCUMULATOR_MIN;
+    const seqStore_t* seqStorePtr = &(zc->seqStore);
+    U32 count[MaxSeq+1];
+    S16 norm[MaxSeq+1];
+    FSE_CTable* CTable_LitLength = zc->litlengthCTable;
+    FSE_CTable* CTable_OffsetBits = zc->offcodeCTable;
+    FSE_CTable* CTable_MatchLength = zc->matchlengthCTable;
+    U32 LLtype, Offtype, MLtype;   /* compressed, raw or rle */
+    const seqDef* const sequences = seqStorePtr->sequencesStart;
+    const BYTE* const ofCodeTable = seqStorePtr->ofCode;
+    const BYTE* const llCodeTable = seqStorePtr->llCode;
+    const BYTE* const mlCodeTable = seqStorePtr->mlCode;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart;
+    size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
+    BYTE* seqHead;
+    BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
+
+    /* Compress literals */
+    {   const BYTE* const literals = seqStorePtr->litStart;
+        size_t const litSize = seqStorePtr->lit - literals;
+        size_t const cSize = ZSTD_compressLiterals(zc, op, dstCapacity, literals, litSize);
+        if (ZSTD_isError(cSize)) return cSize;
+        op += cSize;
+    }
+
+    /* Sequences Header */
+    if ((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead */) return ERROR(dstSize_tooSmall);
+    if (nbSeq < 0x7F) *op++ = (BYTE)nbSeq;
+    else if (nbSeq < LONGNBSEQ) op[0] = (BYTE)((nbSeq>>8) + 0x80), op[1] = (BYTE)nbSeq, op+=2;
+    else op[0]=0xFF, MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ)), op+=3;
+    if (nbSeq==0) goto _check_compressibility;
+
+    /* seqHead : flags for FSE encoding type */
+    seqHead = op++;
+
+#define MIN_SEQ_FOR_DYNAMIC_FSE   64
+#define MAX_SEQ_FOR_STATIC_FSE  1000
+
+    /* convert length/distances into codes */
+    ZSTD_seqToCodes(seqStorePtr);
+
+    /* CTable for Literal Lengths */
+    {   U32 max = MaxLL;
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, zc->tmpCounters);
+        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+            *op++ = llCodeTable[0];
+            FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
+            LLtype = set_rle;
+        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+            LLtype = set_repeat;
+        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog-1)))) {
+            FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+            LLtype = set_basic;
+        } else {
+            size_t nbSeq_1 = nbSeq;
+            const U32 tableLog = FSE_optimalTableLog(LLFSELog, nbSeq, max);
+            if (count[llCodeTable[nbSeq-1]]>1) { count[llCodeTable[nbSeq-1]]--; nbSeq_1--; }
+            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+              if (FSE_isError(NCountSize)) return NCountSize;
+              op += NCountSize; }
+            FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+            LLtype = set_compressed;
+    }   }
+
+    /* CTable for Offsets */
+    {   U32 max = MaxOff;
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, zc->tmpCounters);
+        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+            *op++ = ofCodeTable[0];
+            FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
+            Offtype = set_rle;
+        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+            Offtype = set_repeat;
+        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog-1)))) {
+            FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+            Offtype = set_basic;
+        } else {
+            size_t nbSeq_1 = nbSeq;
+            const U32 tableLog = FSE_optimalTableLog(OffFSELog, nbSeq, max);
+            if (count[ofCodeTable[nbSeq-1]]>1) { count[ofCodeTable[nbSeq-1]]--; nbSeq_1--; }
+            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+              if (FSE_isError(NCountSize)) return NCountSize;
+              op += NCountSize; }
+            FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+            Offtype = set_compressed;
+    }   }
+
+    /* CTable for MatchLengths */
+    {   U32 max = MaxML;
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, zc->tmpCounters);
+        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+            *op++ = *mlCodeTable;
+            FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
+            MLtype = set_rle;
+        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+            MLtype = set_repeat;
+        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog-1)))) {
+            FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+            MLtype = set_basic;
+        } else {
+            size_t nbSeq_1 = nbSeq;
+            const U32 tableLog = FSE_optimalTableLog(MLFSELog, nbSeq, max);
+            if (count[mlCodeTable[nbSeq-1]]>1) { count[mlCodeTable[nbSeq-1]]--; nbSeq_1--; }
+            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+              if (FSE_isError(NCountSize)) return NCountSize;
+              op += NCountSize; }
+            FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+            MLtype = set_compressed;
+    }   }
+
+    *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
+    zc->flagStaticTables = 0;
+
+    /* Encoding Sequences */
+    {   BIT_CStream_t blockStream;
+        FSE_CState_t  stateMatchLength;
+        FSE_CState_t  stateOffsetBits;
+        FSE_CState_t  stateLitLength;
+
+        CHECK_E(BIT_initCStream(&blockStream, op, oend-op), dstSize_tooSmall); /* not enough space remaining */
+
+        /* first symbols */
+        FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq-1]);
+        FSE_initCState2(&stateOffsetBits,  CTable_OffsetBits,  ofCodeTable[nbSeq-1]);
+        FSE_initCState2(&stateLitLength,   CTable_LitLength,   llCodeTable[nbSeq-1]);
+        BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
+        if (MEM_32bits()) BIT_flushBits(&blockStream);
+        BIT_addBits(&blockStream, sequences[nbSeq-1].matchLength, ML_bits[mlCodeTable[nbSeq-1]]);
+        if (MEM_32bits()) BIT_flushBits(&blockStream);
+        if (longOffsets) {
+            U32 const ofBits = ofCodeTable[nbSeq-1];
+            int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+            if (extraBits) {
+                BIT_addBits(&blockStream, sequences[nbSeq-1].offset, extraBits);
+                BIT_flushBits(&blockStream);
+            }
+            BIT_addBits(&blockStream, sequences[nbSeq-1].offset >> extraBits,
+                        ofBits - extraBits);
+        } else {
+            BIT_addBits(&blockStream, sequences[nbSeq-1].offset, ofCodeTable[nbSeq-1]);
+        }
+        BIT_flushBits(&blockStream);
+
+        {   size_t n;
+            for (n=nbSeq-2 ; n<nbSeq ; n--) {      /* intentional underflow */
+                BYTE const llCode = llCodeTable[n];
+                BYTE const ofCode = ofCodeTable[n];
+                BYTE const mlCode = mlCodeTable[n];
+                U32  const llBits = LL_bits[llCode];
+                U32  const ofBits = ofCode;                                     /* 32b*/  /* 64b*/
+                U32  const mlBits = ML_bits[mlCode];
+                                                                                /* (7)*/  /* (7)*/
+                FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode);       /* 15 */  /* 15 */
+                FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode);      /* 24 */  /* 24 */
+                if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
+                FSE_encodeSymbol(&blockStream, &stateLitLength, llCode);        /* 16 */  /* 33 */
+                if (MEM_32bits() || (ofBits+mlBits+llBits >= 64-7-(LLFSELog+MLFSELog+OffFSELog)))
+                    BIT_flushBits(&blockStream);                                /* (7)*/
+                BIT_addBits(&blockStream, sequences[n].litLength, llBits);
+                if (MEM_32bits() && ((llBits+mlBits)>24)) BIT_flushBits(&blockStream);
+                BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
+                if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
+                if (longOffsets) {
+                    int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+                    if (extraBits) {
+                        BIT_addBits(&blockStream, sequences[n].offset, extraBits);
+                        BIT_flushBits(&blockStream);                            /* (7)*/
+                    }
+                    BIT_addBits(&blockStream, sequences[n].offset >> extraBits,
+                                ofBits - extraBits);                            /* 31 */
+                } else {
+                    BIT_addBits(&blockStream, sequences[n].offset, ofBits);     /* 31 */
+                }
+                BIT_flushBits(&blockStream);                                    /* (7)*/
+        }   }
+
+        FSE_flushCState(&blockStream, &stateMatchLength);
+        FSE_flushCState(&blockStream, &stateOffsetBits);
+        FSE_flushCState(&blockStream, &stateLitLength);
+
+        {   size_t const streamSize = BIT_closeCStream(&blockStream);
+            if (streamSize==0) return ERROR(dstSize_tooSmall);   /* not enough space */
+            op += streamSize;
+    }   }
+
+    /* check compressibility */
+_check_compressibility:
+    {   size_t const minGain = ZSTD_minGain(srcSize);
+        size_t const maxCSize = srcSize - minGain;
+        if ((size_t)(op-ostart) >= maxCSize) {
+            zc->flagStaticHufTable = HUF_repeat_none;
+            return 0;
+    }   }
+
+    /* confirm repcodes */
+    { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = zc->repToConfirm[i]; }
+
+    return op - ostart;
+}
+
+#if 0 /* for debug */
+#  define STORESEQ_DEBUG
+#include <stdio.h>   /* fprintf */
+U32 g_startDebug = 0;
+const BYTE* g_start = NULL;
+#endif
+
+/*! ZSTD_storeSeq() :
+    Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
+    `offsetCode` : distance to match, or 0 == repCode.
+    `matchCode` : matchLength - MINMATCH
+*/
+MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const void* literals, U32 offsetCode, size_t matchCode)
+{
+#ifdef STORESEQ_DEBUG
+    if (g_startDebug) {
+        const U32 pos = (U32)((const BYTE*)literals - g_start);
+        if (g_start==NULL) g_start = (const BYTE*)literals;
+        if ((pos > 1895000) && (pos < 1895300))
+            fprintf(stderr, "Cpos %6u :%5u literals & match %3u bytes at distance %6u \n",
+                   pos, (U32)litLength, (U32)matchCode+MINMATCH, (U32)offsetCode);
+    }
+#endif
+    /* copy Literals */
+    ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
+    seqStorePtr->lit += litLength;
+
+    /* literal Length */
+    if (litLength>0xFFFF) { seqStorePtr->longLengthID = 1; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+    seqStorePtr->sequences[0].litLength = (U16)litLength;
+
+    /* match offset */
+    seqStorePtr->sequences[0].offset = offsetCode + 1;
+
+    /* match Length */
+    if (matchCode>0xFFFF) { seqStorePtr->longLengthID = 2; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+    seqStorePtr->sequences[0].matchLength = (U16)matchCode;
+
+    seqStorePtr->sequences++;
+}
+
+
+/*-*************************************
+*  Match length counter
+***************************************/
+static unsigned ZSTD_NbCommonBytes (register size_t val)
+{
+    if (MEM_isLittleEndian()) {
+        if (MEM_64bits()) {
+#       if defined(_MSC_VER) && defined(_WIN64)
+            unsigned long r = 0;
+            _BitScanForward64( &r, (U64)val );
+            return (unsigned)(r>>3);
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_ctzll((U64)val) >> 3);
+#       else
+            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2, 0, 3, 1, 3, 1, 4, 2, 7, 0, 2, 3, 6, 1, 5, 3, 5, 1, 3, 4, 4, 2, 5, 6, 7, 7, 0, 1, 2, 3, 3, 4, 6, 2, 6, 5, 5, 3, 4, 5, 6, 7, 1, 2, 4, 6, 4, 4, 5, 7, 2, 6, 5, 7, 6, 7, 7 };
+            return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
+#       endif
+        } else { /* 32 bits */
+#       if defined(_MSC_VER)
+            unsigned long r=0;
+            _BitScanForward( &r, (U32)val );
+            return (unsigned)(r>>3);
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_ctz((U32)val) >> 3);
+#       else
+            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0, 3, 2, 2, 1, 3, 2, 0, 1, 3, 3, 1, 2, 2, 2, 2, 0, 3, 1, 2, 0, 1, 0, 1, 1 };
+            return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
+#       endif
+        }
+    } else {  /* Big Endian CPU */
+        if (MEM_64bits()) {
+#       if defined(_MSC_VER) && defined(_WIN64)
+            unsigned long r = 0;
+            _BitScanReverse64( &r, val );
+            return (unsigned)(r>>3);
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_clzll(val) >> 3);
+#       else
+            unsigned r;
+            const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
+            if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
+            if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
+            r += (!val);
+            return r;
+#       endif
+        } else { /* 32 bits */
+#       if defined(_MSC_VER)
+            unsigned long r = 0;
+            _BitScanReverse( &r, (unsigned long)val );
+            return (unsigned)(r>>3);
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_clz((U32)val) >> 3);
+#       else
+            unsigned r;
+            if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
+            r += (!val);
+            return r;
+#       endif
+    }   }
+}
+
+
+static size_t ZSTD_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* const pInLimit)
+{
+    const BYTE* const pStart = pIn;
+    const BYTE* const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
+
+    while (pIn < pInLoopLimit) {
+        size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
+        if (!diff) { pIn+=sizeof(size_t); pMatch+=sizeof(size_t); continue; }
+        pIn += ZSTD_NbCommonBytes(diff);
+        return (size_t)(pIn - pStart);
+    }
+    if (MEM_64bits()) if ((pIn<(pInLimit-3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) { pIn+=4; pMatch+=4; }
+    if ((pIn<(pInLimit-1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) { pIn+=2; pMatch+=2; }
+    if ((pIn<pInLimit) && (*pMatch == *pIn)) pIn++;
+    return (size_t)(pIn - pStart);
+}
+
+/** ZSTD_count_2segments() :
+*   can count match length with `ip` & `match` in 2 different segments.
+*   convention : on reaching mEnd, match count continue starting from iStart
+*/
+static size_t ZSTD_count_2segments(const BYTE* ip, const BYTE* match, const BYTE* iEnd, const BYTE* mEnd, const BYTE* iStart)
+{
+    const BYTE* const vEnd = MIN( ip + (mEnd - match), iEnd);
+    size_t const matchLength = ZSTD_count(ip, match, vEnd);
+    if (match + matchLength != mEnd) return matchLength;
+    return matchLength + ZSTD_count(ip+matchLength, iStart, iEnd);
+}
+
+
+/*-*************************************
+*  Hashes
+***************************************/
+static const U32 prime3bytes = 506832829U;
+static U32    ZSTD_hash3(U32 u, U32 h) { return ((u << (32-24)) * prime3bytes)  >> (32-h) ; }
+MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); }   /* only in zstd_opt.h */
+
+static const U32 prime4bytes = 2654435761U;
+static U32    ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32-h) ; }
+static size_t ZSTD_hash4Ptr(const void* ptr, U32 h) { return ZSTD_hash4(MEM_read32(ptr), h); }
+
+static const U64 prime5bytes = 889523592379ULL;
+static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u  << (64-40)) * prime5bytes) >> (64-h)) ; }
+static size_t ZSTD_hash5Ptr(const void* p, U32 h) { return ZSTD_hash5(MEM_readLE64(p), h); }
+
+static const U64 prime6bytes = 227718039650203ULL;
+static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u  << (64-48)) * prime6bytes) >> (64-h)) ; }
+static size_t ZSTD_hash6Ptr(const void* p, U32 h) { return ZSTD_hash6(MEM_readLE64(p), h); }
+
+static const U64 prime7bytes = 58295818150454627ULL;
+static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u  << (64-56)) * prime7bytes) >> (64-h)) ; }
+static size_t ZSTD_hash7Ptr(const void* p, U32 h) { return ZSTD_hash7(MEM_readLE64(p), h); }
+
+static const U64 prime8bytes = 0xCF1BBCDCB7A56463ULL;
+static size_t ZSTD_hash8(U64 u, U32 h) { return (size_t)(((u) * prime8bytes) >> (64-h)) ; }
+static size_t ZSTD_hash8Ptr(const void* p, U32 h) { return ZSTD_hash8(MEM_readLE64(p), h); }
+
+static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
+{
+    switch(mls)
+    {
+    //case 3: return ZSTD_hash3Ptr(p, hBits);
+    default:
+    case 4: return ZSTD_hash4Ptr(p, hBits);
+    case 5: return ZSTD_hash5Ptr(p, hBits);
+    case 6: return ZSTD_hash6Ptr(p, hBits);
+    case 7: return ZSTD_hash7Ptr(p, hBits);
+    case 8: return ZSTD_hash8Ptr(p, hBits);
+    }
+}
+
+
+/*-*************************************
+*  Fast Scan
+***************************************/
+static void ZSTD_fillHashTable (ZSTD_CCtx* zc, const void* end, const U32 mls)
+{
+    U32* const hashTable = zc->hashTable;
+    U32  const hBits = zc->params.cParams.hashLog;
+    const BYTE* const base = zc->base;
+    const BYTE* ip = base + zc->nextToUpdate;
+    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+    const size_t fastHashFillStep = 3;
+
+    while(ip <= iend) {
+        hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
+        ip += fastHashFillStep;
+    }
+}
+
+
+FORCE_INLINE
+void ZSTD_compressBlock_fast_generic(ZSTD_CCtx* cctx,
+                               const void* src, size_t srcSize,
+                               const U32 mls)
+{
+    U32* const hashTable = cctx->hashTable;
+    U32  const hBits = cctx->params.cParams.hashLog;
+    seqStore_t* seqStorePtr = &(cctx->seqStore);
+    const BYTE* const base = cctx->base;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32   lowestIndex = cctx->dictLimit;
+    const BYTE* const lowest = base + lowestIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - HASH_READ_SIZE;
+    U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
+    U32 offsetSaved = 0;
+
+    /* init */
+    ip += (ip==lowest);
+    {   U32 const maxRep = (U32)(ip-lowest);
+        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+    }
+
+    /* Main Search Loop */
+    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+        size_t mLength;
+        size_t const h = ZSTD_hashPtr(ip, hBits, mls);
+        U32 const current = (U32)(ip-base);
+        U32 const matchIndex = hashTable[h];
+        const BYTE* match = base + matchIndex;
+        hashTable[h] = current;   /* update hash table */
+
+        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
+            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+        } else {
+            U32 offset;
+            if ( (matchIndex <= lowestIndex) || (MEM_read32(match) != MEM_read32(ip)) ) {
+                ip += ((ip-anchor) >> g_searchStrength) + 1;
+                continue;
+            }
+            mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+            offset = (U32)(ip-match);
+            while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+            offset_2 = offset_1;
+            offset_1 = offset;
+
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+        }
+
+        /* match found */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;  /* here because current+2 could be > iend-8 */
+            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
+            /* check immediate repcode */
+            while ( (ip <= ilimit)
+                 && ( (offset_2>0)
+                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+                /* store sequence */
+                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; }  /* swap offset_2 <=> offset_1 */
+                hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip-base);
+                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
+                ip += rLength;
+                anchor = ip;
+                continue;   /* faster when present ... (?) */
+    }   }   }
+
+    /* save reps for next block */
+    cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
+    cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+static void ZSTD_compressBlock_fast(ZSTD_CCtx* ctx,
+                       const void* src, size_t srcSize)
+{
+    const U32 mls = ctx->params.cParams.searchLength;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
+    case 5 :
+        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5); return;
+    case 6 :
+        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6); return;
+    case 7 :
+        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7); return;
+    }
+}
+
+
+static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
+                                 const void* src, size_t srcSize,
+                                 const U32 mls)
+{
+    U32* hashTable = ctx->hashTable;
+    const U32 hBits = ctx->params.cParams.hashLog;
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const base = ctx->base;
+    const BYTE* const dictBase = ctx->dictBase;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32   lowestIndex = ctx->lowLimit;
+    const BYTE* const dictStart = dictBase + lowestIndex;
+    const U32   dictLimit = ctx->dictLimit;
+    const BYTE* const lowPrefixPtr = base + dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
+
+    /* Search Loop */
+    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+        const size_t h = ZSTD_hashPtr(ip, hBits, mls);
+        const U32 matchIndex = hashTable[h];
+        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
+        const BYTE* match = matchBase + matchIndex;
+        const U32 current = (U32)(ip-base);
+        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
+        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
+        const BYTE* repMatch = repBase + repIndex;
+        size_t mLength;
+        hashTable[h] = current;   /* update hash table */
+
+        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
+           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
+            mLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
+            ip++;
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+        } else {
+            if ( (matchIndex < lowestIndex) ||
+                 (MEM_read32(match) != MEM_read32(ip)) ) {
+                ip += ((ip-anchor) >> g_searchStrength) + 1;
+                continue;
+            }
+            {   const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
+                const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
+                U32 offset;
+                mLength = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
+                while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+                offset = current - matchIndex;
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+        }   }
+
+        /* found a match : store it */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;
+            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
+            /* check immediate repcode */
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex2 = current2 - offset_2;
+                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
+                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
+                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
+                    size_t repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
+                    hashTable[ZSTD_hashPtr(ip, hBits, mls)] = current2;
+                    ip += repLength2;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+    }   }   }
+
+    /* save reps for next block */
+    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
+                         const void* src, size_t srcSize)
+{
+    U32 const mls = ctx->params.cParams.searchLength;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
+    case 5 :
+        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5); return;
+    case 6 :
+        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6); return;
+    case 7 :
+        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7); return;
+    }
+}
+
+
+/*-*************************************
+*  Double Fast
+***************************************/
+static void ZSTD_fillDoubleHashTable (ZSTD_CCtx* cctx, const void* end, const U32 mls)
+{
+    U32* const hashLarge = cctx->hashTable;
+    U32  const hBitsL = cctx->params.cParams.hashLog;
+    U32* const hashSmall = cctx->chainTable;
+    U32  const hBitsS = cctx->params.cParams.chainLog;
+    const BYTE* const base = cctx->base;
+    const BYTE* ip = base + cctx->nextToUpdate;
+    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+    const size_t fastHashFillStep = 3;
+
+    while(ip <= iend) {
+        hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
+        hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
+        ip += fastHashFillStep;
+    }
+}
+
+
+FORCE_INLINE
+void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
+                                 const void* src, size_t srcSize,
+                                 const U32 mls)
+{
+    U32* const hashLong = cctx->hashTable;
+    const U32 hBitsL = cctx->params.cParams.hashLog;
+    U32* const hashSmall = cctx->chainTable;
+    const U32 hBitsS = cctx->params.cParams.chainLog;
+    seqStore_t* seqStorePtr = &(cctx->seqStore);
+    const BYTE* const base = cctx->base;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32 lowestIndex = cctx->dictLimit;
+    const BYTE* const lowest = base + lowestIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - HASH_READ_SIZE;
+    U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
+    U32 offsetSaved = 0;
+
+    /* init */
+    ip += (ip==lowest);
+    {   U32 const maxRep = (U32)(ip-lowest);
+        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+    }
+
+    /* Main Search Loop */
+    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+        size_t mLength;
+        size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
+        size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
+        U32 const current = (U32)(ip-base);
+        U32 const matchIndexL = hashLong[h2];
+        U32 const matchIndexS = hashSmall[h];
+        const BYTE* matchLong = base + matchIndexL;
+        const BYTE* match = base + matchIndexS;
+        hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
+
+        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) { /* note : by construction, offset_1 <= current */
+            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+        } else {
+            U32 offset;
+            if ( (matchIndexL > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip)) ) {
+                mLength = ZSTD_count(ip+8, matchLong+8, iend) + 8;
+                offset = (U32)(ip-matchLong);
+                while (((ip>anchor) & (matchLong>lowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
+            } else if ( (matchIndexS > lowestIndex) && (MEM_read32(match) == MEM_read32(ip)) ) {
+                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+                U32 const matchIndex3 = hashLong[h3];
+                const BYTE* match3 = base + matchIndex3;
+                hashLong[h3] = current + 1;
+                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
+                    mLength = ZSTD_count(ip+9, match3+8, iend) + 8;
+                    ip++;
+                    offset = (U32)(ip-match3);
+                    while (((ip>anchor) & (match3>lowest)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+                } else {
+                    mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+                    offset = (U32)(ip-match);
+                    while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+                }
+            } else {
+                ip += ((ip-anchor) >> g_searchStrength) + 1;
+                continue;
+            }
+
+            offset_2 = offset_1;
+            offset_1 = offset;
+
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+        }
+
+        /* match found */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] =
+                hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;  /* here because current+2 could be > iend-8 */
+            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] =
+                hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
+
+            /* check immediate repcode */
+            while ( (ip <= ilimit)
+                 && ( (offset_2>0)
+                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+                /* store sequence */
+                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; } /* swap offset_2 <=> offset_1 */
+                hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip-base);
+                hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip-base);
+                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
+                ip += rLength;
+                anchor = ip;
+                continue;   /* faster when present ... (?) */
+    }   }   }
+
+    /* save reps for next block */
+    cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
+    cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+static void ZSTD_compressBlock_doubleFast(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    const U32 mls = ctx->params.cParams.searchLength;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
+    case 5 :
+        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5); return;
+    case 6 :
+        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6); return;
+    case 7 :
+        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7); return;
+    }
+}
+
+
+static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx* ctx,
+                                 const void* src, size_t srcSize,
+                                 const U32 mls)
+{
+    U32* const hashLong = ctx->hashTable;
+    U32  const hBitsL = ctx->params.cParams.hashLog;
+    U32* const hashSmall = ctx->chainTable;
+    U32  const hBitsS = ctx->params.cParams.chainLog;
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const base = ctx->base;
+    const BYTE* const dictBase = ctx->dictBase;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32   lowestIndex = ctx->lowLimit;
+    const BYTE* const dictStart = dictBase + lowestIndex;
+    const U32   dictLimit = ctx->dictLimit;
+    const BYTE* const lowPrefixPtr = base + dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
+
+    /* Search Loop */
+    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+        const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
+        const U32 matchIndex = hashSmall[hSmall];
+        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
+        const BYTE* match = matchBase + matchIndex;
+
+        const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
+        const U32 matchLongIndex = hashLong[hLong];
+        const BYTE* matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
+        const BYTE* matchLong = matchLongBase + matchLongIndex;
+
+        const U32 current = (U32)(ip-base);
+        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
+        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
+        const BYTE* repMatch = repBase + repIndex;
+        size_t mLength;
+        hashSmall[hSmall] = hashLong[hLong] = current;   /* update hash table */
+
+        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
+           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
+            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+        } else {
+            if ((matchLongIndex > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip))) {
+                const BYTE* matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
+                const BYTE* lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
+                U32 offset;
+                mLength = ZSTD_count_2segments(ip+8, matchLong+8, iend, matchEnd, lowPrefixPtr) + 8;
+                offset = current - matchLongIndex;
+                while (((ip>anchor) & (matchLong>lowMatchPtr)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; }   /* catch up */
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+
+            } else if ((matchIndex > lowestIndex) && (MEM_read32(match) == MEM_read32(ip))) {
+                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+                U32 const matchIndex3 = hashLong[h3];
+                const BYTE* const match3Base = matchIndex3 < dictLimit ? dictBase : base;
+                const BYTE* match3 = match3Base + matchIndex3;
+                U32 offset;
+                hashLong[h3] = current + 1;
+                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
+                    const BYTE* matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
+                    const BYTE* lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
+                    mLength = ZSTD_count_2segments(ip+9, match3+8, iend, matchEnd, lowPrefixPtr) + 8;
+                    ip++;
+                    offset = current+1 - matchIndex3;
+                    while (((ip>anchor) & (match3>lowMatchPtr)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+                } else {
+                    const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
+                    const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
+                    mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
+                    offset = current - matchIndex;
+                    while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+                }
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+
+            } else {
+                ip += ((ip-anchor) >> g_searchStrength) + 1;
+                continue;
+        }   }
+
+        /* found a match : store it */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
+            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
+            hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
+            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
+            /* check immediate repcode */
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex2 = current2 - offset_2;
+                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
+                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
+                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
+                    hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
+                    hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
+                    ip += repLength2;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+    }   }   }
+
+    /* save reps for next block */
+    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx,
+                         const void* src, size_t srcSize)
+{
+    U32 const mls = ctx->params.cParams.searchLength;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
+    case 5 :
+        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5); return;
+    case 6 :
+        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6); return;
+    case 7 :
+        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7); return;
+    }
+}
+
+
+/*-*************************************
+*  Binary Tree search
+***************************************/
+/** ZSTD_insertBt1() : add one or multiple positions to tree.
+*   ip : assumed <= iend-8 .
+*   @return : nb of positions added */
+static U32 ZSTD_insertBt1(ZSTD_CCtx* zc, const BYTE* const ip, const U32 mls, const BYTE* const iend, U32 nbCompares,
+                          U32 extDict)
+{
+    U32*   const hashTable = zc->hashTable;
+    U32    const hashLog = zc->params.cParams.hashLog;
+    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32*   const bt = zc->chainTable;
+    U32    const btLog  = zc->params.cParams.chainLog - 1;
+    U32    const btMask = (1 << btLog) - 1;
+    U32 matchIndex = hashTable[h];
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const base = zc->base;
+    const BYTE* const dictBase = zc->dictBase;
+    const U32 dictLimit = zc->dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* match;
+    const U32 current = (U32)(ip-base);
+    const U32 btLow = btMask >= current ? 0 : current - btMask;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = smallerPtr + 1;
+    U32 dummy32;   /* to be nullified at the end */
+    U32 const windowLow = zc->lowLimit;
+    U32 matchEndIdx = current+8;
+    size_t bestLength = 8;
+#ifdef ZSTD_C_PREDICT
+    U32 predictedSmall = *(bt + 2*((current-1)&btMask) + 0);
+    U32 predictedLarge = *(bt + 2*((current-1)&btMask) + 1);
+    predictedSmall += (predictedSmall>0);
+    predictedLarge += (predictedLarge>0);
+#endif /* ZSTD_C_PREDICT */
+
+    hashTable[h] = current;   /* Update Hash Table */
+
+    while (nbCompares-- && (matchIndex > windowLow)) {
+        U32* const nextPtr = bt + 2*(matchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+
+#ifdef ZSTD_C_PREDICT   /* note : can create issues when hlog small <= 11 */
+        const U32* predictPtr = bt + 2*((matchIndex-1) & btMask);   /* written this way, as bt is a roll buffer */
+        if (matchIndex == predictedSmall) {
+            /* no need to check length, result known */
+            *smallerPtr = matchIndex;
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+            predictedSmall = predictPtr[1] + (predictPtr[1]>0);
+            continue;
+        }
+        if (matchIndex == predictedLarge) {
+            *largerPtr = matchIndex;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+            predictedLarge = predictPtr[0] + (predictPtr[0]>0);
+            continue;
+        }
+#endif
+        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+            match = base + matchIndex;
+            if (match[matchLength] == ip[matchLength])
+                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
+        } else {
+            match = dictBase + matchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+        }
+
+        if (matchLength > bestLength) {
+            bestLength = matchLength;
+            if (matchLength > matchEndIdx - matchIndex)
+                matchEndIdx = matchIndex + (U32)matchLength;
+        }
+
+        if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
+            break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
+
+        if (match[matchLength] < ip[matchLength]) {  /* necessarily within correct buffer */
+            /* match is smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+        } else {
+            /* match is larger than current */
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+    if (bestLength > 384) return MIN(192, (U32)(bestLength - 384));   /* speed optimization */
+    if (matchEndIdx > current + 8) return matchEndIdx - current - 8;
+    return 1;
+}
+
+
+static size_t ZSTD_insertBtAndFindBestMatch (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iend,
+                        size_t* offsetPtr,
+                        U32 nbCompares, const U32 mls,
+                        U32 extDict)
+{
+    U32*   const hashTable = zc->hashTable;
+    U32    const hashLog = zc->params.cParams.hashLog;
+    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32*   const bt = zc->chainTable;
+    U32    const btLog  = zc->params.cParams.chainLog - 1;
+    U32    const btMask = (1 << btLog) - 1;
+    U32 matchIndex  = hashTable[h];
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const base = zc->base;
+    const BYTE* const dictBase = zc->dictBase;
+    const U32 dictLimit = zc->dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const U32 current = (U32)(ip-base);
+    const U32 btLow = btMask >= current ? 0 : current - btMask;
+    const U32 windowLow = zc->lowLimit;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = bt + 2*(current&btMask) + 1;
+    U32 matchEndIdx = current+8;
+    U32 dummy32;   /* to be nullified at the end */
+    size_t bestLength = 0;
+
+    hashTable[h] = current;   /* Update Hash Table */
+
+    while (nbCompares-- && (matchIndex > windowLow)) {
+        U32* const nextPtr = bt + 2*(matchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        const BYTE* match;
+
+        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+            match = base + matchIndex;
+            if (match[matchLength] == ip[matchLength])
+                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
+        } else {
+            match = dictBase + matchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+        }
+
+        if (matchLength > bestLength) {
+            if (matchLength > matchEndIdx - matchIndex)
+                matchEndIdx = matchIndex + (U32)matchLength;
+            if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
+                bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
+            if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
+                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+        }
+
+        if (match[matchLength] < ip[matchLength]) {
+            /* match is smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+        } else {
+            /* match is larger than current */
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+
+    zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
+    return bestLength;
+}
+
+
+static void ZSTD_updateTree(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls)
+{
+    const BYTE* const base = zc->base;
+    const U32 target = (U32)(ip - base);
+    U32 idx = zc->nextToUpdate;
+
+    while(idx < target)
+        idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 0);
+}
+
+/** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
+static size_t ZSTD_BtFindBestMatch (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 mls)
+{
+    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
+    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
+}
+
+
+static size_t ZSTD_BtFindBestMatch_selectMLS (
+                        ZSTD_CCtx* zc,   /* Index table will be updated */
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+{
+    switch(matchLengthSearch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
+    case 5 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+    case 7 :
+    case 6 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
+    }
+}
+
+
+static void ZSTD_updateTree_extDict(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls)
+{
+    const BYTE* const base = zc->base;
+    const U32 target = (U32)(ip - base);
+    U32 idx = zc->nextToUpdate;
+
+    while (idx < target) idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 1);
+}
+
+
+/** Tree updater, providing best match */
+static size_t ZSTD_BtFindBestMatch_extDict (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 mls)
+{
+    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
+    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
+}
+
+
+static size_t ZSTD_BtFindBestMatch_selectMLS_extDict (
+                        ZSTD_CCtx* zc,   /* Index table will be updated */
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+{
+    switch(matchLengthSearch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
+    case 5 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+    case 7 :
+    case 6 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
+    }
+}
+
+
+
+/* *********************************
+*  Hash Chain
+***********************************/
+#define NEXT_IN_CHAIN(d, mask)   chainTable[(d) & mask]
+
+/* Update chains up to ip (excluded)
+   Assumption : always within prefix (i.e. not within extDict) */
+FORCE_INLINE
+U32 ZSTD_insertAndFindFirstIndex (ZSTD_CCtx* zc, const BYTE* ip, U32 mls)
+{
+    U32* const hashTable  = zc->hashTable;
+    const U32 hashLog = zc->params.cParams.hashLog;
+    U32* const chainTable = zc->chainTable;
+    const U32 chainMask = (1 << zc->params.cParams.chainLog) - 1;
+    const BYTE* const base = zc->base;
+    const U32 target = (U32)(ip - base);
+    U32 idx = zc->nextToUpdate;
+
+    while(idx < target) { /* catch up */
+        size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
+        NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
+        hashTable[h] = idx;
+        idx++;
+    }
+
+    zc->nextToUpdate = target;
+    return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
+}
+
+
+
+FORCE_INLINE /* inlining is important to hardwire a hot branch (template emulation) */
+size_t ZSTD_HcFindBestMatch_generic (
+                        ZSTD_CCtx* zc,   /* Index table will be updated */
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 mls, const U32 extDict)
+{
+    U32* const chainTable = zc->chainTable;
+    const U32 chainSize = (1 << zc->params.cParams.chainLog);
+    const U32 chainMask = chainSize-1;
+    const BYTE* const base = zc->base;
+    const BYTE* const dictBase = zc->dictBase;
+    const U32 dictLimit = zc->dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const U32 lowLimit = zc->lowLimit;
+    const U32 current = (U32)(ip-base);
+    const U32 minChain = current > chainSize ? current - chainSize : 0;
+    int nbAttempts=maxNbAttempts;
+    size_t ml=EQUAL_READ32-1;
+
+    /* HC4 match finder */
+    U32 matchIndex = ZSTD_insertAndFindFirstIndex (zc, ip, mls);
+
+    for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
+        const BYTE* match;
+        size_t currentMl=0;
+        if ((!extDict) || matchIndex >= dictLimit) {
+            match = base + matchIndex;
+            if (match[ml] == ip[ml])   /* potentially better */
+                currentMl = ZSTD_count(ip, match, iLimit);
+        } else {
+            match = dictBase + matchIndex;
+            if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
+                currentMl = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
+        }
+
+        /* save best solution */
+        if (currentMl > ml) { ml = currentMl; *offsetPtr = current - matchIndex + ZSTD_REP_MOVE; if (ip+currentMl == iLimit) break; /* best possible, and avoid read overflow*/ }
+
+        if (matchIndex <= minChain) break;
+        matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
+    }
+
+    return ml;
+}
+
+
+FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS (
+                        ZSTD_CCtx* zc,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+{
+    switch(matchLengthSearch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
+    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
+    case 7 :
+    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
+    }
+}
+
+
+FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
+                        ZSTD_CCtx* zc,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+{
+    switch(matchLengthSearch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
+    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
+    case 7 :
+    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
+    }
+}
+
+
+/* *******************************
+*  Common parser - lazy strategy
+*********************************/
+FORCE_INLINE
+void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
+                                     const void* src, size_t srcSize,
+                                     const U32 searchMethod, const U32 depth)
+{
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ctx->base + ctx->dictLimit;
+
+    U32 const maxSearches = 1 << ctx->params.cParams.searchLog;
+    U32 const mls = ctx->params.cParams.searchLength;
+
+    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
+                        size_t* offsetPtr,
+                        U32 maxNbAttempts, U32 matchLengthSearch);
+    searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
+    U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1], savedOffset=0;
+
+    /* init */
+    ip += (ip==base);
+    ctx->nextToUpdate3 = ctx->nextToUpdate;
+    {   U32 const maxRep = (U32)(ip-base);
+        if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
+    }
+
+    /* Match Loop */
+    while (ip < ilimit) {
+        size_t matchLength=0;
+        size_t offset=0;
+        const BYTE* start=ip+1;
+
+        /* check repCode */
+        if ((offset_1>0) & (MEM_read32(ip+1) == MEM_read32(ip+1 - offset_1))) {
+            /* repcode : we take it */
+            matchLength = ZSTD_count(ip+1+EQUAL_READ32, ip+1+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+            if (depth==0) goto _storeSequence;
+        }
+
+        /* first search (depth 0) */
+        {   size_t offsetFound = 99999999;
+            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
+            if (ml2 > matchLength)
+                matchLength = ml2, start = ip, offset=offsetFound;
+        }
+
+        if (matchLength < EQUAL_READ32) {
+            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
+            continue;
+        }
+
+        /* let's try to find a better solution */
+        if (depth>=1)
+        while (ip<ilimit) {
+            ip ++;
+            if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+                size_t const mlRep = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+                int const gain2 = (int)(mlRep * 3);
+                int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+                if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
+                    matchLength = mlRep, offset = 0, start = ip;
+            }
+            {   size_t offset2=99999999;
+                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                    matchLength = ml2, offset = offset2, start = ip;
+                    continue;   /* search a better one */
+            }   }
+
+            /* let's find an even better one */
+            if ((depth==2) && (ip<ilimit)) {
+                ip ++;
+                if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+                    size_t const ml2 = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+                    int const gain2 = (int)(ml2 * 4);
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
+                        matchLength = ml2, offset = 0, start = ip;
+                }
+                {   size_t offset2=99999999;
+                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                        matchLength = ml2, offset = offset2, start = ip;
+                        continue;
+            }   }   }
+            break;  /* nothing found : store previous solution */
+        }
+
+        /* catch up */
+        if (offset) {
+            while ((start>anchor) && (start>base+offset-ZSTD_REP_MOVE) && (start[-1] == start[-1-offset+ZSTD_REP_MOVE]))   /* only search for offset within prefix */
+                { start--; matchLength++; }
+            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+        }
+
+        /* store sequence */
+_storeSequence:
+        {   size_t const litLength = start - anchor;
+            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
+            anchor = ip = start + matchLength;
+        }
+
+        /* check immediate repcode */
+        while ( (ip <= ilimit)
+             && ((offset_2>0)
+             & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+            /* store sequence */
+            matchLength = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_2, iend) + EQUAL_READ32;
+            offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
+            ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
+            ip += matchLength;
+            anchor = ip;
+            continue;   /* faster when present ... (?) */
+    }   }
+
+    /* Save reps for next block */
+    ctx->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
+    ctx->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+static void ZSTD_compressBlock_btlazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2);
+}
+
+static void ZSTD_compressBlock_lazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2);
+}
+
+static void ZSTD_compressBlock_lazy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1);
+}
+
+static void ZSTD_compressBlock_greedy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0);
+}
+
+
+FORCE_INLINE
+void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
+                                     const void* src, size_t srcSize,
+                                     const U32 searchMethod, const U32 depth)
+{
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ctx->base;
+    const U32 dictLimit = ctx->dictLimit;
+    const U32 lowestIndex = ctx->lowLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* const dictBase = ctx->dictBase;
+    const BYTE* const dictEnd  = dictBase + dictLimit;
+    const BYTE* const dictStart  = dictBase + ctx->lowLimit;
+
+    const U32 maxSearches = 1 << ctx->params.cParams.searchLog;
+    const U32 mls = ctx->params.cParams.searchLength;
+
+    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
+                        size_t* offsetPtr,
+                        U32 maxNbAttempts, U32 matchLengthSearch);
+    searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
+
+    U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
+
+    /* init */
+    ctx->nextToUpdate3 = ctx->nextToUpdate;
+    ip += (ip == prefixStart);
+
+    /* Match Loop */
+    while (ip < ilimit) {
+        size_t matchLength=0;
+        size_t offset=0;
+        const BYTE* start=ip+1;
+        U32 current = (U32)(ip-base);
+
+        /* check repCode */
+        {   const U32 repIndex = (U32)(current+1 - offset_1);
+            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+            const BYTE* const repMatch = repBase + repIndex;
+            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))   /* intentional overflow */
+            if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
+                /* repcode detected we should take it */
+                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                matchLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                if (depth==0) goto _storeSequence;
+        }   }
+
+        /* first search (depth 0) */
+        {   size_t offsetFound = 99999999;
+            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
+            if (ml2 > matchLength)
+                matchLength = ml2, start = ip, offset=offsetFound;
+        }
+
+         if (matchLength < EQUAL_READ32) {
+            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
+            continue;
+        }
+
+        /* let's try to find a better solution */
+        if (depth>=1)
+        while (ip<ilimit) {
+            ip ++;
+            current++;
+            /* check repCode */
+            if (offset) {
+                const U32 repIndex = (U32)(current - offset_1);
+                const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                const BYTE* const repMatch = repBase + repIndex;
+                if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+                if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                    /* repcode detected */
+                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                    size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                    int const gain2 = (int)(repLength * 3);
+                    int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+                    if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+                        matchLength = repLength, offset = 0, start = ip;
+            }   }
+
+            /* search match, depth 1 */
+            {   size_t offset2=99999999;
+                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                    matchLength = ml2, offset = offset2, start = ip;
+                    continue;   /* search a better one */
+            }   }
+
+            /* let's find an even better one */
+            if ((depth==2) && (ip<ilimit)) {
+                ip ++;
+                current++;
+                /* check repCode */
+                if (offset) {
+                    const U32 repIndex = (U32)(current - offset_1);
+                    const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                    const BYTE* const repMatch = repBase + repIndex;
+                    if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+                    if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                        /* repcode detected */
+                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                        size_t repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                        int gain2 = (int)(repLength * 4);
+                        int gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                        if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+                            matchLength = repLength, offset = 0, start = ip;
+                }   }
+
+                /* search match, depth 2 */
+                {   size_t offset2=99999999;
+                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                        matchLength = ml2, offset = offset2, start = ip;
+                        continue;
+            }   }   }
+            break;  /* nothing found : store previous solution */
+        }
+
+        /* catch up */
+        if (offset) {
+            U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
+            const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
+            const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
+            while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
+            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+        }
+
+        /* store sequence */
+_storeSequence:
+        {   size_t const litLength = start - anchor;
+            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
+            anchor = ip = start + matchLength;
+        }
+
+        /* check immediate repcode */
+        while (ip <= ilimit) {
+            const U32 repIndex = (U32)((ip-base) - offset_2);
+            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+            const BYTE* const repMatch = repBase + repIndex;
+            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+            if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                /* repcode detected we should take it */
+                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                matchLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
+                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
+                ip += matchLength;
+                anchor = ip;
+                continue;   /* faster when present ... (?) */
+            }
+            break;
+    }   }
+
+    /* Save reps for next block */
+    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+void ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0);
+}
+
+static void ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
+}
+
+static void ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
+}
+
+static void ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
+}
+
+
+/* The optimal parser */
+#include "zstd_opt.h"
+
+static void ZSTD_compressBlock_btopt(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+#ifdef ZSTD_OPT_H_91842398743
+    ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0);
+#else
+    (void)ctx; (void)src; (void)srcSize;
+    return;
+#endif
+}
+
+static void ZSTD_compressBlock_btopt2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+#ifdef ZSTD_OPT_H_91842398743
+    ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 1);
+#else
+    (void)ctx; (void)src; (void)srcSize;
+    return;
+#endif
+}
+
+static void ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+#ifdef ZSTD_OPT_H_91842398743
+    ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 0);
+#else
+    (void)ctx; (void)src; (void)srcSize;
+    return;
+#endif
+}
+
+static void ZSTD_compressBlock_btopt2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
+{
+#ifdef ZSTD_OPT_H_91842398743
+    ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 1);
+#else
+    (void)ctx; (void)src; (void)srcSize;
+    return;
+#endif
+}
+
+
+typedef void (*ZSTD_blockCompressor) (ZSTD_CCtx* ctx, const void* src, size_t srcSize);
+
+static ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
+{
+    static const ZSTD_blockCompressor blockCompressor[2][8] = {
+        { ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2 },
+        { ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict }
+    };
+
+    return blockCompressor[extDict][(U32)strat];
+}
+
+
+static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
+    const BYTE* const base = zc->base;
+    const BYTE* const istart = (const BYTE*)src;
+    const U32 current = (U32)(istart-base);
+    if (srcSize < MIN_CBLOCK_SIZE+ZSTD_blockHeaderSize+1) return 0;   /* don't even attempt compression below a certain srcSize */
+    ZSTD_resetSeqStore(&(zc->seqStore));
+    if (current > zc->nextToUpdate + 384)
+        zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));   /* update tree not updated after finding very long rep matches */
+    blockCompressor(zc, src, srcSize);
+    return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
+}
+
+
+/*! ZSTD_compress_generic() :
+*   Compress a chunk of data into one or multiple blocks.
+*   All blocks will be terminated, all input will be consumed.
+*   Function will issue an error if there is not enough `dstCapacity` to hold the compressed content.
+*   Frame is supposed already started (header already produced)
+*   @return : compressed size, or an error code
+*/
+static size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
+                                     void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                                     U32 lastFrameChunk)
+{
+    size_t blockSize = cctx->blockSize;
+    size_t remaining = srcSize;
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* op = ostart;
+    U32 const maxDist = 1 << cctx->params.cParams.windowLog;
+
+    if (cctx->params.fParams.checksumFlag && srcSize)
+        XXH64_update(&cctx->xxhState, src, srcSize);
+
+    while (remaining) {
+        U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
+        size_t cSize;
+
+        if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE) return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
+        if (remaining < blockSize) blockSize = remaining;
+
+        /* preemptive overflow correction */
+        if (cctx->lowLimit > (3U<<29)) {
+            U32 const cycleMask = (1 << ZSTD_cycleLog(cctx->params.cParams.hashLog, cctx->params.cParams.strategy)) - 1;
+            U32 const current = (U32)(ip - cctx->base);
+            U32 const newCurrent = (current & cycleMask) + (1 << cctx->params.cParams.windowLog);
+            U32 const correction = current - newCurrent;
+            ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_64 <= 30);
+            ZSTD_reduceIndex(cctx, correction);
+            cctx->base += correction;
+            cctx->dictBase += correction;
+            cctx->lowLimit -= correction;
+            cctx->dictLimit -= correction;
+            if (cctx->nextToUpdate < correction) cctx->nextToUpdate = 0;
+            else cctx->nextToUpdate -= correction;
+        }
+
+        if ((U32)(ip+blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
+            /* enforce maxDist */
+            U32 const newLowLimit = (U32)(ip+blockSize - cctx->base) - maxDist;
+            if (cctx->lowLimit < newLowLimit) cctx->lowLimit = newLowLimit;
+            if (cctx->dictLimit < cctx->lowLimit) cctx->dictLimit = cctx->lowLimit;
+        }
+
+        cSize = ZSTD_compressBlock_internal(cctx, op+ZSTD_blockHeaderSize, dstCapacity-ZSTD_blockHeaderSize, ip, blockSize);
+        if (ZSTD_isError(cSize)) return cSize;
+
+        if (cSize == 0) {  /* block is not compressible */
+            U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw)<<1) + (U32)(blockSize << 3);
+            if (blockSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
+            MEM_writeLE32(op, cBlockHeader24);   /* no pb, 4th byte will be overwritten */
+            memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
+            cSize = ZSTD_blockHeaderSize+blockSize;
+        } else {
+            U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
+            MEM_writeLE24(op, cBlockHeader24);
+            cSize += ZSTD_blockHeaderSize;
+        }
+
+        remaining -= blockSize;
+        dstCapacity -= cSize;
+        ip += blockSize;
+        op += cSize;
+    }
+
+    if (lastFrameChunk && (op>ostart)) cctx->stage = ZSTDcs_ending;
+    return op-ostart;
+}
+
+
+static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
+                                    ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
+{   BYTE* const op = (BYTE*)dst;
+    U32   const dictIDSizeCode = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
+    U32   const checksumFlag = params.fParams.checksumFlag>0;
+    U32   const windowSize = 1U << params.cParams.windowLog;
+    U32   const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
+    BYTE  const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
+    U32   const fcsCode = params.fParams.contentSizeFlag ?
+                     (pledgedSrcSize>=256) + (pledgedSrcSize>=65536+256) + (pledgedSrcSize>=0xFFFFFFFFU) :   /* 0-3 */
+                      0;
+    BYTE  const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag<<2) + (singleSegment<<5) + (fcsCode<<6) );
+    size_t pos;
+
+    if (dstCapacity < ZSTD_frameHeaderSize_max) return ERROR(dstSize_tooSmall);
+
+    MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
+    op[4] = frameHeaderDecriptionByte; pos=5;
+    if (!singleSegment) op[pos++] = windowLogByte;
+    switch(dictIDSizeCode)
+    {
+        default:   /* impossible */
+        case 0 : break;
+        case 1 : op[pos] = (BYTE)(dictID); pos++; break;
+        case 2 : MEM_writeLE16(op+pos, (U16)dictID); pos+=2; break;
+        case 3 : MEM_writeLE32(op+pos, dictID); pos+=4; break;
+    }
+    switch(fcsCode)
+    {
+        default:   /* impossible */
+        case 0 : if (singleSegment) op[pos++] = (BYTE)(pledgedSrcSize); break;
+        case 1 : MEM_writeLE16(op+pos, (U16)(pledgedSrcSize-256)); pos+=2; break;
+        case 2 : MEM_writeLE32(op+pos, (U32)(pledgedSrcSize)); pos+=4; break;
+        case 3 : MEM_writeLE64(op+pos, (U64)(pledgedSrcSize)); pos+=8; break;
+    }
+    return pos;
+}
+
+
+static size_t ZSTD_compressContinue_internal (ZSTD_CCtx* cctx,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize,
+                               U32 frame, U32 lastFrameChunk)
+{
+    const BYTE* const ip = (const BYTE*) src;
+    size_t fhSize = 0;
+
+    if (cctx->stage==ZSTDcs_created) return ERROR(stage_wrong);   /* missing init (ZSTD_compressBegin) */
+
+    if (frame && (cctx->stage==ZSTDcs_init)) {
+        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, cctx->frameContentSize, cctx->dictID);
+        if (ZSTD_isError(fhSize)) return fhSize;
+        dstCapacity -= fhSize;
+        dst = (char*)dst + fhSize;
+        cctx->stage = ZSTDcs_ongoing;
+    }
+
+    /* Check if blocks follow each other */
+    if (src != cctx->nextSrc) {
+        /* not contiguous */
+        ptrdiff_t const delta = cctx->nextSrc - ip;
+        cctx->lowLimit = cctx->dictLimit;
+        cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
+        cctx->dictBase = cctx->base;
+        cctx->base -= delta;
+        cctx->nextToUpdate = cctx->dictLimit;
+        if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE) cctx->lowLimit = cctx->dictLimit;   /* too small extDict */
+    }
+
+    /* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
+    if ((ip+srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
+        ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
+        U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
+        cctx->lowLimit = lowLimitMax;
+    }
+
+    cctx->nextSrc = ip + srcSize;
+
+    if (srcSize) {
+        size_t const cSize = frame ?
+                             ZSTD_compress_generic (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
+                             ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize);
+        if (ZSTD_isError(cSize)) return cSize;
+        return cSize + fhSize;
+    } else
+        return fhSize;
+}
+
+
+size_t ZSTD_compressContinue (ZSTD_CCtx* cctx,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize)
+{
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
+}
+
+
+size_t ZSTD_getBlockSizeMax(ZSTD_CCtx* cctx)
+{
+    return MIN (ZSTD_BLOCKSIZE_ABSOLUTEMAX, 1 << cctx->params.cParams.windowLog);
+}
+
+size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
+    if (srcSize > blockSizeMax) return ERROR(srcSize_wrong);
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
+}
+
+/*! ZSTD_loadDictionaryContent() :
+ *  @return : 0, or an error code
+ */
+static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t srcSize)
+{
+    const BYTE* const ip = (const BYTE*) src;
+    const BYTE* const iend = ip + srcSize;
+
+    /* input becomes current prefix */
+    zc->lowLimit = zc->dictLimit;
+    zc->dictLimit = (U32)(zc->nextSrc - zc->base);
+    zc->dictBase = zc->base;
+    zc->base += ip - zc->nextSrc;
+    zc->nextToUpdate = zc->dictLimit;
+    zc->loadedDictEnd = zc->forceWindow ? 0 : (U32)(iend - zc->base);
+
+    zc->nextSrc = iend;
+    if (srcSize <= HASH_READ_SIZE) return 0;
+
+    switch(zc->params.cParams.strategy)
+    {
+    case ZSTD_fast:
+        ZSTD_fillHashTable (zc, iend, zc->params.cParams.searchLength);
+        break;
+
+    case ZSTD_dfast:
+        ZSTD_fillDoubleHashTable (zc, iend, zc->params.cParams.searchLength);
+        break;
+
+    case ZSTD_greedy:
+    case ZSTD_lazy:
+    case ZSTD_lazy2:
+        if (srcSize >= HASH_READ_SIZE)
+            ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->params.cParams.searchLength);
+        break;
+
+    case ZSTD_btlazy2:
+    case ZSTD_btopt:
+    case ZSTD_btopt2:
+        if (srcSize >= HASH_READ_SIZE)
+            ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
+        break;
+
+    default:
+        return ERROR(GENERIC);   /* strategy doesn't exist; impossible */
+    }
+
+    zc->nextToUpdate = (U32)(iend - zc->base);
+    return 0;
+}
+
+
+/* Dictionaries that assign zero probability to symbols that show up causes problems
+   when FSE encoding.  Refuse dictionaries that assign zero probability to symbols
+   that we may encounter during compression.
+   NOTE: This behavior is not standard and could be improved in the future. */
+static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue) {
+    U32 s;
+    if (dictMaxSymbolValue < maxSymbolValue) return ERROR(dictionary_corrupted);
+    for (s = 0; s <= maxSymbolValue; ++s) {
+        if (normalizedCounter[s] == 0) return ERROR(dictionary_corrupted);
+    }
+    return 0;
+}
+
+
+/* Dictionary format :
+ * See :
+ * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
+ */
+/*! ZSTD_loadZstdDictionary() :
+ * @return : 0, or an error code
+ *  assumptions : magic number supposed already checked
+ *                dictSize supposed > 8
+ */
+static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+{
+    const BYTE* dictPtr = (const BYTE*)dict;
+    const BYTE* const dictEnd = dictPtr + dictSize;
+    short offcodeNCount[MaxOff+1];
+    unsigned offcodeMaxValue = MaxOff;
+    BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
+
+    dictPtr += 4;   /* skip magic number */
+    cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
+    dictPtr += 4;
+
+    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dictPtr, dictEnd-dictPtr);
+        if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
+        dictPtr += hufHeaderSize;
+    }
+
+    {   unsigned offcodeLog;
+        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
+        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
+        /* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
+        CHECK_E (FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        dictPtr += offcodeHeaderSize;
+    }
+
+    {   short matchlengthNCount[MaxML+1];
+        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
+        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
+        /* Every match length code must have non-zero probability */
+        CHECK_F (ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
+        CHECK_E (FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        dictPtr += matchlengthHeaderSize;
+    }
+
+    {   short litlengthNCount[MaxLL+1];
+        unsigned litlengthMaxValue = MaxLL, litlengthLog;
+        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
+        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
+        /* Every literal length code must have non-zero probability */
+        CHECK_F (ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
+        CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        dictPtr += litlengthHeaderSize;
+    }
+
+    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
+    cctx->rep[0] = MEM_readLE32(dictPtr+0);
+    cctx->rep[1] = MEM_readLE32(dictPtr+4);
+    cctx->rep[2] = MEM_readLE32(dictPtr+8);
+    dictPtr += 12;
+
+    {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
+        U32 offcodeMax = MaxOff;
+        if (dictContentSize <= ((U32)-1) - 128 KB) {
+            U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
+            offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
+        }
+        /* All offset values <= dictContentSize + 128 KB must be representable */
+        CHECK_F (ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
+        /* All repCodes must be <= dictContentSize and != 0*/
+        {   U32 u;
+            for (u=0; u<3; u++) {
+                if (cctx->rep[u] == 0) return ERROR(dictionary_corrupted);
+                if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
+        }   }
+
+        cctx->flagStaticTables = 1;
+        cctx->flagStaticHufTable = HUF_repeat_valid;
+        return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
+    }
+}
+
+/** ZSTD_compress_insertDictionary() :
+*   @return : 0, or an error code */
+static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+{
+    if ((dict==NULL) || (dictSize<=8)) return 0;
+
+    /* dict as pure content */
+    if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
+        return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
+
+    /* dict as zstd dictionary */
+    return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
+}
+
+/*! ZSTD_compressBegin_internal() :
+*   @return : 0, or an error code */
+static size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
+                             const void* dict, size_t dictSize,
+                                   ZSTD_parameters params, U64 pledgedSrcSize)
+{
+    ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
+    CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
+    return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
+}
+
+
+/*! ZSTD_compressBegin_advanced() :
+*   @return : 0, or an error code */
+size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx,
+                             const void* dict, size_t dictSize,
+                                   ZSTD_parameters params, unsigned long long pledgedSrcSize)
+{
+    /* compression parameters verification and optimization */
+    CHECK_F(ZSTD_checkCParams(params.cParams));
+    return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, pledgedSrcSize);
+}
+
+
+size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
+    return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, 0);
+}
+
+
+size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel)
+{
+    return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel);
+}
+
+
+/*! ZSTD_writeEpilogue() :
+*   Ends a frame.
+*   @return : nb of bytes written into dst (or an error code) */
+static size_t ZSTD_writeEpilogue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity)
+{
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* op = ostart;
+    size_t fhSize = 0;
+
+    if (cctx->stage == ZSTDcs_created) return ERROR(stage_wrong);  /* init missing */
+
+    /* special case : empty frame */
+    if (cctx->stage == ZSTDcs_init) {
+        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, 0, 0);
+        if (ZSTD_isError(fhSize)) return fhSize;
+        dstCapacity -= fhSize;
+        op += fhSize;
+        cctx->stage = ZSTDcs_ongoing;
+    }
+
+    if (cctx->stage != ZSTDcs_ending) {
+        /* write one last empty block, make it the "last" block */
+        U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw)<<1) + 0;
+        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
+        MEM_writeLE32(op, cBlockHeader24);
+        op += ZSTD_blockHeaderSize;
+        dstCapacity -= ZSTD_blockHeaderSize;
+    }
+
+    if (cctx->params.fParams.checksumFlag) {
+        U32 const checksum = (U32) XXH64_digest(&cctx->xxhState);
+        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
+        MEM_writeLE32(op, checksum);
+        op += 4;
+    }
+
+    cctx->stage = ZSTDcs_created;  /* return to "created but no init" status */
+    return op-ostart;
+}
+
+
+size_t ZSTD_compressEnd (ZSTD_CCtx* cctx,
+                         void* dst, size_t dstCapacity,
+                   const void* src, size_t srcSize)
+{
+    size_t endResult;
+    size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
+    if (ZSTD_isError(cSize)) return cSize;
+    endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
+    if (ZSTD_isError(endResult)) return endResult;
+    return cSize + endResult;
+}
+
+
+static size_t ZSTD_compress_internal (ZSTD_CCtx* cctx,
+                               void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize,
+                         const void* dict,size_t dictSize,
+                               ZSTD_parameters params)
+{
+    CHECK_F(ZSTD_compressBegin_internal(cctx, dict, dictSize, params, srcSize));
+    return ZSTD_compressEnd(cctx, dst,  dstCapacity, src, srcSize);
+}
+
+size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
+                               void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize,
+                         const void* dict,size_t dictSize,
+                               ZSTD_parameters params)
+{
+    CHECK_F(ZSTD_checkCParams(params.cParams));
+    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
+}
+
+size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, dict ? dictSize : 0);
+    params.fParams.contentSizeFlag = 1;
+    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
+}
+
+size_t ZSTD_compressCCtx (ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
+{
+    return ZSTD_compress_usingDict(ctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
+}
+
+size_t ZSTD_compress(void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
+{
+    size_t result;
+    ZSTD_CCtx ctxBody;
+    memset(&ctxBody, 0, sizeof(ctxBody));
+    memcpy(&ctxBody.customMem, &defaultCustomMem, sizeof(ZSTD_customMem));
+    result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
+    ZSTD_free(ctxBody.workSpace, defaultCustomMem);  /* can't free ctxBody itself, as it's on stack; free only heap content */
+    return result;
+}
+
+
+/* =====  Dictionary API  ===== */
+
+struct ZSTD_CDict_s {
+    void* dictBuffer;
+    const void* dictContent;
+    size_t dictContentSize;
+    ZSTD_CCtx* refContext;
+};  /* typedef'd tp ZSTD_CDict within "zstd.h" */
+
+size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
+{
+    if (cdict==NULL) return 0;   /* support sizeof on NULL */
+    return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
+}
+
+ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
+                                      ZSTD_parameters params, ZSTD_customMem customMem)
+{
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    {   ZSTD_CDict* const cdict = (ZSTD_CDict*) ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
+        ZSTD_CCtx* const cctx = ZSTD_createCCtx_advanced(customMem);
+
+        if (!cdict || !cctx) {
+            ZSTD_free(cdict, customMem);
+            ZSTD_freeCCtx(cctx);
+            return NULL;
+        }
+
+        if ((byReference) || (!dictBuffer) || (!dictSize)) {
+            cdict->dictBuffer = NULL;
+            cdict->dictContent = dictBuffer;
+        } else {
+            void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
+            if (!internalBuffer) { ZSTD_free(cctx, customMem); ZSTD_free(cdict, customMem); return NULL; }
+            memcpy(internalBuffer, dictBuffer, dictSize);
+            cdict->dictBuffer = internalBuffer;
+            cdict->dictContent = internalBuffer;
+        }
+
+        {   size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
+            if (ZSTD_isError(errorCode)) {
+                ZSTD_free(cdict->dictBuffer, customMem);
+                ZSTD_free(cdict, customMem);
+                ZSTD_freeCCtx(cctx);
+                return NULL;
+        }   }
+
+        cdict->refContext = cctx;
+        cdict->dictContentSize = dictSize;
+        return cdict;
+    }
+}
+
+ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
+    params.fParams.contentSizeFlag = 1;
+    return ZSTD_createCDict_advanced(dict, dictSize, 0, params, allocator);
+}
+
+ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
+    params.fParams.contentSizeFlag = 1;
+    return ZSTD_createCDict_advanced(dict, dictSize, 1, params, allocator);
+}
+
+size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
+{
+    if (cdict==NULL) return 0;   /* support free on NULL */
+    {   ZSTD_customMem const cMem = cdict->refContext->customMem;
+        ZSTD_freeCCtx(cdict->refContext);
+        ZSTD_free(cdict->dictBuffer, cMem);
+        ZSTD_free(cdict, cMem);
+        return 0;
+    }
+}
+
+static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict* cdict) {
+    return ZSTD_getParamsFromCCtx(cdict->refContext);
+}
+
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
+{
+    if (cdict->dictContentSize) CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
+    else {
+        ZSTD_parameters params = cdict->refContext->params;
+        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+        CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
+    }
+    return 0;
+}
+
+/*! ZSTD_compress_usingCDict() :
+*   Compression using a digested Dictionary.
+*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+*   Note that compression level is decided during dictionary creation */
+size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
+                                void* dst, size_t dstCapacity,
+                                const void* src, size_t srcSize,
+                                const ZSTD_CDict* cdict)
+{
+    CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
+
+    if (cdict->refContext->params.fParams.contentSizeFlag==1) {
+        cctx->params.fParams.contentSizeFlag = 1;
+        cctx->frameContentSize = srcSize;
+    }
+
+    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+}
+
+
+
+/* ******************************************************************
+*  Streaming
+********************************************************************/
+
+typedef enum { zcss_init, zcss_load, zcss_flush, zcss_final } ZSTD_cStreamStage;
+
+struct ZSTD_CStream_s {
+    ZSTD_CCtx* cctx;
+    ZSTD_CDict* cdictLocal;
+    const ZSTD_CDict* cdict;
+    char*  inBuff;
+    size_t inBuffSize;
+    size_t inToCompress;
+    size_t inBuffPos;
+    size_t inBuffTarget;
+    size_t blockSize;
+    char*  outBuff;
+    size_t outBuffSize;
+    size_t outBuffContentSize;
+    size_t outBuffFlushedSize;
+    ZSTD_cStreamStage stage;
+    U32    checksum;
+    U32    frameEnded;
+    U64    pledgedSrcSize;
+    U64    inputProcessed;
+    ZSTD_parameters params;
+    ZSTD_customMem customMem;
+};   /* typedef'd to ZSTD_CStream within "zstd.h" */
+
+ZSTD_CStream* ZSTD_createCStream(void)
+{
+    return ZSTD_createCStream_advanced(defaultCustomMem);
+}
+
+ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
+{
+    ZSTD_CStream* zcs;
+
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    zcs = (ZSTD_CStream*)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
+    if (zcs==NULL) return NULL;
+    memset(zcs, 0, sizeof(ZSTD_CStream));
+    memcpy(&zcs->customMem, &customMem, sizeof(ZSTD_customMem));
+    zcs->cctx = ZSTD_createCCtx_advanced(customMem);
+    if (zcs->cctx == NULL) { ZSTD_freeCStream(zcs); return NULL; }
+    return zcs;
+}
+
+size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
+{
+    if (zcs==NULL) return 0;   /* support free on NULL */
+    {   ZSTD_customMem const cMem = zcs->customMem;
+        ZSTD_freeCCtx(zcs->cctx);
+        zcs->cctx = NULL;
+        ZSTD_freeCDict(zcs->cdictLocal);
+        zcs->cdictLocal = NULL;
+        ZSTD_free(zcs->inBuff, cMem);
+        zcs->inBuff = NULL;
+        ZSTD_free(zcs->outBuff, cMem);
+        zcs->outBuff = NULL;
+        ZSTD_free(zcs, cMem);
+        return 0;
+    }
+}
+
+
+/*======   Initialization   ======*/
+
+size_t ZSTD_CStreamInSize(void)  { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
+size_t ZSTD_CStreamOutSize(void) { return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSOLUTEMAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */ ; }
+
+static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
+{
+    if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
+
+    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
+    else CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
+
+    zcs->inToCompress = 0;
+    zcs->inBuffPos = 0;
+    zcs->inBuffTarget = zcs->blockSize;
+    zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
+    zcs->stage = zcss_load;
+    zcs->frameEnded = 0;
+    zcs->pledgedSrcSize = pledgedSrcSize;
+    zcs->inputProcessed = 0;
+    return 0;   /* ready to go */
+}
+
+size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
+{
+
+    zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+
+    return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
+}
+
+size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
+                                 const void* dict, size_t dictSize,
+                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
+{
+    /* allocate buffers */
+    {   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
+        if (zcs->inBuffSize < neededInBuffSize) {
+            zcs->inBuffSize = neededInBuffSize;
+            ZSTD_free(zcs->inBuff, zcs->customMem);
+            zcs->inBuff = (char*) ZSTD_malloc(neededInBuffSize, zcs->customMem);
+            if (zcs->inBuff == NULL) return ERROR(memory_allocation);
+        }
+        zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
+    }
+    if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize)+1) {
+        zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize)+1;
+        ZSTD_free(zcs->outBuff, zcs->customMem);
+        zcs->outBuff = (char*) ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
+        if (zcs->outBuff == NULL) return ERROR(memory_allocation);
+    }
+
+    if (dict && dictSize >= 8) {
+        ZSTD_freeCDict(zcs->cdictLocal);
+        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
+        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
+        zcs->cdict = zcs->cdictLocal;
+    } else zcs->cdict = NULL;
+
+    zcs->checksum = params.fParams.checksumFlag > 0;
+    zcs->params = params;
+
+    return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
+}
+
+/* note : cdict must outlive compression session */
+size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+{
+    ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
+    size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
+    zcs->cdict = cdict;
+    zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
+    return initError;
+}
+
+size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
+    return ZSTD_initCStream_advanced(zcs, dict, dictSize, params, 0);
+}
+
+size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize)
+{
+    ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
+    if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
+    return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
+}
+
+size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
+{
+    return ZSTD_initCStream_usingDict(zcs, NULL, 0, compressionLevel);
+}
+
+size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)
+{
+    if (zcs==NULL) return 0;   /* support sizeof on NULL */
+    return sizeof(*zcs) + ZSTD_sizeof_CCtx(zcs->cctx) + ZSTD_sizeof_CDict(zcs->cdictLocal) + zcs->outBuffSize + zcs->inBuffSize;
+}
+
+/*======   Compression   ======*/
+
+typedef enum { zsf_gather, zsf_flush, zsf_end } ZSTD_flush_e;
+
+MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    size_t const length = MIN(dstCapacity, srcSize);
+    memcpy(dst, src, length);
+    return length;
+}
+
+static size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
+                              void* dst, size_t* dstCapacityPtr,
+                        const void* src, size_t* srcSizePtr,
+                              ZSTD_flush_e const flush)
+{
+    U32 someMoreWork = 1;
+    const char* const istart = (const char*)src;
+    const char* const iend = istart + *srcSizePtr;
+    const char* ip = istart;
+    char* const ostart = (char*)dst;
+    char* const oend = ostart + *dstCapacityPtr;
+    char* op = ostart;
+
+    while (someMoreWork) {
+        switch(zcs->stage)
+        {
+        case zcss_init: return ERROR(init_missing);   /* call ZBUFF_compressInit() first ! */
+
+        case zcss_load:
+            /* complete inBuffer */
+            {   size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
+                size_t const loaded = ZSTD_limitCopy(zcs->inBuff + zcs->inBuffPos, toLoad, ip, iend-ip);
+                zcs->inBuffPos += loaded;
+                ip += loaded;
+                if ( (zcs->inBuffPos==zcs->inToCompress) || (!flush && (toLoad != loaded)) ) {
+                    someMoreWork = 0; break;  /* not enough input to get a full block : stop there, wait for more */
+            }   }
+            /* compress current block (note : this stage cannot be stopped in the middle) */
+            {   void* cDst;
+                size_t cSize;
+                size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
+                size_t oSize = oend-op;
+                if (oSize >= ZSTD_compressBound(iSize))
+                    cDst = op;   /* compress directly into output buffer (avoid flush stage) */
+                else
+                    cDst = zcs->outBuff, oSize = zcs->outBuffSize;
+                cSize = (flush == zsf_end) ?
+                        ZSTD_compressEnd(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize) :
+                        ZSTD_compressContinue(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize);
+                if (ZSTD_isError(cSize)) return cSize;
+                if (flush == zsf_end) zcs->frameEnded = 1;
+                /* prepare next block */
+                zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
+                if (zcs->inBuffTarget > zcs->inBuffSize)
+                    zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize;   /* note : inBuffSize >= blockSize */
+                zcs->inToCompress = zcs->inBuffPos;
+                if (cDst == op) { op += cSize; break; }   /* no need to flush */
+                zcs->outBuffContentSize = cSize;
+                zcs->outBuffFlushedSize = 0;
+                zcs->stage = zcss_flush;   /* pass-through to flush stage */
+            }
+
+        case zcss_flush:
+            {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+                size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
+                op += flushed;
+                zcs->outBuffFlushedSize += flushed;
+                if (toFlush!=flushed) { someMoreWork = 0; break; }  /* dst too small to store flushed data : stop there */
+                zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
+                zcs->stage = zcss_load;
+                break;
+            }
+
+        case zcss_final:
+            someMoreWork = 0;   /* do nothing */
+            break;
+
+        default:
+            return ERROR(GENERIC);   /* impossible */
+        }
+    }
+
+    *srcSizePtr = ip - istart;
+    *dstCapacityPtr = op - ostart;
+    zcs->inputProcessed += *srcSizePtr;
+    if (zcs->frameEnded) return 0;
+    {   size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
+        if (hintInSize==0) hintInSize = zcs->blockSize;
+        return hintInSize;
+    }
+}
+
+size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
+{
+    size_t sizeRead = input->size - input->pos;
+    size_t sizeWritten = output->size - output->pos;
+    size_t const result = ZSTD_compressStream_generic(zcs,
+                                                      (char*)(output->dst) + output->pos, &sizeWritten,
+                                                      (const char*)(input->src) + input->pos, &sizeRead, zsf_gather);
+    input->pos += sizeRead;
+    output->pos += sizeWritten;
+    return result;
+}
+
+
+/*======   Finalize   ======*/
+
+/*! ZSTD_flushStream() :
+*   @return : amount of data remaining to flush */
+size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
+{
+    size_t srcSize = 0;
+    size_t sizeWritten = output->size - output->pos;
+    size_t const result = ZSTD_compressStream_generic(zcs,
+                                                     (char*)(output->dst) + output->pos, &sizeWritten,
+                                                     &srcSize, &srcSize, /* use a valid src address instead of NULL */
+                                                      zsf_flush);
+    output->pos += sizeWritten;
+    if (ZSTD_isError(result)) return result;
+    return zcs->outBuffContentSize - zcs->outBuffFlushedSize;   /* remaining to flush */
+}
+
+
+size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
+{
+    BYTE* const ostart = (BYTE*)(output->dst) + output->pos;
+    BYTE* const oend = (BYTE*)(output->dst) + output->size;
+    BYTE* op = ostart;
+
+    if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
+        return ERROR(srcSize_wrong);   /* pledgedSrcSize not respected */
+
+    if (zcs->stage != zcss_final) {
+        /* flush whatever remains */
+        size_t srcSize = 0;
+        size_t sizeWritten = output->size - output->pos;
+        size_t const notEnded = ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end);  /* use a valid src address instead of NULL */
+        size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+        op += sizeWritten;
+        if (remainingToFlush) {
+            output->pos += sizeWritten;
+            return remainingToFlush + ZSTD_BLOCKHEADERSIZE /* final empty block */ + (zcs->checksum * 4);
+        }
+        /* create epilogue */
+        zcs->stage = zcss_final;
+        zcs->outBuffContentSize = !notEnded ? 0 :
+            ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);  /* write epilogue, including final empty block, into outBuff */
+    }
+
+    /* flush epilogue */
+    {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+        size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
+        op += flushed;
+        zcs->outBuffFlushedSize += flushed;
+        output->pos += op-ostart;
+        if (toFlush==flushed) zcs->stage = zcss_init;  /* end reached */
+        return toFlush - flushed;
+    }
+}
+
+
+
+/*-=====  Pre-defined compression levels  =====-*/
+
+#define ZSTD_DEFAULT_CLEVEL 1
+#define ZSTD_MAX_CLEVEL     22
+int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
+
+static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL+1] = {
+{   /* "default" */
+    /* W,  C,  H,  S,  L, TL, strat */
+    { 18, 12, 12,  1,  7, 16, ZSTD_fast    },  /* level  0 - never used */
+    { 19, 13, 14,  1,  7, 16, ZSTD_fast    },  /* level  1 */
+    { 19, 15, 16,  1,  6, 16, ZSTD_fast    },  /* level  2 */
+    { 20, 16, 17,  1,  5, 16, ZSTD_dfast   },  /* level  3.*/
+    { 20, 18, 18,  1,  5, 16, ZSTD_dfast   },  /* level  4.*/
+    { 20, 15, 18,  3,  5, 16, ZSTD_greedy  },  /* level  5 */
+    { 21, 16, 19,  2,  5, 16, ZSTD_lazy    },  /* level  6 */
+    { 21, 17, 20,  3,  5, 16, ZSTD_lazy    },  /* level  7 */
+    { 21, 18, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  8 */
+    { 21, 20, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  9 */
+    { 21, 19, 21,  4,  5, 16, ZSTD_lazy2   },  /* level 10 */
+    { 22, 20, 22,  4,  5, 16, ZSTD_lazy2   },  /* level 11 */
+    { 22, 20, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 12 */
+    { 22, 21, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 13 */
+    { 22, 21, 22,  6,  5, 16, ZSTD_lazy2   },  /* level 14 */
+    { 22, 21, 21,  5,  5, 16, ZSTD_btlazy2 },  /* level 15 */
+    { 23, 22, 22,  5,  5, 16, ZSTD_btlazy2 },  /* level 16 */
+    { 23, 21, 22,  4,  5, 24, ZSTD_btopt   },  /* level 17 */
+    { 23, 23, 22,  6,  5, 32, ZSTD_btopt   },  /* level 18 */
+    { 23, 23, 22,  6,  3, 48, ZSTD_btopt   },  /* level 19 */
+    { 25, 25, 23,  7,  3, 64, ZSTD_btopt2  },  /* level 20 */
+    { 26, 26, 23,  7,  3,256, ZSTD_btopt2  },  /* level 21 */
+    { 27, 27, 25,  9,  3,512, ZSTD_btopt2  },  /* level 22 */
+},
+{   /* for srcSize <= 256 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    {  0,  0,  0,  0,  0,  0, ZSTD_fast    },  /* level  0 - not used */
+    { 18, 13, 14,  1,  6,  8, ZSTD_fast    },  /* level  1 */
+    { 18, 14, 13,  1,  5,  8, ZSTD_dfast   },  /* level  2 */
+    { 18, 16, 15,  1,  5,  8, ZSTD_dfast   },  /* level  3 */
+    { 18, 15, 17,  1,  5,  8, ZSTD_greedy  },  /* level  4.*/
+    { 18, 16, 17,  4,  5,  8, ZSTD_greedy  },  /* level  5.*/
+    { 18, 16, 17,  3,  5,  8, ZSTD_lazy    },  /* level  6.*/
+    { 18, 17, 17,  4,  4,  8, ZSTD_lazy    },  /* level  7 */
+    { 18, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+    { 18, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+    { 18, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+    { 18, 18, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 11.*/
+    { 18, 18, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 12.*/
+    { 18, 19, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13 */
+    { 18, 18, 18,  4,  4, 16, ZSTD_btopt   },  /* level 14.*/
+    { 18, 18, 18,  4,  3, 16, ZSTD_btopt   },  /* level 15.*/
+    { 18, 19, 18,  6,  3, 32, ZSTD_btopt   },  /* level 16.*/
+    { 18, 19, 18,  8,  3, 64, ZSTD_btopt   },  /* level 17.*/
+    { 18, 19, 18,  9,  3,128, ZSTD_btopt   },  /* level 18.*/
+    { 18, 19, 18, 10,  3,256, ZSTD_btopt   },  /* level 19.*/
+    { 18, 19, 18, 11,  3,512, ZSTD_btopt2  },  /* level 20.*/
+    { 18, 19, 18, 12,  3,512, ZSTD_btopt2  },  /* level 21.*/
+    { 18, 19, 18, 13,  3,512, ZSTD_btopt2  },  /* level 22.*/
+},
+{   /* for srcSize <= 128 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    { 17, 12, 12,  1,  7,  8, ZSTD_fast    },  /* level  0 - not used */
+    { 17, 12, 13,  1,  6,  8, ZSTD_fast    },  /* level  1 */
+    { 17, 13, 16,  1,  5,  8, ZSTD_fast    },  /* level  2 */
+    { 17, 16, 16,  2,  5,  8, ZSTD_dfast   },  /* level  3 */
+    { 17, 13, 15,  3,  4,  8, ZSTD_greedy  },  /* level  4 */
+    { 17, 15, 17,  4,  4,  8, ZSTD_greedy  },  /* level  5 */
+    { 17, 16, 17,  3,  4,  8, ZSTD_lazy    },  /* level  6 */
+    { 17, 15, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  7 */
+    { 17, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+    { 17, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+    { 17, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+    { 17, 17, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 11 */
+    { 17, 17, 17,  8,  4,  8, ZSTD_lazy2   },  /* level 12 */
+    { 17, 18, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13.*/
+    { 17, 17, 17,  7,  3,  8, ZSTD_btopt   },  /* level 14.*/
+    { 17, 17, 17,  7,  3, 16, ZSTD_btopt   },  /* level 15.*/
+    { 17, 18, 17,  7,  3, 32, ZSTD_btopt   },  /* level 16.*/
+    { 17, 18, 17,  7,  3, 64, ZSTD_btopt   },  /* level 17.*/
+    { 17, 18, 17,  7,  3,256, ZSTD_btopt   },  /* level 18.*/
+    { 17, 18, 17,  8,  3,256, ZSTD_btopt   },  /* level 19.*/
+    { 17, 18, 17,  9,  3,256, ZSTD_btopt2  },  /* level 20.*/
+    { 17, 18, 17, 10,  3,256, ZSTD_btopt2  },  /* level 21.*/
+    { 17, 18, 17, 11,  3,512, ZSTD_btopt2  },  /* level 22.*/
+},
+{   /* for srcSize <= 16 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    { 14, 12, 12,  1,  7,  6, ZSTD_fast    },  /* level  0 - not used */
+    { 14, 14, 14,  1,  6,  6, ZSTD_fast    },  /* level  1 */
+    { 14, 14, 14,  1,  4,  6, ZSTD_fast    },  /* level  2 */
+    { 14, 14, 14,  1,  4,  6, ZSTD_dfast   },  /* level  3.*/
+    { 14, 14, 14,  4,  4,  6, ZSTD_greedy  },  /* level  4.*/
+    { 14, 14, 14,  3,  4,  6, ZSTD_lazy    },  /* level  5.*/
+    { 14, 14, 14,  4,  4,  6, ZSTD_lazy2   },  /* level  6 */
+    { 14, 14, 14,  5,  4,  6, ZSTD_lazy2   },  /* level  7 */
+    { 14, 14, 14,  6,  4,  6, ZSTD_lazy2   },  /* level  8.*/
+    { 14, 15, 14,  6,  4,  6, ZSTD_btlazy2 },  /* level  9.*/
+    { 14, 15, 14,  3,  3,  6, ZSTD_btopt   },  /* level 10.*/
+    { 14, 15, 14,  6,  3,  8, ZSTD_btopt   },  /* level 11.*/
+    { 14, 15, 14,  6,  3, 16, ZSTD_btopt   },  /* level 12.*/
+    { 14, 15, 14,  6,  3, 24, ZSTD_btopt   },  /* level 13.*/
+    { 14, 15, 15,  6,  3, 48, ZSTD_btopt   },  /* level 14.*/
+    { 14, 15, 15,  6,  3, 64, ZSTD_btopt   },  /* level 15.*/
+    { 14, 15, 15,  6,  3, 96, ZSTD_btopt   },  /* level 16.*/
+    { 14, 15, 15,  6,  3,128, ZSTD_btopt   },  /* level 17.*/
+    { 14, 15, 15,  6,  3,256, ZSTD_btopt   },  /* level 18.*/
+    { 14, 15, 15,  7,  3,256, ZSTD_btopt   },  /* level 19.*/
+    { 14, 15, 15,  8,  3,256, ZSTD_btopt2  },  /* level 20.*/
+    { 14, 15, 15,  9,  3,256, ZSTD_btopt2  },  /* level 21.*/
+    { 14, 15, 15, 10,  3,256, ZSTD_btopt2  },  /* level 22.*/
+},
+};
+
+/*! ZSTD_getCParams() :
+*   @return ZSTD_compressionParameters structure for a selected compression level, `srcSize` and `dictSize`.
+*   Size values are optional, provide 0 if not known or unused */
+ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
+{
+    ZSTD_compressionParameters cp;
+    size_t const addedSize = srcSize ? 0 : 500;
+    U64 const rSize = srcSize+dictSize ? srcSize+dictSize+addedSize : (U64)-1;
+    U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB);   /* intentional underflow for srcSizeHint == 0 */
+    if (compressionLevel <= 0) compressionLevel = ZSTD_DEFAULT_CLEVEL;   /* 0 == default; no negative compressionLevel yet */
+    if (compressionLevel > ZSTD_MAX_CLEVEL) compressionLevel = ZSTD_MAX_CLEVEL;
+    cp = ZSTD_defaultCParameters[tableID][compressionLevel];
+    if (MEM_32bits()) {   /* auto-correction, for 32-bits mode */
+        if (cp.windowLog > ZSTD_WINDOWLOG_MAX) cp.windowLog = ZSTD_WINDOWLOG_MAX;
+        if (cp.chainLog > ZSTD_CHAINLOG_MAX) cp.chainLog = ZSTD_CHAINLOG_MAX;
+        if (cp.hashLog > ZSTD_HASHLOG_MAX) cp.hashLog = ZSTD_HASHLOG_MAX;
+    }
+    cp = ZSTD_adjustCParams(cp, srcSize, dictSize);
+    return cp;
+}
+
+/*! ZSTD_getParams() :
+*   same as ZSTD_getCParams(), but @return a `ZSTD_parameters` object (instead of `ZSTD_compressionParameters`).
+*   All fields of `ZSTD_frameParameters` are set to default (0) */
+ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSize, size_t dictSize) {
+    ZSTD_parameters params;
+    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSize, dictSize);
+    memset(&params, 0, sizeof(params));
+    params.cParams = cParams;
+    return params;
+}
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
new file mode 100644
index 000000000..06337dbd5
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -0,0 +1,2484 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+
+/* ***************************************************************
+*  Tuning parameters
+*****************************************************************/
+/*!
+ * HEAPMODE :
+ * Select how default decompression function ZSTD_decompress() will allocate memory,
+ * in memory stack (0), or in memory heap (1, requires malloc())
+ */
+#ifndef ZSTD_HEAPMODE
+#  define ZSTD_HEAPMODE 1
+#endif
+
+/*!
+*  LEGACY_SUPPORT :
+*  if set to 1, ZSTD_decompress() can decode older formats (v0.1+)
+*/
+#ifndef ZSTD_LEGACY_SUPPORT
+#  define ZSTD_LEGACY_SUPPORT 0
+#endif
+
+/*!
+*  MAXWINDOWSIZE_DEFAULT :
+*  maximum window size accepted by DStream, by default.
+*  Frames requiring more memory will be rejected.
+*/
+#ifndef ZSTD_MAXWINDOWSIZE_DEFAULT
+#  define ZSTD_MAXWINDOWSIZE_DEFAULT ((1 << ZSTD_WINDOWLOG_MAX) + 1)   /* defined within zstd.h */
+#endif
+
+
+/*-*******************************************************
+*  Dependencies
+*********************************************************/
+#include <string.h>      /* memcpy, memmove, memset */
+#include "mem.h"         /* low level memory routines */
+#define FSE_STATIC_LINKING_ONLY
+#include "fse.h"
+#define HUF_STATIC_LINKING_ONLY
+#include "huf.h"
+#include "zstd_internal.h"
+
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+#  include "zstd_legacy.h"
+#endif
+
+
+#if defined(_MSC_VER)
+#  include <mmintrin.h>   /* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */
+#  define ZSTD_PREFETCH(ptr)   _mm_prefetch((const char*)ptr, _MM_HINT_T0)
+#elif defined(__GNUC__)
+#  define ZSTD_PREFETCH(ptr)   __builtin_prefetch(ptr, 0, 0)
+#else
+#  define ZSTD_PREFETCH(ptr)   /* disabled */
+#endif
+
+/*-*************************************
+*  Macros
+***************************************/
+#define ZSTD_isError ERR_isError   /* for inlining */
+#define FSE_isError  ERR_isError
+#define HUF_isError  ERR_isError
+
+
+/*_*******************************************************
+*  Memory operations
+**********************************************************/
+static void ZSTD_copy4(void* dst, const void* src) { memcpy(dst, src, 4); }
+
+
+/*-*************************************************************
+*   Context management
+***************************************************************/
+typedef enum { ZSTDds_getFrameHeaderSize, ZSTDds_decodeFrameHeader,
+               ZSTDds_decodeBlockHeader, ZSTDds_decompressBlock,
+               ZSTDds_decompressLastBlock, ZSTDds_checkChecksum,
+               ZSTDds_decodeSkippableHeader, ZSTDds_skipFrame } ZSTD_dStage;
+
+typedef struct {
+    FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
+    FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
+    FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
+    HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)];  /* can accommodate HUF_decompress4X */
+    U32 rep[ZSTD_REP_NUM];
+} ZSTD_entropyTables_t;
+
+struct ZSTD_DCtx_s
+{
+    const FSE_DTable* LLTptr;
+    const FSE_DTable* MLTptr;
+    const FSE_DTable* OFTptr;
+    const HUF_DTable* HUFptr;
+    ZSTD_entropyTables_t entropy;
+    const void* previousDstEnd;   /* detect continuity */
+    const void* base;             /* start of current segment */
+    const void* vBase;            /* virtual start of previous segment if it was just before current one */
+    const void* dictEnd;          /* end of previous segment */
+    size_t expected;
+    ZSTD_frameParams fParams;
+    blockType_e bType;   /* used in ZSTD_decompressContinue(), to transfer blockType between header decoding and block decoding stages */
+    ZSTD_dStage stage;
+    U32 litEntropy;
+    U32 fseEntropy;
+    XXH64_state_t xxhState;
+    size_t headerSize;
+    U32 dictID;
+    const BYTE* litPtr;
+    ZSTD_customMem customMem;
+    size_t litSize;
+    size_t rleSize;
+    BYTE litBuffer[ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH];
+    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
+};  /* typedef'd to ZSTD_DCtx within "zstd.h" */
+
+size_t ZSTD_sizeof_DCtx (const ZSTD_DCtx* dctx) { return (dctx==NULL) ? 0 : sizeof(ZSTD_DCtx); }
+
+size_t ZSTD_estimateDCtxSize(void) { return sizeof(ZSTD_DCtx); }
+
+size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx)
+{
+    dctx->expected = ZSTD_frameHeaderSize_prefix;
+    dctx->stage = ZSTDds_getFrameHeaderSize;
+    dctx->previousDstEnd = NULL;
+    dctx->base = NULL;
+    dctx->vBase = NULL;
+    dctx->dictEnd = NULL;
+    dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+    dctx->litEntropy = dctx->fseEntropy = 0;
+    dctx->dictID = 0;
+    MEM_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
+    memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue));  /* initial repcodes */
+    dctx->LLTptr = dctx->entropy.LLTable;
+    dctx->MLTptr = dctx->entropy.MLTable;
+    dctx->OFTptr = dctx->entropy.OFTable;
+    dctx->HUFptr = dctx->entropy.hufTable;
+    return 0;
+}
+
+ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
+{
+    ZSTD_DCtx* dctx;
+
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
+    if (!dctx) return NULL;
+    memcpy(&dctx->customMem, &customMem, sizeof(customMem));
+    ZSTD_decompressBegin(dctx);
+    return dctx;
+}
+
+ZSTD_DCtx* ZSTD_createDCtx(void)
+{
+    return ZSTD_createDCtx_advanced(defaultCustomMem);
+}
+
+size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx)
+{
+    if (dctx==NULL) return 0;   /* support free on NULL */
+    ZSTD_free(dctx, dctx->customMem);
+    return 0;   /* reserved as a potential error code in the future */
+}
+
+void ZSTD_copyDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
+{
+    size_t const workSpaceSize = (ZSTD_BLOCKSIZE_ABSOLUTEMAX+WILDCOPY_OVERLENGTH) + ZSTD_frameHeaderSize_max;
+    memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize);  /* no need to copy workspace */
+}
+
+#if 0
+/* deprecated */
+static void ZSTD_refDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
+{
+    ZSTD_decompressBegin(dstDCtx);  /* init */
+    if (srcDCtx) {   /* support refDCtx on NULL */
+        dstDCtx->dictEnd = srcDCtx->dictEnd;
+        dstDCtx->vBase = srcDCtx->vBase;
+        dstDCtx->base = srcDCtx->base;
+        dstDCtx->previousDstEnd = srcDCtx->previousDstEnd;
+        dstDCtx->dictID = srcDCtx->dictID;
+        dstDCtx->litEntropy = srcDCtx->litEntropy;
+        dstDCtx->fseEntropy = srcDCtx->fseEntropy;
+        dstDCtx->LLTptr = srcDCtx->entropy.LLTable;
+        dstDCtx->MLTptr = srcDCtx->entropy.MLTable;
+        dstDCtx->OFTptr = srcDCtx->entropy.OFTable;
+        dstDCtx->HUFptr = srcDCtx->entropy.hufTable;
+        dstDCtx->entropy.rep[0] = srcDCtx->entropy.rep[0];
+        dstDCtx->entropy.rep[1] = srcDCtx->entropy.rep[1];
+        dstDCtx->entropy.rep[2] = srcDCtx->entropy.rep[2];
+    }
+}
+#endif
+
+static void ZSTD_refDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict);
+
+
+/*-*************************************************************
+*   Decompression section
+***************************************************************/
+
+/*! ZSTD_isFrame() :
+ *  Tells if the content of `buffer` starts with a valid Frame Identifier.
+ *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
+ *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
+ *  Note 3 : Skippable Frame Identifiers are considered valid. */
+unsigned ZSTD_isFrame(const void* buffer, size_t size)
+{
+    if (size < 4) return 0;
+    {   U32 const magic = MEM_readLE32(buffer);
+        if (magic == ZSTD_MAGICNUMBER) return 1;
+        if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
+    }
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(buffer, size)) return 1;
+#endif
+    return 0;
+}
+
+
+/** ZSTD_frameHeaderSize() :
+*   srcSize must be >= ZSTD_frameHeaderSize_prefix.
+*   @return : size of the Frame Header */
+static size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize)
+{
+    if (srcSize < ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);
+    {   BYTE const fhd = ((const BYTE*)src)[4];
+        U32 const dictID= fhd & 3;
+        U32 const singleSegment = (fhd >> 5) & 1;
+        U32 const fcsId = fhd >> 6;
+        return ZSTD_frameHeaderSize_prefix + !singleSegment + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId]
+                + (singleSegment && !fcsId);
+    }
+}
+
+
+/** ZSTD_getFrameParams() :
+*   decode Frame Header, or require larger `srcSize`.
+*   @return : 0, `fparamsPtr` is correctly filled,
+*            >0, `srcSize` is too small, result is expected `srcSize`,
+*             or an error code, which can be tested using ZSTD_isError() */
+size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t srcSize)
+{
+    const BYTE* ip = (const BYTE*)src;
+
+    if (srcSize < ZSTD_frameHeaderSize_prefix) return ZSTD_frameHeaderSize_prefix;
+    if (MEM_readLE32(src) != ZSTD_MAGICNUMBER) {
+        if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+            if (srcSize < ZSTD_skippableHeaderSize) return ZSTD_skippableHeaderSize; /* magic number + skippable frame length */
+            memset(fparamsPtr, 0, sizeof(*fparamsPtr));
+            fparamsPtr->frameContentSize = MEM_readLE32((const char *)src + 4);
+            fparamsPtr->windowSize = 0; /* windowSize==0 means a frame is skippable */
+            return 0;
+        }
+        return ERROR(prefix_unknown);
+    }
+
+    /* ensure there is enough `srcSize` to fully read/decode frame header */
+    { size_t const fhsize = ZSTD_frameHeaderSize(src, srcSize);
+      if (srcSize < fhsize) return fhsize; }
+
+    {   BYTE const fhdByte = ip[4];
+        size_t pos = 5;
+        U32 const dictIDSizeCode = fhdByte&3;
+        U32 const checksumFlag = (fhdByte>>2)&1;
+        U32 const singleSegment = (fhdByte>>5)&1;
+        U32 const fcsID = fhdByte>>6;
+        U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;
+        U32 windowSize = 0;
+        U32 dictID = 0;
+        U64 frameContentSize = 0;
+        if ((fhdByte & 0x08) != 0) return ERROR(frameParameter_unsupported);   /* reserved bits, which must be zero */
+        if (!singleSegment) {
+            BYTE const wlByte = ip[pos++];
+            U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
+            if (windowLog > ZSTD_WINDOWLOG_MAX) return ERROR(frameParameter_windowTooLarge);  /* avoids issue with 1 << windowLog */
+            windowSize = (1U << windowLog);
+            windowSize += (windowSize >> 3) * (wlByte&7);
+        }
+
+        switch(dictIDSizeCode)
+        {
+            default:   /* impossible */
+            case 0 : break;
+            case 1 : dictID = ip[pos]; pos++; break;
+            case 2 : dictID = MEM_readLE16(ip+pos); pos+=2; break;
+            case 3 : dictID = MEM_readLE32(ip+pos); pos+=4; break;
+        }
+        switch(fcsID)
+        {
+            default:   /* impossible */
+            case 0 : if (singleSegment) frameContentSize = ip[pos]; break;
+            case 1 : frameContentSize = MEM_readLE16(ip+pos)+256; break;
+            case 2 : frameContentSize = MEM_readLE32(ip+pos); break;
+            case 3 : frameContentSize = MEM_readLE64(ip+pos); break;
+        }
+        if (!windowSize) windowSize = (U32)frameContentSize;
+        if (windowSize > windowSizeMax) return ERROR(frameParameter_windowTooLarge);
+        fparamsPtr->frameContentSize = frameContentSize;
+        fparamsPtr->windowSize = windowSize;
+        fparamsPtr->dictID = dictID;
+        fparamsPtr->checksumFlag = checksumFlag;
+    }
+    return 0;
+}
+
+/** ZSTD_getFrameContentSize() :
+*   compatible with legacy mode
+*   @return : decompressed size of the single frame pointed to be `src` if known, otherwise
+*             - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
+*             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
+unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
+{
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(src, srcSize)) {
+        unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
+        return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
+    }
+#endif
+    {
+        ZSTD_frameParams fParams;
+        if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0) return ZSTD_CONTENTSIZE_ERROR;
+        if (fParams.windowSize == 0) {
+            /* Either skippable or empty frame, size == 0 either way */
+            return 0;
+        } else if (fParams.frameContentSize != 0) {
+            return fParams.frameContentSize;
+        } else {
+            return ZSTD_CONTENTSIZE_UNKNOWN;
+        }
+    }
+}
+
+/** ZSTD_findDecompressedSize() :
+ *  compatible with legacy mode
+ *  `srcSize` must be the exact length of some number of ZSTD compressed and/or
+ *      skippable frames
+ *  @return : decompressed size of the frames contained */
+unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize)
+{
+    {
+        unsigned long long totalDstSize = 0;
+        while (srcSize >= ZSTD_frameHeaderSize_prefix) {
+            const U32 magicNumber = MEM_readLE32(src);
+
+            if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+                size_t skippableSize;
+                if (srcSize < ZSTD_skippableHeaderSize)
+                    return ERROR(srcSize_wrong);
+                skippableSize = MEM_readLE32((const BYTE *)src + 4) +
+                                ZSTD_skippableHeaderSize;
+                if (srcSize < skippableSize) {
+                    return ZSTD_CONTENTSIZE_ERROR;
+                }
+
+                src = (const BYTE *)src + skippableSize;
+                srcSize -= skippableSize;
+                continue;
+            }
+
+            {
+                unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+                if (ret >= ZSTD_CONTENTSIZE_ERROR) return ret;
+
+                /* check for overflow */
+                if (totalDstSize + ret < totalDstSize) return ZSTD_CONTENTSIZE_ERROR;
+                totalDstSize += ret;
+            }
+            {
+                size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
+                if (ZSTD_isError(frameSrcSize)) {
+                    return ZSTD_CONTENTSIZE_ERROR;
+                }
+
+                src = (const BYTE *)src + frameSrcSize;
+                srcSize -= frameSrcSize;
+            }
+        }
+
+        if (srcSize) {
+            return ZSTD_CONTENTSIZE_ERROR;
+        }
+
+        return totalDstSize;
+    }
+}
+
+/** ZSTD_getDecompressedSize() :
+*   compatible with legacy mode
+*   @return : decompressed size if known, 0 otherwise
+              note : 0 can mean any of the following :
+                   - decompressed size is not present within frame header
+                   - frame header unknown / not supported
+                   - frame header not complete (`srcSize` too small) */
+unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
+{
+    unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+    return ret >= ZSTD_CONTENTSIZE_ERROR ? 0 : ret;
+}
+
+
+/** ZSTD_decodeFrameHeader() :
+*   `headerSize` must be the size provided by ZSTD_frameHeaderSize().
+*   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
+static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx* dctx, const void* src, size_t headerSize)
+{
+    size_t const result = ZSTD_getFrameParams(&(dctx->fParams), src, headerSize);
+    if (ZSTD_isError(result)) return result;  /* invalid header */
+    if (result>0) return ERROR(srcSize_wrong);   /* headerSize too small */
+    if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID)) return ERROR(dictionary_wrong);
+    if (dctx->fParams.checksumFlag) XXH64_reset(&dctx->xxhState, 0);
+    return 0;
+}
+
+
+typedef struct
+{
+    blockType_e blockType;
+    U32 lastBlock;
+    U32 origSize;
+} blockProperties_t;
+
+/*! ZSTD_getcBlockSize() :
+*   Provides the size of compressed block from block header `src` */
+size_t ZSTD_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)
+{
+    if (srcSize < ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+    {   U32 const cBlockHeader = MEM_readLE24(src);
+        U32 const cSize = cBlockHeader >> 3;
+        bpPtr->lastBlock = cBlockHeader & 1;
+        bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
+        bpPtr->origSize = cSize;   /* only useful for RLE */
+        if (bpPtr->blockType == bt_rle) return 1;
+        if (bpPtr->blockType == bt_reserved) return ERROR(corruption_detected);
+        return cSize;
+    }
+}
+
+
+static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    if (srcSize > dstCapacity) return ERROR(dstSize_tooSmall);
+    memcpy(dst, src, srcSize);
+    return srcSize;
+}
+
+
+static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize, size_t regenSize)
+{
+    if (srcSize != 1) return ERROR(srcSize_wrong);
+    if (regenSize > dstCapacity) return ERROR(dstSize_tooSmall);
+    memset(dst, *(const BYTE*)src, regenSize);
+    return regenSize;
+}
+
+/*! ZSTD_decodeLiteralsBlock() :
+    @return : nb of bytes read from src (< srcSize ) */
+size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx* dctx,
+                          const void* src, size_t srcSize)   /* note : srcSize < BLOCKSIZE */
+{
+    if (srcSize < MIN_CBLOCK_SIZE) return ERROR(corruption_detected);
+
+    {   const BYTE* const istart = (const BYTE*) src;
+        symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
+
+        switch(litEncType)
+        {
+        case set_repeat:
+            if (dctx->litEntropy==0) return ERROR(dictionary_corrupted);
+            /* fall-through */
+        case set_compressed:
+            if (srcSize < 5) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
+            {   size_t lhSize, litSize, litCSize;
+                U32 singleStream=0;
+                U32 const lhlCode = (istart[0] >> 2) & 3;
+                U32 const lhc = MEM_readLE32(istart);
+                switch(lhlCode)
+                {
+                case 0: case 1: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    /* 2 - 2 - 10 - 10 */
+                    singleStream = !lhlCode;
+                    lhSize = 3;
+                    litSize  = (lhc >> 4) & 0x3FF;
+                    litCSize = (lhc >> 14) & 0x3FF;
+                    break;
+                case 2:
+                    /* 2 - 2 - 14 - 14 */
+                    lhSize = 4;
+                    litSize  = (lhc >> 4) & 0x3FFF;
+                    litCSize = lhc >> 18;
+                    break;
+                case 3:
+                    /* 2 - 2 - 18 - 18 */
+                    lhSize = 5;
+                    litSize  = (lhc >> 4) & 0x3FFFF;
+                    litCSize = (lhc >> 22) + (istart[4] << 10);
+                    break;
+                }
+                if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
+                if (litCSize + lhSize > srcSize) return ERROR(corruption_detected);
+
+                if (HUF_isError((litEncType==set_repeat) ?
+                                    ( singleStream ?
+                                        HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) :
+                                        HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) ) :
+                                    ( singleStream ?
+                                        HUF_decompress1X2_DCtx(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize) :
+                                        HUF_decompress4X_hufOnly (dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize)) ))
+                    return ERROR(corruption_detected);
+
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                dctx->litEntropy = 1;
+                if (litEncType==set_compressed) dctx->HUFptr = dctx->entropy.hufTable;
+                memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+                return litCSize + lhSize;
+            }
+
+        case set_basic:
+            {   size_t litSize, lhSize;
+                U32 const lhlCode = ((istart[0]) >> 2) & 3;
+                switch(lhlCode)
+                {
+                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    lhSize = 1;
+                    litSize = istart[0] >> 3;
+                    break;
+                case 1:
+                    lhSize = 2;
+                    litSize = MEM_readLE16(istart) >> 4;
+                    break;
+                case 3:
+                    lhSize = 3;
+                    litSize = MEM_readLE24(istart) >> 4;
+                    break;
+                }
+
+                if (lhSize+litSize+WILDCOPY_OVERLENGTH > srcSize) {  /* risk reading beyond src buffer with wildcopy */
+                    if (litSize+lhSize > srcSize) return ERROR(corruption_detected);
+                    memcpy(dctx->litBuffer, istart+lhSize, litSize);
+                    dctx->litPtr = dctx->litBuffer;
+                    dctx->litSize = litSize;
+                    memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+                    return lhSize+litSize;
+                }
+                /* direct reference into compressed stream */
+                dctx->litPtr = istart+lhSize;
+                dctx->litSize = litSize;
+                return lhSize+litSize;
+            }
+
+        case set_rle:
+            {   U32 const lhlCode = ((istart[0]) >> 2) & 3;
+                size_t litSize, lhSize;
+                switch(lhlCode)
+                {
+                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    lhSize = 1;
+                    litSize = istart[0] >> 3;
+                    break;
+                case 1:
+                    lhSize = 2;
+                    litSize = MEM_readLE16(istart) >> 4;
+                    break;
+                case 3:
+                    lhSize = 3;
+                    litSize = MEM_readLE24(istart) >> 4;
+                    if (srcSize<4) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
+                    break;
+                }
+                if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
+                memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                return lhSize+1;
+            }
+        default:
+            return ERROR(corruption_detected);   /* impossible */
+        }
+    }
+}
+
+
+typedef union {
+    FSE_decode_t realData;
+    U32 alignedBy4;
+} FSE_decode_t4;
+
+static const FSE_decode_t4 LL_defaultDTable[(1<<LL_DEFAULTNORMLOG)+1] = {
+    { { LL_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+    { {  0,  0,  4 } },              /* 0 : base, symbol, bits */
+    { { 16,  0,  4 } },
+    { { 32,  1,  5 } },
+    { {  0,  3,  5 } },
+    { {  0,  4,  5 } },
+    { {  0,  6,  5 } },
+    { {  0,  7,  5 } },
+    { {  0,  9,  5 } },
+    { {  0, 10,  5 } },
+    { {  0, 12,  5 } },
+    { {  0, 14,  6 } },
+    { {  0, 16,  5 } },
+    { {  0, 18,  5 } },
+    { {  0, 19,  5 } },
+    { {  0, 21,  5 } },
+    { {  0, 22,  5 } },
+    { {  0, 24,  5 } },
+    { { 32, 25,  5 } },
+    { {  0, 26,  5 } },
+    { {  0, 27,  6 } },
+    { {  0, 29,  6 } },
+    { {  0, 31,  6 } },
+    { { 32,  0,  4 } },
+    { {  0,  1,  4 } },
+    { {  0,  2,  5 } },
+    { { 32,  4,  5 } },
+    { {  0,  5,  5 } },
+    { { 32,  7,  5 } },
+    { {  0,  8,  5 } },
+    { { 32, 10,  5 } },
+    { {  0, 11,  5 } },
+    { {  0, 13,  6 } },
+    { { 32, 16,  5 } },
+    { {  0, 17,  5 } },
+    { { 32, 19,  5 } },
+    { {  0, 20,  5 } },
+    { { 32, 22,  5 } },
+    { {  0, 23,  5 } },
+    { {  0, 25,  4 } },
+    { { 16, 25,  4 } },
+    { { 32, 26,  5 } },
+    { {  0, 28,  6 } },
+    { {  0, 30,  6 } },
+    { { 48,  0,  4 } },
+    { { 16,  1,  4 } },
+    { { 32,  2,  5 } },
+    { { 32,  3,  5 } },
+    { { 32,  5,  5 } },
+    { { 32,  6,  5 } },
+    { { 32,  8,  5 } },
+    { { 32,  9,  5 } },
+    { { 32, 11,  5 } },
+    { { 32, 12,  5 } },
+    { {  0, 15,  6 } },
+    { { 32, 17,  5 } },
+    { { 32, 18,  5 } },
+    { { 32, 20,  5 } },
+    { { 32, 21,  5 } },
+    { { 32, 23,  5 } },
+    { { 32, 24,  5 } },
+    { {  0, 35,  6 } },
+    { {  0, 34,  6 } },
+    { {  0, 33,  6 } },
+    { {  0, 32,  6 } },
+};   /* LL_defaultDTable */
+
+static const FSE_decode_t4 ML_defaultDTable[(1<<ML_DEFAULTNORMLOG)+1] = {
+    { { ML_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+    { {  0,  0,  6 } },              /* 0 : base, symbol, bits */
+    { {  0,  1,  4 } },
+    { { 32,  2,  5 } },
+    { {  0,  3,  5 } },
+    { {  0,  5,  5 } },
+    { {  0,  6,  5 } },
+    { {  0,  8,  5 } },
+    { {  0, 10,  6 } },
+    { {  0, 13,  6 } },
+    { {  0, 16,  6 } },
+    { {  0, 19,  6 } },
+    { {  0, 22,  6 } },
+    { {  0, 25,  6 } },
+    { {  0, 28,  6 } },
+    { {  0, 31,  6 } },
+    { {  0, 33,  6 } },
+    { {  0, 35,  6 } },
+    { {  0, 37,  6 } },
+    { {  0, 39,  6 } },
+    { {  0, 41,  6 } },
+    { {  0, 43,  6 } },
+    { {  0, 45,  6 } },
+    { { 16,  1,  4 } },
+    { {  0,  2,  4 } },
+    { { 32,  3,  5 } },
+    { {  0,  4,  5 } },
+    { { 32,  6,  5 } },
+    { {  0,  7,  5 } },
+    { {  0,  9,  6 } },
+    { {  0, 12,  6 } },
+    { {  0, 15,  6 } },
+    { {  0, 18,  6 } },
+    { {  0, 21,  6 } },
+    { {  0, 24,  6 } },
+    { {  0, 27,  6 } },
+    { {  0, 30,  6 } },
+    { {  0, 32,  6 } },
+    { {  0, 34,  6 } },
+    { {  0, 36,  6 } },
+    { {  0, 38,  6 } },
+    { {  0, 40,  6 } },
+    { {  0, 42,  6 } },
+    { {  0, 44,  6 } },
+    { { 32,  1,  4 } },
+    { { 48,  1,  4 } },
+    { { 16,  2,  4 } },
+    { { 32,  4,  5 } },
+    { { 32,  5,  5 } },
+    { { 32,  7,  5 } },
+    { { 32,  8,  5 } },
+    { {  0, 11,  6 } },
+    { {  0, 14,  6 } },
+    { {  0, 17,  6 } },
+    { {  0, 20,  6 } },
+    { {  0, 23,  6 } },
+    { {  0, 26,  6 } },
+    { {  0, 29,  6 } },
+    { {  0, 52,  6 } },
+    { {  0, 51,  6 } },
+    { {  0, 50,  6 } },
+    { {  0, 49,  6 } },
+    { {  0, 48,  6 } },
+    { {  0, 47,  6 } },
+    { {  0, 46,  6 } },
+};   /* ML_defaultDTable */
+
+static const FSE_decode_t4 OF_defaultDTable[(1<<OF_DEFAULTNORMLOG)+1] = {
+    { { OF_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+    { {  0,  0,  5 } },              /* 0 : base, symbol, bits */
+    { {  0,  6,  4 } },
+    { {  0,  9,  5 } },
+    { {  0, 15,  5 } },
+    { {  0, 21,  5 } },
+    { {  0,  3,  5 } },
+    { {  0,  7,  4 } },
+    { {  0, 12,  5 } },
+    { {  0, 18,  5 } },
+    { {  0, 23,  5 } },
+    { {  0,  5,  5 } },
+    { {  0,  8,  4 } },
+    { {  0, 14,  5 } },
+    { {  0, 20,  5 } },
+    { {  0,  2,  5 } },
+    { { 16,  7,  4 } },
+    { {  0, 11,  5 } },
+    { {  0, 17,  5 } },
+    { {  0, 22,  5 } },
+    { {  0,  4,  5 } },
+    { { 16,  8,  4 } },
+    { {  0, 13,  5 } },
+    { {  0, 19,  5 } },
+    { {  0,  1,  5 } },
+    { { 16,  6,  4 } },
+    { {  0, 10,  5 } },
+    { {  0, 16,  5 } },
+    { {  0, 28,  5 } },
+    { {  0, 27,  5 } },
+    { {  0, 26,  5 } },
+    { {  0, 25,  5 } },
+    { {  0, 24,  5 } },
+};   /* OF_defaultDTable */
+
+/*! ZSTD_buildSeqTable() :
+    @return : nb bytes read from src,
+              or an error code if it fails, testable with ZSTD_isError()
+*/
+static size_t ZSTD_buildSeqTable(FSE_DTable* DTableSpace, const FSE_DTable** DTablePtr,
+                                 symbolEncodingType_e type, U32 max, U32 maxLog,
+                                 const void* src, size_t srcSize,
+                                 const FSE_decode_t4* defaultTable, U32 flagRepeatTable)
+{
+    const void* const tmpPtr = defaultTable;   /* bypass strict aliasing */
+    switch(type)
+    {
+    case set_rle :
+        if (!srcSize) return ERROR(srcSize_wrong);
+        if ( (*(const BYTE*)src) > max) return ERROR(corruption_detected);
+        FSE_buildDTable_rle(DTableSpace, *(const BYTE*)src);
+        *DTablePtr = DTableSpace;
+        return 1;
+    case set_basic :
+        *DTablePtr = (const FSE_DTable*)tmpPtr;
+        return 0;
+    case set_repeat:
+        if (!flagRepeatTable) return ERROR(corruption_detected);
+        return 0;
+    default :   /* impossible */
+    case set_compressed :
+        {   U32 tableLog;
+            S16 norm[MaxSeq+1];
+            size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
+            if (FSE_isError(headerSize)) return ERROR(corruption_detected);
+            if (tableLog > maxLog) return ERROR(corruption_detected);
+            FSE_buildDTable(DTableSpace, norm, max, tableLog);
+            *DTablePtr = DTableSpace;
+            return headerSize;
+    }   }
+}
+
+size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx* dctx, int* nbSeqPtr,
+                             const void* src, size_t srcSize)
+{
+    const BYTE* const istart = (const BYTE* const)src;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* ip = istart;
+
+    /* check */
+    if (srcSize < MIN_SEQUENCES_SIZE) return ERROR(srcSize_wrong);
+
+    /* SeqHead */
+    {   int nbSeq = *ip++;
+        if (!nbSeq) { *nbSeqPtr=0; return 1; }
+        if (nbSeq > 0x7F) {
+            if (nbSeq == 0xFF) {
+                if (ip+2 > iend) return ERROR(srcSize_wrong);
+                nbSeq = MEM_readLE16(ip) + LONGNBSEQ, ip+=2;
+            } else {
+                if (ip >= iend) return ERROR(srcSize_wrong);
+                nbSeq = ((nbSeq-0x80)<<8) + *ip++;
+            }
+        }
+        *nbSeqPtr = nbSeq;
+    }
+
+    /* FSE table descriptors */
+    if (ip+4 > iend) return ERROR(srcSize_wrong); /* minimum possible size */
+    {   symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
+        symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
+        symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
+        ip++;
+
+        /* Build DTables */
+        {   size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr,
+                                                      LLtype, MaxLL, LLFSELog,
+                                                      ip, iend-ip, LL_defaultDTable, dctx->fseEntropy);
+            if (ZSTD_isError(llhSize)) return ERROR(corruption_detected);
+            ip += llhSize;
+        }
+        {   size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr,
+                                                      OFtype, MaxOff, OffFSELog,
+                                                      ip, iend-ip, OF_defaultDTable, dctx->fseEntropy);
+            if (ZSTD_isError(ofhSize)) return ERROR(corruption_detected);
+            ip += ofhSize;
+        }
+        {   size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr,
+                                                      MLtype, MaxML, MLFSELog,
+                                                      ip, iend-ip, ML_defaultDTable, dctx->fseEntropy);
+            if (ZSTD_isError(mlhSize)) return ERROR(corruption_detected);
+            ip += mlhSize;
+        }
+    }
+
+    return ip-istart;
+}
+
+
+typedef struct {
+    size_t litLength;
+    size_t matchLength;
+    size_t offset;
+    const BYTE* match;
+} seq_t;
+
+typedef struct {
+    BIT_DStream_t DStream;
+    FSE_DState_t stateLL;
+    FSE_DState_t stateOffb;
+    FSE_DState_t stateML;
+    size_t prevOffset[ZSTD_REP_NUM];
+    const BYTE* base;
+    size_t pos;
+    uPtrDiff gotoDict;
+} seqState_t;
+
+
+FORCE_NOINLINE
+size_t ZSTD_execSequenceLast7(BYTE* op,
+                              BYTE* const oend, seq_t sequence,
+                              const BYTE** litPtr, const BYTE* const litLimit,
+                              const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+{
+    BYTE* const oLitEnd = op + sequence.litLength;
+    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+    const BYTE* match = oLitEnd - sequence.offset;
+
+    /* check */
+    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+    if (oLitEnd <= oend_w) return ERROR(GENERIC);   /* Precondition */
+
+    /* copy literals */
+    if (op < oend_w) {
+        ZSTD_wildcopy(op, *litPtr, oend_w - op);
+        *litPtr += oend_w - op;
+        op = oend_w;
+    }
+    while (op < oLitEnd) *op++ = *(*litPtr)++;
+
+    /* copy Match */
+    if (sequence.offset > (size_t)(oLitEnd - base)) {
+        /* offset beyond prefix */
+        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+        match = dictEnd - (base-match);
+        if (match + sequence.matchLength <= dictEnd) {
+            memmove(oLitEnd, match, sequence.matchLength);
+            return sequenceLength;
+        }
+        /* span extDict & currentPrefixSegment */
+        {   size_t const length1 = dictEnd - match;
+            memmove(oLitEnd, match, length1);
+            op = oLitEnd + length1;
+            sequence.matchLength -= length1;
+            match = base;
+    }   }
+    while (op < oMatchEnd) *op++ = *match++;
+    return sequenceLength;
+}
+
+
+
+
+static seq_t ZSTD_decodeSequence(seqState_t* seqState)
+{
+    seq_t seq;
+
+    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
+    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
+    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
+
+    U32 const llBits = LL_bits[llCode];
+    U32 const mlBits = ML_bits[mlCode];
+    U32 const ofBits = ofCode;
+    U32 const totalBits = llBits+mlBits+ofBits;
+
+    static const U32 LL_base[MaxLL+1] = {
+                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
+                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+                            0x2000, 0x4000, 0x8000, 0x10000 };
+
+    static const U32 ML_base[MaxML+1] = {
+                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
+                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
+                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
+
+    static const U32 OF_base[MaxOff+1] = {
+                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+
+    /* sequence */
+    {   size_t offset;
+        if (!ofCode)
+            offset = 0;
+        else {
+            offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
+            if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
+        }
+
+        if (ofCode <= 1) {
+            offset += (llCode==0);
+            if (offset) {
+                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
+                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
+                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
+                seqState->prevOffset[1] = seqState->prevOffset[0];
+                seqState->prevOffset[0] = offset = temp;
+            } else {
+                offset = seqState->prevOffset[0];
+            }
+        } else {
+            seqState->prevOffset[2] = seqState->prevOffset[1];
+            seqState->prevOffset[1] = seqState->prevOffset[0];
+            seqState->prevOffset[0] = offset;
+        }
+        seq.offset = offset;
+    }
+
+    seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
+    if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
+
+    seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
+    if (MEM_32bits() ||
+       (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
+
+    /* ANS state update */
+    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
+    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
+    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
+
+    return seq;
+}
+
+
+FORCE_INLINE
+size_t ZSTD_execSequence(BYTE* op,
+                         BYTE* const oend, seq_t sequence,
+                         const BYTE** litPtr, const BYTE* const litLimit,
+                         const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+{
+    BYTE* const oLitEnd = op + sequence.litLength;
+    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+    const BYTE* match = oLitEnd - sequence.offset;
+
+    /* check */
+    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+    if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
+
+    /* copy Literals */
+    ZSTD_copy8(op, *litPtr);
+    if (sequence.litLength > 8)
+        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
+    op = oLitEnd;
+    *litPtr = iLitEnd;   /* update for next sequence */
+
+    /* copy Match */
+    if (sequence.offset > (size_t)(oLitEnd - base)) {
+        /* offset beyond prefix */
+        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+        match = dictEnd + (match - base);
+        if (match + sequence.matchLength <= dictEnd) {
+            memmove(oLitEnd, match, sequence.matchLength);
+            return sequenceLength;
+        }
+        /* span extDict & currentPrefixSegment */
+        {   size_t const length1 = dictEnd - match;
+            memmove(oLitEnd, match, length1);
+            op = oLitEnd + length1;
+            sequence.matchLength -= length1;
+            match = base;
+            if (op > oend_w || sequence.matchLength < MINMATCH) {
+              U32 i;
+              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
+              return sequenceLength;
+            }
+    }   }
+    /* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
+
+    /* match within prefix */
+    if (sequence.offset < 8) {
+        /* close range match, overlap */
+        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
+        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
+        int const sub2 = dec64table[sequence.offset];
+        op[0] = match[0];
+        op[1] = match[1];
+        op[2] = match[2];
+        op[3] = match[3];
+        match += dec32table[sequence.offset];
+        ZSTD_copy4(op+4, match);
+        match -= sub2;
+    } else {
+        ZSTD_copy8(op, match);
+    }
+    op += 8; match += 8;
+
+    if (oMatchEnd > oend-(16-MINMATCH)) {
+        if (op < oend_w) {
+            ZSTD_wildcopy(op, match, oend_w - op);
+            match += oend_w - op;
+            op = oend_w;
+        }
+        while (op < oMatchEnd) *op++ = *match++;
+    } else {
+        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
+    }
+    return sequenceLength;
+}
+
+
+static size_t ZSTD_decompressSequences(
+                               ZSTD_DCtx* dctx,
+                               void* dst, size_t maxDstSize,
+                         const void* seqStart, size_t seqSize)
+{
+    const BYTE* ip = (const BYTE*)seqStart;
+    const BYTE* const iend = ip + seqSize;
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = ostart + maxDstSize;
+    BYTE* op = ostart;
+    const BYTE* litPtr = dctx->litPtr;
+    const BYTE* const litEnd = litPtr + dctx->litSize;
+    const BYTE* const base = (const BYTE*) (dctx->base);
+    const BYTE* const vBase = (const BYTE*) (dctx->vBase);
+    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+    int nbSeq;
+
+    /* Build Decoding Tables */
+    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
+        if (ZSTD_isError(seqHSize)) return seqHSize;
+        ip += seqHSize;
+    }
+
+    /* Regen sequences */
+    if (nbSeq) {
+        seqState_t seqState;
+        dctx->fseEntropy = 1;
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
+        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+
+        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq ; ) {
+            nbSeq--;
+            {   seq_t const sequence = ZSTD_decodeSequence(&seqState);
+                size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
+                if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+                op += oneSeqSize;
+        }   }
+
+        /* check if reached exact end */
+        if (nbSeq) return ERROR(corruption_detected);
+        /* save reps for next block */
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+    }
+
+    /* last literal segment */
+    {   size_t const lastLLSize = litEnd - litPtr;
+        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
+        memcpy(op, litPtr, lastLLSize);
+        op += lastLLSize;
+    }
+
+    return op-ostart;
+}
+
+
+FORCE_INLINE seq_t ZSTD_decodeSequenceLong_generic(seqState_t* seqState, int const longOffsets)
+{
+    seq_t seq;
+
+    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
+    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
+    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
+
+    U32 const llBits = LL_bits[llCode];
+    U32 const mlBits = ML_bits[mlCode];
+    U32 const ofBits = ofCode;
+    U32 const totalBits = llBits+mlBits+ofBits;
+
+    static const U32 LL_base[MaxLL+1] = {
+                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
+                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+                            0x2000, 0x4000, 0x8000, 0x10000 };
+
+    static const U32 ML_base[MaxML+1] = {
+                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
+                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
+                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
+
+    static const U32 OF_base[MaxOff+1] = {
+                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+
+    /* sequence */
+    {   size_t offset;
+        if (!ofCode)
+            offset = 0;
+        else {
+            if (longOffsets) {
+                int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN);
+                offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
+                if (MEM_32bits() || extraBits) BIT_reloadDStream(&seqState->DStream);
+                if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
+            } else {
+                offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
+                if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
+            }
+        }
+
+        if (ofCode <= 1) {
+            offset += (llCode==0);
+            if (offset) {
+                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
+                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
+                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
+                seqState->prevOffset[1] = seqState->prevOffset[0];
+                seqState->prevOffset[0] = offset = temp;
+            } else {
+                offset = seqState->prevOffset[0];
+            }
+        } else {
+            seqState->prevOffset[2] = seqState->prevOffset[1];
+            seqState->prevOffset[1] = seqState->prevOffset[0];
+            seqState->prevOffset[0] = offset;
+        }
+        seq.offset = offset;
+    }
+
+    seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
+    if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
+
+    seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
+    if (MEM_32bits() ||
+       (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
+
+    {   size_t const pos = seqState->pos + seq.litLength;
+        seq.match = seqState->base + pos - seq.offset;    /* single memory segment */
+        if (seq.offset > pos) seq.match += seqState->gotoDict;   /* separate memory segment */
+        seqState->pos = pos + seq.matchLength;
+    }
+
+    /* ANS state update */
+    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
+    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
+    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
+
+    return seq;
+}
+
+static seq_t ZSTD_decodeSequenceLong(seqState_t* seqState, unsigned const windowSize) {
+    if (ZSTD_highbit32(windowSize) > STREAM_ACCUMULATOR_MIN) {
+        return ZSTD_decodeSequenceLong_generic(seqState, 1);
+    } else {
+        return ZSTD_decodeSequenceLong_generic(seqState, 0);
+    }
+}
+
+FORCE_INLINE
+size_t ZSTD_execSequenceLong(BYTE* op,
+                                BYTE* const oend, seq_t sequence,
+                                const BYTE** litPtr, const BYTE* const litLimit,
+                                const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+{
+    BYTE* const oLitEnd = op + sequence.litLength;
+    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+    const BYTE* match = sequence.match;
+
+    /* check */
+#if 1
+    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+    if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
+#endif
+
+    /* copy Literals */
+    ZSTD_copy8(op, *litPtr);
+    if (sequence.litLength > 8)
+        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
+    op = oLitEnd;
+    *litPtr = iLitEnd;   /* update for next sequence */
+
+    /* copy Match */
+#if 1
+    if (sequence.offset > (size_t)(oLitEnd - base)) {
+        /* offset beyond prefix */
+        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+        if (match + sequence.matchLength <= dictEnd) {
+            memmove(oLitEnd, match, sequence.matchLength);
+            return sequenceLength;
+        }
+        /* span extDict & currentPrefixSegment */
+        {   size_t const length1 = dictEnd - match;
+            memmove(oLitEnd, match, length1);
+            op = oLitEnd + length1;
+            sequence.matchLength -= length1;
+            match = base;
+            if (op > oend_w || sequence.matchLength < MINMATCH) {
+              U32 i;
+              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
+              return sequenceLength;
+            }
+    }   }
+    /* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
+#endif
+
+    /* match within prefix */
+    if (sequence.offset < 8) {
+        /* close range match, overlap */
+        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
+        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
+        int const sub2 = dec64table[sequence.offset];
+        op[0] = match[0];
+        op[1] = match[1];
+        op[2] = match[2];
+        op[3] = match[3];
+        match += dec32table[sequence.offset];
+        ZSTD_copy4(op+4, match);
+        match -= sub2;
+    } else {
+        ZSTD_copy8(op, match);
+    }
+    op += 8; match += 8;
+
+    if (oMatchEnd > oend-(16-MINMATCH)) {
+        if (op < oend_w) {
+            ZSTD_wildcopy(op, match, oend_w - op);
+            match += oend_w - op;
+            op = oend_w;
+        }
+        while (op < oMatchEnd) *op++ = *match++;
+    } else {
+        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
+    }
+    return sequenceLength;
+}
+
+static size_t ZSTD_decompressSequencesLong(
+                               ZSTD_DCtx* dctx,
+                               void* dst, size_t maxDstSize,
+                         const void* seqStart, size_t seqSize)
+{
+    const BYTE* ip = (const BYTE*)seqStart;
+    const BYTE* const iend = ip + seqSize;
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = ostart + maxDstSize;
+    BYTE* op = ostart;
+    const BYTE* litPtr = dctx->litPtr;
+    const BYTE* const litEnd = litPtr + dctx->litSize;
+    const BYTE* const base = (const BYTE*) (dctx->base);
+    const BYTE* const vBase = (const BYTE*) (dctx->vBase);
+    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+    unsigned const windowSize = dctx->fParams.windowSize;
+    int nbSeq;
+
+    /* Build Decoding Tables */
+    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
+        if (ZSTD_isError(seqHSize)) return seqHSize;
+        ip += seqHSize;
+    }
+
+    /* Regen sequences */
+    if (nbSeq) {
+#define STORED_SEQS 4
+#define STOSEQ_MASK (STORED_SEQS-1)
+#define ADVANCED_SEQS 4
+        seq_t sequences[STORED_SEQS];
+        int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
+        seqState_t seqState;
+        int seqNb;
+        dctx->fseEntropy = 1;
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+        seqState.base = base;
+        seqState.pos = (size_t)(op-base);
+        seqState.gotoDict = (uPtrDiff)dictEnd - (uPtrDiff)base; /* cast to avoid undefined behaviour */
+        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
+        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+
+        /* prepare in advance */
+        for (seqNb=0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNb<seqAdvance; seqNb++) {
+            sequences[seqNb] = ZSTD_decodeSequenceLong(&seqState, windowSize);
+        }
+        if (seqNb<seqAdvance) return ERROR(corruption_detected);
+
+        /* decode and decompress */
+        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && seqNb<nbSeq ; seqNb++) {
+            seq_t const sequence = ZSTD_decodeSequenceLong(&seqState, windowSize);
+            size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[(seqNb-ADVANCED_SEQS) & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
+            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+            ZSTD_PREFETCH(sequence.match);
+            sequences[seqNb&STOSEQ_MASK] = sequence;
+            op += oneSeqSize;
+        }
+        if (seqNb<nbSeq) return ERROR(corruption_detected);
+
+        /* finish queue */
+        seqNb -= seqAdvance;
+        for ( ; seqNb<nbSeq ; seqNb++) {
+            size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[seqNb&STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
+            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+            op += oneSeqSize;
+        }
+
+        /* save reps for next block */
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+    }
+
+    /* last literal segment */
+    {   size_t const lastLLSize = litEnd - litPtr;
+        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
+        memcpy(op, litPtr, lastLLSize);
+        op += lastLLSize;
+    }
+
+    return op-ostart;
+}
+
+
+static size_t ZSTD_decompressBlock_internal(ZSTD_DCtx* dctx,
+                            void* dst, size_t dstCapacity,
+                      const void* src, size_t srcSize)
+{   /* blockType == blockCompressed */
+    const BYTE* ip = (const BYTE*)src;
+
+    if (srcSize >= ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(srcSize_wrong);
+
+    /* Decode literals section */
+    {   size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
+        if (ZSTD_isError(litCSize)) return litCSize;
+        ip += litCSize;
+        srcSize -= litCSize;
+    }
+    if (sizeof(size_t) > 4)  /* do not enable prefetching on 32-bits x86, as it's performance detrimental */
+                             /* likely because of register pressure */
+                             /* if that's the correct cause, then 32-bits ARM should be affected differently */
+                             /* it would be good to test this on ARM real hardware, to see if prefetch version improves speed */
+        if (dctx->fParams.windowSize > (1<<23))
+            return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize);
+    return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize);
+}
+
+
+static void ZSTD_checkContinuity(ZSTD_DCtx* dctx, const void* dst)
+{
+    if (dst != dctx->previousDstEnd) {   /* not contiguous */
+        dctx->dictEnd = dctx->previousDstEnd;
+        dctx->vBase = (const char*)dst - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
+        dctx->base = dst;
+        dctx->previousDstEnd = dst;
+    }
+}
+
+size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx,
+                            void* dst, size_t dstCapacity,
+                      const void* src, size_t srcSize)
+{
+    size_t dSize;
+    ZSTD_checkContinuity(dctx, dst);
+    dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
+    dctx->previousDstEnd = (char*)dst + dSize;
+    return dSize;
+}
+
+
+/** ZSTD_insertBlock() :
+    insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
+ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
+{
+    ZSTD_checkContinuity(dctx, blockStart);
+    dctx->previousDstEnd = (const char*)blockStart + blockSize;
+    return blockSize;
+}
+
+
+size_t ZSTD_generateNxBytes(void* dst, size_t dstCapacity, BYTE byte, size_t length)
+{
+    if (length > dstCapacity) return ERROR(dstSize_tooSmall);
+    memset(dst, byte, length);
+    return length;
+}
+
+/** ZSTD_findFrameCompressedSize() :
+ *  compatible with legacy mode
+ *  `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable frame
+ *  `srcSize` must be at least as large as the frame contained
+ *  @return : the compressed size of the frame starting at `src` */
+size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
+{
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(src, srcSize)) return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
+#endif
+    if (srcSize >= ZSTD_skippableHeaderSize &&
+            (MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+        return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + 4);
+    } else {
+        const BYTE* ip = (const BYTE*)src;
+        const BYTE* const ipstart = ip;
+        size_t remainingSize = srcSize;
+        ZSTD_frameParams fParams;
+
+        size_t const headerSize = ZSTD_frameHeaderSize(ip, remainingSize);
+        if (ZSTD_isError(headerSize)) return headerSize;
+
+        /* Frame Header */
+        {   size_t const ret = ZSTD_getFrameParams(&fParams, ip, remainingSize);
+            if (ZSTD_isError(ret)) return ret;
+            if (ret > 0) return ERROR(srcSize_wrong);
+        }
+
+        ip += headerSize;
+        remainingSize -= headerSize;
+
+        /* Loop on each block */
+        while (1) {
+            blockProperties_t blockProperties;
+            size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
+            if (ZSTD_isError(cBlockSize)) return cBlockSize;
+
+            if (ZSTD_blockHeaderSize + cBlockSize > remainingSize) return ERROR(srcSize_wrong);
+
+            ip += ZSTD_blockHeaderSize + cBlockSize;
+            remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
+
+            if (blockProperties.lastBlock) break;
+        }
+
+        if (fParams.checksumFlag) {   /* Frame content checksum */
+            if (remainingSize < 4) return ERROR(srcSize_wrong);
+            ip += 4;
+            remainingSize -= 4;
+        }
+
+        return ip - ipstart;
+    }
+}
+
+/*! ZSTD_decompressFrame() :
+*   @dctx must be properly initialized */
+static size_t ZSTD_decompressFrame(ZSTD_DCtx* dctx,
+                                 void* dst, size_t dstCapacity,
+                                 const void** srcPtr, size_t *srcSizePtr)
+{
+    const BYTE* ip = (const BYTE*)(*srcPtr);
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart;
+    size_t remainingSize = *srcSizePtr;
+
+    /* check */
+    if (remainingSize < ZSTD_frameHeaderSize_min+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+
+    /* Frame Header */
+    {   size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
+        if (ZSTD_isError(frameHeaderSize)) return frameHeaderSize;
+        if (remainingSize < frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+        CHECK_F(ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize));
+        ip += frameHeaderSize; remainingSize -= frameHeaderSize;
+    }
+
+    /* Loop on each block */
+    while (1) {
+        size_t decodedSize;
+        blockProperties_t blockProperties;
+        size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
+        if (ZSTD_isError(cBlockSize)) return cBlockSize;
+
+        ip += ZSTD_blockHeaderSize;
+        remainingSize -= ZSTD_blockHeaderSize;
+        if (cBlockSize > remainingSize) return ERROR(srcSize_wrong);
+
+        switch(blockProperties.blockType)
+        {
+        case bt_compressed:
+            decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend-op, ip, cBlockSize);
+            break;
+        case bt_raw :
+            decodedSize = ZSTD_copyRawBlock(op, oend-op, ip, cBlockSize);
+            break;
+        case bt_rle :
+            decodedSize = ZSTD_generateNxBytes(op, oend-op, *ip, blockProperties.origSize);
+            break;
+        case bt_reserved :
+        default:
+            return ERROR(corruption_detected);
+        }
+
+        if (ZSTD_isError(decodedSize)) return decodedSize;
+        if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, op, decodedSize);
+        op += decodedSize;
+        ip += cBlockSize;
+        remainingSize -= cBlockSize;
+        if (blockProperties.lastBlock) break;
+    }
+
+    if (dctx->fParams.checksumFlag) {   /* Frame content checksum verification */
+        U32 const checkCalc = (U32)XXH64_digest(&dctx->xxhState);
+        U32 checkRead;
+        if (remainingSize<4) return ERROR(checksum_wrong);
+        checkRead = MEM_readLE32(ip);
+        if (checkRead != checkCalc) return ERROR(checksum_wrong);
+        ip += 4;
+        remainingSize -= 4;
+    }
+
+    /* Allow caller to get size read */
+    *srcPtr = ip;
+    *srcSizePtr = remainingSize;
+    return op-ostart;
+}
+
+static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict);
+static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict);
+
+static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
+                                        void* dst, size_t dstCapacity,
+                                  const void* src, size_t srcSize,
+                                  const void *dict, size_t dictSize,
+                                  const ZSTD_DDict* ddict)
+{
+    void* const dststart = dst;
+
+    if (ddict) {
+        if (dict) {
+            /* programmer error, these two cases should be mutually exclusive */
+            return ERROR(GENERIC);
+        }
+
+        dict = ZSTD_DDictDictContent(ddict);
+        dictSize = ZSTD_DDictDictSize(ddict);
+    }
+
+    while (srcSize >= ZSTD_frameHeaderSize_prefix) {
+        U32 magicNumber;
+
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+        if (ZSTD_isLegacy(src, srcSize)) {
+            size_t decodedSize;
+            size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
+            if (ZSTD_isError(frameSize)) return frameSize;
+
+            decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
+
+            dst = (BYTE*)dst + decodedSize;
+            dstCapacity -= decodedSize;
+
+            src = (const BYTE*)src + frameSize;
+            srcSize -= frameSize;
+
+            continue;
+        }
+#endif
+
+        magicNumber = MEM_readLE32(src);
+        if (magicNumber != ZSTD_MAGICNUMBER) {
+            if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+                size_t skippableSize;
+                if (srcSize < ZSTD_skippableHeaderSize)
+                    return ERROR(srcSize_wrong);
+                skippableSize = MEM_readLE32((const BYTE *)src + 4) +
+                                ZSTD_skippableHeaderSize;
+                if (srcSize < skippableSize) {
+                    return ERROR(srcSize_wrong);
+                }
+
+                src = (const BYTE *)src + skippableSize;
+                srcSize -= skippableSize;
+                continue;
+            } else {
+                return ERROR(prefix_unknown);
+            }
+        }
+
+        if (ddict) {
+            /* we were called from ZSTD_decompress_usingDDict */
+            ZSTD_refDDict(dctx, ddict);
+        } else {
+            /* this will initialize correctly with no dict if dict == NULL, so
+             * use this in all cases but ddict */
+            CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
+        }
+        ZSTD_checkContinuity(dctx, dst);
+
+        {   const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity,
+                                                    &src, &srcSize);
+            if (ZSTD_isError(res)) return res;
+            /* don't need to bounds check this, ZSTD_decompressFrame will have
+             * already */
+            dst = (BYTE*)dst + res;
+            dstCapacity -= res;
+        }
+    }
+
+    if (srcSize) return ERROR(srcSize_wrong); /* input not entirely consumed */
+
+    return (BYTE*)dst - (BYTE*)dststart;
+}
+
+size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
+                                 void* dst, size_t dstCapacity,
+                           const void* src, size_t srcSize,
+                           const void* dict, size_t dictSize)
+{
+    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
+}
+
+
+size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
+}
+
+
+size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+#if defined(ZSTD_HEAPMODE) && (ZSTD_HEAPMODE==1)
+    size_t regenSize;
+    ZSTD_DCtx* const dctx = ZSTD_createDCtx();
+    if (dctx==NULL) return ERROR(memory_allocation);
+    regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
+    ZSTD_freeDCtx(dctx);
+    return regenSize;
+#else   /* stack mode */
+    ZSTD_DCtx dctx;
+    return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
+#endif
+}
+
+
+/*-**************************************
+*   Advanced Streaming Decompression API
+*   Bufferless and synchronous
+****************************************/
+size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx) { return dctx->expected; }
+
+ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx) {
+    switch(dctx->stage)
+    {
+    default:   /* should not happen */
+    case ZSTDds_getFrameHeaderSize:
+    case ZSTDds_decodeFrameHeader:
+        return ZSTDnit_frameHeader;
+    case ZSTDds_decodeBlockHeader:
+        return ZSTDnit_blockHeader;
+    case ZSTDds_decompressBlock:
+        return ZSTDnit_block;
+    case ZSTDds_decompressLastBlock:
+        return ZSTDnit_lastBlock;
+    case ZSTDds_checkChecksum:
+        return ZSTDnit_checksum;
+    case ZSTDds_decodeSkippableHeader:
+    case ZSTDds_skipFrame:
+        return ZSTDnit_skippableFrame;
+    }
+}
+
+int ZSTD_isSkipFrame(ZSTD_DCtx* dctx) { return dctx->stage == ZSTDds_skipFrame; }   /* for zbuff */
+
+/** ZSTD_decompressContinue() :
+*   @return : nb of bytes generated into `dst` (necessarily <= `dstCapacity)
+*             or an error code, which can be tested using ZSTD_isError() */
+size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    /* Sanity check */
+    if (srcSize != dctx->expected) return ERROR(srcSize_wrong);
+    if (dstCapacity) ZSTD_checkContinuity(dctx, dst);
+
+    switch (dctx->stage)
+    {
+    case ZSTDds_getFrameHeaderSize :
+        if (srcSize != ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);      /* impossible */
+        if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {        /* skippable frame */
+            memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
+            dctx->expected = ZSTD_skippableHeaderSize - ZSTD_frameHeaderSize_prefix;  /* magic number + skippable frame length */
+            dctx->stage = ZSTDds_decodeSkippableHeader;
+            return 0;
+        }
+        dctx->headerSize = ZSTD_frameHeaderSize(src, ZSTD_frameHeaderSize_prefix);
+        if (ZSTD_isError(dctx->headerSize)) return dctx->headerSize;
+        memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
+        if (dctx->headerSize > ZSTD_frameHeaderSize_prefix) {
+            dctx->expected = dctx->headerSize - ZSTD_frameHeaderSize_prefix;
+            dctx->stage = ZSTDds_decodeFrameHeader;
+            return 0;
+        }
+        dctx->expected = 0;   /* not necessary to copy more */
+
+    case ZSTDds_decodeFrameHeader:
+        memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
+        CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
+        dctx->expected = ZSTD_blockHeaderSize;
+        dctx->stage = ZSTDds_decodeBlockHeader;
+        return 0;
+
+    case ZSTDds_decodeBlockHeader:
+        {   blockProperties_t bp;
+            size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
+            if (ZSTD_isError(cBlockSize)) return cBlockSize;
+            dctx->expected = cBlockSize;
+            dctx->bType = bp.blockType;
+            dctx->rleSize = bp.origSize;
+            if (cBlockSize) {
+                dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
+                return 0;
+            }
+            /* empty block */
+            if (bp.lastBlock) {
+                if (dctx->fParams.checksumFlag) {
+                    dctx->expected = 4;
+                    dctx->stage = ZSTDds_checkChecksum;
+                } else {
+                    dctx->expected = 0; /* end of frame */
+                    dctx->stage = ZSTDds_getFrameHeaderSize;
+                }
+            } else {
+                dctx->expected = 3;  /* go directly to next header */
+                dctx->stage = ZSTDds_decodeBlockHeader;
+            }
+            return 0;
+        }
+    case ZSTDds_decompressLastBlock:
+    case ZSTDds_decompressBlock:
+        {   size_t rSize;
+            switch(dctx->bType)
+            {
+            case bt_compressed:
+                rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
+                break;
+            case bt_raw :
+                rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize);
+                break;
+            case bt_rle :
+                rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize);
+                break;
+            case bt_reserved :   /* should never happen */
+            default:
+                return ERROR(corruption_detected);
+            }
+            if (ZSTD_isError(rSize)) return rSize;
+            if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, dst, rSize);
+
+            if (dctx->stage == ZSTDds_decompressLastBlock) {   /* end of frame */
+                if (dctx->fParams.checksumFlag) {  /* another round for frame checksum */
+                    dctx->expected = 4;
+                    dctx->stage = ZSTDds_checkChecksum;
+                } else {
+                    dctx->expected = 0;   /* ends here */
+                    dctx->stage = ZSTDds_getFrameHeaderSize;
+                }
+            } else {
+                dctx->stage = ZSTDds_decodeBlockHeader;
+                dctx->expected = ZSTD_blockHeaderSize;
+                dctx->previousDstEnd = (char*)dst + rSize;
+            }
+            return rSize;
+        }
+    case ZSTDds_checkChecksum:
+        {   U32 const h32 = (U32)XXH64_digest(&dctx->xxhState);
+            U32 const check32 = MEM_readLE32(src);   /* srcSize == 4, guaranteed by dctx->expected */
+            if (check32 != h32) return ERROR(checksum_wrong);
+            dctx->expected = 0;
+            dctx->stage = ZSTDds_getFrameHeaderSize;
+            return 0;
+        }
+    case ZSTDds_decodeSkippableHeader:
+        {   memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
+            dctx->expected = MEM_readLE32(dctx->headerBuffer + 4);
+            dctx->stage = ZSTDds_skipFrame;
+            return 0;
+        }
+    case ZSTDds_skipFrame:
+        {   dctx->expected = 0;
+            dctx->stage = ZSTDds_getFrameHeaderSize;
+            return 0;
+        }
+    default:
+        return ERROR(GENERIC);   /* impossible */
+    }
+}
+
+
+static size_t ZSTD_refDictContent(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    dctx->dictEnd = dctx->previousDstEnd;
+    dctx->vBase = (const char*)dict - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
+    dctx->base = dict;
+    dctx->previousDstEnd = (const char*)dict + dictSize;
+    return 0;
+}
+
+/* ZSTD_loadEntropy() :
+ * dict : must point at beginning of a valid zstd dictionary
+ * @return : size of entropy tables read */
+static size_t ZSTD_loadEntropy(ZSTD_entropyTables_t* entropy, const void* const dict, size_t const dictSize)
+{
+    const BYTE* dictPtr = (const BYTE*)dict;
+    const BYTE* const dictEnd = dictPtr + dictSize;
+
+    if (dictSize <= 8) return ERROR(dictionary_corrupted);
+    dictPtr += 8;   /* skip header = magic + dictID */
+
+
+    {   size_t const hSize = HUF_readDTableX4(entropy->hufTable, dictPtr, dictEnd-dictPtr);
+        if (HUF_isError(hSize)) return ERROR(dictionary_corrupted);
+        dictPtr += hSize;
+    }
+
+    {   short offcodeNCount[MaxOff+1];
+        U32 offcodeMaxValue = MaxOff, offcodeLog;
+        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
+        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
+        CHECK_E(FSE_buildDTable(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog), dictionary_corrupted);
+        dictPtr += offcodeHeaderSize;
+    }
+
+    {   short matchlengthNCount[MaxML+1];
+        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
+        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
+        CHECK_E(FSE_buildDTable(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog), dictionary_corrupted);
+        dictPtr += matchlengthHeaderSize;
+    }
+
+    {   short litlengthNCount[MaxLL+1];
+        unsigned litlengthMaxValue = MaxLL, litlengthLog;
+        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
+        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
+        CHECK_E(FSE_buildDTable(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog), dictionary_corrupted);
+        dictPtr += litlengthHeaderSize;
+    }
+
+    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
+    {   int i;
+        size_t const dictContentSize = (size_t)(dictEnd - (dictPtr+12));
+        for (i=0; i<3; i++) {
+            U32 const rep = MEM_readLE32(dictPtr); dictPtr += 4;
+            if (rep==0 || rep >= dictContentSize) return ERROR(dictionary_corrupted);
+            entropy->rep[i] = rep;
+    }   }
+
+    return dictPtr - (const BYTE*)dict;
+}
+
+static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    if (dictSize < 8) return ZSTD_refDictContent(dctx, dict, dictSize);
+    {   U32 const magic = MEM_readLE32(dict);
+        if (magic != ZSTD_DICT_MAGIC) {
+            return ZSTD_refDictContent(dctx, dict, dictSize);   /* pure content mode */
+    }   }
+    dctx->dictID = MEM_readLE32((const char*)dict + 4);
+
+    /* load entropy tables */
+    {   size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
+        if (ZSTD_isError(eSize)) return ERROR(dictionary_corrupted);
+        dict = (const char*)dict + eSize;
+        dictSize -= eSize;
+    }
+    dctx->litEntropy = dctx->fseEntropy = 1;
+
+    /* reference dictionary content */
+    return ZSTD_refDictContent(dctx, dict, dictSize);
+}
+
+size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    CHECK_F(ZSTD_decompressBegin(dctx));
+    if (dict && dictSize) CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
+    return 0;
+}
+
+
+/* ======   ZSTD_DDict   ====== */
+
+struct ZSTD_DDict_s {
+    void* dictBuffer;
+    const void* dictContent;
+    size_t dictSize;
+    ZSTD_entropyTables_t entropy;
+    U32 dictID;
+    U32 entropyPresent;
+    ZSTD_customMem cMem;
+};  /* typedef'd to ZSTD_DDict within "zstd.h" */
+
+static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict)
+{
+    return ddict->dictContent;
+}
+
+static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict)
+{
+    return ddict->dictSize;
+}
+
+static void ZSTD_refDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict)
+{
+    ZSTD_decompressBegin(dstDCtx);  /* init */
+    if (ddict) {   /* support refDDict on NULL */
+        dstDCtx->dictID = ddict->dictID;
+        dstDCtx->base = ddict->dictContent;
+        dstDCtx->vBase = ddict->dictContent;
+        dstDCtx->dictEnd = (const BYTE*)ddict->dictContent + ddict->dictSize;
+        dstDCtx->previousDstEnd = dstDCtx->dictEnd;
+        if (ddict->entropyPresent) {
+            dstDCtx->litEntropy = 1;
+            dstDCtx->fseEntropy = 1;
+            dstDCtx->LLTptr = ddict->entropy.LLTable;
+            dstDCtx->MLTptr = ddict->entropy.MLTable;
+            dstDCtx->OFTptr = ddict->entropy.OFTable;
+            dstDCtx->HUFptr = ddict->entropy.hufTable;
+            dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
+            dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
+            dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
+        } else {
+            dstDCtx->litEntropy = 0;
+            dstDCtx->fseEntropy = 0;
+        }
+    }
+}
+
+static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict* ddict)
+{
+    ddict->dictID = 0;
+    ddict->entropyPresent = 0;
+    if (ddict->dictSize < 8) return 0;
+    {   U32 const magic = MEM_readLE32(ddict->dictContent);
+        if (magic != ZSTD_DICT_MAGIC) return 0;   /* pure content mode */
+    }
+    ddict->dictID = MEM_readLE32((const char*)ddict->dictContent + 4);
+
+    /* load entropy tables */
+    CHECK_E( ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted );
+    ddict->entropyPresent = 1;
+    return 0;
+}
+
+
+ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
+{
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    {   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
+        if (!ddict) return NULL;
+        ddict->cMem = customMem;
+
+        if ((byReference) || (!dict) || (!dictSize)) {
+            ddict->dictBuffer = NULL;
+            ddict->dictContent = dict;
+        } else {
+            void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
+            if (!internalBuffer) { ZSTD_freeDDict(ddict); return NULL; }
+            memcpy(internalBuffer, dict, dictSize);
+            ddict->dictBuffer = internalBuffer;
+            ddict->dictContent = internalBuffer;
+        }
+        ddict->dictSize = dictSize;
+        ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+        /* parse dictionary content */
+        {   size_t const errorCode = ZSTD_loadEntropy_inDDict(ddict);
+            if (ZSTD_isError(errorCode)) {
+                ZSTD_freeDDict(ddict);
+                return NULL;
+        }   }
+
+        return ddict;
+    }
+}
+
+/*! ZSTD_createDDict() :
+*   Create a digested dictionary, to start decompression without startup delay.
+*   `dict` content is copied inside DDict.
+*   Consequently, `dict` can be released after `ZSTD_DDict` creation */
+ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    return ZSTD_createDDict_advanced(dict, dictSize, 0, allocator);
+}
+
+
+/*! ZSTD_createDDict_byReference() :
+ *  Create a digested dictionary, to start decompression without startup delay.
+ *  Dictionary content is simply referenced, it will be accessed during decompression.
+ *  Warning : dictBuffer must outlive DDict (DDict must be freed before dictBuffer) */
+ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    return ZSTD_createDDict_advanced(dictBuffer, dictSize, 1, allocator);
+}
+
+
+size_t ZSTD_freeDDict(ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;   /* support free on NULL */
+    {   ZSTD_customMem const cMem = ddict->cMem;
+        ZSTD_free(ddict->dictBuffer, cMem);
+        ZSTD_free(ddict, cMem);
+        return 0;
+    }
+}
+
+size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;   /* support sizeof on NULL */
+    return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
+}
+
+/*! ZSTD_getDictID_fromDict() :
+ *  Provides the dictID stored within dictionary.
+ *  if @return == 0, the dictionary is not conformant with Zstandard specification.
+ *  It can still be loaded, but as a content-only dictionary. */
+unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize)
+{
+    if (dictSize < 8) return 0;
+    if (MEM_readLE32(dict) != ZSTD_DICT_MAGIC) return 0;
+    return MEM_readLE32((const char*)dict + 4);
+}
+
+/*! ZSTD_getDictID_fromDDict() :
+ *  Provides the dictID of the dictionary loaded into `ddict`.
+ *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
+ *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
+unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;
+    return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
+}
+
+/*! ZSTD_getDictID_fromFrame() :
+ *  Provides the dictID required to decompressed the frame stored within `src`.
+ *  If @return == 0, the dictID could not be decoded.
+ *  This could for one of the following reasons :
+ *  - The frame does not require a dictionary to be decoded (most common case).
+ *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
+ *    Note : this use case also happens when using a non-conformant dictionary.
+ *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
+ *  - This is not a Zstandard frame.
+ *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
+unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
+{
+    ZSTD_frameParams zfp = { 0 , 0 , 0 , 0 };
+    size_t const hError = ZSTD_getFrameParams(&zfp, src, srcSize);
+    if (ZSTD_isError(hError)) return 0;
+    return zfp.dictID;
+}
+
+
+/*! ZSTD_decompress_usingDDict() :
+*   Decompression using a pre-digested Dictionary
+*   Use dictionary without significant overhead. */
+size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
+                                  void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                            const ZSTD_DDict* ddict)
+{
+    /* pass content and size in case legacy frames are encountered */
+    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize,
+                                     NULL, 0,
+                                     ddict);
+}
+
+
+/*=====================================
+*   Streaming decompression
+*====================================*/
+
+typedef enum { zdss_init, zdss_loadHeader,
+               zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
+
+/* *** Resource management *** */
+struct ZSTD_DStream_s {
+    ZSTD_DCtx* dctx;
+    ZSTD_DDict* ddictLocal;
+    const ZSTD_DDict* ddict;
+    ZSTD_frameParams fParams;
+    ZSTD_dStreamStage stage;
+    char*  inBuff;
+    size_t inBuffSize;
+    size_t inPos;
+    size_t maxWindowSize;
+    char*  outBuff;
+    size_t outBuffSize;
+    size_t outStart;
+    size_t outEnd;
+    size_t blockSize;
+    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];   /* tmp buffer to store frame header */
+    size_t lhSize;
+    ZSTD_customMem customMem;
+    void* legacyContext;
+    U32 previousLegacyVersion;
+    U32 legacyVersion;
+    U32 hostageByte;
+};   /* typedef'd to ZSTD_DStream within "zstd.h" */
+
+
+ZSTD_DStream* ZSTD_createDStream(void)
+{
+    return ZSTD_createDStream_advanced(defaultCustomMem);
+}
+
+ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
+{
+    ZSTD_DStream* zds;
+
+    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+
+    zds = (ZSTD_DStream*) ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
+    if (zds==NULL) return NULL;
+    memset(zds, 0, sizeof(ZSTD_DStream));
+    memcpy(&zds->customMem, &customMem, sizeof(ZSTD_customMem));
+    zds->dctx = ZSTD_createDCtx_advanced(customMem);
+    if (zds->dctx == NULL) { ZSTD_freeDStream(zds); return NULL; }
+    zds->stage = zdss_init;
+    zds->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
+    return zds;
+}
+
+size_t ZSTD_freeDStream(ZSTD_DStream* zds)
+{
+    if (zds==NULL) return 0;   /* support free on null */
+    {   ZSTD_customMem const cMem = zds->customMem;
+        ZSTD_freeDCtx(zds->dctx);
+        zds->dctx = NULL;
+        ZSTD_freeDDict(zds->ddictLocal);
+        zds->ddictLocal = NULL;
+        ZSTD_free(zds->inBuff, cMem);
+        zds->inBuff = NULL;
+        ZSTD_free(zds->outBuff, cMem);
+        zds->outBuff = NULL;
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+        if (zds->legacyContext)
+            ZSTD_freeLegacyStreamContext(zds->legacyContext, zds->previousLegacyVersion);
+#endif
+        ZSTD_free(zds, cMem);
+        return 0;
+    }
+}
+
+
+/* *** Initialization *** */
+
+size_t ZSTD_DStreamInSize(void)  { return ZSTD_BLOCKSIZE_ABSOLUTEMAX + ZSTD_blockHeaderSize; }
+size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
+
+size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize)
+{
+    zds->stage = zdss_loadHeader;
+    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+    ZSTD_freeDDict(zds->ddictLocal);
+    if (dict && dictSize >= 8) {
+        zds->ddictLocal = ZSTD_createDDict(dict, dictSize);
+        if (zds->ddictLocal == NULL) return ERROR(memory_allocation);
+    } else zds->ddictLocal = NULL;
+    zds->ddict = zds->ddictLocal;
+    zds->legacyVersion = 0;
+    zds->hostageByte = 0;
+    return ZSTD_frameHeaderSize_prefix;
+}
+
+size_t ZSTD_initDStream(ZSTD_DStream* zds)
+{
+    return ZSTD_initDStream_usingDict(zds, NULL, 0);
+}
+
+size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
+{
+    size_t const initResult = ZSTD_initDStream(zds);
+    zds->ddict = ddict;
+    return initResult;
+}
+
+size_t ZSTD_resetDStream(ZSTD_DStream* zds)
+{
+    zds->stage = zdss_loadHeader;
+    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+    zds->legacyVersion = 0;
+    zds->hostageByte = 0;
+    return ZSTD_frameHeaderSize_prefix;
+}
+
+size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds,
+                                ZSTD_DStreamParameter_e paramType, unsigned paramValue)
+{
+    switch(paramType)
+    {
+        default : return ERROR(parameter_unknown);
+        case DStream_p_maxWindowSize : zds->maxWindowSize = paramValue ? paramValue : (U32)(-1); break;
+    }
+    return 0;
+}
+
+
+size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
+{
+    if (zds==NULL) return 0;   /* support sizeof on NULL */
+    return sizeof(*zds) + ZSTD_sizeof_DCtx(zds->dctx) + ZSTD_sizeof_DDict(zds->ddictLocal) + zds->inBuffSize + zds->outBuffSize;
+}
+
+
+/* *****   Decompression   ***** */
+
+MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    size_t const length = MIN(dstCapacity, srcSize);
+    memcpy(dst, src, length);
+    return length;
+}
+
+
+size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
+{
+    const char* const istart = (const char*)(input->src) + input->pos;
+    const char* const iend = (const char*)(input->src) + input->size;
+    const char* ip = istart;
+    char* const ostart = (char*)(output->dst) + output->pos;
+    char* const oend = (char*)(output->dst) + output->size;
+    char* op = ostart;
+    U32 someMoreWork = 1;
+
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+    if (zds->legacyVersion)
+        return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
+#endif
+
+    while (someMoreWork) {
+        switch(zds->stage)
+        {
+        case zdss_init :
+            ZSTD_resetDStream(zds);   /* transparent reset on starting decoding a new frame */
+            /* fall-through */
+
+        case zdss_loadHeader :
+            {   size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
+                if (ZSTD_isError(hSize))
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+                {   U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
+                    if (legacyVersion) {
+                        const void* const dict = zds->ddict ? zds->ddict->dictContent : NULL;
+                        size_t const dictSize = zds->ddict ? zds->ddict->dictSize : 0;
+                        CHECK_F(ZSTD_initLegacyStream(&zds->legacyContext, zds->previousLegacyVersion, legacyVersion,
+                                                       dict, dictSize));
+                        zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
+                        return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
+                    } else {
+                        return hSize; /* error */
+                }   }
+#else
+                return hSize;
+#endif
+                if (hSize != 0) {   /* need more input */
+                    size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
+                    if (toLoad > (size_t)(iend-ip)) {   /* not enough input to load full header */
+                        memcpy(zds->headerBuffer + zds->lhSize, ip, iend-ip);
+                        zds->lhSize += iend-ip;
+                        input->pos = input->size;
+                        return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) + ZSTD_blockHeaderSize;   /* remaining header bytes + next block header */
+                    }
+                    memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad); zds->lhSize = hSize; ip += toLoad;
+                    break;
+            }   }
+
+            /* check for single-pass mode opportunity */
+            if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
+                && (U64)(size_t)(oend-op) >= zds->fParams.frameContentSize) {
+                size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend-istart);
+                if (cSize <= (size_t)(iend-istart)) {
+                    size_t const decompressedSize = ZSTD_decompress_usingDDict(zds->dctx, op, oend-op, istart, cSize, zds->ddict);
+                    if (ZSTD_isError(decompressedSize)) return decompressedSize;
+                    ip = istart + cSize;
+                    op += decompressedSize;
+                    zds->dctx->expected = 0;
+                    zds->stage = zdss_init;
+                    someMoreWork = 0;
+                    break;
+            }   }
+
+            /* Consume header */
+            ZSTD_refDDict(zds->dctx, zds->ddict);
+            {   size_t const h1Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);  /* == ZSTD_frameHeaderSize_prefix */
+                CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer, h1Size));
+                {   size_t const h2Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+                    CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer+h1Size, h2Size));
+            }   }
+
+            zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
+            if (zds->fParams.windowSize > zds->maxWindowSize) return ERROR(frameParameter_windowTooLarge);
+
+            /* Adapt buffer sizes to frame header instructions */
+            {   size_t const blockSize = MIN(zds->fParams.windowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
+                size_t const neededOutSize = zds->fParams.windowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
+                zds->blockSize = blockSize;
+                if (zds->inBuffSize < blockSize) {
+                    ZSTD_free(zds->inBuff, zds->customMem);
+                    zds->inBuffSize = blockSize;
+                    zds->inBuff = (char*)ZSTD_malloc(blockSize, zds->customMem);
+                    if (zds->inBuff == NULL) return ERROR(memory_allocation);
+                }
+                if (zds->outBuffSize < neededOutSize) {
+                    ZSTD_free(zds->outBuff, zds->customMem);
+                    zds->outBuffSize = neededOutSize;
+                    zds->outBuff = (char*)ZSTD_malloc(neededOutSize, zds->customMem);
+                    if (zds->outBuff == NULL) return ERROR(memory_allocation);
+            }   }
+            zds->stage = zdss_read;
+            /* pass-through */
+
+        case zdss_read:
+            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+                if (neededInSize==0) {  /* end of frame */
+                    zds->stage = zdss_init;
+                    someMoreWork = 0;
+                    break;
+                }
+                if ((size_t)(iend-ip) >= neededInSize) {  /* decode directly from src */
+                    const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
+                    size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
+                        zds->outBuff + zds->outStart, (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart),
+                        ip, neededInSize);
+                    if (ZSTD_isError(decodedSize)) return decodedSize;
+                    ip += neededInSize;
+                    if (!decodedSize && !isSkipFrame) break;   /* this was just a header */
+                    zds->outEnd = zds->outStart + decodedSize;
+                    zds->stage = zdss_flush;
+                    break;
+                }
+                if (ip==iend) { someMoreWork = 0; break; }   /* no more input */
+                zds->stage = zdss_load;
+                /* pass-through */
+            }
+
+        case zdss_load:
+            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+                size_t const toLoad = neededInSize - zds->inPos;   /* should always be <= remaining space within inBuff */
+                size_t loadedSize;
+                if (toLoad > zds->inBuffSize - zds->inPos) return ERROR(corruption_detected);   /* should never happen */
+                loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend-ip);
+                ip += loadedSize;
+                zds->inPos += loadedSize;
+                if (loadedSize < toLoad) { someMoreWork = 0; break; }   /* not enough input, wait for more */
+
+                /* decode loaded input */
+                {  const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
+                   size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
+                        zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
+                        zds->inBuff, neededInSize);
+                    if (ZSTD_isError(decodedSize)) return decodedSize;
+                    zds->inPos = 0;   /* input is consumed */
+                    if (!decodedSize && !isSkipFrame) { zds->stage = zdss_read; break; }   /* this was just a header */
+                    zds->outEnd = zds->outStart +  decodedSize;
+                    zds->stage = zdss_flush;
+                    /* pass-through */
+            }   }
+
+        case zdss_flush:
+            {   size_t const toFlushSize = zds->outEnd - zds->outStart;
+                size_t const flushedSize = ZSTD_limitCopy(op, oend-op, zds->outBuff + zds->outStart, toFlushSize);
+                op += flushedSize;
+                zds->outStart += flushedSize;
+                if (flushedSize == toFlushSize) {  /* flush completed */
+                    zds->stage = zdss_read;
+                    if (zds->outStart + zds->blockSize > zds->outBuffSize)
+                        zds->outStart = zds->outEnd = 0;
+                    break;
+                }
+                /* cannot complete flush */
+                someMoreWork = 0;
+                break;
+            }
+        default: return ERROR(GENERIC);   /* impossible */
+    }   }
+
+    /* result */
+    input->pos += (size_t)(ip-istart);
+    output->pos += (size_t)(op-ostart);
+    {   size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+        if (!nextSrcSizeHint) {   /* frame fully decoded */
+            if (zds->outEnd == zds->outStart) {  /* output fully flushed */
+                if (zds->hostageByte) {
+                    if (input->pos >= input->size) { zds->stage = zdss_read; return 1; }  /* can't release hostage (not present) */
+                    input->pos++;  /* release hostage */
+                }
+                return 0;
+            }
+            if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
+                input->pos--;   /* note : pos > 0, otherwise, impossible to finish reading last block */
+                zds->hostageByte=1;
+            }
+            return 1;
+        }
+        nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds->dctx) == ZSTDnit_block);   /* preload header of next block */
+        if (zds->inPos > nextSrcSizeHint) return ERROR(GENERIC);   /* should never happen */
+        nextSrcSizeHint -= zds->inPos;   /* already loaded*/
+        return nextSrcSizeHint;
+    }
+}
diff --git a/contrib/linux-kernel/lib/zstd_errors.h b/contrib/linux-kernel/lib/zstd_errors.h
new file mode 100644
index 000000000..3d579d969
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_errors.h
@@ -0,0 +1,75 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+#ifndef ZSTD_ERRORS_H_398273423
+#define ZSTD_ERRORS_H_398273423
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+/*===== dependency =====*/
+#include <stddef.h>   /* size_t */
+
+
+/* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */
+#if defined(__GNUC__) && (__GNUC__ >= 4)
+#  define ZSTDERRORLIB_VISIBILITY __attribute__ ((visibility ("default")))
+#else
+#  define ZSTDERRORLIB_VISIBILITY
+#endif
+#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
+#  define ZSTDERRORLIB_API __declspec(dllexport) ZSTDERRORLIB_VISIBILITY
+#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
+#  define ZSTDERRORLIB_API __declspec(dllimport) ZSTDERRORLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define ZSTDERRORLIB_API ZSTDERRORLIB_VISIBILITY
+#endif
+
+/*-****************************************
+*  error codes list
+******************************************/
+typedef enum {
+  ZSTD_error_no_error,
+  ZSTD_error_GENERIC,
+  ZSTD_error_prefix_unknown,
+  ZSTD_error_version_unsupported,
+  ZSTD_error_parameter_unknown,
+  ZSTD_error_frameParameter_unsupported,
+  ZSTD_error_frameParameter_unsupportedBy32bits,
+  ZSTD_error_frameParameter_windowTooLarge,
+  ZSTD_error_compressionParameter_unsupported,
+  ZSTD_error_init_missing,
+  ZSTD_error_memory_allocation,
+  ZSTD_error_stage_wrong,
+  ZSTD_error_dstSize_tooSmall,
+  ZSTD_error_srcSize_wrong,
+  ZSTD_error_corruption_detected,
+  ZSTD_error_checksum_wrong,
+  ZSTD_error_tableLog_tooLarge,
+  ZSTD_error_maxSymbolValue_tooLarge,
+  ZSTD_error_maxSymbolValue_tooSmall,
+  ZSTD_error_dictionary_corrupted,
+  ZSTD_error_dictionary_wrong,
+  ZSTD_error_dictionaryCreation_failed,
+  ZSTD_error_maxCode
+} ZSTD_ErrorCode;
+
+/*! ZSTD_getErrorCode() :
+    convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
+    which can be used to compare directly with enum list published into "error_public.h" */
+ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
+ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);
+
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif /* ZSTD_ERRORS_H_398273423 */
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
new file mode 100644
index 000000000..5c5b28732
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -0,0 +1,283 @@
+/**
+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+#ifndef ZSTD_CCOMMON_H_MODULE
+#define ZSTD_CCOMMON_H_MODULE
+
+/*-*******************************************************
+*  Compiler specifics
+*********************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  define FORCE_INLINE static __forceinline
+#  include <intrin.h>                    /* For Visual 2005 */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
+#  pragma warning(disable : 4100)        /* disable: C4100: unreferenced formal parameter */
+#else
+#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#    ifdef __GNUC__
+#      define FORCE_INLINE static inline __attribute__((always_inline))
+#    else
+#      define FORCE_INLINE static inline
+#    endif
+#  else
+#    define FORCE_INLINE static
+#  endif /* __STDC_VERSION__ */
+#endif
+
+#ifdef _MSC_VER
+#  define FORCE_NOINLINE static __declspec(noinline)
+#else
+#  ifdef __GNUC__
+#    define FORCE_NOINLINE static __attribute__((__noinline__))
+#  else
+#    define FORCE_NOINLINE static
+#  endif
+#endif
+
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include "mem.h"
+#include "error_private.h"
+#define ZSTD_STATIC_LINKING_ONLY
+#include "zstd.h"
+#ifndef XXH_STATIC_LINKING_ONLY
+#  define XXH_STATIC_LINKING_ONLY   /* XXH64_state_t */
+#endif
+#include "xxhash.h"               /* XXH_reset, update, digest */
+
+
+/*-*************************************
+*  shared macros
+***************************************/
+#define MIN(a,b) ((a)<(b) ? (a) : (b))
+#define MAX(a,b) ((a)>(b) ? (a) : (b))
+#define CHECK_F(f) { size_t const errcod = f; if (ERR_isError(errcod)) return errcod; }  /* check and Forward error code */
+#define CHECK_E(f, e) { size_t const errcod = f; if (ERR_isError(errcod)) return ERROR(e); }  /* check and send Error code */
+
+
+/*-*************************************
+*  Common constants
+***************************************/
+#define ZSTD_OPT_NUM    (1<<12)
+#define ZSTD_DICT_MAGIC  0xEC30A437   /* v0.7+ */
+
+#define ZSTD_REP_NUM      3                 /* number of repcodes */
+#define ZSTD_REP_CHECK    (ZSTD_REP_NUM)    /* number of repcodes to check by the optimal parser */
+#define ZSTD_REP_MOVE     (ZSTD_REP_NUM-1)
+#define ZSTD_REP_MOVE_OPT (ZSTD_REP_NUM)
+static const U32 repStartValue[ZSTD_REP_NUM] = { 1, 4, 8 };
+
+#define KB *(1 <<10)
+#define MB *(1 <<20)
+#define GB *(1U<<30)
+
+#define BIT7 128
+#define BIT6  64
+#define BIT5  32
+#define BIT4  16
+#define BIT1   2
+#define BIT0   1
+
+#define ZSTD_WINDOWLOG_ABSOLUTEMIN 10
+static const size_t ZSTD_fcs_fieldSize[4] = { 0, 2, 4, 8 };
+static const size_t ZSTD_did_fieldSize[4] = { 0, 1, 2, 4 };
+
+#define ZSTD_BLOCKHEADERSIZE 3   /* C standard doesn't allow `static const` variable to be init using another `static const` variable */
+static const size_t ZSTD_blockHeaderSize = ZSTD_BLOCKHEADERSIZE;
+typedef enum { bt_raw, bt_rle, bt_compressed, bt_reserved } blockType_e;
+
+#define MIN_SEQUENCES_SIZE 1 /* nbSeq==0 */
+#define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */ + MIN_SEQUENCES_SIZE /* nbSeq==0 */)   /* for a non-null block */
+
+#define HufLog 12
+typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingType_e;
+
+#define LONGNBSEQ 0x7F00
+
+#define MINMATCH 3
+#define EQUAL_READ32 4
+
+#define Litbits  8
+#define MaxLit ((1<<Litbits) - 1)
+#define MaxML  52
+#define MaxLL  35
+#define MaxOff 28
+#define MaxSeq MAX(MaxLL, MaxML)   /* Assumption : MaxOff < MaxLL,MaxML */
+#define MLFSELog    9
+#define LLFSELog    9
+#define OffFSELog   8
+
+static const U32 LL_bits[MaxLL+1] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                                      1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9,10,11,12,
+                                     13,14,15,16 };
+static const S16 LL_defaultNorm[MaxLL+1] = { 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1,
+                                             2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1,
+                                            -1,-1,-1,-1 };
+#define LL_DEFAULTNORMLOG 6  /* for static allocation */
+static const U32 LL_defaultNormLog = LL_DEFAULTNORMLOG;
+
+static const U32 ML_bits[MaxML+1] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                                      0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                                      1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 9,10,11,
+                                     12,13,14,15,16 };
+static const S16 ML_defaultNorm[MaxML+1] = { 1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,-1,-1,
+                                            -1,-1,-1,-1,-1 };
+#define ML_DEFAULTNORMLOG 6  /* for static allocation */
+static const U32 ML_defaultNormLog = ML_DEFAULTNORMLOG;
+
+static const S16 OF_defaultNorm[MaxOff+1] = { 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
+                                              1, 1, 1, 1, 1, 1, 1, 1,-1,-1,-1,-1,-1 };
+#define OF_DEFAULTNORMLOG 5  /* for static allocation */
+static const U32 OF_defaultNormLog = OF_DEFAULTNORMLOG;
+
+
+/*-*******************************************
+*  Shared functions to include for inlining
+*********************************************/
+static void ZSTD_copy8(void* dst, const void* src) { memcpy(dst, src, 8); }
+#define COPY8(d,s) { ZSTD_copy8(d,s); d+=8; s+=8; }
+
+/*! ZSTD_wildcopy() :
+*   custom version of memcpy(), can copy up to 7 bytes too many (8 bytes if length==0) */
+#define WILDCOPY_OVERLENGTH 8
+MEM_STATIC void ZSTD_wildcopy(void* dst, const void* src, ptrdiff_t length)
+{
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* op = (BYTE*)dst;
+    BYTE* const oend = op + length;
+    do
+        COPY8(op, ip)
+    while (op < oend);
+}
+
+MEM_STATIC void ZSTD_wildcopy_e(void* dst, const void* src, void* dstEnd)   /* should be faster for decoding, but strangely, not verified on all platform */
+{
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* op = (BYTE*)dst;
+    BYTE* const oend = (BYTE*)dstEnd;
+    do
+        COPY8(op, ip)
+    while (op < oend);
+}
+
+
+/*-*******************************************
+*  Private interfaces
+*********************************************/
+typedef struct ZSTD_stats_s ZSTD_stats_t;
+
+typedef struct {
+    U32 off;
+    U32 len;
+} ZSTD_match_t;
+
+typedef struct {
+    U32 price;
+    U32 off;
+    U32 mlen;
+    U32 litlen;
+    U32 rep[ZSTD_REP_NUM];
+} ZSTD_optimal_t;
+
+
+typedef struct seqDef_s {
+    U32 offset;
+    U16 litLength;
+    U16 matchLength;
+} seqDef;
+
+
+typedef struct {
+    seqDef* sequencesStart;
+    seqDef* sequences;
+    BYTE* litStart;
+    BYTE* lit;
+    BYTE* llCode;
+    BYTE* mlCode;
+    BYTE* ofCode;
+    U32   longLengthID;   /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
+    U32   longLengthPos;
+    /* opt */
+    ZSTD_optimal_t* priceTable;
+    ZSTD_match_t* matchTable;
+    U32* matchLengthFreq;
+    U32* litLengthFreq;
+    U32* litFreq;
+    U32* offCodeFreq;
+    U32  matchLengthSum;
+    U32  matchSum;
+    U32  litLengthSum;
+    U32  litSum;
+    U32  offCodeSum;
+    U32  log2matchLengthSum;
+    U32  log2matchSum;
+    U32  log2litLengthSum;
+    U32  log2litSum;
+    U32  log2offCodeSum;
+    U32  factor;
+    U32  staticPrices;
+    U32  cachedPrice;
+    U32  cachedLitLength;
+    const BYTE* cachedLiterals;
+} seqStore_t;
+
+const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx);
+void ZSTD_seqToCodes(const seqStore_t* seqStorePtr);
+int ZSTD_isSkipFrame(ZSTD_DCtx* dctx);
+
+/* custom memory allocation functions */
+void* ZSTD_defaultAllocFunction(void* opaque, size_t size);
+void ZSTD_defaultFreeFunction(void* opaque, void* address);
+#ifndef ZSTD_DLL_IMPORT
+static const ZSTD_customMem defaultCustomMem = { ZSTD_defaultAllocFunction, ZSTD_defaultFreeFunction, NULL };
+#endif
+void* ZSTD_malloc(size_t size, ZSTD_customMem customMem);
+void ZSTD_free(void* ptr, ZSTD_customMem customMem);
+
+
+/*======  common function  ======*/
+
+MEM_STATIC U32 ZSTD_highbit32(U32 val)
+{
+#   if defined(_MSC_VER)   /* Visual */
+    unsigned long r=0;
+    _BitScanReverse(&r, val);
+    return (unsigned)r;
+#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* GCC Intrinsic */
+    return 31 - __builtin_clz(val);
+#   else   /* Software version */
+    static const int DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+    U32 v = val;
+    int r;
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+    r = DeBruijnClz[(U32)(v * 0x07C4ACDDU) >> 27];
+    return r;
+#   endif
+}
+
+
+/* hidden functions */
+
+/* ZSTD_invalidateRepCodes() :
+ * ensures next compression will not use repcodes from previous block.
+ * Note : only works with regular variant;
+ *        do not use with extDict variant ! */
+void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx);
+
+
+#endif   /* ZSTD_CCOMMON_H_MODULE */
diff --git a/contrib/linux-kernel/lib/zstd_opt.h b/contrib/linux-kernel/lib/zstd_opt.h
new file mode 100644
index 000000000..543761191
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd_opt.h
@@ -0,0 +1,921 @@
+/**
+ * Copyright (c) 2016-present, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+
+
+/* Note : this file is intended to be included within zstd_compress.c */
+
+
+#ifndef ZSTD_OPT_H_91842398743
+#define ZSTD_OPT_H_91842398743
+
+
+#define ZSTD_LITFREQ_ADD    2
+#define ZSTD_FREQ_DIV       4
+#define ZSTD_MAX_PRICE      (1<<30)
+
+/*-*************************************
+*  Price functions for optimal parser
+***************************************/
+FORCE_INLINE void ZSTD_setLog2Prices(seqStore_t* ssPtr)
+{
+    ssPtr->log2matchLengthSum = ZSTD_highbit32(ssPtr->matchLengthSum+1);
+    ssPtr->log2litLengthSum = ZSTD_highbit32(ssPtr->litLengthSum+1);
+    ssPtr->log2litSum = ZSTD_highbit32(ssPtr->litSum+1);
+    ssPtr->log2offCodeSum = ZSTD_highbit32(ssPtr->offCodeSum+1);
+    ssPtr->factor = 1 + ((ssPtr->litSum>>5) / ssPtr->litLengthSum) + ((ssPtr->litSum<<1) / (ssPtr->litSum + ssPtr->matchSum));
+}
+
+
+MEM_STATIC void ZSTD_rescaleFreqs(seqStore_t* ssPtr, const BYTE* src, size_t srcSize)
+{
+    unsigned u;
+
+    ssPtr->cachedLiterals = NULL;
+    ssPtr->cachedPrice = ssPtr->cachedLitLength = 0;
+    ssPtr->staticPrices = 0;
+
+    if (ssPtr->litLengthSum == 0) {
+        if (srcSize <= 1024) ssPtr->staticPrices = 1;
+
+        for (u=0; u<=MaxLit; u++)
+            ssPtr->litFreq[u] = 0;
+        for (u=0; u<srcSize; u++)
+            ssPtr->litFreq[src[u]]++;
+
+        ssPtr->litSum = 0;
+        ssPtr->litLengthSum = MaxLL+1;
+        ssPtr->matchLengthSum = MaxML+1;
+        ssPtr->offCodeSum = (MaxOff+1);
+        ssPtr->matchSum = (ZSTD_LITFREQ_ADD<<Litbits);
+
+        for (u=0; u<=MaxLit; u++) {
+            ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>ZSTD_FREQ_DIV);
+            ssPtr->litSum += ssPtr->litFreq[u];
+        }
+        for (u=0; u<=MaxLL; u++)
+            ssPtr->litLengthFreq[u] = 1;
+        for (u=0; u<=MaxML; u++)
+            ssPtr->matchLengthFreq[u] = 1;
+        for (u=0; u<=MaxOff; u++)
+            ssPtr->offCodeFreq[u] = 1;
+    } else {
+        ssPtr->matchLengthSum = 0;
+        ssPtr->litLengthSum = 0;
+        ssPtr->offCodeSum = 0;
+        ssPtr->matchSum = 0;
+        ssPtr->litSum = 0;
+
+        for (u=0; u<=MaxLit; u++) {
+            ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>(ZSTD_FREQ_DIV+1));
+            ssPtr->litSum += ssPtr->litFreq[u];
+        }
+        for (u=0; u<=MaxLL; u++) {
+            ssPtr->litLengthFreq[u] = 1 + (ssPtr->litLengthFreq[u]>>(ZSTD_FREQ_DIV+1));
+            ssPtr->litLengthSum += ssPtr->litLengthFreq[u];
+        }
+        for (u=0; u<=MaxML; u++) {
+            ssPtr->matchLengthFreq[u] = 1 + (ssPtr->matchLengthFreq[u]>>ZSTD_FREQ_DIV);
+            ssPtr->matchLengthSum += ssPtr->matchLengthFreq[u];
+            ssPtr->matchSum += ssPtr->matchLengthFreq[u] * (u + 3);
+        }
+        ssPtr->matchSum *= ZSTD_LITFREQ_ADD;
+        for (u=0; u<=MaxOff; u++) {
+            ssPtr->offCodeFreq[u] = 1 + (ssPtr->offCodeFreq[u]>>ZSTD_FREQ_DIV);
+            ssPtr->offCodeSum += ssPtr->offCodeFreq[u];
+        }
+    }
+
+    ZSTD_setLog2Prices(ssPtr);
+}
+
+
+FORCE_INLINE U32 ZSTD_getLiteralPrice(seqStore_t* ssPtr, U32 litLength, const BYTE* literals)
+{
+    U32 price, u;
+
+    if (ssPtr->staticPrices)
+        return ZSTD_highbit32((U32)litLength+1) + (litLength*6);
+
+    if (litLength == 0)
+        return ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[0]+1);
+
+    /* literals */
+    if (ssPtr->cachedLiterals == literals) {
+        U32 const additional = litLength - ssPtr->cachedLitLength;
+        const BYTE* literals2 = ssPtr->cachedLiterals + ssPtr->cachedLitLength;
+        price = ssPtr->cachedPrice + additional * ssPtr->log2litSum;
+        for (u=0; u < additional; u++)
+            price -= ZSTD_highbit32(ssPtr->litFreq[literals2[u]]+1);
+        ssPtr->cachedPrice = price;
+        ssPtr->cachedLitLength = litLength;
+    } else {
+        price = litLength * ssPtr->log2litSum;
+        for (u=0; u < litLength; u++)
+            price -= ZSTD_highbit32(ssPtr->litFreq[literals[u]]+1);
+
+        if (litLength >= 12) {
+            ssPtr->cachedLiterals = literals;
+            ssPtr->cachedPrice = price;
+            ssPtr->cachedLitLength = litLength;
+        }
+    }
+
+    /* literal Length */
+    {   const BYTE LL_deltaCode = 19;
+        const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
+        price += LL_bits[llCode] + ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[llCode]+1);
+    }
+
+    return price;
+}
+
+
+FORCE_INLINE U32 ZSTD_getPrice(seqStore_t* seqStorePtr, U32 litLength, const BYTE* literals, U32 offset, U32 matchLength, const int ultra)
+{
+    /* offset */
+    U32 price;
+    BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
+
+    if (seqStorePtr->staticPrices)
+        return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength+1) + 16 + offCode;
+
+    price = offCode + seqStorePtr->log2offCodeSum - ZSTD_highbit32(seqStorePtr->offCodeFreq[offCode]+1);
+    if (!ultra && offCode >= 20) price += (offCode-19)*2;
+
+    /* match Length */
+    {   const BYTE ML_deltaCode = 36;
+        const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
+        price += ML_bits[mlCode] + seqStorePtr->log2matchLengthSum - ZSTD_highbit32(seqStorePtr->matchLengthFreq[mlCode]+1);
+    }
+
+    return price + ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + seqStorePtr->factor;
+}
+
+
+MEM_STATIC void ZSTD_updatePrice(seqStore_t* seqStorePtr, U32 litLength, const BYTE* literals, U32 offset, U32 matchLength)
+{
+    U32 u;
+
+    /* literals */
+    seqStorePtr->litSum += litLength*ZSTD_LITFREQ_ADD;
+    for (u=0; u < litLength; u++)
+        seqStorePtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
+
+    /* literal Length */
+    {   const BYTE LL_deltaCode = 19;
+        const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
+        seqStorePtr->litLengthFreq[llCode]++;
+        seqStorePtr->litLengthSum++;
+    }
+
+    /* match offset */
+    {   BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
+        seqStorePtr->offCodeSum++;
+        seqStorePtr->offCodeFreq[offCode]++;
+    }
+
+    /* match Length */
+    {   const BYTE ML_deltaCode = 36;
+        const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
+        seqStorePtr->matchLengthFreq[mlCode]++;
+        seqStorePtr->matchLengthSum++;
+    }
+
+    ZSTD_setLog2Prices(seqStorePtr);
+}
+
+
+#define SET_PRICE(pos, mlen_, offset_, litlen_, price_)   \
+    {                                                 \
+        while (last_pos < pos)  { opt[last_pos+1].price = ZSTD_MAX_PRICE; last_pos++; } \
+        opt[pos].mlen = mlen_;                         \
+        opt[pos].off = offset_;                        \
+        opt[pos].litlen = litlen_;                     \
+        opt[pos].price = price_;                       \
+    }
+
+
+
+/* Update hashTable3 up to ip (excluded)
+   Assumption : always within prefix (i.e. not within extDict) */
+FORCE_INLINE
+U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_CCtx* zc, const BYTE* ip)
+{
+    U32* const hashTable3  = zc->hashTable3;
+    U32 const hashLog3  = zc->hashLog3;
+    const BYTE* const base = zc->base;
+    U32 idx = zc->nextToUpdate3;
+    const U32 target = zc->nextToUpdate3 = (U32)(ip - base);
+    const size_t hash3 = ZSTD_hash3Ptr(ip, hashLog3);
+
+    while(idx < target) {
+        hashTable3[ZSTD_hash3Ptr(base+idx, hashLog3)] = idx;
+        idx++;
+    }
+
+    return hashTable3[hash3];
+}
+
+
+/*-*************************************
+*  Binary Tree search
+***************************************/
+static U32 ZSTD_insertBtAndGetAllMatches (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        U32 nbCompares, const U32 mls,
+                        U32 extDict, ZSTD_match_t* matches, const U32 minMatchLen)
+{
+    const BYTE* const base = zc->base;
+    const U32 current = (U32)(ip-base);
+    const U32 hashLog = zc->params.cParams.hashLog;
+    const size_t h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32* const hashTable = zc->hashTable;
+    U32 matchIndex  = hashTable[h];
+    U32* const bt   = zc->chainTable;
+    const U32 btLog = zc->params.cParams.chainLog - 1;
+    const U32 btMask= (1U << btLog) - 1;
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const dictBase = zc->dictBase;
+    const U32 dictLimit = zc->dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const U32 btLow = btMask >= current ? 0 : current - btMask;
+    const U32 windowLow = zc->lowLimit;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = bt + 2*(current&btMask) + 1;
+    U32 matchEndIdx = current+8;
+    U32 dummy32;   /* to be nullified at the end */
+    U32 mnum = 0;
+
+    const U32 minMatch = (mls == 3) ? 3 : 4;
+    size_t bestLength = minMatchLen-1;
+
+    if (minMatch == 3) { /* HC3 match finder */
+        U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3 (zc, ip);
+        if (matchIndex3>windowLow && (current - matchIndex3 < (1<<18))) {
+            const BYTE* match;
+            size_t currentMl=0;
+            if ((!extDict) || matchIndex3 >= dictLimit) {
+                match = base + matchIndex3;
+                if (match[bestLength] == ip[bestLength]) currentMl = ZSTD_count(ip, match, iLimit);
+            } else {
+                match = dictBase + matchIndex3;
+                if (MEM_readMINMATCH(match, MINMATCH) == MEM_readMINMATCH(ip, MINMATCH))    /* assumption : matchIndex3 <= dictLimit-4 (by table construction) */
+                    currentMl = ZSTD_count_2segments(ip+MINMATCH, match+MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH;
+            }
+
+            /* save best solution */
+            if (currentMl > bestLength) {
+                bestLength = currentMl;
+                matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex3;
+                matches[mnum].len = (U32)currentMl;
+                mnum++;
+                if (currentMl > ZSTD_OPT_NUM) goto update;
+                if (ip+currentMl == iLimit) goto update; /* best possible, and avoid read overflow*/
+            }
+        }
+    }
+
+    hashTable[h] = current;   /* Update Hash Table */
+
+    while (nbCompares-- && (matchIndex > windowLow)) {
+        U32* nextPtr = bt + 2*(matchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        const BYTE* match;
+
+        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+            match = base + matchIndex;
+            if (match[matchLength] == ip[matchLength]) {
+                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iLimit) +1;
+            }
+        } else {
+            match = dictBase + matchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+        }
+
+        if (matchLength > bestLength) {
+            if (matchLength > matchEndIdx - matchIndex) matchEndIdx = matchIndex + (U32)matchLength;
+            bestLength = matchLength;
+            matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex;
+            matches[mnum].len = (U32)matchLength;
+            mnum++;
+            if (matchLength > ZSTD_OPT_NUM) break;
+            if (ip+matchLength == iLimit)   /* equal : no way to know if inf or sup */
+                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+        }
+
+        if (match[matchLength] < ip[matchLength]) {
+            /* match is smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+        } else {
+            /* match is larger than current */
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+
+update:
+    zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
+    return mnum;
+}
+
+
+/** Tree updater, providing best match */
+static U32 ZSTD_BtGetAllMatches (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
+{
+    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
+    return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen);
+}
+
+
+static U32 ZSTD_BtGetAllMatches_selectMLS (
+                        ZSTD_CCtx* zc,   /* Index table will be updated */
+                        const BYTE* ip, const BYTE* const iHighLimit,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
+{
+    switch(matchLengthSearch)
+    {
+    case 3 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
+    default :
+    case 4 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
+    case 5 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+    case 7 :
+    case 6 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
+    }
+}
+
+/** Tree updater, providing best match */
+static U32 ZSTD_BtGetAllMatches_extDict (
+                        ZSTD_CCtx* zc,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
+{
+    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
+    return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);
+}
+
+
+static U32 ZSTD_BtGetAllMatches_selectMLS_extDict (
+                        ZSTD_CCtx* zc,   /* Index table will be updated */
+                        const BYTE* ip, const BYTE* const iHighLimit,
+                        const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
+{
+    switch(matchLengthSearch)
+    {
+    case 3 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
+    default :
+    case 4 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
+    case 5 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+    case 7 :
+    case 6 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
+    }
+}
+
+
+/*-*******************************
+*  Optimal parser
+*********************************/
+FORCE_INLINE
+void ZSTD_compressBlock_opt_generic(ZSTD_CCtx* ctx,
+                                    const void* src, size_t srcSize, const int ultra)
+{
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ctx->base;
+    const BYTE* const prefixStart = base + ctx->dictLimit;
+
+    const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
+    const U32 sufficient_len = ctx->params.cParams.targetLength;
+    const U32 mls = ctx->params.cParams.searchLength;
+    const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
+
+    ZSTD_optimal_t* opt = seqStorePtr->priceTable;
+    ZSTD_match_t* matches = seqStorePtr->matchTable;
+    const BYTE* inr;
+    U32 offset, rep[ZSTD_REP_NUM];
+
+    /* init */
+    ctx->nextToUpdate3 = ctx->nextToUpdate;
+    ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
+    ip += (ip==prefixStart);
+    { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
+
+    /* Match Loop */
+    while (ip < ilimit) {
+        U32 cur, match_num, last_pos, litlen, price;
+        U32 u, mlen, best_mlen, best_off, litLength;
+        memset(opt, 0, sizeof(ZSTD_optimal_t));
+        last_pos = 0;
+        litlen = (U32)(ip - anchor);
+
+        /* check repCode */
+        {   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
+            for (i=(ip == anchor); i<last_i; i++) {
+                const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
+                if ( (repCur > 0) && (repCur < (S32)(ip-prefixStart))
+                    && (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(ip - repCur, minMatch))) {
+                    mlen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repCur, iend) + minMatch;
+                    if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
+                        best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
+                        goto _storeSequence;
+                    }
+                    best_off = i - (ip == anchor);
+                    do {
+                        price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+                        if (mlen > last_pos || price < opt[mlen].price)
+                            SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
+                        mlen--;
+                    } while (mlen >= minMatch);
+        }   }   }
+
+        match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch);
+
+        if (!last_pos && !match_num) { ip++; continue; }
+
+        if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+            best_mlen = matches[match_num-1].len;
+            best_off = matches[match_num-1].off;
+            cur = 0;
+            last_pos = 1;
+            goto _storeSequence;
+        }
+
+        /* set prices using matches at position = 0 */
+        best_mlen = (last_pos) ? last_pos : minMatch;
+        for (u = 0; u < match_num; u++) {
+            mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+            best_mlen = matches[u].len;
+            while (mlen <= best_mlen) {
+                price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+                if (mlen > last_pos || price < opt[mlen].price)
+                    SET_PRICE(mlen, mlen, matches[u].off, litlen, price);   /* note : macro modifies last_pos */
+                mlen++;
+        }   }
+
+        if (last_pos < minMatch) { ip++; continue; }
+
+        /* initialize opt[0] */
+        { U32 i ; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
+        opt[0].mlen = 1;
+        opt[0].litlen = litlen;
+
+         /* check further positions */
+        for (cur = 1; cur <= last_pos; cur++) {
+           inr = ip + cur;
+
+           if (opt[cur-1].mlen == 1) {
+                litlen = opt[cur-1].litlen + 1;
+                if (cur > litlen) {
+                    price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
+                } else
+                    price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
+           } else {
+                litlen = 1;
+                price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
+           }
+
+           if (cur > last_pos || price <= opt[cur].price)
+                SET_PRICE(cur, 1, 0, litlen, price);
+
+           if (cur == last_pos) break;
+
+           if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
+               continue;
+
+           mlen = opt[cur].mlen;
+           if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
+                opt[cur].rep[2] = opt[cur-mlen].rep[1];
+                opt[cur].rep[1] = opt[cur-mlen].rep[0];
+                opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
+           } else {
+                opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
+                opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
+                opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
+           }
+
+            best_mlen = minMatch;
+            {   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
+                for (i=(opt[cur].mlen != 1); i<last_i; i++) {  /* check rep */
+                    const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
+                    if ( (repCur > 0) && (repCur < (S32)(inr-prefixStart))
+                       && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(inr - repCur, minMatch))) {
+                       mlen = (U32)ZSTD_count(inr+minMatch, inr+minMatch - repCur, iend) + minMatch;
+
+                       if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
+                            best_mlen = mlen; best_off = i; last_pos = cur + 1;
+                            goto _storeSequence;
+                       }
+
+                       best_off = i - (opt[cur].mlen != 1);
+                       if (mlen > best_mlen) best_mlen = mlen;
+
+                       do {
+                           if (opt[cur].mlen == 1) {
+                                litlen = opt[cur].litlen;
+                                if (cur > litlen) {
+                                    price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
+                                } else
+                                    price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+                            } else {
+                                litlen = 0;
+                                price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
+                            }
+
+                            if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
+                                SET_PRICE(cur + mlen, mlen, i, litlen, price);
+                            mlen--;
+                        } while (mlen >= minMatch);
+            }   }   }
+
+            match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, inr, iend, maxSearches, mls, matches, best_mlen);
+
+            if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+                best_mlen = matches[match_num-1].len;
+                best_off = matches[match_num-1].off;
+                last_pos = cur + 1;
+                goto _storeSequence;
+            }
+
+            /* set prices using matches at position = cur */
+            for (u = 0; u < match_num; u++) {
+                mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+                best_mlen = matches[u].len;
+
+                while (mlen <= best_mlen) {
+                    if (opt[cur].mlen == 1) {
+                        litlen = opt[cur].litlen;
+                        if (cur > litlen)
+                            price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
+                        else
+                            price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+                    } else {
+                        litlen = 0;
+                        price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
+                    }
+
+                    if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
+                        SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
+
+                    mlen++;
+        }   }   }
+
+        best_mlen = opt[last_pos].mlen;
+        best_off = opt[last_pos].off;
+        cur = last_pos - best_mlen;
+
+        /* store sequence */
+_storeSequence:   /* cur, last_pos, best_mlen, best_off have to be set */
+        opt[0].mlen = 1;
+
+        while (1) {
+            mlen = opt[cur].mlen;
+            offset = opt[cur].off;
+            opt[cur].mlen = best_mlen;
+            opt[cur].off = best_off;
+            best_mlen = mlen;
+            best_off = offset;
+            if (mlen > cur) break;
+            cur -= mlen;
+        }
+
+        for (u = 0; u <= last_pos;) {
+            u += opt[u].mlen;
+        }
+
+        for (cur=0; cur < last_pos; ) {
+            mlen = opt[cur].mlen;
+            if (mlen == 1) { ip++; cur++; continue; }
+            offset = opt[cur].off;
+            cur += mlen;
+            litLength = (U32)(ip - anchor);
+
+            if (offset > ZSTD_REP_MOVE_OPT) {
+                rep[2] = rep[1];
+                rep[1] = rep[0];
+                rep[0] = offset - ZSTD_REP_MOVE_OPT;
+                offset--;
+            } else {
+                if (offset != 0) {
+                    best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
+                    if (offset != 1) rep[2] = rep[1];
+                    rep[1] = rep[0];
+                    rep[0] = best_off;
+                }
+                if (litLength==0) offset--;
+            }
+
+            ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+            ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+            anchor = ip = ip + mlen;
+    }    }   /* for (cur=0; cur < last_pos; ) */
+
+    /* Save reps for next block */
+    { int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
+
+    /* Last Literals */
+    {   size_t const lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+
+FORCE_INLINE
+void ZSTD_compressBlock_opt_extDict_generic(ZSTD_CCtx* ctx,
+                                     const void* src, size_t srcSize, const int ultra)
+{
+    seqStore_t* seqStorePtr = &(ctx->seqStore);
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ctx->base;
+    const U32 lowestIndex = ctx->lowLimit;
+    const U32 dictLimit = ctx->dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* const dictBase = ctx->dictBase;
+    const BYTE* const dictEnd  = dictBase + dictLimit;
+
+    const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
+    const U32 sufficient_len = ctx->params.cParams.targetLength;
+    const U32 mls = ctx->params.cParams.searchLength;
+    const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
+
+    ZSTD_optimal_t* opt = seqStorePtr->priceTable;
+    ZSTD_match_t* matches = seqStorePtr->matchTable;
+    const BYTE* inr;
+
+    /* init */
+    U32 offset, rep[ZSTD_REP_NUM];
+    { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
+
+    ctx->nextToUpdate3 = ctx->nextToUpdate;
+    ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
+    ip += (ip==prefixStart);
+
+    /* Match Loop */
+    while (ip < ilimit) {
+        U32 cur, match_num, last_pos, litlen, price;
+        U32 u, mlen, best_mlen, best_off, litLength;
+        U32 current = (U32)(ip-base);
+        memset(opt, 0, sizeof(ZSTD_optimal_t));
+        last_pos = 0;
+        opt[0].litlen = (U32)(ip - anchor);
+
+        /* check repCode */
+        {   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
+            for (i = (ip==anchor); i<last_i; i++) {
+                const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
+                const U32 repIndex = (U32)(current - repCur);
+                const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                const BYTE* const repMatch = repBase + repIndex;
+                if ( (repCur > 0 && repCur <= (S32)current)
+                   && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
+                   && (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
+                    /* repcode detected we should take it */
+                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                    mlen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
+
+                    if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
+                        best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
+                        goto _storeSequence;
+                    }
+
+                    best_off = i - (ip==anchor);
+                    litlen = opt[0].litlen;
+                    do {
+                        price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+                        if (mlen > last_pos || price < opt[mlen].price)
+                            SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
+                        mlen--;
+                    } while (mlen >= minMatch);
+        }   }   }
+
+        match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, ip, iend, maxSearches, mls, matches, minMatch);  /* first search (depth 0) */
+
+        if (!last_pos && !match_num) { ip++; continue; }
+
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
+        opt[0].mlen = 1;
+
+        if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+            best_mlen = matches[match_num-1].len;
+            best_off = matches[match_num-1].off;
+            cur = 0;
+            last_pos = 1;
+            goto _storeSequence;
+        }
+
+        best_mlen = (last_pos) ? last_pos : minMatch;
+
+        /* set prices using matches at position = 0 */
+        for (u = 0; u < match_num; u++) {
+            mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+            best_mlen = matches[u].len;
+            litlen = opt[0].litlen;
+            while (mlen <= best_mlen) {
+                price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+                if (mlen > last_pos || price < opt[mlen].price)
+                    SET_PRICE(mlen, mlen, matches[u].off, litlen, price);
+                mlen++;
+        }   }
+
+        if (last_pos < minMatch) {
+            ip++; continue;
+        }
+
+        /* check further positions */
+        for (cur = 1; cur <= last_pos; cur++) {
+            inr = ip + cur;
+
+            if (opt[cur-1].mlen == 1) {
+                litlen = opt[cur-1].litlen + 1;
+                if (cur > litlen) {
+                    price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
+                } else
+                    price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
+            } else {
+                litlen = 1;
+                price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
+            }
+
+            if (cur > last_pos || price <= opt[cur].price)
+                SET_PRICE(cur, 1, 0, litlen, price);
+
+            if (cur == last_pos) break;
+
+            if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
+                continue;
+
+            mlen = opt[cur].mlen;
+            if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
+                opt[cur].rep[2] = opt[cur-mlen].rep[1];
+                opt[cur].rep[1] = opt[cur-mlen].rep[0];
+                opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
+            } else {
+                opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
+                opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
+                opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
+            }
+
+            best_mlen = minMatch;
+            {   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
+                for (i = (mlen != 1); i<last_i; i++) {
+                    const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
+                    const U32 repIndex = (U32)(current+cur - repCur);
+                    const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                    const BYTE* const repMatch = repBase + repIndex;
+                    if ( (repCur > 0 && repCur <= (S32)(current+cur))
+                      && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
+                      && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
+                        /* repcode detected */
+                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                        mlen = (U32)ZSTD_count_2segments(inr+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
+
+                        if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
+                            best_mlen = mlen; best_off = i; last_pos = cur + 1;
+                            goto _storeSequence;
+                        }
+
+                        best_off = i - (opt[cur].mlen != 1);
+                        if (mlen > best_mlen) best_mlen = mlen;
+
+                        do {
+                            if (opt[cur].mlen == 1) {
+                                litlen = opt[cur].litlen;
+                                if (cur > litlen) {
+                                    price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
+                                } else
+                                    price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+                            } else {
+                                litlen = 0;
+                                price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
+                            }
+
+                            if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
+                                SET_PRICE(cur + mlen, mlen, i, litlen, price);
+                            mlen--;
+                        } while (mlen >= minMatch);
+            }   }   }
+
+            match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, inr, iend, maxSearches, mls, matches, minMatch);
+
+            if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+                best_mlen = matches[match_num-1].len;
+                best_off = matches[match_num-1].off;
+                last_pos = cur + 1;
+                goto _storeSequence;
+            }
+
+            /* set prices using matches at position = cur */
+            for (u = 0; u < match_num; u++) {
+                mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+                best_mlen = matches[u].len;
+
+                while (mlen <= best_mlen) {
+                    if (opt[cur].mlen == 1) {
+                        litlen = opt[cur].litlen;
+                        if (cur > litlen)
+                            price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
+                        else
+                            price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+                    } else {
+                        litlen = 0;
+                        price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
+                    }
+
+                    if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
+                        SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
+
+                    mlen++;
+        }   }   }   /* for (cur = 1; cur <= last_pos; cur++) */
+
+        best_mlen = opt[last_pos].mlen;
+        best_off = opt[last_pos].off;
+        cur = last_pos - best_mlen;
+
+        /* store sequence */
+_storeSequence:   /* cur, last_pos, best_mlen, best_off have to be set */
+        opt[0].mlen = 1;
+
+        while (1) {
+            mlen = opt[cur].mlen;
+            offset = opt[cur].off;
+            opt[cur].mlen = best_mlen;
+            opt[cur].off = best_off;
+            best_mlen = mlen;
+            best_off = offset;
+            if (mlen > cur) break;
+            cur -= mlen;
+        }
+
+        for (u = 0; u <= last_pos; ) {
+            u += opt[u].mlen;
+        }
+
+        for (cur=0; cur < last_pos; ) {
+            mlen = opt[cur].mlen;
+            if (mlen == 1) { ip++; cur++; continue; }
+            offset = opt[cur].off;
+            cur += mlen;
+            litLength = (U32)(ip - anchor);
+
+            if (offset > ZSTD_REP_MOVE_OPT) {
+                rep[2] = rep[1];
+                rep[1] = rep[0];
+                rep[0] = offset - ZSTD_REP_MOVE_OPT;
+                offset--;
+            } else {
+                if (offset != 0) {
+                    best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
+                    if (offset != 1) rep[2] = rep[1];
+                    rep[1] = rep[0];
+                    rep[0] = best_off;
+                }
+
+                if (litLength==0) offset--;
+            }
+
+            ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+            ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+            anchor = ip = ip + mlen;
+    }    }   /* for (cur=0; cur < last_pos; ) */
+
+    /* Save reps for next block */
+    { int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
+
+    /* Last Literals */
+    {   size_t lastLLSize = iend - anchor;
+        memcpy(seqStorePtr->lit, anchor, lastLLSize);
+        seqStorePtr->lit += lastLLSize;
+    }
+}
+
+#endif  /* ZSTD_OPT_H_91842398743 */

From 78063ca2bd6964d76654527eb8cf4971e4d93d50 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 29 Mar 2017 18:47:23 -0700
Subject: [PATCH 081/255] spaces to tabs

---
 contrib/linux-kernel/spaces_to_tabs.sh | 28 ++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100755 contrib/linux-kernel/spaces_to_tabs.sh

diff --git a/contrib/linux-kernel/spaces_to_tabs.sh b/contrib/linux-kernel/spaces_to_tabs.sh
new file mode 100755
index 000000000..ebde5fbaa
--- /dev/null
+++ b/contrib/linux-kernel/spaces_to_tabs.sh
@@ -0,0 +1,28 @@
+#!/bin/sh
+set -e
+
+# Constants
+INCLUDE='include/'
+LIB='lib/'
+SPACES='    '
+TAB=$'\t'
+TMP="replacements.tmp"
+
+echo "Files: " $INCLUDE* $LIB*
+
+# Check files for existing tabs
+grep "$TAB" $INCLUDE* $LIB* && exit 1 || true
+# Replace the first tab on every line
+sed -i '' "s/^$SPACES/$TAB/" $INCLUDE* $LIB*
+
+# Execute once and then execute as long as replacements are happening
+more_work="yes"
+while [ ! -z "$more_work" ]
+do
+  rm -f $TMP
+  # Replaces $SPACES that directly follow a $TAB with a $TAB.
+  # $TMP will be non-empty if any replacements took place.
+  sed -i '' "s/$TAB$SPACES/$TAB$TAB/w $TMP" $INCLUDE* $LIB*
+  more_work=$(cat "$TMP")
+done
+rm -f $TMP

From 1075c12078692d628851f70dd2fe41ba8764d0a7 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 29 Mar 2017 19:57:22 -0700
Subject: [PATCH 082/255] Convert all spaces to tabs

---
 contrib/linux-kernel/include/zstd.h        |  172 +-
 contrib/linux-kernel/lib/bitstream.h       |  258 +-
 contrib/linux-kernel/lib/entropy_common.c  |  288 +-
 contrib/linux-kernel/lib/error_private.c   |   56 +-
 contrib/linux-kernel/lib/error_private.h   |    2 +-
 contrib/linux-kernel/lib/fse.h             |  268 +-
 contrib/linux-kernel/lib/fse_compress.c    | 1046 ++---
 contrib/linux-kernel/lib/fse_decompress.c  |  302 +-
 contrib/linux-kernel/lib/huf.h             |   62 +-
 contrib/linux-kernel/lib/huf_compress.c    |  860 ++--
 contrib/linux-kernel/lib/huf_decompress.c  | 1114 ++---
 contrib/linux-kernel/lib/mem.h             |  212 +-
 contrib/linux-kernel/lib/xxhash.c          |  752 +--
 contrib/linux-kernel/lib/xxhash.h          |   52 +-
 contrib/linux-kernel/lib/zstd_common.c     |   16 +-
 contrib/linux-kernel/lib/zstd_compress.c   | 4766 ++++++++++----------
 contrib/linux-kernel/lib/zstd_decompress.c | 3552 +++++++--------
 contrib/linux-kernel/lib/zstd_errors.h     |    4 +-
 contrib/linux-kernel/lib/zstd_internal.h   |  156 +-
 contrib/linux-kernel/lib/zstd_opt.h        | 1400 +++---
 20 files changed, 7669 insertions(+), 7669 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index 4531a84bf..d7f4f5a09 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -41,12 +41,12 @@ extern "C" {
   decompression functions. The library supports compression levels from 1 up to ZSTD_maxCLevel() which is 22.
   Levels >= 20, labeled `--ultra`, should be used with caution, as they require more memory.
   Compression can be done in:
-    - a single step (described as Simple API)
-    - a single step, reusing a context (described as Explicit memory management)
-    - unbounded multiple steps (described as Streaming compression)
+	- a single step (described as Simple API)
+	- a single step, reusing a context (described as Explicit memory management)
+	- unbounded multiple steps (described as Streaming compression)
   The compression ratio achievable on small data can be highly improved using compression with a dictionary in:
-    - a single step (described as Simple dictionary API)
-    - a single step, reusing a dictionary (described as Fast dictionary API)
+	- a single step (described as Simple dictionary API)
+	- a single step, reusing a dictionary (described as Fast dictionary API)
 
   Advanced experimental functions can be accessed using #define ZSTD_STATIC_LINKING_ONLY before including zstd.h.
   These APIs shall never be used with a dynamic library.
@@ -71,22 +71,22 @@ ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< library version number; to
 *  Simple API
 ***************************************/
 /*! ZSTD_compress() :
-    Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
-    Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
-    @return : compressed size written into `dst` (<= `dstCapacity),
-              or an error code if it fails (which can be tested using ZSTD_isError()). */
+	Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
+	Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+	@return : compressed size written into `dst` (<= `dstCapacity),
+			  or an error code if it fails (which can be tested using ZSTD_isError()). */
 ZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,
-                            const void* src, size_t srcSize,
-                                  int compressionLevel);
+							const void* src, size_t srcSize,
+								  int compressionLevel);
 
 /*! ZSTD_decompress() :
-    `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
-    `dstCapacity` is an upper bound of originalSize.
-    If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
-    @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
-              or an errorCode if it fails (which can be tested using ZSTD_isError()). */
+	`compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
+	`dstCapacity` is an upper bound of originalSize.
+	If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
+	@return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
+			  or an errorCode if it fails (which can be tested using ZSTD_isError()). */
 ZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,
-                              const void* src, size_t compressedSize);
+							  const void* src, size_t compressedSize);
 
 /*! ZSTD_getDecompressedSize() :
 *   NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
@@ -136,7 +136,7 @@ ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);
 ZSTDLIB_API size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
 
 /*! ZSTD_compressCCtx() :
-    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
+	Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
 ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel);
 
 /*= Decompression context
@@ -161,10 +161,10 @@ ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapa
 *   Note : This function loads the dictionary, resulting in significant startup delay.
 *   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
 ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
-                                           void* dst, size_t dstCapacity,
-                                     const void* src, size_t srcSize,
-                                     const void* dict,size_t dictSize,
-                                           int compressionLevel);
+										   void* dst, size_t dstCapacity,
+									 const void* src, size_t srcSize,
+									 const void* dict,size_t dictSize,
+										   int compressionLevel);
 
 /*! ZSTD_decompress_usingDict() :
 *   Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
@@ -172,9 +172,9 @@ ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
 *   Note : This function loads the dictionary, resulting in significant startup delay.
 *   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
 ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-                                             void* dst, size_t dstCapacity,
-                                       const void* src, size_t srcSize,
-                                       const void* dict,size_t dictSize);
+											 void* dst, size_t dstCapacity,
+									   const void* src, size_t srcSize,
+									   const void* dict,size_t dictSize);
 
 
 /****************************
@@ -198,9 +198,9 @@ ZSTDLIB_API size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
 *   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
 *   Note that compression level is decided during dictionary creation. */
 ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
-                                            void* dst, size_t dstCapacity,
-                                      const void* src, size_t srcSize,
-                                      const ZSTD_CDict* cdict);
+											void* dst, size_t dstCapacity,
+									  const void* src, size_t srcSize,
+									  const ZSTD_CDict* cdict);
 
 
 typedef struct ZSTD_DDict_s ZSTD_DDict;
@@ -218,9 +218,9 @@ ZSTDLIB_API size_t      ZSTD_freeDDict(ZSTD_DDict* ddict);
 *   Decompression using a digested Dictionary.
 *   Faster startup than ZSTD_decompress_usingDict(), recommended when same dictionary is used multiple times. */
 ZSTDLIB_API size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
-                                              void* dst, size_t dstCapacity,
-                                        const void* src, size_t srcSize,
-                                        const ZSTD_DDict* ddict);
+											  void* dst, size_t dstCapacity,
+										const void* src, size_t srcSize,
+										const ZSTD_DDict* ddict);
 
 
 /****************************
@@ -379,24 +379,24 @@ static const size_t ZSTD_skippableHeaderSize = 8;  /* magic number + skippable f
 typedef enum { ZSTD_fast, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2, ZSTD_btlazy2, ZSTD_btopt, ZSTD_btopt2 } ZSTD_strategy;   /* from faster to stronger */
 
 typedef struct {
-    unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
-    unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
-    unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
-    unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
-    unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
-    unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
-    ZSTD_strategy strategy;
+	unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
+	unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
+	unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
+	unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
+	unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
+	unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
+	ZSTD_strategy strategy;
 } ZSTD_compressionParameters;
 
 typedef struct {
-    unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
-    unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
-    unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
+	unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
+	unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
+	unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
 } ZSTD_frameParameters;
 
 typedef struct {
-    ZSTD_compressionParameters cParams;
-    ZSTD_frameParameters fParams;
+	ZSTD_compressionParameters cParams;
+	ZSTD_frameParameters fParams;
 } ZSTD_parameters;
 
 /*= Custom memory allocation functions */
@@ -470,8 +470,8 @@ ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem);
 ZSTDLIB_API size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);
 
 typedef enum {
-    ZSTD_p_forceWindow,   /* Force back-references to remain < windowSize, even when referencing Dictionary content (default:0) */
-    ZSTD_p_forceRawDict   /* Force loading dictionary in "content-only" mode (no header analysis) */
+	ZSTD_p_forceWindow,   /* Force back-references to remain < windowSize, even when referencing Dictionary content (default:0) */
+	ZSTD_p_forceRawDict   /* Force loading dictionary in "content-only" mode (no header analysis) */
 } ZSTD_CCtxParameter;
 /*! ZSTD_setCCtxParameter() :
  *  Set advanced parameters, selected through enum ZSTD_CCtxParameter
@@ -487,7 +487,7 @@ ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, siz
 /*! ZSTD_createCDict_advanced() :
  *  Create a ZSTD_CDict using external alloc and free, and customized compression parameters */
 ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize, unsigned byReference,
-                                                  ZSTD_parameters params, ZSTD_customMem customMem);
+												  ZSTD_parameters params, ZSTD_customMem customMem);
 
 /*! ZSTD_sizeof_CDict() :
  *  Gives the amount of memory used by a given ZSTD_sizeof_CDict */
@@ -515,10 +515,10 @@ ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParame
 /*! ZSTD_compress_advanced() :
 *   Same as ZSTD_compress_usingDict(), with fine-tune control of each compression parameter */
 ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-                                           void* dst, size_t dstCapacity,
-                                     const void* src, size_t srcSize,
-                                     const void* dict,size_t dictSize,
-                                           ZSTD_parameters params);
+										   void* dst, size_t dstCapacity,
+									 const void* src, size_t srcSize,
+									 const void* dict,size_t dictSize,
+										   ZSTD_parameters params);
 
 
 /*--- Advanced decompression functions ---*/
@@ -551,7 +551,7 @@ ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, siz
 /*! ZSTD_createDDict_advanced() :
  *  Create a ZSTD_DDict using external alloc and free, optionally by reference */
 ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
-                                                  unsigned byReference, ZSTD_customMem customMem);
+												  unsigned byReference, ZSTD_customMem customMem);
 
 /*! ZSTD_sizeof_DDict() :
  *  Gives the amount of memory used by a given ZSTD_DDict */
@@ -591,7 +591,7 @@ ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
 ZSTDLIB_API size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   /**< pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
 ZSTDLIB_API size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
 ZSTDLIB_API size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
-                                             ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
+											 ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
 ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
 ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
 ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
@@ -632,12 +632,12 @@ ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
   - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffer only.
   - Interface is synchronous : input is consumed entirely and produce 1+ (or more) compressed blocks.
   - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.
-    Worst case evaluation is provided by ZSTD_compressBound().
-    ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
+	Worst case evaluation is provided by ZSTD_compressBound().
+	ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
   - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).
-    It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
+	It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
   - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.
-    In which case, it will "discard" the relevant memory section from its history.
+	In which case, it will "discard" the relevant memory section from its history.
 
   Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.
   It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.
@@ -675,8 +675,8 @@ ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapaci
   Frame parameters are extracted from the beginning of the compressed frame.
   Data fragment must be large enough to ensure successful decoding, typically `ZSTD_frameHeaderSize_max` bytes.
   @result : 0 : successful decoding, the `ZSTD_frameParams` structure is correctly filled.
-           >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
-           errorCode, which can be tested using ZSTD_isError().
+		   >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
+		   errorCode, which can be tested using ZSTD_isError().
 
   Start decompression, with ZSTD_decompressBegin() or ZSTD_decompressBegin_usingDict().
   Alternatively, you can copy a prepared context, using ZSTD_copyDCtx().
@@ -711,17 +711,17 @@ ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapaci
   c) Frame Content - any content (User Data) of length equal to Frame Size
   For skippable frames ZSTD_decompressContinue() always returns 0.
   For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0 what means that a frame is skippable.
-    Note : If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might actually be a Zstd encoded frame with no content.
-           For purposes of decompression, it is valid in both cases to skip the frame using
-           ZSTD_findFrameCompressedSize to find its size in bytes.
+	Note : If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might actually be a Zstd encoded frame with no content.
+		   For purposes of decompression, it is valid in both cases to skip the frame using
+		   ZSTD_findFrameCompressedSize to find its size in bytes.
   It also returns Frame Size as fparamsPtr->frameContentSize.
 */
 
 typedef struct {
-    unsigned long long frameContentSize;
-    unsigned windowSize;
-    unsigned dictID;
-    unsigned checksumFlag;
+	unsigned long long frameContentSize;
+	unsigned windowSize;
+	unsigned dictID;
+	unsigned checksumFlag;
 } ZSTD_frameParams;
 
 /*=====   Buffer-less streaming decompression functions  =====*/
@@ -735,29 +735,29 @@ typedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_
 ZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
 
 /**
-    Block functions
+	Block functions
 
-    Block functions produce and decode raw zstd blocks, without frame metadata.
-    Frame metadata cost is typically ~18 bytes, which can be non-negligible for very small blocks (< 100 bytes).
-    User will have to take in charge required information to regenerate data, such as compressed and content sizes.
+	Block functions produce and decode raw zstd blocks, without frame metadata.
+	Frame metadata cost is typically ~18 bytes, which can be non-negligible for very small blocks (< 100 bytes).
+	User will have to take in charge required information to regenerate data, such as compressed and content sizes.
 
-    A few rules to respect :
-    - Compressing and decompressing require a context structure
-      + Use ZSTD_createCCtx() and ZSTD_createDCtx()
-    - It is necessary to init context before starting
-      + compression : ZSTD_compressBegin()
-      + decompression : ZSTD_decompressBegin()
-      + variants _usingDict() are also allowed
-      + copyCCtx() and copyDCtx() work too
-    - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
-      + If you need to compress more, cut data into multiple blocks
-      + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
-    - When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
-      In which case, nothing is produced into `dst`.
-      + User must test for such outcome and deal directly with uncompressed data
-      + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
-      + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
-        Use ZSTD_insertBlock() in such a case.
+	A few rules to respect :
+	- Compressing and decompressing require a context structure
+	  + Use ZSTD_createCCtx() and ZSTD_createDCtx()
+	- It is necessary to init context before starting
+	  + compression : ZSTD_compressBegin()
+	  + decompression : ZSTD_decompressBegin()
+	  + variants _usingDict() are also allowed
+	  + copyCCtx() and copyDCtx() work too
+	- Block size is limited, it must be <= ZSTD_getBlockSizeMax()
+	  + If you need to compress more, cut data into multiple blocks
+	  + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
+	- When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
+	  In which case, nothing is produced into `dst`.
+	  + User must test for such outcome and deal directly with uncompressed data
+	  + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
+	  + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
+		Use ZSTD_insertBlock() in such a case.
 */
 
 #define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)   /* define, for static allocation */
diff --git a/contrib/linux-kernel/lib/bitstream.h b/contrib/linux-kernel/lib/bitstream.h
index 0e3d2fc55..546f6582b 100644
--- a/contrib/linux-kernel/lib/bitstream.h
+++ b/contrib/linux-kernel/lib/bitstream.h
@@ -10,9 +10,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -73,11 +73,11 @@ extern "C" {
 */
 typedef struct
 {
-    size_t bitContainer;
-    int    bitPos;
-    char*  startPtr;
-    char*  ptr;
-    char*  endPtr;
+	size_t bitContainer;
+	int    bitPos;
+	char*  startPtr;
+	char*  ptr;
+	char*  endPtr;
 } BIT_CStream_t;
 
 MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
@@ -108,17 +108,17 @@ MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
 **********************************************/
 typedef struct
 {
-    size_t   bitContainer;
-    unsigned bitsConsumed;
-    const char* ptr;
-    const char* start;
+	size_t   bitContainer;
+	unsigned bitsConsumed;
+	const char* ptr;
+	const char* start;
 } BIT_DStream_t;
 
 typedef enum { BIT_DStream_unfinished = 0,
-               BIT_DStream_endOfBuffer = 1,
-               BIT_DStream_completed = 2,
-               BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
-               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
+			   BIT_DStream_endOfBuffer = 1,
+			   BIT_DStream_completed = 2,
+			   BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
+			   /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
 
 MEM_STATIC size_t   BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
 MEM_STATIC size_t   BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
@@ -157,20 +157,20 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
 MEM_STATIC unsigned BIT_highbit32 (register U32 val)
 {
 #   if defined(_MSC_VER)   /* Visual */
-    unsigned long r=0;
-    _BitScanReverse ( &r, val );
-    return (unsigned) r;
+	unsigned long r=0;
+	_BitScanReverse ( &r, val );
+	return (unsigned) r;
 #   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
-    return 31 - __builtin_clz (val);
+	return 31 - __builtin_clz (val);
 #   else   /* Software version */
-    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
-    U32 v = val;
-    v |= v >> 1;
-    v |= v >> 2;
-    v |= v >> 4;
-    v |= v >> 8;
-    v |= v >> 16;
-    return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
+	static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+	U32 v = val;
+	v |= v >> 1;
+	v |= v >> 2;
+	v |= v >> 4;
+	v |= v >> 8;
+	v |= v >> 16;
+	return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
 #   endif
 }
 
@@ -184,44 +184,44 @@ static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F, 0xFF, 0x
 /*! BIT_initCStream() :
  *  `dstCapacity` must be > sizeof(void*)
  *  @return : 0 if success,
-              otherwise an error code (can be tested using ERR_isError() ) */
+			  otherwise an error code (can be tested using ERR_isError() ) */
 MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* startPtr, size_t dstCapacity)
 {
-    bitC->bitContainer = 0;
-    bitC->bitPos = 0;
-    bitC->startPtr = (char*)startPtr;
-    bitC->ptr = bitC->startPtr;
-    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
-    if (dstCapacity <= sizeof(bitC->ptr)) return ERROR(dstSize_tooSmall);
-    return 0;
+	bitC->bitContainer = 0;
+	bitC->bitPos = 0;
+	bitC->startPtr = (char*)startPtr;
+	bitC->ptr = bitC->startPtr;
+	bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
+	if (dstCapacity <= sizeof(bitC->ptr)) return ERROR(dstSize_tooSmall);
+	return 0;
 }
 
 /*! BIT_addBits() :
-    can add up to 26 bits into `bitC`.
-    Does not check for register overflow ! */
+	can add up to 26 bits into `bitC`.
+	Does not check for register overflow ! */
 MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
 {
-    bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
-    bitC->bitPos += nbBits;
+	bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
+	bitC->bitPos += nbBits;
 }
 
 /*! BIT_addBitsFast() :
  *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
 MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
 {
-    bitC->bitContainer |= value << bitC->bitPos;
-    bitC->bitPos += nbBits;
+	bitC->bitContainer |= value << bitC->bitPos;
+	bitC->bitPos += nbBits;
 }
 
 /*! BIT_flushBitsFast() :
  *  unsafe version; does not check buffer overflow */
 MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
 {
-    size_t const nbBytes = bitC->bitPos >> 3;
-    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
-    bitC->ptr += nbBytes;
-    bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+	size_t const nbBytes = bitC->bitPos >> 3;
+	MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+	bitC->ptr += nbBytes;
+	bitC->bitPos &= 7;
+	bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
 }
 
 /*! BIT_flushBits() :
@@ -229,25 +229,25 @@ MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
  *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
 MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
 {
-    size_t const nbBytes = bitC->bitPos >> 3;
-    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
-    bitC->ptr += nbBytes;
-    if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
-    bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+	size_t const nbBytes = bitC->bitPos >> 3;
+	MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+	bitC->ptr += nbBytes;
+	if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
+	bitC->bitPos &= 7;
+	bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
 }
 
 /*! BIT_closeCStream() :
  *  @return : size of CStream, in bytes,
-              or 0 if it could not fit into dstBuffer */
+			  or 0 if it could not fit into dstBuffer */
 MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
 {
-    BIT_addBitsFast(bitC, 1, 1);   /* endMark */
-    BIT_flushBits(bitC);
+	BIT_addBitsFast(bitC, 1, 1);   /* endMark */
+	BIT_flushBits(bitC);
 
-    if (bitC->ptr >= bitC->endPtr) return 0; /* doesn't fit within authorized budget : cancel */
+	if (bitC->ptr >= bitC->endPtr) return 0; /* doesn't fit within authorized budget : cancel */
 
-    return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
+	return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
 }
 
 
@@ -262,60 +262,60 @@ MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
 */
 MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
 {
-    if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
+	if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
 
-    if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
-          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
-          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
-    } else {
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = bitD->start;
-        bitD->bitContainer = *(const BYTE*)(bitD->start);
-        switch(srcSize)
-        {
-            case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
-            case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
-            case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
-            case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
-            case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
-            case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) <<  8;
-            default:;
-        }
-        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
-          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
-          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
-        bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
-    }
+	if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
+		bitD->start = (const char*)srcBuffer;
+		bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
+		bitD->bitContainer = MEM_readLEST(bitD->ptr);
+		{ BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+		  bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
+		  if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
+	} else {
+		bitD->start = (const char*)srcBuffer;
+		bitD->ptr   = bitD->start;
+		bitD->bitContainer = *(const BYTE*)(bitD->start);
+		switch(srcSize)
+		{
+			case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
+			case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
+			case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
+			case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
+			case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
+			case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) <<  8;
+			default:;
+		}
+		{ BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+		  bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
+		  if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
+		bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
+	}
 
-    return srcSize;
+	return srcSize;
 }
 
 MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
 {
-    return bitContainer >> start;
+	return bitContainer >> start;
 }
 
 MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
 {
 #if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008  /* experimental */
 #  if defined(__x86_64__)
-    if (sizeof(bitContainer)==8)
-        return _bextr_u64(bitContainer, start, nbBits);
-    else
+	if (sizeof(bitContainer)==8)
+		return _bextr_u64(bitContainer, start, nbBits);
+	else
 #  endif
-        return _bextr_u32(bitContainer, start, nbBits);
+		return _bextr_u32(bitContainer, start, nbBits);
 #else
-    return (bitContainer >> start) & BIT_mask[nbBits];
+	return (bitContainer >> start) & BIT_mask[nbBits];
 #endif
 }
 
 MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
 {
-    return bitContainer & BIT_mask[nbBits];
+	return bitContainer & BIT_mask[nbBits];
 }
 
 /*! BIT_lookBits() :
@@ -328,10 +328,10 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
  MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
 {
 #if defined(__BMI__) && defined(__GNUC__)   /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
-    return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
+	return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
 #else
-    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
+	U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+	return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
 #endif
 }
 
@@ -339,13 +339,13 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
 *   unsafe version; only works only if nbBits >= 1 */
 MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
 {
-    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
+	U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+	return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
 }
 
 MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
 {
-    bitD->bitsConsumed += nbBits;
+	bitD->bitsConsumed += nbBits;
 }
 
 /*! BIT_readBits() :
@@ -355,51 +355,51 @@ MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
  */
 MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
 {
-    size_t const value = BIT_lookBits(bitD, nbBits);
-    BIT_skipBits(bitD, nbBits);
-    return value;
+	size_t const value = BIT_lookBits(bitD, nbBits);
+	BIT_skipBits(bitD, nbBits);
+	return value;
 }
 
 /*! BIT_readBitsFast() :
 *   unsafe version; only works only if nbBits >= 1 */
 MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
 {
-    size_t const value = BIT_lookBitsFast(bitD, nbBits);
-    BIT_skipBits(bitD, nbBits);
-    return value;
+	size_t const value = BIT_lookBitsFast(bitD, nbBits);
+	BIT_skipBits(bitD, nbBits);
+	return value;
 }
 
 /*! BIT_reloadDStream() :
 *   Refill `bitD` from buffer previously set in BIT_initDStream() .
 *   This function is safe, it guarantees it will not read beyond src buffer.
 *   @return : status of `BIT_DStream_t` internal register.
-              if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
+			  if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
-        return BIT_DStream_overflow;
+	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
+		return BIT_DStream_overflow;
 
-    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
-        bitD->ptr -= bitD->bitsConsumed >> 3;
-        bitD->bitsConsumed &= 7;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        return BIT_DStream_unfinished;
-    }
-    if (bitD->ptr == bitD->start) {
-        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
-        return BIT_DStream_completed;
-    }
-    {   U32 nbBytes = bitD->bitsConsumed >> 3;
-        BIT_DStream_status result = BIT_DStream_unfinished;
-        if (bitD->ptr - nbBytes < bitD->start) {
-            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
-            result = BIT_DStream_endOfBuffer;
-        }
-        bitD->ptr -= nbBytes;
-        bitD->bitsConsumed -= nbBytes*8;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
-        return result;
-    }
+	if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
+		bitD->ptr -= bitD->bitsConsumed >> 3;
+		bitD->bitsConsumed &= 7;
+		bitD->bitContainer = MEM_readLEST(bitD->ptr);
+		return BIT_DStream_unfinished;
+	}
+	if (bitD->ptr == bitD->start) {
+		if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
+		return BIT_DStream_completed;
+	}
+	{   U32 nbBytes = bitD->bitsConsumed >> 3;
+		BIT_DStream_status result = BIT_DStream_unfinished;
+		if (bitD->ptr - nbBytes < bitD->start) {
+			nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
+			result = BIT_DStream_endOfBuffer;
+		}
+		bitD->ptr -= nbBytes;
+		bitD->bitsConsumed -= nbBytes*8;
+		bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
+		return result;
+	}
 }
 
 /*! BIT_endOfDStream() :
@@ -407,7 +407,7 @@ MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 */
 MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
 {
-    return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
+	return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
 }
 
 #if defined (__cplusplus)
diff --git a/contrib/linux-kernel/lib/entropy_common.c b/contrib/linux-kernel/lib/entropy_common.c
index b37a082fe..c9d489bc7 100644
--- a/contrib/linux-kernel/lib/entropy_common.c
+++ b/contrib/linux-kernel/lib/entropy_common.c
@@ -8,9 +8,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -27,9 +27,9 @@
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+	You can contact the author at :
+	- FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 *************************************************************************** */
 
 /* *************************************
@@ -59,163 +59,163 @@ const char* HUF_getErrorName(size_t code) { return ERR_getErrorName(code); }
 *  FSE NCount encoding-decoding
 ****************************************************************/
 size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
-                 const void* headerBuffer, size_t hbSize)
+				 const void* headerBuffer, size_t hbSize)
 {
-    const BYTE* const istart = (const BYTE*) headerBuffer;
-    const BYTE* const iend = istart + hbSize;
-    const BYTE* ip = istart;
-    int nbBits;
-    int remaining;
-    int threshold;
-    U32 bitStream;
-    int bitCount;
-    unsigned charnum = 0;
-    int previous0 = 0;
+	const BYTE* const istart = (const BYTE*) headerBuffer;
+	const BYTE* const iend = istart + hbSize;
+	const BYTE* ip = istart;
+	int nbBits;
+	int remaining;
+	int threshold;
+	U32 bitStream;
+	int bitCount;
+	unsigned charnum = 0;
+	int previous0 = 0;
 
-    if (hbSize < 4) return ERROR(srcSize_wrong);
-    bitStream = MEM_readLE32(ip);
-    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
-    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
-    bitStream >>= 4;
-    bitCount = 4;
-    *tableLogPtr = nbBits;
-    remaining = (1<<nbBits)+1;
-    threshold = 1<<nbBits;
-    nbBits++;
+	if (hbSize < 4) return ERROR(srcSize_wrong);
+	bitStream = MEM_readLE32(ip);
+	nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
+	if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
+	bitStream >>= 4;
+	bitCount = 4;
+	*tableLogPtr = nbBits;
+	remaining = (1<<nbBits)+1;
+	threshold = 1<<nbBits;
+	nbBits++;
 
-    while ((remaining>1) & (charnum<=*maxSVPtr)) {
-        if (previous0) {
-            unsigned n0 = charnum;
-            while ((bitStream & 0xFFFF) == 0xFFFF) {
-                n0 += 24;
-                if (ip < iend-5) {
-                    ip += 2;
-                    bitStream = MEM_readLE32(ip) >> bitCount;
-                } else {
-                    bitStream >>= 16;
-                    bitCount   += 16;
-            }   }
-            while ((bitStream & 3) == 3) {
-                n0 += 3;
-                bitStream >>= 2;
-                bitCount += 2;
-            }
-            n0 += bitStream & 3;
-            bitCount += 2;
-            if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
-            while (charnum < n0) normalizedCounter[charnum++] = 0;
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
-                ip += bitCount>>3;
-                bitCount &= 7;
-                bitStream = MEM_readLE32(ip) >> bitCount;
-            } else {
-                bitStream >>= 2;
-        }   }
-        {   int const max = (2*threshold-1) - remaining;
-            int count;
+	while ((remaining>1) & (charnum<=*maxSVPtr)) {
+		if (previous0) {
+			unsigned n0 = charnum;
+			while ((bitStream & 0xFFFF) == 0xFFFF) {
+				n0 += 24;
+				if (ip < iend-5) {
+					ip += 2;
+					bitStream = MEM_readLE32(ip) >> bitCount;
+				} else {
+					bitStream >>= 16;
+					bitCount   += 16;
+			}   }
+			while ((bitStream & 3) == 3) {
+				n0 += 3;
+				bitStream >>= 2;
+				bitCount += 2;
+			}
+			n0 += bitStream & 3;
+			bitCount += 2;
+			if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
+			while (charnum < n0) normalizedCounter[charnum++] = 0;
+			if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+				ip += bitCount>>3;
+				bitCount &= 7;
+				bitStream = MEM_readLE32(ip) >> bitCount;
+			} else {
+				bitStream >>= 2;
+		}   }
+		{   int const max = (2*threshold-1) - remaining;
+			int count;
 
-            if ((bitStream & (threshold-1)) < (U32)max) {
-                count = bitStream & (threshold-1);
-                bitCount += nbBits-1;
-            } else {
-                count = bitStream & (2*threshold-1);
-                if (count >= threshold) count -= max;
-                bitCount += nbBits;
-            }
+			if ((bitStream & (threshold-1)) < (U32)max) {
+				count = bitStream & (threshold-1);
+				bitCount += nbBits-1;
+			} else {
+				count = bitStream & (2*threshold-1);
+				if (count >= threshold) count -= max;
+				bitCount += nbBits;
+			}
 
-            count--;   /* extra accuracy */
-            remaining -= count < 0 ? -count : count;   /* -1 means +1 */
-            normalizedCounter[charnum++] = (short)count;
-            previous0 = !count;
-            while (remaining < threshold) {
-                nbBits--;
-                threshold >>= 1;
-            }
+			count--;   /* extra accuracy */
+			remaining -= count < 0 ? -count : count;   /* -1 means +1 */
+			normalizedCounter[charnum++] = (short)count;
+			previous0 = !count;
+			while (remaining < threshold) {
+				nbBits--;
+				threshold >>= 1;
+			}
 
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
-                ip += bitCount>>3;
-                bitCount &= 7;
-            } else {
-                bitCount -= (int)(8 * (iend - 4 - ip));
-                ip = iend - 4;
-            }
-            bitStream = MEM_readLE32(ip) >> (bitCount & 31);
-    }   }   /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
-    if (remaining != 1) return ERROR(corruption_detected);
-    if (bitCount > 32) return ERROR(corruption_detected);
-    *maxSVPtr = charnum-1;
+			if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+				ip += bitCount>>3;
+				bitCount &= 7;
+			} else {
+				bitCount -= (int)(8 * (iend - 4 - ip));
+				ip = iend - 4;
+			}
+			bitStream = MEM_readLE32(ip) >> (bitCount & 31);
+	}   }   /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
+	if (remaining != 1) return ERROR(corruption_detected);
+	if (bitCount > 32) return ERROR(corruption_detected);
+	*maxSVPtr = charnum-1;
 
-    ip += (bitCount+7)>>3;
-    return ip-istart;
+	ip += (bitCount+7)>>3;
+	return ip-istart;
 }
 
 
 /*! HUF_readStats() :
-    Read compact Huffman tree, saved by HUF_writeCTable().
-    `huffWeight` is destination buffer.
-    `rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
-    @return : size read from `src` , or an error Code .
-    Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
+	Read compact Huffman tree, saved by HUF_writeCTable().
+	`huffWeight` is destination buffer.
+	`rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
+	@return : size read from `src` , or an error Code .
+	Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
 */
 size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
-                     U32* nbSymbolsPtr, U32* tableLogPtr,
-                     const void* src, size_t srcSize)
+					 U32* nbSymbolsPtr, U32* tableLogPtr,
+					 const void* src, size_t srcSize)
 {
-    U32 weightTotal;
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize;
-    size_t oSize;
+	U32 weightTotal;
+	const BYTE* ip = (const BYTE*) src;
+	size_t iSize;
+	size_t oSize;
 
-    if (!srcSize) return ERROR(srcSize_wrong);
-    iSize = ip[0];
-    /* memset(huffWeight, 0, hwSize);   *//* is not necessary, even though some analyzer complain ... */
+	if (!srcSize) return ERROR(srcSize_wrong);
+	iSize = ip[0];
+	/* memset(huffWeight, 0, hwSize);   *//* is not necessary, even though some analyzer complain ... */
 
-    if (iSize >= 128) {  /* special header */
-        oSize = iSize - 127;
-        iSize = ((oSize+1)/2);
-        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-        if (oSize >= hwSize) return ERROR(corruption_detected);
-        ip += 1;
-        {   U32 n;
-            for (n=0; n<oSize; n+=2) {
-                huffWeight[n]   = ip[n/2] >> 4;
-                huffWeight[n+1] = ip[n/2] & 15;
-    }   }   }
-    else  {   /* header compressed with FSE (normal case) */
-        FSE_DTable fseWorkspace[FSE_DTABLE_SIZE_U32(6)];  /* 6 is max possible tableLog for HUF header (maybe even 5, to be tested) */
-        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-        oSize = FSE_decompress_wksp(huffWeight, hwSize-1, ip+1, iSize, fseWorkspace, 6);   /* max (hwSize-1) values decoded, as last one is implied */
-        if (FSE_isError(oSize)) return oSize;
-    }
+	if (iSize >= 128) {  /* special header */
+		oSize = iSize - 127;
+		iSize = ((oSize+1)/2);
+		if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+		if (oSize >= hwSize) return ERROR(corruption_detected);
+		ip += 1;
+		{   U32 n;
+			for (n=0; n<oSize; n+=2) {
+				huffWeight[n]   = ip[n/2] >> 4;
+				huffWeight[n+1] = ip[n/2] & 15;
+	}   }   }
+	else  {   /* header compressed with FSE (normal case) */
+		FSE_DTable fseWorkspace[FSE_DTABLE_SIZE_U32(6)];  /* 6 is max possible tableLog for HUF header (maybe even 5, to be tested) */
+		if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+		oSize = FSE_decompress_wksp(huffWeight, hwSize-1, ip+1, iSize, fseWorkspace, 6);   /* max (hwSize-1) values decoded, as last one is implied */
+		if (FSE_isError(oSize)) return oSize;
+	}
 
-    /* collect weight stats */
-    memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
-    weightTotal = 0;
-    {   U32 n; for (n=0; n<oSize; n++) {
-            if (huffWeight[n] >= HUF_TABLELOG_MAX) return ERROR(corruption_detected);
-            rankStats[huffWeight[n]]++;
-            weightTotal += (1 << huffWeight[n]) >> 1;
-    }   }
-    if (weightTotal == 0) return ERROR(corruption_detected);
+	/* collect weight stats */
+	memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
+	weightTotal = 0;
+	{   U32 n; for (n=0; n<oSize; n++) {
+			if (huffWeight[n] >= HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+			rankStats[huffWeight[n]]++;
+			weightTotal += (1 << huffWeight[n]) >> 1;
+	}   }
+	if (weightTotal == 0) return ERROR(corruption_detected);
 
-    /* get last non-null symbol weight (implied, total must be 2^n) */
-    {   U32 const tableLog = BIT_highbit32(weightTotal) + 1;
-        if (tableLog > HUF_TABLELOG_MAX) return ERROR(corruption_detected);
-        *tableLogPtr = tableLog;
-        /* determine last weight */
-        {   U32 const total = 1 << tableLog;
-            U32 const rest = total - weightTotal;
-            U32 const verif = 1 << BIT_highbit32(rest);
-            U32 const lastWeight = BIT_highbit32(rest) + 1;
-            if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
-            huffWeight[oSize] = (BYTE)lastWeight;
-            rankStats[lastWeight]++;
-    }   }
+	/* get last non-null symbol weight (implied, total must be 2^n) */
+	{   U32 const tableLog = BIT_highbit32(weightTotal) + 1;
+		if (tableLog > HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+		*tableLogPtr = tableLog;
+		/* determine last weight */
+		{   U32 const total = 1 << tableLog;
+			U32 const rest = total - weightTotal;
+			U32 const verif = 1 << BIT_highbit32(rest);
+			U32 const lastWeight = BIT_highbit32(rest) + 1;
+			if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
+			huffWeight[oSize] = (BYTE)lastWeight;
+			rankStats[lastWeight]++;
+	}   }
 
-    /* check tree construction validity */
-    if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
+	/* check tree construction validity */
+	if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
 
-    /* results */
-    *nbSymbolsPtr = (U32)(oSize+1);
-    return iSize+1;
+	/* results */
+	*nbSymbolsPtr = (U32)(oSize+1);
+	return iSize+1;
 }
diff --git a/contrib/linux-kernel/lib/error_private.c b/contrib/linux-kernel/lib/error_private.c
index 44ae20104..83e27cb49 100644
--- a/contrib/linux-kernel/lib/error_private.c
+++ b/contrib/linux-kernel/lib/error_private.c
@@ -13,32 +13,32 @@
 
 const char* ERR_getErrorString(ERR_enum code)
 {
-    static const char* const notErrorCode = "Unspecified error code";
-    switch( code )
-    {
-    case PREFIX(no_error): return "No error detected";
-    case PREFIX(GENERIC):  return "Error (generic)";
-    case PREFIX(prefix_unknown): return "Unknown frame descriptor";
-    case PREFIX(version_unsupported): return "Version not supported";
-    case PREFIX(parameter_unknown): return "Unknown parameter type";
-    case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
-    case PREFIX(frameParameter_unsupportedBy32bits): return "Frame parameter unsupported in 32-bits mode";
-    case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
-    case PREFIX(compressionParameter_unsupported): return "Compression parameter is out of bound";
-    case PREFIX(init_missing): return "Context should be init first";
-    case PREFIX(memory_allocation): return "Allocation error : not enough memory";
-    case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
-    case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
-    case PREFIX(srcSize_wrong): return "Src size incorrect";
-    case PREFIX(corruption_detected): return "Corrupted block detected";
-    case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
-    case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
-    case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
-    case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
-    case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
-    case PREFIX(dictionary_wrong): return "Dictionary mismatch";
-    case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
-    case PREFIX(maxCode):
-    default: return notErrorCode;
-    }
+	static const char* const notErrorCode = "Unspecified error code";
+	switch( code )
+	{
+	case PREFIX(no_error): return "No error detected";
+	case PREFIX(GENERIC):  return "Error (generic)";
+	case PREFIX(prefix_unknown): return "Unknown frame descriptor";
+	case PREFIX(version_unsupported): return "Version not supported";
+	case PREFIX(parameter_unknown): return "Unknown parameter type";
+	case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
+	case PREFIX(frameParameter_unsupportedBy32bits): return "Frame parameter unsupported in 32-bits mode";
+	case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
+	case PREFIX(compressionParameter_unsupported): return "Compression parameter is out of bound";
+	case PREFIX(init_missing): return "Context should be init first";
+	case PREFIX(memory_allocation): return "Allocation error : not enough memory";
+	case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
+	case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
+	case PREFIX(srcSize_wrong): return "Src size incorrect";
+	case PREFIX(corruption_detected): return "Corrupted block detected";
+	case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
+	case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
+	case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
+	case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
+	case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
+	case PREFIX(dictionary_wrong): return "Dictionary mismatch";
+	case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
+	case PREFIX(maxCode):
+	default: return notErrorCode;
+	}
 }
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index 1bc2e4954..dc160914b 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -66,7 +66,7 @@ const char* ERR_getErrorString(ERR_enum code);   /* error_private.c */
 
 ERR_STATIC const char* ERR_getErrorName(size_t code)
 {
-    return ERR_getErrorString(ERR_getErrorCode(code));
+	return ERR_getErrorString(ERR_getErrorCode(code));
 }
 
 #if defined (__cplusplus)
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index baac39032..bcb592e96 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -9,9 +9,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -75,28 +75,28 @@ FSE_PUBLIC_API unsigned FSE_versionNumber(void);   /**< library version number;
 *  FSE simple functions
 ******************************************/
 /*! FSE_compress() :
-    Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
-    'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
-    @return : size of compressed data (<= dstCapacity).
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
-                     if FSE_isError(return), compression failed (more details using FSE_getErrorName())
+	Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
+	'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
+	@return : size of compressed data (<= dstCapacity).
+	Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+					 if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
+					 if FSE_isError(return), compression failed (more details using FSE_getErrorName())
 */
 FSE_PUBLIC_API size_t FSE_compress(void* dst, size_t dstCapacity,
-                             const void* src, size_t srcSize);
+							 const void* src, size_t srcSize);
 
 /*! FSE_decompress():
-    Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
-    into already allocated destination buffer 'dst', of size 'dstCapacity'.
-    @return : size of regenerated data (<= maxDstSize),
-              or an error code, which can be tested using FSE_isError() .
+	Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
+	into already allocated destination buffer 'dst', of size 'dstCapacity'.
+	@return : size of regenerated data (<= maxDstSize),
+			  or an error code, which can be tested using FSE_isError() .
 
-    ** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
-    Why ? : making this distinction requires a header.
-    Header management is intentionally delegated to the user layer, which can better manage special cases.
+	** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
+	Why ? : making this distinction requires a header.
+	Header management is intentionally delegated to the user layer, which can better manage special cases.
 */
 FSE_PUBLIC_API size_t FSE_decompress(void* dst,  size_t dstCapacity,
-                               const void* cSrc, size_t cSrcSize);
+							   const void* cSrc, size_t cSrcSize);
 
 
 /*-*****************************************
@@ -113,12 +113,12 @@ FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error co
 *  FSE advanced functions
 ******************************************/
 /*! FSE_compress2() :
-    Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
-    Both parameters can be defined as '0' to mean : use default value
-    @return : size of compressed data
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
-                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
-                     if FSE_isError(return), it's an error code.
+	Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
+	Both parameters can be defined as '0' to mean : use default value
+	@return : size of compressed data
+	Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
+					 if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
+					 if FSE_isError(return), it's an error code.
 */
 FSE_PUBLIC_API size_t FSE_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
 
@@ -147,55 +147,55 @@ or to save and provide normalized distribution using external method.
 /* *** COMPRESSION *** */
 
 /*! FSE_count():
-    Provides the precise count of each byte within a table 'count'.
-    'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
-    *maxSymbolValuePtr will be updated if detected smaller than initial value.
-    @return : the count of the most frequent symbol (which is not identified).
-              if return == srcSize, there is only one symbol.
-              Can also return an error code, which can be tested with FSE_isError(). */
+	Provides the precise count of each byte within a table 'count'.
+	'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
+	*maxSymbolValuePtr will be updated if detected smaller than initial value.
+	@return : the count of the most frequent symbol (which is not identified).
+			  if return == srcSize, there is only one symbol.
+			  Can also return an error code, which can be tested with FSE_isError(). */
 FSE_PUBLIC_API size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
 
 /*! FSE_optimalTableLog():
-    dynamically downsize 'tableLog' when conditions are met.
-    It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
-    @return : recommended tableLog (necessarily <= 'maxTableLog') */
+	dynamically downsize 'tableLog' when conditions are met.
+	It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
+	@return : recommended tableLog (necessarily <= 'maxTableLog') */
 FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
 
 /*! FSE_normalizeCount():
-    normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
-    'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
-    @return : tableLog,
-              or an errorCode, which can be tested using FSE_isError() */
+	normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
+	'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
+	@return : tableLog,
+			  or an errorCode, which can be tested using FSE_isError() */
 FSE_PUBLIC_API size_t FSE_normalizeCount(short* normalizedCounter, unsigned tableLog, const unsigned* count, size_t srcSize, unsigned maxSymbolValue);
 
 /*! FSE_NCountWriteBound():
-    Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
-    Typically useful for allocation purpose. */
+	Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
+	Typically useful for allocation purpose. */
 FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
 
 /*! FSE_writeNCount():
-    Compactly save 'normalizedCounter' into 'buffer'.
-    @return : size of the compressed table,
-              or an errorCode, which can be tested using FSE_isError(). */
+	Compactly save 'normalizedCounter' into 'buffer'.
+	@return : size of the compressed table,
+			  or an errorCode, which can be tested using FSE_isError(). */
 FSE_PUBLIC_API size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
 
 
 /*! Constructor and Destructor of FSE_CTable.
-    Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
+	Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
 typedef unsigned FSE_CTable;   /* don't allocate that. It's only meant to be more restrictive than void* */
 FSE_PUBLIC_API FSE_CTable* FSE_createCTable (unsigned tableLog, unsigned maxSymbolValue);
 FSE_PUBLIC_API void        FSE_freeCTable (FSE_CTable* ct);
 
 /*! FSE_buildCTable():
-    Builds `ct`, which must be already allocated, using FSE_createCTable().
-    @return : 0, or an errorCode, which can be tested using FSE_isError() */
+	Builds `ct`, which must be already allocated, using FSE_createCTable().
+	@return : 0, or an errorCode, which can be tested using FSE_isError() */
 FSE_PUBLIC_API size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
 
 /*! FSE_compress_usingCTable():
-    Compress `src` using `ct` into `dst` which must be already allocated.
-    @return : size of compressed data (<= `dstCapacity`),
-              or 0 if compressed data could not fit into `dst`,
-              or an errorCode, which can be tested using FSE_isError() */
+	Compress `src` using `ct` into `dst` which must be already allocated.
+	@return : size of compressed data (<= `dstCapacity`),
+			  or 0 if compressed data could not fit into `dst`,
+			  or an errorCode, which can be tested using FSE_isError() */
 FSE_PUBLIC_API size_t FSE_compress_usingCTable (void* dst, size_t dstCapacity, const void* src, size_t srcSize, const FSE_CTable* ct);
 
 /*!
@@ -245,28 +245,28 @@ If there is an error, the function will return an ErrorCode (which can be tested
 /* *** DECOMPRESSION *** */
 
 /*! FSE_readNCount():
-    Read compactly saved 'normalizedCounter' from 'rBuffer'.
-    @return : size read from 'rBuffer',
-              or an errorCode, which can be tested using FSE_isError().
-              maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
+	Read compactly saved 'normalizedCounter' from 'rBuffer'.
+	@return : size read from 'rBuffer',
+			  or an errorCode, which can be tested using FSE_isError().
+			  maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
 FSE_PUBLIC_API size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSymbolValuePtr, unsigned* tableLogPtr, const void* rBuffer, size_t rBuffSize);
 
 /*! Constructor and Destructor of FSE_DTable.
-    Note that its size depends on 'tableLog' */
+	Note that its size depends on 'tableLog' */
 typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
 FSE_PUBLIC_API FSE_DTable* FSE_createDTable(unsigned tableLog);
 FSE_PUBLIC_API void        FSE_freeDTable(FSE_DTable* dt);
 
 /*! FSE_buildDTable():
-    Builds 'dt', which must be already allocated, using FSE_createDTable().
-    return : 0, or an errorCode, which can be tested using FSE_isError() */
+	Builds 'dt', which must be already allocated, using FSE_createDTable().
+	return : 0, or an errorCode, which can be tested using FSE_isError() */
 FSE_PUBLIC_API size_t FSE_buildDTable (FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
 
 /*! FSE_decompress_usingDTable():
-    Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
-    into `dst` which must be already allocated.
-    @return : size of regenerated data (necessarily <= `dstCapacity`),
-              or an errorCode, which can be tested using FSE_isError() */
+	Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
+	into `dst` which must be already allocated.
+	@return : size of regenerated data (necessarily <= `dstCapacity`),
+			  or an errorCode, which can be tested using FSE_isError() */
 FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, const FSE_DTable* dt);
 
 /*!
@@ -325,7 +325,7 @@ If there is an error, the function will return an error code, which can be teste
  * `workSpace` size must be table of >= `1024` unsigned
  */
 size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* source, size_t sourceSize, unsigned* workSpace);
+				 const void* source, size_t sourceSize, unsigned* workSpace);
 
 /** FSE_countFast() :
  *  same as FSE_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr
@@ -386,10 +386,10 @@ size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size
    Hence their body are included in next section.
 */
 typedef struct {
-    ptrdiff_t   value;
-    const void* stateTable;
-    const void* symbolTT;
-    unsigned    stateLog;
+	ptrdiff_t   value;
+	const void* stateTable;
+	const void* symbolTT;
+	unsigned    stateLog;
 } FSE_CState_t;
 
 static void FSE_initCState(FSE_CState_t* CStatePtr, const FSE_CTable* ct);
@@ -413,32 +413,32 @@ FSE_CState_t  state;      // State tracking structure (can have several)
 
 
 The first thing to do is to init bitStream and state.
-    size_t errorCode = BIT_initCStream(&bitStream, dstBuffer, maxDstSize);
-    FSE_initCState(&state, ct);
+	size_t errorCode = BIT_initCStream(&bitStream, dstBuffer, maxDstSize);
+	FSE_initCState(&state, ct);
 
 Note that BIT_initCStream() can produce an error code, so its result should be tested, using FSE_isError();
 You can then encode your input data, byte after byte.
 FSE_encodeSymbol() outputs a maximum of 'tableLog' bits at a time.
 Remember decoding will be done in reverse direction.
-    FSE_encodeByte(&bitStream, &state, symbol);
+	FSE_encodeByte(&bitStream, &state, symbol);
 
 At any time, you can also add any bit sequence.
 Note : maximum allowed nbBits is 25, for compatibility with 32-bits decoders
-    BIT_addBits(&bitStream, bitField, nbBits);
+	BIT_addBits(&bitStream, bitField, nbBits);
 
 The above methods don't commit data to memory, they just store it into local register, for speed.
 Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
 Writing data to memory is a manual operation, performed by the flushBits function.
-    BIT_flushBits(&bitStream);
+	BIT_flushBits(&bitStream);
 
 Your last FSE encoding operation shall be to flush your last state value(s).
-    FSE_flushState(&bitStream, &state);
+	FSE_flushState(&bitStream, &state);
 
 Finally, you must close the bitStream.
 The function returns the size of CStream in bytes.
 If data couldn't fit into dstBuffer, it will return a 0 ( == not compressible)
 If there is an error, it returns an errorCode (which can be tested using FSE_isError()).
-    size_t size = BIT_closeCStream(&bitStream);
+	size_t size = BIT_closeCStream(&bitStream);
 */
 
 
@@ -446,8 +446,8 @@ If there is an error, it returns an errorCode (which can be tested using FSE_isE
 *  FSE symbol decompression API
 *******************************************/
 typedef struct {
-    size_t      state;
-    const void* table;   /* precise table may vary, depending on U16 */
+	size_t      state;
+	const void* table;   /* precise table may vary, depending on U16 */
 } FSE_DState_t;
 
 
@@ -469,24 +469,24 @@ FSE_DState_t  DState;     // State context. Multiple ones are possible
 FSE_DTable*   DTablePtr;  // Decoding table, provided by FSE_buildDTable()
 
 The first thing to do is to init the bitStream.
-    errorCode = BIT_initDStream(&DStream, srcBuffer, srcSize);
+	errorCode = BIT_initDStream(&DStream, srcBuffer, srcSize);
 
 You should then retrieve your initial state(s)
 (in reverse flushing order if you have several ones) :
-    errorCode = FSE_initDState(&DState, &DStream, DTablePtr);
+	errorCode = FSE_initDState(&DState, &DStream, DTablePtr);
 
 You can then decode your data, symbol after symbol.
 For information the maximum number of bits read by FSE_decodeSymbol() is 'tableLog'.
 Keep in mind that symbols are decoded in reverse order, like a LIFO stack (last in, first out).
-    unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
+	unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
 
 You can retrieve any bitfield you eventually stored into the bitStream (in reverse order)
 Note : maximum allowed nbBits is 25, for 32-bits compatibility
-    size_t bitField = BIT_readBits(&DStream, nbBits);
+	size_t bitField = BIT_readBits(&DStream, nbBits);
 
 All above operations only read from local register (which size depends on size_t).
 Refueling the register from memory is manually performed by the reload method.
-    endSignal = FSE_reloadDStream(&DStream);
+	endSignal = FSE_reloadDStream(&DStream);
 
 BIT_reloadDStream() result tells if there is still some more data to read from DStream.
 BIT_DStream_unfinished : there is still some data left into the DStream.
@@ -497,13 +497,13 @@ BIT_DStream_tooFar : Dstream went too far. Decompression result is corrupted.
 When reaching end of buffer (BIT_DStream_endOfBuffer), progress slowly, notably if you decode multiple symbols per loop,
 to properly detect the exact end of stream.
 After each decoded symbol, check if DStream is fully consumed using this simple test :
-    BIT_reloadDStream(&DStream) >= BIT_DStream_completed
+	BIT_reloadDStream(&DStream) >= BIT_DStream_completed
 
 When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
 Checking if DStream has reached its end is performed by :
-    BIT_endOfDStream(&DStream);
+	BIT_endOfDStream(&DStream);
 Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
-    FSE_endOfDState(&DState);
+	FSE_endOfDState(&DState);
 */
 
 
@@ -518,19 +518,19 @@ static unsigned char FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t
 *  Implementation of inlined functions
 *******************************************/
 typedef struct {
-    int deltaFindState;
-    U32 deltaNbBits;
+	int deltaFindState;
+	U32 deltaNbBits;
 } FSE_symbolCompressionTransform; /* total 8 bytes */
 
 MEM_STATIC void FSE_initCState(FSE_CState_t* statePtr, const FSE_CTable* ct)
 {
-    const void* ptr = ct;
-    const U16* u16ptr = (const U16*) ptr;
-    const U32 tableLog = MEM_read16(ptr);
-    statePtr->value = (ptrdiff_t)1<<tableLog;
-    statePtr->stateTable = u16ptr+2;
-    statePtr->symbolTT = ((const U32*)ct + 1 + (tableLog ? (1<<(tableLog-1)) : 1));
-    statePtr->stateLog = tableLog;
+	const void* ptr = ct;
+	const U16* u16ptr = (const U16*) ptr;
+	const U32 tableLog = MEM_read16(ptr);
+	statePtr->value = (ptrdiff_t)1<<tableLog;
+	statePtr->stateTable = u16ptr+2;
+	statePtr->symbolTT = ((const U32*)ct + 1 + (tableLog ? (1<<(tableLog-1)) : 1));
+	statePtr->stateLog = tableLog;
 }
 
 
@@ -539,95 +539,95 @@ MEM_STATIC void FSE_initCState(FSE_CState_t* statePtr, const FSE_CTable* ct)
 *   uses the smallest state value possible, saving the cost of this symbol */
 MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol)
 {
-    FSE_initCState(statePtr, ct);
-    {   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
-        const U16* stateTable = (const U16*)(statePtr->stateTable);
-        U32 nbBitsOut  = (U32)((symbolTT.deltaNbBits + (1<<15)) >> 16);
-        statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
-        statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-    }
+	FSE_initCState(statePtr, ct);
+	{   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+		const U16* stateTable = (const U16*)(statePtr->stateTable);
+		U32 nbBitsOut  = (U32)((symbolTT.deltaNbBits + (1<<15)) >> 16);
+		statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
+		statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+	}
 }
 
 MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, U32 symbol)
 {
-    const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
-    const U16* const stateTable = (const U16*)(statePtr->stateTable);
-    U32 nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
-    BIT_addBits(bitC, statePtr->value, nbBitsOut);
-    statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+	const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+	const U16* const stateTable = (const U16*)(statePtr->stateTable);
+	U32 nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
+	BIT_addBits(bitC, statePtr->value, nbBitsOut);
+	statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
 }
 
 MEM_STATIC void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* statePtr)
 {
-    BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
-    BIT_flushBits(bitC);
+	BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
+	BIT_flushBits(bitC);
 }
 
 
 /* ======    Decompression    ====== */
 
 typedef struct {
-    U16 tableLog;
-    U16 fastMode;
+	U16 tableLog;
+	U16 fastMode;
 } FSE_DTableHeader;   /* sizeof U32 */
 
 typedef struct
 {
-    unsigned short newState;
-    unsigned char  symbol;
-    unsigned char  nbBits;
+	unsigned short newState;
+	unsigned char  symbol;
+	unsigned char  nbBits;
 } FSE_decode_t;   /* size == U32 */
 
 MEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)
 {
-    const void* ptr = dt;
-    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
-    DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
-    BIT_reloadDStream(bitD);
-    DStatePtr->table = dt + 1;
+	const void* ptr = dt;
+	const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
+	DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
+	BIT_reloadDStream(bitD);
+	DStatePtr->table = dt + 1;
 }
 
 MEM_STATIC BYTE FSE_peekSymbol(const FSE_DState_t* DStatePtr)
 {
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    return DInfo.symbol;
+	FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+	return DInfo.symbol;
 }
 
 MEM_STATIC void FSE_updateState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
 {
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    size_t const lowBits = BIT_readBits(bitD, nbBits);
-    DStatePtr->state = DInfo.newState + lowBits;
+	FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+	U32 const nbBits = DInfo.nbBits;
+	size_t const lowBits = BIT_readBits(bitD, nbBits);
+	DStatePtr->state = DInfo.newState + lowBits;
 }
 
 MEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
 {
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    BYTE const symbol = DInfo.symbol;
-    size_t const lowBits = BIT_readBits(bitD, nbBits);
+	FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+	U32 const nbBits = DInfo.nbBits;
+	BYTE const symbol = DInfo.symbol;
+	size_t const lowBits = BIT_readBits(bitD, nbBits);
 
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
+	DStatePtr->state = DInfo.newState + lowBits;
+	return symbol;
 }
 
 /*! FSE_decodeSymbolFast() :
-    unsafe, only works if no symbol has a probability > 50% */
+	unsafe, only works if no symbol has a probability > 50% */
 MEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
 {
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    BYTE const symbol = DInfo.symbol;
-    size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
+	FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+	U32 const nbBits = DInfo.nbBits;
+	BYTE const symbol = DInfo.symbol;
+	size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
 
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
+	DStatePtr->state = DInfo.newState + lowBits;
+	return symbol;
 }
 
 MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
 {
-    return DStatePtr->state == 0;
+	return DStatePtr->state == 0;
 }
 
 
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index 13654d6e6..7340d413a 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -8,9 +8,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -27,9 +27,9 @@
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+	You can contact the author at :
+	- FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 ****************************************************************** */
 
 /* **************************************************************
@@ -102,90 +102,90 @@
  */
 size_t FSE_buildCTable_wksp(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize)
 {
-    U32 const tableSize = 1 << tableLog;
-    U32 const tableMask = tableSize - 1;
-    void* const ptr = ct;
-    U16* const tableU16 = ( (U16*) ptr) + 2;
-    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableLog ? tableSize>>1 : 1) ;
-    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
-    U32 const step = FSE_TABLESTEP(tableSize);
-    U32 cumul[FSE_MAX_SYMBOL_VALUE+2];
+	U32 const tableSize = 1 << tableLog;
+	U32 const tableMask = tableSize - 1;
+	void* const ptr = ct;
+	U16* const tableU16 = ( (U16*) ptr) + 2;
+	void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableLog ? tableSize>>1 : 1) ;
+	FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+	U32 const step = FSE_TABLESTEP(tableSize);
+	U32 cumul[FSE_MAX_SYMBOL_VALUE+2];
 
-    FSE_FUNCTION_TYPE* const tableSymbol = (FSE_FUNCTION_TYPE*)workSpace;
-    U32 highThreshold = tableSize-1;
+	FSE_FUNCTION_TYPE* const tableSymbol = (FSE_FUNCTION_TYPE*)workSpace;
+	U32 highThreshold = tableSize-1;
 
-    /* CTable header */
-    if (((size_t)1 << tableLog) * sizeof(FSE_FUNCTION_TYPE) > wkspSize) return ERROR(tableLog_tooLarge);
-    tableU16[-2] = (U16) tableLog;
-    tableU16[-1] = (U16) maxSymbolValue;
+	/* CTable header */
+	if (((size_t)1 << tableLog) * sizeof(FSE_FUNCTION_TYPE) > wkspSize) return ERROR(tableLog_tooLarge);
+	tableU16[-2] = (U16) tableLog;
+	tableU16[-1] = (U16) maxSymbolValue;
 
-    /* For explanations on how to distribute symbol values over the table :
-    *  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
+	/* For explanations on how to distribute symbol values over the table :
+	*  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
 
-    /* symbol start positions */
-    {   U32 u;
-        cumul[0] = 0;
-        for (u=1; u<=maxSymbolValue+1; u++) {
-            if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */
-                cumul[u] = cumul[u-1] + 1;
-                tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);
-            } else {
-                cumul[u] = cumul[u-1] + normalizedCounter[u-1];
-        }   }
-        cumul[maxSymbolValue+1] = tableSize+1;
-    }
+	/* symbol start positions */
+	{   U32 u;
+		cumul[0] = 0;
+		for (u=1; u<=maxSymbolValue+1; u++) {
+			if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */
+				cumul[u] = cumul[u-1] + 1;
+				tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);
+			} else {
+				cumul[u] = cumul[u-1] + normalizedCounter[u-1];
+		}   }
+		cumul[maxSymbolValue+1] = tableSize+1;
+	}
 
-    /* Spread symbols */
-    {   U32 position = 0;
-        U32 symbol;
-        for (symbol=0; symbol<=maxSymbolValue; symbol++) {
-            int nbOccurences;
-            for (nbOccurences=0; nbOccurences<normalizedCounter[symbol]; nbOccurences++) {
-                tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
-                position = (position + step) & tableMask;
-                while (position > highThreshold) position = (position + step) & tableMask;   /* Low proba area */
-        }   }
+	/* Spread symbols */
+	{   U32 position = 0;
+		U32 symbol;
+		for (symbol=0; symbol<=maxSymbolValue; symbol++) {
+			int nbOccurences;
+			for (nbOccurences=0; nbOccurences<normalizedCounter[symbol]; nbOccurences++) {
+				tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
+				position = (position + step) & tableMask;
+				while (position > highThreshold) position = (position + step) & tableMask;   /* Low proba area */
+		}   }
 
-        if (position!=0) return ERROR(GENERIC);   /* Must have gone through all positions */
-    }
+		if (position!=0) return ERROR(GENERIC);   /* Must have gone through all positions */
+	}
 
-    /* Build table */
-    {   U32 u; for (u=0; u<tableSize; u++) {
-        FSE_FUNCTION_TYPE s = tableSymbol[u];   /* note : static analyzer may not understand tableSymbol is properly initialized */
-        tableU16[cumul[s]++] = (U16) (tableSize+u);   /* TableU16 : sorted by symbol order; gives next state value */
-    }   }
+	/* Build table */
+	{   U32 u; for (u=0; u<tableSize; u++) {
+		FSE_FUNCTION_TYPE s = tableSymbol[u];   /* note : static analyzer may not understand tableSymbol is properly initialized */
+		tableU16[cumul[s]++] = (U16) (tableSize+u);   /* TableU16 : sorted by symbol order; gives next state value */
+	}   }
 
-    /* Build Symbol Transformation Table */
-    {   unsigned total = 0;
-        unsigned s;
-        for (s=0; s<=maxSymbolValue; s++) {
-            switch (normalizedCounter[s])
-            {
-            case  0: break;
+	/* Build Symbol Transformation Table */
+	{   unsigned total = 0;
+		unsigned s;
+		for (s=0; s<=maxSymbolValue; s++) {
+			switch (normalizedCounter[s])
+			{
+			case  0: break;
 
-            case -1:
-            case  1:
-                symbolTT[s].deltaNbBits = (tableLog << 16) - (1<<tableLog);
-                symbolTT[s].deltaFindState = total - 1;
-                total ++;
-                break;
-            default :
-                {
-                    U32 const maxBitsOut = tableLog - BIT_highbit32 (normalizedCounter[s]-1);
-                    U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
-                    symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
-                    symbolTT[s].deltaFindState = total - normalizedCounter[s];
-                    total +=  normalizedCounter[s];
-    }   }   }   }
+			case -1:
+			case  1:
+				symbolTT[s].deltaNbBits = (tableLog << 16) - (1<<tableLog);
+				symbolTT[s].deltaFindState = total - 1;
+				total ++;
+				break;
+			default :
+				{
+					U32 const maxBitsOut = tableLog - BIT_highbit32 (normalizedCounter[s]-1);
+					U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
+					symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
+					symbolTT[s].deltaFindState = total - normalizedCounter[s];
+					total +=  normalizedCounter[s];
+	}   }   }   }
 
-    return 0;
+	return 0;
 }
 
 
 size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
 {
-    FSE_FUNCTION_TYPE tableSymbol[FSE_MAX_TABLESIZE];   /* memset() is not necessary, even if static analyzer complain about it */
-    return FSE_buildCTable_wksp(ct, normalizedCounter, maxSymbolValue, tableLog, tableSymbol, sizeof(tableSymbol));
+	FSE_FUNCTION_TYPE tableSymbol[FSE_MAX_TABLESIZE];   /* memset() is not necessary, even if static analyzer complain about it */
+	return FSE_buildCTable_wksp(ct, normalizedCounter, maxSymbolValue, tableLog, tableSymbol, sizeof(tableSymbol));
 }
 
 
@@ -197,107 +197,107 @@ size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned
 ****************************************************************/
 size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)
 {
-    size_t const maxHeaderSize = (((maxSymbolValue+1) * tableLog) >> 3) + 3;
-    return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */
+	size_t const maxHeaderSize = (((maxSymbolValue+1) * tableLog) >> 3) + 3;
+	return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */
 }
 
 static size_t FSE_writeNCount_generic (void* header, size_t headerBufferSize,
-                                       const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
-                                       unsigned writeIsSafe)
+									   const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
+									   unsigned writeIsSafe)
 {
-    BYTE* const ostart = (BYTE*) header;
-    BYTE* out = ostart;
-    BYTE* const oend = ostart + headerBufferSize;
-    int nbBits;
-    const int tableSize = 1 << tableLog;
-    int remaining;
-    int threshold;
-    U32 bitStream;
-    int bitCount;
-    unsigned charnum = 0;
-    int previous0 = 0;
+	BYTE* const ostart = (BYTE*) header;
+	BYTE* out = ostart;
+	BYTE* const oend = ostart + headerBufferSize;
+	int nbBits;
+	const int tableSize = 1 << tableLog;
+	int remaining;
+	int threshold;
+	U32 bitStream;
+	int bitCount;
+	unsigned charnum = 0;
+	int previous0 = 0;
 
-    bitStream = 0;
-    bitCount  = 0;
-    /* Table Size */
-    bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;
-    bitCount  += 4;
+	bitStream = 0;
+	bitCount  = 0;
+	/* Table Size */
+	bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;
+	bitCount  += 4;
 
-    /* Init */
-    remaining = tableSize+1;   /* +1 for extra accuracy */
-    threshold = tableSize;
-    nbBits = tableLog+1;
+	/* Init */
+	remaining = tableSize+1;   /* +1 for extra accuracy */
+	threshold = tableSize;
+	nbBits = tableLog+1;
 
-    while (remaining>1) {  /* stops at 1 */
-        if (previous0) {
-            unsigned start = charnum;
-            while (!normalizedCounter[charnum]) charnum++;
-            while (charnum >= start+24) {
-                start+=24;
-                bitStream += 0xFFFFU << bitCount;
-                if ((!writeIsSafe) && (out > oend-2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-                out[0] = (BYTE) bitStream;
-                out[1] = (BYTE)(bitStream>>8);
-                out+=2;
-                bitStream>>=16;
-            }
-            while (charnum >= start+3) {
-                start+=3;
-                bitStream += 3 << bitCount;
-                bitCount += 2;
-            }
-            bitStream += (charnum-start) << bitCount;
-            bitCount += 2;
-            if (bitCount>16) {
-                if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-                out[0] = (BYTE)bitStream;
-                out[1] = (BYTE)(bitStream>>8);
-                out += 2;
-                bitStream >>= 16;
-                bitCount -= 16;
-        }   }
-        {   int count = normalizedCounter[charnum++];
-            int const max = (2*threshold-1)-remaining;
-            remaining -= count < 0 ? -count : count;
-            count++;   /* +1 for extra accuracy */
-            if (count>=threshold) count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
-            bitStream += count << bitCount;
-            bitCount  += nbBits;
-            bitCount  -= (count<max);
-            previous0  = (count==1);
-            if (remaining<1) return ERROR(GENERIC);
-            while (remaining<threshold) nbBits--, threshold>>=1;
-        }
-        if (bitCount>16) {
-            if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-            out[0] = (BYTE)bitStream;
-            out[1] = (BYTE)(bitStream>>8);
-            out += 2;
-            bitStream >>= 16;
-            bitCount -= 16;
-    }   }
+	while (remaining>1) {  /* stops at 1 */
+		if (previous0) {
+			unsigned start = charnum;
+			while (!normalizedCounter[charnum]) charnum++;
+			while (charnum >= start+24) {
+				start+=24;
+				bitStream += 0xFFFFU << bitCount;
+				if ((!writeIsSafe) && (out > oend-2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+				out[0] = (BYTE) bitStream;
+				out[1] = (BYTE)(bitStream>>8);
+				out+=2;
+				bitStream>>=16;
+			}
+			while (charnum >= start+3) {
+				start+=3;
+				bitStream += 3 << bitCount;
+				bitCount += 2;
+			}
+			bitStream += (charnum-start) << bitCount;
+			bitCount += 2;
+			if (bitCount>16) {
+				if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+				out[0] = (BYTE)bitStream;
+				out[1] = (BYTE)(bitStream>>8);
+				out += 2;
+				bitStream >>= 16;
+				bitCount -= 16;
+		}   }
+		{   int count = normalizedCounter[charnum++];
+			int const max = (2*threshold-1)-remaining;
+			remaining -= count < 0 ? -count : count;
+			count++;   /* +1 for extra accuracy */
+			if (count>=threshold) count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
+			bitStream += count << bitCount;
+			bitCount  += nbBits;
+			bitCount  -= (count<max);
+			previous0  = (count==1);
+			if (remaining<1) return ERROR(GENERIC);
+			while (remaining<threshold) nbBits--, threshold>>=1;
+		}
+		if (bitCount>16) {
+			if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+			out[0] = (BYTE)bitStream;
+			out[1] = (BYTE)(bitStream>>8);
+			out += 2;
+			bitStream >>= 16;
+			bitCount -= 16;
+	}   }
 
-    /* flush remaining bitStream */
-    if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-    out[0] = (BYTE)bitStream;
-    out[1] = (BYTE)(bitStream>>8);
-    out+= (bitCount+7) /8;
+	/* flush remaining bitStream */
+	if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+	out[0] = (BYTE)bitStream;
+	out[1] = (BYTE)(bitStream>>8);
+	out+= (bitCount+7) /8;
 
-    if (charnum > maxSymbolValue + 1) return ERROR(GENERIC);
+	if (charnum > maxSymbolValue + 1) return ERROR(GENERIC);
 
-    return (out-ostart);
+	return (out-ostart);
 }
 
 
 size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
 {
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
-    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
+	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
+	if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
 
-    if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
-        return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
+	if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
+		return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
 
-    return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
+	return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
 }
 
 
@@ -306,31 +306,31 @@ size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalized
 *  Counting histogram
 ****************************************************************/
 /*! FSE_count_simple
-    This function counts byte values within `src`, and store the histogram into table `count`.
-    It doesn't use any additional memory.
-    But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
-    For this reason, prefer using a table `count` with 256 elements.
-    @return : count of most numerous element
+	This function counts byte values within `src`, and store the histogram into table `count`.
+	It doesn't use any additional memory.
+	But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
+	For this reason, prefer using a table `count` with 256 elements.
+	@return : count of most numerous element
 */
 size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
-                        const void* src, size_t srcSize)
+						const void* src, size_t srcSize)
 {
-    const BYTE* ip = (const BYTE*)src;
-    const BYTE* const end = ip + srcSize;
-    unsigned maxSymbolValue = *maxSymbolValuePtr;
-    unsigned max=0;
+	const BYTE* ip = (const BYTE*)src;
+	const BYTE* const end = ip + srcSize;
+	unsigned maxSymbolValue = *maxSymbolValuePtr;
+	unsigned max=0;
 
-    memset(count, 0, (maxSymbolValue+1)*sizeof(*count));
-    if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }
+	memset(count, 0, (maxSymbolValue+1)*sizeof(*count));
+	if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }
 
-    while (ip<end) count[*ip++]++;
+	while (ip<end) count[*ip++]++;
 
-    while (!count[maxSymbolValue]) maxSymbolValue--;
-    *maxSymbolValuePtr = maxSymbolValue;
+	while (!count[maxSymbolValue]) maxSymbolValue--;
+	*maxSymbolValuePtr = maxSymbolValue;
 
-    { U32 s; for (s=0; s<=maxSymbolValue; s++) if (count[s] > max) max = count[s]; }
+	{ U32 s; for (s=0; s<=maxSymbolValue; s++) if (count[s] > max) max = count[s]; }
 
-    return (size_t)max;
+	return (size_t)max;
 }
 
 
@@ -338,110 +338,110 @@ size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
  * Same as FSE_count_parallel(), but using an externally provided scratch buffer.
  * `workSpace` size must be a minimum of `1024 * sizeof(unsigned)`` */
 static size_t FSE_count_parallel_wksp(
-                                unsigned* count, unsigned* maxSymbolValuePtr,
-                                const void* source, size_t sourceSize,
-                                unsigned checkMax, unsigned* const workSpace)
+								unsigned* count, unsigned* maxSymbolValuePtr,
+								const void* source, size_t sourceSize,
+								unsigned checkMax, unsigned* const workSpace)
 {
-    const BYTE* ip = (const BYTE*)source;
-    const BYTE* const iend = ip+sourceSize;
-    unsigned maxSymbolValue = *maxSymbolValuePtr;
-    unsigned max=0;
-    U32* const Counting1 = workSpace;
-    U32* const Counting2 = Counting1 + 256;
-    U32* const Counting3 = Counting2 + 256;
-    U32* const Counting4 = Counting3 + 256;
+	const BYTE* ip = (const BYTE*)source;
+	const BYTE* const iend = ip+sourceSize;
+	unsigned maxSymbolValue = *maxSymbolValuePtr;
+	unsigned max=0;
+	U32* const Counting1 = workSpace;
+	U32* const Counting2 = Counting1 + 256;
+	U32* const Counting3 = Counting2 + 256;
+	U32* const Counting4 = Counting3 + 256;
 
-    memset(Counting1, 0, 4*256*sizeof(unsigned));
+	memset(Counting1, 0, 4*256*sizeof(unsigned));
 
-    /* safety checks */
-    if (!sourceSize) {
-        memset(count, 0, maxSymbolValue + 1);
-        *maxSymbolValuePtr = 0;
-        return 0;
-    }
-    if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */
+	/* safety checks */
+	if (!sourceSize) {
+		memset(count, 0, maxSymbolValue + 1);
+		*maxSymbolValuePtr = 0;
+		return 0;
+	}
+	if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */
 
-    /* by stripes of 16 bytes */
-    {   U32 cached = MEM_read32(ip); ip += 4;
-        while (ip < iend-15) {
-            U32 c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-        }
-        ip-=4;
-    }
+	/* by stripes of 16 bytes */
+	{   U32 cached = MEM_read32(ip); ip += 4;
+		while (ip < iend-15) {
+			U32 c = cached; cached = MEM_read32(ip); ip += 4;
+			Counting1[(BYTE) c     ]++;
+			Counting2[(BYTE)(c>>8) ]++;
+			Counting3[(BYTE)(c>>16)]++;
+			Counting4[       c>>24 ]++;
+			c = cached; cached = MEM_read32(ip); ip += 4;
+			Counting1[(BYTE) c     ]++;
+			Counting2[(BYTE)(c>>8) ]++;
+			Counting3[(BYTE)(c>>16)]++;
+			Counting4[       c>>24 ]++;
+			c = cached; cached = MEM_read32(ip); ip += 4;
+			Counting1[(BYTE) c     ]++;
+			Counting2[(BYTE)(c>>8) ]++;
+			Counting3[(BYTE)(c>>16)]++;
+			Counting4[       c>>24 ]++;
+			c = cached; cached = MEM_read32(ip); ip += 4;
+			Counting1[(BYTE) c     ]++;
+			Counting2[(BYTE)(c>>8) ]++;
+			Counting3[(BYTE)(c>>16)]++;
+			Counting4[       c>>24 ]++;
+		}
+		ip-=4;
+	}
 
-    /* finish last symbols */
-    while (ip<iend) Counting1[*ip++]++;
+	/* finish last symbols */
+	while (ip<iend) Counting1[*ip++]++;
 
-    if (checkMax) {   /* verify stats will fit into destination table */
-        U32 s; for (s=255; s>maxSymbolValue; s--) {
-            Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
-            if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);
-    }   }
+	if (checkMax) {   /* verify stats will fit into destination table */
+		U32 s; for (s=255; s>maxSymbolValue; s--) {
+			Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
+			if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);
+	}   }
 
-    {   U32 s; for (s=0; s<=maxSymbolValue; s++) {
-            count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
-            if (count[s] > max) max = count[s];
-    }   }
+	{   U32 s; for (s=0; s<=maxSymbolValue; s++) {
+			count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
+			if (count[s] > max) max = count[s];
+	}   }
 
-    while (!count[maxSymbolValue]) maxSymbolValue--;
-    *maxSymbolValuePtr = maxSymbolValue;
-    return (size_t)max;
+	while (!count[maxSymbolValue]) maxSymbolValue--;
+	*maxSymbolValuePtr = maxSymbolValue;
+	return (size_t)max;
 }
 
 /* FSE_countFast_wksp() :
  * Same as FSE_countFast(), but using an externally provided scratch buffer.
  * `workSpace` size must be table of >= `1024` unsigned */
 size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                     const void* source, size_t sourceSize, unsigned* workSpace)
+					 const void* source, size_t sourceSize, unsigned* workSpace)
 {
-    if (sourceSize < 1500) return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
-    return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
+	if (sourceSize < 1500) return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
+	return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
 }
 
 /* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
 size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
-                     const void* source, size_t sourceSize)
+					 const void* source, size_t sourceSize)
 {
-    unsigned tmpCounters[1024];
-    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters);
+	unsigned tmpCounters[1024];
+	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters);
 }
 
 /* FSE_count_wksp() :
  * Same as FSE_count(), but using an externally provided scratch buffer.
  * `workSpace` size must be table of >= `1024` unsigned */
 size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* source, size_t sourceSize, unsigned* workSpace)
+				 const void* source, size_t sourceSize, unsigned* workSpace)
 {
-    if (*maxSymbolValuePtr < 255)
-        return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
-    *maxSymbolValuePtr = 255;
-    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
+	if (*maxSymbolValuePtr < 255)
+		return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
+	*maxSymbolValuePtr = 255;
+	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
 }
 
 size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* src, size_t srcSize)
+				 const void* src, size_t srcSize)
 {
-    unsigned tmpCounters[1024];
-    return FSE_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters);
+	unsigned tmpCounters[1024];
+	return FSE_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters);
 }
 
 
@@ -450,25 +450,25 @@ size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,
 *  FSE Compression Code
 ****************************************************************/
 /*! FSE_sizeof_CTable() :
-    FSE_CTable is a variable size structure which contains :
-    `U16 tableLog;`
-    `U16 maxSymbolValue;`
-    `U16 nextStateNumber[1 << tableLog];`                         // This size is variable
-    `FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
+	FSE_CTable is a variable size structure which contains :
+	`U16 tableLog;`
+	`U16 maxSymbolValue;`
+	`U16 nextStateNumber[1 << tableLog];`                         // This size is variable
+	`FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
 Allocation is manual (C standard does not support variable-size structures).
 */
 size_t FSE_sizeof_CTable (unsigned maxSymbolValue, unsigned tableLog)
 {
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-    return FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
+	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+	return FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
 }
 
 FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)
 {
-    size_t size;
-    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-    size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
-    return (FSE_CTable*)malloc(size);
+	size_t size;
+	if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+	size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
+	return (FSE_CTable*)malloc(size);
 }
 
 void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
@@ -476,28 +476,28 @@ void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
 /* provides the minimum logSize to safely represent a distribution */
 static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
 {
-    U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
-    U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
-    U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
-    return minBits;
+	U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
+	U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
+	U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
+	return minBits;
 }
 
 unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
 {
-    U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
-    U32 tableLog = maxTableLog;
-    U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
-    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
-    if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
-    if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
-    if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
-    if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
-    return tableLog;
+	U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
+	U32 tableLog = maxTableLog;
+	U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
+	if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+	if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
+	if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
+	if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
+	if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
+	return tableLog;
 }
 
 unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
 {
-    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
+	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
 }
 
 
@@ -506,276 +506,276 @@ unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxS
 
 static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue)
 {
-    short const NOT_YET_ASSIGNED = -2;
-    U32 s;
-    U32 distributed = 0;
-    U32 ToDistribute;
+	short const NOT_YET_ASSIGNED = -2;
+	U32 s;
+	U32 distributed = 0;
+	U32 ToDistribute;
 
-    /* Init */
-    U32 const lowThreshold = (U32)(total >> tableLog);
-    U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
+	/* Init */
+	U32 const lowThreshold = (U32)(total >> tableLog);
+	U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
 
-    for (s=0; s<=maxSymbolValue; s++) {
-        if (count[s] == 0) {
-            norm[s]=0;
-            continue;
-        }
-        if (count[s] <= lowThreshold) {
-            norm[s] = -1;
-            distributed++;
-            total -= count[s];
-            continue;
-        }
-        if (count[s] <= lowOne) {
-            norm[s] = 1;
-            distributed++;
-            total -= count[s];
-            continue;
-        }
+	for (s=0; s<=maxSymbolValue; s++) {
+		if (count[s] == 0) {
+			norm[s]=0;
+			continue;
+		}
+		if (count[s] <= lowThreshold) {
+			norm[s] = -1;
+			distributed++;
+			total -= count[s];
+			continue;
+		}
+		if (count[s] <= lowOne) {
+			norm[s] = 1;
+			distributed++;
+			total -= count[s];
+			continue;
+		}
 
-        norm[s]=NOT_YET_ASSIGNED;
-    }
-    ToDistribute = (1 << tableLog) - distributed;
+		norm[s]=NOT_YET_ASSIGNED;
+	}
+	ToDistribute = (1 << tableLog) - distributed;
 
-    if ((total / ToDistribute) > lowOne) {
-        /* risk of rounding to zero */
-        lowOne = (U32)((total * 3) / (ToDistribute * 2));
-        for (s=0; s<=maxSymbolValue; s++) {
-            if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
-                norm[s] = 1;
-                distributed++;
-                total -= count[s];
-                continue;
-        }   }
-        ToDistribute = (1 << tableLog) - distributed;
-    }
+	if ((total / ToDistribute) > lowOne) {
+		/* risk of rounding to zero */
+		lowOne = (U32)((total * 3) / (ToDistribute * 2));
+		for (s=0; s<=maxSymbolValue; s++) {
+			if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
+				norm[s] = 1;
+				distributed++;
+				total -= count[s];
+				continue;
+		}   }
+		ToDistribute = (1 << tableLog) - distributed;
+	}
 
-    if (distributed == maxSymbolValue+1) {
-        /* all values are pretty poor;
-           probably incompressible data (should have already been detected);
-           find max, then give all remaining points to max */
-        U32 maxV = 0, maxC = 0;
-        for (s=0; s<=maxSymbolValue; s++)
-            if (count[s] > maxC) maxV=s, maxC=count[s];
-        norm[maxV] += (short)ToDistribute;
-        return 0;
-    }
+	if (distributed == maxSymbolValue+1) {
+		/* all values are pretty poor;
+		   probably incompressible data (should have already been detected);
+		   find max, then give all remaining points to max */
+		U32 maxV = 0, maxC = 0;
+		for (s=0; s<=maxSymbolValue; s++)
+			if (count[s] > maxC) maxV=s, maxC=count[s];
+		norm[maxV] += (short)ToDistribute;
+		return 0;
+	}
 
-    if (total == 0) {
-        /* all of the symbols were low enough for the lowOne or lowThreshold */
-        for (s=0; ToDistribute > 0; s = (s+1)%(maxSymbolValue+1))
-            if (norm[s] > 0) ToDistribute--, norm[s]++;
-        return 0;
-    }
+	if (total == 0) {
+		/* all of the symbols were low enough for the lowOne or lowThreshold */
+		for (s=0; ToDistribute > 0; s = (s+1)%(maxSymbolValue+1))
+			if (norm[s] > 0) ToDistribute--, norm[s]++;
+		return 0;
+	}
 
-    {   U64 const vStepLog = 62 - tableLog;
-        U64 const mid = (1ULL << (vStepLog-1)) - 1;
-        U64 const rStep = ((((U64)1<<vStepLog) * ToDistribute) + mid) / total;   /* scale on remaining */
-        U64 tmpTotal = mid;
-        for (s=0; s<=maxSymbolValue; s++) {
-            if (norm[s]==NOT_YET_ASSIGNED) {
-                U64 const end = tmpTotal + (count[s] * rStep);
-                U32 const sStart = (U32)(tmpTotal >> vStepLog);
-                U32 const sEnd = (U32)(end >> vStepLog);
-                U32 const weight = sEnd - sStart;
-                if (weight < 1)
-                    return ERROR(GENERIC);
-                norm[s] = (short)weight;
-                tmpTotal = end;
-    }   }   }
+	{   U64 const vStepLog = 62 - tableLog;
+		U64 const mid = (1ULL << (vStepLog-1)) - 1;
+		U64 const rStep = ((((U64)1<<vStepLog) * ToDistribute) + mid) / total;   /* scale on remaining */
+		U64 tmpTotal = mid;
+		for (s=0; s<=maxSymbolValue; s++) {
+			if (norm[s]==NOT_YET_ASSIGNED) {
+				U64 const end = tmpTotal + (count[s] * rStep);
+				U32 const sStart = (U32)(tmpTotal >> vStepLog);
+				U32 const sEnd = (U32)(end >> vStepLog);
+				U32 const weight = sEnd - sStart;
+				if (weight < 1)
+					return ERROR(GENERIC);
+				norm[s] = (short)weight;
+				tmpTotal = end;
+	}   }   }
 
-    return 0;
+	return 0;
 }
 
 
 size_t FSE_normalizeCount (short* normalizedCounter, unsigned tableLog,
-                           const unsigned* count, size_t total,
-                           unsigned maxSymbolValue)
+						   const unsigned* count, size_t total,
+						   unsigned maxSymbolValue)
 {
-    /* Sanity checks */
-    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
-    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported size */
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported size */
-    if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC);   /* Too small tableLog, compression potentially impossible */
+	/* Sanity checks */
+	if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+	if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported size */
+	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported size */
+	if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC);   /* Too small tableLog, compression potentially impossible */
 
-    {   U32 const rtbTable[] = {     0, 473195, 504333, 520860, 550000, 700000, 750000, 830000 };
-        U64 const scale = 62 - tableLog;
-        U64 const step = ((U64)1<<62) / total;   /* <== here, one division ! */
-        U64 const vStep = 1ULL<<(scale-20);
-        int stillToDistribute = 1<<tableLog;
-        unsigned s;
-        unsigned largest=0;
-        short largestP=0;
-        U32 lowThreshold = (U32)(total >> tableLog);
+	{   U32 const rtbTable[] = {     0, 473195, 504333, 520860, 550000, 700000, 750000, 830000 };
+		U64 const scale = 62 - tableLog;
+		U64 const step = ((U64)1<<62) / total;   /* <== here, one division ! */
+		U64 const vStep = 1ULL<<(scale-20);
+		int stillToDistribute = 1<<tableLog;
+		unsigned s;
+		unsigned largest=0;
+		short largestP=0;
+		U32 lowThreshold = (U32)(total >> tableLog);
 
-        for (s=0; s<=maxSymbolValue; s++) {
-            if (count[s] == total) return 0;   /* rle special case */
-            if (count[s] == 0) { normalizedCounter[s]=0; continue; }
-            if (count[s] <= lowThreshold) {
-                normalizedCounter[s] = -1;
-                stillToDistribute--;
-            } else {
-                short proba = (short)((count[s]*step) >> scale);
-                if (proba<8) {
-                    U64 restToBeat = vStep * rtbTable[proba];
-                    proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
-                }
-                if (proba > largestP) largestP=proba, largest=s;
-                normalizedCounter[s] = proba;
-                stillToDistribute -= proba;
-        }   }
-        if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
-            /* corner case, need another normalization method */
-            size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
-            if (FSE_isError(errorCode)) return errorCode;
-        }
-        else normalizedCounter[largest] += (short)stillToDistribute;
-    }
+		for (s=0; s<=maxSymbolValue; s++) {
+			if (count[s] == total) return 0;   /* rle special case */
+			if (count[s] == 0) { normalizedCounter[s]=0; continue; }
+			if (count[s] <= lowThreshold) {
+				normalizedCounter[s] = -1;
+				stillToDistribute--;
+			} else {
+				short proba = (short)((count[s]*step) >> scale);
+				if (proba<8) {
+					U64 restToBeat = vStep * rtbTable[proba];
+					proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
+				}
+				if (proba > largestP) largestP=proba, largest=s;
+				normalizedCounter[s] = proba;
+				stillToDistribute -= proba;
+		}   }
+		if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
+			/* corner case, need another normalization method */
+			size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
+			if (FSE_isError(errorCode)) return errorCode;
+		}
+		else normalizedCounter[largest] += (short)stillToDistribute;
+	}
 
 #if 0
-    {   /* Print Table (debug) */
-        U32 s;
-        U32 nTotal = 0;
-        for (s=0; s<=maxSymbolValue; s++)
-            printf("%3i: %4i \n", s, normalizedCounter[s]);
-        for (s=0; s<=maxSymbolValue; s++)
-            nTotal += abs(normalizedCounter[s]);
-        if (nTotal != (1U<<tableLog))
-            printf("Warning !!! Total == %u != %u !!!", nTotal, 1U<<tableLog);
-        getchar();
-    }
+	{   /* Print Table (debug) */
+		U32 s;
+		U32 nTotal = 0;
+		for (s=0; s<=maxSymbolValue; s++)
+			printf("%3i: %4i \n", s, normalizedCounter[s]);
+		for (s=0; s<=maxSymbolValue; s++)
+			nTotal += abs(normalizedCounter[s]);
+		if (nTotal != (1U<<tableLog))
+			printf("Warning !!! Total == %u != %u !!!", nTotal, 1U<<tableLog);
+		getchar();
+	}
 #endif
 
-    return tableLog;
+	return tableLog;
 }
 
 
 /* fake FSE_CTable, for raw (uncompressed) input */
 size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits)
 {
-    const unsigned tableSize = 1 << nbBits;
-    const unsigned tableMask = tableSize - 1;
-    const unsigned maxSymbolValue = tableMask;
-    void* const ptr = ct;
-    U16* const tableU16 = ( (U16*) ptr) + 2;
-    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableSize>>1);   /* assumption : tableLog >= 1 */
-    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
-    unsigned s;
+	const unsigned tableSize = 1 << nbBits;
+	const unsigned tableMask = tableSize - 1;
+	const unsigned maxSymbolValue = tableMask;
+	void* const ptr = ct;
+	U16* const tableU16 = ( (U16*) ptr) + 2;
+	void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableSize>>1);   /* assumption : tableLog >= 1 */
+	FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+	unsigned s;
 
-    /* Sanity checks */
-    if (nbBits < 1) return ERROR(GENERIC);             /* min size */
+	/* Sanity checks */
+	if (nbBits < 1) return ERROR(GENERIC);             /* min size */
 
-    /* header */
-    tableU16[-2] = (U16) nbBits;
-    tableU16[-1] = (U16) maxSymbolValue;
+	/* header */
+	tableU16[-2] = (U16) nbBits;
+	tableU16[-1] = (U16) maxSymbolValue;
 
-    /* Build table */
-    for (s=0; s<tableSize; s++)
-        tableU16[s] = (U16)(tableSize + s);
+	/* Build table */
+	for (s=0; s<tableSize; s++)
+		tableU16[s] = (U16)(tableSize + s);
 
-    /* Build Symbol Transformation Table */
-    {   const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
-        for (s=0; s<=maxSymbolValue; s++) {
-            symbolTT[s].deltaNbBits = deltaNbBits;
-            symbolTT[s].deltaFindState = s-1;
-    }   }
+	/* Build Symbol Transformation Table */
+	{   const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
+		for (s=0; s<=maxSymbolValue; s++) {
+			symbolTT[s].deltaNbBits = deltaNbBits;
+			symbolTT[s].deltaFindState = s-1;
+	}   }
 
-    return 0;
+	return 0;
 }
 
 /* fake FSE_CTable, for rle input (always same symbol) */
 size_t FSE_buildCTable_rle (FSE_CTable* ct, BYTE symbolValue)
 {
-    void* ptr = ct;
-    U16* tableU16 = ( (U16*) ptr) + 2;
-    void* FSCTptr = (U32*)ptr + 2;
-    FSE_symbolCompressionTransform* symbolTT = (FSE_symbolCompressionTransform*) FSCTptr;
+	void* ptr = ct;
+	U16* tableU16 = ( (U16*) ptr) + 2;
+	void* FSCTptr = (U32*)ptr + 2;
+	FSE_symbolCompressionTransform* symbolTT = (FSE_symbolCompressionTransform*) FSCTptr;
 
-    /* header */
-    tableU16[-2] = (U16) 0;
-    tableU16[-1] = (U16) symbolValue;
+	/* header */
+	tableU16[-2] = (U16) 0;
+	tableU16[-1] = (U16) symbolValue;
 
-    /* Build table */
-    tableU16[0] = 0;
-    tableU16[1] = 0;   /* just in case */
+	/* Build table */
+	tableU16[0] = 0;
+	tableU16[1] = 0;   /* just in case */
 
-    /* Build Symbol Transformation Table */
-    symbolTT[symbolValue].deltaNbBits = 0;
-    symbolTT[symbolValue].deltaFindState = 0;
+	/* Build Symbol Transformation Table */
+	symbolTT[symbolValue].deltaNbBits = 0;
+	symbolTT[symbolValue].deltaFindState = 0;
 
-    return 0;
+	return 0;
 }
 
 
 static size_t FSE_compress_usingCTable_generic (void* dst, size_t dstSize,
-                           const void* src, size_t srcSize,
-                           const FSE_CTable* ct, const unsigned fast)
+						   const void* src, size_t srcSize,
+						   const FSE_CTable* ct, const unsigned fast)
 {
-    const BYTE* const istart = (const BYTE*) src;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* ip=iend;
+	const BYTE* const istart = (const BYTE*) src;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* ip=iend;
 
-    BIT_CStream_t bitC;
-    FSE_CState_t CState1, CState2;
+	BIT_CStream_t bitC;
+	FSE_CState_t CState1, CState2;
 
-    /* init */
-    if (srcSize <= 2) return 0;
-    { size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
-      if (FSE_isError(initError)) return 0; /* not enough space available to write a bitstream */ }
+	/* init */
+	if (srcSize <= 2) return 0;
+	{ size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
+	  if (FSE_isError(initError)) return 0; /* not enough space available to write a bitstream */ }
 
 #define FSE_FLUSHBITS(s)  (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
 
-    if (srcSize & 1) {
-        FSE_initCState2(&CState1, ct, *--ip);
-        FSE_initCState2(&CState2, ct, *--ip);
-        FSE_encodeSymbol(&bitC, &CState1, *--ip);
-        FSE_FLUSHBITS(&bitC);
-    } else {
-        FSE_initCState2(&CState2, ct, *--ip);
-        FSE_initCState2(&CState1, ct, *--ip);
-    }
+	if (srcSize & 1) {
+		FSE_initCState2(&CState1, ct, *--ip);
+		FSE_initCState2(&CState2, ct, *--ip);
+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
+		FSE_FLUSHBITS(&bitC);
+	} else {
+		FSE_initCState2(&CState2, ct, *--ip);
+		FSE_initCState2(&CState1, ct, *--ip);
+	}
 
-    /* join to mod 4 */
-    srcSize -= 2;
-    if ((sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) && (srcSize & 2)) {  /* test bit 2 */
-        FSE_encodeSymbol(&bitC, &CState2, *--ip);
-        FSE_encodeSymbol(&bitC, &CState1, *--ip);
-        FSE_FLUSHBITS(&bitC);
-    }
+	/* join to mod 4 */
+	srcSize -= 2;
+	if ((sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) && (srcSize & 2)) {  /* test bit 2 */
+		FSE_encodeSymbol(&bitC, &CState2, *--ip);
+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
+		FSE_FLUSHBITS(&bitC);
+	}
 
-    /* 2 or 4 encoding per loop */
-    while ( ip>istart ) {
+	/* 2 or 4 encoding per loop */
+	while ( ip>istart ) {
 
-        FSE_encodeSymbol(&bitC, &CState2, *--ip);
+		FSE_encodeSymbol(&bitC, &CState2, *--ip);
 
-        if (sizeof(bitC.bitContainer)*8 < FSE_MAX_TABLELOG*2+7 )   /* this test must be static */
-            FSE_FLUSHBITS(&bitC);
+		if (sizeof(bitC.bitContainer)*8 < FSE_MAX_TABLELOG*2+7 )   /* this test must be static */
+			FSE_FLUSHBITS(&bitC);
 
-        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
 
-        if (sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) {  /* this test must be static */
-            FSE_encodeSymbol(&bitC, &CState2, *--ip);
-            FSE_encodeSymbol(&bitC, &CState1, *--ip);
-        }
+		if (sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) {  /* this test must be static */
+			FSE_encodeSymbol(&bitC, &CState2, *--ip);
+			FSE_encodeSymbol(&bitC, &CState1, *--ip);
+		}
 
-        FSE_FLUSHBITS(&bitC);
-    }
+		FSE_FLUSHBITS(&bitC);
+	}
 
-    FSE_flushCState(&bitC, &CState2);
-    FSE_flushCState(&bitC, &CState1);
-    return BIT_closeCStream(&bitC);
+	FSE_flushCState(&bitC, &CState2);
+	FSE_flushCState(&bitC, &CState1);
+	return BIT_closeCStream(&bitC);
 }
 
 size_t FSE_compress_usingCTable (void* dst, size_t dstSize,
-                           const void* src, size_t srcSize,
-                           const FSE_CTable* ct)
+						   const void* src, size_t srcSize,
+						   const FSE_CTable* ct)
 {
-    unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
+	unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
 
-    if (fast)
-        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
-    else
-        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
+	if (fast)
+		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
+	else
+		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
 }
 
 
@@ -790,67 +790,67 @@ size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
  */
 size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize)
 {
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const oend = ostart + dstSize;
+	BYTE* const ostart = (BYTE*) dst;
+	BYTE* op = ostart;
+	BYTE* const oend = ostart + dstSize;
 
-    U32   count[FSE_MAX_SYMBOL_VALUE+1];
-    S16   norm[FSE_MAX_SYMBOL_VALUE+1];
-    FSE_CTable* CTable = (FSE_CTable*)workSpace;
-    size_t const CTableSize = FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue);
-    void* scratchBuffer = (void*)(CTable + CTableSize);
-    size_t const scratchBufferSize = wkspSize - (CTableSize * sizeof(FSE_CTable));
+	U32   count[FSE_MAX_SYMBOL_VALUE+1];
+	S16   norm[FSE_MAX_SYMBOL_VALUE+1];
+	FSE_CTable* CTable = (FSE_CTable*)workSpace;
+	size_t const CTableSize = FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue);
+	void* scratchBuffer = (void*)(CTable + CTableSize);
+	size_t const scratchBufferSize = wkspSize - (CTableSize * sizeof(FSE_CTable));
 
-    /* init conditions */
-    if (wkspSize < FSE_WKSP_SIZE_U32(tableLog, maxSymbolValue)) return ERROR(tableLog_tooLarge);
-    if (srcSize <= 1) return 0;  /* Not compressible */
-    if (!maxSymbolValue) maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-    if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
+	/* init conditions */
+	if (wkspSize < FSE_WKSP_SIZE_U32(tableLog, maxSymbolValue)) return ERROR(tableLog_tooLarge);
+	if (srcSize <= 1) return 0;  /* Not compressible */
+	if (!maxSymbolValue) maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+	if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
 
-    /* Scan input and build symbol stats */
-    {   CHECK_V_F(maxCount, FSE_count(count, &maxSymbolValue, src, srcSize) );
-        if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
-        if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
-        if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
-    }
+	/* Scan input and build symbol stats */
+	{   CHECK_V_F(maxCount, FSE_count(count, &maxSymbolValue, src, srcSize) );
+		if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
+		if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
+		if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
+	}
 
-    tableLog = FSE_optimalTableLog(tableLog, srcSize, maxSymbolValue);
-    CHECK_F( FSE_normalizeCount(norm, tableLog, count, srcSize, maxSymbolValue) );
+	tableLog = FSE_optimalTableLog(tableLog, srcSize, maxSymbolValue);
+	CHECK_F( FSE_normalizeCount(norm, tableLog, count, srcSize, maxSymbolValue) );
 
-    /* Write table description header */
-    {   CHECK_V_F(nc_err, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
-        op += nc_err;
-    }
+	/* Write table description header */
+	{   CHECK_V_F(nc_err, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
+		op += nc_err;
+	}
 
-    /* Compress */
-    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, scratchBufferSize) );
-    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, src, srcSize, CTable) );
-        if (cSize == 0) return 0;   /* not enough space for compressed data */
-        op += cSize;
-    }
+	/* Compress */
+	CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, scratchBufferSize) );
+	{   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, src, srcSize, CTable) );
+		if (cSize == 0) return 0;   /* not enough space for compressed data */
+		op += cSize;
+	}
 
-    /* check compressibility */
-    if ( (size_t)(op-ostart) >= srcSize-1 ) return 0;
+	/* check compressibility */
+	if ( (size_t)(op-ostart) >= srcSize-1 ) return 0;
 
-    return op-ostart;
+	return op-ostart;
 }
 
 typedef struct {
-    FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
-    BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
+	FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
+	BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
 } fseWkspMax_t;
 
 size_t FSE_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog)
 {
-    fseWkspMax_t scratchBuffer;
-    FSE_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-    return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
+	fseWkspMax_t scratchBuffer;
+	FSE_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
+	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+	return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
 }
 
 size_t FSE_compress (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
+	return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
 }
 
 
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
index 8474a4c07..dd2dadc20 100644
--- a/contrib/linux-kernel/lib/fse_decompress.c
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -8,9 +8,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -27,9 +27,9 @@
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+	You can contact the author at :
+	- FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 ****************************************************************** */
 
 
@@ -100,70 +100,70 @@
 /* Function templates */
 FSE_DTable* FSE_createDTable (unsigned tableLog)
 {
-    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-    return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
+	if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+	return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
 }
 
 void FSE_freeDTable (FSE_DTable* dt)
 {
-    free(dt);
+	free(dt);
 }
 
 size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
 {
-    void* const tdPtr = dt+1;   /* because *dt is unsigned, 32-bits aligned on 32-bits */
-    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*) (tdPtr);
-    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
+	void* const tdPtr = dt+1;   /* because *dt is unsigned, 32-bits aligned on 32-bits */
+	FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*) (tdPtr);
+	U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
 
-    U32 const maxSV1 = maxSymbolValue + 1;
-    U32 const tableSize = 1 << tableLog;
-    U32 highThreshold = tableSize-1;
+	U32 const maxSV1 = maxSymbolValue + 1;
+	U32 const tableSize = 1 << tableLog;
+	U32 highThreshold = tableSize-1;
 
-    /* Sanity Checks */
-    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+	/* Sanity Checks */
+	if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
+	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
 
-    /* Init, lay down lowprob symbols */
-    {   FSE_DTableHeader DTableH;
-        DTableH.tableLog = (U16)tableLog;
-        DTableH.fastMode = 1;
-        {   S16 const largeLimit= (S16)(1 << (tableLog-1));
-            U32 s;
-            for (s=0; s<maxSV1; s++) {
-                if (normalizedCounter[s]==-1) {
-                    tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
-                    symbolNext[s] = 1;
-                } else {
-                    if (normalizedCounter[s] >= largeLimit) DTableH.fastMode=0;
-                    symbolNext[s] = normalizedCounter[s];
-        }   }   }
-        memcpy(dt, &DTableH, sizeof(DTableH));
-    }
+	/* Init, lay down lowprob symbols */
+	{   FSE_DTableHeader DTableH;
+		DTableH.tableLog = (U16)tableLog;
+		DTableH.fastMode = 1;
+		{   S16 const largeLimit= (S16)(1 << (tableLog-1));
+			U32 s;
+			for (s=0; s<maxSV1; s++) {
+				if (normalizedCounter[s]==-1) {
+					tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
+					symbolNext[s] = 1;
+				} else {
+					if (normalizedCounter[s] >= largeLimit) DTableH.fastMode=0;
+					symbolNext[s] = normalizedCounter[s];
+		}   }   }
+		memcpy(dt, &DTableH, sizeof(DTableH));
+	}
 
-    /* Spread symbols */
-    {   U32 const tableMask = tableSize-1;
-        U32 const step = FSE_TABLESTEP(tableSize);
-        U32 s, position = 0;
-        for (s=0; s<maxSV1; s++) {
-            int i;
-            for (i=0; i<normalizedCounter[s]; i++) {
-                tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
-                position = (position + step) & tableMask;
-                while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
-        }   }
-        if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-    }
+	/* Spread symbols */
+	{   U32 const tableMask = tableSize-1;
+		U32 const step = FSE_TABLESTEP(tableSize);
+		U32 s, position = 0;
+		for (s=0; s<maxSV1; s++) {
+			int i;
+			for (i=0; i<normalizedCounter[s]; i++) {
+				tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
+				position = (position + step) & tableMask;
+				while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
+		}   }
+		if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
+	}
 
-    /* Build Decoding table */
-    {   U32 u;
-        for (u=0; u<tableSize; u++) {
-            FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
-            U16 nextState = symbolNext[symbol]++;
-            tableDecode[u].nbBits = (BYTE) (tableLog - BIT_highbit32 ((U32)nextState) );
-            tableDecode[u].newState = (U16) ( (nextState << tableDecode[u].nbBits) - tableSize);
-    }   }
+	/* Build Decoding table */
+	{   U32 u;
+		for (u=0; u<tableSize; u++) {
+			FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
+			U16 nextState = symbolNext[symbol]++;
+			tableDecode[u].nbBits = (BYTE) (tableLog - BIT_highbit32 ((U32)nextState) );
+			tableDecode[u].newState = (U16) ( (nextState << tableDecode[u].nbBits) - tableSize);
+	}   }
 
-    return 0;
+	return 0;
 }
 
 
@@ -174,144 +174,144 @@ size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned
 *********************************************************/
 size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
 {
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    void* dPtr = dt + 1;
-    FSE_decode_t* const cell = (FSE_decode_t*)dPtr;
+	void* ptr = dt;
+	FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+	void* dPtr = dt + 1;
+	FSE_decode_t* const cell = (FSE_decode_t*)dPtr;
 
-    DTableH->tableLog = 0;
-    DTableH->fastMode = 0;
+	DTableH->tableLog = 0;
+	DTableH->fastMode = 0;
 
-    cell->newState = 0;
-    cell->symbol = symbolValue;
-    cell->nbBits = 0;
+	cell->newState = 0;
+	cell->symbol = symbolValue;
+	cell->nbBits = 0;
 
-    return 0;
+	return 0;
 }
 
 
 size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
 {
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    void* dPtr = dt + 1;
-    FSE_decode_t* const dinfo = (FSE_decode_t*)dPtr;
-    const unsigned tableSize = 1 << nbBits;
-    const unsigned tableMask = tableSize - 1;
-    const unsigned maxSV1 = tableMask+1;
-    unsigned s;
+	void* ptr = dt;
+	FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+	void* dPtr = dt + 1;
+	FSE_decode_t* const dinfo = (FSE_decode_t*)dPtr;
+	const unsigned tableSize = 1 << nbBits;
+	const unsigned tableMask = tableSize - 1;
+	const unsigned maxSV1 = tableMask+1;
+	unsigned s;
 
-    /* Sanity checks */
-    if (nbBits < 1) return ERROR(GENERIC);         /* min size */
+	/* Sanity checks */
+	if (nbBits < 1) return ERROR(GENERIC);         /* min size */
 
-    /* Build Decoding Table */
-    DTableH->tableLog = (U16)nbBits;
-    DTableH->fastMode = 1;
-    for (s=0; s<maxSV1; s++) {
-        dinfo[s].newState = 0;
-        dinfo[s].symbol = (BYTE)s;
-        dinfo[s].nbBits = (BYTE)nbBits;
-    }
+	/* Build Decoding Table */
+	DTableH->tableLog = (U16)nbBits;
+	DTableH->fastMode = 1;
+	for (s=0; s<maxSV1; s++) {
+		dinfo[s].newState = 0;
+		dinfo[s].symbol = (BYTE)s;
+		dinfo[s].nbBits = (BYTE)nbBits;
+	}
 
-    return 0;
+	return 0;
 }
 
 FORCE_INLINE size_t FSE_decompress_usingDTable_generic(
-          void* dst, size_t maxDstSize,
-    const void* cSrc, size_t cSrcSize,
-    const FSE_DTable* dt, const unsigned fast)
+		  void* dst, size_t maxDstSize,
+	const void* cSrc, size_t cSrcSize,
+	const FSE_DTable* dt, const unsigned fast)
 {
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const omax = op + maxDstSize;
-    BYTE* const olimit = omax-3;
+	BYTE* const ostart = (BYTE*) dst;
+	BYTE* op = ostart;
+	BYTE* const omax = op + maxDstSize;
+	BYTE* const olimit = omax-3;
 
-    BIT_DStream_t bitD;
-    FSE_DState_t state1;
-    FSE_DState_t state2;
+	BIT_DStream_t bitD;
+	FSE_DState_t state1;
+	FSE_DState_t state2;
 
-    /* Init */
-    CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
+	/* Init */
+	CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
 
-    FSE_initDState(&state1, &bitD, dt);
-    FSE_initDState(&state2, &bitD, dt);
+	FSE_initDState(&state1, &bitD, dt);
+	FSE_initDState(&state2, &bitD, dt);
 
 #define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
 
-    /* 4 symbols per loop */
-    for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) & (op<olimit) ; op+=4) {
-        op[0] = FSE_GETSYMBOL(&state1);
+	/* 4 symbols per loop */
+	for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) & (op<olimit) ; op+=4) {
+		op[0] = FSE_GETSYMBOL(&state1);
 
-        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
+		if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+			BIT_reloadDStream(&bitD);
 
-        op[1] = FSE_GETSYMBOL(&state2);
+		op[1] = FSE_GETSYMBOL(&state2);
 
-        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
+		if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+			{ if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
 
-        op[2] = FSE_GETSYMBOL(&state1);
+		op[2] = FSE_GETSYMBOL(&state1);
 
-        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
+		if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+			BIT_reloadDStream(&bitD);
 
-        op[3] = FSE_GETSYMBOL(&state2);
-    }
+		op[3] = FSE_GETSYMBOL(&state2);
+	}
 
-    /* tail */
-    /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
-    while (1) {
-        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
-        *op++ = FSE_GETSYMBOL(&state1);
-        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
-            *op++ = FSE_GETSYMBOL(&state2);
-            break;
-        }
+	/* tail */
+	/* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
+	while (1) {
+		if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+		*op++ = FSE_GETSYMBOL(&state1);
+		if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+			*op++ = FSE_GETSYMBOL(&state2);
+			break;
+		}
 
-        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
-        *op++ = FSE_GETSYMBOL(&state2);
-        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
-            *op++ = FSE_GETSYMBOL(&state1);
-            break;
-    }   }
+		if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+		*op++ = FSE_GETSYMBOL(&state2);
+		if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+			*op++ = FSE_GETSYMBOL(&state1);
+			break;
+	}   }
 
-    return op-ostart;
+	return op-ostart;
 }
 
 
 size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
-                            const void* cSrc, size_t cSrcSize,
-                            const FSE_DTable* dt)
+							const void* cSrc, size_t cSrcSize,
+							const FSE_DTable* dt)
 {
-    const void* ptr = dt;
-    const FSE_DTableHeader* DTableH = (const FSE_DTableHeader*)ptr;
-    const U32 fastMode = DTableH->fastMode;
+	const void* ptr = dt;
+	const FSE_DTableHeader* DTableH = (const FSE_DTableHeader*)ptr;
+	const U32 fastMode = DTableH->fastMode;
 
-    /* select fast mode (static) */
-    if (fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
+	/* select fast mode (static) */
+	if (fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
+	return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
 }
 
 
 size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog)
 {
-    const BYTE* const istart = (const BYTE*)cSrc;
-    const BYTE* ip = istart;
-    short counting[FSE_MAX_SYMBOL_VALUE+1];
-    unsigned tableLog;
-    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+	const BYTE* const istart = (const BYTE*)cSrc;
+	const BYTE* ip = istart;
+	short counting[FSE_MAX_SYMBOL_VALUE+1];
+	unsigned tableLog;
+	unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
 
-    /* normal FSE decoding mode */
-    size_t const NCountLength = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-    if (FSE_isError(NCountLength)) return NCountLength;
-    //if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining case : NCountLength==cSrcSize */
-    if (tableLog > maxLog) return ERROR(tableLog_tooLarge);
-    ip += NCountLength;
-    cSrcSize -= NCountLength;
+	/* normal FSE decoding mode */
+	size_t const NCountLength = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
+	if (FSE_isError(NCountLength)) return NCountLength;
+	//if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining case : NCountLength==cSrcSize */
+	if (tableLog > maxLog) return ERROR(tableLog_tooLarge);
+	ip += NCountLength;
+	cSrcSize -= NCountLength;
 
-    CHECK_F( FSE_buildDTable (workSpace, counting, maxSymbolValue, tableLog) );
+	CHECK_F( FSE_buildDTable (workSpace, counting, maxSymbolValue, tableLog) );
 
-    return FSE_decompress_usingDTable (dst, dstCapacity, ip, cSrcSize, workSpace);   /* always return, even if it is an error code */
+	return FSE_decompress_usingDTable (dst, dstCapacity, ip, cSrcSize, workSpace);   /* always return, even if it is an error code */
 }
 
 
@@ -319,8 +319,8 @@ typedef FSE_DTable DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
 
 size_t FSE_decompress(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize)
 {
-    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
-    return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
+	DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
+	return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
 }
 
 
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index e5572760a..8ad3e2b42 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -9,9 +9,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -46,31 +46,31 @@ extern "C" {
 /* *** simple functions *** */
 /**
 HUF_compress() :
-    Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
-    'dst' buffer must be already allocated.
-    Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
-    `srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
-    @return : size of compressed data (<= `dstCapacity`).
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-                     if return == 1, srcData is a single repeated byte symbol (RLE compression).
-                     if HUF_isError(return), compression failed (more details using HUF_getErrorName())
+	Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
+	'dst' buffer must be already allocated.
+	Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
+	`srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
+	@return : size of compressed data (<= `dstCapacity`).
+	Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+					 if return == 1, srcData is a single repeated byte symbol (RLE compression).
+					 if HUF_isError(return), compression failed (more details using HUF_getErrorName())
 */
 size_t HUF_compress(void* dst, size_t dstCapacity,
-              const void* src, size_t srcSize);
+			  const void* src, size_t srcSize);
 
 /**
 HUF_decompress() :
-    Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
-    into already allocated buffer 'dst', of minimum size 'dstSize'.
-    `originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
-    Note : in contrast with FSE, HUF_decompress can regenerate
-           RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
-           because it knows size to regenerate.
-    @return : size of regenerated data (== originalSize),
-              or an error code, which can be tested using HUF_isError()
+	Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
+	into already allocated buffer 'dst', of minimum size 'dstSize'.
+	`originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
+	Note : in contrast with FSE, HUF_decompress can regenerate
+		   RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
+		   because it knows size to regenerate.
+	@return : size of regenerated data (== originalSize),
+			  or an error code, which can be tested using HUF_isError()
 */
 size_t HUF_decompress(void* dst,  size_t originalSize,
-                const void* cSrc, size_t cSrcSize);
+				const void* cSrc, size_t cSrcSize);
 
 
 /* ***   Tool functions *** */
@@ -122,17 +122,17 @@ size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t s
 
 /* static allocation of HUF's Compression Table */
 #define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
-    U32 name##hb[maxSymbolValue+1]; \
-    void* name##hv = &(name##hb); \
-    HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
+	U32 name##hb[maxSymbolValue+1]; \
+	void* name##hv = &(name##hb); \
+	HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
 
 /* static allocation of HUF's DTable */
 typedef U32 HUF_DTable;
 #define HUF_DTABLE_SIZE(maxTableLog)   (1 + (1<<(maxTableLog)))
 #define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) \
-        HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = { ((U32)((maxTableLog)-1) * 0x01000001) }
+		HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = { ((U32)((maxTableLog)-1) * 0x01000001) }
 #define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) \
-        HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
+		HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
 
 /* The workspace must have alignment at least 4 and be at least this large */
 #define HUF_WORKSPACE_SIZE (6 << 10)
@@ -192,13 +192,13 @@ size_t HUF_compress4X_repeat(void* dst, size_t dstSize, const void* src, size_t
 size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize);
 
 /*! HUF_readStats() :
-    Read compact Huffman tree, saved by HUF_writeCTable().
-    `huffWeight` is destination buffer.
-    @return : size read from `src` , or an error Code .
-    Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
+	Read compact Huffman tree, saved by HUF_writeCTable().
+	`huffWeight` is destination buffer.
+	@return : size read from `src` , or an error Code .
+	Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
 size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
-                     U32* nbSymbolsPtr, U32* tableLogPtr,
-                     const void* src, size_t srcSize);
+					 U32* nbSymbolsPtr, U32* tableLogPtr,
+					 const void* src, size_t srcSize);
 
 /** HUF_readCTable() :
 *   Loading a CTable saved with HUF_writeCTable() */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index fe11aafb8..4a6ea9963 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -8,9 +8,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -27,9 +27,9 @@
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+	You can contact the author at :
+	- FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 ****************************************************************** */
 
 /* **************************************************************
@@ -65,7 +65,7 @@
 ****************************************************************/
 unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
 {
-    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
+	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
 }
 
 
@@ -80,44 +80,44 @@ unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxS
 #define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
 size_t HUF_compressWeights (void* dst, size_t dstSize, const void* weightTable, size_t wtSize)
 {
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const oend = ostart + dstSize;
+	BYTE* const ostart = (BYTE*) dst;
+	BYTE* op = ostart;
+	BYTE* const oend = ostart + dstSize;
 
-    U32 maxSymbolValue = HUF_TABLELOG_MAX;
-    U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
+	U32 maxSymbolValue = HUF_TABLELOG_MAX;
+	U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
 
-    FSE_CTable CTable[FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX)];
-    BYTE scratchBuffer[1<<MAX_FSE_TABLELOG_FOR_HUFF_HEADER];
+	FSE_CTable CTable[FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX)];
+	BYTE scratchBuffer[1<<MAX_FSE_TABLELOG_FOR_HUFF_HEADER];
 
-    U32 count[HUF_TABLELOG_MAX+1];
-    S16 norm[HUF_TABLELOG_MAX+1];
+	U32 count[HUF_TABLELOG_MAX+1];
+	S16 norm[HUF_TABLELOG_MAX+1];
 
-    /* init conditions */
-    if (wtSize <= 1) return 0;  /* Not compressible */
+	/* init conditions */
+	if (wtSize <= 1) return 0;  /* Not compressible */
 
-    /* Scan input and build symbol stats */
-    {   CHECK_V_F(maxCount, FSE_count_simple(count, &maxSymbolValue, weightTable, wtSize) );
-        if (maxCount == wtSize) return 1;   /* only a single symbol in src : rle */
-        if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
-    }
+	/* Scan input and build symbol stats */
+	{   CHECK_V_F(maxCount, FSE_count_simple(count, &maxSymbolValue, weightTable, wtSize) );
+		if (maxCount == wtSize) return 1;   /* only a single symbol in src : rle */
+		if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
+	}
 
-    tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
-    CHECK_F( FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue) );
+	tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
+	CHECK_F( FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue) );
 
-    /* Write table description header */
-    {   CHECK_V_F(hSize, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
-        op += hSize;
-    }
+	/* Write table description header */
+	{   CHECK_V_F(hSize, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
+		op += hSize;
+	}
 
-    /* Compress */
-    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, sizeof(scratchBuffer)) );
-    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable) );
-        if (cSize == 0) return 0;   /* not enough space for compressed data */
-        op += cSize;
-    }
+	/* Compress */
+	CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, sizeof(scratchBuffer)) );
+	{   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable) );
+		if (cSize == 0) return 0;   /* not enough space for compressed data */
+		op += cSize;
+	}
 
-    return op-ostart;
+	return op-ostart;
 }
 
 
@@ -127,201 +127,201 @@ struct HUF_CElt_s {
 };   /* typedef'd to HUF_CElt within "huf.h" */
 
 /*! HUF_writeCTable() :
-    `CTable` : Huffman tree to save, using huf representation.
-    @return : size of saved CTable */
+	`CTable` : Huffman tree to save, using huf representation.
+	@return : size of saved CTable */
 size_t HUF_writeCTable (void* dst, size_t maxDstSize,
-                        const HUF_CElt* CTable, U32 maxSymbolValue, U32 huffLog)
+						const HUF_CElt* CTable, U32 maxSymbolValue, U32 huffLog)
 {
-    BYTE bitsToWeight[HUF_TABLELOG_MAX + 1];   /* precomputed conversion table */
-    BYTE huffWeight[HUF_SYMBOLVALUE_MAX];
-    BYTE* op = (BYTE*)dst;
-    U32 n;
+	BYTE bitsToWeight[HUF_TABLELOG_MAX + 1];   /* precomputed conversion table */
+	BYTE huffWeight[HUF_SYMBOLVALUE_MAX];
+	BYTE* op = (BYTE*)dst;
+	U32 n;
 
-     /* check conditions */
-    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
+	 /* check conditions */
+	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
 
-    /* convert to weight */
-    bitsToWeight[0] = 0;
-    for (n=1; n<huffLog+1; n++)
-        bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
-    for (n=0; n<maxSymbolValue; n++)
-        huffWeight[n] = bitsToWeight[CTable[n].nbBits];
+	/* convert to weight */
+	bitsToWeight[0] = 0;
+	for (n=1; n<huffLog+1; n++)
+		bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
+	for (n=0; n<maxSymbolValue; n++)
+		huffWeight[n] = bitsToWeight[CTable[n].nbBits];
 
-    /* attempt weights compression by FSE */
-    {   CHECK_V_F(hSize, HUF_compressWeights(op+1, maxDstSize-1, huffWeight, maxSymbolValue) );
-        if ((hSize>1) & (hSize < maxSymbolValue/2)) {   /* FSE compressed */
-            op[0] = (BYTE)hSize;
-            return hSize+1;
-    }   }
+	/* attempt weights compression by FSE */
+	{   CHECK_V_F(hSize, HUF_compressWeights(op+1, maxDstSize-1, huffWeight, maxSymbolValue) );
+		if ((hSize>1) & (hSize < maxSymbolValue/2)) {   /* FSE compressed */
+			op[0] = (BYTE)hSize;
+			return hSize+1;
+	}   }
 
-    /* write raw values as 4-bits (max : 15) */
-    if (maxSymbolValue > (256-128)) return ERROR(GENERIC);   /* should not happen : likely means source cannot be compressed */
-    if (((maxSymbolValue+1)/2) + 1 > maxDstSize) return ERROR(dstSize_tooSmall);   /* not enough space within dst buffer */
-    op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue-1));
-    huffWeight[maxSymbolValue] = 0;   /* to be sure it doesn't cause msan issue in final combination */
-    for (n=0; n<maxSymbolValue; n+=2)
-        op[(n/2)+1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n+1]);
-    return ((maxSymbolValue+1)/2) + 1;
+	/* write raw values as 4-bits (max : 15) */
+	if (maxSymbolValue > (256-128)) return ERROR(GENERIC);   /* should not happen : likely means source cannot be compressed */
+	if (((maxSymbolValue+1)/2) + 1 > maxDstSize) return ERROR(dstSize_tooSmall);   /* not enough space within dst buffer */
+	op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue-1));
+	huffWeight[maxSymbolValue] = 0;   /* to be sure it doesn't cause msan issue in final combination */
+	for (n=0; n<maxSymbolValue; n+=2)
+		op[(n/2)+1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n+1]);
+	return ((maxSymbolValue+1)/2) + 1;
 }
 
 
 size_t HUF_readCTable (HUF_CElt* CTable, U32 maxSymbolValue, const void* src, size_t srcSize)
 {
-    BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];   /* init not required, even though some static analyzer may complain */
-    U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
-    U32 tableLog = 0;
-    U32 nbSymbols = 0;
+	BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];   /* init not required, even though some static analyzer may complain */
+	U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
+	U32 tableLog = 0;
+	U32 nbSymbols = 0;
 
-    /* get symbol weights */
-    CHECK_V_F(readSize, HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX+1, rankVal, &nbSymbols, &tableLog, src, srcSize));
+	/* get symbol weights */
+	CHECK_V_F(readSize, HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX+1, rankVal, &nbSymbols, &tableLog, src, srcSize));
 
-    /* check result */
-    if (tableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    if (nbSymbols > maxSymbolValue+1) return ERROR(maxSymbolValue_tooSmall);
+	/* check result */
+	if (tableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+	if (nbSymbols > maxSymbolValue+1) return ERROR(maxSymbolValue_tooSmall);
 
-    /* Prepare base value per rank */
-    {   U32 n, nextRankStart = 0;
-        for (n=1; n<=tableLog; n++) {
-            U32 current = nextRankStart;
-            nextRankStart += (rankVal[n] << (n-1));
-            rankVal[n] = current;
-    }   }
+	/* Prepare base value per rank */
+	{   U32 n, nextRankStart = 0;
+		for (n=1; n<=tableLog; n++) {
+			U32 current = nextRankStart;
+			nextRankStart += (rankVal[n] << (n-1));
+			rankVal[n] = current;
+	}   }
 
-    /* fill nbBits */
-    {   U32 n; for (n=0; n<nbSymbols; n++) {
-            const U32 w = huffWeight[n];
-            CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
-    }   }
+	/* fill nbBits */
+	{   U32 n; for (n=0; n<nbSymbols; n++) {
+			const U32 w = huffWeight[n];
+			CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
+	}   }
 
-    /* fill val */
-    {   U16 nbPerRank[HUF_TABLELOG_MAX+2]  = {0};  /* support w=0=>n=tableLog+1 */
-        U16 valPerRank[HUF_TABLELOG_MAX+2] = {0};
-        { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[CTable[n].nbBits]++; }
-        /* determine stating value per rank */
-        valPerRank[tableLog+1] = 0;   /* for w==0 */
-        {   U16 min = 0;
-            U32 n; for (n=tableLog; n>0; n--) {  /* start at n=tablelog <-> w=1 */
-                valPerRank[n] = min;     /* get starting value within each rank */
-                min += nbPerRank[n];
-                min >>= 1;
-        }   }
-        /* assign value within rank, symbol order */
-        { U32 n; for (n=0; n<=maxSymbolValue; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; }
-    }
+	/* fill val */
+	{   U16 nbPerRank[HUF_TABLELOG_MAX+2]  = {0};  /* support w=0=>n=tableLog+1 */
+		U16 valPerRank[HUF_TABLELOG_MAX+2] = {0};
+		{ U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[CTable[n].nbBits]++; }
+		/* determine stating value per rank */
+		valPerRank[tableLog+1] = 0;   /* for w==0 */
+		{   U16 min = 0;
+			U32 n; for (n=tableLog; n>0; n--) {  /* start at n=tablelog <-> w=1 */
+				valPerRank[n] = min;     /* get starting value within each rank */
+				min += nbPerRank[n];
+				min >>= 1;
+		}   }
+		/* assign value within rank, symbol order */
+		{ U32 n; for (n=0; n<=maxSymbolValue; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; }
+	}
 
-    return readSize;
+	return readSize;
 }
 
 
 typedef struct nodeElt_s {
-    U32 count;
-    U16 parent;
-    BYTE byte;
-    BYTE nbBits;
+	U32 count;
+	U16 parent;
+	BYTE byte;
+	BYTE nbBits;
 } nodeElt;
 
 static U32 HUF_setMaxHeight(nodeElt* huffNode, U32 lastNonNull, U32 maxNbBits)
 {
-    const U32 largestBits = huffNode[lastNonNull].nbBits;
-    if (largestBits <= maxNbBits) return largestBits;   /* early exit : no elt > maxNbBits */
+	const U32 largestBits = huffNode[lastNonNull].nbBits;
+	if (largestBits <= maxNbBits) return largestBits;   /* early exit : no elt > maxNbBits */
 
-    /* there are several too large elements (at least >= 2) */
-    {   int totalCost = 0;
-        const U32 baseCost = 1 << (largestBits - maxNbBits);
-        U32 n = lastNonNull;
+	/* there are several too large elements (at least >= 2) */
+	{   int totalCost = 0;
+		const U32 baseCost = 1 << (largestBits - maxNbBits);
+		U32 n = lastNonNull;
 
-        while (huffNode[n].nbBits > maxNbBits) {
-            totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
-            huffNode[n].nbBits = (BYTE)maxNbBits;
-            n --;
-        }  /* n stops at huffNode[n].nbBits <= maxNbBits */
-        while (huffNode[n].nbBits == maxNbBits) n--;   /* n end at index of smallest symbol using < maxNbBits */
+		while (huffNode[n].nbBits > maxNbBits) {
+			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
+			huffNode[n].nbBits = (BYTE)maxNbBits;
+			n --;
+		}  /* n stops at huffNode[n].nbBits <= maxNbBits */
+		while (huffNode[n].nbBits == maxNbBits) n--;   /* n end at index of smallest symbol using < maxNbBits */
 
-        /* renorm totalCost */
-        totalCost >>= (largestBits - maxNbBits);  /* note : totalCost is necessarily a multiple of baseCost */
+		/* renorm totalCost */
+		totalCost >>= (largestBits - maxNbBits);  /* note : totalCost is necessarily a multiple of baseCost */
 
-        /* repay normalized cost */
-        {   U32 const noSymbol = 0xF0F0F0F0;
-            U32 rankLast[HUF_TABLELOG_MAX+2];
-            int pos;
+		/* repay normalized cost */
+		{   U32 const noSymbol = 0xF0F0F0F0;
+			U32 rankLast[HUF_TABLELOG_MAX+2];
+			int pos;
 
-            /* Get pos of last (smallest) symbol per rank */
-            memset(rankLast, 0xF0, sizeof(rankLast));
-            {   U32 currentNbBits = maxNbBits;
-                for (pos=n ; pos >= 0; pos--) {
-                    if (huffNode[pos].nbBits >= currentNbBits) continue;
-                    currentNbBits = huffNode[pos].nbBits;   /* < maxNbBits */
-                    rankLast[maxNbBits-currentNbBits] = pos;
-            }   }
+			/* Get pos of last (smallest) symbol per rank */
+			memset(rankLast, 0xF0, sizeof(rankLast));
+			{   U32 currentNbBits = maxNbBits;
+				for (pos=n ; pos >= 0; pos--) {
+					if (huffNode[pos].nbBits >= currentNbBits) continue;
+					currentNbBits = huffNode[pos].nbBits;   /* < maxNbBits */
+					rankLast[maxNbBits-currentNbBits] = pos;
+			}   }
 
-            while (totalCost > 0) {
-                U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
-                for ( ; nBitsToDecrease > 1; nBitsToDecrease--) {
-                    U32 highPos = rankLast[nBitsToDecrease];
-                    U32 lowPos = rankLast[nBitsToDecrease-1];
-                    if (highPos == noSymbol) continue;
-                    if (lowPos == noSymbol) break;
-                    {   U32 const highTotal = huffNode[highPos].count;
-                        U32 const lowTotal = 2 * huffNode[lowPos].count;
-                        if (highTotal <= lowTotal) break;
-                }   }
-                /* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
-                while ((nBitsToDecrease<=HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))  /* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
-                    nBitsToDecrease ++;
-                totalCost -= 1 << (nBitsToDecrease-1);
-                if (rankLast[nBitsToDecrease-1] == noSymbol)
-                    rankLast[nBitsToDecrease-1] = rankLast[nBitsToDecrease];   /* this rank is no longer empty */
-                huffNode[rankLast[nBitsToDecrease]].nbBits ++;
-                if (rankLast[nBitsToDecrease] == 0)    /* special case, reached largest symbol */
-                    rankLast[nBitsToDecrease] = noSymbol;
-                else {
-                    rankLast[nBitsToDecrease]--;
-                    if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits-nBitsToDecrease)
-                        rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */
-            }   }   /* while (totalCost > 0) */
+			while (totalCost > 0) {
+				U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
+				for ( ; nBitsToDecrease > 1; nBitsToDecrease--) {
+					U32 highPos = rankLast[nBitsToDecrease];
+					U32 lowPos = rankLast[nBitsToDecrease-1];
+					if (highPos == noSymbol) continue;
+					if (lowPos == noSymbol) break;
+					{   U32 const highTotal = huffNode[highPos].count;
+						U32 const lowTotal = 2 * huffNode[lowPos].count;
+						if (highTotal <= lowTotal) break;
+				}   }
+				/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
+				while ((nBitsToDecrease<=HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))  /* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
+					nBitsToDecrease ++;
+				totalCost -= 1 << (nBitsToDecrease-1);
+				if (rankLast[nBitsToDecrease-1] == noSymbol)
+					rankLast[nBitsToDecrease-1] = rankLast[nBitsToDecrease];   /* this rank is no longer empty */
+				huffNode[rankLast[nBitsToDecrease]].nbBits ++;
+				if (rankLast[nBitsToDecrease] == 0)    /* special case, reached largest symbol */
+					rankLast[nBitsToDecrease] = noSymbol;
+				else {
+					rankLast[nBitsToDecrease]--;
+					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits-nBitsToDecrease)
+						rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */
+			}   }   /* while (totalCost > 0) */
 
-            while (totalCost < 0) {  /* Sometimes, cost correction overshoot */
-                if (rankLast[1] == noSymbol) {  /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0 (using maxNbBits) */
-                    while (huffNode[n].nbBits == maxNbBits) n--;
-                    huffNode[n+1].nbBits--;
-                    rankLast[1] = n+1;
-                    totalCost++;
-                    continue;
-                }
-                huffNode[ rankLast[1] + 1 ].nbBits--;
-                rankLast[1]++;
-                totalCost ++;
-    }   }   }   /* there are several too large elements (at least >= 2) */
+			while (totalCost < 0) {  /* Sometimes, cost correction overshoot */
+				if (rankLast[1] == noSymbol) {  /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0 (using maxNbBits) */
+					while (huffNode[n].nbBits == maxNbBits) n--;
+					huffNode[n+1].nbBits--;
+					rankLast[1] = n+1;
+					totalCost++;
+					continue;
+				}
+				huffNode[ rankLast[1] + 1 ].nbBits--;
+				rankLast[1]++;
+				totalCost ++;
+	}   }   }   /* there are several too large elements (at least >= 2) */
 
-    return maxNbBits;
+	return maxNbBits;
 }
 
 
 typedef struct {
-    U32 base;
-    U32 current;
+	U32 base;
+	U32 current;
 } rankPos;
 
 static void HUF_sort(nodeElt* huffNode, const U32* count, U32 maxSymbolValue)
 {
-    rankPos rank[32];
-    U32 n;
+	rankPos rank[32];
+	U32 n;
 
-    memset(rank, 0, sizeof(rank));
-    for (n=0; n<=maxSymbolValue; n++) {
-        U32 r = BIT_highbit32(count[n] + 1);
-        rank[r].base ++;
-    }
-    for (n=30; n>0; n--) rank[n-1].base += rank[n].base;
-    for (n=0; n<32; n++) rank[n].current = rank[n].base;
-    for (n=0; n<=maxSymbolValue; n++) {
-        U32 const c = count[n];
-        U32 const r = BIT_highbit32(c+1) + 1;
-        U32 pos = rank[r].current++;
-        while ((pos > rank[r].base) && (c > huffNode[pos-1].count)) huffNode[pos]=huffNode[pos-1], pos--;
-        huffNode[pos].count = c;
-        huffNode[pos].byte  = (BYTE)n;
-    }
+	memset(rank, 0, sizeof(rank));
+	for (n=0; n<=maxSymbolValue; n++) {
+		U32 r = BIT_highbit32(count[n] + 1);
+		rank[r].base ++;
+	}
+	for (n=30; n>0; n--) rank[n-1].base += rank[n].base;
+	for (n=0; n<32; n++) rank[n].current = rank[n].base;
+	for (n=0; n<=maxSymbolValue; n++) {
+		U32 const c = count[n];
+		U32 const r = BIT_highbit32(c+1) + 1;
+		U32 pos = rank[r].current++;
+		while ((pos > rank[r].base) && (c > huffNode[pos-1].count)) huffNode[pos]=huffNode[pos-1], pos--;
+		huffNode[pos].count = c;
+		huffNode[pos].byte  = (BYTE)n;
+	}
 }
 
 
@@ -333,71 +333,71 @@ static void HUF_sort(nodeElt* huffNode, const U32* count, U32 maxSymbolValue)
 typedef nodeElt huffNodeTable[2*HUF_SYMBOLVALUE_MAX+1 +1];
 size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize)
 {
-    nodeElt* const huffNode0 = (nodeElt*)workSpace;
-    nodeElt* const huffNode = huffNode0+1;
-    U32 n, nonNullRank;
-    int lowS, lowN;
-    U16 nodeNb = STARTNODE;
-    U32 nodeRoot;
+	nodeElt* const huffNode0 = (nodeElt*)workSpace;
+	nodeElt* const huffNode = huffNode0+1;
+	U32 n, nonNullRank;
+	int lowS, lowN;
+	U16 nodeNb = STARTNODE;
+	U32 nodeRoot;
 
-    /* safety checks */
-    if (wkspSize < sizeof(huffNodeTable)) return ERROR(GENERIC);   /* workSpace is not large enough */
-    if (maxNbBits == 0) maxNbBits = HUF_TABLELOG_DEFAULT;
-    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(GENERIC);
-    memset(huffNode0, 0, sizeof(huffNodeTable));
+	/* safety checks */
+	if (wkspSize < sizeof(huffNodeTable)) return ERROR(GENERIC);   /* workSpace is not large enough */
+	if (maxNbBits == 0) maxNbBits = HUF_TABLELOG_DEFAULT;
+	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(GENERIC);
+	memset(huffNode0, 0, sizeof(huffNodeTable));
 
-    /* sort, decreasing order */
-    HUF_sort(huffNode, count, maxSymbolValue);
+	/* sort, decreasing order */
+	HUF_sort(huffNode, count, maxSymbolValue);
 
-    /* init for parents */
-    nonNullRank = maxSymbolValue;
-    while(huffNode[nonNullRank].count == 0) nonNullRank--;
-    lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
-    huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count;
-    huffNode[lowS].parent = huffNode[lowS-1].parent = nodeNb;
-    nodeNb++; lowS-=2;
-    for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30);
-    huffNode0[0].count = (U32)(1U<<31);  /* fake entry, strong barrier */
+	/* init for parents */
+	nonNullRank = maxSymbolValue;
+	while(huffNode[nonNullRank].count == 0) nonNullRank--;
+	lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
+	huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count;
+	huffNode[lowS].parent = huffNode[lowS-1].parent = nodeNb;
+	nodeNb++; lowS-=2;
+	for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30);
+	huffNode0[0].count = (U32)(1U<<31);  /* fake entry, strong barrier */
 
-    /* create parents */
-    while (nodeNb <= nodeRoot) {
-        U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-        U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-        huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
-        huffNode[n1].parent = huffNode[n2].parent = nodeNb;
-        nodeNb++;
-    }
+	/* create parents */
+	while (nodeNb <= nodeRoot) {
+		U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+		U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+		huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
+		huffNode[n1].parent = huffNode[n2].parent = nodeNb;
+		nodeNb++;
+	}
 
-    /* distribute weights (unlimited tree height) */
-    huffNode[nodeRoot].nbBits = 0;
-    for (n=nodeRoot-1; n>=STARTNODE; n--)
-        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
-    for (n=0; n<=nonNullRank; n++)
-        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+	/* distribute weights (unlimited tree height) */
+	huffNode[nodeRoot].nbBits = 0;
+	for (n=nodeRoot-1; n>=STARTNODE; n--)
+		huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+	for (n=0; n<=nonNullRank; n++)
+		huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
 
-    /* enforce maxTableLog */
-    maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
+	/* enforce maxTableLog */
+	maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
 
-    /* fill result into tree (val, nbBits) */
-    {   U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0};
-        U16 valPerRank[HUF_TABLELOG_MAX+1] = {0};
-        if (maxNbBits > HUF_TABLELOG_MAX) return ERROR(GENERIC);   /* check fit into table */
-        for (n=0; n<=nonNullRank; n++)
-            nbPerRank[huffNode[n].nbBits]++;
-        /* determine stating value per rank */
-        {   U16 min = 0;
-            for (n=maxNbBits; n>0; n--) {
-                valPerRank[n] = min;      /* get starting value within each rank */
-                min += nbPerRank[n];
-                min >>= 1;
-        }   }
-        for (n=0; n<=maxSymbolValue; n++)
-            tree[huffNode[n].byte].nbBits = huffNode[n].nbBits;   /* push nbBits per symbol, symbol order */
-        for (n=0; n<=maxSymbolValue; n++)
-            tree[n].val = valPerRank[tree[n].nbBits]++;   /* assign value within rank, symbol order */
-    }
+	/* fill result into tree (val, nbBits) */
+	{   U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0};
+		U16 valPerRank[HUF_TABLELOG_MAX+1] = {0};
+		if (maxNbBits > HUF_TABLELOG_MAX) return ERROR(GENERIC);   /* check fit into table */
+		for (n=0; n<=nonNullRank; n++)
+			nbPerRank[huffNode[n].nbBits]++;
+		/* determine stating value per rank */
+		{   U16 min = 0;
+			for (n=maxNbBits; n>0; n--) {
+				valPerRank[n] = min;      /* get starting value within each rank */
+				min += nbPerRank[n];
+				min >>= 1;
+		}   }
+		for (n=0; n<=maxSymbolValue; n++)
+			tree[huffNode[n].byte].nbBits = huffNode[n].nbBits;   /* push nbBits per symbol, symbol order */
+		for (n=0; n<=maxSymbolValue; n++)
+			tree[n].val = valPerRank[tree[n].nbBits]++;   /* assign value within rank, symbol order */
+	}
 
-    return maxNbBits;
+	return maxNbBits;
 }
 
 /** HUF_buildCTable() :
@@ -405,32 +405,32 @@ size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValu
  */
 size_t HUF_buildCTable (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits)
 {
-    huffNodeTable nodeTable;
-    return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, nodeTable, sizeof(nodeTable));
+	huffNodeTable nodeTable;
+	return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, nodeTable, sizeof(nodeTable));
 }
 
 static size_t HUF_estimateCompressedSize(HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue)
 {
-    size_t nbBits = 0;
-    int s;
-    for (s = 0; s <= (int)maxSymbolValue; ++s) {
-        nbBits += CTable[s].nbBits * count[s];
-    }
-    return nbBits >> 3;
+	size_t nbBits = 0;
+	int s;
+	for (s = 0; s <= (int)maxSymbolValue; ++s) {
+		nbBits += CTable[s].nbBits * count[s];
+	}
+	return nbBits >> 3;
 }
 
 static int HUF_validateCTable(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue) {
   int bad = 0;
   int s;
   for (s = 0; s <= (int)maxSymbolValue; ++s) {
-    bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
+	bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
   }
   return !bad;
 }
 
 static void HUF_encodeSymbol(BIT_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable)
 {
-    BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
+	BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
 }
 
 size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
@@ -438,247 +438,247 @@ size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
 #define HUF_FLUSHBITS(s)  (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
 
 #define HUF_FLUSHBITS_1(stream) \
-    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*2+7) HUF_FLUSHBITS(stream)
+	if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*2+7) HUF_FLUSHBITS(stream)
 
 #define HUF_FLUSHBITS_2(stream) \
-    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*4+7) HUF_FLUSHBITS(stream)
+	if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*4+7) HUF_FLUSHBITS(stream)
 
 size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
 {
-    const BYTE* ip = (const BYTE*) src;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
-    size_t n;
-    const unsigned fast = (dstSize >= HUF_BLOCKBOUND(srcSize));
-    BIT_CStream_t bitC;
+	const BYTE* ip = (const BYTE*) src;
+	BYTE* const ostart = (BYTE*)dst;
+	BYTE* const oend = ostart + dstSize;
+	BYTE* op = ostart;
+	size_t n;
+	const unsigned fast = (dstSize >= HUF_BLOCKBOUND(srcSize));
+	BIT_CStream_t bitC;
 
-    /* init */
-    if (dstSize < 8) return 0;   /* not enough space to compress */
-    { size_t const initErr = BIT_initCStream(&bitC, op, oend-op);
-      if (HUF_isError(initErr)) return 0; }
+	/* init */
+	if (dstSize < 8) return 0;   /* not enough space to compress */
+	{ size_t const initErr = BIT_initCStream(&bitC, op, oend-op);
+	  if (HUF_isError(initErr)) return 0; }
 
-    n = srcSize & ~3;  /* join to mod 4 */
-    switch (srcSize & 3)
-    {
-        case 3 : HUF_encodeSymbol(&bitC, ip[n+ 2], CTable);
-                 HUF_FLUSHBITS_2(&bitC);
-        case 2 : HUF_encodeSymbol(&bitC, ip[n+ 1], CTable);
-                 HUF_FLUSHBITS_1(&bitC);
-        case 1 : HUF_encodeSymbol(&bitC, ip[n+ 0], CTable);
-                 HUF_FLUSHBITS(&bitC);
-        case 0 :
-        default: ;
-    }
+	n = srcSize & ~3;  /* join to mod 4 */
+	switch (srcSize & 3)
+	{
+		case 3 : HUF_encodeSymbol(&bitC, ip[n+ 2], CTable);
+				 HUF_FLUSHBITS_2(&bitC);
+		case 2 : HUF_encodeSymbol(&bitC, ip[n+ 1], CTable);
+				 HUF_FLUSHBITS_1(&bitC);
+		case 1 : HUF_encodeSymbol(&bitC, ip[n+ 0], CTable);
+				 HUF_FLUSHBITS(&bitC);
+		case 0 :
+		default: ;
+	}
 
-    for (; n>0; n-=4) {  /* note : n&3==0 at this stage */
-        HUF_encodeSymbol(&bitC, ip[n- 1], CTable);
-        HUF_FLUSHBITS_1(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 2], CTable);
-        HUF_FLUSHBITS_2(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 3], CTable);
-        HUF_FLUSHBITS_1(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 4], CTable);
-        HUF_FLUSHBITS(&bitC);
-    }
+	for (; n>0; n-=4) {  /* note : n&3==0 at this stage */
+		HUF_encodeSymbol(&bitC, ip[n- 1], CTable);
+		HUF_FLUSHBITS_1(&bitC);
+		HUF_encodeSymbol(&bitC, ip[n- 2], CTable);
+		HUF_FLUSHBITS_2(&bitC);
+		HUF_encodeSymbol(&bitC, ip[n- 3], CTable);
+		HUF_FLUSHBITS_1(&bitC);
+		HUF_encodeSymbol(&bitC, ip[n- 4], CTable);
+		HUF_FLUSHBITS(&bitC);
+	}
 
-    return BIT_closeCStream(&bitC);
+	return BIT_closeCStream(&bitC);
 }
 
 
 size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
 {
-    size_t const segmentSize = (srcSize+3)/4;   /* first 3 segments */
-    const BYTE* ip = (const BYTE*) src;
-    const BYTE* const iend = ip + srcSize;
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
+	size_t const segmentSize = (srcSize+3)/4;   /* first 3 segments */
+	const BYTE* ip = (const BYTE*) src;
+	const BYTE* const iend = ip + srcSize;
+	BYTE* const ostart = (BYTE*) dst;
+	BYTE* const oend = ostart + dstSize;
+	BYTE* op = ostart;
 
-    if (dstSize < 6 + 1 + 1 + 1 + 8) return 0;   /* minimum space to compress successfully */
-    if (srcSize < 12) return 0;   /* no saving possible : too small input */
-    op += 6;   /* jumpTable */
+	if (dstSize < 6 + 1 + 1 + 1 + 8) return 0;   /* minimum space to compress successfully */
+	if (srcSize < 12) return 0;   /* no saving possible : too small input */
+	op += 6;   /* jumpTable */
 
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart, (U16)cSize);
-        op += cSize;
-    }
+	{   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+		if (cSize==0) return 0;
+		MEM_writeLE16(ostart, (U16)cSize);
+		op += cSize;
+	}
 
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart+2, (U16)cSize);
-        op += cSize;
-    }
+	ip += segmentSize;
+	{   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+		if (cSize==0) return 0;
+		MEM_writeLE16(ostart+2, (U16)cSize);
+		op += cSize;
+	}
 
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart+4, (U16)cSize);
-        op += cSize;
-    }
+	ip += segmentSize;
+	{   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
+		if (cSize==0) return 0;
+		MEM_writeLE16(ostart+4, (U16)cSize);
+		op += cSize;
+	}
 
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, iend-ip, CTable) );
-        if (cSize==0) return 0;
-        op += cSize;
-    }
+	ip += segmentSize;
+	{   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, iend-ip, CTable) );
+		if (cSize==0) return 0;
+		op += cSize;
+	}
 
-    return op-ostart;
+	return op-ostart;
 }
 
 
 static size_t HUF_compressCTable_internal(
-                BYTE* const ostart, BYTE* op, BYTE* const oend,
-                const void* src, size_t srcSize,
-                unsigned singleStream, const HUF_CElt* CTable)
+				BYTE* const ostart, BYTE* op, BYTE* const oend,
+				const void* src, size_t srcSize,
+				unsigned singleStream, const HUF_CElt* CTable)
 {
-    size_t const cSize = singleStream ?
-                         HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) :
-                         HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
-    if (HUF_isError(cSize)) { return cSize; }
-    if (cSize==0) { return 0; }   /* uncompressible */
-    op += cSize;
-    /* check compressibility */
-    if ((size_t)(op-ostart) >= srcSize-1) { return 0; }
-    return op-ostart;
+	size_t const cSize = singleStream ?
+						 HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) :
+						 HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
+	if (HUF_isError(cSize)) { return cSize; }
+	if (cSize==0) { return 0; }   /* uncompressible */
+	op += cSize;
+	/* check compressibility */
+	if ((size_t)(op-ostart) >= srcSize-1) { return 0; }
+	return op-ostart;
 }
 
 
 /* `workSpace` must a table of at least 1024 unsigned */
 static size_t HUF_compress_internal (
-                void* dst, size_t dstSize,
-                const void* src, size_t srcSize,
-                unsigned maxSymbolValue, unsigned huffLog,
-                unsigned singleStream,
-                void* workSpace, size_t wkspSize,
-                HUF_CElt* oldHufTable, HUF_repeat* repeat, int preferRepeat)
+				void* dst, size_t dstSize,
+				const void* src, size_t srcSize,
+				unsigned maxSymbolValue, unsigned huffLog,
+				unsigned singleStream,
+				void* workSpace, size_t wkspSize,
+				HUF_CElt* oldHufTable, HUF_repeat* repeat, int preferRepeat)
 {
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
+	BYTE* const ostart = (BYTE*)dst;
+	BYTE* const oend = ostart + dstSize;
+	BYTE* op = ostart;
 
-    U32* count;
-    size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
-    HUF_CElt* CTable;
-    size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
+	U32* count;
+	size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
+	HUF_CElt* CTable;
+	size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
 
-    /* checks & inits */
-    if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize) return ERROR(GENERIC);
-    if (!srcSize) return 0;  /* Uncompressed (note : 1 means rle, so first byte must be correct) */
-    if (!dstSize) return 0;  /* cannot fit within dst budget */
-    if (srcSize > HUF_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);   /* current block size limit */
-    if (huffLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    if (!maxSymbolValue) maxSymbolValue = HUF_SYMBOLVALUE_MAX;
-    if (!huffLog) huffLog = HUF_TABLELOG_DEFAULT;
+	/* checks & inits */
+	if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize) return ERROR(GENERIC);
+	if (!srcSize) return 0;  /* Uncompressed (note : 1 means rle, so first byte must be correct) */
+	if (!dstSize) return 0;  /* cannot fit within dst budget */
+	if (srcSize > HUF_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);   /* current block size limit */
+	if (huffLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+	if (!maxSymbolValue) maxSymbolValue = HUF_SYMBOLVALUE_MAX;
+	if (!huffLog) huffLog = HUF_TABLELOG_DEFAULT;
 
-    count = (U32*)workSpace;
-    workSpace = (BYTE*)workSpace + countSize;
-    wkspSize -= countSize;
-    CTable = (HUF_CElt*)workSpace;
-    workSpace = (BYTE*)workSpace + CTableSize;
-    wkspSize -= CTableSize;
+	count = (U32*)workSpace;
+	workSpace = (BYTE*)workSpace + countSize;
+	wkspSize -= countSize;
+	CTable = (HUF_CElt*)workSpace;
+	workSpace = (BYTE*)workSpace + CTableSize;
+	wkspSize -= CTableSize;
 
-    /* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
-    if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
-        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-    }
+	/* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
+	if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
+		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+	}
 
-    /* Scan input and build symbol stats */
-    {   CHECK_V_F(largest, FSE_count_wksp (count, &maxSymbolValue, (const BYTE*)src, srcSize, (U32*)workSpace) );
-        if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; }   /* single symbol, rle */
-        if (largest <= (srcSize >> 7)+1) return 0;   /* Fast heuristic : not compressible enough */
-    }
+	/* Scan input and build symbol stats */
+	{   CHECK_V_F(largest, FSE_count_wksp (count, &maxSymbolValue, (const BYTE*)src, srcSize, (U32*)workSpace) );
+		if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; }   /* single symbol, rle */
+		if (largest <= (srcSize >> 7)+1) return 0;   /* Fast heuristic : not compressible enough */
+	}
 
-    /* Check validity of previous table */
-    if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
-        *repeat = HUF_repeat_none;
-    }
-    /* Heuristic : use existing table for small inputs */
-    if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
-        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-    }
+	/* Check validity of previous table */
+	if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
+		*repeat = HUF_repeat_none;
+	}
+	/* Heuristic : use existing table for small inputs */
+	if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
+		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+	}
 
-    /* Build Huffman Tree */
-    huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
-    {   CHECK_V_F(maxBits, HUF_buildCTable_wksp (CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize) );
-        huffLog = (U32)maxBits;
-        /* Zero the unused symbols so we can check it for validity */
-        memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
-    }
+	/* Build Huffman Tree */
+	huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
+	{   CHECK_V_F(maxBits, HUF_buildCTable_wksp (CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize) );
+		huffLog = (U32)maxBits;
+		/* Zero the unused symbols so we can check it for validity */
+		memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
+	}
 
-    /* Write table description header */
-    {   CHECK_V_F(hSize, HUF_writeCTable (op, dstSize, CTable, maxSymbolValue, huffLog) );
-        /* Check if using the previous table will be beneficial */
-        if (repeat && *repeat != HUF_repeat_none) {
-            size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
-            size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
-            if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
-                return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-            }
-        }
-        /* Use the new table */
-        if (hSize + 12ul >= srcSize) { return 0; }
-        op += hSize;
-        if (repeat) { *repeat = HUF_repeat_none; }
-        if (oldHufTable) { memcpy(oldHufTable, CTable, CTableSize); } /* Save the new table */
-    }
-    return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
+	/* Write table description header */
+	{   CHECK_V_F(hSize, HUF_writeCTable (op, dstSize, CTable, maxSymbolValue, huffLog) );
+		/* Check if using the previous table will be beneficial */
+		if (repeat && *repeat != HUF_repeat_none) {
+			size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
+			size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
+			if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
+				return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
+			}
+		}
+		/* Use the new table */
+		if (hSize + 12ul >= srcSize) { return 0; }
+		op += hSize;
+		if (repeat) { *repeat = HUF_repeat_none; }
+		if (oldHufTable) { memcpy(oldHufTable, CTable, CTableSize); } /* Save the new table */
+	}
+	return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
 }
 
 
 size_t HUF_compress1X_wksp (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize)
+					  const void* src, size_t srcSize,
+					  unsigned maxSymbolValue, unsigned huffLog,
+					  void* workSpace, size_t wkspSize)
 {
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
 }
 
 size_t HUF_compress1X_repeat (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize,
-                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
+					  const void* src, size_t srcSize,
+					  unsigned maxSymbolValue, unsigned huffLog,
+					  void* workSpace, size_t wkspSize,
+					  HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
 {
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
 }
 
 size_t HUF_compress1X (void* dst, size_t dstSize,
-                 const void* src, size_t srcSize,
-                 unsigned maxSymbolValue, unsigned huffLog)
+				 const void* src, size_t srcSize,
+				 unsigned maxSymbolValue, unsigned huffLog)
 {
-    unsigned workSpace[1024];
-    return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+	unsigned workSpace[1024];
+	return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
 }
 
 size_t HUF_compress4X_wksp (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize)
+					  const void* src, size_t srcSize,
+					  unsigned maxSymbolValue, unsigned huffLog,
+					  void* workSpace, size_t wkspSize)
 {
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
 }
 
 size_t HUF_compress4X_repeat (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize,
-                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
+					  const void* src, size_t srcSize,
+					  unsigned maxSymbolValue, unsigned huffLog,
+					  void* workSpace, size_t wkspSize,
+					  HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
 {
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
 }
 
 size_t HUF_compress2 (void* dst, size_t dstSize,
-                const void* src, size_t srcSize,
-                unsigned maxSymbolValue, unsigned huffLog)
+				const void* src, size_t srcSize,
+				unsigned maxSymbolValue, unsigned huffLog)
 {
-    unsigned workSpace[1024];
-    return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+	unsigned workSpace[1024];
+	return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
 }
 
 size_t HUF_compress (void* dst, size_t maxDstSize, const void* src, size_t srcSize)
 {
-    return HUF_compress2(dst, maxDstSize, src, (U32)srcSize, 255, HUF_TABLELOG_DEFAULT);
+	return HUF_compress2(dst, maxDstSize, src, (U32)srcSize, 255, HUF_TABLELOG_DEFAULT);
 }
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/huf_decompress.c
index ea35c3620..a1e9ffc32 100644
--- a/contrib/linux-kernel/lib/huf_decompress.c
+++ b/contrib/linux-kernel/lib/huf_decompress.c
@@ -8,9 +8,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -27,9 +27,9 @@
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
+	You can contact the author at :
+	- FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 ****************************************************************** */
 
 /* **************************************************************
@@ -75,9 +75,9 @@ typedef struct { BYTE maxTableLog; BYTE tableType; BYTE tableLog; BYTE reserved;
 
 static DTableDesc HUF_getDTableDesc(const HUF_DTable* table)
 {
-    DTableDesc dtd;
-    memcpy(&dtd, table, sizeof(dtd));
-    return dtd;
+	DTableDesc dtd;
+	memcpy(&dtd, table, sizeof(dtd));
+	return dtd;
 }
 
 
@@ -89,268 +89,268 @@ typedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX2;   /* single-symbol decodi
 
 size_t HUF_readDTableX2 (HUF_DTable* DTable, const void* src, size_t srcSize)
 {
-    BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];
-    U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
-    U32 tableLog = 0;
-    U32 nbSymbols = 0;
-    size_t iSize;
-    void* const dtPtr = DTable + 1;
-    HUF_DEltX2* const dt = (HUF_DEltX2*)dtPtr;
+	BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];
+	U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
+	U32 tableLog = 0;
+	U32 nbSymbols = 0;
+	size_t iSize;
+	void* const dtPtr = DTable + 1;
+	HUF_DEltX2* const dt = (HUF_DEltX2*)dtPtr;
 
-    HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
-    /* memset(huffWeight, 0, sizeof(huffWeight)); */   /* is not necessary, even though some analyzer complain ... */
+	HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
+	/* memset(huffWeight, 0, sizeof(huffWeight)); */   /* is not necessary, even though some analyzer complain ... */
 
-    iSize = HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
+	iSize = HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
+	if (HUF_isError(iSize)) return iSize;
 
-    /* Table header */
-    {   DTableDesc dtd = HUF_getDTableDesc(DTable);
-        if (tableLog > (U32)(dtd.maxTableLog+1)) return ERROR(tableLog_tooLarge);   /* DTable too small, Huffman tree cannot fit in */
-        dtd.tableType = 0;
-        dtd.tableLog = (BYTE)tableLog;
-        memcpy(DTable, &dtd, sizeof(dtd));
-    }
+	/* Table header */
+	{   DTableDesc dtd = HUF_getDTableDesc(DTable);
+		if (tableLog > (U32)(dtd.maxTableLog+1)) return ERROR(tableLog_tooLarge);   /* DTable too small, Huffman tree cannot fit in */
+		dtd.tableType = 0;
+		dtd.tableLog = (BYTE)tableLog;
+		memcpy(DTable, &dtd, sizeof(dtd));
+	}
 
-    /* Calculate starting value for each rank */
-    {   U32 n, nextRankStart = 0;
-        for (n=1; n<tableLog+1; n++) {
-            U32 const current = nextRankStart;
-            nextRankStart += (rankVal[n] << (n-1));
-            rankVal[n] = current;
-    }   }
+	/* Calculate starting value for each rank */
+	{   U32 n, nextRankStart = 0;
+		for (n=1; n<tableLog+1; n++) {
+			U32 const current = nextRankStart;
+			nextRankStart += (rankVal[n] << (n-1));
+			rankVal[n] = current;
+	}   }
 
-    /* fill DTable */
-    {   U32 n;
-        for (n=0; n<nbSymbols; n++) {
-            U32 const w = huffWeight[n];
-            U32 const length = (1 << w) >> 1;
-            U32 u;
-            HUF_DEltX2 D;
-            D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);
-            for (u = rankVal[w]; u < rankVal[w] + length; u++)
-                dt[u] = D;
-            rankVal[w] += length;
-    }   }
+	/* fill DTable */
+	{   U32 n;
+		for (n=0; n<nbSymbols; n++) {
+			U32 const w = huffWeight[n];
+			U32 const length = (1 << w) >> 1;
+			U32 u;
+			HUF_DEltX2 D;
+			D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);
+			for (u = rankVal[w]; u < rankVal[w] + length; u++)
+				dt[u] = D;
+			rankVal[w] += length;
+	}   }
 
-    return iSize;
+	return iSize;
 }
 
 
 static BYTE HUF_decodeSymbolX2(BIT_DStream_t* Dstream, const HUF_DEltX2* dt, const U32 dtLog)
 {
-    size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-    BYTE const c = dt[val].byte;
-    BIT_skipBits(Dstream, dt[val].nbBits);
-    return c;
+	size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
+	BYTE const c = dt[val].byte;
+	BIT_skipBits(Dstream, dt[val].nbBits);
+	return c;
 }
 
 #define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \
-    *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
+	*ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
 
 #define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
+	if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+		HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
 
 #define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
+	if (MEM_64bits()) \
+		HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
 
 FORCE_INLINE size_t HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX2* const dt, const U32 dtLog)
 {
-    BYTE* const pStart = p;
+	BYTE* const pStart = p;
 
-    /* up to 4 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4)) {
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-    }
+	/* up to 4 symbols at a time */
+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4)) {
+		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+		HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
+		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+	}
 
-    /* closer to the end */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+	/* closer to the end */
+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
 
-    /* no more data to retrieve from bitstream, hence no need to reload */
-    while (p < pEnd)
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+	/* no more data to retrieve from bitstream, hence no need to reload */
+	while (p < pEnd)
+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
 
-    return pEnd-pStart;
+	return pEnd-pStart;
 }
 
 static size_t HUF_decompress1X2_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    BYTE* op = (BYTE*)dst;
-    BYTE* const oend = op + dstSize;
-    const void* dtPtr = DTable + 1;
-    const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
-    BIT_DStream_t bitD;
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    U32 const dtLog = dtd.tableLog;
+	BYTE* op = (BYTE*)dst;
+	BYTE* const oend = op + dstSize;
+	const void* dtPtr = DTable + 1;
+	const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+	BIT_DStream_t bitD;
+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
+	U32 const dtLog = dtd.tableLog;
 
-    { size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-      if (HUF_isError(errorCode)) return errorCode; }
+	{ size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
+	  if (HUF_isError(errorCode)) return errorCode; }
 
-    HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
+	HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
 
-    /* check */
-    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+	/* check */
+	if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
 
-    return dstSize;
+	return dstSize;
 }
 
 size_t HUF_decompress1X2_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 0) return ERROR(GENERIC);
-    return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+	DTableDesc dtd = HUF_getDTableDesc(DTable);
+	if (dtd.tableType != 0) return ERROR(GENERIC);
+	return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
 }
 
 size_t HUF_decompress1X2_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    const BYTE* ip = (const BYTE*) cSrc;
+	const BYTE* ip = (const BYTE*) cSrc;
 
-    size_t const hSize = HUF_readDTableX2 (DCtx, cSrc, cSrcSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
+	size_t const hSize = HUF_readDTableX2 (DCtx, cSrc, cSrcSize);
+	if (HUF_isError(hSize)) return hSize;
+	if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+	ip += hSize; cSrcSize -= hSize;
 
-    return HUF_decompress1X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
+	return HUF_decompress1X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
 }
 
 size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress1X2_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
+	HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+	return HUF_decompress1X2_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
 }
 
 
 static size_t HUF_decompress4X2_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    /* Check */
-    if (cSrcSize < 10) return ERROR(corruption_detected);  /* strict minimum : jump table + 1 byte per stream */
+	/* Check */
+	if (cSrcSize < 10) return ERROR(corruption_detected);  /* strict minimum : jump table + 1 byte per stream */
 
-    {   const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable + 1;
-        const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+	{   const BYTE* const istart = (const BYTE*) cSrc;
+		BYTE* const ostart = (BYTE*) dst;
+		BYTE* const oend = ostart + dstSize;
+		const void* const dtPtr = DTable + 1;
+		const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
 
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        size_t const length1 = MEM_readLE16(istart);
-        size_t const length2 = MEM_readLE16(istart+2);
-        size_t const length3 = MEM_readLE16(istart+4);
-        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        const size_t segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        U32 const dtLog = dtd.tableLog;
+		/* Init */
+		BIT_DStream_t bitD1;
+		BIT_DStream_t bitD2;
+		BIT_DStream_t bitD3;
+		BIT_DStream_t bitD4;
+		size_t const length1 = MEM_readLE16(istart);
+		size_t const length2 = MEM_readLE16(istart+2);
+		size_t const length3 = MEM_readLE16(istart+4);
+		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+		const BYTE* const istart1 = istart + 6;  /* jumpTable */
+		const BYTE* const istart2 = istart1 + length1;
+		const BYTE* const istart3 = istart2 + length2;
+		const BYTE* const istart4 = istart3 + length3;
+		const size_t segmentSize = (dstSize+3) / 4;
+		BYTE* const opStart2 = ostart + segmentSize;
+		BYTE* const opStart3 = opStart2 + segmentSize;
+		BYTE* const opStart4 = opStart3 + segmentSize;
+		BYTE* op1 = ostart;
+		BYTE* op2 = opStart2;
+		BYTE* op3 = opStart3;
+		BYTE* op4 = opStart4;
+		U32 endSignal;
+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
+		U32 const dtLog = dtd.tableLog;
 
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-          if (HUF_isError(errorCode)) return errorCode; }
+		if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+		{ size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
+		  if (HUF_isError(errorCode)) return errorCode; }
 
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; ) {
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
+		/* 16-32 symbols per loop (4-8 symbols per stream) */
+		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+		for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; ) {
+			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+			HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
+			HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
+			HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
+			HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
+			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+			HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
+			HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
+			HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
+			HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
+			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+		}
 
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 supposed already verified within main loop */
+		/* check corruption */
+		if (op1 > opStart2) return ERROR(corruption_detected);
+		if (op2 > opStart3) return ERROR(corruption_detected);
+		if (op3 > opStart4) return ERROR(corruption_detected);
+		/* note : op4 supposed already verified within main loop */
 
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
+		/* finish bitStreams one by one */
+		HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
+		HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
+		HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
+		HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
 
-        /* check */
-        endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-        if (!endSignal) return ERROR(corruption_detected);
+		/* check */
+		endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+		if (!endSignal) return ERROR(corruption_detected);
 
-        /* decoded size */
-        return dstSize;
-    }
+		/* decoded size */
+		return dstSize;
+	}
 }
 
 
 size_t HUF_decompress4X2_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 0) return ERROR(GENERIC);
-    return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+	DTableDesc dtd = HUF_getDTableDesc(DTable);
+	if (dtd.tableType != 0) return ERROR(GENERIC);
+	return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
 }
 
 
 size_t HUF_decompress4X2_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    const BYTE* ip = (const BYTE*) cSrc;
+	const BYTE* ip = (const BYTE*) cSrc;
 
-    size_t const hSize = HUF_readDTableX2 (dctx, cSrc, cSrcSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
+	size_t const hSize = HUF_readDTableX2 (dctx, cSrc, cSrcSize);
+	if (HUF_isError(hSize)) return hSize;
+	if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+	ip += hSize; cSrcSize -= hSize;
 
-    return HUF_decompress4X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, dctx);
+	return HUF_decompress4X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, dctx);
 }
 
 size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+	HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+	return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
 }
 
 
@@ -364,406 +364,406 @@ typedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;
 /* HUF_fillDTableX4Level2() :
  * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
 static void HUF_fillDTableX4Level2(HUF_DEltX4* DTable, U32 sizeLog, const U32 consumed,
-                           const U32* rankValOrigin, const int minWeight,
-                           const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
-                           U32 nbBitsBaseline, U16 baseSeq)
+						   const U32* rankValOrigin, const int minWeight,
+						   const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
+						   U32 nbBitsBaseline, U16 baseSeq)
 {
-    HUF_DEltX4 DElt;
-    U32 rankVal[HUF_TABLELOG_MAX + 1];
+	HUF_DEltX4 DElt;
+	U32 rankVal[HUF_TABLELOG_MAX + 1];
 
-    /* get pre-calculated rankVal */
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+	/* get pre-calculated rankVal */
+	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
 
-    /* fill skipped values */
-    if (minWeight>1) {
-        U32 i, skipSize = rankVal[minWeight];
-        MEM_writeLE16(&(DElt.sequence), baseSeq);
-        DElt.nbBits   = (BYTE)(consumed);
-        DElt.length   = 1;
-        for (i = 0; i < skipSize; i++)
-            DTable[i] = DElt;
-    }
+	/* fill skipped values */
+	if (minWeight>1) {
+		U32 i, skipSize = rankVal[minWeight];
+		MEM_writeLE16(&(DElt.sequence), baseSeq);
+		DElt.nbBits   = (BYTE)(consumed);
+		DElt.length   = 1;
+		for (i = 0; i < skipSize; i++)
+			DTable[i] = DElt;
+	}
 
-    /* fill DTable */
-    {   U32 s; for (s=0; s<sortedListSize; s++) {   /* note : sortedSymbols already skipped */
-            const U32 symbol = sortedSymbols[s].symbol;
-            const U32 weight = sortedSymbols[s].weight;
-            const U32 nbBits = nbBitsBaseline - weight;
-            const U32 length = 1 << (sizeLog-nbBits);
-            const U32 start = rankVal[weight];
-            U32 i = start;
-            const U32 end = start + length;
+	/* fill DTable */
+	{   U32 s; for (s=0; s<sortedListSize; s++) {   /* note : sortedSymbols already skipped */
+			const U32 symbol = sortedSymbols[s].symbol;
+			const U32 weight = sortedSymbols[s].weight;
+			const U32 nbBits = nbBitsBaseline - weight;
+			const U32 length = 1 << (sizeLog-nbBits);
+			const U32 start = rankVal[weight];
+			U32 i = start;
+			const U32 end = start + length;
 
-            MEM_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
-            DElt.nbBits = (BYTE)(nbBits + consumed);
-            DElt.length = 2;
-            do { DTable[i++] = DElt; } while (i<end);   /* since length >= 1 */
+			MEM_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
+			DElt.nbBits = (BYTE)(nbBits + consumed);
+			DElt.length = 2;
+			do { DTable[i++] = DElt; } while (i<end);   /* since length >= 1 */
 
-            rankVal[weight] += length;
-    }   }
+			rankVal[weight] += length;
+	}   }
 }
 
 typedef U32 rankVal_t[HUF_TABLELOG_MAX][HUF_TABLELOG_MAX + 1];
 
 static void HUF_fillDTableX4(HUF_DEltX4* DTable, const U32 targetLog,
-                           const sortedSymbol_t* sortedList, const U32 sortedListSize,
-                           const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
-                           const U32 nbBitsBaseline)
+						   const sortedSymbol_t* sortedList, const U32 sortedListSize,
+						   const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
+						   const U32 nbBitsBaseline)
 {
-    U32 rankVal[HUF_TABLELOG_MAX + 1];
-    const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
-    const U32 minBits  = nbBitsBaseline - maxWeight;
-    U32 s;
+	U32 rankVal[HUF_TABLELOG_MAX + 1];
+	const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
+	const U32 minBits  = nbBitsBaseline - maxWeight;
+	U32 s;
 
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
 
-    /* fill DTable */
-    for (s=0; s<sortedListSize; s++) {
-        const U16 symbol = sortedList[s].symbol;
-        const U32 weight = sortedList[s].weight;
-        const U32 nbBits = nbBitsBaseline - weight;
-        const U32 start = rankVal[weight];
-        const U32 length = 1 << (targetLog-nbBits);
+	/* fill DTable */
+	for (s=0; s<sortedListSize; s++) {
+		const U16 symbol = sortedList[s].symbol;
+		const U32 weight = sortedList[s].weight;
+		const U32 nbBits = nbBitsBaseline - weight;
+		const U32 start = rankVal[weight];
+		const U32 length = 1 << (targetLog-nbBits);
 
-        if (targetLog-nbBits >= minBits) {   /* enough room for a second symbol */
-            U32 sortedRank;
-            int minWeight = nbBits + scaleLog;
-            if (minWeight < 1) minWeight = 1;
-            sortedRank = rankStart[minWeight];
-            HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,
-                           rankValOrigin[nbBits], minWeight,
-                           sortedList+sortedRank, sortedListSize-sortedRank,
-                           nbBitsBaseline, symbol);
-        } else {
-            HUF_DEltX4 DElt;
-            MEM_writeLE16(&(DElt.sequence), symbol);
-            DElt.nbBits = (BYTE)(nbBits);
-            DElt.length = 1;
-            {   U32 const end = start + length;
-                U32 u;
-                for (u = start; u < end; u++) DTable[u] = DElt;
-        }   }
-        rankVal[weight] += length;
-    }
+		if (targetLog-nbBits >= minBits) {   /* enough room for a second symbol */
+			U32 sortedRank;
+			int minWeight = nbBits + scaleLog;
+			if (minWeight < 1) minWeight = 1;
+			sortedRank = rankStart[minWeight];
+			HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,
+						   rankValOrigin[nbBits], minWeight,
+						   sortedList+sortedRank, sortedListSize-sortedRank,
+						   nbBitsBaseline, symbol);
+		} else {
+			HUF_DEltX4 DElt;
+			MEM_writeLE16(&(DElt.sequence), symbol);
+			DElt.nbBits = (BYTE)(nbBits);
+			DElt.length = 1;
+			{   U32 const end = start + length;
+				U32 u;
+				for (u = start; u < end; u++) DTable[u] = DElt;
+		}   }
+		rankVal[weight] += length;
+	}
 }
 
 size_t HUF_readDTableX4 (HUF_DTable* DTable, const void* src, size_t srcSize)
 {
-    BYTE weightList[HUF_SYMBOLVALUE_MAX + 1];
-    sortedSymbol_t sortedSymbol[HUF_SYMBOLVALUE_MAX + 1];
-    U32 rankStats[HUF_TABLELOG_MAX + 1] = { 0 };
-    U32 rankStart0[HUF_TABLELOG_MAX + 2] = { 0 };
-    U32* const rankStart = rankStart0+1;
-    rankVal_t rankVal;
-    U32 tableLog, maxW, sizeOfSort, nbSymbols;
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    U32 const maxTableLog = dtd.maxTableLog;
-    size_t iSize;
-    void* dtPtr = DTable+1;   /* force compiler to avoid strict-aliasing */
-    HUF_DEltX4* const dt = (HUF_DEltX4*)dtPtr;
+	BYTE weightList[HUF_SYMBOLVALUE_MAX + 1];
+	sortedSymbol_t sortedSymbol[HUF_SYMBOLVALUE_MAX + 1];
+	U32 rankStats[HUF_TABLELOG_MAX + 1] = { 0 };
+	U32 rankStart0[HUF_TABLELOG_MAX + 2] = { 0 };
+	U32* const rankStart = rankStart0+1;
+	rankVal_t rankVal;
+	U32 tableLog, maxW, sizeOfSort, nbSymbols;
+	DTableDesc dtd = HUF_getDTableDesc(DTable);
+	U32 const maxTableLog = dtd.maxTableLog;
+	size_t iSize;
+	void* dtPtr = DTable+1;   /* force compiler to avoid strict-aliasing */
+	HUF_DEltX4* const dt = (HUF_DEltX4*)dtPtr;
 
-    HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable));   /* if compiler fails here, assertion is wrong */
-    if (maxTableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    /* memset(weightList, 0, sizeof(weightList)); */  /* is not necessary, even though some analyzer complain ... */
+	HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable));   /* if compiler fails here, assertion is wrong */
+	if (maxTableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+	/* memset(weightList, 0, sizeof(weightList)); */  /* is not necessary, even though some analyzer complain ... */
 
-    iSize = HUF_readStats(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
+	iSize = HUF_readStats(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
+	if (HUF_isError(iSize)) return iSize;
 
-    /* check result */
-    if (tableLog > maxTableLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
+	/* check result */
+	if (tableLog > maxTableLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
 
-    /* find maxWeight */
-    for (maxW = tableLog; rankStats[maxW]==0; maxW--) {}  /* necessarily finds a solution before 0 */
+	/* find maxWeight */
+	for (maxW = tableLog; rankStats[maxW]==0; maxW--) {}  /* necessarily finds a solution before 0 */
 
-    /* Get start index of each weight */
-    {   U32 w, nextRankStart = 0;
-        for (w=1; w<maxW+1; w++) {
-            U32 current = nextRankStart;
-            nextRankStart += rankStats[w];
-            rankStart[w] = current;
-        }
-        rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
-        sizeOfSort = nextRankStart;
-    }
+	/* Get start index of each weight */
+	{   U32 w, nextRankStart = 0;
+		for (w=1; w<maxW+1; w++) {
+			U32 current = nextRankStart;
+			nextRankStart += rankStats[w];
+			rankStart[w] = current;
+		}
+		rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
+		sizeOfSort = nextRankStart;
+	}
 
-    /* sort symbols by weight */
-    {   U32 s;
-        for (s=0; s<nbSymbols; s++) {
-            U32 const w = weightList[s];
-            U32 const r = rankStart[w]++;
-            sortedSymbol[r].symbol = (BYTE)s;
-            sortedSymbol[r].weight = (BYTE)w;
-        }
-        rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
-    }
+	/* sort symbols by weight */
+	{   U32 s;
+		for (s=0; s<nbSymbols; s++) {
+			U32 const w = weightList[s];
+			U32 const r = rankStart[w]++;
+			sortedSymbol[r].symbol = (BYTE)s;
+			sortedSymbol[r].weight = (BYTE)w;
+		}
+		rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
+	}
 
-    /* Build rankVal */
-    {   U32* const rankVal0 = rankVal[0];
-        {   int const rescale = (maxTableLog-tableLog) - 1;   /* tableLog <= maxTableLog */
-            U32 nextRankVal = 0;
-            U32 w;
-            for (w=1; w<maxW+1; w++) {
-                U32 current = nextRankVal;
-                nextRankVal += rankStats[w] << (w+rescale);
-                rankVal0[w] = current;
-        }   }
-        {   U32 const minBits = tableLog+1 - maxW;
-            U32 consumed;
-            for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
-                U32* const rankValPtr = rankVal[consumed];
-                U32 w;
-                for (w = 1; w < maxW+1; w++) {
-                    rankValPtr[w] = rankVal0[w] >> consumed;
-    }   }   }   }
+	/* Build rankVal */
+	{   U32* const rankVal0 = rankVal[0];
+		{   int const rescale = (maxTableLog-tableLog) - 1;   /* tableLog <= maxTableLog */
+			U32 nextRankVal = 0;
+			U32 w;
+			for (w=1; w<maxW+1; w++) {
+				U32 current = nextRankVal;
+				nextRankVal += rankStats[w] << (w+rescale);
+				rankVal0[w] = current;
+		}   }
+		{   U32 const minBits = tableLog+1 - maxW;
+			U32 consumed;
+			for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
+				U32* const rankValPtr = rankVal[consumed];
+				U32 w;
+				for (w = 1; w < maxW+1; w++) {
+					rankValPtr[w] = rankVal0[w] >> consumed;
+	}   }   }   }
 
-    HUF_fillDTableX4(dt, maxTableLog,
-                   sortedSymbol, sizeOfSort,
-                   rankStart0, rankVal, maxW,
-                   tableLog+1);
+	HUF_fillDTableX4(dt, maxTableLog,
+				   sortedSymbol, sizeOfSort,
+				   rankStart0, rankVal, maxW,
+				   tableLog+1);
 
-    dtd.tableLog = (BYTE)maxTableLog;
-    dtd.tableType = 1;
-    memcpy(DTable, &dtd, sizeof(dtd));
-    return iSize;
+	dtd.tableLog = (BYTE)maxTableLog;
+	dtd.tableType = 1;
+	memcpy(DTable, &dtd, sizeof(dtd));
+	return iSize;
 }
 
 
 static U32 HUF_decodeSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
 {
-    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 2);
-    BIT_skipBits(DStream, dt[val].nbBits);
-    return dt[val].length;
+	size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+	memcpy(op, dt+val, 2);
+	BIT_skipBits(DStream, dt[val].nbBits);
+	return dt[val].length;
 }
 
 static U32 HUF_decodeLastSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
 {
-    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 1);
-    if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
-    else {
-        if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8)) {
-            BIT_skipBits(DStream, dt[val].nbBits);
-            if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
-                DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);   /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
-    }   }
-    return 1;
+	size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+	memcpy(op, dt+val, 1);
+	if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
+	else {
+		if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8)) {
+			BIT_skipBits(DStream, dt[val].nbBits);
+			if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
+				DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);   /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
+	}   }
+	return 1;
 }
 
 
 #define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) \
-    ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+	ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
 
 #define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+	if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+		ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
 
 #define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
+	if (MEM_64bits()) \
+		ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
 
 FORCE_INLINE size_t HUF_decodeStreamX4(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd, const HUF_DEltX4* const dt, const U32 dtLog)
 {
-    BYTE* const pStart = p;
+	BYTE* const pStart = p;
 
-    /* up to 8 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-(sizeof(bitDPtr->bitContainer)-1))) {
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-    }
+	/* up to 8 symbols at a time */
+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-(sizeof(bitDPtr->bitContainer)-1))) {
+		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
+		HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
+		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
+	}
 
-    /* closer to end : up to 2 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd-2))
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
+	/* closer to end : up to 2 symbols at a time */
+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd-2))
+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
 
-    while (p <= pEnd-2)
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
+	while (p <= pEnd-2)
+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
 
-    if (p < pEnd)
-        p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
+	if (p < pEnd)
+		p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
 
-    return p-pStart;
+	return p-pStart;
 }
 
 
 static size_t HUF_decompress1X4_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    BIT_DStream_t bitD;
+	BIT_DStream_t bitD;
 
-    /* Init */
-    {   size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-        if (HUF_isError(errorCode)) return errorCode;
-    }
+	/* Init */
+	{   size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
+		if (HUF_isError(errorCode)) return errorCode;
+	}
 
-    /* decode */
-    {   BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable+1;   /* force compiler to not use strict-aliasing */
-        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
-    }
+	/* decode */
+	{   BYTE* const ostart = (BYTE*) dst;
+		BYTE* const oend = ostart + dstSize;
+		const void* const dtPtr = DTable+1;   /* force compiler to not use strict-aliasing */
+		const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
+		HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
+	}
 
-    /* check */
-    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+	/* check */
+	if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
 
-    /* decoded size */
-    return dstSize;
+	/* decoded size */
+	return dstSize;
 }
 
 size_t HUF_decompress1X4_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 1) return ERROR(GENERIC);
-    return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+	DTableDesc dtd = HUF_getDTableDesc(DTable);
+	if (dtd.tableType != 1) return ERROR(GENERIC);
+	return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
 }
 
 size_t HUF_decompress1X4_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    const BYTE* ip = (const BYTE*) cSrc;
+	const BYTE* ip = (const BYTE*) cSrc;
 
-    size_t const hSize = HUF_readDTableX4 (DCtx, cSrc, cSrcSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
+	size_t const hSize = HUF_readDTableX4 (DCtx, cSrc, cSrcSize);
+	if (HUF_isError(hSize)) return hSize;
+	if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+	ip += hSize; cSrcSize -= hSize;
 
-    return HUF_decompress1X4_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
+	return HUF_decompress1X4_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
 }
 
 size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress1X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+	HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
+	return HUF_decompress1X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
 }
 
 static size_t HUF_decompress4X4_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
+	if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
 
-    {   const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable+1;
-        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
+	{   const BYTE* const istart = (const BYTE*) cSrc;
+		BYTE* const ostart = (BYTE*) dst;
+		BYTE* const oend = ostart + dstSize;
+		const void* const dtPtr = DTable+1;
+		const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
 
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        size_t const length1 = MEM_readLE16(istart);
-        size_t const length2 = MEM_readLE16(istart+2);
-        size_t const length3 = MEM_readLE16(istart+4);
-        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        size_t const segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        U32 const dtLog = dtd.tableLog;
+		/* Init */
+		BIT_DStream_t bitD1;
+		BIT_DStream_t bitD2;
+		BIT_DStream_t bitD3;
+		BIT_DStream_t bitD4;
+		size_t const length1 = MEM_readLE16(istart);
+		size_t const length2 = MEM_readLE16(istart+2);
+		size_t const length3 = MEM_readLE16(istart+4);
+		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+		const BYTE* const istart1 = istart + 6;  /* jumpTable */
+		const BYTE* const istart2 = istart1 + length1;
+		const BYTE* const istart3 = istart2 + length2;
+		const BYTE* const istart4 = istart3 + length3;
+		size_t const segmentSize = (dstSize+3) / 4;
+		BYTE* const opStart2 = ostart + segmentSize;
+		BYTE* const opStart3 = opStart2 + segmentSize;
+		BYTE* const opStart4 = opStart3 + segmentSize;
+		BYTE* op1 = ostart;
+		BYTE* op2 = opStart2;
+		BYTE* op3 = opStart3;
+		BYTE* op4 = opStart4;
+		U32 endSignal;
+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
+		U32 const dtLog = dtd.tableLog;
 
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-          if (HUF_isError(errorCode)) return errorCode; }
+		if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+		{ size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
+		  if (HUF_isError(errorCode)) return errorCode; }
+		{ size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
+		  if (HUF_isError(errorCode)) return errorCode; }
 
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) & (op4<(oend-(sizeof(bitD4.bitContainer)-1))) ; ) {
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
+		/* 16-32 symbols per loop (4-8 symbols per stream) */
+		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+		for ( ; (endSignal==BIT_DStream_unfinished) & (op4<(oend-(sizeof(bitD4.bitContainer)-1))) ; ) {
+			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
+			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
+			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
+			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
+			HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
+			HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
+			HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
+			HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
+			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
+			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
+			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
+			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
+			HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
+			HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
+			HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
+			HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
 
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
+			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
+		}
 
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 already verified within main loop */
+		/* check corruption */
+		if (op1 > opStart2) return ERROR(corruption_detected);
+		if (op2 > opStart3) return ERROR(corruption_detected);
+		if (op3 > opStart4) return ERROR(corruption_detected);
+		/* note : op4 already verified within main loop */
 
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX4(op4, &bitD4, oend,     dt, dtLog);
+		/* finish bitStreams one by one */
+		HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
+		HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
+		HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
+		HUF_decodeStreamX4(op4, &bitD4, oend,     dt, dtLog);
 
-        /* check */
-        { U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-          if (!endCheck) return ERROR(corruption_detected); }
+		/* check */
+		{ U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+		  if (!endCheck) return ERROR(corruption_detected); }
 
-        /* decoded size */
-        return dstSize;
-    }
+		/* decoded size */
+		return dstSize;
+	}
 }
 
 
 size_t HUF_decompress4X4_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
+		  void* dst,  size_t dstSize,
+	const void* cSrc, size_t cSrcSize,
+	const HUF_DTable* DTable)
 {
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 1) return ERROR(GENERIC);
-    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
+	DTableDesc dtd = HUF_getDTableDesc(DTable);
+	if (dtd.tableType != 1) return ERROR(GENERIC);
+	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
 }
 
 
 size_t HUF_decompress4X4_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    const BYTE* ip = (const BYTE*) cSrc;
+	const BYTE* ip = (const BYTE*) cSrc;
 
-    size_t hSize = HUF_readDTableX4 (dctx, cSrc, cSrcSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
+	size_t hSize = HUF_readDTableX4 (dctx, cSrc, cSrcSize);
+	if (HUF_isError(hSize)) return hSize;
+	if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+	ip += hSize; cSrcSize -= hSize;
 
-    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
+	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
 }
 
 size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress4X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+	HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
+	return HUF_decompress4X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
 }
 
 
@@ -772,44 +772,44 @@ size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cS
 /* ********************************/
 
 size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize,
-                                    const void* cSrc, size_t cSrcSize,
-                                    const HUF_DTable* DTable)
+									const void* cSrc, size_t cSrcSize,
+									const HUF_DTable* DTable)
 {
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
-                           HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
+	return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
+						   HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
 }
 
 size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize,
-                                    const void* cSrc, size_t cSrcSize,
-                                    const HUF_DTable* DTable)
+									const void* cSrc, size_t cSrcSize,
+									const HUF_DTable* DTable)
 {
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
-                           HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
+	return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
+						   HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
 }
 
 
 typedef struct { U32 tableTime; U32 decode256Time; } algo_time_t;
 static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] =
 {
-    /* single, double, quad */
-    {{0,0}, {1,1}, {2,2}},  /* Q==0 : impossible */
-    {{0,0}, {1,1}, {2,2}},  /* Q==1 : impossible */
-    {{  38,130}, {1313, 74}, {2151, 38}},   /* Q == 2 : 12-18% */
-    {{ 448,128}, {1353, 74}, {2238, 41}},   /* Q == 3 : 18-25% */
-    {{ 556,128}, {1353, 74}, {2238, 47}},   /* Q == 4 : 25-32% */
-    {{ 714,128}, {1418, 74}, {2436, 53}},   /* Q == 5 : 32-38% */
-    {{ 883,128}, {1437, 74}, {2464, 61}},   /* Q == 6 : 38-44% */
-    {{ 897,128}, {1515, 75}, {2622, 68}},   /* Q == 7 : 44-50% */
-    {{ 926,128}, {1613, 75}, {2730, 75}},   /* Q == 8 : 50-56% */
-    {{ 947,128}, {1729, 77}, {3359, 77}},   /* Q == 9 : 56-62% */
-    {{1107,128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
-    {{1177,128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
-    {{1242,128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
-    {{1349,128}, {2644,106}, {5260,106}},   /* Q ==13 : 81-87% */
-    {{1455,128}, {2422,124}, {4174,124}},   /* Q ==14 : 87-93% */
-    {{ 722,128}, {1891,145}, {1936,146}},   /* Q ==15 : 93-99% */
+	/* single, double, quad */
+	{{0,0}, {1,1}, {2,2}},  /* Q==0 : impossible */
+	{{0,0}, {1,1}, {2,2}},  /* Q==1 : impossible */
+	{{  38,130}, {1313, 74}, {2151, 38}},   /* Q == 2 : 12-18% */
+	{{ 448,128}, {1353, 74}, {2238, 41}},   /* Q == 3 : 18-25% */
+	{{ 556,128}, {1353, 74}, {2238, 47}},   /* Q == 4 : 25-32% */
+	{{ 714,128}, {1418, 74}, {2436, 53}},   /* Q == 5 : 32-38% */
+	{{ 883,128}, {1437, 74}, {2464, 61}},   /* Q == 6 : 38-44% */
+	{{ 897,128}, {1515, 75}, {2622, 68}},   /* Q == 7 : 44-50% */
+	{{ 926,128}, {1613, 75}, {2730, 75}},   /* Q == 8 : 50-56% */
+	{{ 947,128}, {1729, 77}, {3359, 77}},   /* Q == 9 : 56-62% */
+	{{1107,128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
+	{{1177,128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
+	{{1242,128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
+	{{1349,128}, {2644,106}, {5260,106}},   /* Q ==13 : 81-87% */
+	{{1455,128}, {2422,124}, {4174,124}},   /* Q ==14 : 87-93% */
+	{{ 722,128}, {1891,145}, {1936,146}},   /* Q ==15 : 93-99% */
 };
 
 /** HUF_selectDecoder() :
@@ -819,14 +819,14 @@ static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, qu
 *   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
 U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize)
 {
-    /* decoder timing evaluation */
-    U32 const Q = (U32)(cSrcSize * 16 / dstSize);   /* Q < 16 since dstSize > cSrcSize */
-    U32 const D256 = (U32)(dstSize >> 8);
-    U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
-    U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
-    DTime1 += DTime1 >> 3;  /* advantage to algorithm using less memory, for cache eviction */
+	/* decoder timing evaluation */
+	U32 const Q = (U32)(cSrcSize * 16 / dstSize);   /* Q < 16 since dstSize > cSrcSize */
+	U32 const D256 = (U32)(dstSize >> 8);
+	U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
+	U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
+	DTime1 += DTime1 >> 3;  /* advantage to algorithm using less memory, for cache eviction */
 
-    return DTime1 < DTime0;
+	return DTime1 < DTime0;
 }
 
 
@@ -834,55 +834,55 @@ typedef size_t (*decompressionAlgo)(void* dst, size_t dstSize, const void* cSrc,
 
 size_t HUF_decompress (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    static const decompressionAlgo decompress[2] = { HUF_decompress4X2, HUF_decompress4X4 };
+	static const decompressionAlgo decompress[2] = { HUF_decompress4X2, HUF_decompress4X4 };
 
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+	/* validation checks */
+	if (dstSize == 0) return ERROR(dstSize_tooSmall);
+	if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+	if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+	if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
 
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
-    }
+	{   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+		return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
+	}
 }
 
 size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+	/* validation checks */
+	if (dstSize == 0) return ERROR(dstSize_tooSmall);
+	if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+	if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+	if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
 
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
-                        HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
-    }
+	{   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+		return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+						HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+	}
 }
 
 size_t HUF_decompress4X_hufOnly (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if ((cSrcSize >= dstSize) || (cSrcSize <= 1)) return ERROR(corruption_detected);   /* invalid */
+	/* validation checks */
+	if (dstSize == 0) return ERROR(dstSize_tooSmall);
+	if ((cSrcSize >= dstSize) || (cSrcSize <= 1)) return ERROR(corruption_detected);   /* invalid */
 
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
-                        HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
-    }
+	{   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+		return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+						HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+	}
 }
 
 size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+	/* validation checks */
+	if (dstSize == 0) return ERROR(dstSize_tooSmall);
+	if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+	if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+	if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
 
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress1X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
-                        HUF_decompress1X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
-    }
+	{   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+		return algoNb ? HUF_decompress1X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+						HUF_decompress1X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+	}
 }
diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
index f049d181b..75e75088b 100644
--- a/contrib/linux-kernel/lib/mem.h
+++ b/contrib/linux-kernel/lib/mem.h
@@ -100,8 +100,8 @@ MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
 
 MEM_STATIC unsigned MEM_isLittleEndian(void)
 {
-    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
-    return one.c[0];
+	const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
+	return one.c[0];
 }
 
 #if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
@@ -122,11 +122,11 @@ MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
 /* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
 /* currently only defined for gcc and icc */
 #if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
-    __pragma( pack(push, 1) )
-    typedef union { U16 u16; U32 u32; U64 u64; size_t st; } unalign;
-    __pragma( pack(pop) )
+	__pragma( pack(push, 1) )
+	typedef union { U16 u16; U32 u32; U64 u64; size_t st; } unalign;
+	__pragma( pack(pop) )
 #else
-    typedef union { U16 u16; U32 u32; U64 u64; size_t st; } __attribute__((packed)) unalign;
+	typedef union { U16 u16; U32 u32; U64 u64; size_t st; } __attribute__((packed)) unalign;
 #endif
 
 MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }
@@ -145,37 +145,37 @@ MEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign*)memPtr)->u64 =
 
 MEM_STATIC U16 MEM_read16(const void* memPtr)
 {
-    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
 }
 
 MEM_STATIC U32 MEM_read32(const void* memPtr)
 {
-    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
 }
 
 MEM_STATIC U64 MEM_read64(const void* memPtr)
 {
-    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
 }
 
 MEM_STATIC size_t MEM_readST(const void* memPtr)
 {
-    size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
+	size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
 }
 
 MEM_STATIC void MEM_write16(void* memPtr, U16 value)
 {
-    memcpy(memPtr, &value, sizeof(value));
+	memcpy(memPtr, &value, sizeof(value));
 }
 
 MEM_STATIC void MEM_write32(void* memPtr, U32 value)
 {
-    memcpy(memPtr, &value, sizeof(value));
+	memcpy(memPtr, &value, sizeof(value));
 }
 
 MEM_STATIC void MEM_write64(void* memPtr, U64 value)
 {
-    memcpy(memPtr, &value, sizeof(value));
+	memcpy(memPtr, &value, sizeof(value));
 }
 
 #endif /* MEM_FORCE_MEMORY_ACCESS */
@@ -183,188 +183,188 @@ MEM_STATIC void MEM_write64(void* memPtr, U64 value)
 MEM_STATIC U32 MEM_swap32(U32 in)
 {
 #if defined(_MSC_VER)     /* Visual Studio */
-    return _byteswap_ulong(in);
+	return _byteswap_ulong(in);
 #elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-    return __builtin_bswap32(in);
+	return __builtin_bswap32(in);
 #else
-    return  ((in << 24) & 0xff000000 ) |
-            ((in <<  8) & 0x00ff0000 ) |
-            ((in >>  8) & 0x0000ff00 ) |
-            ((in >> 24) & 0x000000ff );
+	return  ((in << 24) & 0xff000000 ) |
+			((in <<  8) & 0x00ff0000 ) |
+			((in >>  8) & 0x0000ff00 ) |
+			((in >> 24) & 0x000000ff );
 #endif
 }
 
 MEM_STATIC U64 MEM_swap64(U64 in)
 {
 #if defined(_MSC_VER)     /* Visual Studio */
-    return _byteswap_uint64(in);
+	return _byteswap_uint64(in);
 #elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-    return __builtin_bswap64(in);
+	return __builtin_bswap64(in);
 #else
-    return  ((in << 56) & 0xff00000000000000ULL) |
-            ((in << 40) & 0x00ff000000000000ULL) |
-            ((in << 24) & 0x0000ff0000000000ULL) |
-            ((in << 8)  & 0x000000ff00000000ULL) |
-            ((in >> 8)  & 0x00000000ff000000ULL) |
-            ((in >> 24) & 0x0000000000ff0000ULL) |
-            ((in >> 40) & 0x000000000000ff00ULL) |
-            ((in >> 56) & 0x00000000000000ffULL);
+	return  ((in << 56) & 0xff00000000000000ULL) |
+			((in << 40) & 0x00ff000000000000ULL) |
+			((in << 24) & 0x0000ff0000000000ULL) |
+			((in << 8)  & 0x000000ff00000000ULL) |
+			((in >> 8)  & 0x00000000ff000000ULL) |
+			((in >> 24) & 0x0000000000ff0000ULL) |
+			((in >> 40) & 0x000000000000ff00ULL) |
+			((in >> 56) & 0x00000000000000ffULL);
 #endif
 }
 
 MEM_STATIC size_t MEM_swapST(size_t in)
 {
-    if (MEM_32bits())
-        return (size_t)MEM_swap32((U32)in);
-    else
-        return (size_t)MEM_swap64((U64)in);
+	if (MEM_32bits())
+		return (size_t)MEM_swap32((U32)in);
+	else
+		return (size_t)MEM_swap64((U64)in);
 }
 
 /*=== Little endian r/w ===*/
 
 MEM_STATIC U16 MEM_readLE16(const void* memPtr)
 {
-    if (MEM_isLittleEndian())
-        return MEM_read16(memPtr);
-    else {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U16)(p[0] + (p[1]<<8));
-    }
+	if (MEM_isLittleEndian())
+		return MEM_read16(memPtr);
+	else {
+		const BYTE* p = (const BYTE*)memPtr;
+		return (U16)(p[0] + (p[1]<<8));
+	}
 }
 
 MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
 {
-    if (MEM_isLittleEndian()) {
-        MEM_write16(memPtr, val);
-    } else {
-        BYTE* p = (BYTE*)memPtr;
-        p[0] = (BYTE)val;
-        p[1] = (BYTE)(val>>8);
-    }
+	if (MEM_isLittleEndian()) {
+		MEM_write16(memPtr, val);
+	} else {
+		BYTE* p = (BYTE*)memPtr;
+		p[0] = (BYTE)val;
+		p[1] = (BYTE)(val>>8);
+	}
 }
 
 MEM_STATIC U32 MEM_readLE24(const void* memPtr)
 {
-    return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
+	return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
 }
 
 MEM_STATIC void MEM_writeLE24(void* memPtr, U32 val)
 {
-    MEM_writeLE16(memPtr, (U16)val);
-    ((BYTE*)memPtr)[2] = (BYTE)(val>>16);
+	MEM_writeLE16(memPtr, (U16)val);
+	((BYTE*)memPtr)[2] = (BYTE)(val>>16);
 }
 
 MEM_STATIC U32 MEM_readLE32(const void* memPtr)
 {
-    if (MEM_isLittleEndian())
-        return MEM_read32(memPtr);
-    else
-        return MEM_swap32(MEM_read32(memPtr));
+	if (MEM_isLittleEndian())
+		return MEM_read32(memPtr);
+	else
+		return MEM_swap32(MEM_read32(memPtr));
 }
 
 MEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)
 {
-    if (MEM_isLittleEndian())
-        MEM_write32(memPtr, val32);
-    else
-        MEM_write32(memPtr, MEM_swap32(val32));
+	if (MEM_isLittleEndian())
+		MEM_write32(memPtr, val32);
+	else
+		MEM_write32(memPtr, MEM_swap32(val32));
 }
 
 MEM_STATIC U64 MEM_readLE64(const void* memPtr)
 {
-    if (MEM_isLittleEndian())
-        return MEM_read64(memPtr);
-    else
-        return MEM_swap64(MEM_read64(memPtr));
+	if (MEM_isLittleEndian())
+		return MEM_read64(memPtr);
+	else
+		return MEM_swap64(MEM_read64(memPtr));
 }
 
 MEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)
 {
-    if (MEM_isLittleEndian())
-        MEM_write64(memPtr, val64);
-    else
-        MEM_write64(memPtr, MEM_swap64(val64));
+	if (MEM_isLittleEndian())
+		MEM_write64(memPtr, val64);
+	else
+		MEM_write64(memPtr, MEM_swap64(val64));
 }
 
 MEM_STATIC size_t MEM_readLEST(const void* memPtr)
 {
-    if (MEM_32bits())
-        return (size_t)MEM_readLE32(memPtr);
-    else
-        return (size_t)MEM_readLE64(memPtr);
+	if (MEM_32bits())
+		return (size_t)MEM_readLE32(memPtr);
+	else
+		return (size_t)MEM_readLE64(memPtr);
 }
 
 MEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)
 {
-    if (MEM_32bits())
-        MEM_writeLE32(memPtr, (U32)val);
-    else
-        MEM_writeLE64(memPtr, (U64)val);
+	if (MEM_32bits())
+		MEM_writeLE32(memPtr, (U32)val);
+	else
+		MEM_writeLE64(memPtr, (U64)val);
 }
 
 /*=== Big endian r/w ===*/
 
 MEM_STATIC U32 MEM_readBE32(const void* memPtr)
 {
-    if (MEM_isLittleEndian())
-        return MEM_swap32(MEM_read32(memPtr));
-    else
-        return MEM_read32(memPtr);
+	if (MEM_isLittleEndian())
+		return MEM_swap32(MEM_read32(memPtr));
+	else
+		return MEM_read32(memPtr);
 }
 
 MEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)
 {
-    if (MEM_isLittleEndian())
-        MEM_write32(memPtr, MEM_swap32(val32));
-    else
-        MEM_write32(memPtr, val32);
+	if (MEM_isLittleEndian())
+		MEM_write32(memPtr, MEM_swap32(val32));
+	else
+		MEM_write32(memPtr, val32);
 }
 
 MEM_STATIC U64 MEM_readBE64(const void* memPtr)
 {
-    if (MEM_isLittleEndian())
-        return MEM_swap64(MEM_read64(memPtr));
-    else
-        return MEM_read64(memPtr);
+	if (MEM_isLittleEndian())
+		return MEM_swap64(MEM_read64(memPtr));
+	else
+		return MEM_read64(memPtr);
 }
 
 MEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)
 {
-    if (MEM_isLittleEndian())
-        MEM_write64(memPtr, MEM_swap64(val64));
-    else
-        MEM_write64(memPtr, val64);
+	if (MEM_isLittleEndian())
+		MEM_write64(memPtr, MEM_swap64(val64));
+	else
+		MEM_write64(memPtr, val64);
 }
 
 MEM_STATIC size_t MEM_readBEST(const void* memPtr)
 {
-    if (MEM_32bits())
-        return (size_t)MEM_readBE32(memPtr);
-    else
-        return (size_t)MEM_readBE64(memPtr);
+	if (MEM_32bits())
+		return (size_t)MEM_readBE32(memPtr);
+	else
+		return (size_t)MEM_readBE64(memPtr);
 }
 
 MEM_STATIC void MEM_writeBEST(void* memPtr, size_t val)
 {
-    if (MEM_32bits())
-        MEM_writeBE32(memPtr, (U32)val);
-    else
-        MEM_writeBE64(memPtr, (U64)val);
+	if (MEM_32bits())
+		MEM_writeBE32(memPtr, (U32)val);
+	else
+		MEM_writeBE64(memPtr, (U64)val);
 }
 
 
 /* function safe only for comparisons */
 MEM_STATIC U32 MEM_readMINMATCH(const void* memPtr, U32 length)
 {
-    switch (length)
-    {
-    default :
-    case 4 : return MEM_read32(memPtr);
-    case 3 : if (MEM_isLittleEndian())
-                return MEM_read32(memPtr)<<8;
-             else
-                return MEM_read32(memPtr)>>8;
-    }
+	switch (length)
+	{
+	default :
+	case 4 : return MEM_read32(memPtr);
+	case 3 : if (MEM_isLittleEndian())
+				return MEM_read32(memPtr)<<8;
+			 else
+				return MEM_read32(memPtr)>>8;
+	}
 }
 
 #if defined (__cplusplus)
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index eb44222c5..19b8bb46b 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -136,17 +136,17 @@ static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcp
 # define MEM_MODULE
 # if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
 #   include <stdint.h>
-    typedef uint8_t  BYTE;
-    typedef uint16_t U16;
-    typedef uint32_t U32;
-    typedef  int32_t S32;
-    typedef uint64_t U64;
+	typedef uint8_t  BYTE;
+	typedef uint16_t U16;
+	typedef uint32_t U32;
+	typedef  int32_t S32;
+	typedef uint64_t U64;
 #  else
-    typedef unsigned char      BYTE;
-    typedef unsigned short     U16;
-    typedef unsigned int       U32;
-    typedef   signed int       S32;
-    typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
+	typedef unsigned char      BYTE;
+	typedef unsigned short     U16;
+	typedef unsigned int       U32;
+	typedef   signed int       S32;
+	typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
 #  endif
 #endif
 
@@ -174,16 +174,16 @@ static U64 XXH_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
 
 static U32 XXH_read32(const void* memPtr)
 {
-    U32 val;
-    memcpy(&val, memPtr, sizeof(val));
-    return val;
+	U32 val;
+	memcpy(&val, memPtr, sizeof(val));
+	return val;
 }
 
 static U64 XXH_read64(const void* memPtr)
 {
-    U64 val;
-    memcpy(&val, memPtr, sizeof(val));
-    return val;
+	U64 val;
+	memcpy(&val, memPtr, sizeof(val));
+	return val;
 }
 
 #endif   /* XXH_FORCE_DIRECT_MEMORY_ACCESS */
@@ -212,21 +212,21 @@ static U64 XXH_read64(const void* memPtr)
 #else
 static U32 XXH_swap32 (U32 x)
 {
-    return  ((x << 24) & 0xff000000 ) |
-            ((x <<  8) & 0x00ff0000 ) |
-            ((x >>  8) & 0x0000ff00 ) |
-            ((x >> 24) & 0x000000ff );
+	return  ((x << 24) & 0xff000000 ) |
+			((x <<  8) & 0x00ff0000 ) |
+			((x >>  8) & 0x0000ff00 ) |
+			((x >> 24) & 0x000000ff );
 }
 static U64 XXH_swap64 (U64 x)
 {
-    return  ((x << 56) & 0xff00000000000000ULL) |
-            ((x << 40) & 0x00ff000000000000ULL) |
-            ((x << 24) & 0x0000ff0000000000ULL) |
-            ((x << 8)  & 0x000000ff00000000ULL) |
-            ((x >> 8)  & 0x00000000ff000000ULL) |
-            ((x >> 24) & 0x0000000000ff0000ULL) |
-            ((x >> 40) & 0x000000000000ff00ULL) |
-            ((x >> 56) & 0x00000000000000ffULL);
+	return  ((x << 56) & 0xff00000000000000ULL) |
+			((x << 40) & 0x00ff000000000000ULL) |
+			((x << 24) & 0x0000ff0000000000ULL) |
+			((x << 8)  & 0x000000ff00000000ULL) |
+			((x >> 8)  & 0x00000000ff000000ULL) |
+			((x >> 24) & 0x0000000000ff0000ULL) |
+			((x >> 40) & 0x000000000000ff00ULL) |
+			((x >> 56) & 0x00000000000000ffULL);
 }
 #endif
 
@@ -238,7 +238,7 @@ typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
 
 /* XXH_CPU_LITTLE_ENDIAN can be defined externally, for example on the compiler command line */
 #ifndef XXH_CPU_LITTLE_ENDIAN
-    static const int g_one = 1;
+	static const int g_one = 1;
 #   define XXH_CPU_LITTLE_ENDIAN   (*(const char*)(&g_one))
 #endif
 
@@ -250,38 +250,38 @@ typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
 
 FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
 {
-    if (align==XXH_unaligned)
-        return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
-    else
-        return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
+	if (align==XXH_unaligned)
+		return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
+	else
+		return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
 }
 
 FORCE_INLINE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
 {
-    return XXH_readLE32_align(ptr, endian, XXH_unaligned);
+	return XXH_readLE32_align(ptr, endian, XXH_unaligned);
 }
 
 static U32 XXH_readBE32(const void* ptr)
 {
-    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
+	return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
 }
 
 FORCE_INLINE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
 {
-    if (align==XXH_unaligned)
-        return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
-    else
-        return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
+	if (align==XXH_unaligned)
+		return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
+	else
+		return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
 }
 
 FORCE_INLINE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
 {
-    return XXH_readLE64_align(ptr, endian, XXH_unaligned);
+	return XXH_readLE64_align(ptr, endian, XXH_unaligned);
 }
 
 static U64 XXH_readBE64(const void* ptr)
 {
-    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
+	return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
 }
 
 
@@ -314,12 +314,12 @@ XXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }
 ****************************/
 XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dstState, const XXH32_state_t* restrict srcState)
 {
-    memcpy(dstState, srcState, sizeof(*dstState));
+	memcpy(dstState, srcState, sizeof(*dstState));
 }
 
 XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dstState, const XXH64_state_t* restrict srcState)
 {
-    memcpy(dstState, srcState, sizeof(*dstState));
+	memcpy(dstState, srcState, sizeof(*dstState));
 }
 
 
@@ -329,204 +329,204 @@ XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dstState, const XXH6
 
 static U32 XXH32_round(U32 seed, U32 input)
 {
-    seed += input * PRIME32_2;
-    seed  = XXH_rotl32(seed, 13);
-    seed *= PRIME32_1;
-    return seed;
+	seed += input * PRIME32_2;
+	seed  = XXH_rotl32(seed, 13);
+	seed *= PRIME32_1;
+	return seed;
 }
 
 FORCE_INLINE U32 XXH32_endian_align(const void* input, size_t len, U32 seed, XXH_endianess endian, XXH_alignment align)
 {
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* bEnd = p + len;
-    U32 h32;
+	const BYTE* p = (const BYTE*)input;
+	const BYTE* bEnd = p + len;
+	U32 h32;
 #define XXH_get32bits(p) XXH_readLE32_align(p, endian, align)
 
 #ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (p==NULL) {
-        len=0;
-        bEnd=p=(const BYTE*)(size_t)16;
-    }
+	if (p==NULL) {
+		len=0;
+		bEnd=p=(const BYTE*)(size_t)16;
+	}
 #endif
 
-    if (len>=16) {
-        const BYTE* const limit = bEnd - 16;
-        U32 v1 = seed + PRIME32_1 + PRIME32_2;
-        U32 v2 = seed + PRIME32_2;
-        U32 v3 = seed + 0;
-        U32 v4 = seed - PRIME32_1;
+	if (len>=16) {
+		const BYTE* const limit = bEnd - 16;
+		U32 v1 = seed + PRIME32_1 + PRIME32_2;
+		U32 v2 = seed + PRIME32_2;
+		U32 v3 = seed + 0;
+		U32 v4 = seed - PRIME32_1;
 
-        do {
-            v1 = XXH32_round(v1, XXH_get32bits(p)); p+=4;
-            v2 = XXH32_round(v2, XXH_get32bits(p)); p+=4;
-            v3 = XXH32_round(v3, XXH_get32bits(p)); p+=4;
-            v4 = XXH32_round(v4, XXH_get32bits(p)); p+=4;
-        } while (p<=limit);
+		do {
+			v1 = XXH32_round(v1, XXH_get32bits(p)); p+=4;
+			v2 = XXH32_round(v2, XXH_get32bits(p)); p+=4;
+			v3 = XXH32_round(v3, XXH_get32bits(p)); p+=4;
+			v4 = XXH32_round(v4, XXH_get32bits(p)); p+=4;
+		} while (p<=limit);
 
-        h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);
-    } else {
-        h32  = seed + PRIME32_5;
-    }
+		h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);
+	} else {
+		h32  = seed + PRIME32_5;
+	}
 
-    h32 += (U32) len;
+	h32 += (U32) len;
 
-    while (p+4<=bEnd) {
-        h32 += XXH_get32bits(p) * PRIME32_3;
-        h32  = XXH_rotl32(h32, 17) * PRIME32_4 ;
-        p+=4;
-    }
+	while (p+4<=bEnd) {
+		h32 += XXH_get32bits(p) * PRIME32_3;
+		h32  = XXH_rotl32(h32, 17) * PRIME32_4 ;
+		p+=4;
+	}
 
-    while (p<bEnd) {
-        h32 += (*p) * PRIME32_5;
-        h32 = XXH_rotl32(h32, 11) * PRIME32_1 ;
-        p++;
-    }
+	while (p<bEnd) {
+		h32 += (*p) * PRIME32_5;
+		h32 = XXH_rotl32(h32, 11) * PRIME32_1 ;
+		p++;
+	}
 
-    h32 ^= h32 >> 15;
-    h32 *= PRIME32_2;
-    h32 ^= h32 >> 13;
-    h32 *= PRIME32_3;
-    h32 ^= h32 >> 16;
+	h32 ^= h32 >> 15;
+	h32 *= PRIME32_2;
+	h32 ^= h32 >> 13;
+	h32 *= PRIME32_3;
+	h32 ^= h32 >> 16;
 
-    return h32;
+	return h32;
 }
 
 
 XXH_PUBLIC_API unsigned int XXH32 (const void* input, size_t len, unsigned int seed)
 {
 #if 0
-    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
-    XXH32_CREATESTATE_STATIC(state);
-    XXH32_reset(state, seed);
-    XXH32_update(state, input, len);
-    return XXH32_digest(state);
+	/* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+	XXH32_CREATESTATE_STATIC(state);
+	XXH32_reset(state, seed);
+	XXH32_update(state, input, len);
+	return XXH32_digest(state);
 #else
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if (XXH_FORCE_ALIGN_CHECK) {
-        if ((((size_t)input) & 3) == 0) {   /* Input is 4-bytes aligned, leverage the speed benefit */
-            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-                return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
-            else
-                return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
-    }   }
+	if (XXH_FORCE_ALIGN_CHECK) {
+		if ((((size_t)input) & 3) == 0) {   /* Input is 4-bytes aligned, leverage the speed benefit */
+			if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+				return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+			else
+				return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+	}   }
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
-    else
-        return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+	else
+		return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
 #endif
 }
 
 
 static U64 XXH64_round(U64 acc, U64 input)
 {
-    acc += input * PRIME64_2;
-    acc  = XXH_rotl64(acc, 31);
-    acc *= PRIME64_1;
-    return acc;
+	acc += input * PRIME64_2;
+	acc  = XXH_rotl64(acc, 31);
+	acc *= PRIME64_1;
+	return acc;
 }
 
 static U64 XXH64_mergeRound(U64 acc, U64 val)
 {
-    val  = XXH64_round(0, val);
-    acc ^= val;
-    acc  = acc * PRIME64_1 + PRIME64_4;
-    return acc;
+	val  = XXH64_round(0, val);
+	acc ^= val;
+	acc  = acc * PRIME64_1 + PRIME64_4;
+	return acc;
 }
 
 FORCE_INLINE U64 XXH64_endian_align(const void* input, size_t len, U64 seed, XXH_endianess endian, XXH_alignment align)
 {
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
-    U64 h64;
+	const BYTE* p = (const BYTE*)input;
+	const BYTE* const bEnd = p + len;
+	U64 h64;
 #define XXH_get64bits(p) XXH_readLE64_align(p, endian, align)
 
 #ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (p==NULL) {
-        len=0;
-        bEnd=p=(const BYTE*)(size_t)32;
-    }
+	if (p==NULL) {
+		len=0;
+		bEnd=p=(const BYTE*)(size_t)32;
+	}
 #endif
 
-    if (len>=32) {
-        const BYTE* const limit = bEnd - 32;
-        U64 v1 = seed + PRIME64_1 + PRIME64_2;
-        U64 v2 = seed + PRIME64_2;
-        U64 v3 = seed + 0;
-        U64 v4 = seed - PRIME64_1;
+	if (len>=32) {
+		const BYTE* const limit = bEnd - 32;
+		U64 v1 = seed + PRIME64_1 + PRIME64_2;
+		U64 v2 = seed + PRIME64_2;
+		U64 v3 = seed + 0;
+		U64 v4 = seed - PRIME64_1;
 
-        do {
-            v1 = XXH64_round(v1, XXH_get64bits(p)); p+=8;
-            v2 = XXH64_round(v2, XXH_get64bits(p)); p+=8;
-            v3 = XXH64_round(v3, XXH_get64bits(p)); p+=8;
-            v4 = XXH64_round(v4, XXH_get64bits(p)); p+=8;
-        } while (p<=limit);
+		do {
+			v1 = XXH64_round(v1, XXH_get64bits(p)); p+=8;
+			v2 = XXH64_round(v2, XXH_get64bits(p)); p+=8;
+			v3 = XXH64_round(v3, XXH_get64bits(p)); p+=8;
+			v4 = XXH64_round(v4, XXH_get64bits(p)); p+=8;
+		} while (p<=limit);
 
-        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
-        h64 = XXH64_mergeRound(h64, v1);
-        h64 = XXH64_mergeRound(h64, v2);
-        h64 = XXH64_mergeRound(h64, v3);
-        h64 = XXH64_mergeRound(h64, v4);
+		h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+		h64 = XXH64_mergeRound(h64, v1);
+		h64 = XXH64_mergeRound(h64, v2);
+		h64 = XXH64_mergeRound(h64, v3);
+		h64 = XXH64_mergeRound(h64, v4);
 
-    } else {
-        h64  = seed + PRIME64_5;
-    }
+	} else {
+		h64  = seed + PRIME64_5;
+	}
 
-    h64 += (U64) len;
+	h64 += (U64) len;
 
-    while (p+8<=bEnd) {
-        U64 const k1 = XXH64_round(0, XXH_get64bits(p));
-        h64 ^= k1;
-        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
-        p+=8;
-    }
+	while (p+8<=bEnd) {
+		U64 const k1 = XXH64_round(0, XXH_get64bits(p));
+		h64 ^= k1;
+		h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+		p+=8;
+	}
 
-    if (p+4<=bEnd) {
-        h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1;
-        h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-        p+=4;
-    }
+	if (p+4<=bEnd) {
+		h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1;
+		h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+		p+=4;
+	}
 
-    while (p<bEnd) {
-        h64 ^= (*p) * PRIME64_5;
-        h64 = XXH_rotl64(h64, 11) * PRIME64_1;
-        p++;
-    }
+	while (p<bEnd) {
+		h64 ^= (*p) * PRIME64_5;
+		h64 = XXH_rotl64(h64, 11) * PRIME64_1;
+		p++;
+	}
 
-    h64 ^= h64 >> 33;
-    h64 *= PRIME64_2;
-    h64 ^= h64 >> 29;
-    h64 *= PRIME64_3;
-    h64 ^= h64 >> 32;
+	h64 ^= h64 >> 33;
+	h64 *= PRIME64_2;
+	h64 ^= h64 >> 29;
+	h64 *= PRIME64_3;
+	h64 ^= h64 >> 32;
 
-    return h64;
+	return h64;
 }
 
 
 XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned long long seed)
 {
 #if 0
-    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
-    XXH64_CREATESTATE_STATIC(state);
-    XXH64_reset(state, seed);
-    XXH64_update(state, input, len);
-    return XXH64_digest(state);
+	/* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+	XXH64_CREATESTATE_STATIC(state);
+	XXH64_reset(state, seed);
+	XXH64_update(state, input, len);
+	return XXH64_digest(state);
 #else
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if (XXH_FORCE_ALIGN_CHECK) {
-        if ((((size_t)input) & 7)==0) {  /* Input is aligned, let's leverage the speed advantage */
-            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-                return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
-            else
-                return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
-    }   }
+	if (XXH_FORCE_ALIGN_CHECK) {
+		if ((((size_t)input) & 7)==0) {  /* Input is aligned, let's leverage the speed advantage */
+			if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+				return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+			else
+				return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+	}   }
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
-    else
-        return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+	else
+		return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
 #endif
 }
 
@@ -537,22 +537,22 @@ XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned
 
 XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)
 {
-    return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
+	return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
 }
 XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)
 {
-    XXH_free(statePtr);
-    return XXH_OK;
+	XXH_free(statePtr);
+	return XXH_OK;
 }
 
 XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)
 {
-    return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
+	return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
 }
 XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
 {
-    XXH_free(statePtr);
-    return XXH_OK;
+	XXH_free(statePtr);
+	return XXH_OK;
 }
 
 
@@ -560,144 +560,144 @@ XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
 
 XXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, unsigned int seed)
 {
-    XXH32_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
-    memset(&state, 0, sizeof(state)-4);   /* do not write into reserved, for future removal */
-    state.v1 = seed + PRIME32_1 + PRIME32_2;
-    state.v2 = seed + PRIME32_2;
-    state.v3 = seed + 0;
-    state.v4 = seed - PRIME32_1;
-    memcpy(statePtr, &state, sizeof(state));
-    return XXH_OK;
+	XXH32_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+	memset(&state, 0, sizeof(state)-4);   /* do not write into reserved, for future removal */
+	state.v1 = seed + PRIME32_1 + PRIME32_2;
+	state.v2 = seed + PRIME32_2;
+	state.v3 = seed + 0;
+	state.v4 = seed - PRIME32_1;
+	memcpy(statePtr, &state, sizeof(state));
+	return XXH_OK;
 }
 
 
 XXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH64_state_t* statePtr, unsigned long long seed)
 {
-    XXH64_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
-    memset(&state, 0, sizeof(state)-8);   /* do not write into reserved, for future removal */
-    state.v1 = seed + PRIME64_1 + PRIME64_2;
-    state.v2 = seed + PRIME64_2;
-    state.v3 = seed + 0;
-    state.v4 = seed - PRIME64_1;
-    memcpy(statePtr, &state, sizeof(state));
-    return XXH_OK;
+	XXH64_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+	memset(&state, 0, sizeof(state)-8);   /* do not write into reserved, for future removal */
+	state.v1 = seed + PRIME64_1 + PRIME64_2;
+	state.v2 = seed + PRIME64_2;
+	state.v3 = seed + 0;
+	state.v4 = seed - PRIME64_1;
+	memcpy(statePtr, &state, sizeof(state));
+	return XXH_OK;
 }
 
 
 FORCE_INLINE XXH_errorcode XXH32_update_endian (XXH32_state_t* state, const void* input, size_t len, XXH_endianess endian)
 {
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
+	const BYTE* p = (const BYTE*)input;
+	const BYTE* const bEnd = p + len;
 
 #ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (input==NULL) return XXH_ERROR;
+	if (input==NULL) return XXH_ERROR;
 #endif
 
-    state->total_len_32 += (unsigned)len;
-    state->large_len |= (len>=16) | (state->total_len_32>=16);
+	state->total_len_32 += (unsigned)len;
+	state->large_len |= (len>=16) | (state->total_len_32>=16);
 
-    if (state->memsize + len < 16)  {   /* fill in tmp buffer */
-        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len);
-        state->memsize += (unsigned)len;
-        return XXH_OK;
-    }
+	if (state->memsize + len < 16)  {   /* fill in tmp buffer */
+		XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len);
+		state->memsize += (unsigned)len;
+		return XXH_OK;
+	}
 
-    if (state->memsize) {   /* some data left from previous update */
-        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize);
-        {   const U32* p32 = state->mem32;
-            state->v1 = XXH32_round(state->v1, XXH_readLE32(p32, endian)); p32++;
-            state->v2 = XXH32_round(state->v2, XXH_readLE32(p32, endian)); p32++;
-            state->v3 = XXH32_round(state->v3, XXH_readLE32(p32, endian)); p32++;
-            state->v4 = XXH32_round(state->v4, XXH_readLE32(p32, endian)); p32++;
-        }
-        p += 16-state->memsize;
-        state->memsize = 0;
-    }
+	if (state->memsize) {   /* some data left from previous update */
+		XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize);
+		{   const U32* p32 = state->mem32;
+			state->v1 = XXH32_round(state->v1, XXH_readLE32(p32, endian)); p32++;
+			state->v2 = XXH32_round(state->v2, XXH_readLE32(p32, endian)); p32++;
+			state->v3 = XXH32_round(state->v3, XXH_readLE32(p32, endian)); p32++;
+			state->v4 = XXH32_round(state->v4, XXH_readLE32(p32, endian)); p32++;
+		}
+		p += 16-state->memsize;
+		state->memsize = 0;
+	}
 
-    if (p <= bEnd-16) {
-        const BYTE* const limit = bEnd - 16;
-        U32 v1 = state->v1;
-        U32 v2 = state->v2;
-        U32 v3 = state->v3;
-        U32 v4 = state->v4;
+	if (p <= bEnd-16) {
+		const BYTE* const limit = bEnd - 16;
+		U32 v1 = state->v1;
+		U32 v2 = state->v2;
+		U32 v3 = state->v3;
+		U32 v4 = state->v4;
 
-        do {
-            v1 = XXH32_round(v1, XXH_readLE32(p, endian)); p+=4;
-            v2 = XXH32_round(v2, XXH_readLE32(p, endian)); p+=4;
-            v3 = XXH32_round(v3, XXH_readLE32(p, endian)); p+=4;
-            v4 = XXH32_round(v4, XXH_readLE32(p, endian)); p+=4;
-        } while (p<=limit);
+		do {
+			v1 = XXH32_round(v1, XXH_readLE32(p, endian)); p+=4;
+			v2 = XXH32_round(v2, XXH_readLE32(p, endian)); p+=4;
+			v3 = XXH32_round(v3, XXH_readLE32(p, endian)); p+=4;
+			v4 = XXH32_round(v4, XXH_readLE32(p, endian)); p+=4;
+		} while (p<=limit);
 
-        state->v1 = v1;
-        state->v2 = v2;
-        state->v3 = v3;
-        state->v4 = v4;
-    }
+		state->v1 = v1;
+		state->v2 = v2;
+		state->v3 = v3;
+		state->v4 = v4;
+	}
 
-    if (p < bEnd) {
-        XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));
-        state->memsize = (unsigned)(bEnd-p);
-    }
+	if (p < bEnd) {
+		XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));
+		state->memsize = (unsigned)(bEnd-p);
+	}
 
-    return XXH_OK;
+	return XXH_OK;
 }
 
 XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* state_in, const void* input, size_t len)
 {
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_update_endian(state_in, input, len, XXH_littleEndian);
-    else
-        return XXH32_update_endian(state_in, input, len, XXH_bigEndian);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH32_update_endian(state_in, input, len, XXH_littleEndian);
+	else
+		return XXH32_update_endian(state_in, input, len, XXH_bigEndian);
 }
 
 
 
 FORCE_INLINE U32 XXH32_digest_endian (const XXH32_state_t* state, XXH_endianess endian)
 {
-    const BYTE * p = (const BYTE*)state->mem32;
-    const BYTE* const bEnd = (const BYTE*)(state->mem32) + state->memsize;
-    U32 h32;
+	const BYTE * p = (const BYTE*)state->mem32;
+	const BYTE* const bEnd = (const BYTE*)(state->mem32) + state->memsize;
+	U32 h32;
 
-    if (state->large_len) {
-        h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18);
-    } else {
-        h32 = state->v3 /* == seed */ + PRIME32_5;
-    }
+	if (state->large_len) {
+		h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18);
+	} else {
+		h32 = state->v3 /* == seed */ + PRIME32_5;
+	}
 
-    h32 += state->total_len_32;
+	h32 += state->total_len_32;
 
-    while (p+4<=bEnd) {
-        h32 += XXH_readLE32(p, endian) * PRIME32_3;
-        h32  = XXH_rotl32(h32, 17) * PRIME32_4;
-        p+=4;
-    }
+	while (p+4<=bEnd) {
+		h32 += XXH_readLE32(p, endian) * PRIME32_3;
+		h32  = XXH_rotl32(h32, 17) * PRIME32_4;
+		p+=4;
+	}
 
-    while (p<bEnd) {
-        h32 += (*p) * PRIME32_5;
-        h32  = XXH_rotl32(h32, 11) * PRIME32_1;
-        p++;
-    }
+	while (p<bEnd) {
+		h32 += (*p) * PRIME32_5;
+		h32  = XXH_rotl32(h32, 11) * PRIME32_1;
+		p++;
+	}
 
-    h32 ^= h32 >> 15;
-    h32 *= PRIME32_2;
-    h32 ^= h32 >> 13;
-    h32 *= PRIME32_3;
-    h32 ^= h32 >> 16;
+	h32 ^= h32 >> 15;
+	h32 *= PRIME32_2;
+	h32 ^= h32 >> 13;
+	h32 *= PRIME32_3;
+	h32 ^= h32 >> 16;
 
-    return h32;
+	return h32;
 }
 
 
 XXH_PUBLIC_API unsigned int XXH32_digest (const XXH32_state_t* state_in)
 {
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_digest_endian(state_in, XXH_littleEndian);
-    else
-        return XXH32_digest_endian(state_in, XXH_bigEndian);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH32_digest_endian(state_in, XXH_littleEndian);
+	else
+		return XXH32_digest_endian(state_in, XXH_bigEndian);
 }
 
 
@@ -706,131 +706,131 @@ XXH_PUBLIC_API unsigned int XXH32_digest (const XXH32_state_t* state_in)
 
 FORCE_INLINE XXH_errorcode XXH64_update_endian (XXH64_state_t* state, const void* input, size_t len, XXH_endianess endian)
 {
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
+	const BYTE* p = (const BYTE*)input;
+	const BYTE* const bEnd = p + len;
 
 #ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (input==NULL) return XXH_ERROR;
+	if (input==NULL) return XXH_ERROR;
 #endif
 
-    state->total_len += len;
+	state->total_len += len;
 
-    if (state->memsize + len < 32) {  /* fill in tmp buffer */
-        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len);
-        state->memsize += (U32)len;
-        return XXH_OK;
-    }
+	if (state->memsize + len < 32) {  /* fill in tmp buffer */
+		XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len);
+		state->memsize += (U32)len;
+		return XXH_OK;
+	}
 
-    if (state->memsize) {   /* tmp buffer is full */
-        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize);
-        state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0, endian));
-        state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1, endian));
-        state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2, endian));
-        state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3, endian));
-        p += 32-state->memsize;
-        state->memsize = 0;
-    }
+	if (state->memsize) {   /* tmp buffer is full */
+		XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize);
+		state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0, endian));
+		state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1, endian));
+		state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2, endian));
+		state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3, endian));
+		p += 32-state->memsize;
+		state->memsize = 0;
+	}
 
-    if (p+32 <= bEnd) {
-        const BYTE* const limit = bEnd - 32;
-        U64 v1 = state->v1;
-        U64 v2 = state->v2;
-        U64 v3 = state->v3;
-        U64 v4 = state->v4;
+	if (p+32 <= bEnd) {
+		const BYTE* const limit = bEnd - 32;
+		U64 v1 = state->v1;
+		U64 v2 = state->v2;
+		U64 v3 = state->v3;
+		U64 v4 = state->v4;
 
-        do {
-            v1 = XXH64_round(v1, XXH_readLE64(p, endian)); p+=8;
-            v2 = XXH64_round(v2, XXH_readLE64(p, endian)); p+=8;
-            v3 = XXH64_round(v3, XXH_readLE64(p, endian)); p+=8;
-            v4 = XXH64_round(v4, XXH_readLE64(p, endian)); p+=8;
-        } while (p<=limit);
+		do {
+			v1 = XXH64_round(v1, XXH_readLE64(p, endian)); p+=8;
+			v2 = XXH64_round(v2, XXH_readLE64(p, endian)); p+=8;
+			v3 = XXH64_round(v3, XXH_readLE64(p, endian)); p+=8;
+			v4 = XXH64_round(v4, XXH_readLE64(p, endian)); p+=8;
+		} while (p<=limit);
 
-        state->v1 = v1;
-        state->v2 = v2;
-        state->v3 = v3;
-        state->v4 = v4;
-    }
+		state->v1 = v1;
+		state->v2 = v2;
+		state->v3 = v3;
+		state->v4 = v4;
+	}
 
-    if (p < bEnd) {
-        XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));
-        state->memsize = (unsigned)(bEnd-p);
-    }
+	if (p < bEnd) {
+		XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));
+		state->memsize = (unsigned)(bEnd-p);
+	}
 
-    return XXH_OK;
+	return XXH_OK;
 }
 
 XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* state_in, const void* input, size_t len)
 {
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_update_endian(state_in, input, len, XXH_littleEndian);
-    else
-        return XXH64_update_endian(state_in, input, len, XXH_bigEndian);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH64_update_endian(state_in, input, len, XXH_littleEndian);
+	else
+		return XXH64_update_endian(state_in, input, len, XXH_bigEndian);
 }
 
 
 
 FORCE_INLINE U64 XXH64_digest_endian (const XXH64_state_t* state, XXH_endianess endian)
 {
-    const BYTE * p = (const BYTE*)state->mem64;
-    const BYTE* const bEnd = (const BYTE*)state->mem64 + state->memsize;
-    U64 h64;
+	const BYTE * p = (const BYTE*)state->mem64;
+	const BYTE* const bEnd = (const BYTE*)state->mem64 + state->memsize;
+	U64 h64;
 
-    if (state->total_len >= 32) {
-        U64 const v1 = state->v1;
-        U64 const v2 = state->v2;
-        U64 const v3 = state->v3;
-        U64 const v4 = state->v4;
+	if (state->total_len >= 32) {
+		U64 const v1 = state->v1;
+		U64 const v2 = state->v2;
+		U64 const v3 = state->v3;
+		U64 const v4 = state->v4;
 
-        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
-        h64 = XXH64_mergeRound(h64, v1);
-        h64 = XXH64_mergeRound(h64, v2);
-        h64 = XXH64_mergeRound(h64, v3);
-        h64 = XXH64_mergeRound(h64, v4);
-    } else {
-        h64  = state->v3 + PRIME64_5;
-    }
+		h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+		h64 = XXH64_mergeRound(h64, v1);
+		h64 = XXH64_mergeRound(h64, v2);
+		h64 = XXH64_mergeRound(h64, v3);
+		h64 = XXH64_mergeRound(h64, v4);
+	} else {
+		h64  = state->v3 + PRIME64_5;
+	}
 
-    h64 += (U64) state->total_len;
+	h64 += (U64) state->total_len;
 
-    while (p+8<=bEnd) {
-        U64 const k1 = XXH64_round(0, XXH_readLE64(p, endian));
-        h64 ^= k1;
-        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
-        p+=8;
-    }
+	while (p+8<=bEnd) {
+		U64 const k1 = XXH64_round(0, XXH_readLE64(p, endian));
+		h64 ^= k1;
+		h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+		p+=8;
+	}
 
-    if (p+4<=bEnd) {
-        h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1;
-        h64  = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-        p+=4;
-    }
+	if (p+4<=bEnd) {
+		h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1;
+		h64  = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+		p+=4;
+	}
 
-    while (p<bEnd) {
-        h64 ^= (*p) * PRIME64_5;
-        h64  = XXH_rotl64(h64, 11) * PRIME64_1;
-        p++;
-    }
+	while (p<bEnd) {
+		h64 ^= (*p) * PRIME64_5;
+		h64  = XXH_rotl64(h64, 11) * PRIME64_1;
+		p++;
+	}
 
-    h64 ^= h64 >> 33;
-    h64 *= PRIME64_2;
-    h64 ^= h64 >> 29;
-    h64 *= PRIME64_3;
-    h64 ^= h64 >> 32;
+	h64 ^= h64 >> 33;
+	h64 *= PRIME64_2;
+	h64 ^= h64 >> 29;
+	h64 *= PRIME64_3;
+	h64 ^= h64 >> 32;
 
-    return h64;
+	return h64;
 }
 
 
 XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
 {
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+	XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
 
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_digest_endian(state_in, XXH_littleEndian);
-    else
-        return XXH64_digest_endian(state_in, XXH_bigEndian);
+	if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+		return XXH64_digest_endian(state_in, XXH_littleEndian);
+	else
+		return XXH64_digest_endian(state_in, XXH_bigEndian);
 }
 
 
@@ -846,24 +846,24 @@ XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
 
 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
 {
-    XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
-    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
-    memcpy(dst, &hash, sizeof(*dst));
+	XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
+	if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
+	memcpy(dst, &hash, sizeof(*dst));
 }
 
 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
 {
-    XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
-    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
-    memcpy(dst, &hash, sizeof(*dst));
+	XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
+	if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
+	memcpy(dst, &hash, sizeof(*dst));
 }
 
 XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)
 {
-    return XXH_readBE32(src);
+	return XXH_readBE32(src);
 }
 
 XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src)
 {
-    return XXH_readBE64(src);
+	return XXH_readBE64(src);
 }
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index 9bad1f59f..82e24d17d 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -9,9 +9,9 @@
    modification, are permitted provided that the following conditions are
    met:
 
-       * Redistributions of source code must retain the above copyright
+	   * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
+	   * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    in the documentation and/or other materials provided with the
    distribution.
@@ -165,14 +165,14 @@ XXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, unsigned lo
 
 /*!
 XXH32() :
-    Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
-    The memory between input & input+length must be valid (allocated and read-accessible).
-    "seed" can be used to alter the result predictably.
-    Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
+	Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
+	The memory between input & input+length must be valid (allocated and read-accessible).
+	"seed" can be used to alter the result predictably.
+	Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
 XXH64() :
-    Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
-    "seed" can be used to alter the result predictably.
-    This function runs 2x faster on 64-bits systems, but slower on 32-bits systems (see benchmark).
+	Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
+	"seed" can be used to alter the result predictably.
+	This function runs 2x faster on 64-bits systems, but slower on 32-bits systems (see benchmark).
 */
 
 
@@ -270,26 +270,26 @@ XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src
    Do not use members directly. */
 
    struct XXH32_state_s {
-       unsigned total_len_32;
-       unsigned large_len;
-       unsigned v1;
-       unsigned v2;
-       unsigned v3;
-       unsigned v4;
-       unsigned mem32[4];   /* buffer defined as U32 for alignment */
-       unsigned memsize;
-       unsigned reserved;   /* never read nor write, will be removed in a future version */
+	   unsigned total_len_32;
+	   unsigned large_len;
+	   unsigned v1;
+	   unsigned v2;
+	   unsigned v3;
+	   unsigned v4;
+	   unsigned mem32[4];   /* buffer defined as U32 for alignment */
+	   unsigned memsize;
+	   unsigned reserved;   /* never read nor write, will be removed in a future version */
    };   /* typedef'd to XXH32_state_t */
 
    struct XXH64_state_s {
-       unsigned long long total_len;
-       unsigned long long v1;
-       unsigned long long v2;
-       unsigned long long v3;
-       unsigned long long v4;
-       unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
-       unsigned memsize;
-       unsigned reserved[2];          /* never read nor write, will be removed in a future version */
+	   unsigned long long total_len;
+	   unsigned long long v1;
+	   unsigned long long v2;
+	   unsigned long long v3;
+	   unsigned long long v4;
+	   unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
+	   unsigned memsize;
+	   unsigned reserved[2];          /* never read nor write, will be removed in a future version */
    };   /* typedef'd to XXH64_state_t */
 
 
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index 8408a589a..69199cb6f 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -50,24 +50,24 @@ const char* ZSTD_getErrorString(ZSTD_ErrorCode code) { return ERR_getErrorString
 /* default uses stdlib */
 void* ZSTD_defaultAllocFunction(void* opaque, size_t size)
 {
-    void* address = malloc(size);
-    (void)opaque;
-    return address;
+	void* address = malloc(size);
+	(void)opaque;
+	return address;
 }
 
 void ZSTD_defaultFreeFunction(void* opaque, void* address)
 {
-    (void)opaque;
-    free(address);
+	(void)opaque;
+	free(address);
 }
 
 void* ZSTD_malloc(size_t size, ZSTD_customMem customMem)
 {
-    return customMem.customAlloc(customMem.opaque, size);
+	return customMem.customAlloc(customMem.opaque, size);
 }
 
 void ZSTD_free(void* ptr, ZSTD_customMem customMem)
 {
-    if (ptr!=NULL)
-        customMem.customFree(customMem.opaque, ptr);
+	if (ptr!=NULL)
+		customMem.customFree(customMem.opaque, ptr);
 }
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index c31f8db91..84d898e57 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -40,9 +40,9 @@ size_t ZSTD_compressBound(size_t srcSize) { return FSE_compressBound(srcSize) +
 ***************************************/
 static void ZSTD_resetSeqStore(seqStore_t* ssPtr)
 {
-    ssPtr->lit = ssPtr->litStart;
-    ssPtr->sequences = ssPtr->sequencesStart;
-    ssPtr->longLengthID = 0;
+	ssPtr->lit = ssPtr->litStart;
+	ssPtr->sequences = ssPtr->sequencesStart;
+	ssPtr->longLengthID = 0;
 }
 
 
@@ -50,110 +50,110 @@ static void ZSTD_resetSeqStore(seqStore_t* ssPtr)
 *  Context memory management
 ***************************************/
 struct ZSTD_CCtx_s {
-    const BYTE* nextSrc;    /* next block here to continue on current prefix */
-    const BYTE* base;       /* All regular indexes relative to this position */
-    const BYTE* dictBase;   /* extDict indexes relative to this position */
-    U32   dictLimit;        /* below that point, need extDict */
-    U32   lowLimit;         /* below that point, no more data */
-    U32   nextToUpdate;     /* index from which to continue dictionary update */
-    U32   nextToUpdate3;    /* index from which to continue dictionary update */
-    U32   hashLog3;         /* dispatch table : larger == faster, more memory */
-    U32   loadedDictEnd;    /* index of end of dictionary */
-    U32   forceWindow;      /* force back-references to respect limit of 1<<wLog, even for dictionary */
-    U32   forceRawDict;     /* Force loading dictionary in "content-only" mode (no header analysis) */
-    ZSTD_compressionStage_e stage;
-    U32   rep[ZSTD_REP_NUM];
-    U32   repToConfirm[ZSTD_REP_NUM];
-    U32   dictID;
-    ZSTD_parameters params;
-    void* workSpace;
-    size_t workSpaceSize;
-    size_t blockSize;
-    U64 frameContentSize;
-    XXH64_state_t xxhState;
-    ZSTD_customMem customMem;
+	const BYTE* nextSrc;    /* next block here to continue on current prefix */
+	const BYTE* base;       /* All regular indexes relative to this position */
+	const BYTE* dictBase;   /* extDict indexes relative to this position */
+	U32   dictLimit;        /* below that point, need extDict */
+	U32   lowLimit;         /* below that point, no more data */
+	U32   nextToUpdate;     /* index from which to continue dictionary update */
+	U32   nextToUpdate3;    /* index from which to continue dictionary update */
+	U32   hashLog3;         /* dispatch table : larger == faster, more memory */
+	U32   loadedDictEnd;    /* index of end of dictionary */
+	U32   forceWindow;      /* force back-references to respect limit of 1<<wLog, even for dictionary */
+	U32   forceRawDict;     /* Force loading dictionary in "content-only" mode (no header analysis) */
+	ZSTD_compressionStage_e stage;
+	U32   rep[ZSTD_REP_NUM];
+	U32   repToConfirm[ZSTD_REP_NUM];
+	U32   dictID;
+	ZSTD_parameters params;
+	void* workSpace;
+	size_t workSpaceSize;
+	size_t blockSize;
+	U64 frameContentSize;
+	XXH64_state_t xxhState;
+	ZSTD_customMem customMem;
 
-    seqStore_t seqStore;    /* sequences storage ptrs */
-    U32* hashTable;
-    U32* hashTable3;
-    U32* chainTable;
-    HUF_CElt* hufTable;
-    U32 flagStaticTables;
-    HUF_repeat flagStaticHufTable;
-    FSE_CTable offcodeCTable  [FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
-    FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
-    FSE_CTable litlengthCTable  [FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
-    unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
+	seqStore_t seqStore;    /* sequences storage ptrs */
+	U32* hashTable;
+	U32* hashTable3;
+	U32* chainTable;
+	HUF_CElt* hufTable;
+	U32 flagStaticTables;
+	HUF_repeat flagStaticHufTable;
+	FSE_CTable offcodeCTable  [FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
+	FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
+	FSE_CTable litlengthCTable  [FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
+	unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
 };
 
 ZSTD_CCtx* ZSTD_createCCtx(void)
 {
-    return ZSTD_createCCtx_advanced(defaultCustomMem);
+	return ZSTD_createCCtx_advanced(defaultCustomMem);
 }
 
 ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
 {
-    ZSTD_CCtx* cctx;
+	ZSTD_CCtx* cctx;
 
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    cctx = (ZSTD_CCtx*) ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
-    if (!cctx) return NULL;
-    memset(cctx, 0, sizeof(ZSTD_CCtx));
-    cctx->customMem = customMem;
-    return cctx;
+	cctx = (ZSTD_CCtx*) ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
+	if (!cctx) return NULL;
+	memset(cctx, 0, sizeof(ZSTD_CCtx));
+	cctx->customMem = customMem;
+	return cctx;
 }
 
 size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
 {
-    if (cctx==NULL) return 0;   /* support free on NULL */
-    ZSTD_free(cctx->workSpace, cctx->customMem);
-    ZSTD_free(cctx, cctx->customMem);
-    return 0;   /* reserved as a potential error code in the future */
+	if (cctx==NULL) return 0;   /* support free on NULL */
+	ZSTD_free(cctx->workSpace, cctx->customMem);
+	ZSTD_free(cctx, cctx->customMem);
+	return 0;   /* reserved as a potential error code in the future */
 }
 
 size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx)
 {
-    if (cctx==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*cctx) + cctx->workSpaceSize;
+	if (cctx==NULL) return 0;   /* support sizeof on NULL */
+	return sizeof(*cctx) + cctx->workSpaceSize;
 }
 
 size_t ZSTD_setCCtxParameter(ZSTD_CCtx* cctx, ZSTD_CCtxParameter param, unsigned value)
 {
-    switch(param)
-    {
-    case ZSTD_p_forceWindow : cctx->forceWindow = value>0; cctx->loadedDictEnd = 0; return 0;
-    case ZSTD_p_forceRawDict : cctx->forceRawDict = value>0; return 0;
-    default: return ERROR(parameter_unknown);
-    }
+	switch(param)
+	{
+	case ZSTD_p_forceWindow : cctx->forceWindow = value>0; cctx->loadedDictEnd = 0; return 0;
+	case ZSTD_p_forceRawDict : cctx->forceRawDict = value>0; return 0;
+	default: return ERROR(parameter_unknown);
+	}
 }
 
 const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx)   /* hidden interface */
 {
-    return &(ctx->seqStore);
+	return &(ctx->seqStore);
 }
 
 static ZSTD_parameters ZSTD_getParamsFromCCtx(const ZSTD_CCtx* cctx)
 {
-    return cctx->params;
+	return cctx->params;
 }
 
 
 /** ZSTD_checkParams() :
-    ensure param values remain within authorized range.
-    @return : 0, or an error code if one value is beyond authorized range */
+	ensure param values remain within authorized range.
+	@return : 0, or an error code if one value is beyond authorized range */
 size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
 {
 #   define CLAMPCHECK(val,min,max) { if ((val<min) | (val>max)) return ERROR(compressionParameter_unsupported); }
-    CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-    CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-    CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-    CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-    CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-    CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-    if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2) return ERROR(compressionParameter_unsupported);
-    return 0;
+	CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
+	CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
+	CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
+	CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
+	CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
+	CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
+	if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2) return ERROR(compressionParameter_unsupported);
+	return 0;
 }
 
 
@@ -161,173 +161,173 @@ size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
  *  condition for correct operation : hashLog > 1 */
 static U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
 {
-    U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
-    return hashLog - btScale;
+	U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
+	return hashLog - btScale;
 }
 
 /** ZSTD_adjustCParams() :
-    optimize `cPar` for a given input (`srcSize` and `dictSize`).
-    mostly downsizing to reduce memory consumption and initialization.
-    Both `srcSize` and `dictSize` are optional (use 0 if unknown),
-    but if both are 0, no optimization can be done.
-    Note : cPar is considered validated at this stage. Use ZSTD_checkParams() to ensure that. */
+	optimize `cPar` for a given input (`srcSize` and `dictSize`).
+	mostly downsizing to reduce memory consumption and initialization.
+	Both `srcSize` and `dictSize` are optional (use 0 if unknown),
+	but if both are 0, no optimization can be done.
+	Note : cPar is considered validated at this stage. Use ZSTD_checkParams() to ensure that. */
 ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
 {
-    if (srcSize+dictSize == 0) return cPar;   /* no size information available : no adjustment */
+	if (srcSize+dictSize == 0) return cPar;   /* no size information available : no adjustment */
 
-    /* resize params, to use less memory when necessary */
-    {   U32 const minSrcSize = (srcSize==0) ? 500 : 0;
-        U64 const rSize = srcSize + dictSize + minSrcSize;
-        if (rSize < ((U64)1<<ZSTD_WINDOWLOG_MAX)) {
-            U32 const srcLog = MAX(ZSTD_HASHLOG_MIN, ZSTD_highbit32((U32)(rSize)-1) + 1);
-            if (cPar.windowLog > srcLog) cPar.windowLog = srcLog;
-    }   }
-    if (cPar.hashLog > cPar.windowLog) cPar.hashLog = cPar.windowLog;
-    {   U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
-        if (cycleLog > cPar.windowLog) cPar.chainLog -= (cycleLog - cPar.windowLog);
-    }
+	/* resize params, to use less memory when necessary */
+	{   U32 const minSrcSize = (srcSize==0) ? 500 : 0;
+		U64 const rSize = srcSize + dictSize + minSrcSize;
+		if (rSize < ((U64)1<<ZSTD_WINDOWLOG_MAX)) {
+			U32 const srcLog = MAX(ZSTD_HASHLOG_MIN, ZSTD_highbit32((U32)(rSize)-1) + 1);
+			if (cPar.windowLog > srcLog) cPar.windowLog = srcLog;
+	}   }
+	if (cPar.hashLog > cPar.windowLog) cPar.hashLog = cPar.windowLog;
+	{   U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
+		if (cycleLog > cPar.windowLog) cPar.chainLog -= (cycleLog - cPar.windowLog);
+	}
 
-    if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN) cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN;  /* required for frame header */
+	if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN) cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN;  /* required for frame header */
 
-    return cPar;
+	return cPar;
 }
 
 
 size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
 {
-    size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << cParams.windowLog);
-    U32    const divider = (cParams.searchLength==3) ? 3 : 4;
-    size_t const maxNbSeq = blockSize / divider;
-    size_t const tokenSpace = blockSize + 11*maxNbSeq;
+	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << cParams.windowLog);
+	U32    const divider = (cParams.searchLength==3) ? 3 : 4;
+	size_t const maxNbSeq = blockSize / divider;
+	size_t const tokenSpace = blockSize + 11*maxNbSeq;
 
-    size_t const chainSize = (cParams.strategy == ZSTD_fast) ? 0 : (1 << cParams.chainLog);
-    size_t const hSize = ((size_t)1) << cParams.hashLog;
-    U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
-    size_t const h3Size = ((size_t)1) << hashLog3;
-    size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+	size_t const chainSize = (cParams.strategy == ZSTD_fast) ? 0 : (1 << cParams.chainLog);
+	size_t const hSize = ((size_t)1) << cParams.hashLog;
+	U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
+	size_t const h3Size = ((size_t)1) << hashLog3;
+	size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
 
-    size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
-                          + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-    size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
-                             + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+	size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
+						  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
+	size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+							 + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
 
-    return sizeof(ZSTD_CCtx) + neededSpace;
+	return sizeof(ZSTD_CCtx) + neededSpace;
 }
 
 
 static U32 ZSTD_equivalentParams(ZSTD_parameters param1, ZSTD_parameters param2)
 {
-    return (param1.cParams.hashLog  == param2.cParams.hashLog)
-         & (param1.cParams.chainLog == param2.cParams.chainLog)
-         & (param1.cParams.strategy == param2.cParams.strategy)
-         & ((param1.cParams.searchLength==3) == (param2.cParams.searchLength==3));
+	return (param1.cParams.hashLog  == param2.cParams.hashLog)
+		 & (param1.cParams.chainLog == param2.cParams.chainLog)
+		 & (param1.cParams.strategy == param2.cParams.strategy)
+		 & ((param1.cParams.searchLength==3) == (param2.cParams.searchLength==3));
 }
 
 /*! ZSTD_continueCCtx() :
-    reuse CCtx without reset (note : requires no dictionary) */
+	reuse CCtx without reset (note : requires no dictionary) */
 static size_t ZSTD_continueCCtx(ZSTD_CCtx* cctx, ZSTD_parameters params, U64 frameContentSize)
 {
-    U32 const end = (U32)(cctx->nextSrc - cctx->base);
-    cctx->params = params;
-    cctx->frameContentSize = frameContentSize;
-    cctx->lowLimit = end;
-    cctx->dictLimit = end;
-    cctx->nextToUpdate = end+1;
-    cctx->stage = ZSTDcs_init;
-    cctx->dictID = 0;
-    cctx->loadedDictEnd = 0;
-    { int i; for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = repStartValue[i]; }
-    cctx->seqStore.litLengthSum = 0;  /* force reset of btopt stats */
-    XXH64_reset(&cctx->xxhState, 0);
-    return 0;
+	U32 const end = (U32)(cctx->nextSrc - cctx->base);
+	cctx->params = params;
+	cctx->frameContentSize = frameContentSize;
+	cctx->lowLimit = end;
+	cctx->dictLimit = end;
+	cctx->nextToUpdate = end+1;
+	cctx->stage = ZSTDcs_init;
+	cctx->dictID = 0;
+	cctx->loadedDictEnd = 0;
+	{ int i; for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = repStartValue[i]; }
+	cctx->seqStore.litLengthSum = 0;  /* force reset of btopt stats */
+	XXH64_reset(&cctx->xxhState, 0);
+	return 0;
 }
 
 typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset, ZSTDcrp_fullReset } ZSTD_compResetPolicy_e;
 
 /*! ZSTD_resetCCtx_advanced() :
-    note : `params` must be validated */
+	note : `params` must be validated */
 static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
-                                       ZSTD_parameters params, U64 frameContentSize,
-                                       ZSTD_compResetPolicy_e const crp)
+									   ZSTD_parameters params, U64 frameContentSize,
+									   ZSTD_compResetPolicy_e const crp)
 {
-    if (crp == ZSTDcrp_continue)
-        if (ZSTD_equivalentParams(params, zc->params)) {
-            zc->flagStaticTables = 0;
-            zc->flagStaticHufTable = HUF_repeat_none;
-            return ZSTD_continueCCtx(zc, params, frameContentSize);
-        }
+	if (crp == ZSTDcrp_continue)
+		if (ZSTD_equivalentParams(params, zc->params)) {
+			zc->flagStaticTables = 0;
+			zc->flagStaticHufTable = HUF_repeat_none;
+			return ZSTD_continueCCtx(zc, params, frameContentSize);
+		}
 
-    {   size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << params.cParams.windowLog);
-        U32    const divider = (params.cParams.searchLength==3) ? 3 : 4;
-        size_t const maxNbSeq = blockSize / divider;
-        size_t const tokenSpace = blockSize + 11*maxNbSeq;
-        size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ? 0 : (1 << params.cParams.chainLog);
-        size_t const hSize = ((size_t)1) << params.cParams.hashLog;
-        U32    const hashLog3 = (params.cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
-        size_t const h3Size = ((size_t)1) << hashLog3;
-        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-        void* ptr;
+	{   size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << params.cParams.windowLog);
+		U32    const divider = (params.cParams.searchLength==3) ? 3 : 4;
+		size_t const maxNbSeq = blockSize / divider;
+		size_t const tokenSpace = blockSize + 11*maxNbSeq;
+		size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ? 0 : (1 << params.cParams.chainLog);
+		size_t const hSize = ((size_t)1) << params.cParams.hashLog;
+		U32    const hashLog3 = (params.cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
+		size_t const h3Size = ((size_t)1) << hashLog3;
+		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+		void* ptr;
 
-        /* Check if workSpace is large enough, alloc a new one if needed */
-        {   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
-                                  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-            size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
-                                  + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-            if (zc->workSpaceSize < neededSpace) {
-                ZSTD_free(zc->workSpace, zc->customMem);
-                zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
-                if (zc->workSpace == NULL) return ERROR(memory_allocation);
-                zc->workSpaceSize = neededSpace;
-        }   }
+		/* Check if workSpace is large enough, alloc a new one if needed */
+		{   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
+								  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
+			size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+								  + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+			if (zc->workSpaceSize < neededSpace) {
+				ZSTD_free(zc->workSpace, zc->customMem);
+				zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
+				if (zc->workSpace == NULL) return ERROR(memory_allocation);
+				zc->workSpaceSize = neededSpace;
+		}   }
 
-        if (crp!=ZSTDcrp_noMemset) memset(zc->workSpace, 0, tableSpace);   /* reset tables only */
-        XXH64_reset(&zc->xxhState, 0);
-        zc->hashLog3 = hashLog3;
-        zc->hashTable = (U32*)(zc->workSpace);
-        zc->chainTable = zc->hashTable + hSize;
-        zc->hashTable3 = zc->chainTable + chainSize;
-        ptr = zc->hashTable3 + h3Size;
-        zc->hufTable = (HUF_CElt*)ptr;
-        zc->flagStaticTables = 0;
-        zc->flagStaticHufTable = HUF_repeat_none;
-        ptr = ((U32*)ptr) + 256;  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
+		if (crp!=ZSTDcrp_noMemset) memset(zc->workSpace, 0, tableSpace);   /* reset tables only */
+		XXH64_reset(&zc->xxhState, 0);
+		zc->hashLog3 = hashLog3;
+		zc->hashTable = (U32*)(zc->workSpace);
+		zc->chainTable = zc->hashTable + hSize;
+		zc->hashTable3 = zc->chainTable + chainSize;
+		ptr = zc->hashTable3 + h3Size;
+		zc->hufTable = (HUF_CElt*)ptr;
+		zc->flagStaticTables = 0;
+		zc->flagStaticHufTable = HUF_repeat_none;
+		ptr = ((U32*)ptr) + 256;  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
 
-        zc->nextToUpdate = 1;
-        zc->nextSrc = NULL;
-        zc->base = NULL;
-        zc->dictBase = NULL;
-        zc->dictLimit = 0;
-        zc->lowLimit = 0;
-        zc->params = params;
-        zc->blockSize = blockSize;
-        zc->frameContentSize = frameContentSize;
-        { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = repStartValue[i]; }
+		zc->nextToUpdate = 1;
+		zc->nextSrc = NULL;
+		zc->base = NULL;
+		zc->dictBase = NULL;
+		zc->dictLimit = 0;
+		zc->lowLimit = 0;
+		zc->params = params;
+		zc->blockSize = blockSize;
+		zc->frameContentSize = frameContentSize;
+		{ int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = repStartValue[i]; }
 
-        if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
-            zc->seqStore.litFreq = (U32*)ptr;
-            zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1<<Litbits);
-            zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL+1);
-            zc->seqStore.offCodeFreq = zc->seqStore.matchLengthFreq + (MaxML+1);
-            ptr = zc->seqStore.offCodeFreq + (MaxOff+1);
-            zc->seqStore.matchTable = (ZSTD_match_t*)ptr;
-            ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM+1;
-            zc->seqStore.priceTable = (ZSTD_optimal_t*)ptr;
-            ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM+1;
-            zc->seqStore.litLengthSum = 0;
-        }
-        zc->seqStore.sequencesStart = (seqDef*)ptr;
-        ptr = zc->seqStore.sequencesStart + maxNbSeq;
-        zc->seqStore.llCode = (BYTE*) ptr;
-        zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
-        zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
-        zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
+		if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
+			zc->seqStore.litFreq = (U32*)ptr;
+			zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1<<Litbits);
+			zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL+1);
+			zc->seqStore.offCodeFreq = zc->seqStore.matchLengthFreq + (MaxML+1);
+			ptr = zc->seqStore.offCodeFreq + (MaxOff+1);
+			zc->seqStore.matchTable = (ZSTD_match_t*)ptr;
+			ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM+1;
+			zc->seqStore.priceTable = (ZSTD_optimal_t*)ptr;
+			ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM+1;
+			zc->seqStore.litLengthSum = 0;
+		}
+		zc->seqStore.sequencesStart = (seqDef*)ptr;
+		ptr = zc->seqStore.sequencesStart + maxNbSeq;
+		zc->seqStore.llCode = (BYTE*) ptr;
+		zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
+		zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
+		zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
 
-        zc->stage = ZSTDcs_init;
-        zc->dictID = 0;
-        zc->loadedDictEnd = 0;
+		zc->stage = ZSTDcs_init;
+		zc->dictID = 0;
+		zc->loadedDictEnd = 0;
 
-        return 0;
-    }
+		return 0;
+	}
 }
 
 /* ZSTD_invalidateRepCodes() :
@@ -335,8 +335,8 @@ static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
  * Note : only works with regular variant;
  *        do not use with extDict variant ! */
 void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
-    int i;
-    for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = 0;
+	int i;
+	for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = 0;
 }
 
 /*! ZSTD_copyCCtx() :
@@ -345,47 +345,47 @@ void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
 *   @return : 0, or an error code */
 size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
 {
-    if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
+	if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
 
 
-    memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
-    {   ZSTD_parameters params = srcCCtx->params;
-        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-        ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
-    }
+	memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
+	{   ZSTD_parameters params = srcCCtx->params;
+		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+		ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
+	}
 
-    /* copy tables */
-    {   size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
-        size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
-        size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
-        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-        memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
-    }
+	/* copy tables */
+	{   size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
+		size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
+		size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
+		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+		memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
+	}
 
-    /* copy dictionary offsets */
-    dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
-    dstCCtx->nextToUpdate3= srcCCtx->nextToUpdate3;
-    dstCCtx->nextSrc      = srcCCtx->nextSrc;
-    dstCCtx->base         = srcCCtx->base;
-    dstCCtx->dictBase     = srcCCtx->dictBase;
-    dstCCtx->dictLimit    = srcCCtx->dictLimit;
-    dstCCtx->lowLimit     = srcCCtx->lowLimit;
-    dstCCtx->loadedDictEnd= srcCCtx->loadedDictEnd;
-    dstCCtx->dictID       = srcCCtx->dictID;
+	/* copy dictionary offsets */
+	dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
+	dstCCtx->nextToUpdate3= srcCCtx->nextToUpdate3;
+	dstCCtx->nextSrc      = srcCCtx->nextSrc;
+	dstCCtx->base         = srcCCtx->base;
+	dstCCtx->dictBase     = srcCCtx->dictBase;
+	dstCCtx->dictLimit    = srcCCtx->dictLimit;
+	dstCCtx->lowLimit     = srcCCtx->lowLimit;
+	dstCCtx->loadedDictEnd= srcCCtx->loadedDictEnd;
+	dstCCtx->dictID       = srcCCtx->dictID;
 
-    /* copy entropy tables */
-    dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
-    dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
-    if (srcCCtx->flagStaticTables) {
-        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
-        memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
-        memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
-    }
-    if (srcCCtx->flagStaticHufTable) {
-        memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256*4);
-    }
+	/* copy entropy tables */
+	dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
+	dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
+	if (srcCCtx->flagStaticTables) {
+		memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
+		memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
+		memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
+	}
+	if (srcCCtx->flagStaticHufTable) {
+		memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256*4);
+	}
 
-    return 0;
+	return 0;
 }
 
 
@@ -393,25 +393,25 @@ size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long
 *   reduce table indexes by `reducerValue` */
 static void ZSTD_reduceTable (U32* const table, U32 const size, U32 const reducerValue)
 {
-    U32 u;
-    for (u=0 ; u < size ; u++) {
-        if (table[u] < reducerValue) table[u] = 0;
-        else table[u] -= reducerValue;
-    }
+	U32 u;
+	for (u=0 ; u < size ; u++) {
+		if (table[u] < reducerValue) table[u] = 0;
+		else table[u] -= reducerValue;
+	}
 }
 
 /*! ZSTD_reduceIndex() :
 *   rescale all indexes to avoid future overflow (indexes are U32) */
 static void ZSTD_reduceIndex (ZSTD_CCtx* zc, const U32 reducerValue)
 {
-    { U32 const hSize = 1 << zc->params.cParams.hashLog;
-      ZSTD_reduceTable(zc->hashTable, hSize, reducerValue); }
+	{ U32 const hSize = 1 << zc->params.cParams.hashLog;
+	  ZSTD_reduceTable(zc->hashTable, hSize, reducerValue); }
 
-    { U32 const chainSize = (zc->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << zc->params.cParams.chainLog);
-      ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue); }
+	{ U32 const chainSize = (zc->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << zc->params.cParams.chainLog);
+	  ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue); }
 
-    { U32 const h3Size = (zc->hashLog3) ? 1 << zc->hashLog3 : 0;
-      ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue); }
+	{ U32 const h3Size = (zc->hashLog3) ? 1 << zc->hashLog3 : 0;
+	  ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue); }
 }
 
 
@@ -423,376 +423,376 @@ static void ZSTD_reduceIndex (ZSTD_CCtx* zc, const U32 reducerValue)
 
 size_t ZSTD_noCompressBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    if (srcSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memcpy((BYTE*)dst + ZSTD_blockHeaderSize, src, srcSize);
-    MEM_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
-    return ZSTD_blockHeaderSize+srcSize;
+	if (srcSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
+	memcpy((BYTE*)dst + ZSTD_blockHeaderSize, src, srcSize);
+	MEM_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
+	return ZSTD_blockHeaderSize+srcSize;
 }
 
 
 static size_t ZSTD_noCompressLiterals (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    BYTE* const ostart = (BYTE* const)dst;
-    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+	BYTE* const ostart = (BYTE* const)dst;
+	U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
 
-    if (srcSize + flSize > dstCapacity) return ERROR(dstSize_tooSmall);
+	if (srcSize + flSize > dstCapacity) return ERROR(dstSize_tooSmall);
 
-    switch(flSize)
-    {
-        case 1: /* 2 - 1 - 5 */
-            ostart[0] = (BYTE)((U32)set_basic + (srcSize<<3));
-            break;
-        case 2: /* 2 - 2 - 12 */
-            MEM_writeLE16(ostart, (U16)((U32)set_basic + (1<<2) + (srcSize<<4)));
-            break;
-        default:   /*note : should not be necessary : flSize is within {1,2,3} */
-        case 3: /* 2 - 2 - 20 */
-            MEM_writeLE32(ostart, (U32)((U32)set_basic + (3<<2) + (srcSize<<4)));
-            break;
-    }
+	switch(flSize)
+	{
+		case 1: /* 2 - 1 - 5 */
+			ostart[0] = (BYTE)((U32)set_basic + (srcSize<<3));
+			break;
+		case 2: /* 2 - 2 - 12 */
+			MEM_writeLE16(ostart, (U16)((U32)set_basic + (1<<2) + (srcSize<<4)));
+			break;
+		default:   /*note : should not be necessary : flSize is within {1,2,3} */
+		case 3: /* 2 - 2 - 20 */
+			MEM_writeLE32(ostart, (U32)((U32)set_basic + (3<<2) + (srcSize<<4)));
+			break;
+	}
 
-    memcpy(ostart + flSize, src, srcSize);
-    return srcSize + flSize;
+	memcpy(ostart + flSize, src, srcSize);
+	return srcSize + flSize;
 }
 
 static size_t ZSTD_compressRleLiteralsBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    BYTE* const ostart = (BYTE* const)dst;
-    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+	BYTE* const ostart = (BYTE* const)dst;
+	U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
 
-    (void)dstCapacity;  /* dstCapacity already guaranteed to be >=4, hence large enough */
+	(void)dstCapacity;  /* dstCapacity already guaranteed to be >=4, hence large enough */
 
-    switch(flSize)
-    {
-        case 1: /* 2 - 1 - 5 */
-            ostart[0] = (BYTE)((U32)set_rle + (srcSize<<3));
-            break;
-        case 2: /* 2 - 2 - 12 */
-            MEM_writeLE16(ostart, (U16)((U32)set_rle + (1<<2) + (srcSize<<4)));
-            break;
-        default:   /*note : should not be necessary : flSize is necessarily within {1,2,3} */
-        case 3: /* 2 - 2 - 20 */
-            MEM_writeLE32(ostart, (U32)((U32)set_rle + (3<<2) + (srcSize<<4)));
-            break;
-    }
+	switch(flSize)
+	{
+		case 1: /* 2 - 1 - 5 */
+			ostart[0] = (BYTE)((U32)set_rle + (srcSize<<3));
+			break;
+		case 2: /* 2 - 2 - 12 */
+			MEM_writeLE16(ostart, (U16)((U32)set_rle + (1<<2) + (srcSize<<4)));
+			break;
+		default:   /*note : should not be necessary : flSize is necessarily within {1,2,3} */
+		case 3: /* 2 - 2 - 20 */
+			MEM_writeLE32(ostart, (U32)((U32)set_rle + (3<<2) + (srcSize<<4)));
+			break;
+	}
 
-    ostart[flSize] = *(const BYTE*)src;
-    return flSize+1;
+	ostart[flSize] = *(const BYTE*)src;
+	return flSize+1;
 }
 
 
 static size_t ZSTD_minGain(size_t srcSize) { return (srcSize >> 6) + 2; }
 
 static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
-                                     void* dst, size_t dstCapacity,
-                               const void* src, size_t srcSize)
+									 void* dst, size_t dstCapacity,
+							   const void* src, size_t srcSize)
 {
-    size_t const minGain = ZSTD_minGain(srcSize);
-    size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
-    BYTE*  const ostart = (BYTE*)dst;
-    U32 singleStream = srcSize < 256;
-    symbolEncodingType_e hType = set_compressed;
-    size_t cLitSize;
+	size_t const minGain = ZSTD_minGain(srcSize);
+	size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
+	BYTE*  const ostart = (BYTE*)dst;
+	U32 singleStream = srcSize < 256;
+	symbolEncodingType_e hType = set_compressed;
+	size_t cLitSize;
 
 
-    /* small ? don't even attempt compression (speed opt) */
+	/* small ? don't even attempt compression (speed opt) */
 #   define LITERAL_NOENTROPY 63
-    {   size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
-        if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-    }
+	{   size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
+		if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+	}
 
-    if (dstCapacity < lhSize+1) return ERROR(dstSize_tooSmall);   /* not enough space for compression */
-    {   HUF_repeat repeat = zc->flagStaticHufTable;
-        int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
-        if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
-        cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
-                                : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
-        if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
-        else { zc->flagStaticHufTable = HUF_repeat_check; }       /* now have a table to reuse */
-    }
+	if (dstCapacity < lhSize+1) return ERROR(dstSize_tooSmall);   /* not enough space for compression */
+	{   HUF_repeat repeat = zc->flagStaticHufTable;
+		int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
+		if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
+		cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
+								: HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
+		if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
+		else { zc->flagStaticHufTable = HUF_repeat_check; }       /* now have a table to reuse */
+	}
 
-    if ((cLitSize==0) | (cLitSize >= srcSize - minGain)) {
-        zc->flagStaticHufTable = HUF_repeat_none;
-        return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-    }
-    if (cLitSize==1) {
-        zc->flagStaticHufTable = HUF_repeat_none;
-        return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
-    }
+	if ((cLitSize==0) | (cLitSize >= srcSize - minGain)) {
+		zc->flagStaticHufTable = HUF_repeat_none;
+		return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+	}
+	if (cLitSize==1) {
+		zc->flagStaticHufTable = HUF_repeat_none;
+		return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
+	}
 
-    /* Build header */
-    switch(lhSize)
-    {
-    case 3: /* 2 - 2 - 10 - 10 */
-        {   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<14);
-            MEM_writeLE24(ostart, lhc);
-            break;
-        }
-    case 4: /* 2 - 2 - 14 - 14 */
-        {   U32 const lhc = hType + (2 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<18);
-            MEM_writeLE32(ostart, lhc);
-            break;
-        }
-    default:   /* should not be necessary, lhSize is only {3,4,5} */
-    case 5: /* 2 - 2 - 18 - 18 */
-        {   U32 const lhc = hType + (3 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<22);
-            MEM_writeLE32(ostart, lhc);
-            ostart[4] = (BYTE)(cLitSize >> 10);
-            break;
-        }
-    }
-    return lhSize+cLitSize;
+	/* Build header */
+	switch(lhSize)
+	{
+	case 3: /* 2 - 2 - 10 - 10 */
+		{   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<14);
+			MEM_writeLE24(ostart, lhc);
+			break;
+		}
+	case 4: /* 2 - 2 - 14 - 14 */
+		{   U32 const lhc = hType + (2 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<18);
+			MEM_writeLE32(ostart, lhc);
+			break;
+		}
+	default:   /* should not be necessary, lhSize is only {3,4,5} */
+	case 5: /* 2 - 2 - 18 - 18 */
+		{   U32 const lhc = hType + (3 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<22);
+			MEM_writeLE32(ostart, lhc);
+			ostart[4] = (BYTE)(cLitSize >> 10);
+			break;
+		}
+	}
+	return lhSize+cLitSize;
 }
 
 static const BYTE LL_Code[64] = {  0,  1,  2,  3,  4,  5,  6,  7,
-                                   8,  9, 10, 11, 12, 13, 14, 15,
-                                  16, 16, 17, 17, 18, 18, 19, 19,
-                                  20, 20, 20, 20, 21, 21, 21, 21,
-                                  22, 22, 22, 22, 22, 22, 22, 22,
-                                  23, 23, 23, 23, 23, 23, 23, 23,
-                                  24, 24, 24, 24, 24, 24, 24, 24,
-                                  24, 24, 24, 24, 24, 24, 24, 24 };
+								   8,  9, 10, 11, 12, 13, 14, 15,
+								  16, 16, 17, 17, 18, 18, 19, 19,
+								  20, 20, 20, 20, 21, 21, 21, 21,
+								  22, 22, 22, 22, 22, 22, 22, 22,
+								  23, 23, 23, 23, 23, 23, 23, 23,
+								  24, 24, 24, 24, 24, 24, 24, 24,
+								  24, 24, 24, 24, 24, 24, 24, 24 };
 
 static const BYTE ML_Code[128] = { 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
-                                  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
-                                  32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
-                                  38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
-                                  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
-                                  41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
-                                  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
-                                  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 };
+								  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+								  32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
+								  38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
+								  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+								  41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
+								  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
+								  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 };
 
 
 void ZSTD_seqToCodes(const seqStore_t* seqStorePtr)
 {
-    BYTE const LL_deltaCode = 19;
-    BYTE const ML_deltaCode = 36;
-    const seqDef* const sequences = seqStorePtr->sequencesStart;
-    BYTE* const llCodeTable = seqStorePtr->llCode;
-    BYTE* const ofCodeTable = seqStorePtr->ofCode;
-    BYTE* const mlCodeTable = seqStorePtr->mlCode;
-    U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-    U32 u;
-    for (u=0; u<nbSeq; u++) {
-        U32 const llv = sequences[u].litLength;
-        U32 const mlv = sequences[u].matchLength;
-        llCodeTable[u] = (llv> 63) ? (BYTE)ZSTD_highbit32(llv) + LL_deltaCode : LL_Code[llv];
-        ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
-        mlCodeTable[u] = (mlv>127) ? (BYTE)ZSTD_highbit32(mlv) + ML_deltaCode : ML_Code[mlv];
-    }
-    if (seqStorePtr->longLengthID==1)
-        llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
-    if (seqStorePtr->longLengthID==2)
-        mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
+	BYTE const LL_deltaCode = 19;
+	BYTE const ML_deltaCode = 36;
+	const seqDef* const sequences = seqStorePtr->sequencesStart;
+	BYTE* const llCodeTable = seqStorePtr->llCode;
+	BYTE* const ofCodeTable = seqStorePtr->ofCode;
+	BYTE* const mlCodeTable = seqStorePtr->mlCode;
+	U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+	U32 u;
+	for (u=0; u<nbSeq; u++) {
+		U32 const llv = sequences[u].litLength;
+		U32 const mlv = sequences[u].matchLength;
+		llCodeTable[u] = (llv> 63) ? (BYTE)ZSTD_highbit32(llv) + LL_deltaCode : LL_Code[llv];
+		ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
+		mlCodeTable[u] = (mlv>127) ? (BYTE)ZSTD_highbit32(mlv) + ML_deltaCode : ML_Code[mlv];
+	}
+	if (seqStorePtr->longLengthID==1)
+		llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
+	if (seqStorePtr->longLengthID==2)
+		mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
 }
 
 MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
-                              void* dst, size_t dstCapacity,
-                              size_t srcSize)
+							  void* dst, size_t dstCapacity,
+							  size_t srcSize)
 {
-    const int longOffsets = zc->params.cParams.windowLog > STREAM_ACCUMULATOR_MIN;
-    const seqStore_t* seqStorePtr = &(zc->seqStore);
-    U32 count[MaxSeq+1];
-    S16 norm[MaxSeq+1];
-    FSE_CTable* CTable_LitLength = zc->litlengthCTable;
-    FSE_CTable* CTable_OffsetBits = zc->offcodeCTable;
-    FSE_CTable* CTable_MatchLength = zc->matchlengthCTable;
-    U32 LLtype, Offtype, MLtype;   /* compressed, raw or rle */
-    const seqDef* const sequences = seqStorePtr->sequencesStart;
-    const BYTE* const ofCodeTable = seqStorePtr->ofCode;
-    const BYTE* const llCodeTable = seqStorePtr->llCode;
-    const BYTE* const mlCodeTable = seqStorePtr->mlCode;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstCapacity;
-    BYTE* op = ostart;
-    size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
-    BYTE* seqHead;
-    BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
+	const int longOffsets = zc->params.cParams.windowLog > STREAM_ACCUMULATOR_MIN;
+	const seqStore_t* seqStorePtr = &(zc->seqStore);
+	U32 count[MaxSeq+1];
+	S16 norm[MaxSeq+1];
+	FSE_CTable* CTable_LitLength = zc->litlengthCTable;
+	FSE_CTable* CTable_OffsetBits = zc->offcodeCTable;
+	FSE_CTable* CTable_MatchLength = zc->matchlengthCTable;
+	U32 LLtype, Offtype, MLtype;   /* compressed, raw or rle */
+	const seqDef* const sequences = seqStorePtr->sequencesStart;
+	const BYTE* const ofCodeTable = seqStorePtr->ofCode;
+	const BYTE* const llCodeTable = seqStorePtr->llCode;
+	const BYTE* const mlCodeTable = seqStorePtr->mlCode;
+	BYTE* const ostart = (BYTE*)dst;
+	BYTE* const oend = ostart + dstCapacity;
+	BYTE* op = ostart;
+	size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
+	BYTE* seqHead;
+	BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
 
-    /* Compress literals */
-    {   const BYTE* const literals = seqStorePtr->litStart;
-        size_t const litSize = seqStorePtr->lit - literals;
-        size_t const cSize = ZSTD_compressLiterals(zc, op, dstCapacity, literals, litSize);
-        if (ZSTD_isError(cSize)) return cSize;
-        op += cSize;
-    }
+	/* Compress literals */
+	{   const BYTE* const literals = seqStorePtr->litStart;
+		size_t const litSize = seqStorePtr->lit - literals;
+		size_t const cSize = ZSTD_compressLiterals(zc, op, dstCapacity, literals, litSize);
+		if (ZSTD_isError(cSize)) return cSize;
+		op += cSize;
+	}
 
-    /* Sequences Header */
-    if ((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead */) return ERROR(dstSize_tooSmall);
-    if (nbSeq < 0x7F) *op++ = (BYTE)nbSeq;
-    else if (nbSeq < LONGNBSEQ) op[0] = (BYTE)((nbSeq>>8) + 0x80), op[1] = (BYTE)nbSeq, op+=2;
-    else op[0]=0xFF, MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ)), op+=3;
-    if (nbSeq==0) goto _check_compressibility;
+	/* Sequences Header */
+	if ((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead */) return ERROR(dstSize_tooSmall);
+	if (nbSeq < 0x7F) *op++ = (BYTE)nbSeq;
+	else if (nbSeq < LONGNBSEQ) op[0] = (BYTE)((nbSeq>>8) + 0x80), op[1] = (BYTE)nbSeq, op+=2;
+	else op[0]=0xFF, MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ)), op+=3;
+	if (nbSeq==0) goto _check_compressibility;
 
-    /* seqHead : flags for FSE encoding type */
-    seqHead = op++;
+	/* seqHead : flags for FSE encoding type */
+	seqHead = op++;
 
 #define MIN_SEQ_FOR_DYNAMIC_FSE   64
 #define MAX_SEQ_FOR_STATIC_FSE  1000
 
-    /* convert length/distances into codes */
-    ZSTD_seqToCodes(seqStorePtr);
+	/* convert length/distances into codes */
+	ZSTD_seqToCodes(seqStorePtr);
 
-    /* CTable for Literal Lengths */
-    {   U32 max = MaxLL;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, zc->tmpCounters);
-        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-            *op++ = llCodeTable[0];
-            FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
-            LLtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-            LLtype = set_repeat;
-        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog-1)))) {
-            FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
-            LLtype = set_basic;
-        } else {
-            size_t nbSeq_1 = nbSeq;
-            const U32 tableLog = FSE_optimalTableLog(LLFSELog, nbSeq, max);
-            if (count[llCodeTable[nbSeq-1]]>1) { count[llCodeTable[nbSeq-1]]--; nbSeq_1--; }
-            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return NCountSize;
-              op += NCountSize; }
-            FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
-            LLtype = set_compressed;
-    }   }
+	/* CTable for Literal Lengths */
+	{   U32 max = MaxLL;
+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, zc->tmpCounters);
+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+			*op++ = llCodeTable[0];
+			FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
+			LLtype = set_rle;
+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+			LLtype = set_repeat;
+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog-1)))) {
+			FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+			LLtype = set_basic;
+		} else {
+			size_t nbSeq_1 = nbSeq;
+			const U32 tableLog = FSE_optimalTableLog(LLFSELog, nbSeq, max);
+			if (count[llCodeTable[nbSeq-1]]>1) { count[llCodeTable[nbSeq-1]]--; nbSeq_1--; }
+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+			{ size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+			  if (FSE_isError(NCountSize)) return NCountSize;
+			  op += NCountSize; }
+			FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+			LLtype = set_compressed;
+	}   }
 
-    /* CTable for Offsets */
-    {   U32 max = MaxOff;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, zc->tmpCounters);
-        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-            *op++ = ofCodeTable[0];
-            FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
-            Offtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-            Offtype = set_repeat;
-        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog-1)))) {
-            FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
-            Offtype = set_basic;
-        } else {
-            size_t nbSeq_1 = nbSeq;
-            const U32 tableLog = FSE_optimalTableLog(OffFSELog, nbSeq, max);
-            if (count[ofCodeTable[nbSeq-1]]>1) { count[ofCodeTable[nbSeq-1]]--; nbSeq_1--; }
-            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return NCountSize;
-              op += NCountSize; }
-            FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
-            Offtype = set_compressed;
-    }   }
+	/* CTable for Offsets */
+	{   U32 max = MaxOff;
+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, zc->tmpCounters);
+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+			*op++ = ofCodeTable[0];
+			FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
+			Offtype = set_rle;
+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+			Offtype = set_repeat;
+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog-1)))) {
+			FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+			Offtype = set_basic;
+		} else {
+			size_t nbSeq_1 = nbSeq;
+			const U32 tableLog = FSE_optimalTableLog(OffFSELog, nbSeq, max);
+			if (count[ofCodeTable[nbSeq-1]]>1) { count[ofCodeTable[nbSeq-1]]--; nbSeq_1--; }
+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+			{ size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+			  if (FSE_isError(NCountSize)) return NCountSize;
+			  op += NCountSize; }
+			FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+			Offtype = set_compressed;
+	}   }
 
-    /* CTable for MatchLengths */
-    {   U32 max = MaxML;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, zc->tmpCounters);
-        if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-            *op++ = *mlCodeTable;
-            FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
-            MLtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-            MLtype = set_repeat;
-        } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog-1)))) {
-            FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
-            MLtype = set_basic;
-        } else {
-            size_t nbSeq_1 = nbSeq;
-            const U32 tableLog = FSE_optimalTableLog(MLFSELog, nbSeq, max);
-            if (count[mlCodeTable[nbSeq-1]]>1) { count[mlCodeTable[nbSeq-1]]--; nbSeq_1--; }
-            FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-            { size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
-              if (FSE_isError(NCountSize)) return NCountSize;
-              op += NCountSize; }
-            FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
-            MLtype = set_compressed;
-    }   }
+	/* CTable for MatchLengths */
+	{   U32 max = MaxML;
+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, zc->tmpCounters);
+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
+			*op++ = *mlCodeTable;
+			FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
+			MLtype = set_rle;
+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+			MLtype = set_repeat;
+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog-1)))) {
+			FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
+			MLtype = set_basic;
+		} else {
+			size_t nbSeq_1 = nbSeq;
+			const U32 tableLog = FSE_optimalTableLog(MLFSELog, nbSeq, max);
+			if (count[mlCodeTable[nbSeq-1]]>1) { count[mlCodeTable[nbSeq-1]]--; nbSeq_1--; }
+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
+			{ size_t const NCountSize = FSE_writeNCount(op, oend-op, norm, max, tableLog);   /* overflow protected */
+			  if (FSE_isError(NCountSize)) return NCountSize;
+			  op += NCountSize; }
+			FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, scratchBuffer, sizeof(scratchBuffer));
+			MLtype = set_compressed;
+	}   }
 
-    *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
-    zc->flagStaticTables = 0;
+	*seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
+	zc->flagStaticTables = 0;
 
-    /* Encoding Sequences */
-    {   BIT_CStream_t blockStream;
-        FSE_CState_t  stateMatchLength;
-        FSE_CState_t  stateOffsetBits;
-        FSE_CState_t  stateLitLength;
+	/* Encoding Sequences */
+	{   BIT_CStream_t blockStream;
+		FSE_CState_t  stateMatchLength;
+		FSE_CState_t  stateOffsetBits;
+		FSE_CState_t  stateLitLength;
 
-        CHECK_E(BIT_initCStream(&blockStream, op, oend-op), dstSize_tooSmall); /* not enough space remaining */
+		CHECK_E(BIT_initCStream(&blockStream, op, oend-op), dstSize_tooSmall); /* not enough space remaining */
 
-        /* first symbols */
-        FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq-1]);
-        FSE_initCState2(&stateOffsetBits,  CTable_OffsetBits,  ofCodeTable[nbSeq-1]);
-        FSE_initCState2(&stateLitLength,   CTable_LitLength,   llCodeTable[nbSeq-1]);
-        BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
-        if (MEM_32bits()) BIT_flushBits(&blockStream);
-        BIT_addBits(&blockStream, sequences[nbSeq-1].matchLength, ML_bits[mlCodeTable[nbSeq-1]]);
-        if (MEM_32bits()) BIT_flushBits(&blockStream);
-        if (longOffsets) {
-            U32 const ofBits = ofCodeTable[nbSeq-1];
-            int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
-            if (extraBits) {
-                BIT_addBits(&blockStream, sequences[nbSeq-1].offset, extraBits);
-                BIT_flushBits(&blockStream);
-            }
-            BIT_addBits(&blockStream, sequences[nbSeq-1].offset >> extraBits,
-                        ofBits - extraBits);
-        } else {
-            BIT_addBits(&blockStream, sequences[nbSeq-1].offset, ofCodeTable[nbSeq-1]);
-        }
-        BIT_flushBits(&blockStream);
+		/* first symbols */
+		FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq-1]);
+		FSE_initCState2(&stateOffsetBits,  CTable_OffsetBits,  ofCodeTable[nbSeq-1]);
+		FSE_initCState2(&stateLitLength,   CTable_LitLength,   llCodeTable[nbSeq-1]);
+		BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
+		if (MEM_32bits()) BIT_flushBits(&blockStream);
+		BIT_addBits(&blockStream, sequences[nbSeq-1].matchLength, ML_bits[mlCodeTable[nbSeq-1]]);
+		if (MEM_32bits()) BIT_flushBits(&blockStream);
+		if (longOffsets) {
+			U32 const ofBits = ofCodeTable[nbSeq-1];
+			int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+			if (extraBits) {
+				BIT_addBits(&blockStream, sequences[nbSeq-1].offset, extraBits);
+				BIT_flushBits(&blockStream);
+			}
+			BIT_addBits(&blockStream, sequences[nbSeq-1].offset >> extraBits,
+						ofBits - extraBits);
+		} else {
+			BIT_addBits(&blockStream, sequences[nbSeq-1].offset, ofCodeTable[nbSeq-1]);
+		}
+		BIT_flushBits(&blockStream);
 
-        {   size_t n;
-            for (n=nbSeq-2 ; n<nbSeq ; n--) {      /* intentional underflow */
-                BYTE const llCode = llCodeTable[n];
-                BYTE const ofCode = ofCodeTable[n];
-                BYTE const mlCode = mlCodeTable[n];
-                U32  const llBits = LL_bits[llCode];
-                U32  const ofBits = ofCode;                                     /* 32b*/  /* 64b*/
-                U32  const mlBits = ML_bits[mlCode];
-                                                                                /* (7)*/  /* (7)*/
-                FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode);       /* 15 */  /* 15 */
-                FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode);      /* 24 */  /* 24 */
-                if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
-                FSE_encodeSymbol(&blockStream, &stateLitLength, llCode);        /* 16 */  /* 33 */
-                if (MEM_32bits() || (ofBits+mlBits+llBits >= 64-7-(LLFSELog+MLFSELog+OffFSELog)))
-                    BIT_flushBits(&blockStream);                                /* (7)*/
-                BIT_addBits(&blockStream, sequences[n].litLength, llBits);
-                if (MEM_32bits() && ((llBits+mlBits)>24)) BIT_flushBits(&blockStream);
-                BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
-                if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
-                if (longOffsets) {
-                    int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
-                    if (extraBits) {
-                        BIT_addBits(&blockStream, sequences[n].offset, extraBits);
-                        BIT_flushBits(&blockStream);                            /* (7)*/
-                    }
-                    BIT_addBits(&blockStream, sequences[n].offset >> extraBits,
-                                ofBits - extraBits);                            /* 31 */
-                } else {
-                    BIT_addBits(&blockStream, sequences[n].offset, ofBits);     /* 31 */
-                }
-                BIT_flushBits(&blockStream);                                    /* (7)*/
-        }   }
+		{   size_t n;
+			for (n=nbSeq-2 ; n<nbSeq ; n--) {      /* intentional underflow */
+				BYTE const llCode = llCodeTable[n];
+				BYTE const ofCode = ofCodeTable[n];
+				BYTE const mlCode = mlCodeTable[n];
+				U32  const llBits = LL_bits[llCode];
+				U32  const ofBits = ofCode;                                     /* 32b*/  /* 64b*/
+				U32  const mlBits = ML_bits[mlCode];
+																				/* (7)*/  /* (7)*/
+				FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode);       /* 15 */  /* 15 */
+				FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode);      /* 24 */  /* 24 */
+				if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
+				FSE_encodeSymbol(&blockStream, &stateLitLength, llCode);        /* 16 */  /* 33 */
+				if (MEM_32bits() || (ofBits+mlBits+llBits >= 64-7-(LLFSELog+MLFSELog+OffFSELog)))
+					BIT_flushBits(&blockStream);                                /* (7)*/
+				BIT_addBits(&blockStream, sequences[n].litLength, llBits);
+				if (MEM_32bits() && ((llBits+mlBits)>24)) BIT_flushBits(&blockStream);
+				BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
+				if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
+				if (longOffsets) {
+					int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+					if (extraBits) {
+						BIT_addBits(&blockStream, sequences[n].offset, extraBits);
+						BIT_flushBits(&blockStream);                            /* (7)*/
+					}
+					BIT_addBits(&blockStream, sequences[n].offset >> extraBits,
+								ofBits - extraBits);                            /* 31 */
+				} else {
+					BIT_addBits(&blockStream, sequences[n].offset, ofBits);     /* 31 */
+				}
+				BIT_flushBits(&blockStream);                                    /* (7)*/
+		}   }
 
-        FSE_flushCState(&blockStream, &stateMatchLength);
-        FSE_flushCState(&blockStream, &stateOffsetBits);
-        FSE_flushCState(&blockStream, &stateLitLength);
+		FSE_flushCState(&blockStream, &stateMatchLength);
+		FSE_flushCState(&blockStream, &stateOffsetBits);
+		FSE_flushCState(&blockStream, &stateLitLength);
 
-        {   size_t const streamSize = BIT_closeCStream(&blockStream);
-            if (streamSize==0) return ERROR(dstSize_tooSmall);   /* not enough space */
-            op += streamSize;
-    }   }
+		{   size_t const streamSize = BIT_closeCStream(&blockStream);
+			if (streamSize==0) return ERROR(dstSize_tooSmall);   /* not enough space */
+			op += streamSize;
+	}   }
 
-    /* check compressibility */
+	/* check compressibility */
 _check_compressibility:
-    {   size_t const minGain = ZSTD_minGain(srcSize);
-        size_t const maxCSize = srcSize - minGain;
-        if ((size_t)(op-ostart) >= maxCSize) {
-            zc->flagStaticHufTable = HUF_repeat_none;
-            return 0;
-    }   }
+	{   size_t const minGain = ZSTD_minGain(srcSize);
+		size_t const maxCSize = srcSize - minGain;
+		if ((size_t)(op-ostart) >= maxCSize) {
+			zc->flagStaticHufTable = HUF_repeat_none;
+			return 0;
+	}   }
 
-    /* confirm repcodes */
-    { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = zc->repToConfirm[i]; }
+	/* confirm repcodes */
+	{ int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = zc->repToConfirm[i]; }
 
-    return op - ostart;
+	return op - ostart;
 }
 
 #if 0 /* for debug */
@@ -803,37 +803,37 @@ const BYTE* g_start = NULL;
 #endif
 
 /*! ZSTD_storeSeq() :
-    Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
-    `offsetCode` : distance to match, or 0 == repCode.
-    `matchCode` : matchLength - MINMATCH
+	Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
+	`offsetCode` : distance to match, or 0 == repCode.
+	`matchCode` : matchLength - MINMATCH
 */
 MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const void* literals, U32 offsetCode, size_t matchCode)
 {
 #ifdef STORESEQ_DEBUG
-    if (g_startDebug) {
-        const U32 pos = (U32)((const BYTE*)literals - g_start);
-        if (g_start==NULL) g_start = (const BYTE*)literals;
-        if ((pos > 1895000) && (pos < 1895300))
-            fprintf(stderr, "Cpos %6u :%5u literals & match %3u bytes at distance %6u \n",
-                   pos, (U32)litLength, (U32)matchCode+MINMATCH, (U32)offsetCode);
-    }
+	if (g_startDebug) {
+		const U32 pos = (U32)((const BYTE*)literals - g_start);
+		if (g_start==NULL) g_start = (const BYTE*)literals;
+		if ((pos > 1895000) && (pos < 1895300))
+			fprintf(stderr, "Cpos %6u :%5u literals & match %3u bytes at distance %6u \n",
+				   pos, (U32)litLength, (U32)matchCode+MINMATCH, (U32)offsetCode);
+	}
 #endif
-    /* copy Literals */
-    ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
-    seqStorePtr->lit += litLength;
+	/* copy Literals */
+	ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
+	seqStorePtr->lit += litLength;
 
-    /* literal Length */
-    if (litLength>0xFFFF) { seqStorePtr->longLengthID = 1; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
-    seqStorePtr->sequences[0].litLength = (U16)litLength;
+	/* literal Length */
+	if (litLength>0xFFFF) { seqStorePtr->longLengthID = 1; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+	seqStorePtr->sequences[0].litLength = (U16)litLength;
 
-    /* match offset */
-    seqStorePtr->sequences[0].offset = offsetCode + 1;
+	/* match offset */
+	seqStorePtr->sequences[0].offset = offsetCode + 1;
 
-    /* match Length */
-    if (matchCode>0xFFFF) { seqStorePtr->longLengthID = 2; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
-    seqStorePtr->sequences[0].matchLength = (U16)matchCode;
+	/* match Length */
+	if (matchCode>0xFFFF) { seqStorePtr->longLengthID = 2; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+	seqStorePtr->sequences[0].matchLength = (U16)matchCode;
 
-    seqStorePtr->sequences++;
+	seqStorePtr->sequences++;
 }
 
 
@@ -842,78 +842,78 @@ MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const v
 ***************************************/
 static unsigned ZSTD_NbCommonBytes (register size_t val)
 {
-    if (MEM_isLittleEndian()) {
-        if (MEM_64bits()) {
+	if (MEM_isLittleEndian()) {
+		if (MEM_64bits()) {
 #       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanForward64( &r, (U64)val );
-            return (unsigned)(r>>3);
+			unsigned long r = 0;
+			_BitScanForward64( &r, (U64)val );
+			return (unsigned)(r>>3);
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_ctzll((U64)val) >> 3);
+			return (__builtin_ctzll((U64)val) >> 3);
 #       else
-            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2, 0, 3, 1, 3, 1, 4, 2, 7, 0, 2, 3, 6, 1, 5, 3, 5, 1, 3, 4, 4, 2, 5, 6, 7, 7, 0, 1, 2, 3, 3, 4, 6, 2, 6, 5, 5, 3, 4, 5, 6, 7, 1, 2, 4, 6, 4, 4, 5, 7, 2, 6, 5, 7, 6, 7, 7 };
-            return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
+			static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2, 0, 3, 1, 3, 1, 4, 2, 7, 0, 2, 3, 6, 1, 5, 3, 5, 1, 3, 4, 4, 2, 5, 6, 7, 7, 0, 1, 2, 3, 3, 4, 6, 2, 6, 5, 5, 3, 4, 5, 6, 7, 1, 2, 4, 6, 4, 4, 5, 7, 2, 6, 5, 7, 6, 7, 7 };
+			return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
 #       endif
-        } else { /* 32 bits */
+		} else { /* 32 bits */
 #       if defined(_MSC_VER)
-            unsigned long r=0;
-            _BitScanForward( &r, (U32)val );
-            return (unsigned)(r>>3);
+			unsigned long r=0;
+			_BitScanForward( &r, (U32)val );
+			return (unsigned)(r>>3);
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_ctz((U32)val) >> 3);
+			return (__builtin_ctz((U32)val) >> 3);
 #       else
-            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0, 3, 2, 2, 1, 3, 2, 0, 1, 3, 3, 1, 2, 2, 2, 2, 0, 3, 1, 2, 0, 1, 0, 1, 1 };
-            return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
+			static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0, 3, 2, 2, 1, 3, 2, 0, 1, 3, 3, 1, 2, 2, 2, 2, 0, 3, 1, 2, 0, 1, 0, 1, 1 };
+			return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
 #       endif
-        }
-    } else {  /* Big Endian CPU */
-        if (MEM_64bits()) {
+		}
+	} else {  /* Big Endian CPU */
+		if (MEM_64bits()) {
 #       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanReverse64( &r, val );
-            return (unsigned)(r>>3);
+			unsigned long r = 0;
+			_BitScanReverse64( &r, val );
+			return (unsigned)(r>>3);
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_clzll(val) >> 3);
+			return (__builtin_clzll(val) >> 3);
 #       else
-            unsigned r;
-            const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
-            if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
-            if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
-            r += (!val);
-            return r;
+			unsigned r;
+			const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
+			if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
+			if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
+			r += (!val);
+			return r;
 #       endif
-        } else { /* 32 bits */
+		} else { /* 32 bits */
 #       if defined(_MSC_VER)
-            unsigned long r = 0;
-            _BitScanReverse( &r, (unsigned long)val );
-            return (unsigned)(r>>3);
+			unsigned long r = 0;
+			_BitScanReverse( &r, (unsigned long)val );
+			return (unsigned)(r>>3);
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_clz((U32)val) >> 3);
+			return (__builtin_clz((U32)val) >> 3);
 #       else
-            unsigned r;
-            if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
-            r += (!val);
-            return r;
+			unsigned r;
+			if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
+			r += (!val);
+			return r;
 #       endif
-    }   }
+	}   }
 }
 
 
 static size_t ZSTD_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* const pInLimit)
 {
-    const BYTE* const pStart = pIn;
-    const BYTE* const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
+	const BYTE* const pStart = pIn;
+	const BYTE* const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
 
-    while (pIn < pInLoopLimit) {
-        size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
-        if (!diff) { pIn+=sizeof(size_t); pMatch+=sizeof(size_t); continue; }
-        pIn += ZSTD_NbCommonBytes(diff);
-        return (size_t)(pIn - pStart);
-    }
-    if (MEM_64bits()) if ((pIn<(pInLimit-3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) { pIn+=4; pMatch+=4; }
-    if ((pIn<(pInLimit-1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) { pIn+=2; pMatch+=2; }
-    if ((pIn<pInLimit) && (*pMatch == *pIn)) pIn++;
-    return (size_t)(pIn - pStart);
+	while (pIn < pInLoopLimit) {
+		size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
+		if (!diff) { pIn+=sizeof(size_t); pMatch+=sizeof(size_t); continue; }
+		pIn += ZSTD_NbCommonBytes(diff);
+		return (size_t)(pIn - pStart);
+	}
+	if (MEM_64bits()) if ((pIn<(pInLimit-3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) { pIn+=4; pMatch+=4; }
+	if ((pIn<(pInLimit-1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) { pIn+=2; pMatch+=2; }
+	if ((pIn<pInLimit) && (*pMatch == *pIn)) pIn++;
+	return (size_t)(pIn - pStart);
 }
 
 /** ZSTD_count_2segments() :
@@ -922,10 +922,10 @@ static size_t ZSTD_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* const
 */
 static size_t ZSTD_count_2segments(const BYTE* ip, const BYTE* match, const BYTE* iEnd, const BYTE* mEnd, const BYTE* iStart)
 {
-    const BYTE* const vEnd = MIN( ip + (mEnd - match), iEnd);
-    size_t const matchLength = ZSTD_count(ip, match, vEnd);
-    if (match + matchLength != mEnd) return matchLength;
-    return matchLength + ZSTD_count(ip+matchLength, iStart, iEnd);
+	const BYTE* const vEnd = MIN( ip + (mEnd - match), iEnd);
+	size_t const matchLength = ZSTD_count(ip, match, vEnd);
+	if (match + matchLength != mEnd) return matchLength;
+	return matchLength + ZSTD_count(ip+matchLength, iStart, iEnd);
 }
 
 
@@ -958,16 +958,16 @@ static size_t ZSTD_hash8Ptr(const void* p, U32 h) { return ZSTD_hash8(MEM_readLE
 
 static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
 {
-    switch(mls)
-    {
-    //case 3: return ZSTD_hash3Ptr(p, hBits);
-    default:
-    case 4: return ZSTD_hash4Ptr(p, hBits);
-    case 5: return ZSTD_hash5Ptr(p, hBits);
-    case 6: return ZSTD_hash6Ptr(p, hBits);
-    case 7: return ZSTD_hash7Ptr(p, hBits);
-    case 8: return ZSTD_hash8Ptr(p, hBits);
-    }
+	switch(mls)
+	{
+	//case 3: return ZSTD_hash3Ptr(p, hBits);
+	default:
+	case 4: return ZSTD_hash4Ptr(p, hBits);
+	case 5: return ZSTD_hash5Ptr(p, hBits);
+	case 6: return ZSTD_hash6Ptr(p, hBits);
+	case 7: return ZSTD_hash7Ptr(p, hBits);
+	case 8: return ZSTD_hash8Ptr(p, hBits);
+	}
 }
 
 
@@ -976,238 +976,238 @@ static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
 ***************************************/
 static void ZSTD_fillHashTable (ZSTD_CCtx* zc, const void* end, const U32 mls)
 {
-    U32* const hashTable = zc->hashTable;
-    U32  const hBits = zc->params.cParams.hashLog;
-    const BYTE* const base = zc->base;
-    const BYTE* ip = base + zc->nextToUpdate;
-    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
-    const size_t fastHashFillStep = 3;
+	U32* const hashTable = zc->hashTable;
+	U32  const hBits = zc->params.cParams.hashLog;
+	const BYTE* const base = zc->base;
+	const BYTE* ip = base + zc->nextToUpdate;
+	const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+	const size_t fastHashFillStep = 3;
 
-    while(ip <= iend) {
-        hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-        ip += fastHashFillStep;
-    }
+	while(ip <= iend) {
+		hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
+		ip += fastHashFillStep;
+	}
 }
 
 
 FORCE_INLINE
 void ZSTD_compressBlock_fast_generic(ZSTD_CCtx* cctx,
-                               const void* src, size_t srcSize,
-                               const U32 mls)
+							   const void* src, size_t srcSize,
+							   const U32 mls)
 {
-    U32* const hashTable = cctx->hashTable;
-    U32  const hBits = cctx->params.cParams.hashLog;
-    seqStore_t* seqStorePtr = &(cctx->seqStore);
-    const BYTE* const base = cctx->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = cctx->dictLimit;
-    const BYTE* const lowest = base + lowestIndex;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - HASH_READ_SIZE;
-    U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
-    U32 offsetSaved = 0;
+	U32* const hashTable = cctx->hashTable;
+	U32  const hBits = cctx->params.cParams.hashLog;
+	seqStore_t* seqStorePtr = &(cctx->seqStore);
+	const BYTE* const base = cctx->base;
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const U32   lowestIndex = cctx->dictLimit;
+	const BYTE* const lowest = base + lowestIndex;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - HASH_READ_SIZE;
+	U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
+	U32 offsetSaved = 0;
 
-    /* init */
-    ip += (ip==lowest);
-    {   U32 const maxRep = (U32)(ip-lowest);
-        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
-    }
+	/* init */
+	ip += (ip==lowest);
+	{   U32 const maxRep = (U32)(ip-lowest);
+		if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+		if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+	}
 
-    /* Main Search Loop */
-    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
-        size_t mLength;
-        size_t const h = ZSTD_hashPtr(ip, hBits, mls);
-        U32 const current = (U32)(ip-base);
-        U32 const matchIndex = hashTable[h];
-        const BYTE* match = base + matchIndex;
-        hashTable[h] = current;   /* update hash table */
+	/* Main Search Loop */
+	while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+		size_t mLength;
+		size_t const h = ZSTD_hashPtr(ip, hBits, mls);
+		U32 const current = (U32)(ip-base);
+		U32 const matchIndex = hashTable[h];
+		const BYTE* match = base + matchIndex;
+		hashTable[h] = current;   /* update hash table */
 
-        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
-            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            U32 offset;
-            if ( (matchIndex <= lowestIndex) || (MEM_read32(match) != MEM_read32(ip)) ) {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
-            mLength = ZSTD_count(ip+4, match+4, iend) + 4;
-            offset = (U32)(ip-match);
-            while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
-            offset_2 = offset_1;
-            offset_1 = offset;
+		if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
+			mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+			ip++;
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+		} else {
+			U32 offset;
+			if ( (matchIndex <= lowestIndex) || (MEM_read32(match) != MEM_read32(ip)) ) {
+				ip += ((ip-anchor) >> g_searchStrength) + 1;
+				continue;
+			}
+			mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+			offset = (U32)(ip-match);
+			while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+			offset_2 = offset_1;
+			offset_1 = offset;
 
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+		}
 
-        /* match found */
-        ip += mLength;
-        anchor = ip;
+		/* match found */
+		ip += mLength;
+		anchor = ip;
 
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;  /* here because current+2 could be > iend-8 */
-            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while ( (ip <= ilimit)
-                 && ( (offset_2>0)
-                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
-                /* store sequence */
-                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
-                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; }  /* swap offset_2 <=> offset_1 */
-                hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip-base);
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
-                ip += rLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-    }   }   }
+		if (ip <= ilimit) {
+			/* Fill Table */
+			hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;  /* here because current+2 could be > iend-8 */
+			hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
+			/* check immediate repcode */
+			while ( (ip <= ilimit)
+				 && ( (offset_2>0)
+				 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+				/* store sequence */
+				size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+				{ U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; }  /* swap offset_2 <=> offset_1 */
+				hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip-base);
+				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
+				ip += rLength;
+				anchor = ip;
+				continue;   /* faster when present ... (?) */
+	}   }   }
 
-    /* save reps for next block */
-    cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-    cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
+	/* save reps for next block */
+	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
+	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 static void ZSTD_compressBlock_fast(ZSTD_CCtx* ctx,
-                       const void* src, size_t srcSize)
+					   const void* src, size_t srcSize)
 {
-    const U32 mls = ctx->params.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
-    case 5 :
-        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5); return;
-    case 6 :
-        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6); return;
-    case 7 :
-        ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7); return;
-    }
+	const U32 mls = ctx->params.cParams.searchLength;
+	switch(mls)
+	{
+	default: /* includes case 3 */
+	case 4 :
+		ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
+	case 5 :
+		ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5); return;
+	case 6 :
+		ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6); return;
+	case 7 :
+		ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7); return;
+	}
 }
 
 
 static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
+								 const void* src, size_t srcSize,
+								 const U32 mls)
 {
-    U32* hashTable = ctx->hashTable;
-    const U32 hBits = ctx->params.cParams.hashLog;
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const base = ctx->base;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = ctx->lowLimit;
-    const BYTE* const dictStart = dictBase + lowestIndex;
-    const U32   dictLimit = ctx->dictLimit;
-    const BYTE* const lowPrefixPtr = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
+	U32* hashTable = ctx->hashTable;
+	const U32 hBits = ctx->params.cParams.hashLog;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const base = ctx->base;
+	const BYTE* const dictBase = ctx->dictBase;
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const U32   lowestIndex = ctx->lowLimit;
+	const BYTE* const dictStart = dictBase + lowestIndex;
+	const U32   dictLimit = ctx->dictLimit;
+	const BYTE* const lowPrefixPtr = base + dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
 
-    /* Search Loop */
-    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
-        const size_t h = ZSTD_hashPtr(ip, hBits, mls);
-        const U32 matchIndex = hashTable[h];
-        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
-        const BYTE* match = matchBase + matchIndex;
-        const U32 current = (U32)(ip-base);
-        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
-        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
-        const BYTE* repMatch = repBase + repIndex;
-        size_t mLength;
-        hashTable[h] = current;   /* update hash table */
+	/* Search Loop */
+	while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+		const size_t h = ZSTD_hashPtr(ip, hBits, mls);
+		const U32 matchIndex = hashTable[h];
+		const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
+		const BYTE* match = matchBase + matchIndex;
+		const U32 current = (U32)(ip-base);
+		const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
+		const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
+		const BYTE* repMatch = repBase + repIndex;
+		size_t mLength;
+		hashTable[h] = current;   /* update hash table */
 
-        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
-           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
-            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-            mLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            if ( (matchIndex < lowestIndex) ||
-                 (MEM_read32(match) != MEM_read32(ip)) ) {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
-            {   const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-                const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-                U32 offset;
-                mLength = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
-                while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
-                offset = current - matchIndex;
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }   }
+		if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
+		   && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+			const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
+			mLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
+			ip++;
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+		} else {
+			if ( (matchIndex < lowestIndex) ||
+				 (MEM_read32(match) != MEM_read32(ip)) ) {
+				ip += ((ip-anchor) >> g_searchStrength) + 1;
+				continue;
+			}
+			{   const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
+				const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
+				U32 offset;
+				mLength = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
+				while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+				offset = current - matchIndex;
+				offset_2 = offset_1;
+				offset_1 = offset;
+				ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+		}   }
 
-        /* found a match : store it */
-        ip += mLength;
-        anchor = ip;
+		/* found a match : store it */
+		ip += mLength;
+		anchor = ip;
 
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;
-            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while (ip <= ilimit) {
-                U32 const current2 = (U32)(ip-base);
-                U32 const repIndex2 = current2 - offset_2;
-                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
-                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
-                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
-                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
-                    hashTable[ZSTD_hashPtr(ip, hBits, mls)] = current2;
-                    ip += repLength2;
-                    anchor = ip;
-                    continue;
-                }
-                break;
-    }   }   }
+		if (ip <= ilimit) {
+			/* Fill Table */
+			hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;
+			hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
+			/* check immediate repcode */
+			while (ip <= ilimit) {
+				U32 const current2 = (U32)(ip-base);
+				U32 const repIndex2 = current2 - offset_2;
+				const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
+				if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
+				   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+					const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
+					size_t repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+					U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
+					hashTable[ZSTD_hashPtr(ip, hBits, mls)] = current2;
+					ip += repLength2;
+					anchor = ip;
+					continue;
+				}
+				break;
+	}   }   }
 
-    /* save reps for next block */
-    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+	/* save reps for next block */
+	ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize)
+						 const void* src, size_t srcSize)
 {
-    U32 const mls = ctx->params.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
-    case 5 :
-        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5); return;
-    case 6 :
-        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6); return;
-    case 7 :
-        ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7); return;
-    }
+	U32 const mls = ctx->params.cParams.searchLength;
+	switch(mls)
+	{
+	default: /* includes case 3 */
+	case 4 :
+		ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
+	case 5 :
+		ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5); return;
+	case 6 :
+		ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6); return;
+	case 7 :
+		ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7); return;
+	}
 }
 
 
@@ -1216,302 +1216,302 @@ static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
 ***************************************/
 static void ZSTD_fillDoubleHashTable (ZSTD_CCtx* cctx, const void* end, const U32 mls)
 {
-    U32* const hashLarge = cctx->hashTable;
-    U32  const hBitsL = cctx->params.cParams.hashLog;
-    U32* const hashSmall = cctx->chainTable;
-    U32  const hBitsS = cctx->params.cParams.chainLog;
-    const BYTE* const base = cctx->base;
-    const BYTE* ip = base + cctx->nextToUpdate;
-    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
-    const size_t fastHashFillStep = 3;
+	U32* const hashLarge = cctx->hashTable;
+	U32  const hBitsL = cctx->params.cParams.hashLog;
+	U32* const hashSmall = cctx->chainTable;
+	U32  const hBitsS = cctx->params.cParams.chainLog;
+	const BYTE* const base = cctx->base;
+	const BYTE* ip = base + cctx->nextToUpdate;
+	const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+	const size_t fastHashFillStep = 3;
 
-    while(ip <= iend) {
-        hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-        hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-        ip += fastHashFillStep;
-    }
+	while(ip <= iend) {
+		hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
+		hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
+		ip += fastHashFillStep;
+	}
 }
 
 
 FORCE_INLINE
 void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
+								 const void* src, size_t srcSize,
+								 const U32 mls)
 {
-    U32* const hashLong = cctx->hashTable;
-    const U32 hBitsL = cctx->params.cParams.hashLog;
-    U32* const hashSmall = cctx->chainTable;
-    const U32 hBitsS = cctx->params.cParams.chainLog;
-    seqStore_t* seqStorePtr = &(cctx->seqStore);
-    const BYTE* const base = cctx->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32 lowestIndex = cctx->dictLimit;
-    const BYTE* const lowest = base + lowestIndex;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - HASH_READ_SIZE;
-    U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
-    U32 offsetSaved = 0;
+	U32* const hashLong = cctx->hashTable;
+	const U32 hBitsL = cctx->params.cParams.hashLog;
+	U32* const hashSmall = cctx->chainTable;
+	const U32 hBitsS = cctx->params.cParams.chainLog;
+	seqStore_t* seqStorePtr = &(cctx->seqStore);
+	const BYTE* const base = cctx->base;
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const U32 lowestIndex = cctx->dictLimit;
+	const BYTE* const lowest = base + lowestIndex;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - HASH_READ_SIZE;
+	U32 offset_1=cctx->rep[0], offset_2=cctx->rep[1];
+	U32 offsetSaved = 0;
 
-    /* init */
-    ip += (ip==lowest);
-    {   U32 const maxRep = (U32)(ip-lowest);
-        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
-    }
+	/* init */
+	ip += (ip==lowest);
+	{   U32 const maxRep = (U32)(ip-lowest);
+		if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+		if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+	}
 
-    /* Main Search Loop */
-    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
-        size_t mLength;
-        size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
-        size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
-        U32 const current = (U32)(ip-base);
-        U32 const matchIndexL = hashLong[h2];
-        U32 const matchIndexS = hashSmall[h];
-        const BYTE* matchLong = base + matchIndexL;
-        const BYTE* match = base + matchIndexS;
-        hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
+	/* Main Search Loop */
+	while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+		size_t mLength;
+		size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
+		size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
+		U32 const current = (U32)(ip-base);
+		U32 const matchIndexL = hashLong[h2];
+		U32 const matchIndexS = hashSmall[h];
+		const BYTE* matchLong = base + matchIndexL;
+		const BYTE* match = base + matchIndexS;
+		hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
 
-        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) { /* note : by construction, offset_1 <= current */
-            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            U32 offset;
-            if ( (matchIndexL > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip)) ) {
-                mLength = ZSTD_count(ip+8, matchLong+8, iend) + 8;
-                offset = (U32)(ip-matchLong);
-                while (((ip>anchor) & (matchLong>lowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
-            } else if ( (matchIndexS > lowestIndex) && (MEM_read32(match) == MEM_read32(ip)) ) {
-                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
-                U32 const matchIndex3 = hashLong[h3];
-                const BYTE* match3 = base + matchIndex3;
-                hashLong[h3] = current + 1;
-                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
-                    mLength = ZSTD_count(ip+9, match3+8, iend) + 8;
-                    ip++;
-                    offset = (U32)(ip-match3);
-                    while (((ip>anchor) & (match3>lowest)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
-                } else {
-                    mLength = ZSTD_count(ip+4, match+4, iend) + 4;
-                    offset = (U32)(ip-match);
-                    while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
-                }
-            } else {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
+		if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) { /* note : by construction, offset_1 <= current */
+			mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+			ip++;
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+		} else {
+			U32 offset;
+			if ( (matchIndexL > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip)) ) {
+				mLength = ZSTD_count(ip+8, matchLong+8, iend) + 8;
+				offset = (U32)(ip-matchLong);
+				while (((ip>anchor) & (matchLong>lowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
+			} else if ( (matchIndexS > lowestIndex) && (MEM_read32(match) == MEM_read32(ip)) ) {
+				size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+				U32 const matchIndex3 = hashLong[h3];
+				const BYTE* match3 = base + matchIndex3;
+				hashLong[h3] = current + 1;
+				if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
+					mLength = ZSTD_count(ip+9, match3+8, iend) + 8;
+					ip++;
+					offset = (U32)(ip-match3);
+					while (((ip>anchor) & (match3>lowest)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+				} else {
+					mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+					offset = (U32)(ip-match);
+					while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+				}
+			} else {
+				ip += ((ip-anchor) >> g_searchStrength) + 1;
+				continue;
+			}
 
-            offset_2 = offset_1;
-            offset_1 = offset;
+			offset_2 = offset_1;
+			offset_1 = offset;
 
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+		}
 
-        /* match found */
-        ip += mLength;
-        anchor = ip;
+		/* match found */
+		ip += mLength;
+		anchor = ip;
 
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] =
-                hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;  /* here because current+2 could be > iend-8 */
-            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] =
-                hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
+		if (ip <= ilimit) {
+			/* Fill Table */
+			hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] =
+				hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;  /* here because current+2 could be > iend-8 */
+			hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] =
+				hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
 
-            /* check immediate repcode */
-            while ( (ip <= ilimit)
-                 && ( (offset_2>0)
-                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
-                /* store sequence */
-                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
-                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; } /* swap offset_2 <=> offset_1 */
-                hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip-base);
-                hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip-base);
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
-                ip += rLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-    }   }   }
+			/* check immediate repcode */
+			while ( (ip <= ilimit)
+				 && ( (offset_2>0)
+				 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+				/* store sequence */
+				size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+				{ U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; } /* swap offset_2 <=> offset_1 */
+				hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip-base);
+				hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip-base);
+				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
+				ip += rLength;
+				anchor = ip;
+				continue;   /* faster when present ... (?) */
+	}   }   }
 
-    /* save reps for next block */
-    cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-    cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
+	/* save reps for next block */
+	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
+	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 static void ZSTD_compressBlock_doubleFast(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    const U32 mls = ctx->params.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
-    case 5 :
-        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5); return;
-    case 6 :
-        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6); return;
-    case 7 :
-        ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7); return;
-    }
+	const U32 mls = ctx->params.cParams.searchLength;
+	switch(mls)
+	{
+	default: /* includes case 3 */
+	case 4 :
+		ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
+	case 5 :
+		ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5); return;
+	case 6 :
+		ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6); return;
+	case 7 :
+		ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7); return;
+	}
 }
 
 
 static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx* ctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
+								 const void* src, size_t srcSize,
+								 const U32 mls)
 {
-    U32* const hashLong = ctx->hashTable;
-    U32  const hBitsL = ctx->params.cParams.hashLog;
-    U32* const hashSmall = ctx->chainTable;
-    U32  const hBitsS = ctx->params.cParams.chainLog;
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const base = ctx->base;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = ctx->lowLimit;
-    const BYTE* const dictStart = dictBase + lowestIndex;
-    const U32   dictLimit = ctx->dictLimit;
-    const BYTE* const lowPrefixPtr = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
+	U32* const hashLong = ctx->hashTable;
+	U32  const hBitsL = ctx->params.cParams.hashLog;
+	U32* const hashSmall = ctx->chainTable;
+	U32  const hBitsS = ctx->params.cParams.chainLog;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const base = ctx->base;
+	const BYTE* const dictBase = ctx->dictBase;
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const U32   lowestIndex = ctx->lowLimit;
+	const BYTE* const dictStart = dictBase + lowestIndex;
+	const U32   dictLimit = ctx->dictLimit;
+	const BYTE* const lowPrefixPtr = base + dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	U32 offset_1=ctx->rep[0], offset_2=ctx->rep[1];
 
-    /* Search Loop */
-    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
-        const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
-        const U32 matchIndex = hashSmall[hSmall];
-        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
-        const BYTE* match = matchBase + matchIndex;
+	/* Search Loop */
+	while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+		const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
+		const U32 matchIndex = hashSmall[hSmall];
+		const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
+		const BYTE* match = matchBase + matchIndex;
 
-        const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
-        const U32 matchLongIndex = hashLong[hLong];
-        const BYTE* matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
-        const BYTE* matchLong = matchLongBase + matchLongIndex;
+		const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
+		const U32 matchLongIndex = hashLong[hLong];
+		const BYTE* matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
+		const BYTE* matchLong = matchLongBase + matchLongIndex;
 
-        const U32 current = (U32)(ip-base);
-        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
-        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
-        const BYTE* repMatch = repBase + repIndex;
-        size_t mLength;
-        hashSmall[hSmall] = hashLong[hLong] = current;   /* update hash table */
+		const U32 current = (U32)(ip-base);
+		const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
+		const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
+		const BYTE* repMatch = repBase + repIndex;
+		size_t mLength;
+		hashSmall[hSmall] = hashLong[hLong] = current;   /* update hash table */
 
-        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
-           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
-            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            if ((matchLongIndex > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip))) {
-                const BYTE* matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
-                const BYTE* lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
-                U32 offset;
-                mLength = ZSTD_count_2segments(ip+8, matchLong+8, iend, matchEnd, lowPrefixPtr) + 8;
-                offset = current - matchLongIndex;
-                while (((ip>anchor) & (matchLong>lowMatchPtr)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; }   /* catch up */
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+		if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
+		   && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+			const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
+			mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
+			ip++;
+			ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
+		} else {
+			if ((matchLongIndex > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip))) {
+				const BYTE* matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
+				const BYTE* lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
+				U32 offset;
+				mLength = ZSTD_count_2segments(ip+8, matchLong+8, iend, matchEnd, lowPrefixPtr) + 8;
+				offset = current - matchLongIndex;
+				while (((ip>anchor) & (matchLong>lowMatchPtr)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; }   /* catch up */
+				offset_2 = offset_1;
+				offset_1 = offset;
+				ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
 
-            } else if ((matchIndex > lowestIndex) && (MEM_read32(match) == MEM_read32(ip))) {
-                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
-                U32 const matchIndex3 = hashLong[h3];
-                const BYTE* const match3Base = matchIndex3 < dictLimit ? dictBase : base;
-                const BYTE* match3 = match3Base + matchIndex3;
-                U32 offset;
-                hashLong[h3] = current + 1;
-                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
-                    const BYTE* matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
-                    const BYTE* lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
-                    mLength = ZSTD_count_2segments(ip+9, match3+8, iend, matchEnd, lowPrefixPtr) + 8;
-                    ip++;
-                    offset = current+1 - matchIndex3;
-                    while (((ip>anchor) & (match3>lowMatchPtr)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
-                } else {
-                    const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-                    const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-                    mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
-                    offset = current - matchIndex;
-                    while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
-                }
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+			} else if ((matchIndex > lowestIndex) && (MEM_read32(match) == MEM_read32(ip))) {
+				size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+				U32 const matchIndex3 = hashLong[h3];
+				const BYTE* const match3Base = matchIndex3 < dictLimit ? dictBase : base;
+				const BYTE* match3 = match3Base + matchIndex3;
+				U32 offset;
+				hashLong[h3] = current + 1;
+				if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
+					const BYTE* matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
+					const BYTE* lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
+					mLength = ZSTD_count_2segments(ip+9, match3+8, iend, matchEnd, lowPrefixPtr) + 8;
+					ip++;
+					offset = current+1 - matchIndex3;
+					while (((ip>anchor) & (match3>lowMatchPtr)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+				} else {
+					const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
+					const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
+					mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
+					offset = current - matchIndex;
+					while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+				}
+				offset_2 = offset_1;
+				offset_1 = offset;
+				ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
 
-            } else {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-        }   }
+			} else {
+				ip += ((ip-anchor) >> g_searchStrength) + 1;
+				continue;
+		}   }
 
-        /* found a match : store it */
-        ip += mLength;
-        anchor = ip;
+		/* found a match : store it */
+		ip += mLength;
+		anchor = ip;
 
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
-            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
-            hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
-            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while (ip <= ilimit) {
-                U32 const current2 = (U32)(ip-base);
-                U32 const repIndex2 = current2 - offset_2;
-                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
-                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
-                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t const repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
-                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
-                    hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
-                    hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
-                    ip += repLength2;
-                    anchor = ip;
-                    continue;
-                }
-                break;
-    }   }   }
+		if (ip <= ilimit) {
+			/* Fill Table */
+			hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
+			hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
+			hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
+			hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
+			/* check immediate repcode */
+			while (ip <= ilimit) {
+				U32 const current2 = (U32)(ip-base);
+				U32 const repIndex2 = current2 - offset_2;
+				const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
+				if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
+				   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+					const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
+					size_t const repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+					U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
+					hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
+					hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
+					ip += repLength2;
+					anchor = ip;
+					continue;
+				}
+				break;
+	}   }   }
 
-    /* save reps for next block */
-    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+	/* save reps for next block */
+	ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize)
+						 const void* src, size_t srcSize)
 {
-    U32 const mls = ctx->params.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
-    case 5 :
-        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5); return;
-    case 6 :
-        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6); return;
-    case 7 :
-        ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7); return;
-    }
+	U32 const mls = ctx->params.cParams.searchLength;
+	switch(mls)
+	{
+	default: /* includes case 3 */
+	case 4 :
+		ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
+	case 5 :
+		ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5); return;
+	case 6 :
+		ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6); return;
+	case 7 :
+		ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7); return;
+	}
 }
 
 
@@ -1522,262 +1522,262 @@ static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx,
 *   ip : assumed <= iend-8 .
 *   @return : nb of positions added */
 static U32 ZSTD_insertBt1(ZSTD_CCtx* zc, const BYTE* const ip, const U32 mls, const BYTE* const iend, U32 nbCompares,
-                          U32 extDict)
+						  U32 extDict)
 {
-    U32*   const hashTable = zc->hashTable;
-    U32    const hashLog = zc->params.cParams.hashLog;
-    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32*   const bt = zc->chainTable;
-    U32    const btLog  = zc->params.cParams.chainLog - 1;
-    U32    const btMask = (1 << btLog) - 1;
-    U32 matchIndex = hashTable[h];
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* match;
-    const U32 current = (U32)(ip-base);
-    const U32 btLow = btMask >= current ? 0 : current - btMask;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = smallerPtr + 1;
-    U32 dummy32;   /* to be nullified at the end */
-    U32 const windowLow = zc->lowLimit;
-    U32 matchEndIdx = current+8;
-    size_t bestLength = 8;
+	U32*   const hashTable = zc->hashTable;
+	U32    const hashLog = zc->params.cParams.hashLog;
+	size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+	U32*   const bt = zc->chainTable;
+	U32    const btLog  = zc->params.cParams.chainLog - 1;
+	U32    const btMask = (1 << btLog) - 1;
+	U32 matchIndex = hashTable[h];
+	size_t commonLengthSmaller=0, commonLengthLarger=0;
+	const BYTE* const base = zc->base;
+	const BYTE* const dictBase = zc->dictBase;
+	const U32 dictLimit = zc->dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const BYTE* match;
+	const U32 current = (U32)(ip-base);
+	const U32 btLow = btMask >= current ? 0 : current - btMask;
+	U32* smallerPtr = bt + 2*(current&btMask);
+	U32* largerPtr  = smallerPtr + 1;
+	U32 dummy32;   /* to be nullified at the end */
+	U32 const windowLow = zc->lowLimit;
+	U32 matchEndIdx = current+8;
+	size_t bestLength = 8;
 #ifdef ZSTD_C_PREDICT
-    U32 predictedSmall = *(bt + 2*((current-1)&btMask) + 0);
-    U32 predictedLarge = *(bt + 2*((current-1)&btMask) + 1);
-    predictedSmall += (predictedSmall>0);
-    predictedLarge += (predictedLarge>0);
+	U32 predictedSmall = *(bt + 2*((current-1)&btMask) + 0);
+	U32 predictedLarge = *(bt + 2*((current-1)&btMask) + 1);
+	predictedSmall += (predictedSmall>0);
+	predictedLarge += (predictedLarge>0);
 #endif /* ZSTD_C_PREDICT */
 
-    hashTable[h] = current;   /* Update Hash Table */
+	hashTable[h] = current;   /* Update Hash Table */
 
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* const nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+	while (nbCompares-- && (matchIndex > windowLow)) {
+		U32* const nextPtr = bt + 2*(matchIndex & btMask);
+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
 
 #ifdef ZSTD_C_PREDICT   /* note : can create issues when hlog small <= 11 */
-        const U32* predictPtr = bt + 2*((matchIndex-1) & btMask);   /* written this way, as bt is a roll buffer */
-        if (matchIndex == predictedSmall) {
-            /* no need to check length, result known */
-            *smallerPtr = matchIndex;
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-            predictedSmall = predictPtr[1] + (predictPtr[1]>0);
-            continue;
-        }
-        if (matchIndex == predictedLarge) {
-            *largerPtr = matchIndex;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-            predictedLarge = predictPtr[0] + (predictPtr[0]>0);
-            continue;
-        }
+		const U32* predictPtr = bt + 2*((matchIndex-1) & btMask);   /* written this way, as bt is a roll buffer */
+		if (matchIndex == predictedSmall) {
+			/* no need to check length, result known */
+			*smallerPtr = matchIndex;
+			if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+			matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+			predictedSmall = predictPtr[1] + (predictPtr[1]>0);
+			continue;
+		}
+		if (matchIndex == predictedLarge) {
+			*largerPtr = matchIndex;
+			if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			largerPtr = nextPtr;
+			matchIndex = nextPtr[0];
+			predictedLarge = predictPtr[0] + (predictPtr[0]>0);
+			continue;
+		}
 #endif
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            match = base + matchIndex;
-            if (match[matchLength] == ip[matchLength])
-                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
-        }
+		if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+			match = base + matchIndex;
+			if (match[matchLength] == ip[matchLength])
+				matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
+		} else {
+			match = dictBase + matchIndex;
+			matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+			if (matchIndex+matchLength >= dictLimit)
+				match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+		}
 
-        if (matchLength > bestLength) {
-            bestLength = matchLength;
-            if (matchLength > matchEndIdx - matchIndex)
-                matchEndIdx = matchIndex + (U32)matchLength;
-        }
+		if (matchLength > bestLength) {
+			bestLength = matchLength;
+			if (matchLength > matchEndIdx - matchIndex)
+				matchEndIdx = matchIndex + (U32)matchLength;
+		}
 
-        if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
-            break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
+		if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
+			break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
 
-        if (match[matchLength] < ip[matchLength]) {  /* necessarily within correct buffer */
-            /* match is smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-        } else {
-            /* match is larger than current */
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
+		if (match[matchLength] < ip[matchLength]) {  /* necessarily within correct buffer */
+			/* match is smaller than current */
+			*smallerPtr = matchIndex;             /* update smaller idx */
+			commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+			if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+			matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+		} else {
+			/* match is larger than current */
+			*largerPtr = matchIndex;
+			commonLengthLarger = matchLength;
+			if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			largerPtr = nextPtr;
+			matchIndex = nextPtr[0];
+	}   }
 
-    *smallerPtr = *largerPtr = 0;
-    if (bestLength > 384) return MIN(192, (U32)(bestLength - 384));   /* speed optimization */
-    if (matchEndIdx > current + 8) return matchEndIdx - current - 8;
-    return 1;
+	*smallerPtr = *largerPtr = 0;
+	if (bestLength > 384) return MIN(192, (U32)(bestLength - 384));   /* speed optimization */
+	if (matchEndIdx > current + 8) return matchEndIdx - current - 8;
+	return 1;
 }
 
 
 static size_t ZSTD_insertBtAndFindBestMatch (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iend,
-                        size_t* offsetPtr,
-                        U32 nbCompares, const U32 mls,
-                        U32 extDict)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iend,
+						size_t* offsetPtr,
+						U32 nbCompares, const U32 mls,
+						U32 extDict)
 {
-    U32*   const hashTable = zc->hashTable;
-    U32    const hashLog = zc->params.cParams.hashLog;
-    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32*   const bt = zc->chainTable;
-    U32    const btLog  = zc->params.cParams.chainLog - 1;
-    U32    const btMask = (1 << btLog) - 1;
-    U32 matchIndex  = hashTable[h];
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const U32 current = (U32)(ip-base);
-    const U32 btLow = btMask >= current ? 0 : current - btMask;
-    const U32 windowLow = zc->lowLimit;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = bt + 2*(current&btMask) + 1;
-    U32 matchEndIdx = current+8;
-    U32 dummy32;   /* to be nullified at the end */
-    size_t bestLength = 0;
+	U32*   const hashTable = zc->hashTable;
+	U32    const hashLog = zc->params.cParams.hashLog;
+	size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+	U32*   const bt = zc->chainTable;
+	U32    const btLog  = zc->params.cParams.chainLog - 1;
+	U32    const btMask = (1 << btLog) - 1;
+	U32 matchIndex  = hashTable[h];
+	size_t commonLengthSmaller=0, commonLengthLarger=0;
+	const BYTE* const base = zc->base;
+	const BYTE* const dictBase = zc->dictBase;
+	const U32 dictLimit = zc->dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const U32 current = (U32)(ip-base);
+	const U32 btLow = btMask >= current ? 0 : current - btMask;
+	const U32 windowLow = zc->lowLimit;
+	U32* smallerPtr = bt + 2*(current&btMask);
+	U32* largerPtr  = bt + 2*(current&btMask) + 1;
+	U32 matchEndIdx = current+8;
+	U32 dummy32;   /* to be nullified at the end */
+	size_t bestLength = 0;
 
-    hashTable[h] = current;   /* Update Hash Table */
+	hashTable[h] = current;   /* Update Hash Table */
 
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* const nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
-        const BYTE* match;
+	while (nbCompares-- && (matchIndex > windowLow)) {
+		U32* const nextPtr = bt + 2*(matchIndex & btMask);
+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+		const BYTE* match;
 
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            match = base + matchIndex;
-            if (match[matchLength] == ip[matchLength])
-                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
-        }
+		if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+			match = base + matchIndex;
+			if (match[matchLength] == ip[matchLength])
+				matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
+		} else {
+			match = dictBase + matchIndex;
+			matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+			if (matchIndex+matchLength >= dictLimit)
+				match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+		}
 
-        if (matchLength > bestLength) {
-            if (matchLength > matchEndIdx - matchIndex)
-                matchEndIdx = matchIndex + (U32)matchLength;
-            if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
-                bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
-            if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
-                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
-        }
+		if (matchLength > bestLength) {
+			if (matchLength > matchEndIdx - matchIndex)
+				matchEndIdx = matchIndex + (U32)matchLength;
+			if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
+				bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
+			if (ip+matchLength == iend)   /* equal : no way to know if inf or sup */
+				break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+		}
 
-        if (match[matchLength] < ip[matchLength]) {
-            /* match is smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-        } else {
-            /* match is larger than current */
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
+		if (match[matchLength] < ip[matchLength]) {
+			/* match is smaller than current */
+			*smallerPtr = matchIndex;             /* update smaller idx */
+			commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+			if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+			matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+		} else {
+			/* match is larger than current */
+			*largerPtr = matchIndex;
+			commonLengthLarger = matchLength;
+			if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			largerPtr = nextPtr;
+			matchIndex = nextPtr[0];
+	}   }
 
-    *smallerPtr = *largerPtr = 0;
+	*smallerPtr = *largerPtr = 0;
 
-    zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
-    return bestLength;
+	zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
+	return bestLength;
 }
 
 
 static void ZSTD_updateTree(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls)
 {
-    const BYTE* const base = zc->base;
-    const U32 target = (U32)(ip - base);
-    U32 idx = zc->nextToUpdate;
+	const BYTE* const base = zc->base;
+	const U32 target = (U32)(ip - base);
+	U32 idx = zc->nextToUpdate;
 
-    while(idx < target)
-        idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 0);
+	while(idx < target)
+		idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 0);
 }
 
 /** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
 static size_t ZSTD_BtFindBestMatch (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 mls)
 {
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
+	if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
+	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
 }
 
 
 static size_t ZSTD_BtFindBestMatch_selectMLS (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+						ZSTD_CCtx* zc,   /* Index table will be updated */
+						const BYTE* ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 matchLengthSearch)
 {
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-    case 5 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-    case 7 :
-    case 6 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-    }
+	switch(matchLengthSearch)
+	{
+	default : /* includes case 3 */
+	case 4 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
+	case 5 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+	case 7 :
+	case 6 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
+	}
 }
 
 
 static void ZSTD_updateTree_extDict(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls)
 {
-    const BYTE* const base = zc->base;
-    const U32 target = (U32)(ip - base);
-    U32 idx = zc->nextToUpdate;
+	const BYTE* const base = zc->base;
+	const U32 target = (U32)(ip - base);
+	U32 idx = zc->nextToUpdate;
 
-    while (idx < target) idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 1);
+	while (idx < target) idx += ZSTD_insertBt1(zc, base+idx, mls, iend, nbCompares, 1);
 }
 
 
 /** Tree updater, providing best match */
 static size_t ZSTD_BtFindBestMatch_extDict (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 mls)
 {
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
+	if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
+	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
 }
 
 
 static size_t ZSTD_BtFindBestMatch_selectMLS_extDict (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+						ZSTD_CCtx* zc,   /* Index table will be updated */
+						const BYTE* ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 matchLengthSearch)
 {
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-    case 5 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-    case 7 :
-    case 6 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-    }
+	switch(matchLengthSearch)
+	{
+	default : /* includes case 3 */
+	case 4 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
+	case 5 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
+	case 7 :
+	case 6 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
+	}
 }
 
 
@@ -1792,106 +1792,106 @@ static size_t ZSTD_BtFindBestMatch_selectMLS_extDict (
 FORCE_INLINE
 U32 ZSTD_insertAndFindFirstIndex (ZSTD_CCtx* zc, const BYTE* ip, U32 mls)
 {
-    U32* const hashTable  = zc->hashTable;
-    const U32 hashLog = zc->params.cParams.hashLog;
-    U32* const chainTable = zc->chainTable;
-    const U32 chainMask = (1 << zc->params.cParams.chainLog) - 1;
-    const BYTE* const base = zc->base;
-    const U32 target = (U32)(ip - base);
-    U32 idx = zc->nextToUpdate;
+	U32* const hashTable  = zc->hashTable;
+	const U32 hashLog = zc->params.cParams.hashLog;
+	U32* const chainTable = zc->chainTable;
+	const U32 chainMask = (1 << zc->params.cParams.chainLog) - 1;
+	const BYTE* const base = zc->base;
+	const U32 target = (U32)(ip - base);
+	U32 idx = zc->nextToUpdate;
 
-    while(idx < target) { /* catch up */
-        size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
-        NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
-        hashTable[h] = idx;
-        idx++;
-    }
+	while(idx < target) { /* catch up */
+		size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
+		NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
+		hashTable[h] = idx;
+		idx++;
+	}
 
-    zc->nextToUpdate = target;
-    return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
+	zc->nextToUpdate = target;
+	return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
 }
 
 
 
 FORCE_INLINE /* inlining is important to hardwire a hot branch (template emulation) */
 size_t ZSTD_HcFindBestMatch_generic (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls, const U32 extDict)
+						ZSTD_CCtx* zc,   /* Index table will be updated */
+						const BYTE* const ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 mls, const U32 extDict)
 {
-    U32* const chainTable = zc->chainTable;
-    const U32 chainSize = (1 << zc->params.cParams.chainLog);
-    const U32 chainMask = chainSize-1;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const U32 lowLimit = zc->lowLimit;
-    const U32 current = (U32)(ip-base);
-    const U32 minChain = current > chainSize ? current - chainSize : 0;
-    int nbAttempts=maxNbAttempts;
-    size_t ml=EQUAL_READ32-1;
+	U32* const chainTable = zc->chainTable;
+	const U32 chainSize = (1 << zc->params.cParams.chainLog);
+	const U32 chainMask = chainSize-1;
+	const BYTE* const base = zc->base;
+	const BYTE* const dictBase = zc->dictBase;
+	const U32 dictLimit = zc->dictLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const U32 lowLimit = zc->lowLimit;
+	const U32 current = (U32)(ip-base);
+	const U32 minChain = current > chainSize ? current - chainSize : 0;
+	int nbAttempts=maxNbAttempts;
+	size_t ml=EQUAL_READ32-1;
 
-    /* HC4 match finder */
-    U32 matchIndex = ZSTD_insertAndFindFirstIndex (zc, ip, mls);
+	/* HC4 match finder */
+	U32 matchIndex = ZSTD_insertAndFindFirstIndex (zc, ip, mls);
 
-    for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
-        const BYTE* match;
-        size_t currentMl=0;
-        if ((!extDict) || matchIndex >= dictLimit) {
-            match = base + matchIndex;
-            if (match[ml] == ip[ml])   /* potentially better */
-                currentMl = ZSTD_count(ip, match, iLimit);
-        } else {
-            match = dictBase + matchIndex;
-            if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
-                currentMl = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
-        }
+	for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
+		const BYTE* match;
+		size_t currentMl=0;
+		if ((!extDict) || matchIndex >= dictLimit) {
+			match = base + matchIndex;
+			if (match[ml] == ip[ml])   /* potentially better */
+				currentMl = ZSTD_count(ip, match, iLimit);
+		} else {
+			match = dictBase + matchIndex;
+			if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
+				currentMl = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
+		}
 
-        /* save best solution */
-        if (currentMl > ml) { ml = currentMl; *offsetPtr = current - matchIndex + ZSTD_REP_MOVE; if (ip+currentMl == iLimit) break; /* best possible, and avoid read overflow*/ }
+		/* save best solution */
+		if (currentMl > ml) { ml = currentMl; *offsetPtr = current - matchIndex + ZSTD_REP_MOVE; if (ip+currentMl == iLimit) break; /* best possible, and avoid read overflow*/ }
 
-        if (matchIndex <= minChain) break;
-        matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
-    }
+		if (matchIndex <= minChain) break;
+		matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
+	}
 
-    return ml;
+	return ml;
 }
 
 
 FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS (
-                        ZSTD_CCtx* zc,
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+						ZSTD_CCtx* zc,
+						const BYTE* ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 matchLengthSearch)
 {
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
-    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
-    case 7 :
-    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
-    }
+	switch(matchLengthSearch)
+	{
+	default : /* includes case 3 */
+	case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
+	case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
+	case 7 :
+	case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
+	}
 }
 
 
 FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
-                        ZSTD_CCtx* zc,
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
+						ZSTD_CCtx* zc,
+						const BYTE* ip, const BYTE* const iLimit,
+						size_t* offsetPtr,
+						const U32 maxNbAttempts, const U32 matchLengthSearch)
 {
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
-    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
-    case 7 :
-    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
-    }
+	switch(matchLengthSearch)
+	{
+	default : /* includes case 3 */
+	case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
+	case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
+	case 7 :
+	case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
+	}
 }
 
 
@@ -1900,351 +1900,351 @@ FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
 *********************************/
 FORCE_INLINE
 void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
-                                     const void* src, size_t srcSize,
-                                     const U32 searchMethod, const U32 depth)
+									 const void* src, size_t srcSize,
+									 const U32 searchMethod, const U32 depth)
 {
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base + ctx->dictLimit;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	const BYTE* const base = ctx->base + ctx->dictLimit;
 
-    U32 const maxSearches = 1 << ctx->params.cParams.searchLog;
-    U32 const mls = ctx->params.cParams.searchLength;
+	U32 const maxSearches = 1 << ctx->params.cParams.searchLog;
+	U32 const mls = ctx->params.cParams.searchLength;
 
-    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
-                        size_t* offsetPtr,
-                        U32 maxNbAttempts, U32 matchLengthSearch);
-    searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
-    U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1], savedOffset=0;
+	typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
+						size_t* offsetPtr,
+						U32 maxNbAttempts, U32 matchLengthSearch);
+	searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1], savedOffset=0;
 
-    /* init */
-    ip += (ip==base);
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    {   U32 const maxRep = (U32)(ip-base);
-        if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
-    }
+	/* init */
+	ip += (ip==base);
+	ctx->nextToUpdate3 = ctx->nextToUpdate;
+	{   U32 const maxRep = (U32)(ip-base);
+		if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
+		if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
+	}
 
-    /* Match Loop */
-    while (ip < ilimit) {
-        size_t matchLength=0;
-        size_t offset=0;
-        const BYTE* start=ip+1;
+	/* Match Loop */
+	while (ip < ilimit) {
+		size_t matchLength=0;
+		size_t offset=0;
+		const BYTE* start=ip+1;
 
-        /* check repCode */
-        if ((offset_1>0) & (MEM_read32(ip+1) == MEM_read32(ip+1 - offset_1))) {
-            /* repcode : we take it */
-            matchLength = ZSTD_count(ip+1+EQUAL_READ32, ip+1+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
-            if (depth==0) goto _storeSequence;
-        }
+		/* check repCode */
+		if ((offset_1>0) & (MEM_read32(ip+1) == MEM_read32(ip+1 - offset_1))) {
+			/* repcode : we take it */
+			matchLength = ZSTD_count(ip+1+EQUAL_READ32, ip+1+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+			if (depth==0) goto _storeSequence;
+		}
 
-        /* first search (depth 0) */
-        {   size_t offsetFound = 99999999;
-            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-            if (ml2 > matchLength)
-                matchLength = ml2, start = ip, offset=offsetFound;
-        }
+		/* first search (depth 0) */
+		{   size_t offsetFound = 99999999;
+			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
+			if (ml2 > matchLength)
+				matchLength = ml2, start = ip, offset=offsetFound;
+		}
 
-        if (matchLength < EQUAL_READ32) {
-            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
-            continue;
-        }
+		if (matchLength < EQUAL_READ32) {
+			ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
+			continue;
+		}
 
-        /* let's try to find a better solution */
-        if (depth>=1)
-        while (ip<ilimit) {
-            ip ++;
-            if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                size_t const mlRep = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
-                int const gain2 = (int)(mlRep * 3);
-                int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
-                    matchLength = mlRep, offset = 0, start = ip;
-            }
-            {   size_t offset2=99999999;
-                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-                    matchLength = ml2, offset = offset2, start = ip;
-                    continue;   /* search a better one */
-            }   }
+		/* let's try to find a better solution */
+		if (depth>=1)
+		while (ip<ilimit) {
+			ip ++;
+			if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+				size_t const mlRep = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+				int const gain2 = (int)(mlRep * 3);
+				int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+				if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
+					matchLength = mlRep, offset = 0, start = ip;
+			}
+			{   size_t offset2=99999999;
+				size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+				int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+				int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+				if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+					matchLength = ml2, offset = offset2, start = ip;
+					continue;   /* search a better one */
+			}   }
 
-            /* let's find an even better one */
-            if ((depth==2) && (ip<ilimit)) {
-                ip ++;
-                if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                    size_t const ml2 = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
-                    int const gain2 = (int)(ml2 * 4);
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
-                        matchLength = ml2, offset = 0, start = ip;
-                }
-                {   size_t offset2=99999999;
-                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-                        matchLength = ml2, offset = offset2, start = ip;
-                        continue;
-            }   }   }
-            break;  /* nothing found : store previous solution */
-        }
+			/* let's find an even better one */
+			if ((depth==2) && (ip<ilimit)) {
+				ip ++;
+				if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+					size_t const ml2 = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+					int const gain2 = (int)(ml2 * 4);
+					int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
+						matchLength = ml2, offset = 0, start = ip;
+				}
+				{   size_t offset2=99999999;
+					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+					int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+					int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+						matchLength = ml2, offset = offset2, start = ip;
+						continue;
+			}   }   }
+			break;  /* nothing found : store previous solution */
+		}
 
-        /* catch up */
-        if (offset) {
-            while ((start>anchor) && (start>base+offset-ZSTD_REP_MOVE) && (start[-1] == start[-1-offset+ZSTD_REP_MOVE]))   /* only search for offset within prefix */
-                { start--; matchLength++; }
-            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-        }
+		/* catch up */
+		if (offset) {
+			while ((start>anchor) && (start>base+offset-ZSTD_REP_MOVE) && (start[-1] == start[-1-offset+ZSTD_REP_MOVE]))   /* only search for offset within prefix */
+				{ start--; matchLength++; }
+			offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+		}
 
-        /* store sequence */
+		/* store sequence */
 _storeSequence:
-        {   size_t const litLength = start - anchor;
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
-            anchor = ip = start + matchLength;
-        }
+		{   size_t const litLength = start - anchor;
+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
+			anchor = ip = start + matchLength;
+		}
 
-        /* check immediate repcode */
-        while ( (ip <= ilimit)
-             && ((offset_2>0)
-             & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
-            /* store sequence */
-            matchLength = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_2, iend) + EQUAL_READ32;
-            offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
-            ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
-            ip += matchLength;
-            anchor = ip;
-            continue;   /* faster when present ... (?) */
-    }   }
+		/* check immediate repcode */
+		while ( (ip <= ilimit)
+			 && ((offset_2>0)
+			 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+			/* store sequence */
+			matchLength = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_2, iend) + EQUAL_READ32;
+			offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
+			ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
+			ip += matchLength;
+			anchor = ip;
+			continue;   /* faster when present ... (?) */
+	}   }
 
-    /* Save reps for next block */
-    ctx->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
-    ctx->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
+	/* Save reps for next block */
+	ctx->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
+	ctx->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 static void ZSTD_compressBlock_btlazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2);
+	ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2);
 }
 
 static void ZSTD_compressBlock_lazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2);
+	ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2);
 }
 
 static void ZSTD_compressBlock_lazy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1);
+	ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1);
 }
 
 static void ZSTD_compressBlock_greedy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0);
+	ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0);
 }
 
 
 FORCE_INLINE
 void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
-                                     const void* src, size_t srcSize,
-                                     const U32 searchMethod, const U32 depth)
+									 const void* src, size_t srcSize,
+									 const U32 searchMethod, const U32 depth)
 {
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base;
-    const U32 dictLimit = ctx->dictLimit;
-    const U32 lowestIndex = ctx->lowLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const dictEnd  = dictBase + dictLimit;
-    const BYTE* const dictStart  = dictBase + ctx->lowLimit;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	const BYTE* const base = ctx->base;
+	const U32 dictLimit = ctx->dictLimit;
+	const U32 lowestIndex = ctx->lowLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const BYTE* const dictBase = ctx->dictBase;
+	const BYTE* const dictEnd  = dictBase + dictLimit;
+	const BYTE* const dictStart  = dictBase + ctx->lowLimit;
 
-    const U32 maxSearches = 1 << ctx->params.cParams.searchLog;
-    const U32 mls = ctx->params.cParams.searchLength;
+	const U32 maxSearches = 1 << ctx->params.cParams.searchLog;
+	const U32 mls = ctx->params.cParams.searchLength;
 
-    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
-                        size_t* offsetPtr,
-                        U32 maxNbAttempts, U32 matchLengthSearch);
-    searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
+	typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
+						size_t* offsetPtr,
+						U32 maxNbAttempts, U32 matchLengthSearch);
+	searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
 
-    U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
 
-    /* init */
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    ip += (ip == prefixStart);
+	/* init */
+	ctx->nextToUpdate3 = ctx->nextToUpdate;
+	ip += (ip == prefixStart);
 
-    /* Match Loop */
-    while (ip < ilimit) {
-        size_t matchLength=0;
-        size_t offset=0;
-        const BYTE* start=ip+1;
-        U32 current = (U32)(ip-base);
+	/* Match Loop */
+	while (ip < ilimit) {
+		size_t matchLength=0;
+		size_t offset=0;
+		const BYTE* start=ip+1;
+		U32 current = (U32)(ip-base);
 
-        /* check repCode */
-        {   const U32 repIndex = (U32)(current+1 - offset_1);
-            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-            const BYTE* const repMatch = repBase + repIndex;
-            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))   /* intentional overflow */
-            if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
-                /* repcode detected we should take it */
-                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-                if (depth==0) goto _storeSequence;
-        }   }
+		/* check repCode */
+		{   const U32 repIndex = (U32)(current+1 - offset_1);
+			const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+			const BYTE* const repMatch = repBase + repIndex;
+			if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))   /* intentional overflow */
+			if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
+				/* repcode detected we should take it */
+				const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+				matchLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+				if (depth==0) goto _storeSequence;
+		}   }
 
-        /* first search (depth 0) */
-        {   size_t offsetFound = 99999999;
-            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-            if (ml2 > matchLength)
-                matchLength = ml2, start = ip, offset=offsetFound;
-        }
+		/* first search (depth 0) */
+		{   size_t offsetFound = 99999999;
+			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
+			if (ml2 > matchLength)
+				matchLength = ml2, start = ip, offset=offsetFound;
+		}
 
-         if (matchLength < EQUAL_READ32) {
-            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
-            continue;
-        }
+		 if (matchLength < EQUAL_READ32) {
+			ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
+			continue;
+		}
 
-        /* let's try to find a better solution */
-        if (depth>=1)
-        while (ip<ilimit) {
-            ip ++;
-            current++;
-            /* check repCode */
-            if (offset) {
-                const U32 repIndex = (U32)(current - offset_1);
-                const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-                const BYTE* const repMatch = repBase + repIndex;
-                if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-                if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                    /* repcode detected */
-                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                    size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-                    int const gain2 = (int)(repLength * 3);
-                    int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-                        matchLength = repLength, offset = 0, start = ip;
-            }   }
+		/* let's try to find a better solution */
+		if (depth>=1)
+		while (ip<ilimit) {
+			ip ++;
+			current++;
+			/* check repCode */
+			if (offset) {
+				const U32 repIndex = (U32)(current - offset_1);
+				const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+				const BYTE* const repMatch = repBase + repIndex;
+				if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+				if (MEM_read32(ip) == MEM_read32(repMatch)) {
+					/* repcode detected */
+					const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+					size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+					int const gain2 = (int)(repLength * 3);
+					int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+					if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+						matchLength = repLength, offset = 0, start = ip;
+			}   }
 
-            /* search match, depth 1 */
-            {   size_t offset2=99999999;
-                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-                    matchLength = ml2, offset = offset2, start = ip;
-                    continue;   /* search a better one */
-            }   }
+			/* search match, depth 1 */
+			{   size_t offset2=99999999;
+				size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+				int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+				int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+				if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+					matchLength = ml2, offset = offset2, start = ip;
+					continue;   /* search a better one */
+			}   }
 
-            /* let's find an even better one */
-            if ((depth==2) && (ip<ilimit)) {
-                ip ++;
-                current++;
-                /* check repCode */
-                if (offset) {
-                    const U32 repIndex = (U32)(current - offset_1);
-                    const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-                    const BYTE* const repMatch = repBase + repIndex;
-                    if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-                    if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                        /* repcode detected */
-                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                        size_t repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-                        int gain2 = (int)(repLength * 4);
-                        int gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                        if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-                            matchLength = repLength, offset = 0, start = ip;
-                }   }
+			/* let's find an even better one */
+			if ((depth==2) && (ip<ilimit)) {
+				ip ++;
+				current++;
+				/* check repCode */
+				if (offset) {
+					const U32 repIndex = (U32)(current - offset_1);
+					const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+					const BYTE* const repMatch = repBase + repIndex;
+					if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+					if (MEM_read32(ip) == MEM_read32(repMatch)) {
+						/* repcode detected */
+						const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+						size_t repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+						int gain2 = (int)(repLength * 4);
+						int gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+						if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+							matchLength = repLength, offset = 0, start = ip;
+				}   }
 
-                /* search match, depth 2 */
-                {   size_t offset2=99999999;
-                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-                        matchLength = ml2, offset = offset2, start = ip;
-                        continue;
-            }   }   }
-            break;  /* nothing found : store previous solution */
-        }
+				/* search match, depth 2 */
+				{   size_t offset2=99999999;
+					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
+					int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+					int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+						matchLength = ml2, offset = offset2, start = ip;
+						continue;
+			}   }   }
+			break;  /* nothing found : store previous solution */
+		}
 
-        /* catch up */
-        if (offset) {
-            U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
-            const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
-            const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
-            while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
-            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-        }
+		/* catch up */
+		if (offset) {
+			U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
+			const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
+			const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
+			while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
+			offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+		}
 
-        /* store sequence */
+		/* store sequence */
 _storeSequence:
-        {   size_t const litLength = start - anchor;
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
-            anchor = ip = start + matchLength;
-        }
+		{   size_t const litLength = start - anchor;
+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
+			anchor = ip = start + matchLength;
+		}
 
-        /* check immediate repcode */
-        while (ip <= ilimit) {
-            const U32 repIndex = (U32)((ip-base) - offset_2);
-            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-            const BYTE* const repMatch = repBase + repIndex;
-            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-            if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                /* repcode detected we should take it */
-                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-                offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
-                ip += matchLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-            }
-            break;
-    }   }
+		/* check immediate repcode */
+		while (ip <= ilimit) {
+			const U32 repIndex = (U32)((ip-base) - offset_2);
+			const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+			const BYTE* const repMatch = repBase + repIndex;
+			if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
+			if (MEM_read32(ip) == MEM_read32(repMatch)) {
+				/* repcode detected we should take it */
+				const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+				matchLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+				offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
+				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
+				ip += matchLength;
+				anchor = ip;
+				continue;   /* faster when present ... (?) */
+			}
+			break;
+	}   }
 
-    /* Save reps for next block */
-    ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
+	/* Save reps for next block */
+	ctx->repToConfirm[0] = offset_1; ctx->repToConfirm[1] = offset_2;
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 void ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0);
+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0);
 }
 
 static void ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
 }
 
 static void ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
 }
 
 static void ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
-    ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
 }
 
 
@@ -2254,40 +2254,40 @@ static void ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx* ctx, const void* src,
 static void ZSTD_compressBlock_btopt(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
 #ifdef ZSTD_OPT_H_91842398743
-    ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0);
+	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0);
 #else
-    (void)ctx; (void)src; (void)srcSize;
-    return;
+	(void)ctx; (void)src; (void)srcSize;
+	return;
 #endif
 }
 
 static void ZSTD_compressBlock_btopt2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
 #ifdef ZSTD_OPT_H_91842398743
-    ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 1);
+	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 1);
 #else
-    (void)ctx; (void)src; (void)srcSize;
-    return;
+	(void)ctx; (void)src; (void)srcSize;
+	return;
 #endif
 }
 
 static void ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
 #ifdef ZSTD_OPT_H_91842398743
-    ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 0);
+	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 0);
 #else
-    (void)ctx; (void)src; (void)srcSize;
-    return;
+	(void)ctx; (void)src; (void)srcSize;
+	return;
 #endif
 }
 
 static void ZSTD_compressBlock_btopt2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
 {
 #ifdef ZSTD_OPT_H_91842398743
-    ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 1);
+	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 1);
 #else
-    (void)ctx; (void)src; (void)srcSize;
-    return;
+	(void)ctx; (void)src; (void)srcSize;
+	return;
 #endif
 }
 
@@ -2296,27 +2296,27 @@ typedef void (*ZSTD_blockCompressor) (ZSTD_CCtx* ctx, const void* src, size_t sr
 
 static ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
 {
-    static const ZSTD_blockCompressor blockCompressor[2][8] = {
-        { ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2 },
-        { ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict }
-    };
+	static const ZSTD_blockCompressor blockCompressor[2][8] = {
+		{ ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2 },
+		{ ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict }
+	};
 
-    return blockCompressor[extDict][(U32)strat];
+	return blockCompressor[extDict][(U32)strat];
 }
 
 
 static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
-    const BYTE* const base = zc->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const U32 current = (U32)(istart-base);
-    if (srcSize < MIN_CBLOCK_SIZE+ZSTD_blockHeaderSize+1) return 0;   /* don't even attempt compression below a certain srcSize */
-    ZSTD_resetSeqStore(&(zc->seqStore));
-    if (current > zc->nextToUpdate + 384)
-        zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));   /* update tree not updated after finding very long rep matches */
-    blockCompressor(zc, src, srcSize);
-    return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
+	ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
+	const BYTE* const base = zc->base;
+	const BYTE* const istart = (const BYTE*)src;
+	const U32 current = (U32)(istart-base);
+	if (srcSize < MIN_CBLOCK_SIZE+ZSTD_blockHeaderSize+1) return 0;   /* don't even attempt compression below a certain srcSize */
+	ZSTD_resetSeqStore(&(zc->seqStore));
+	if (current > zc->nextToUpdate + 384)
+		zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));   /* update tree not updated after finding very long rep matches */
+	blockCompressor(zc, src, srcSize);
+	return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
 }
 
 
@@ -2328,183 +2328,183 @@ static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc, void* dst, size_t dstCa
 *   @return : compressed size, or an error code
 */
 static size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
-                                     void* dst, size_t dstCapacity,
-                               const void* src, size_t srcSize,
-                                     U32 lastFrameChunk)
+									 void* dst, size_t dstCapacity,
+							   const void* src, size_t srcSize,
+									 U32 lastFrameChunk)
 {
-    size_t blockSize = cctx->blockSize;
-    size_t remaining = srcSize;
-    const BYTE* ip = (const BYTE*)src;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* op = ostart;
-    U32 const maxDist = 1 << cctx->params.cParams.windowLog;
+	size_t blockSize = cctx->blockSize;
+	size_t remaining = srcSize;
+	const BYTE* ip = (const BYTE*)src;
+	BYTE* const ostart = (BYTE*)dst;
+	BYTE* op = ostart;
+	U32 const maxDist = 1 << cctx->params.cParams.windowLog;
 
-    if (cctx->params.fParams.checksumFlag && srcSize)
-        XXH64_update(&cctx->xxhState, src, srcSize);
+	if (cctx->params.fParams.checksumFlag && srcSize)
+		XXH64_update(&cctx->xxhState, src, srcSize);
 
-    while (remaining) {
-        U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
-        size_t cSize;
+	while (remaining) {
+		U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
+		size_t cSize;
 
-        if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE) return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
-        if (remaining < blockSize) blockSize = remaining;
+		if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE) return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
+		if (remaining < blockSize) blockSize = remaining;
 
-        /* preemptive overflow correction */
-        if (cctx->lowLimit > (3U<<29)) {
-            U32 const cycleMask = (1 << ZSTD_cycleLog(cctx->params.cParams.hashLog, cctx->params.cParams.strategy)) - 1;
-            U32 const current = (U32)(ip - cctx->base);
-            U32 const newCurrent = (current & cycleMask) + (1 << cctx->params.cParams.windowLog);
-            U32 const correction = current - newCurrent;
-            ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_64 <= 30);
-            ZSTD_reduceIndex(cctx, correction);
-            cctx->base += correction;
-            cctx->dictBase += correction;
-            cctx->lowLimit -= correction;
-            cctx->dictLimit -= correction;
-            if (cctx->nextToUpdate < correction) cctx->nextToUpdate = 0;
-            else cctx->nextToUpdate -= correction;
-        }
+		/* preemptive overflow correction */
+		if (cctx->lowLimit > (3U<<29)) {
+			U32 const cycleMask = (1 << ZSTD_cycleLog(cctx->params.cParams.hashLog, cctx->params.cParams.strategy)) - 1;
+			U32 const current = (U32)(ip - cctx->base);
+			U32 const newCurrent = (current & cycleMask) + (1 << cctx->params.cParams.windowLog);
+			U32 const correction = current - newCurrent;
+			ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_64 <= 30);
+			ZSTD_reduceIndex(cctx, correction);
+			cctx->base += correction;
+			cctx->dictBase += correction;
+			cctx->lowLimit -= correction;
+			cctx->dictLimit -= correction;
+			if (cctx->nextToUpdate < correction) cctx->nextToUpdate = 0;
+			else cctx->nextToUpdate -= correction;
+		}
 
-        if ((U32)(ip+blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
-            /* enforce maxDist */
-            U32 const newLowLimit = (U32)(ip+blockSize - cctx->base) - maxDist;
-            if (cctx->lowLimit < newLowLimit) cctx->lowLimit = newLowLimit;
-            if (cctx->dictLimit < cctx->lowLimit) cctx->dictLimit = cctx->lowLimit;
-        }
+		if ((U32)(ip+blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
+			/* enforce maxDist */
+			U32 const newLowLimit = (U32)(ip+blockSize - cctx->base) - maxDist;
+			if (cctx->lowLimit < newLowLimit) cctx->lowLimit = newLowLimit;
+			if (cctx->dictLimit < cctx->lowLimit) cctx->dictLimit = cctx->lowLimit;
+		}
 
-        cSize = ZSTD_compressBlock_internal(cctx, op+ZSTD_blockHeaderSize, dstCapacity-ZSTD_blockHeaderSize, ip, blockSize);
-        if (ZSTD_isError(cSize)) return cSize;
+		cSize = ZSTD_compressBlock_internal(cctx, op+ZSTD_blockHeaderSize, dstCapacity-ZSTD_blockHeaderSize, ip, blockSize);
+		if (ZSTD_isError(cSize)) return cSize;
 
-        if (cSize == 0) {  /* block is not compressible */
-            U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw)<<1) + (U32)(blockSize << 3);
-            if (blockSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
-            MEM_writeLE32(op, cBlockHeader24);   /* no pb, 4th byte will be overwritten */
-            memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
-            cSize = ZSTD_blockHeaderSize+blockSize;
-        } else {
-            U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
-            MEM_writeLE24(op, cBlockHeader24);
-            cSize += ZSTD_blockHeaderSize;
-        }
+		if (cSize == 0) {  /* block is not compressible */
+			U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw)<<1) + (U32)(blockSize << 3);
+			if (blockSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
+			MEM_writeLE32(op, cBlockHeader24);   /* no pb, 4th byte will be overwritten */
+			memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
+			cSize = ZSTD_blockHeaderSize+blockSize;
+		} else {
+			U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
+			MEM_writeLE24(op, cBlockHeader24);
+			cSize += ZSTD_blockHeaderSize;
+		}
 
-        remaining -= blockSize;
-        dstCapacity -= cSize;
-        ip += blockSize;
-        op += cSize;
-    }
+		remaining -= blockSize;
+		dstCapacity -= cSize;
+		ip += blockSize;
+		op += cSize;
+	}
 
-    if (lastFrameChunk && (op>ostart)) cctx->stage = ZSTDcs_ending;
-    return op-ostart;
+	if (lastFrameChunk && (op>ostart)) cctx->stage = ZSTDcs_ending;
+	return op-ostart;
 }
 
 
 static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
-                                    ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
+									ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
 {   BYTE* const op = (BYTE*)dst;
-    U32   const dictIDSizeCode = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
-    U32   const checksumFlag = params.fParams.checksumFlag>0;
-    U32   const windowSize = 1U << params.cParams.windowLog;
-    U32   const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
-    BYTE  const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
-    U32   const fcsCode = params.fParams.contentSizeFlag ?
-                     (pledgedSrcSize>=256) + (pledgedSrcSize>=65536+256) + (pledgedSrcSize>=0xFFFFFFFFU) :   /* 0-3 */
-                      0;
-    BYTE  const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag<<2) + (singleSegment<<5) + (fcsCode<<6) );
-    size_t pos;
+	U32   const dictIDSizeCode = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
+	U32   const checksumFlag = params.fParams.checksumFlag>0;
+	U32   const windowSize = 1U << params.cParams.windowLog;
+	U32   const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
+	BYTE  const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
+	U32   const fcsCode = params.fParams.contentSizeFlag ?
+					 (pledgedSrcSize>=256) + (pledgedSrcSize>=65536+256) + (pledgedSrcSize>=0xFFFFFFFFU) :   /* 0-3 */
+					  0;
+	BYTE  const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag<<2) + (singleSegment<<5) + (fcsCode<<6) );
+	size_t pos;
 
-    if (dstCapacity < ZSTD_frameHeaderSize_max) return ERROR(dstSize_tooSmall);
+	if (dstCapacity < ZSTD_frameHeaderSize_max) return ERROR(dstSize_tooSmall);
 
-    MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
-    op[4] = frameHeaderDecriptionByte; pos=5;
-    if (!singleSegment) op[pos++] = windowLogByte;
-    switch(dictIDSizeCode)
-    {
-        default:   /* impossible */
-        case 0 : break;
-        case 1 : op[pos] = (BYTE)(dictID); pos++; break;
-        case 2 : MEM_writeLE16(op+pos, (U16)dictID); pos+=2; break;
-        case 3 : MEM_writeLE32(op+pos, dictID); pos+=4; break;
-    }
-    switch(fcsCode)
-    {
-        default:   /* impossible */
-        case 0 : if (singleSegment) op[pos++] = (BYTE)(pledgedSrcSize); break;
-        case 1 : MEM_writeLE16(op+pos, (U16)(pledgedSrcSize-256)); pos+=2; break;
-        case 2 : MEM_writeLE32(op+pos, (U32)(pledgedSrcSize)); pos+=4; break;
-        case 3 : MEM_writeLE64(op+pos, (U64)(pledgedSrcSize)); pos+=8; break;
-    }
-    return pos;
+	MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
+	op[4] = frameHeaderDecriptionByte; pos=5;
+	if (!singleSegment) op[pos++] = windowLogByte;
+	switch(dictIDSizeCode)
+	{
+		default:   /* impossible */
+		case 0 : break;
+		case 1 : op[pos] = (BYTE)(dictID); pos++; break;
+		case 2 : MEM_writeLE16(op+pos, (U16)dictID); pos+=2; break;
+		case 3 : MEM_writeLE32(op+pos, dictID); pos+=4; break;
+	}
+	switch(fcsCode)
+	{
+		default:   /* impossible */
+		case 0 : if (singleSegment) op[pos++] = (BYTE)(pledgedSrcSize); break;
+		case 1 : MEM_writeLE16(op+pos, (U16)(pledgedSrcSize-256)); pos+=2; break;
+		case 2 : MEM_writeLE32(op+pos, (U32)(pledgedSrcSize)); pos+=4; break;
+		case 3 : MEM_writeLE64(op+pos, (U64)(pledgedSrcSize)); pos+=8; break;
+	}
+	return pos;
 }
 
 
 static size_t ZSTD_compressContinue_internal (ZSTD_CCtx* cctx,
-                              void* dst, size_t dstCapacity,
-                        const void* src, size_t srcSize,
-                               U32 frame, U32 lastFrameChunk)
+							  void* dst, size_t dstCapacity,
+						const void* src, size_t srcSize,
+							   U32 frame, U32 lastFrameChunk)
 {
-    const BYTE* const ip = (const BYTE*) src;
-    size_t fhSize = 0;
+	const BYTE* const ip = (const BYTE*) src;
+	size_t fhSize = 0;
 
-    if (cctx->stage==ZSTDcs_created) return ERROR(stage_wrong);   /* missing init (ZSTD_compressBegin) */
+	if (cctx->stage==ZSTDcs_created) return ERROR(stage_wrong);   /* missing init (ZSTD_compressBegin) */
 
-    if (frame && (cctx->stage==ZSTDcs_init)) {
-        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, cctx->frameContentSize, cctx->dictID);
-        if (ZSTD_isError(fhSize)) return fhSize;
-        dstCapacity -= fhSize;
-        dst = (char*)dst + fhSize;
-        cctx->stage = ZSTDcs_ongoing;
-    }
+	if (frame && (cctx->stage==ZSTDcs_init)) {
+		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, cctx->frameContentSize, cctx->dictID);
+		if (ZSTD_isError(fhSize)) return fhSize;
+		dstCapacity -= fhSize;
+		dst = (char*)dst + fhSize;
+		cctx->stage = ZSTDcs_ongoing;
+	}
 
-    /* Check if blocks follow each other */
-    if (src != cctx->nextSrc) {
-        /* not contiguous */
-        ptrdiff_t const delta = cctx->nextSrc - ip;
-        cctx->lowLimit = cctx->dictLimit;
-        cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
-        cctx->dictBase = cctx->base;
-        cctx->base -= delta;
-        cctx->nextToUpdate = cctx->dictLimit;
-        if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE) cctx->lowLimit = cctx->dictLimit;   /* too small extDict */
-    }
+	/* Check if blocks follow each other */
+	if (src != cctx->nextSrc) {
+		/* not contiguous */
+		ptrdiff_t const delta = cctx->nextSrc - ip;
+		cctx->lowLimit = cctx->dictLimit;
+		cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
+		cctx->dictBase = cctx->base;
+		cctx->base -= delta;
+		cctx->nextToUpdate = cctx->dictLimit;
+		if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE) cctx->lowLimit = cctx->dictLimit;   /* too small extDict */
+	}
 
-    /* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
-    if ((ip+srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
-        ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
-        U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
-        cctx->lowLimit = lowLimitMax;
-    }
+	/* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
+	if ((ip+srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
+		ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
+		U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
+		cctx->lowLimit = lowLimitMax;
+	}
 
-    cctx->nextSrc = ip + srcSize;
+	cctx->nextSrc = ip + srcSize;
 
-    if (srcSize) {
-        size_t const cSize = frame ?
-                             ZSTD_compress_generic (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
-                             ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize);
-        if (ZSTD_isError(cSize)) return cSize;
-        return cSize + fhSize;
-    } else
-        return fhSize;
+	if (srcSize) {
+		size_t const cSize = frame ?
+							 ZSTD_compress_generic (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
+							 ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize);
+		if (ZSTD_isError(cSize)) return cSize;
+		return cSize + fhSize;
+	} else
+		return fhSize;
 }
 
 
 size_t ZSTD_compressContinue (ZSTD_CCtx* cctx,
-                              void* dst, size_t dstCapacity,
-                        const void* src, size_t srcSize)
+							  void* dst, size_t dstCapacity,
+						const void* src, size_t srcSize)
 {
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
+	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
 }
 
 
 size_t ZSTD_getBlockSizeMax(ZSTD_CCtx* cctx)
 {
-    return MIN (ZSTD_BLOCKSIZE_ABSOLUTEMAX, 1 << cctx->params.cParams.windowLog);
+	return MIN (ZSTD_BLOCKSIZE_ABSOLUTEMAX, 1 << cctx->params.cParams.windowLog);
 }
 
 size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
-    if (srcSize > blockSizeMax) return ERROR(srcSize_wrong);
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
+	size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
+	if (srcSize > blockSizeMax) return ERROR(srcSize_wrong);
+	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
 }
 
 /*! ZSTD_loadDictionaryContent() :
@@ -2512,50 +2512,50 @@ size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const
  */
 static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t srcSize)
 {
-    const BYTE* const ip = (const BYTE*) src;
-    const BYTE* const iend = ip + srcSize;
+	const BYTE* const ip = (const BYTE*) src;
+	const BYTE* const iend = ip + srcSize;
 
-    /* input becomes current prefix */
-    zc->lowLimit = zc->dictLimit;
-    zc->dictLimit = (U32)(zc->nextSrc - zc->base);
-    zc->dictBase = zc->base;
-    zc->base += ip - zc->nextSrc;
-    zc->nextToUpdate = zc->dictLimit;
-    zc->loadedDictEnd = zc->forceWindow ? 0 : (U32)(iend - zc->base);
+	/* input becomes current prefix */
+	zc->lowLimit = zc->dictLimit;
+	zc->dictLimit = (U32)(zc->nextSrc - zc->base);
+	zc->dictBase = zc->base;
+	zc->base += ip - zc->nextSrc;
+	zc->nextToUpdate = zc->dictLimit;
+	zc->loadedDictEnd = zc->forceWindow ? 0 : (U32)(iend - zc->base);
 
-    zc->nextSrc = iend;
-    if (srcSize <= HASH_READ_SIZE) return 0;
+	zc->nextSrc = iend;
+	if (srcSize <= HASH_READ_SIZE) return 0;
 
-    switch(zc->params.cParams.strategy)
-    {
-    case ZSTD_fast:
-        ZSTD_fillHashTable (zc, iend, zc->params.cParams.searchLength);
-        break;
+	switch(zc->params.cParams.strategy)
+	{
+	case ZSTD_fast:
+		ZSTD_fillHashTable (zc, iend, zc->params.cParams.searchLength);
+		break;
 
-    case ZSTD_dfast:
-        ZSTD_fillDoubleHashTable (zc, iend, zc->params.cParams.searchLength);
-        break;
+	case ZSTD_dfast:
+		ZSTD_fillDoubleHashTable (zc, iend, zc->params.cParams.searchLength);
+		break;
 
-    case ZSTD_greedy:
-    case ZSTD_lazy:
-    case ZSTD_lazy2:
-        if (srcSize >= HASH_READ_SIZE)
-            ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->params.cParams.searchLength);
-        break;
+	case ZSTD_greedy:
+	case ZSTD_lazy:
+	case ZSTD_lazy2:
+		if (srcSize >= HASH_READ_SIZE)
+			ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->params.cParams.searchLength);
+		break;
 
-    case ZSTD_btlazy2:
-    case ZSTD_btopt:
-    case ZSTD_btopt2:
-        if (srcSize >= HASH_READ_SIZE)
-            ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
-        break;
+	case ZSTD_btlazy2:
+	case ZSTD_btopt:
+	case ZSTD_btopt2:
+		if (srcSize >= HASH_READ_SIZE)
+			ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
+		break;
 
-    default:
-        return ERROR(GENERIC);   /* strategy doesn't exist; impossible */
-    }
+	default:
+		return ERROR(GENERIC);   /* strategy doesn't exist; impossible */
+	}
 
-    zc->nextToUpdate = (U32)(iend - zc->base);
-    return 0;
+	zc->nextToUpdate = (U32)(iend - zc->base);
+	return 0;
 }
 
 
@@ -2564,12 +2564,12 @@ static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t
    that we may encounter during compression.
    NOTE: This behavior is not standard and could be improved in the future. */
 static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue) {
-    U32 s;
-    if (dictMaxSymbolValue < maxSymbolValue) return ERROR(dictionary_corrupted);
-    for (s = 0; s <= maxSymbolValue; ++s) {
-        if (normalizedCounter[s] == 0) return ERROR(dictionary_corrupted);
-    }
-    return 0;
+	U32 s;
+	if (dictMaxSymbolValue < maxSymbolValue) return ERROR(dictionary_corrupted);
+	for (s = 0; s <= maxSymbolValue; ++s) {
+		if (normalizedCounter[s] == 0) return ERROR(dictionary_corrupted);
+	}
+	return 0;
 }
 
 
@@ -2584,127 +2584,127 @@ static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSym
  */
 static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
 {
-    const BYTE* dictPtr = (const BYTE*)dict;
-    const BYTE* const dictEnd = dictPtr + dictSize;
-    short offcodeNCount[MaxOff+1];
-    unsigned offcodeMaxValue = MaxOff;
-    BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
+	const BYTE* dictPtr = (const BYTE*)dict;
+	const BYTE* const dictEnd = dictPtr + dictSize;
+	short offcodeNCount[MaxOff+1];
+	unsigned offcodeMaxValue = MaxOff;
+	BYTE scratchBuffer[1<<MAX(MLFSELog,LLFSELog)];
 
-    dictPtr += 4;   /* skip magic number */
-    cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
-    dictPtr += 4;
+	dictPtr += 4;   /* skip magic number */
+	cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
+	dictPtr += 4;
 
-    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dictPtr, dictEnd-dictPtr);
-        if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
-        dictPtr += hufHeaderSize;
-    }
+	{   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dictPtr, dictEnd-dictPtr);
+		if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
+		dictPtr += hufHeaderSize;
+	}
 
-    {   unsigned offcodeLog;
-        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
-        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
-        /* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
-        CHECK_E (FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
-        dictPtr += offcodeHeaderSize;
-    }
+	{   unsigned offcodeLog;
+		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
+		if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
+		/* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
+		CHECK_E (FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+		dictPtr += offcodeHeaderSize;
+	}
 
-    {   short matchlengthNCount[MaxML+1];
-        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
-        /* Every match length code must have non-zero probability */
-        CHECK_F (ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
-        CHECK_E (FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
-        dictPtr += matchlengthHeaderSize;
-    }
+	{   short matchlengthNCount[MaxML+1];
+		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
+		if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
+		/* Every match length code must have non-zero probability */
+		CHECK_F (ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
+		CHECK_E (FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+		dictPtr += matchlengthHeaderSize;
+	}
 
-    {   short litlengthNCount[MaxLL+1];
-        unsigned litlengthMaxValue = MaxLL, litlengthLog;
-        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
-        /* Every literal length code must have non-zero probability */
-        CHECK_F (ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
-        CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
-        dictPtr += litlengthHeaderSize;
-    }
+	{   short litlengthNCount[MaxLL+1];
+		unsigned litlengthMaxValue = MaxLL, litlengthLog;
+		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
+		if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
+		/* Every literal length code must have non-zero probability */
+		CHECK_F (ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
+		CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+		dictPtr += litlengthHeaderSize;
+	}
 
-    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
-    cctx->rep[0] = MEM_readLE32(dictPtr+0);
-    cctx->rep[1] = MEM_readLE32(dictPtr+4);
-    cctx->rep[2] = MEM_readLE32(dictPtr+8);
-    dictPtr += 12;
+	if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
+	cctx->rep[0] = MEM_readLE32(dictPtr+0);
+	cctx->rep[1] = MEM_readLE32(dictPtr+4);
+	cctx->rep[2] = MEM_readLE32(dictPtr+8);
+	dictPtr += 12;
 
-    {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
-        U32 offcodeMax = MaxOff;
-        if (dictContentSize <= ((U32)-1) - 128 KB) {
-            U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
-            offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
-        }
-        /* All offset values <= dictContentSize + 128 KB must be representable */
-        CHECK_F (ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
-        /* All repCodes must be <= dictContentSize and != 0*/
-        {   U32 u;
-            for (u=0; u<3; u++) {
-                if (cctx->rep[u] == 0) return ERROR(dictionary_corrupted);
-                if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
-        }   }
+	{   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
+		U32 offcodeMax = MaxOff;
+		if (dictContentSize <= ((U32)-1) - 128 KB) {
+			U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
+			offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
+		}
+		/* All offset values <= dictContentSize + 128 KB must be representable */
+		CHECK_F (ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
+		/* All repCodes must be <= dictContentSize and != 0*/
+		{   U32 u;
+			for (u=0; u<3; u++) {
+				if (cctx->rep[u] == 0) return ERROR(dictionary_corrupted);
+				if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
+		}   }
 
-        cctx->flagStaticTables = 1;
-        cctx->flagStaticHufTable = HUF_repeat_valid;
-        return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
-    }
+		cctx->flagStaticTables = 1;
+		cctx->flagStaticHufTable = HUF_repeat_valid;
+		return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
+	}
 }
 
 /** ZSTD_compress_insertDictionary() :
 *   @return : 0, or an error code */
 static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
 {
-    if ((dict==NULL) || (dictSize<=8)) return 0;
+	if ((dict==NULL) || (dictSize<=8)) return 0;
 
-    /* dict as pure content */
-    if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
-        return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
+	/* dict as pure content */
+	if ((MEM_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
+		return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
 
-    /* dict as zstd dictionary */
-    return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
+	/* dict as zstd dictionary */
+	return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
 }
 
 /*! ZSTD_compressBegin_internal() :
 *   @return : 0, or an error code */
 static size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
-                             const void* dict, size_t dictSize,
-                                   ZSTD_parameters params, U64 pledgedSrcSize)
+							 const void* dict, size_t dictSize,
+								   ZSTD_parameters params, U64 pledgedSrcSize)
 {
-    ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
-    CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
-    return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
+	ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
+	CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
+	return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
 }
 
 
 /*! ZSTD_compressBegin_advanced() :
 *   @return : 0, or an error code */
 size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx,
-                             const void* dict, size_t dictSize,
-                                   ZSTD_parameters params, unsigned long long pledgedSrcSize)
+							 const void* dict, size_t dictSize,
+								   ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
-    /* compression parameters verification and optimization */
-    CHECK_F(ZSTD_checkCParams(params.cParams));
-    return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, pledgedSrcSize);
+	/* compression parameters verification and optimization */
+	CHECK_F(ZSTD_checkCParams(params.cParams));
+	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, pledgedSrcSize);
 }
 
 
 size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel)
 {
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, 0);
+	ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
+	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, 0);
 }
 
 
 size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel)
 {
-    return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel);
+	return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel);
 }
 
 
@@ -2713,194 +2713,194 @@ size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel)
 *   @return : nb of bytes written into dst (or an error code) */
 static size_t ZSTD_writeEpilogue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity)
 {
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* op = ostart;
-    size_t fhSize = 0;
+	BYTE* const ostart = (BYTE*)dst;
+	BYTE* op = ostart;
+	size_t fhSize = 0;
 
-    if (cctx->stage == ZSTDcs_created) return ERROR(stage_wrong);  /* init missing */
+	if (cctx->stage == ZSTDcs_created) return ERROR(stage_wrong);  /* init missing */
 
-    /* special case : empty frame */
-    if (cctx->stage == ZSTDcs_init) {
-        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, 0, 0);
-        if (ZSTD_isError(fhSize)) return fhSize;
-        dstCapacity -= fhSize;
-        op += fhSize;
-        cctx->stage = ZSTDcs_ongoing;
-    }
+	/* special case : empty frame */
+	if (cctx->stage == ZSTDcs_init) {
+		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, 0, 0);
+		if (ZSTD_isError(fhSize)) return fhSize;
+		dstCapacity -= fhSize;
+		op += fhSize;
+		cctx->stage = ZSTDcs_ongoing;
+	}
 
-    if (cctx->stage != ZSTDcs_ending) {
-        /* write one last empty block, make it the "last" block */
-        U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw)<<1) + 0;
-        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
-        MEM_writeLE32(op, cBlockHeader24);
-        op += ZSTD_blockHeaderSize;
-        dstCapacity -= ZSTD_blockHeaderSize;
-    }
+	if (cctx->stage != ZSTDcs_ending) {
+		/* write one last empty block, make it the "last" block */
+		U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw)<<1) + 0;
+		if (dstCapacity<4) return ERROR(dstSize_tooSmall);
+		MEM_writeLE32(op, cBlockHeader24);
+		op += ZSTD_blockHeaderSize;
+		dstCapacity -= ZSTD_blockHeaderSize;
+	}
 
-    if (cctx->params.fParams.checksumFlag) {
-        U32 const checksum = (U32) XXH64_digest(&cctx->xxhState);
-        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
-        MEM_writeLE32(op, checksum);
-        op += 4;
-    }
+	if (cctx->params.fParams.checksumFlag) {
+		U32 const checksum = (U32) XXH64_digest(&cctx->xxhState);
+		if (dstCapacity<4) return ERROR(dstSize_tooSmall);
+		MEM_writeLE32(op, checksum);
+		op += 4;
+	}
 
-    cctx->stage = ZSTDcs_created;  /* return to "created but no init" status */
-    return op-ostart;
+	cctx->stage = ZSTDcs_created;  /* return to "created but no init" status */
+	return op-ostart;
 }
 
 
 size_t ZSTD_compressEnd (ZSTD_CCtx* cctx,
-                         void* dst, size_t dstCapacity,
-                   const void* src, size_t srcSize)
+						 void* dst, size_t dstCapacity,
+				   const void* src, size_t srcSize)
 {
-    size_t endResult;
-    size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
-    if (ZSTD_isError(cSize)) return cSize;
-    endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
-    if (ZSTD_isError(endResult)) return endResult;
-    return cSize + endResult;
+	size_t endResult;
+	size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
+	if (ZSTD_isError(cSize)) return cSize;
+	endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
+	if (ZSTD_isError(endResult)) return endResult;
+	return cSize + endResult;
 }
 
 
 static size_t ZSTD_compress_internal (ZSTD_CCtx* cctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               ZSTD_parameters params)
+							   void* dst, size_t dstCapacity,
+						 const void* src, size_t srcSize,
+						 const void* dict,size_t dictSize,
+							   ZSTD_parameters params)
 {
-    CHECK_F(ZSTD_compressBegin_internal(cctx, dict, dictSize, params, srcSize));
-    return ZSTD_compressEnd(cctx, dst,  dstCapacity, src, srcSize);
+	CHECK_F(ZSTD_compressBegin_internal(cctx, dict, dictSize, params, srcSize));
+	return ZSTD_compressEnd(cctx, dst,  dstCapacity, src, srcSize);
 }
 
 size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               ZSTD_parameters params)
+							   void* dst, size_t dstCapacity,
+						 const void* src, size_t srcSize,
+						 const void* dict,size_t dictSize,
+							   ZSTD_parameters params)
 {
-    CHECK_F(ZSTD_checkCParams(params.cParams));
-    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
+	CHECK_F(ZSTD_checkCParams(params.cParams));
+	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
 }
 
 size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void* dict, size_t dictSize, int compressionLevel)
 {
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, dict ? dictSize : 0);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
+	ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, dict ? dictSize : 0);
+	params.fParams.contentSizeFlag = 1;
+	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
 }
 
 size_t ZSTD_compressCCtx (ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
 {
-    return ZSTD_compress_usingDict(ctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
+	return ZSTD_compress_usingDict(ctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
 }
 
 size_t ZSTD_compress(void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
 {
-    size_t result;
-    ZSTD_CCtx ctxBody;
-    memset(&ctxBody, 0, sizeof(ctxBody));
-    memcpy(&ctxBody.customMem, &defaultCustomMem, sizeof(ZSTD_customMem));
-    result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
-    ZSTD_free(ctxBody.workSpace, defaultCustomMem);  /* can't free ctxBody itself, as it's on stack; free only heap content */
-    return result;
+	size_t result;
+	ZSTD_CCtx ctxBody;
+	memset(&ctxBody, 0, sizeof(ctxBody));
+	memcpy(&ctxBody.customMem, &defaultCustomMem, sizeof(ZSTD_customMem));
+	result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
+	ZSTD_free(ctxBody.workSpace, defaultCustomMem);  /* can't free ctxBody itself, as it's on stack; free only heap content */
+	return result;
 }
 
 
 /* =====  Dictionary API  ===== */
 
 struct ZSTD_CDict_s {
-    void* dictBuffer;
-    const void* dictContent;
-    size_t dictContentSize;
-    ZSTD_CCtx* refContext;
+	void* dictBuffer;
+	const void* dictContent;
+	size_t dictContentSize;
+	ZSTD_CCtx* refContext;
 };  /* typedef'd tp ZSTD_CDict within "zstd.h" */
 
 size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
 {
-    if (cdict==NULL) return 0;   /* support sizeof on NULL */
-    return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
+	if (cdict==NULL) return 0;   /* support sizeof on NULL */
+	return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
 }
 
 ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
-                                      ZSTD_parameters params, ZSTD_customMem customMem)
+									  ZSTD_parameters params, ZSTD_customMem customMem)
 {
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    {   ZSTD_CDict* const cdict = (ZSTD_CDict*) ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
-        ZSTD_CCtx* const cctx = ZSTD_createCCtx_advanced(customMem);
+	{   ZSTD_CDict* const cdict = (ZSTD_CDict*) ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
+		ZSTD_CCtx* const cctx = ZSTD_createCCtx_advanced(customMem);
 
-        if (!cdict || !cctx) {
-            ZSTD_free(cdict, customMem);
-            ZSTD_freeCCtx(cctx);
-            return NULL;
-        }
+		if (!cdict || !cctx) {
+			ZSTD_free(cdict, customMem);
+			ZSTD_freeCCtx(cctx);
+			return NULL;
+		}
 
-        if ((byReference) || (!dictBuffer) || (!dictSize)) {
-            cdict->dictBuffer = NULL;
-            cdict->dictContent = dictBuffer;
-        } else {
-            void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
-            if (!internalBuffer) { ZSTD_free(cctx, customMem); ZSTD_free(cdict, customMem); return NULL; }
-            memcpy(internalBuffer, dictBuffer, dictSize);
-            cdict->dictBuffer = internalBuffer;
-            cdict->dictContent = internalBuffer;
-        }
+		if ((byReference) || (!dictBuffer) || (!dictSize)) {
+			cdict->dictBuffer = NULL;
+			cdict->dictContent = dictBuffer;
+		} else {
+			void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
+			if (!internalBuffer) { ZSTD_free(cctx, customMem); ZSTD_free(cdict, customMem); return NULL; }
+			memcpy(internalBuffer, dictBuffer, dictSize);
+			cdict->dictBuffer = internalBuffer;
+			cdict->dictContent = internalBuffer;
+		}
 
-        {   size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
-            if (ZSTD_isError(errorCode)) {
-                ZSTD_free(cdict->dictBuffer, customMem);
-                ZSTD_free(cdict, customMem);
-                ZSTD_freeCCtx(cctx);
-                return NULL;
-        }   }
+		{   size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
+			if (ZSTD_isError(errorCode)) {
+				ZSTD_free(cdict->dictBuffer, customMem);
+				ZSTD_free(cdict, customMem);
+				ZSTD_freeCCtx(cctx);
+				return NULL;
+		}   }
 
-        cdict->refContext = cctx;
-        cdict->dictContentSize = dictSize;
-        return cdict;
-    }
+		cdict->refContext = cctx;
+		cdict->dictContentSize = dictSize;
+		return cdict;
+	}
 }
 
 ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
 {
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTD_createCDict_advanced(dict, dictSize, 0, params, allocator);
+	ZSTD_customMem const allocator = { NULL, NULL, NULL };
+	ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
+	params.fParams.contentSizeFlag = 1;
+	return ZSTD_createCDict_advanced(dict, dictSize, 0, params, allocator);
 }
 
 ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
 {
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTD_createCDict_advanced(dict, dictSize, 1, params, allocator);
+	ZSTD_customMem const allocator = { NULL, NULL, NULL };
+	ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
+	params.fParams.contentSizeFlag = 1;
+	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, allocator);
 }
 
 size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
 {
-    if (cdict==NULL) return 0;   /* support free on NULL */
-    {   ZSTD_customMem const cMem = cdict->refContext->customMem;
-        ZSTD_freeCCtx(cdict->refContext);
-        ZSTD_free(cdict->dictBuffer, cMem);
-        ZSTD_free(cdict, cMem);
-        return 0;
-    }
+	if (cdict==NULL) return 0;   /* support free on NULL */
+	{   ZSTD_customMem const cMem = cdict->refContext->customMem;
+		ZSTD_freeCCtx(cdict->refContext);
+		ZSTD_free(cdict->dictBuffer, cMem);
+		ZSTD_free(cdict, cMem);
+		return 0;
+	}
 }
 
 static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict* cdict) {
-    return ZSTD_getParamsFromCCtx(cdict->refContext);
+	return ZSTD_getParamsFromCCtx(cdict->refContext);
 }
 
 size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
 {
-    if (cdict->dictContentSize) CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
-    else {
-        ZSTD_parameters params = cdict->refContext->params;
-        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-        CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
-    }
-    return 0;
+	if (cdict->dictContentSize) CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
+	else {
+		ZSTD_parameters params = cdict->refContext->params;
+		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+		CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
+	}
+	return 0;
 }
 
 /*! ZSTD_compress_usingCDict() :
@@ -2908,18 +2908,18 @@ size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, u
 *   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
 *   Note that compression level is decided during dictionary creation */
 size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
-                                void* dst, size_t dstCapacity,
-                                const void* src, size_t srcSize,
-                                const ZSTD_CDict* cdict)
+								void* dst, size_t dstCapacity,
+								const void* src, size_t srcSize,
+								const ZSTD_CDict* cdict)
 {
-    CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
+	CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
 
-    if (cdict->refContext->params.fParams.contentSizeFlag==1) {
-        cctx->params.fParams.contentSizeFlag = 1;
-        cctx->frameContentSize = srcSize;
-    }
+	if (cdict->refContext->params.fParams.contentSizeFlag==1) {
+		cctx->params.fParams.contentSizeFlag = 1;
+		cctx->frameContentSize = srcSize;
+	}
 
-    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
 }
 
 
@@ -2931,64 +2931,64 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
 typedef enum { zcss_init, zcss_load, zcss_flush, zcss_final } ZSTD_cStreamStage;
 
 struct ZSTD_CStream_s {
-    ZSTD_CCtx* cctx;
-    ZSTD_CDict* cdictLocal;
-    const ZSTD_CDict* cdict;
-    char*  inBuff;
-    size_t inBuffSize;
-    size_t inToCompress;
-    size_t inBuffPos;
-    size_t inBuffTarget;
-    size_t blockSize;
-    char*  outBuff;
-    size_t outBuffSize;
-    size_t outBuffContentSize;
-    size_t outBuffFlushedSize;
-    ZSTD_cStreamStage stage;
-    U32    checksum;
-    U32    frameEnded;
-    U64    pledgedSrcSize;
-    U64    inputProcessed;
-    ZSTD_parameters params;
-    ZSTD_customMem customMem;
+	ZSTD_CCtx* cctx;
+	ZSTD_CDict* cdictLocal;
+	const ZSTD_CDict* cdict;
+	char*  inBuff;
+	size_t inBuffSize;
+	size_t inToCompress;
+	size_t inBuffPos;
+	size_t inBuffTarget;
+	size_t blockSize;
+	char*  outBuff;
+	size_t outBuffSize;
+	size_t outBuffContentSize;
+	size_t outBuffFlushedSize;
+	ZSTD_cStreamStage stage;
+	U32    checksum;
+	U32    frameEnded;
+	U64    pledgedSrcSize;
+	U64    inputProcessed;
+	ZSTD_parameters params;
+	ZSTD_customMem customMem;
 };   /* typedef'd to ZSTD_CStream within "zstd.h" */
 
 ZSTD_CStream* ZSTD_createCStream(void)
 {
-    return ZSTD_createCStream_advanced(defaultCustomMem);
+	return ZSTD_createCStream_advanced(defaultCustomMem);
 }
 
 ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
 {
-    ZSTD_CStream* zcs;
+	ZSTD_CStream* zcs;
 
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    zcs = (ZSTD_CStream*)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
-    if (zcs==NULL) return NULL;
-    memset(zcs, 0, sizeof(ZSTD_CStream));
-    memcpy(&zcs->customMem, &customMem, sizeof(ZSTD_customMem));
-    zcs->cctx = ZSTD_createCCtx_advanced(customMem);
-    if (zcs->cctx == NULL) { ZSTD_freeCStream(zcs); return NULL; }
-    return zcs;
+	zcs = (ZSTD_CStream*)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
+	if (zcs==NULL) return NULL;
+	memset(zcs, 0, sizeof(ZSTD_CStream));
+	memcpy(&zcs->customMem, &customMem, sizeof(ZSTD_customMem));
+	zcs->cctx = ZSTD_createCCtx_advanced(customMem);
+	if (zcs->cctx == NULL) { ZSTD_freeCStream(zcs); return NULL; }
+	return zcs;
 }
 
 size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
 {
-    if (zcs==NULL) return 0;   /* support free on NULL */
-    {   ZSTD_customMem const cMem = zcs->customMem;
-        ZSTD_freeCCtx(zcs->cctx);
-        zcs->cctx = NULL;
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = NULL;
-        ZSTD_free(zcs->inBuff, cMem);
-        zcs->inBuff = NULL;
-        ZSTD_free(zcs->outBuff, cMem);
-        zcs->outBuff = NULL;
-        ZSTD_free(zcs, cMem);
-        return 0;
-    }
+	if (zcs==NULL) return 0;   /* support free on NULL */
+	{   ZSTD_customMem const cMem = zcs->customMem;
+		ZSTD_freeCCtx(zcs->cctx);
+		zcs->cctx = NULL;
+		ZSTD_freeCDict(zcs->cdictLocal);
+		zcs->cdictLocal = NULL;
+		ZSTD_free(zcs->inBuff, cMem);
+		zcs->inBuff = NULL;
+		ZSTD_free(zcs->outBuff, cMem);
+		zcs->outBuff = NULL;
+		ZSTD_free(zcs, cMem);
+		return 0;
+	}
 }
 
 
@@ -2999,96 +2999,96 @@ size_t ZSTD_CStreamOutSize(void) { return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSO
 
 static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 {
-    if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
+	if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
 
-    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
-    else CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
+	if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
+	else CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
 
-    zcs->inToCompress = 0;
-    zcs->inBuffPos = 0;
-    zcs->inBuffTarget = zcs->blockSize;
-    zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-    zcs->stage = zcss_load;
-    zcs->frameEnded = 0;
-    zcs->pledgedSrcSize = pledgedSrcSize;
-    zcs->inputProcessed = 0;
-    return 0;   /* ready to go */
+	zcs->inToCompress = 0;
+	zcs->inBuffPos = 0;
+	zcs->inBuffTarget = zcs->blockSize;
+	zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
+	zcs->stage = zcss_load;
+	zcs->frameEnded = 0;
+	zcs->pledgedSrcSize = pledgedSrcSize;
+	zcs->inputProcessed = 0;
+	return 0;   /* ready to go */
 }
 
 size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 {
 
-    zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+	zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
 
-    return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
+	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
 size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
-                                 const void* dict, size_t dictSize,
-                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
+								 const void* dict, size_t dictSize,
+								 ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
-    /* allocate buffers */
-    {   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
-        if (zcs->inBuffSize < neededInBuffSize) {
-            zcs->inBuffSize = neededInBuffSize;
-            ZSTD_free(zcs->inBuff, zcs->customMem);
-            zcs->inBuff = (char*) ZSTD_malloc(neededInBuffSize, zcs->customMem);
-            if (zcs->inBuff == NULL) return ERROR(memory_allocation);
-        }
-        zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
-    }
-    if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize)+1) {
-        zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize)+1;
-        ZSTD_free(zcs->outBuff, zcs->customMem);
-        zcs->outBuff = (char*) ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
-        if (zcs->outBuff == NULL) return ERROR(memory_allocation);
-    }
+	/* allocate buffers */
+	{   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
+		if (zcs->inBuffSize < neededInBuffSize) {
+			zcs->inBuffSize = neededInBuffSize;
+			ZSTD_free(zcs->inBuff, zcs->customMem);
+			zcs->inBuff = (char*) ZSTD_malloc(neededInBuffSize, zcs->customMem);
+			if (zcs->inBuff == NULL) return ERROR(memory_allocation);
+		}
+		zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
+	}
+	if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize)+1) {
+		zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize)+1;
+		ZSTD_free(zcs->outBuff, zcs->customMem);
+		zcs->outBuff = (char*) ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
+		if (zcs->outBuff == NULL) return ERROR(memory_allocation);
+	}
 
-    if (dict && dictSize >= 8) {
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
-        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
-        zcs->cdict = zcs->cdictLocal;
-    } else zcs->cdict = NULL;
+	if (dict && dictSize >= 8) {
+		ZSTD_freeCDict(zcs->cdictLocal);
+		zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
+		if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
+		zcs->cdict = zcs->cdictLocal;
+	} else zcs->cdict = NULL;
 
-    zcs->checksum = params.fParams.checksumFlag > 0;
-    zcs->params = params;
+	zcs->checksum = params.fParams.checksumFlag > 0;
+	zcs->params = params;
 
-    return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
+	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
 /* note : cdict must outlive compression session */
 size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
 {
-    ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-    size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
-    zcs->cdict = cdict;
-    zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
-    return initError;
+	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
+	size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
+	zcs->cdict = cdict;
+	zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
+	return initError;
 }
 
 size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
 {
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    return ZSTD_initCStream_advanced(zcs, dict, dictSize, params, 0);
+	ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
+	return ZSTD_initCStream_advanced(zcs, dict, dictSize, params, 0);
 }
 
 size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize)
 {
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
-    if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
-    return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
+	ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
+	if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
+	return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
 }
 
 size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
 {
-    return ZSTD_initCStream_usingDict(zcs, NULL, 0, compressionLevel);
+	return ZSTD_initCStream_usingDict(zcs, NULL, 0, compressionLevel);
 }
 
 size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)
 {
-    if (zcs==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*zcs) + ZSTD_sizeof_CCtx(zcs->cctx) + ZSTD_sizeof_CDict(zcs->cdictLocal) + zcs->outBuffSize + zcs->inBuffSize;
+	if (zcs==NULL) return 0;   /* support sizeof on NULL */
+	return sizeof(*zcs) + ZSTD_sizeof_CCtx(zcs->cctx) + ZSTD_sizeof_CDict(zcs->cdictLocal) + zcs->outBuffSize + zcs->inBuffSize;
 }
 
 /*======   Compression   ======*/
@@ -3097,103 +3097,103 @@ typedef enum { zsf_gather, zsf_flush, zsf_end } ZSTD_flush_e;
 
 MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    size_t const length = MIN(dstCapacity, srcSize);
-    memcpy(dst, src, length);
-    return length;
+	size_t const length = MIN(dstCapacity, srcSize);
+	memcpy(dst, src, length);
+	return length;
 }
 
 static size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
-                              void* dst, size_t* dstCapacityPtr,
-                        const void* src, size_t* srcSizePtr,
-                              ZSTD_flush_e const flush)
+							  void* dst, size_t* dstCapacityPtr,
+						const void* src, size_t* srcSizePtr,
+							  ZSTD_flush_e const flush)
 {
-    U32 someMoreWork = 1;
-    const char* const istart = (const char*)src;
-    const char* const iend = istart + *srcSizePtr;
-    const char* ip = istart;
-    char* const ostart = (char*)dst;
-    char* const oend = ostart + *dstCapacityPtr;
-    char* op = ostart;
+	U32 someMoreWork = 1;
+	const char* const istart = (const char*)src;
+	const char* const iend = istart + *srcSizePtr;
+	const char* ip = istart;
+	char* const ostart = (char*)dst;
+	char* const oend = ostart + *dstCapacityPtr;
+	char* op = ostart;
 
-    while (someMoreWork) {
-        switch(zcs->stage)
-        {
-        case zcss_init: return ERROR(init_missing);   /* call ZBUFF_compressInit() first ! */
+	while (someMoreWork) {
+		switch(zcs->stage)
+		{
+		case zcss_init: return ERROR(init_missing);   /* call ZBUFF_compressInit() first ! */
 
-        case zcss_load:
-            /* complete inBuffer */
-            {   size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
-                size_t const loaded = ZSTD_limitCopy(zcs->inBuff + zcs->inBuffPos, toLoad, ip, iend-ip);
-                zcs->inBuffPos += loaded;
-                ip += loaded;
-                if ( (zcs->inBuffPos==zcs->inToCompress) || (!flush && (toLoad != loaded)) ) {
-                    someMoreWork = 0; break;  /* not enough input to get a full block : stop there, wait for more */
-            }   }
-            /* compress current block (note : this stage cannot be stopped in the middle) */
-            {   void* cDst;
-                size_t cSize;
-                size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
-                size_t oSize = oend-op;
-                if (oSize >= ZSTD_compressBound(iSize))
-                    cDst = op;   /* compress directly into output buffer (avoid flush stage) */
-                else
-                    cDst = zcs->outBuff, oSize = zcs->outBuffSize;
-                cSize = (flush == zsf_end) ?
-                        ZSTD_compressEnd(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize) :
-                        ZSTD_compressContinue(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize);
-                if (ZSTD_isError(cSize)) return cSize;
-                if (flush == zsf_end) zcs->frameEnded = 1;
-                /* prepare next block */
-                zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
-                if (zcs->inBuffTarget > zcs->inBuffSize)
-                    zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize;   /* note : inBuffSize >= blockSize */
-                zcs->inToCompress = zcs->inBuffPos;
-                if (cDst == op) { op += cSize; break; }   /* no need to flush */
-                zcs->outBuffContentSize = cSize;
-                zcs->outBuffFlushedSize = 0;
-                zcs->stage = zcss_flush;   /* pass-through to flush stage */
-            }
+		case zcss_load:
+			/* complete inBuffer */
+			{   size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
+				size_t const loaded = ZSTD_limitCopy(zcs->inBuff + zcs->inBuffPos, toLoad, ip, iend-ip);
+				zcs->inBuffPos += loaded;
+				ip += loaded;
+				if ( (zcs->inBuffPos==zcs->inToCompress) || (!flush && (toLoad != loaded)) ) {
+					someMoreWork = 0; break;  /* not enough input to get a full block : stop there, wait for more */
+			}   }
+			/* compress current block (note : this stage cannot be stopped in the middle) */
+			{   void* cDst;
+				size_t cSize;
+				size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
+				size_t oSize = oend-op;
+				if (oSize >= ZSTD_compressBound(iSize))
+					cDst = op;   /* compress directly into output buffer (avoid flush stage) */
+				else
+					cDst = zcs->outBuff, oSize = zcs->outBuffSize;
+				cSize = (flush == zsf_end) ?
+						ZSTD_compressEnd(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize) :
+						ZSTD_compressContinue(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize);
+				if (ZSTD_isError(cSize)) return cSize;
+				if (flush == zsf_end) zcs->frameEnded = 1;
+				/* prepare next block */
+				zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
+				if (zcs->inBuffTarget > zcs->inBuffSize)
+					zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize;   /* note : inBuffSize >= blockSize */
+				zcs->inToCompress = zcs->inBuffPos;
+				if (cDst == op) { op += cSize; break; }   /* no need to flush */
+				zcs->outBuffContentSize = cSize;
+				zcs->outBuffFlushedSize = 0;
+				zcs->stage = zcss_flush;   /* pass-through to flush stage */
+			}
 
-        case zcss_flush:
-            {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-                size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-                op += flushed;
-                zcs->outBuffFlushedSize += flushed;
-                if (toFlush!=flushed) { someMoreWork = 0; break; }  /* dst too small to store flushed data : stop there */
-                zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-                zcs->stage = zcss_load;
-                break;
-            }
+		case zcss_flush:
+			{   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+				size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
+				op += flushed;
+				zcs->outBuffFlushedSize += flushed;
+				if (toFlush!=flushed) { someMoreWork = 0; break; }  /* dst too small to store flushed data : stop there */
+				zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
+				zcs->stage = zcss_load;
+				break;
+			}
 
-        case zcss_final:
-            someMoreWork = 0;   /* do nothing */
-            break;
+		case zcss_final:
+			someMoreWork = 0;   /* do nothing */
+			break;
 
-        default:
-            return ERROR(GENERIC);   /* impossible */
-        }
-    }
+		default:
+			return ERROR(GENERIC);   /* impossible */
+		}
+	}
 
-    *srcSizePtr = ip - istart;
-    *dstCapacityPtr = op - ostart;
-    zcs->inputProcessed += *srcSizePtr;
-    if (zcs->frameEnded) return 0;
-    {   size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
-        if (hintInSize==0) hintInSize = zcs->blockSize;
-        return hintInSize;
-    }
+	*srcSizePtr = ip - istart;
+	*dstCapacityPtr = op - ostart;
+	zcs->inputProcessed += *srcSizePtr;
+	if (zcs->frameEnded) return 0;
+	{   size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
+		if (hintInSize==0) hintInSize = zcs->blockSize;
+		return hintInSize;
+	}
 }
 
 size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
 {
-    size_t sizeRead = input->size - input->pos;
-    size_t sizeWritten = output->size - output->pos;
-    size_t const result = ZSTD_compressStream_generic(zcs,
-                                                      (char*)(output->dst) + output->pos, &sizeWritten,
-                                                      (const char*)(input->src) + input->pos, &sizeRead, zsf_gather);
-    input->pos += sizeRead;
-    output->pos += sizeWritten;
-    return result;
+	size_t sizeRead = input->size - input->pos;
+	size_t sizeWritten = output->size - output->pos;
+	size_t const result = ZSTD_compressStream_generic(zcs,
+													  (char*)(output->dst) + output->pos, &sizeWritten,
+													  (const char*)(input->src) + input->pos, &sizeRead, zsf_gather);
+	input->pos += sizeRead;
+	output->pos += sizeWritten;
+	return result;
 }
 
 
@@ -3203,53 +3203,53 @@ size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuf
 *   @return : amount of data remaining to flush */
 size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
 {
-    size_t srcSize = 0;
-    size_t sizeWritten = output->size - output->pos;
-    size_t const result = ZSTD_compressStream_generic(zcs,
-                                                     (char*)(output->dst) + output->pos, &sizeWritten,
-                                                     &srcSize, &srcSize, /* use a valid src address instead of NULL */
-                                                      zsf_flush);
-    output->pos += sizeWritten;
-    if (ZSTD_isError(result)) return result;
-    return zcs->outBuffContentSize - zcs->outBuffFlushedSize;   /* remaining to flush */
+	size_t srcSize = 0;
+	size_t sizeWritten = output->size - output->pos;
+	size_t const result = ZSTD_compressStream_generic(zcs,
+													 (char*)(output->dst) + output->pos, &sizeWritten,
+													 &srcSize, &srcSize, /* use a valid src address instead of NULL */
+													  zsf_flush);
+	output->pos += sizeWritten;
+	if (ZSTD_isError(result)) return result;
+	return zcs->outBuffContentSize - zcs->outBuffFlushedSize;   /* remaining to flush */
 }
 
 
 size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
 {
-    BYTE* const ostart = (BYTE*)(output->dst) + output->pos;
-    BYTE* const oend = (BYTE*)(output->dst) + output->size;
-    BYTE* op = ostart;
+	BYTE* const ostart = (BYTE*)(output->dst) + output->pos;
+	BYTE* const oend = (BYTE*)(output->dst) + output->size;
+	BYTE* op = ostart;
 
-    if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
-        return ERROR(srcSize_wrong);   /* pledgedSrcSize not respected */
+	if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
+		return ERROR(srcSize_wrong);   /* pledgedSrcSize not respected */
 
-    if (zcs->stage != zcss_final) {
-        /* flush whatever remains */
-        size_t srcSize = 0;
-        size_t sizeWritten = output->size - output->pos;
-        size_t const notEnded = ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end);  /* use a valid src address instead of NULL */
-        size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-        op += sizeWritten;
-        if (remainingToFlush) {
-            output->pos += sizeWritten;
-            return remainingToFlush + ZSTD_BLOCKHEADERSIZE /* final empty block */ + (zcs->checksum * 4);
-        }
-        /* create epilogue */
-        zcs->stage = zcss_final;
-        zcs->outBuffContentSize = !notEnded ? 0 :
-            ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);  /* write epilogue, including final empty block, into outBuff */
-    }
+	if (zcs->stage != zcss_final) {
+		/* flush whatever remains */
+		size_t srcSize = 0;
+		size_t sizeWritten = output->size - output->pos;
+		size_t const notEnded = ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end);  /* use a valid src address instead of NULL */
+		size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+		op += sizeWritten;
+		if (remainingToFlush) {
+			output->pos += sizeWritten;
+			return remainingToFlush + ZSTD_BLOCKHEADERSIZE /* final empty block */ + (zcs->checksum * 4);
+		}
+		/* create epilogue */
+		zcs->stage = zcss_final;
+		zcs->outBuffContentSize = !notEnded ? 0 :
+			ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);  /* write epilogue, including final empty block, into outBuff */
+	}
 
-    /* flush epilogue */
-    {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-        size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-        op += flushed;
-        zcs->outBuffFlushedSize += flushed;
-        output->pos += op-ostart;
-        if (toFlush==flushed) zcs->stage = zcss_init;  /* end reached */
-        return toFlush - flushed;
-    }
+	/* flush epilogue */
+	{   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+		size_t const flushed = ZSTD_limitCopy(op, oend-op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
+		op += flushed;
+		zcs->outBuffFlushedSize += flushed;
+		output->pos += op-ostart;
+		if (toFlush==flushed) zcs->stage = zcss_init;  /* end reached */
+		return toFlush - flushed;
+	}
 }
 
 
@@ -3262,108 +3262,108 @@ int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
 
 static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL+1] = {
 {   /* "default" */
-    /* W,  C,  H,  S,  L, TL, strat */
-    { 18, 12, 12,  1,  7, 16, ZSTD_fast    },  /* level  0 - never used */
-    { 19, 13, 14,  1,  7, 16, ZSTD_fast    },  /* level  1 */
-    { 19, 15, 16,  1,  6, 16, ZSTD_fast    },  /* level  2 */
-    { 20, 16, 17,  1,  5, 16, ZSTD_dfast   },  /* level  3.*/
-    { 20, 18, 18,  1,  5, 16, ZSTD_dfast   },  /* level  4.*/
-    { 20, 15, 18,  3,  5, 16, ZSTD_greedy  },  /* level  5 */
-    { 21, 16, 19,  2,  5, 16, ZSTD_lazy    },  /* level  6 */
-    { 21, 17, 20,  3,  5, 16, ZSTD_lazy    },  /* level  7 */
-    { 21, 18, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  8 */
-    { 21, 20, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  9 */
-    { 21, 19, 21,  4,  5, 16, ZSTD_lazy2   },  /* level 10 */
-    { 22, 20, 22,  4,  5, 16, ZSTD_lazy2   },  /* level 11 */
-    { 22, 20, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 12 */
-    { 22, 21, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 13 */
-    { 22, 21, 22,  6,  5, 16, ZSTD_lazy2   },  /* level 14 */
-    { 22, 21, 21,  5,  5, 16, ZSTD_btlazy2 },  /* level 15 */
-    { 23, 22, 22,  5,  5, 16, ZSTD_btlazy2 },  /* level 16 */
-    { 23, 21, 22,  4,  5, 24, ZSTD_btopt   },  /* level 17 */
-    { 23, 23, 22,  6,  5, 32, ZSTD_btopt   },  /* level 18 */
-    { 23, 23, 22,  6,  3, 48, ZSTD_btopt   },  /* level 19 */
-    { 25, 25, 23,  7,  3, 64, ZSTD_btopt2  },  /* level 20 */
-    { 26, 26, 23,  7,  3,256, ZSTD_btopt2  },  /* level 21 */
-    { 27, 27, 25,  9,  3,512, ZSTD_btopt2  },  /* level 22 */
+	/* W,  C,  H,  S,  L, TL, strat */
+	{ 18, 12, 12,  1,  7, 16, ZSTD_fast    },  /* level  0 - never used */
+	{ 19, 13, 14,  1,  7, 16, ZSTD_fast    },  /* level  1 */
+	{ 19, 15, 16,  1,  6, 16, ZSTD_fast    },  /* level  2 */
+	{ 20, 16, 17,  1,  5, 16, ZSTD_dfast   },  /* level  3.*/
+	{ 20, 18, 18,  1,  5, 16, ZSTD_dfast   },  /* level  4.*/
+	{ 20, 15, 18,  3,  5, 16, ZSTD_greedy  },  /* level  5 */
+	{ 21, 16, 19,  2,  5, 16, ZSTD_lazy    },  /* level  6 */
+	{ 21, 17, 20,  3,  5, 16, ZSTD_lazy    },  /* level  7 */
+	{ 21, 18, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  8 */
+	{ 21, 20, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  9 */
+	{ 21, 19, 21,  4,  5, 16, ZSTD_lazy2   },  /* level 10 */
+	{ 22, 20, 22,  4,  5, 16, ZSTD_lazy2   },  /* level 11 */
+	{ 22, 20, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 12 */
+	{ 22, 21, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 13 */
+	{ 22, 21, 22,  6,  5, 16, ZSTD_lazy2   },  /* level 14 */
+	{ 22, 21, 21,  5,  5, 16, ZSTD_btlazy2 },  /* level 15 */
+	{ 23, 22, 22,  5,  5, 16, ZSTD_btlazy2 },  /* level 16 */
+	{ 23, 21, 22,  4,  5, 24, ZSTD_btopt   },  /* level 17 */
+	{ 23, 23, 22,  6,  5, 32, ZSTD_btopt   },  /* level 18 */
+	{ 23, 23, 22,  6,  3, 48, ZSTD_btopt   },  /* level 19 */
+	{ 25, 25, 23,  7,  3, 64, ZSTD_btopt2  },  /* level 20 */
+	{ 26, 26, 23,  7,  3,256, ZSTD_btopt2  },  /* level 21 */
+	{ 27, 27, 25,  9,  3,512, ZSTD_btopt2  },  /* level 22 */
 },
 {   /* for srcSize <= 256 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    {  0,  0,  0,  0,  0,  0, ZSTD_fast    },  /* level  0 - not used */
-    { 18, 13, 14,  1,  6,  8, ZSTD_fast    },  /* level  1 */
-    { 18, 14, 13,  1,  5,  8, ZSTD_dfast   },  /* level  2 */
-    { 18, 16, 15,  1,  5,  8, ZSTD_dfast   },  /* level  3 */
-    { 18, 15, 17,  1,  5,  8, ZSTD_greedy  },  /* level  4.*/
-    { 18, 16, 17,  4,  5,  8, ZSTD_greedy  },  /* level  5.*/
-    { 18, 16, 17,  3,  5,  8, ZSTD_lazy    },  /* level  6.*/
-    { 18, 17, 17,  4,  4,  8, ZSTD_lazy    },  /* level  7 */
-    { 18, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
-    { 18, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
-    { 18, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
-    { 18, 18, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 11.*/
-    { 18, 18, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 12.*/
-    { 18, 19, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13 */
-    { 18, 18, 18,  4,  4, 16, ZSTD_btopt   },  /* level 14.*/
-    { 18, 18, 18,  4,  3, 16, ZSTD_btopt   },  /* level 15.*/
-    { 18, 19, 18,  6,  3, 32, ZSTD_btopt   },  /* level 16.*/
-    { 18, 19, 18,  8,  3, 64, ZSTD_btopt   },  /* level 17.*/
-    { 18, 19, 18,  9,  3,128, ZSTD_btopt   },  /* level 18.*/
-    { 18, 19, 18, 10,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 18, 19, 18, 11,  3,512, ZSTD_btopt2  },  /* level 20.*/
-    { 18, 19, 18, 12,  3,512, ZSTD_btopt2  },  /* level 21.*/
-    { 18, 19, 18, 13,  3,512, ZSTD_btopt2  },  /* level 22.*/
+	/* W,  C,  H,  S,  L,  T, strat */
+	{  0,  0,  0,  0,  0,  0, ZSTD_fast    },  /* level  0 - not used */
+	{ 18, 13, 14,  1,  6,  8, ZSTD_fast    },  /* level  1 */
+	{ 18, 14, 13,  1,  5,  8, ZSTD_dfast   },  /* level  2 */
+	{ 18, 16, 15,  1,  5,  8, ZSTD_dfast   },  /* level  3 */
+	{ 18, 15, 17,  1,  5,  8, ZSTD_greedy  },  /* level  4.*/
+	{ 18, 16, 17,  4,  5,  8, ZSTD_greedy  },  /* level  5.*/
+	{ 18, 16, 17,  3,  5,  8, ZSTD_lazy    },  /* level  6.*/
+	{ 18, 17, 17,  4,  4,  8, ZSTD_lazy    },  /* level  7 */
+	{ 18, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+	{ 18, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+	{ 18, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+	{ 18, 18, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 11.*/
+	{ 18, 18, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 12.*/
+	{ 18, 19, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13 */
+	{ 18, 18, 18,  4,  4, 16, ZSTD_btopt   },  /* level 14.*/
+	{ 18, 18, 18,  4,  3, 16, ZSTD_btopt   },  /* level 15.*/
+	{ 18, 19, 18,  6,  3, 32, ZSTD_btopt   },  /* level 16.*/
+	{ 18, 19, 18,  8,  3, 64, ZSTD_btopt   },  /* level 17.*/
+	{ 18, 19, 18,  9,  3,128, ZSTD_btopt   },  /* level 18.*/
+	{ 18, 19, 18, 10,  3,256, ZSTD_btopt   },  /* level 19.*/
+	{ 18, 19, 18, 11,  3,512, ZSTD_btopt2  },  /* level 20.*/
+	{ 18, 19, 18, 12,  3,512, ZSTD_btopt2  },  /* level 21.*/
+	{ 18, 19, 18, 13,  3,512, ZSTD_btopt2  },  /* level 22.*/
 },
 {   /* for srcSize <= 128 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    { 17, 12, 12,  1,  7,  8, ZSTD_fast    },  /* level  0 - not used */
-    { 17, 12, 13,  1,  6,  8, ZSTD_fast    },  /* level  1 */
-    { 17, 13, 16,  1,  5,  8, ZSTD_fast    },  /* level  2 */
-    { 17, 16, 16,  2,  5,  8, ZSTD_dfast   },  /* level  3 */
-    { 17, 13, 15,  3,  4,  8, ZSTD_greedy  },  /* level  4 */
-    { 17, 15, 17,  4,  4,  8, ZSTD_greedy  },  /* level  5 */
-    { 17, 16, 17,  3,  4,  8, ZSTD_lazy    },  /* level  6 */
-    { 17, 15, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  7 */
-    { 17, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
-    { 17, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
-    { 17, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
-    { 17, 17, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 11 */
-    { 17, 17, 17,  8,  4,  8, ZSTD_lazy2   },  /* level 12 */
-    { 17, 18, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13.*/
-    { 17, 17, 17,  7,  3,  8, ZSTD_btopt   },  /* level 14.*/
-    { 17, 17, 17,  7,  3, 16, ZSTD_btopt   },  /* level 15.*/
-    { 17, 18, 17,  7,  3, 32, ZSTD_btopt   },  /* level 16.*/
-    { 17, 18, 17,  7,  3, 64, ZSTD_btopt   },  /* level 17.*/
-    { 17, 18, 17,  7,  3,256, ZSTD_btopt   },  /* level 18.*/
-    { 17, 18, 17,  8,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 17, 18, 17,  9,  3,256, ZSTD_btopt2  },  /* level 20.*/
-    { 17, 18, 17, 10,  3,256, ZSTD_btopt2  },  /* level 21.*/
-    { 17, 18, 17, 11,  3,512, ZSTD_btopt2  },  /* level 22.*/
+	/* W,  C,  H,  S,  L,  T, strat */
+	{ 17, 12, 12,  1,  7,  8, ZSTD_fast    },  /* level  0 - not used */
+	{ 17, 12, 13,  1,  6,  8, ZSTD_fast    },  /* level  1 */
+	{ 17, 13, 16,  1,  5,  8, ZSTD_fast    },  /* level  2 */
+	{ 17, 16, 16,  2,  5,  8, ZSTD_dfast   },  /* level  3 */
+	{ 17, 13, 15,  3,  4,  8, ZSTD_greedy  },  /* level  4 */
+	{ 17, 15, 17,  4,  4,  8, ZSTD_greedy  },  /* level  5 */
+	{ 17, 16, 17,  3,  4,  8, ZSTD_lazy    },  /* level  6 */
+	{ 17, 15, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  7 */
+	{ 17, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+	{ 17, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+	{ 17, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+	{ 17, 17, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 11 */
+	{ 17, 17, 17,  8,  4,  8, ZSTD_lazy2   },  /* level 12 */
+	{ 17, 18, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13.*/
+	{ 17, 17, 17,  7,  3,  8, ZSTD_btopt   },  /* level 14.*/
+	{ 17, 17, 17,  7,  3, 16, ZSTD_btopt   },  /* level 15.*/
+	{ 17, 18, 17,  7,  3, 32, ZSTD_btopt   },  /* level 16.*/
+	{ 17, 18, 17,  7,  3, 64, ZSTD_btopt   },  /* level 17.*/
+	{ 17, 18, 17,  7,  3,256, ZSTD_btopt   },  /* level 18.*/
+	{ 17, 18, 17,  8,  3,256, ZSTD_btopt   },  /* level 19.*/
+	{ 17, 18, 17,  9,  3,256, ZSTD_btopt2  },  /* level 20.*/
+	{ 17, 18, 17, 10,  3,256, ZSTD_btopt2  },  /* level 21.*/
+	{ 17, 18, 17, 11,  3,512, ZSTD_btopt2  },  /* level 22.*/
 },
 {   /* for srcSize <= 16 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    { 14, 12, 12,  1,  7,  6, ZSTD_fast    },  /* level  0 - not used */
-    { 14, 14, 14,  1,  6,  6, ZSTD_fast    },  /* level  1 */
-    { 14, 14, 14,  1,  4,  6, ZSTD_fast    },  /* level  2 */
-    { 14, 14, 14,  1,  4,  6, ZSTD_dfast   },  /* level  3.*/
-    { 14, 14, 14,  4,  4,  6, ZSTD_greedy  },  /* level  4.*/
-    { 14, 14, 14,  3,  4,  6, ZSTD_lazy    },  /* level  5.*/
-    { 14, 14, 14,  4,  4,  6, ZSTD_lazy2   },  /* level  6 */
-    { 14, 14, 14,  5,  4,  6, ZSTD_lazy2   },  /* level  7 */
-    { 14, 14, 14,  6,  4,  6, ZSTD_lazy2   },  /* level  8.*/
-    { 14, 15, 14,  6,  4,  6, ZSTD_btlazy2 },  /* level  9.*/
-    { 14, 15, 14,  3,  3,  6, ZSTD_btopt   },  /* level 10.*/
-    { 14, 15, 14,  6,  3,  8, ZSTD_btopt   },  /* level 11.*/
-    { 14, 15, 14,  6,  3, 16, ZSTD_btopt   },  /* level 12.*/
-    { 14, 15, 14,  6,  3, 24, ZSTD_btopt   },  /* level 13.*/
-    { 14, 15, 15,  6,  3, 48, ZSTD_btopt   },  /* level 14.*/
-    { 14, 15, 15,  6,  3, 64, ZSTD_btopt   },  /* level 15.*/
-    { 14, 15, 15,  6,  3, 96, ZSTD_btopt   },  /* level 16.*/
-    { 14, 15, 15,  6,  3,128, ZSTD_btopt   },  /* level 17.*/
-    { 14, 15, 15,  6,  3,256, ZSTD_btopt   },  /* level 18.*/
-    { 14, 15, 15,  7,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 14, 15, 15,  8,  3,256, ZSTD_btopt2  },  /* level 20.*/
-    { 14, 15, 15,  9,  3,256, ZSTD_btopt2  },  /* level 21.*/
-    { 14, 15, 15, 10,  3,256, ZSTD_btopt2  },  /* level 22.*/
+	/* W,  C,  H,  S,  L,  T, strat */
+	{ 14, 12, 12,  1,  7,  6, ZSTD_fast    },  /* level  0 - not used */
+	{ 14, 14, 14,  1,  6,  6, ZSTD_fast    },  /* level  1 */
+	{ 14, 14, 14,  1,  4,  6, ZSTD_fast    },  /* level  2 */
+	{ 14, 14, 14,  1,  4,  6, ZSTD_dfast   },  /* level  3.*/
+	{ 14, 14, 14,  4,  4,  6, ZSTD_greedy  },  /* level  4.*/
+	{ 14, 14, 14,  3,  4,  6, ZSTD_lazy    },  /* level  5.*/
+	{ 14, 14, 14,  4,  4,  6, ZSTD_lazy2   },  /* level  6 */
+	{ 14, 14, 14,  5,  4,  6, ZSTD_lazy2   },  /* level  7 */
+	{ 14, 14, 14,  6,  4,  6, ZSTD_lazy2   },  /* level  8.*/
+	{ 14, 15, 14,  6,  4,  6, ZSTD_btlazy2 },  /* level  9.*/
+	{ 14, 15, 14,  3,  3,  6, ZSTD_btopt   },  /* level 10.*/
+	{ 14, 15, 14,  6,  3,  8, ZSTD_btopt   },  /* level 11.*/
+	{ 14, 15, 14,  6,  3, 16, ZSTD_btopt   },  /* level 12.*/
+	{ 14, 15, 14,  6,  3, 24, ZSTD_btopt   },  /* level 13.*/
+	{ 14, 15, 15,  6,  3, 48, ZSTD_btopt   },  /* level 14.*/
+	{ 14, 15, 15,  6,  3, 64, ZSTD_btopt   },  /* level 15.*/
+	{ 14, 15, 15,  6,  3, 96, ZSTD_btopt   },  /* level 16.*/
+	{ 14, 15, 15,  6,  3,128, ZSTD_btopt   },  /* level 17.*/
+	{ 14, 15, 15,  6,  3,256, ZSTD_btopt   },  /* level 18.*/
+	{ 14, 15, 15,  7,  3,256, ZSTD_btopt   },  /* level 19.*/
+	{ 14, 15, 15,  8,  3,256, ZSTD_btopt2  },  /* level 20.*/
+	{ 14, 15, 15,  9,  3,256, ZSTD_btopt2  },  /* level 21.*/
+	{ 14, 15, 15, 10,  3,256, ZSTD_btopt2  },  /* level 22.*/
 },
 };
 
@@ -3372,29 +3372,29 @@ static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEV
 *   Size values are optional, provide 0 if not known or unused */
 ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
 {
-    ZSTD_compressionParameters cp;
-    size_t const addedSize = srcSize ? 0 : 500;
-    U64 const rSize = srcSize+dictSize ? srcSize+dictSize+addedSize : (U64)-1;
-    U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB);   /* intentional underflow for srcSizeHint == 0 */
-    if (compressionLevel <= 0) compressionLevel = ZSTD_DEFAULT_CLEVEL;   /* 0 == default; no negative compressionLevel yet */
-    if (compressionLevel > ZSTD_MAX_CLEVEL) compressionLevel = ZSTD_MAX_CLEVEL;
-    cp = ZSTD_defaultCParameters[tableID][compressionLevel];
-    if (MEM_32bits()) {   /* auto-correction, for 32-bits mode */
-        if (cp.windowLog > ZSTD_WINDOWLOG_MAX) cp.windowLog = ZSTD_WINDOWLOG_MAX;
-        if (cp.chainLog > ZSTD_CHAINLOG_MAX) cp.chainLog = ZSTD_CHAINLOG_MAX;
-        if (cp.hashLog > ZSTD_HASHLOG_MAX) cp.hashLog = ZSTD_HASHLOG_MAX;
-    }
-    cp = ZSTD_adjustCParams(cp, srcSize, dictSize);
-    return cp;
+	ZSTD_compressionParameters cp;
+	size_t const addedSize = srcSize ? 0 : 500;
+	U64 const rSize = srcSize+dictSize ? srcSize+dictSize+addedSize : (U64)-1;
+	U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB);   /* intentional underflow for srcSizeHint == 0 */
+	if (compressionLevel <= 0) compressionLevel = ZSTD_DEFAULT_CLEVEL;   /* 0 == default; no negative compressionLevel yet */
+	if (compressionLevel > ZSTD_MAX_CLEVEL) compressionLevel = ZSTD_MAX_CLEVEL;
+	cp = ZSTD_defaultCParameters[tableID][compressionLevel];
+	if (MEM_32bits()) {   /* auto-correction, for 32-bits mode */
+		if (cp.windowLog > ZSTD_WINDOWLOG_MAX) cp.windowLog = ZSTD_WINDOWLOG_MAX;
+		if (cp.chainLog > ZSTD_CHAINLOG_MAX) cp.chainLog = ZSTD_CHAINLOG_MAX;
+		if (cp.hashLog > ZSTD_HASHLOG_MAX) cp.hashLog = ZSTD_HASHLOG_MAX;
+	}
+	cp = ZSTD_adjustCParams(cp, srcSize, dictSize);
+	return cp;
 }
 
 /*! ZSTD_getParams() :
 *   same as ZSTD_getCParams(), but @return a `ZSTD_parameters` object (instead of `ZSTD_compressionParameters`).
 *   All fields of `ZSTD_frameParameters` are set to default (0) */
 ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSize, size_t dictSize) {
-    ZSTD_parameters params;
-    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSize, dictSize);
-    memset(&params, 0, sizeof(params));
-    params.cParams = cParams;
-    return params;
+	ZSTD_parameters params;
+	ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSize, dictSize);
+	memset(&params, 0, sizeof(params));
+	params.cParams = cParams;
+	return params;
 }
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 06337dbd5..0c0d34686 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -81,44 +81,44 @@ static void ZSTD_copy4(void* dst, const void* src) { memcpy(dst, src, 4); }
 *   Context management
 ***************************************************************/
 typedef enum { ZSTDds_getFrameHeaderSize, ZSTDds_decodeFrameHeader,
-               ZSTDds_decodeBlockHeader, ZSTDds_decompressBlock,
-               ZSTDds_decompressLastBlock, ZSTDds_checkChecksum,
-               ZSTDds_decodeSkippableHeader, ZSTDds_skipFrame } ZSTD_dStage;
+			   ZSTDds_decodeBlockHeader, ZSTDds_decompressBlock,
+			   ZSTDds_decompressLastBlock, ZSTDds_checkChecksum,
+			   ZSTDds_decodeSkippableHeader, ZSTDds_skipFrame } ZSTD_dStage;
 
 typedef struct {
-    FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
-    FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
-    FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
-    HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)];  /* can accommodate HUF_decompress4X */
-    U32 rep[ZSTD_REP_NUM];
+	FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
+	FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
+	FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
+	HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)];  /* can accommodate HUF_decompress4X */
+	U32 rep[ZSTD_REP_NUM];
 } ZSTD_entropyTables_t;
 
 struct ZSTD_DCtx_s
 {
-    const FSE_DTable* LLTptr;
-    const FSE_DTable* MLTptr;
-    const FSE_DTable* OFTptr;
-    const HUF_DTable* HUFptr;
-    ZSTD_entropyTables_t entropy;
-    const void* previousDstEnd;   /* detect continuity */
-    const void* base;             /* start of current segment */
-    const void* vBase;            /* virtual start of previous segment if it was just before current one */
-    const void* dictEnd;          /* end of previous segment */
-    size_t expected;
-    ZSTD_frameParams fParams;
-    blockType_e bType;   /* used in ZSTD_decompressContinue(), to transfer blockType between header decoding and block decoding stages */
-    ZSTD_dStage stage;
-    U32 litEntropy;
-    U32 fseEntropy;
-    XXH64_state_t xxhState;
-    size_t headerSize;
-    U32 dictID;
-    const BYTE* litPtr;
-    ZSTD_customMem customMem;
-    size_t litSize;
-    size_t rleSize;
-    BYTE litBuffer[ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH];
-    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
+	const FSE_DTable* LLTptr;
+	const FSE_DTable* MLTptr;
+	const FSE_DTable* OFTptr;
+	const HUF_DTable* HUFptr;
+	ZSTD_entropyTables_t entropy;
+	const void* previousDstEnd;   /* detect continuity */
+	const void* base;             /* start of current segment */
+	const void* vBase;            /* virtual start of previous segment if it was just before current one */
+	const void* dictEnd;          /* end of previous segment */
+	size_t expected;
+	ZSTD_frameParams fParams;
+	blockType_e bType;   /* used in ZSTD_decompressContinue(), to transfer blockType between header decoding and block decoding stages */
+	ZSTD_dStage stage;
+	U32 litEntropy;
+	U32 fseEntropy;
+	XXH64_state_t xxhState;
+	size_t headerSize;
+	U32 dictID;
+	const BYTE* litPtr;
+	ZSTD_customMem customMem;
+	size_t litSize;
+	size_t rleSize;
+	BYTE litBuffer[ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH];
+	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
 };  /* typedef'd to ZSTD_DCtx within "zstd.h" */
 
 size_t ZSTD_sizeof_DCtx (const ZSTD_DCtx* dctx) { return (dctx==NULL) ? 0 : sizeof(ZSTD_DCtx); }
@@ -127,77 +127,77 @@ size_t ZSTD_estimateDCtxSize(void) { return sizeof(ZSTD_DCtx); }
 
 size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx)
 {
-    dctx->expected = ZSTD_frameHeaderSize_prefix;
-    dctx->stage = ZSTDds_getFrameHeaderSize;
-    dctx->previousDstEnd = NULL;
-    dctx->base = NULL;
-    dctx->vBase = NULL;
-    dctx->dictEnd = NULL;
-    dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
-    dctx->litEntropy = dctx->fseEntropy = 0;
-    dctx->dictID = 0;
-    MEM_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
-    memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue));  /* initial repcodes */
-    dctx->LLTptr = dctx->entropy.LLTable;
-    dctx->MLTptr = dctx->entropy.MLTable;
-    dctx->OFTptr = dctx->entropy.OFTable;
-    dctx->HUFptr = dctx->entropy.hufTable;
-    return 0;
+	dctx->expected = ZSTD_frameHeaderSize_prefix;
+	dctx->stage = ZSTDds_getFrameHeaderSize;
+	dctx->previousDstEnd = NULL;
+	dctx->base = NULL;
+	dctx->vBase = NULL;
+	dctx->dictEnd = NULL;
+	dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+	dctx->litEntropy = dctx->fseEntropy = 0;
+	dctx->dictID = 0;
+	MEM_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
+	memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue));  /* initial repcodes */
+	dctx->LLTptr = dctx->entropy.LLTable;
+	dctx->MLTptr = dctx->entropy.MLTable;
+	dctx->OFTptr = dctx->entropy.OFTable;
+	dctx->HUFptr = dctx->entropy.hufTable;
+	return 0;
 }
 
 ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
 {
-    ZSTD_DCtx* dctx;
+	ZSTD_DCtx* dctx;
 
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
-    if (!dctx) return NULL;
-    memcpy(&dctx->customMem, &customMem, sizeof(customMem));
-    ZSTD_decompressBegin(dctx);
-    return dctx;
+	dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
+	if (!dctx) return NULL;
+	memcpy(&dctx->customMem, &customMem, sizeof(customMem));
+	ZSTD_decompressBegin(dctx);
+	return dctx;
 }
 
 ZSTD_DCtx* ZSTD_createDCtx(void)
 {
-    return ZSTD_createDCtx_advanced(defaultCustomMem);
+	return ZSTD_createDCtx_advanced(defaultCustomMem);
 }
 
 size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx)
 {
-    if (dctx==NULL) return 0;   /* support free on NULL */
-    ZSTD_free(dctx, dctx->customMem);
-    return 0;   /* reserved as a potential error code in the future */
+	if (dctx==NULL) return 0;   /* support free on NULL */
+	ZSTD_free(dctx, dctx->customMem);
+	return 0;   /* reserved as a potential error code in the future */
 }
 
 void ZSTD_copyDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
 {
-    size_t const workSpaceSize = (ZSTD_BLOCKSIZE_ABSOLUTEMAX+WILDCOPY_OVERLENGTH) + ZSTD_frameHeaderSize_max;
-    memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize);  /* no need to copy workspace */
+	size_t const workSpaceSize = (ZSTD_BLOCKSIZE_ABSOLUTEMAX+WILDCOPY_OVERLENGTH) + ZSTD_frameHeaderSize_max;
+	memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize);  /* no need to copy workspace */
 }
 
 #if 0
 /* deprecated */
 static void ZSTD_refDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
 {
-    ZSTD_decompressBegin(dstDCtx);  /* init */
-    if (srcDCtx) {   /* support refDCtx on NULL */
-        dstDCtx->dictEnd = srcDCtx->dictEnd;
-        dstDCtx->vBase = srcDCtx->vBase;
-        dstDCtx->base = srcDCtx->base;
-        dstDCtx->previousDstEnd = srcDCtx->previousDstEnd;
-        dstDCtx->dictID = srcDCtx->dictID;
-        dstDCtx->litEntropy = srcDCtx->litEntropy;
-        dstDCtx->fseEntropy = srcDCtx->fseEntropy;
-        dstDCtx->LLTptr = srcDCtx->entropy.LLTable;
-        dstDCtx->MLTptr = srcDCtx->entropy.MLTable;
-        dstDCtx->OFTptr = srcDCtx->entropy.OFTable;
-        dstDCtx->HUFptr = srcDCtx->entropy.hufTable;
-        dstDCtx->entropy.rep[0] = srcDCtx->entropy.rep[0];
-        dstDCtx->entropy.rep[1] = srcDCtx->entropy.rep[1];
-        dstDCtx->entropy.rep[2] = srcDCtx->entropy.rep[2];
-    }
+	ZSTD_decompressBegin(dstDCtx);  /* init */
+	if (srcDCtx) {   /* support refDCtx on NULL */
+		dstDCtx->dictEnd = srcDCtx->dictEnd;
+		dstDCtx->vBase = srcDCtx->vBase;
+		dstDCtx->base = srcDCtx->base;
+		dstDCtx->previousDstEnd = srcDCtx->previousDstEnd;
+		dstDCtx->dictID = srcDCtx->dictID;
+		dstDCtx->litEntropy = srcDCtx->litEntropy;
+		dstDCtx->fseEntropy = srcDCtx->fseEntropy;
+		dstDCtx->LLTptr = srcDCtx->entropy.LLTable;
+		dstDCtx->MLTptr = srcDCtx->entropy.MLTable;
+		dstDCtx->OFTptr = srcDCtx->entropy.OFTable;
+		dstDCtx->HUFptr = srcDCtx->entropy.hufTable;
+		dstDCtx->entropy.rep[0] = srcDCtx->entropy.rep[0];
+		dstDCtx->entropy.rep[1] = srcDCtx->entropy.rep[1];
+		dstDCtx->entropy.rep[2] = srcDCtx->entropy.rep[2];
+	}
 }
 #endif
 
@@ -215,15 +215,15 @@ static void ZSTD_refDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict);
  *  Note 3 : Skippable Frame Identifiers are considered valid. */
 unsigned ZSTD_isFrame(const void* buffer, size_t size)
 {
-    if (size < 4) return 0;
-    {   U32 const magic = MEM_readLE32(buffer);
-        if (magic == ZSTD_MAGICNUMBER) return 1;
-        if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
-    }
+	if (size < 4) return 0;
+	{   U32 const magic = MEM_readLE32(buffer);
+		if (magic == ZSTD_MAGICNUMBER) return 1;
+		if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
+	}
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(buffer, size)) return 1;
+	if (ZSTD_isLegacy(buffer, size)) return 1;
 #endif
-    return 0;
+	return 0;
 }
 
 
@@ -232,14 +232,14 @@ unsigned ZSTD_isFrame(const void* buffer, size_t size)
 *   @return : size of the Frame Header */
 static size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize)
 {
-    if (srcSize < ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);
-    {   BYTE const fhd = ((const BYTE*)src)[4];
-        U32 const dictID= fhd & 3;
-        U32 const singleSegment = (fhd >> 5) & 1;
-        U32 const fcsId = fhd >> 6;
-        return ZSTD_frameHeaderSize_prefix + !singleSegment + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId]
-                + (singleSegment && !fcsId);
-    }
+	if (srcSize < ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);
+	{   BYTE const fhd = ((const BYTE*)src)[4];
+		U32 const dictID= fhd & 3;
+		U32 const singleSegment = (fhd >> 5) & 1;
+		U32 const fcsId = fhd >> 6;
+		return ZSTD_frameHeaderSize_prefix + !singleSegment + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId]
+				+ (singleSegment && !fcsId);
+	}
 }
 
 
@@ -250,67 +250,67 @@ static size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize)
 *             or an error code, which can be tested using ZSTD_isError() */
 size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t srcSize)
 {
-    const BYTE* ip = (const BYTE*)src;
+	const BYTE* ip = (const BYTE*)src;
 
-    if (srcSize < ZSTD_frameHeaderSize_prefix) return ZSTD_frameHeaderSize_prefix;
-    if (MEM_readLE32(src) != ZSTD_MAGICNUMBER) {
-        if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-            if (srcSize < ZSTD_skippableHeaderSize) return ZSTD_skippableHeaderSize; /* magic number + skippable frame length */
-            memset(fparamsPtr, 0, sizeof(*fparamsPtr));
-            fparamsPtr->frameContentSize = MEM_readLE32((const char *)src + 4);
-            fparamsPtr->windowSize = 0; /* windowSize==0 means a frame is skippable */
-            return 0;
-        }
-        return ERROR(prefix_unknown);
-    }
+	if (srcSize < ZSTD_frameHeaderSize_prefix) return ZSTD_frameHeaderSize_prefix;
+	if (MEM_readLE32(src) != ZSTD_MAGICNUMBER) {
+		if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+			if (srcSize < ZSTD_skippableHeaderSize) return ZSTD_skippableHeaderSize; /* magic number + skippable frame length */
+			memset(fparamsPtr, 0, sizeof(*fparamsPtr));
+			fparamsPtr->frameContentSize = MEM_readLE32((const char *)src + 4);
+			fparamsPtr->windowSize = 0; /* windowSize==0 means a frame is skippable */
+			return 0;
+		}
+		return ERROR(prefix_unknown);
+	}
 
-    /* ensure there is enough `srcSize` to fully read/decode frame header */
-    { size_t const fhsize = ZSTD_frameHeaderSize(src, srcSize);
-      if (srcSize < fhsize) return fhsize; }
+	/* ensure there is enough `srcSize` to fully read/decode frame header */
+	{ size_t const fhsize = ZSTD_frameHeaderSize(src, srcSize);
+	  if (srcSize < fhsize) return fhsize; }
 
-    {   BYTE const fhdByte = ip[4];
-        size_t pos = 5;
-        U32 const dictIDSizeCode = fhdByte&3;
-        U32 const checksumFlag = (fhdByte>>2)&1;
-        U32 const singleSegment = (fhdByte>>5)&1;
-        U32 const fcsID = fhdByte>>6;
-        U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;
-        U32 windowSize = 0;
-        U32 dictID = 0;
-        U64 frameContentSize = 0;
-        if ((fhdByte & 0x08) != 0) return ERROR(frameParameter_unsupported);   /* reserved bits, which must be zero */
-        if (!singleSegment) {
-            BYTE const wlByte = ip[pos++];
-            U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
-            if (windowLog > ZSTD_WINDOWLOG_MAX) return ERROR(frameParameter_windowTooLarge);  /* avoids issue with 1 << windowLog */
-            windowSize = (1U << windowLog);
-            windowSize += (windowSize >> 3) * (wlByte&7);
-        }
+	{   BYTE const fhdByte = ip[4];
+		size_t pos = 5;
+		U32 const dictIDSizeCode = fhdByte&3;
+		U32 const checksumFlag = (fhdByte>>2)&1;
+		U32 const singleSegment = (fhdByte>>5)&1;
+		U32 const fcsID = fhdByte>>6;
+		U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;
+		U32 windowSize = 0;
+		U32 dictID = 0;
+		U64 frameContentSize = 0;
+		if ((fhdByte & 0x08) != 0) return ERROR(frameParameter_unsupported);   /* reserved bits, which must be zero */
+		if (!singleSegment) {
+			BYTE const wlByte = ip[pos++];
+			U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
+			if (windowLog > ZSTD_WINDOWLOG_MAX) return ERROR(frameParameter_windowTooLarge);  /* avoids issue with 1 << windowLog */
+			windowSize = (1U << windowLog);
+			windowSize += (windowSize >> 3) * (wlByte&7);
+		}
 
-        switch(dictIDSizeCode)
-        {
-            default:   /* impossible */
-            case 0 : break;
-            case 1 : dictID = ip[pos]; pos++; break;
-            case 2 : dictID = MEM_readLE16(ip+pos); pos+=2; break;
-            case 3 : dictID = MEM_readLE32(ip+pos); pos+=4; break;
-        }
-        switch(fcsID)
-        {
-            default:   /* impossible */
-            case 0 : if (singleSegment) frameContentSize = ip[pos]; break;
-            case 1 : frameContentSize = MEM_readLE16(ip+pos)+256; break;
-            case 2 : frameContentSize = MEM_readLE32(ip+pos); break;
-            case 3 : frameContentSize = MEM_readLE64(ip+pos); break;
-        }
-        if (!windowSize) windowSize = (U32)frameContentSize;
-        if (windowSize > windowSizeMax) return ERROR(frameParameter_windowTooLarge);
-        fparamsPtr->frameContentSize = frameContentSize;
-        fparamsPtr->windowSize = windowSize;
-        fparamsPtr->dictID = dictID;
-        fparamsPtr->checksumFlag = checksumFlag;
-    }
-    return 0;
+		switch(dictIDSizeCode)
+		{
+			default:   /* impossible */
+			case 0 : break;
+			case 1 : dictID = ip[pos]; pos++; break;
+			case 2 : dictID = MEM_readLE16(ip+pos); pos+=2; break;
+			case 3 : dictID = MEM_readLE32(ip+pos); pos+=4; break;
+		}
+		switch(fcsID)
+		{
+			default:   /* impossible */
+			case 0 : if (singleSegment) frameContentSize = ip[pos]; break;
+			case 1 : frameContentSize = MEM_readLE16(ip+pos)+256; break;
+			case 2 : frameContentSize = MEM_readLE32(ip+pos); break;
+			case 3 : frameContentSize = MEM_readLE64(ip+pos); break;
+		}
+		if (!windowSize) windowSize = (U32)frameContentSize;
+		if (windowSize > windowSizeMax) return ERROR(frameParameter_windowTooLarge);
+		fparamsPtr->frameContentSize = frameContentSize;
+		fparamsPtr->windowSize = windowSize;
+		fparamsPtr->dictID = dictID;
+		fparamsPtr->checksumFlag = checksumFlag;
+	}
+	return 0;
 }
 
 /** ZSTD_getFrameContentSize() :
@@ -321,23 +321,23 @@ size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t
 unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
 {
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(src, srcSize)) {
-        unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
-        return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
-    }
+	if (ZSTD_isLegacy(src, srcSize)) {
+		unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
+		return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
+	}
 #endif
-    {
-        ZSTD_frameParams fParams;
-        if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0) return ZSTD_CONTENTSIZE_ERROR;
-        if (fParams.windowSize == 0) {
-            /* Either skippable or empty frame, size == 0 either way */
-            return 0;
-        } else if (fParams.frameContentSize != 0) {
-            return fParams.frameContentSize;
-        } else {
-            return ZSTD_CONTENTSIZE_UNKNOWN;
-        }
-    }
+	{
+		ZSTD_frameParams fParams;
+		if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0) return ZSTD_CONTENTSIZE_ERROR;
+		if (fParams.windowSize == 0) {
+			/* Either skippable or empty frame, size == 0 either way */
+			return 0;
+		} else if (fParams.frameContentSize != 0) {
+			return fParams.frameContentSize;
+		} else {
+			return ZSTD_CONTENTSIZE_UNKNOWN;
+		}
+	}
 }
 
 /** ZSTD_findDecompressedSize() :
@@ -347,64 +347,64 @@ unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
  *  @return : decompressed size of the frames contained */
 unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize)
 {
-    {
-        unsigned long long totalDstSize = 0;
-        while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-            const U32 magicNumber = MEM_readLE32(src);
+	{
+		unsigned long long totalDstSize = 0;
+		while (srcSize >= ZSTD_frameHeaderSize_prefix) {
+			const U32 magicNumber = MEM_readLE32(src);
 
-            if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-                size_t skippableSize;
-                if (srcSize < ZSTD_skippableHeaderSize)
-                    return ERROR(srcSize_wrong);
-                skippableSize = MEM_readLE32((const BYTE *)src + 4) +
-                                ZSTD_skippableHeaderSize;
-                if (srcSize < skippableSize) {
-                    return ZSTD_CONTENTSIZE_ERROR;
-                }
+			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+				size_t skippableSize;
+				if (srcSize < ZSTD_skippableHeaderSize)
+					return ERROR(srcSize_wrong);
+				skippableSize = MEM_readLE32((const BYTE *)src + 4) +
+								ZSTD_skippableHeaderSize;
+				if (srcSize < skippableSize) {
+					return ZSTD_CONTENTSIZE_ERROR;
+				}
 
-                src = (const BYTE *)src + skippableSize;
-                srcSize -= skippableSize;
-                continue;
-            }
+				src = (const BYTE *)src + skippableSize;
+				srcSize -= skippableSize;
+				continue;
+			}
 
-            {
-                unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-                if (ret >= ZSTD_CONTENTSIZE_ERROR) return ret;
+			{
+				unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+				if (ret >= ZSTD_CONTENTSIZE_ERROR) return ret;
 
-                /* check for overflow */
-                if (totalDstSize + ret < totalDstSize) return ZSTD_CONTENTSIZE_ERROR;
-                totalDstSize += ret;
-            }
-            {
-                size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
-                if (ZSTD_isError(frameSrcSize)) {
-                    return ZSTD_CONTENTSIZE_ERROR;
-                }
+				/* check for overflow */
+				if (totalDstSize + ret < totalDstSize) return ZSTD_CONTENTSIZE_ERROR;
+				totalDstSize += ret;
+			}
+			{
+				size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
+				if (ZSTD_isError(frameSrcSize)) {
+					return ZSTD_CONTENTSIZE_ERROR;
+				}
 
-                src = (const BYTE *)src + frameSrcSize;
-                srcSize -= frameSrcSize;
-            }
-        }
+				src = (const BYTE *)src + frameSrcSize;
+				srcSize -= frameSrcSize;
+			}
+		}
 
-        if (srcSize) {
-            return ZSTD_CONTENTSIZE_ERROR;
-        }
+		if (srcSize) {
+			return ZSTD_CONTENTSIZE_ERROR;
+		}
 
-        return totalDstSize;
-    }
+		return totalDstSize;
+	}
 }
 
 /** ZSTD_getDecompressedSize() :
 *   compatible with legacy mode
 *   @return : decompressed size if known, 0 otherwise
-              note : 0 can mean any of the following :
-                   - decompressed size is not present within frame header
-                   - frame header unknown / not supported
-                   - frame header not complete (`srcSize` too small) */
+			  note : 0 can mean any of the following :
+				   - decompressed size is not present within frame header
+				   - frame header unknown / not supported
+				   - frame header not complete (`srcSize` too small) */
 unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
 {
-    unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-    return ret >= ZSTD_CONTENTSIZE_ERROR ? 0 : ret;
+	unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+	return ret >= ZSTD_CONTENTSIZE_ERROR ? 0 : ret;
 }
 
 
@@ -413,517 +413,517 @@ unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
 *   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
 static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx* dctx, const void* src, size_t headerSize)
 {
-    size_t const result = ZSTD_getFrameParams(&(dctx->fParams), src, headerSize);
-    if (ZSTD_isError(result)) return result;  /* invalid header */
-    if (result>0) return ERROR(srcSize_wrong);   /* headerSize too small */
-    if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID)) return ERROR(dictionary_wrong);
-    if (dctx->fParams.checksumFlag) XXH64_reset(&dctx->xxhState, 0);
-    return 0;
+	size_t const result = ZSTD_getFrameParams(&(dctx->fParams), src, headerSize);
+	if (ZSTD_isError(result)) return result;  /* invalid header */
+	if (result>0) return ERROR(srcSize_wrong);   /* headerSize too small */
+	if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID)) return ERROR(dictionary_wrong);
+	if (dctx->fParams.checksumFlag) XXH64_reset(&dctx->xxhState, 0);
+	return 0;
 }
 
 
 typedef struct
 {
-    blockType_e blockType;
-    U32 lastBlock;
-    U32 origSize;
+	blockType_e blockType;
+	U32 lastBlock;
+	U32 origSize;
 } blockProperties_t;
 
 /*! ZSTD_getcBlockSize() :
 *   Provides the size of compressed block from block header `src` */
 size_t ZSTD_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)
 {
-    if (srcSize < ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-    {   U32 const cBlockHeader = MEM_readLE24(src);
-        U32 const cSize = cBlockHeader >> 3;
-        bpPtr->lastBlock = cBlockHeader & 1;
-        bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
-        bpPtr->origSize = cSize;   /* only useful for RLE */
-        if (bpPtr->blockType == bt_rle) return 1;
-        if (bpPtr->blockType == bt_reserved) return ERROR(corruption_detected);
-        return cSize;
-    }
+	if (srcSize < ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+	{   U32 const cBlockHeader = MEM_readLE24(src);
+		U32 const cSize = cBlockHeader >> 3;
+		bpPtr->lastBlock = cBlockHeader & 1;
+		bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
+		bpPtr->origSize = cSize;   /* only useful for RLE */
+		if (bpPtr->blockType == bt_rle) return 1;
+		if (bpPtr->blockType == bt_reserved) return ERROR(corruption_detected);
+		return cSize;
+	}
 }
 
 
 static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    if (srcSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memcpy(dst, src, srcSize);
-    return srcSize;
+	if (srcSize > dstCapacity) return ERROR(dstSize_tooSmall);
+	memcpy(dst, src, srcSize);
+	return srcSize;
 }
 
 
 static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize, size_t regenSize)
 {
-    if (srcSize != 1) return ERROR(srcSize_wrong);
-    if (regenSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memset(dst, *(const BYTE*)src, regenSize);
-    return regenSize;
+	if (srcSize != 1) return ERROR(srcSize_wrong);
+	if (regenSize > dstCapacity) return ERROR(dstSize_tooSmall);
+	memset(dst, *(const BYTE*)src, regenSize);
+	return regenSize;
 }
 
 /*! ZSTD_decodeLiteralsBlock() :
-    @return : nb of bytes read from src (< srcSize ) */
+	@return : nb of bytes read from src (< srcSize ) */
 size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx* dctx,
-                          const void* src, size_t srcSize)   /* note : srcSize < BLOCKSIZE */
+						  const void* src, size_t srcSize)   /* note : srcSize < BLOCKSIZE */
 {
-    if (srcSize < MIN_CBLOCK_SIZE) return ERROR(corruption_detected);
+	if (srcSize < MIN_CBLOCK_SIZE) return ERROR(corruption_detected);
 
-    {   const BYTE* const istart = (const BYTE*) src;
-        symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
+	{   const BYTE* const istart = (const BYTE*) src;
+		symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
 
-        switch(litEncType)
-        {
-        case set_repeat:
-            if (dctx->litEntropy==0) return ERROR(dictionary_corrupted);
-            /* fall-through */
-        case set_compressed:
-            if (srcSize < 5) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
-            {   size_t lhSize, litSize, litCSize;
-                U32 singleStream=0;
-                U32 const lhlCode = (istart[0] >> 2) & 3;
-                U32 const lhc = MEM_readLE32(istart);
-                switch(lhlCode)
-                {
-                case 0: case 1: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    /* 2 - 2 - 10 - 10 */
-                    singleStream = !lhlCode;
-                    lhSize = 3;
-                    litSize  = (lhc >> 4) & 0x3FF;
-                    litCSize = (lhc >> 14) & 0x3FF;
-                    break;
-                case 2:
-                    /* 2 - 2 - 14 - 14 */
-                    lhSize = 4;
-                    litSize  = (lhc >> 4) & 0x3FFF;
-                    litCSize = lhc >> 18;
-                    break;
-                case 3:
-                    /* 2 - 2 - 18 - 18 */
-                    lhSize = 5;
-                    litSize  = (lhc >> 4) & 0x3FFFF;
-                    litCSize = (lhc >> 22) + (istart[4] << 10);
-                    break;
-                }
-                if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
-                if (litCSize + lhSize > srcSize) return ERROR(corruption_detected);
+		switch(litEncType)
+		{
+		case set_repeat:
+			if (dctx->litEntropy==0) return ERROR(dictionary_corrupted);
+			/* fall-through */
+		case set_compressed:
+			if (srcSize < 5) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
+			{   size_t lhSize, litSize, litCSize;
+				U32 singleStream=0;
+				U32 const lhlCode = (istart[0] >> 2) & 3;
+				U32 const lhc = MEM_readLE32(istart);
+				switch(lhlCode)
+				{
+				case 0: case 1: default:   /* note : default is impossible, since lhlCode into [0..3] */
+					/* 2 - 2 - 10 - 10 */
+					singleStream = !lhlCode;
+					lhSize = 3;
+					litSize  = (lhc >> 4) & 0x3FF;
+					litCSize = (lhc >> 14) & 0x3FF;
+					break;
+				case 2:
+					/* 2 - 2 - 14 - 14 */
+					lhSize = 4;
+					litSize  = (lhc >> 4) & 0x3FFF;
+					litCSize = lhc >> 18;
+					break;
+				case 3:
+					/* 2 - 2 - 18 - 18 */
+					lhSize = 5;
+					litSize  = (lhc >> 4) & 0x3FFFF;
+					litCSize = (lhc >> 22) + (istart[4] << 10);
+					break;
+				}
+				if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
+				if (litCSize + lhSize > srcSize) return ERROR(corruption_detected);
 
-                if (HUF_isError((litEncType==set_repeat) ?
-                                    ( singleStream ?
-                                        HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) :
-                                        HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) ) :
-                                    ( singleStream ?
-                                        HUF_decompress1X2_DCtx(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize) :
-                                        HUF_decompress4X_hufOnly (dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize)) ))
-                    return ERROR(corruption_detected);
+				if (HUF_isError((litEncType==set_repeat) ?
+									( singleStream ?
+										HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) :
+										HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) ) :
+									( singleStream ?
+										HUF_decompress1X2_DCtx(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize) :
+										HUF_decompress4X_hufOnly (dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize)) ))
+					return ERROR(corruption_detected);
 
-                dctx->litPtr = dctx->litBuffer;
-                dctx->litSize = litSize;
-                dctx->litEntropy = 1;
-                if (litEncType==set_compressed) dctx->HUFptr = dctx->entropy.hufTable;
-                memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-                return litCSize + lhSize;
-            }
+				dctx->litPtr = dctx->litBuffer;
+				dctx->litSize = litSize;
+				dctx->litEntropy = 1;
+				if (litEncType==set_compressed) dctx->HUFptr = dctx->entropy.hufTable;
+				memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+				return litCSize + lhSize;
+			}
 
-        case set_basic:
-            {   size_t litSize, lhSize;
-                U32 const lhlCode = ((istart[0]) >> 2) & 3;
-                switch(lhlCode)
-                {
-                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    lhSize = 1;
-                    litSize = istart[0] >> 3;
-                    break;
-                case 1:
-                    lhSize = 2;
-                    litSize = MEM_readLE16(istart) >> 4;
-                    break;
-                case 3:
-                    lhSize = 3;
-                    litSize = MEM_readLE24(istart) >> 4;
-                    break;
-                }
+		case set_basic:
+			{   size_t litSize, lhSize;
+				U32 const lhlCode = ((istart[0]) >> 2) & 3;
+				switch(lhlCode)
+				{
+				case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+					lhSize = 1;
+					litSize = istart[0] >> 3;
+					break;
+				case 1:
+					lhSize = 2;
+					litSize = MEM_readLE16(istart) >> 4;
+					break;
+				case 3:
+					lhSize = 3;
+					litSize = MEM_readLE24(istart) >> 4;
+					break;
+				}
 
-                if (lhSize+litSize+WILDCOPY_OVERLENGTH > srcSize) {  /* risk reading beyond src buffer with wildcopy */
-                    if (litSize+lhSize > srcSize) return ERROR(corruption_detected);
-                    memcpy(dctx->litBuffer, istart+lhSize, litSize);
-                    dctx->litPtr = dctx->litBuffer;
-                    dctx->litSize = litSize;
-                    memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-                    return lhSize+litSize;
-                }
-                /* direct reference into compressed stream */
-                dctx->litPtr = istart+lhSize;
-                dctx->litSize = litSize;
-                return lhSize+litSize;
-            }
+				if (lhSize+litSize+WILDCOPY_OVERLENGTH > srcSize) {  /* risk reading beyond src buffer with wildcopy */
+					if (litSize+lhSize > srcSize) return ERROR(corruption_detected);
+					memcpy(dctx->litBuffer, istart+lhSize, litSize);
+					dctx->litPtr = dctx->litBuffer;
+					dctx->litSize = litSize;
+					memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+					return lhSize+litSize;
+				}
+				/* direct reference into compressed stream */
+				dctx->litPtr = istart+lhSize;
+				dctx->litSize = litSize;
+				return lhSize+litSize;
+			}
 
-        case set_rle:
-            {   U32 const lhlCode = ((istart[0]) >> 2) & 3;
-                size_t litSize, lhSize;
-                switch(lhlCode)
-                {
-                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    lhSize = 1;
-                    litSize = istart[0] >> 3;
-                    break;
-                case 1:
-                    lhSize = 2;
-                    litSize = MEM_readLE16(istart) >> 4;
-                    break;
-                case 3:
-                    lhSize = 3;
-                    litSize = MEM_readLE24(istart) >> 4;
-                    if (srcSize<4) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
-                    break;
-                }
-                if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
-                memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
-                dctx->litPtr = dctx->litBuffer;
-                dctx->litSize = litSize;
-                return lhSize+1;
-            }
-        default:
-            return ERROR(corruption_detected);   /* impossible */
-        }
-    }
+		case set_rle:
+			{   U32 const lhlCode = ((istart[0]) >> 2) & 3;
+				size_t litSize, lhSize;
+				switch(lhlCode)
+				{
+				case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+					lhSize = 1;
+					litSize = istart[0] >> 3;
+					break;
+				case 1:
+					lhSize = 2;
+					litSize = MEM_readLE16(istart) >> 4;
+					break;
+				case 3:
+					lhSize = 3;
+					litSize = MEM_readLE24(istart) >> 4;
+					if (srcSize<4) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
+					break;
+				}
+				if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(corruption_detected);
+				memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
+				dctx->litPtr = dctx->litBuffer;
+				dctx->litSize = litSize;
+				return lhSize+1;
+			}
+		default:
+			return ERROR(corruption_detected);   /* impossible */
+		}
+	}
 }
 
 
 typedef union {
-    FSE_decode_t realData;
-    U32 alignedBy4;
+	FSE_decode_t realData;
+	U32 alignedBy4;
 } FSE_decode_t4;
 
 static const FSE_decode_t4 LL_defaultDTable[(1<<LL_DEFAULTNORMLOG)+1] = {
-    { { LL_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  4 } },              /* 0 : base, symbol, bits */
-    { { 16,  0,  4 } },
-    { { 32,  1,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  4,  5 } },
-    { {  0,  6,  5 } },
-    { {  0,  7,  5 } },
-    { {  0,  9,  5 } },
-    { {  0, 10,  5 } },
-    { {  0, 12,  5 } },
-    { {  0, 14,  6 } },
-    { {  0, 16,  5 } },
-    { {  0, 18,  5 } },
-    { {  0, 19,  5 } },
-    { {  0, 21,  5 } },
-    { {  0, 22,  5 } },
-    { {  0, 24,  5 } },
-    { { 32, 25,  5 } },
-    { {  0, 26,  5 } },
-    { {  0, 27,  6 } },
-    { {  0, 29,  6 } },
-    { {  0, 31,  6 } },
-    { { 32,  0,  4 } },
-    { {  0,  1,  4 } },
-    { {  0,  2,  5 } },
-    { { 32,  4,  5 } },
-    { {  0,  5,  5 } },
-    { { 32,  7,  5 } },
-    { {  0,  8,  5 } },
-    { { 32, 10,  5 } },
-    { {  0, 11,  5 } },
-    { {  0, 13,  6 } },
-    { { 32, 16,  5 } },
-    { {  0, 17,  5 } },
-    { { 32, 19,  5 } },
-    { {  0, 20,  5 } },
-    { { 32, 22,  5 } },
-    { {  0, 23,  5 } },
-    { {  0, 25,  4 } },
-    { { 16, 25,  4 } },
-    { { 32, 26,  5 } },
-    { {  0, 28,  6 } },
-    { {  0, 30,  6 } },
-    { { 48,  0,  4 } },
-    { { 16,  1,  4 } },
-    { { 32,  2,  5 } },
-    { { 32,  3,  5 } },
-    { { 32,  5,  5 } },
-    { { 32,  6,  5 } },
-    { { 32,  8,  5 } },
-    { { 32,  9,  5 } },
-    { { 32, 11,  5 } },
-    { { 32, 12,  5 } },
-    { {  0, 15,  6 } },
-    { { 32, 17,  5 } },
-    { { 32, 18,  5 } },
-    { { 32, 20,  5 } },
-    { { 32, 21,  5 } },
-    { { 32, 23,  5 } },
-    { { 32, 24,  5 } },
-    { {  0, 35,  6 } },
-    { {  0, 34,  6 } },
-    { {  0, 33,  6 } },
-    { {  0, 32,  6 } },
+	{ { LL_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+	{ {  0,  0,  4 } },              /* 0 : base, symbol, bits */
+	{ { 16,  0,  4 } },
+	{ { 32,  1,  5 } },
+	{ {  0,  3,  5 } },
+	{ {  0,  4,  5 } },
+	{ {  0,  6,  5 } },
+	{ {  0,  7,  5 } },
+	{ {  0,  9,  5 } },
+	{ {  0, 10,  5 } },
+	{ {  0, 12,  5 } },
+	{ {  0, 14,  6 } },
+	{ {  0, 16,  5 } },
+	{ {  0, 18,  5 } },
+	{ {  0, 19,  5 } },
+	{ {  0, 21,  5 } },
+	{ {  0, 22,  5 } },
+	{ {  0, 24,  5 } },
+	{ { 32, 25,  5 } },
+	{ {  0, 26,  5 } },
+	{ {  0, 27,  6 } },
+	{ {  0, 29,  6 } },
+	{ {  0, 31,  6 } },
+	{ { 32,  0,  4 } },
+	{ {  0,  1,  4 } },
+	{ {  0,  2,  5 } },
+	{ { 32,  4,  5 } },
+	{ {  0,  5,  5 } },
+	{ { 32,  7,  5 } },
+	{ {  0,  8,  5 } },
+	{ { 32, 10,  5 } },
+	{ {  0, 11,  5 } },
+	{ {  0, 13,  6 } },
+	{ { 32, 16,  5 } },
+	{ {  0, 17,  5 } },
+	{ { 32, 19,  5 } },
+	{ {  0, 20,  5 } },
+	{ { 32, 22,  5 } },
+	{ {  0, 23,  5 } },
+	{ {  0, 25,  4 } },
+	{ { 16, 25,  4 } },
+	{ { 32, 26,  5 } },
+	{ {  0, 28,  6 } },
+	{ {  0, 30,  6 } },
+	{ { 48,  0,  4 } },
+	{ { 16,  1,  4 } },
+	{ { 32,  2,  5 } },
+	{ { 32,  3,  5 } },
+	{ { 32,  5,  5 } },
+	{ { 32,  6,  5 } },
+	{ { 32,  8,  5 } },
+	{ { 32,  9,  5 } },
+	{ { 32, 11,  5 } },
+	{ { 32, 12,  5 } },
+	{ {  0, 15,  6 } },
+	{ { 32, 17,  5 } },
+	{ { 32, 18,  5 } },
+	{ { 32, 20,  5 } },
+	{ { 32, 21,  5 } },
+	{ { 32, 23,  5 } },
+	{ { 32, 24,  5 } },
+	{ {  0, 35,  6 } },
+	{ {  0, 34,  6 } },
+	{ {  0, 33,  6 } },
+	{ {  0, 32,  6 } },
 };   /* LL_defaultDTable */
 
 static const FSE_decode_t4 ML_defaultDTable[(1<<ML_DEFAULTNORMLOG)+1] = {
-    { { ML_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  6 } },              /* 0 : base, symbol, bits */
-    { {  0,  1,  4 } },
-    { { 32,  2,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  5,  5 } },
-    { {  0,  6,  5 } },
-    { {  0,  8,  5 } },
-    { {  0, 10,  6 } },
-    { {  0, 13,  6 } },
-    { {  0, 16,  6 } },
-    { {  0, 19,  6 } },
-    { {  0, 22,  6 } },
-    { {  0, 25,  6 } },
-    { {  0, 28,  6 } },
-    { {  0, 31,  6 } },
-    { {  0, 33,  6 } },
-    { {  0, 35,  6 } },
-    { {  0, 37,  6 } },
-    { {  0, 39,  6 } },
-    { {  0, 41,  6 } },
-    { {  0, 43,  6 } },
-    { {  0, 45,  6 } },
-    { { 16,  1,  4 } },
-    { {  0,  2,  4 } },
-    { { 32,  3,  5 } },
-    { {  0,  4,  5 } },
-    { { 32,  6,  5 } },
-    { {  0,  7,  5 } },
-    { {  0,  9,  6 } },
-    { {  0, 12,  6 } },
-    { {  0, 15,  6 } },
-    { {  0, 18,  6 } },
-    { {  0, 21,  6 } },
-    { {  0, 24,  6 } },
-    { {  0, 27,  6 } },
-    { {  0, 30,  6 } },
-    { {  0, 32,  6 } },
-    { {  0, 34,  6 } },
-    { {  0, 36,  6 } },
-    { {  0, 38,  6 } },
-    { {  0, 40,  6 } },
-    { {  0, 42,  6 } },
-    { {  0, 44,  6 } },
-    { { 32,  1,  4 } },
-    { { 48,  1,  4 } },
-    { { 16,  2,  4 } },
-    { { 32,  4,  5 } },
-    { { 32,  5,  5 } },
-    { { 32,  7,  5 } },
-    { { 32,  8,  5 } },
-    { {  0, 11,  6 } },
-    { {  0, 14,  6 } },
-    { {  0, 17,  6 } },
-    { {  0, 20,  6 } },
-    { {  0, 23,  6 } },
-    { {  0, 26,  6 } },
-    { {  0, 29,  6 } },
-    { {  0, 52,  6 } },
-    { {  0, 51,  6 } },
-    { {  0, 50,  6 } },
-    { {  0, 49,  6 } },
-    { {  0, 48,  6 } },
-    { {  0, 47,  6 } },
-    { {  0, 46,  6 } },
+	{ { ML_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+	{ {  0,  0,  6 } },              /* 0 : base, symbol, bits */
+	{ {  0,  1,  4 } },
+	{ { 32,  2,  5 } },
+	{ {  0,  3,  5 } },
+	{ {  0,  5,  5 } },
+	{ {  0,  6,  5 } },
+	{ {  0,  8,  5 } },
+	{ {  0, 10,  6 } },
+	{ {  0, 13,  6 } },
+	{ {  0, 16,  6 } },
+	{ {  0, 19,  6 } },
+	{ {  0, 22,  6 } },
+	{ {  0, 25,  6 } },
+	{ {  0, 28,  6 } },
+	{ {  0, 31,  6 } },
+	{ {  0, 33,  6 } },
+	{ {  0, 35,  6 } },
+	{ {  0, 37,  6 } },
+	{ {  0, 39,  6 } },
+	{ {  0, 41,  6 } },
+	{ {  0, 43,  6 } },
+	{ {  0, 45,  6 } },
+	{ { 16,  1,  4 } },
+	{ {  0,  2,  4 } },
+	{ { 32,  3,  5 } },
+	{ {  0,  4,  5 } },
+	{ { 32,  6,  5 } },
+	{ {  0,  7,  5 } },
+	{ {  0,  9,  6 } },
+	{ {  0, 12,  6 } },
+	{ {  0, 15,  6 } },
+	{ {  0, 18,  6 } },
+	{ {  0, 21,  6 } },
+	{ {  0, 24,  6 } },
+	{ {  0, 27,  6 } },
+	{ {  0, 30,  6 } },
+	{ {  0, 32,  6 } },
+	{ {  0, 34,  6 } },
+	{ {  0, 36,  6 } },
+	{ {  0, 38,  6 } },
+	{ {  0, 40,  6 } },
+	{ {  0, 42,  6 } },
+	{ {  0, 44,  6 } },
+	{ { 32,  1,  4 } },
+	{ { 48,  1,  4 } },
+	{ { 16,  2,  4 } },
+	{ { 32,  4,  5 } },
+	{ { 32,  5,  5 } },
+	{ { 32,  7,  5 } },
+	{ { 32,  8,  5 } },
+	{ {  0, 11,  6 } },
+	{ {  0, 14,  6 } },
+	{ {  0, 17,  6 } },
+	{ {  0, 20,  6 } },
+	{ {  0, 23,  6 } },
+	{ {  0, 26,  6 } },
+	{ {  0, 29,  6 } },
+	{ {  0, 52,  6 } },
+	{ {  0, 51,  6 } },
+	{ {  0, 50,  6 } },
+	{ {  0, 49,  6 } },
+	{ {  0, 48,  6 } },
+	{ {  0, 47,  6 } },
+	{ {  0, 46,  6 } },
 };   /* ML_defaultDTable */
 
 static const FSE_decode_t4 OF_defaultDTable[(1<<OF_DEFAULTNORMLOG)+1] = {
-    { { OF_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  5 } },              /* 0 : base, symbol, bits */
-    { {  0,  6,  4 } },
-    { {  0,  9,  5 } },
-    { {  0, 15,  5 } },
-    { {  0, 21,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  7,  4 } },
-    { {  0, 12,  5 } },
-    { {  0, 18,  5 } },
-    { {  0, 23,  5 } },
-    { {  0,  5,  5 } },
-    { {  0,  8,  4 } },
-    { {  0, 14,  5 } },
-    { {  0, 20,  5 } },
-    { {  0,  2,  5 } },
-    { { 16,  7,  4 } },
-    { {  0, 11,  5 } },
-    { {  0, 17,  5 } },
-    { {  0, 22,  5 } },
-    { {  0,  4,  5 } },
-    { { 16,  8,  4 } },
-    { {  0, 13,  5 } },
-    { {  0, 19,  5 } },
-    { {  0,  1,  5 } },
-    { { 16,  6,  4 } },
-    { {  0, 10,  5 } },
-    { {  0, 16,  5 } },
-    { {  0, 28,  5 } },
-    { {  0, 27,  5 } },
-    { {  0, 26,  5 } },
-    { {  0, 25,  5 } },
-    { {  0, 24,  5 } },
+	{ { OF_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
+	{ {  0,  0,  5 } },              /* 0 : base, symbol, bits */
+	{ {  0,  6,  4 } },
+	{ {  0,  9,  5 } },
+	{ {  0, 15,  5 } },
+	{ {  0, 21,  5 } },
+	{ {  0,  3,  5 } },
+	{ {  0,  7,  4 } },
+	{ {  0, 12,  5 } },
+	{ {  0, 18,  5 } },
+	{ {  0, 23,  5 } },
+	{ {  0,  5,  5 } },
+	{ {  0,  8,  4 } },
+	{ {  0, 14,  5 } },
+	{ {  0, 20,  5 } },
+	{ {  0,  2,  5 } },
+	{ { 16,  7,  4 } },
+	{ {  0, 11,  5 } },
+	{ {  0, 17,  5 } },
+	{ {  0, 22,  5 } },
+	{ {  0,  4,  5 } },
+	{ { 16,  8,  4 } },
+	{ {  0, 13,  5 } },
+	{ {  0, 19,  5 } },
+	{ {  0,  1,  5 } },
+	{ { 16,  6,  4 } },
+	{ {  0, 10,  5 } },
+	{ {  0, 16,  5 } },
+	{ {  0, 28,  5 } },
+	{ {  0, 27,  5 } },
+	{ {  0, 26,  5 } },
+	{ {  0, 25,  5 } },
+	{ {  0, 24,  5 } },
 };   /* OF_defaultDTable */
 
 /*! ZSTD_buildSeqTable() :
-    @return : nb bytes read from src,
-              or an error code if it fails, testable with ZSTD_isError()
+	@return : nb bytes read from src,
+			  or an error code if it fails, testable with ZSTD_isError()
 */
 static size_t ZSTD_buildSeqTable(FSE_DTable* DTableSpace, const FSE_DTable** DTablePtr,
-                                 symbolEncodingType_e type, U32 max, U32 maxLog,
-                                 const void* src, size_t srcSize,
-                                 const FSE_decode_t4* defaultTable, U32 flagRepeatTable)
+								 symbolEncodingType_e type, U32 max, U32 maxLog,
+								 const void* src, size_t srcSize,
+								 const FSE_decode_t4* defaultTable, U32 flagRepeatTable)
 {
-    const void* const tmpPtr = defaultTable;   /* bypass strict aliasing */
-    switch(type)
-    {
-    case set_rle :
-        if (!srcSize) return ERROR(srcSize_wrong);
-        if ( (*(const BYTE*)src) > max) return ERROR(corruption_detected);
-        FSE_buildDTable_rle(DTableSpace, *(const BYTE*)src);
-        *DTablePtr = DTableSpace;
-        return 1;
-    case set_basic :
-        *DTablePtr = (const FSE_DTable*)tmpPtr;
-        return 0;
-    case set_repeat:
-        if (!flagRepeatTable) return ERROR(corruption_detected);
-        return 0;
-    default :   /* impossible */
-    case set_compressed :
-        {   U32 tableLog;
-            S16 norm[MaxSeq+1];
-            size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
-            if (FSE_isError(headerSize)) return ERROR(corruption_detected);
-            if (tableLog > maxLog) return ERROR(corruption_detected);
-            FSE_buildDTable(DTableSpace, norm, max, tableLog);
-            *DTablePtr = DTableSpace;
-            return headerSize;
-    }   }
+	const void* const tmpPtr = defaultTable;   /* bypass strict aliasing */
+	switch(type)
+	{
+	case set_rle :
+		if (!srcSize) return ERROR(srcSize_wrong);
+		if ( (*(const BYTE*)src) > max) return ERROR(corruption_detected);
+		FSE_buildDTable_rle(DTableSpace, *(const BYTE*)src);
+		*DTablePtr = DTableSpace;
+		return 1;
+	case set_basic :
+		*DTablePtr = (const FSE_DTable*)tmpPtr;
+		return 0;
+	case set_repeat:
+		if (!flagRepeatTable) return ERROR(corruption_detected);
+		return 0;
+	default :   /* impossible */
+	case set_compressed :
+		{   U32 tableLog;
+			S16 norm[MaxSeq+1];
+			size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
+			if (FSE_isError(headerSize)) return ERROR(corruption_detected);
+			if (tableLog > maxLog) return ERROR(corruption_detected);
+			FSE_buildDTable(DTableSpace, norm, max, tableLog);
+			*DTablePtr = DTableSpace;
+			return headerSize;
+	}   }
 }
 
 size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx* dctx, int* nbSeqPtr,
-                             const void* src, size_t srcSize)
+							 const void* src, size_t srcSize)
 {
-    const BYTE* const istart = (const BYTE* const)src;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* ip = istart;
+	const BYTE* const istart = (const BYTE* const)src;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* ip = istart;
 
-    /* check */
-    if (srcSize < MIN_SEQUENCES_SIZE) return ERROR(srcSize_wrong);
+	/* check */
+	if (srcSize < MIN_SEQUENCES_SIZE) return ERROR(srcSize_wrong);
 
-    /* SeqHead */
-    {   int nbSeq = *ip++;
-        if (!nbSeq) { *nbSeqPtr=0; return 1; }
-        if (nbSeq > 0x7F) {
-            if (nbSeq == 0xFF) {
-                if (ip+2 > iend) return ERROR(srcSize_wrong);
-                nbSeq = MEM_readLE16(ip) + LONGNBSEQ, ip+=2;
-            } else {
-                if (ip >= iend) return ERROR(srcSize_wrong);
-                nbSeq = ((nbSeq-0x80)<<8) + *ip++;
-            }
-        }
-        *nbSeqPtr = nbSeq;
-    }
+	/* SeqHead */
+	{   int nbSeq = *ip++;
+		if (!nbSeq) { *nbSeqPtr=0; return 1; }
+		if (nbSeq > 0x7F) {
+			if (nbSeq == 0xFF) {
+				if (ip+2 > iend) return ERROR(srcSize_wrong);
+				nbSeq = MEM_readLE16(ip) + LONGNBSEQ, ip+=2;
+			} else {
+				if (ip >= iend) return ERROR(srcSize_wrong);
+				nbSeq = ((nbSeq-0x80)<<8) + *ip++;
+			}
+		}
+		*nbSeqPtr = nbSeq;
+	}
 
-    /* FSE table descriptors */
-    if (ip+4 > iend) return ERROR(srcSize_wrong); /* minimum possible size */
-    {   symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
-        symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
-        symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
-        ip++;
+	/* FSE table descriptors */
+	if (ip+4 > iend) return ERROR(srcSize_wrong); /* minimum possible size */
+	{   symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
+		symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
+		symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
+		ip++;
 
-        /* Build DTables */
-        {   size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr,
-                                                      LLtype, MaxLL, LLFSELog,
-                                                      ip, iend-ip, LL_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(llhSize)) return ERROR(corruption_detected);
-            ip += llhSize;
-        }
-        {   size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr,
-                                                      OFtype, MaxOff, OffFSELog,
-                                                      ip, iend-ip, OF_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(ofhSize)) return ERROR(corruption_detected);
-            ip += ofhSize;
-        }
-        {   size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr,
-                                                      MLtype, MaxML, MLFSELog,
-                                                      ip, iend-ip, ML_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(mlhSize)) return ERROR(corruption_detected);
-            ip += mlhSize;
-        }
-    }
+		/* Build DTables */
+		{   size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr,
+													  LLtype, MaxLL, LLFSELog,
+													  ip, iend-ip, LL_defaultDTable, dctx->fseEntropy);
+			if (ZSTD_isError(llhSize)) return ERROR(corruption_detected);
+			ip += llhSize;
+		}
+		{   size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr,
+													  OFtype, MaxOff, OffFSELog,
+													  ip, iend-ip, OF_defaultDTable, dctx->fseEntropy);
+			if (ZSTD_isError(ofhSize)) return ERROR(corruption_detected);
+			ip += ofhSize;
+		}
+		{   size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr,
+													  MLtype, MaxML, MLFSELog,
+													  ip, iend-ip, ML_defaultDTable, dctx->fseEntropy);
+			if (ZSTD_isError(mlhSize)) return ERROR(corruption_detected);
+			ip += mlhSize;
+		}
+	}
 
-    return ip-istart;
+	return ip-istart;
 }
 
 
 typedef struct {
-    size_t litLength;
-    size_t matchLength;
-    size_t offset;
-    const BYTE* match;
+	size_t litLength;
+	size_t matchLength;
+	size_t offset;
+	const BYTE* match;
 } seq_t;
 
 typedef struct {
-    BIT_DStream_t DStream;
-    FSE_DState_t stateLL;
-    FSE_DState_t stateOffb;
-    FSE_DState_t stateML;
-    size_t prevOffset[ZSTD_REP_NUM];
-    const BYTE* base;
-    size_t pos;
-    uPtrDiff gotoDict;
+	BIT_DStream_t DStream;
+	FSE_DState_t stateLL;
+	FSE_DState_t stateOffb;
+	FSE_DState_t stateML;
+	size_t prevOffset[ZSTD_REP_NUM];
+	const BYTE* base;
+	size_t pos;
+	uPtrDiff gotoDict;
 } seqState_t;
 
 
 FORCE_NOINLINE
 size_t ZSTD_execSequenceLast7(BYTE* op,
-                              BYTE* const oend, seq_t sequence,
-                              const BYTE** litPtr, const BYTE* const litLimit,
-                              const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+							  BYTE* const oend, seq_t sequence,
+							  const BYTE** litPtr, const BYTE* const litLimit,
+							  const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
 {
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = oLitEnd - sequence.offset;
+	BYTE* const oLitEnd = op + sequence.litLength;
+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+	BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+	BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+	const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+	const BYTE* match = oLitEnd - sequence.offset;
 
-    /* check */
-    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd <= oend_w) return ERROR(GENERIC);   /* Precondition */
+	/* check */
+	if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+	if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+	if (oLitEnd <= oend_w) return ERROR(GENERIC);   /* Precondition */
 
-    /* copy literals */
-    if (op < oend_w) {
-        ZSTD_wildcopy(op, *litPtr, oend_w - op);
-        *litPtr += oend_w - op;
-        op = oend_w;
-    }
-    while (op < oLitEnd) *op++ = *(*litPtr)++;
+	/* copy literals */
+	if (op < oend_w) {
+		ZSTD_wildcopy(op, *litPtr, oend_w - op);
+		*litPtr += oend_w - op;
+		op = oend_w;
+	}
+	while (op < oLitEnd) *op++ = *(*litPtr)++;
 
-    /* copy Match */
-    if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix */
-        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
-        match = dictEnd - (base-match);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = base;
-    }   }
-    while (op < oMatchEnd) *op++ = *match++;
-    return sequenceLength;
+	/* copy Match */
+	if (sequence.offset > (size_t)(oLitEnd - base)) {
+		/* offset beyond prefix */
+		if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+		match = dictEnd - (base-match);
+		if (match + sequence.matchLength <= dictEnd) {
+			memmove(oLitEnd, match, sequence.matchLength);
+			return sequenceLength;
+		}
+		/* span extDict & currentPrefixSegment */
+		{   size_t const length1 = dictEnd - match;
+			memmove(oLitEnd, match, length1);
+			op = oLitEnd + length1;
+			sequence.matchLength -= length1;
+			match = base;
+	}   }
+	while (op < oMatchEnd) *op++ = *match++;
+	return sequenceLength;
 }
 
 
@@ -931,538 +931,538 @@ size_t ZSTD_execSequenceLast7(BYTE* op,
 
 static seq_t ZSTD_decodeSequence(seqState_t* seqState)
 {
-    seq_t seq;
+	seq_t seq;
 
-    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
+	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
+	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
+	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
 
-    U32 const llBits = LL_bits[llCode];
-    U32 const mlBits = ML_bits[mlCode];
-    U32 const ofBits = ofCode;
-    U32 const totalBits = llBits+mlBits+ofBits;
+	U32 const llBits = LL_bits[llCode];
+	U32 const mlBits = ML_bits[mlCode];
+	U32 const ofBits = ofCode;
+	U32 const totalBits = llBits+mlBits+ofBits;
 
-    static const U32 LL_base[MaxLL+1] = {
-                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
-                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
-                            0x2000, 0x4000, 0x8000, 0x10000 };
+	static const U32 LL_base[MaxLL+1] = {
+							 0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
+							16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+							0x2000, 0x4000, 0x8000, 0x10000 };
 
-    static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
-                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
+	static const U32 ML_base[MaxML+1] = {
+							 3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
+							19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
+							35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+							0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
 
-    static const U32 OF_base[MaxOff+1] = {
-                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+	static const U32 OF_base[MaxOff+1] = {
+							 0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+							 0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+							 0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+							 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
 
-    /* sequence */
-    {   size_t offset;
-        if (!ofCode)
-            offset = 0;
-        else {
-            offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-            if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
-        }
+	/* sequence */
+	{   size_t offset;
+		if (!ofCode)
+			offset = 0;
+		else {
+			offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
+			if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
+		}
 
-        if (ofCode <= 1) {
-            offset += (llCode==0);
-            if (offset) {
-                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
-                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
-                seqState->prevOffset[1] = seqState->prevOffset[0];
-                seqState->prevOffset[0] = offset = temp;
-            } else {
-                offset = seqState->prevOffset[0];
-            }
-        } else {
-            seqState->prevOffset[2] = seqState->prevOffset[1];
-            seqState->prevOffset[1] = seqState->prevOffset[0];
-            seqState->prevOffset[0] = offset;
-        }
-        seq.offset = offset;
-    }
+		if (ofCode <= 1) {
+			offset += (llCode==0);
+			if (offset) {
+				size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
+				temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
+				if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
+				seqState->prevOffset[1] = seqState->prevOffset[0];
+				seqState->prevOffset[0] = offset = temp;
+			} else {
+				offset = seqState->prevOffset[0];
+			}
+		} else {
+			seqState->prevOffset[2] = seqState->prevOffset[1];
+			seqState->prevOffset[1] = seqState->prevOffset[0];
+			seqState->prevOffset[0] = offset;
+		}
+		seq.offset = offset;
+	}
 
-    seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
-    if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
+	seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
+	if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
 
-    seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
-    if (MEM_32bits() ||
-       (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
+	seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
+	if (MEM_32bits() ||
+	   (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
 
-    /* ANS state update */
-    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
-    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
-    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
-    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
+	/* ANS state update */
+	FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
+	FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
+	if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+	FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
 
-    return seq;
+	return seq;
 }
 
 
 FORCE_INLINE
 size_t ZSTD_execSequence(BYTE* op,
-                         BYTE* const oend, seq_t sequence,
-                         const BYTE** litPtr, const BYTE* const litLimit,
-                         const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+						 BYTE* const oend, seq_t sequence,
+						 const BYTE** litPtr, const BYTE* const litLimit,
+						 const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
 {
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = oLitEnd - sequence.offset;
+	BYTE* const oLitEnd = op + sequence.litLength;
+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+	BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+	BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+	const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+	const BYTE* match = oLitEnd - sequence.offset;
 
-    /* check */
-    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
+	/* check */
+	if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+	if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+	if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
 
-    /* copy Literals */
-    ZSTD_copy8(op, *litPtr);
-    if (sequence.litLength > 8)
-        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-    op = oLitEnd;
-    *litPtr = iLitEnd;   /* update for next sequence */
+	/* copy Literals */
+	ZSTD_copy8(op, *litPtr);
+	if (sequence.litLength > 8)
+		ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
+	op = oLitEnd;
+	*litPtr = iLitEnd;   /* update for next sequence */
 
-    /* copy Match */
-    if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix */
-        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
-        match = dictEnd + (match - base);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = base;
-            if (op > oend_w || sequence.matchLength < MINMATCH) {
-              U32 i;
-              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
-              return sequenceLength;
-            }
-    }   }
-    /* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
+	/* copy Match */
+	if (sequence.offset > (size_t)(oLitEnd - base)) {
+		/* offset beyond prefix */
+		if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+		match = dictEnd + (match - base);
+		if (match + sequence.matchLength <= dictEnd) {
+			memmove(oLitEnd, match, sequence.matchLength);
+			return sequenceLength;
+		}
+		/* span extDict & currentPrefixSegment */
+		{   size_t const length1 = dictEnd - match;
+			memmove(oLitEnd, match, length1);
+			op = oLitEnd + length1;
+			sequence.matchLength -= length1;
+			match = base;
+			if (op > oend_w || sequence.matchLength < MINMATCH) {
+			  U32 i;
+			  for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
+			  return sequenceLength;
+			}
+	}   }
+	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
 
-    /* match within prefix */
-    if (sequence.offset < 8) {
-        /* close range match, overlap */
-        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
-        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
-        int const sub2 = dec64table[sequence.offset];
-        op[0] = match[0];
-        op[1] = match[1];
-        op[2] = match[2];
-        op[3] = match[3];
-        match += dec32table[sequence.offset];
-        ZSTD_copy4(op+4, match);
-        match -= sub2;
-    } else {
-        ZSTD_copy8(op, match);
-    }
-    op += 8; match += 8;
+	/* match within prefix */
+	if (sequence.offset < 8) {
+		/* close range match, overlap */
+		static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
+		static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
+		int const sub2 = dec64table[sequence.offset];
+		op[0] = match[0];
+		op[1] = match[1];
+		op[2] = match[2];
+		op[3] = match[3];
+		match += dec32table[sequence.offset];
+		ZSTD_copy4(op+4, match);
+		match -= sub2;
+	} else {
+		ZSTD_copy8(op, match);
+	}
+	op += 8; match += 8;
 
-    if (oMatchEnd > oend-(16-MINMATCH)) {
-        if (op < oend_w) {
-            ZSTD_wildcopy(op, match, oend_w - op);
-            match += oend_w - op;
-            op = oend_w;
-        }
-        while (op < oMatchEnd) *op++ = *match++;
-    } else {
-        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
-    }
-    return sequenceLength;
+	if (oMatchEnd > oend-(16-MINMATCH)) {
+		if (op < oend_w) {
+			ZSTD_wildcopy(op, match, oend_w - op);
+			match += oend_w - op;
+			op = oend_w;
+		}
+		while (op < oMatchEnd) *op++ = *match++;
+	} else {
+		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
+	}
+	return sequenceLength;
 }
 
 
 static size_t ZSTD_decompressSequences(
-                               ZSTD_DCtx* dctx,
-                               void* dst, size_t maxDstSize,
-                         const void* seqStart, size_t seqSize)
+							   ZSTD_DCtx* dctx,
+							   void* dst, size_t maxDstSize,
+						 const void* seqStart, size_t seqSize)
 {
-    const BYTE* ip = (const BYTE*)seqStart;
-    const BYTE* const iend = ip + seqSize;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + maxDstSize;
-    BYTE* op = ostart;
-    const BYTE* litPtr = dctx->litPtr;
-    const BYTE* const litEnd = litPtr + dctx->litSize;
-    const BYTE* const base = (const BYTE*) (dctx->base);
-    const BYTE* const vBase = (const BYTE*) (dctx->vBase);
-    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
-    int nbSeq;
+	const BYTE* ip = (const BYTE*)seqStart;
+	const BYTE* const iend = ip + seqSize;
+	BYTE* const ostart = (BYTE* const)dst;
+	BYTE* const oend = ostart + maxDstSize;
+	BYTE* op = ostart;
+	const BYTE* litPtr = dctx->litPtr;
+	const BYTE* const litEnd = litPtr + dctx->litSize;
+	const BYTE* const base = (const BYTE*) (dctx->base);
+	const BYTE* const vBase = (const BYTE*) (dctx->vBase);
+	const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+	int nbSeq;
 
-    /* Build Decoding Tables */
-    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-        if (ZSTD_isError(seqHSize)) return seqHSize;
-        ip += seqHSize;
-    }
+	/* Build Decoding Tables */
+	{   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
+		if (ZSTD_isError(seqHSize)) return seqHSize;
+		ip += seqHSize;
+	}
 
-    /* Regen sequences */
-    if (nbSeq) {
-        seqState_t seqState;
-        dctx->fseEntropy = 1;
-        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
-        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
-        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+	/* Regen sequences */
+	if (nbSeq) {
+		seqState_t seqState;
+		dctx->fseEntropy = 1;
+		{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
+		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
 
-        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq ; ) {
-            nbSeq--;
-            {   seq_t const sequence = ZSTD_decodeSequence(&seqState);
-                size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
-                if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
-                op += oneSeqSize;
-        }   }
+		for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq ; ) {
+			nbSeq--;
+			{   seq_t const sequence = ZSTD_decodeSequence(&seqState);
+				size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
+				if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+				op += oneSeqSize;
+		}   }
 
-        /* check if reached exact end */
-        if (nbSeq) return ERROR(corruption_detected);
-        /* save reps for next block */
-        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
-    }
+		/* check if reached exact end */
+		if (nbSeq) return ERROR(corruption_detected);
+		/* save reps for next block */
+		{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+	}
 
-    /* last literal segment */
-    {   size_t const lastLLSize = litEnd - litPtr;
-        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
-        memcpy(op, litPtr, lastLLSize);
-        op += lastLLSize;
-    }
+	/* last literal segment */
+	{   size_t const lastLLSize = litEnd - litPtr;
+		if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
+		memcpy(op, litPtr, lastLLSize);
+		op += lastLLSize;
+	}
 
-    return op-ostart;
+	return op-ostart;
 }
 
 
 FORCE_INLINE seq_t ZSTD_decodeSequenceLong_generic(seqState_t* seqState, int const longOffsets)
 {
-    seq_t seq;
+	seq_t seq;
 
-    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
+	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
+	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
+	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= maxOff, by table construction */
 
-    U32 const llBits = LL_bits[llCode];
-    U32 const mlBits = ML_bits[mlCode];
-    U32 const ofBits = ofCode;
-    U32 const totalBits = llBits+mlBits+ofBits;
+	U32 const llBits = LL_bits[llCode];
+	U32 const mlBits = ML_bits[mlCode];
+	U32 const ofBits = ofCode;
+	U32 const totalBits = llBits+mlBits+ofBits;
 
-    static const U32 LL_base[MaxLL+1] = {
-                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
-                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
-                            0x2000, 0x4000, 0x8000, 0x10000 };
+	static const U32 LL_base[MaxLL+1] = {
+							 0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
+							16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+							0x2000, 0x4000, 0x8000, 0x10000 };
 
-    static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
-                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
+	static const U32 ML_base[MaxML+1] = {
+							 3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
+							19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
+							35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+							0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
 
-    static const U32 OF_base[MaxOff+1] = {
-                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+	static const U32 OF_base[MaxOff+1] = {
+							 0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+							 0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+							 0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+							 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
 
-    /* sequence */
-    {   size_t offset;
-        if (!ofCode)
-            offset = 0;
-        else {
-            if (longOffsets) {
-                int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN);
-                offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
-                if (MEM_32bits() || extraBits) BIT_reloadDStream(&seqState->DStream);
-                if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
-            } else {
-                offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-                if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
-            }
-        }
+	/* sequence */
+	{   size_t offset;
+		if (!ofCode)
+			offset = 0;
+		else {
+			if (longOffsets) {
+				int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN);
+				offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
+				if (MEM_32bits() || extraBits) BIT_reloadDStream(&seqState->DStream);
+				if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
+			} else {
+				offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
+				if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
+			}
+		}
 
-        if (ofCode <= 1) {
-            offset += (llCode==0);
-            if (offset) {
-                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
-                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
-                seqState->prevOffset[1] = seqState->prevOffset[0];
-                seqState->prevOffset[0] = offset = temp;
-            } else {
-                offset = seqState->prevOffset[0];
-            }
-        } else {
-            seqState->prevOffset[2] = seqState->prevOffset[1];
-            seqState->prevOffset[1] = seqState->prevOffset[0];
-            seqState->prevOffset[0] = offset;
-        }
-        seq.offset = offset;
-    }
+		if (ofCode <= 1) {
+			offset += (llCode==0);
+			if (offset) {
+				size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
+				temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
+				if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
+				seqState->prevOffset[1] = seqState->prevOffset[0];
+				seqState->prevOffset[0] = offset = temp;
+			} else {
+				offset = seqState->prevOffset[0];
+			}
+		} else {
+			seqState->prevOffset[2] = seqState->prevOffset[1];
+			seqState->prevOffset[1] = seqState->prevOffset[0];
+			seqState->prevOffset[0] = offset;
+		}
+		seq.offset = offset;
+	}
 
-    seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
-    if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
+	seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
+	if (MEM_32bits() && (mlBits+llBits>24)) BIT_reloadDStream(&seqState->DStream);
 
-    seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
-    if (MEM_32bits() ||
-       (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
+	seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
+	if (MEM_32bits() ||
+	   (totalBits > 64 - 7 - (LLFSELog+MLFSELog+OffFSELog)) ) BIT_reloadDStream(&seqState->DStream);
 
-    {   size_t const pos = seqState->pos + seq.litLength;
-        seq.match = seqState->base + pos - seq.offset;    /* single memory segment */
-        if (seq.offset > pos) seq.match += seqState->gotoDict;   /* separate memory segment */
-        seqState->pos = pos + seq.matchLength;
-    }
+	{   size_t const pos = seqState->pos + seq.litLength;
+		seq.match = seqState->base + pos - seq.offset;    /* single memory segment */
+		if (seq.offset > pos) seq.match += seqState->gotoDict;   /* separate memory segment */
+		seqState->pos = pos + seq.matchLength;
+	}
 
-    /* ANS state update */
-    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
-    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
-    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
-    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
+	/* ANS state update */
+	FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
+	FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
+	if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+	FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
 
-    return seq;
+	return seq;
 }
 
 static seq_t ZSTD_decodeSequenceLong(seqState_t* seqState, unsigned const windowSize) {
-    if (ZSTD_highbit32(windowSize) > STREAM_ACCUMULATOR_MIN) {
-        return ZSTD_decodeSequenceLong_generic(seqState, 1);
-    } else {
-        return ZSTD_decodeSequenceLong_generic(seqState, 0);
-    }
+	if (ZSTD_highbit32(windowSize) > STREAM_ACCUMULATOR_MIN) {
+		return ZSTD_decodeSequenceLong_generic(seqState, 1);
+	} else {
+		return ZSTD_decodeSequenceLong_generic(seqState, 0);
+	}
 }
 
 FORCE_INLINE
 size_t ZSTD_execSequenceLong(BYTE* op,
-                                BYTE* const oend, seq_t sequence,
-                                const BYTE** litPtr, const BYTE* const litLimit,
-                                const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
+								BYTE* const oend, seq_t sequence,
+								const BYTE** litPtr, const BYTE* const litLimit,
+								const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
 {
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = sequence.match;
+	BYTE* const oLitEnd = op + sequence.litLength;
+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+	BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+	BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+	const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+	const BYTE* match = sequence.match;
 
-    /* check */
+	/* check */
 #if 1
-    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
+	if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
+	if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
+	if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
 #endif
 
-    /* copy Literals */
-    ZSTD_copy8(op, *litPtr);
-    if (sequence.litLength > 8)
-        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-    op = oLitEnd;
-    *litPtr = iLitEnd;   /* update for next sequence */
+	/* copy Literals */
+	ZSTD_copy8(op, *litPtr);
+	if (sequence.litLength > 8)
+		ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
+	op = oLitEnd;
+	*litPtr = iLitEnd;   /* update for next sequence */
 
-    /* copy Match */
+	/* copy Match */
 #if 1
-    if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix */
-        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = base;
-            if (op > oend_w || sequence.matchLength < MINMATCH) {
-              U32 i;
-              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
-              return sequenceLength;
-            }
-    }   }
-    /* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
+	if (sequence.offset > (size_t)(oLitEnd - base)) {
+		/* offset beyond prefix */
+		if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
+		if (match + sequence.matchLength <= dictEnd) {
+			memmove(oLitEnd, match, sequence.matchLength);
+			return sequenceLength;
+		}
+		/* span extDict & currentPrefixSegment */
+		{   size_t const length1 = dictEnd - match;
+			memmove(oLitEnd, match, length1);
+			op = oLitEnd + length1;
+			sequence.matchLength -= length1;
+			match = base;
+			if (op > oend_w || sequence.matchLength < MINMATCH) {
+			  U32 i;
+			  for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
+			  return sequenceLength;
+			}
+	}   }
+	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
 #endif
 
-    /* match within prefix */
-    if (sequence.offset < 8) {
-        /* close range match, overlap */
-        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
-        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
-        int const sub2 = dec64table[sequence.offset];
-        op[0] = match[0];
-        op[1] = match[1];
-        op[2] = match[2];
-        op[3] = match[3];
-        match += dec32table[sequence.offset];
-        ZSTD_copy4(op+4, match);
-        match -= sub2;
-    } else {
-        ZSTD_copy8(op, match);
-    }
-    op += 8; match += 8;
+	/* match within prefix */
+	if (sequence.offset < 8) {
+		/* close range match, overlap */
+		static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
+		static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
+		int const sub2 = dec64table[sequence.offset];
+		op[0] = match[0];
+		op[1] = match[1];
+		op[2] = match[2];
+		op[3] = match[3];
+		match += dec32table[sequence.offset];
+		ZSTD_copy4(op+4, match);
+		match -= sub2;
+	} else {
+		ZSTD_copy8(op, match);
+	}
+	op += 8; match += 8;
 
-    if (oMatchEnd > oend-(16-MINMATCH)) {
-        if (op < oend_w) {
-            ZSTD_wildcopy(op, match, oend_w - op);
-            match += oend_w - op;
-            op = oend_w;
-        }
-        while (op < oMatchEnd) *op++ = *match++;
-    } else {
-        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
-    }
-    return sequenceLength;
+	if (oMatchEnd > oend-(16-MINMATCH)) {
+		if (op < oend_w) {
+			ZSTD_wildcopy(op, match, oend_w - op);
+			match += oend_w - op;
+			op = oend_w;
+		}
+		while (op < oMatchEnd) *op++ = *match++;
+	} else {
+		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
+	}
+	return sequenceLength;
 }
 
 static size_t ZSTD_decompressSequencesLong(
-                               ZSTD_DCtx* dctx,
-                               void* dst, size_t maxDstSize,
-                         const void* seqStart, size_t seqSize)
+							   ZSTD_DCtx* dctx,
+							   void* dst, size_t maxDstSize,
+						 const void* seqStart, size_t seqSize)
 {
-    const BYTE* ip = (const BYTE*)seqStart;
-    const BYTE* const iend = ip + seqSize;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + maxDstSize;
-    BYTE* op = ostart;
-    const BYTE* litPtr = dctx->litPtr;
-    const BYTE* const litEnd = litPtr + dctx->litSize;
-    const BYTE* const base = (const BYTE*) (dctx->base);
-    const BYTE* const vBase = (const BYTE*) (dctx->vBase);
-    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
-    unsigned const windowSize = dctx->fParams.windowSize;
-    int nbSeq;
+	const BYTE* ip = (const BYTE*)seqStart;
+	const BYTE* const iend = ip + seqSize;
+	BYTE* const ostart = (BYTE* const)dst;
+	BYTE* const oend = ostart + maxDstSize;
+	BYTE* op = ostart;
+	const BYTE* litPtr = dctx->litPtr;
+	const BYTE* const litEnd = litPtr + dctx->litSize;
+	const BYTE* const base = (const BYTE*) (dctx->base);
+	const BYTE* const vBase = (const BYTE*) (dctx->vBase);
+	const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+	unsigned const windowSize = dctx->fParams.windowSize;
+	int nbSeq;
 
-    /* Build Decoding Tables */
-    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-        if (ZSTD_isError(seqHSize)) return seqHSize;
-        ip += seqHSize;
-    }
+	/* Build Decoding Tables */
+	{   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
+		if (ZSTD_isError(seqHSize)) return seqHSize;
+		ip += seqHSize;
+	}
 
-    /* Regen sequences */
-    if (nbSeq) {
+	/* Regen sequences */
+	if (nbSeq) {
 #define STORED_SEQS 4
 #define STOSEQ_MASK (STORED_SEQS-1)
 #define ADVANCED_SEQS 4
-        seq_t sequences[STORED_SEQS];
-        int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
-        seqState_t seqState;
-        int seqNb;
-        dctx->fseEntropy = 1;
-        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
-        seqState.base = base;
-        seqState.pos = (size_t)(op-base);
-        seqState.gotoDict = (uPtrDiff)dictEnd - (uPtrDiff)base; /* cast to avoid undefined behaviour */
-        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
-        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+		seq_t sequences[STORED_SEQS];
+		int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
+		seqState_t seqState;
+		int seqNb;
+		dctx->fseEntropy = 1;
+		{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+		seqState.base = base;
+		seqState.pos = (size_t)(op-base);
+		seqState.gotoDict = (uPtrDiff)dictEnd - (uPtrDiff)base; /* cast to avoid undefined behaviour */
+		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
+		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
 
-        /* prepare in advance */
-        for (seqNb=0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNb<seqAdvance; seqNb++) {
-            sequences[seqNb] = ZSTD_decodeSequenceLong(&seqState, windowSize);
-        }
-        if (seqNb<seqAdvance) return ERROR(corruption_detected);
+		/* prepare in advance */
+		for (seqNb=0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNb<seqAdvance; seqNb++) {
+			sequences[seqNb] = ZSTD_decodeSequenceLong(&seqState, windowSize);
+		}
+		if (seqNb<seqAdvance) return ERROR(corruption_detected);
 
-        /* decode and decompress */
-        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && seqNb<nbSeq ; seqNb++) {
-            seq_t const sequence = ZSTD_decodeSequenceLong(&seqState, windowSize);
-            size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[(seqNb-ADVANCED_SEQS) & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
-            ZSTD_PREFETCH(sequence.match);
-            sequences[seqNb&STOSEQ_MASK] = sequence;
-            op += oneSeqSize;
-        }
-        if (seqNb<nbSeq) return ERROR(corruption_detected);
+		/* decode and decompress */
+		for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && seqNb<nbSeq ; seqNb++) {
+			seq_t const sequence = ZSTD_decodeSequenceLong(&seqState, windowSize);
+			size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[(seqNb-ADVANCED_SEQS) & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
+			if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+			ZSTD_PREFETCH(sequence.match);
+			sequences[seqNb&STOSEQ_MASK] = sequence;
+			op += oneSeqSize;
+		}
+		if (seqNb<nbSeq) return ERROR(corruption_detected);
 
-        /* finish queue */
-        seqNb -= seqAdvance;
-        for ( ; seqNb<nbSeq ; seqNb++) {
-            size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[seqNb&STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
-            op += oneSeqSize;
-        }
+		/* finish queue */
+		seqNb -= seqAdvance;
+		for ( ; seqNb<nbSeq ; seqNb++) {
+			size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[seqNb&STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
+			if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+			op += oneSeqSize;
+		}
 
-        /* save reps for next block */
-        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
-    }
+		/* save reps for next block */
+		{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+	}
 
-    /* last literal segment */
-    {   size_t const lastLLSize = litEnd - litPtr;
-        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
-        memcpy(op, litPtr, lastLLSize);
-        op += lastLLSize;
-    }
+	/* last literal segment */
+	{   size_t const lastLLSize = litEnd - litPtr;
+		if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
+		memcpy(op, litPtr, lastLLSize);
+		op += lastLLSize;
+	}
 
-    return op-ostart;
+	return op-ostart;
 }
 
 
 static size_t ZSTD_decompressBlock_internal(ZSTD_DCtx* dctx,
-                            void* dst, size_t dstCapacity,
-                      const void* src, size_t srcSize)
+							void* dst, size_t dstCapacity,
+					  const void* src, size_t srcSize)
 {   /* blockType == blockCompressed */
-    const BYTE* ip = (const BYTE*)src;
+	const BYTE* ip = (const BYTE*)src;
 
-    if (srcSize >= ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(srcSize_wrong);
+	if (srcSize >= ZSTD_BLOCKSIZE_ABSOLUTEMAX) return ERROR(srcSize_wrong);
 
-    /* Decode literals section */
-    {   size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
-        if (ZSTD_isError(litCSize)) return litCSize;
-        ip += litCSize;
-        srcSize -= litCSize;
-    }
-    if (sizeof(size_t) > 4)  /* do not enable prefetching on 32-bits x86, as it's performance detrimental */
-                             /* likely because of register pressure */
-                             /* if that's the correct cause, then 32-bits ARM should be affected differently */
-                             /* it would be good to test this on ARM real hardware, to see if prefetch version improves speed */
-        if (dctx->fParams.windowSize > (1<<23))
-            return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize);
-    return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize);
+	/* Decode literals section */
+	{   size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
+		if (ZSTD_isError(litCSize)) return litCSize;
+		ip += litCSize;
+		srcSize -= litCSize;
+	}
+	if (sizeof(size_t) > 4)  /* do not enable prefetching on 32-bits x86, as it's performance detrimental */
+							 /* likely because of register pressure */
+							 /* if that's the correct cause, then 32-bits ARM should be affected differently */
+							 /* it would be good to test this on ARM real hardware, to see if prefetch version improves speed */
+		if (dctx->fParams.windowSize > (1<<23))
+			return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize);
+	return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize);
 }
 
 
 static void ZSTD_checkContinuity(ZSTD_DCtx* dctx, const void* dst)
 {
-    if (dst != dctx->previousDstEnd) {   /* not contiguous */
-        dctx->dictEnd = dctx->previousDstEnd;
-        dctx->vBase = (const char*)dst - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
-        dctx->base = dst;
-        dctx->previousDstEnd = dst;
-    }
+	if (dst != dctx->previousDstEnd) {   /* not contiguous */
+		dctx->dictEnd = dctx->previousDstEnd;
+		dctx->vBase = (const char*)dst - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
+		dctx->base = dst;
+		dctx->previousDstEnd = dst;
+	}
 }
 
 size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx,
-                            void* dst, size_t dstCapacity,
-                      const void* src, size_t srcSize)
+							void* dst, size_t dstCapacity,
+					  const void* src, size_t srcSize)
 {
-    size_t dSize;
-    ZSTD_checkContinuity(dctx, dst);
-    dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
-    dctx->previousDstEnd = (char*)dst + dSize;
-    return dSize;
+	size_t dSize;
+	ZSTD_checkContinuity(dctx, dst);
+	dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
+	dctx->previousDstEnd = (char*)dst + dSize;
+	return dSize;
 }
 
 
 /** ZSTD_insertBlock() :
-    insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
+	insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
 ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
 {
-    ZSTD_checkContinuity(dctx, blockStart);
-    dctx->previousDstEnd = (const char*)blockStart + blockSize;
-    return blockSize;
+	ZSTD_checkContinuity(dctx, blockStart);
+	dctx->previousDstEnd = (const char*)blockStart + blockSize;
+	return blockSize;
 }
 
 
 size_t ZSTD_generateNxBytes(void* dst, size_t dstCapacity, BYTE byte, size_t length)
 {
-    if (length > dstCapacity) return ERROR(dstSize_tooSmall);
-    memset(dst, byte, length);
-    return length;
+	if (length > dstCapacity) return ERROR(dstSize_tooSmall);
+	memset(dst, byte, length);
+	return length;
 }
 
 /** ZSTD_findFrameCompressedSize() :
@@ -1473,241 +1473,241 @@ size_t ZSTD_generateNxBytes(void* dst, size_t dstCapacity, BYTE byte, size_t len
 size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
 {
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(src, srcSize)) return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
+	if (ZSTD_isLegacy(src, srcSize)) return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
 #endif
-    if (srcSize >= ZSTD_skippableHeaderSize &&
-            (MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-        return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + 4);
-    } else {
-        const BYTE* ip = (const BYTE*)src;
-        const BYTE* const ipstart = ip;
-        size_t remainingSize = srcSize;
-        ZSTD_frameParams fParams;
+	if (srcSize >= ZSTD_skippableHeaderSize &&
+			(MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+		return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + 4);
+	} else {
+		const BYTE* ip = (const BYTE*)src;
+		const BYTE* const ipstart = ip;
+		size_t remainingSize = srcSize;
+		ZSTD_frameParams fParams;
 
-        size_t const headerSize = ZSTD_frameHeaderSize(ip, remainingSize);
-        if (ZSTD_isError(headerSize)) return headerSize;
+		size_t const headerSize = ZSTD_frameHeaderSize(ip, remainingSize);
+		if (ZSTD_isError(headerSize)) return headerSize;
 
-        /* Frame Header */
-        {   size_t const ret = ZSTD_getFrameParams(&fParams, ip, remainingSize);
-            if (ZSTD_isError(ret)) return ret;
-            if (ret > 0) return ERROR(srcSize_wrong);
-        }
+		/* Frame Header */
+		{   size_t const ret = ZSTD_getFrameParams(&fParams, ip, remainingSize);
+			if (ZSTD_isError(ret)) return ret;
+			if (ret > 0) return ERROR(srcSize_wrong);
+		}
 
-        ip += headerSize;
-        remainingSize -= headerSize;
+		ip += headerSize;
+		remainingSize -= headerSize;
 
-        /* Loop on each block */
-        while (1) {
-            blockProperties_t blockProperties;
-            size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-            if (ZSTD_isError(cBlockSize)) return cBlockSize;
+		/* Loop on each block */
+		while (1) {
+			blockProperties_t blockProperties;
+			size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
+			if (ZSTD_isError(cBlockSize)) return cBlockSize;
 
-            if (ZSTD_blockHeaderSize + cBlockSize > remainingSize) return ERROR(srcSize_wrong);
+			if (ZSTD_blockHeaderSize + cBlockSize > remainingSize) return ERROR(srcSize_wrong);
 
-            ip += ZSTD_blockHeaderSize + cBlockSize;
-            remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
+			ip += ZSTD_blockHeaderSize + cBlockSize;
+			remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
 
-            if (blockProperties.lastBlock) break;
-        }
+			if (blockProperties.lastBlock) break;
+		}
 
-        if (fParams.checksumFlag) {   /* Frame content checksum */
-            if (remainingSize < 4) return ERROR(srcSize_wrong);
-            ip += 4;
-            remainingSize -= 4;
-        }
+		if (fParams.checksumFlag) {   /* Frame content checksum */
+			if (remainingSize < 4) return ERROR(srcSize_wrong);
+			ip += 4;
+			remainingSize -= 4;
+		}
 
-        return ip - ipstart;
-    }
+		return ip - ipstart;
+	}
 }
 
 /*! ZSTD_decompressFrame() :
 *   @dctx must be properly initialized */
 static size_t ZSTD_decompressFrame(ZSTD_DCtx* dctx,
-                                 void* dst, size_t dstCapacity,
-                                 const void** srcPtr, size_t *srcSizePtr)
+								 void* dst, size_t dstCapacity,
+								 const void** srcPtr, size_t *srcSizePtr)
 {
-    const BYTE* ip = (const BYTE*)(*srcPtr);
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + dstCapacity;
-    BYTE* op = ostart;
-    size_t remainingSize = *srcSizePtr;
+	const BYTE* ip = (const BYTE*)(*srcPtr);
+	BYTE* const ostart = (BYTE* const)dst;
+	BYTE* const oend = ostart + dstCapacity;
+	BYTE* op = ostart;
+	size_t remainingSize = *srcSizePtr;
 
-    /* check */
-    if (remainingSize < ZSTD_frameHeaderSize_min+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+	/* check */
+	if (remainingSize < ZSTD_frameHeaderSize_min+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
 
-    /* Frame Header */
-    {   size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
-        if (ZSTD_isError(frameHeaderSize)) return frameHeaderSize;
-        if (remainingSize < frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-        CHECK_F(ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize));
-        ip += frameHeaderSize; remainingSize -= frameHeaderSize;
-    }
+	/* Frame Header */
+	{   size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
+		if (ZSTD_isError(frameHeaderSize)) return frameHeaderSize;
+		if (remainingSize < frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
+		CHECK_F(ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize));
+		ip += frameHeaderSize; remainingSize -= frameHeaderSize;
+	}
 
-    /* Loop on each block */
-    while (1) {
-        size_t decodedSize;
-        blockProperties_t blockProperties;
-        size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-        if (ZSTD_isError(cBlockSize)) return cBlockSize;
+	/* Loop on each block */
+	while (1) {
+		size_t decodedSize;
+		blockProperties_t blockProperties;
+		size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
+		if (ZSTD_isError(cBlockSize)) return cBlockSize;
 
-        ip += ZSTD_blockHeaderSize;
-        remainingSize -= ZSTD_blockHeaderSize;
-        if (cBlockSize > remainingSize) return ERROR(srcSize_wrong);
+		ip += ZSTD_blockHeaderSize;
+		remainingSize -= ZSTD_blockHeaderSize;
+		if (cBlockSize > remainingSize) return ERROR(srcSize_wrong);
 
-        switch(blockProperties.blockType)
-        {
-        case bt_compressed:
-            decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend-op, ip, cBlockSize);
-            break;
-        case bt_raw :
-            decodedSize = ZSTD_copyRawBlock(op, oend-op, ip, cBlockSize);
-            break;
-        case bt_rle :
-            decodedSize = ZSTD_generateNxBytes(op, oend-op, *ip, blockProperties.origSize);
-            break;
-        case bt_reserved :
-        default:
-            return ERROR(corruption_detected);
-        }
+		switch(blockProperties.blockType)
+		{
+		case bt_compressed:
+			decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend-op, ip, cBlockSize);
+			break;
+		case bt_raw :
+			decodedSize = ZSTD_copyRawBlock(op, oend-op, ip, cBlockSize);
+			break;
+		case bt_rle :
+			decodedSize = ZSTD_generateNxBytes(op, oend-op, *ip, blockProperties.origSize);
+			break;
+		case bt_reserved :
+		default:
+			return ERROR(corruption_detected);
+		}
 
-        if (ZSTD_isError(decodedSize)) return decodedSize;
-        if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, op, decodedSize);
-        op += decodedSize;
-        ip += cBlockSize;
-        remainingSize -= cBlockSize;
-        if (blockProperties.lastBlock) break;
-    }
+		if (ZSTD_isError(decodedSize)) return decodedSize;
+		if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, op, decodedSize);
+		op += decodedSize;
+		ip += cBlockSize;
+		remainingSize -= cBlockSize;
+		if (blockProperties.lastBlock) break;
+	}
 
-    if (dctx->fParams.checksumFlag) {   /* Frame content checksum verification */
-        U32 const checkCalc = (U32)XXH64_digest(&dctx->xxhState);
-        U32 checkRead;
-        if (remainingSize<4) return ERROR(checksum_wrong);
-        checkRead = MEM_readLE32(ip);
-        if (checkRead != checkCalc) return ERROR(checksum_wrong);
-        ip += 4;
-        remainingSize -= 4;
-    }
+	if (dctx->fParams.checksumFlag) {   /* Frame content checksum verification */
+		U32 const checkCalc = (U32)XXH64_digest(&dctx->xxhState);
+		U32 checkRead;
+		if (remainingSize<4) return ERROR(checksum_wrong);
+		checkRead = MEM_readLE32(ip);
+		if (checkRead != checkCalc) return ERROR(checksum_wrong);
+		ip += 4;
+		remainingSize -= 4;
+	}
 
-    /* Allow caller to get size read */
-    *srcPtr = ip;
-    *srcSizePtr = remainingSize;
-    return op-ostart;
+	/* Allow caller to get size read */
+	*srcPtr = ip;
+	*srcSizePtr = remainingSize;
+	return op-ostart;
 }
 
 static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict);
 static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict);
 
 static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
-                                        void* dst, size_t dstCapacity,
-                                  const void* src, size_t srcSize,
-                                  const void *dict, size_t dictSize,
-                                  const ZSTD_DDict* ddict)
+										void* dst, size_t dstCapacity,
+								  const void* src, size_t srcSize,
+								  const void *dict, size_t dictSize,
+								  const ZSTD_DDict* ddict)
 {
-    void* const dststart = dst;
+	void* const dststart = dst;
 
-    if (ddict) {
-        if (dict) {
-            /* programmer error, these two cases should be mutually exclusive */
-            return ERROR(GENERIC);
-        }
+	if (ddict) {
+		if (dict) {
+			/* programmer error, these two cases should be mutually exclusive */
+			return ERROR(GENERIC);
+		}
 
-        dict = ZSTD_DDictDictContent(ddict);
-        dictSize = ZSTD_DDictDictSize(ddict);
-    }
+		dict = ZSTD_DDictDictContent(ddict);
+		dictSize = ZSTD_DDictDictSize(ddict);
+	}
 
-    while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-        U32 magicNumber;
+	while (srcSize >= ZSTD_frameHeaderSize_prefix) {
+		U32 magicNumber;
 
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-        if (ZSTD_isLegacy(src, srcSize)) {
-            size_t decodedSize;
-            size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
-            if (ZSTD_isError(frameSize)) return frameSize;
+		if (ZSTD_isLegacy(src, srcSize)) {
+			size_t decodedSize;
+			size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
+			if (ZSTD_isError(frameSize)) return frameSize;
 
-            decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
+			decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
 
-            dst = (BYTE*)dst + decodedSize;
-            dstCapacity -= decodedSize;
+			dst = (BYTE*)dst + decodedSize;
+			dstCapacity -= decodedSize;
 
-            src = (const BYTE*)src + frameSize;
-            srcSize -= frameSize;
+			src = (const BYTE*)src + frameSize;
+			srcSize -= frameSize;
 
-            continue;
-        }
+			continue;
+		}
 #endif
 
-        magicNumber = MEM_readLE32(src);
-        if (magicNumber != ZSTD_MAGICNUMBER) {
-            if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-                size_t skippableSize;
-                if (srcSize < ZSTD_skippableHeaderSize)
-                    return ERROR(srcSize_wrong);
-                skippableSize = MEM_readLE32((const BYTE *)src + 4) +
-                                ZSTD_skippableHeaderSize;
-                if (srcSize < skippableSize) {
-                    return ERROR(srcSize_wrong);
-                }
+		magicNumber = MEM_readLE32(src);
+		if (magicNumber != ZSTD_MAGICNUMBER) {
+			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
+				size_t skippableSize;
+				if (srcSize < ZSTD_skippableHeaderSize)
+					return ERROR(srcSize_wrong);
+				skippableSize = MEM_readLE32((const BYTE *)src + 4) +
+								ZSTD_skippableHeaderSize;
+				if (srcSize < skippableSize) {
+					return ERROR(srcSize_wrong);
+				}
 
-                src = (const BYTE *)src + skippableSize;
-                srcSize -= skippableSize;
-                continue;
-            } else {
-                return ERROR(prefix_unknown);
-            }
-        }
+				src = (const BYTE *)src + skippableSize;
+				srcSize -= skippableSize;
+				continue;
+			} else {
+				return ERROR(prefix_unknown);
+			}
+		}
 
-        if (ddict) {
-            /* we were called from ZSTD_decompress_usingDDict */
-            ZSTD_refDDict(dctx, ddict);
-        } else {
-            /* this will initialize correctly with no dict if dict == NULL, so
-             * use this in all cases but ddict */
-            CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
-        }
-        ZSTD_checkContinuity(dctx, dst);
+		if (ddict) {
+			/* we were called from ZSTD_decompress_usingDDict */
+			ZSTD_refDDict(dctx, ddict);
+		} else {
+			/* this will initialize correctly with no dict if dict == NULL, so
+			 * use this in all cases but ddict */
+			CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
+		}
+		ZSTD_checkContinuity(dctx, dst);
 
-        {   const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity,
-                                                    &src, &srcSize);
-            if (ZSTD_isError(res)) return res;
-            /* don't need to bounds check this, ZSTD_decompressFrame will have
-             * already */
-            dst = (BYTE*)dst + res;
-            dstCapacity -= res;
-        }
-    }
+		{   const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity,
+													&src, &srcSize);
+			if (ZSTD_isError(res)) return res;
+			/* don't need to bounds check this, ZSTD_decompressFrame will have
+			 * already */
+			dst = (BYTE*)dst + res;
+			dstCapacity -= res;
+		}
+	}
 
-    if (srcSize) return ERROR(srcSize_wrong); /* input not entirely consumed */
+	if (srcSize) return ERROR(srcSize_wrong); /* input not entirely consumed */
 
-    return (BYTE*)dst - (BYTE*)dststart;
+	return (BYTE*)dst - (BYTE*)dststart;
 }
 
 size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-                                 void* dst, size_t dstCapacity,
-                           const void* src, size_t srcSize,
-                           const void* dict, size_t dictSize)
+								 void* dst, size_t dstCapacity,
+						   const void* src, size_t srcSize,
+						   const void* dict, size_t dictSize)
 {
-    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
+	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
 }
 
 
 size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
+	return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
 }
 
 
 size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
 #if defined(ZSTD_HEAPMODE) && (ZSTD_HEAPMODE==1)
-    size_t regenSize;
-    ZSTD_DCtx* const dctx = ZSTD_createDCtx();
-    if (dctx==NULL) return ERROR(memory_allocation);
-    regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
-    ZSTD_freeDCtx(dctx);
-    return regenSize;
+	size_t regenSize;
+	ZSTD_DCtx* const dctx = ZSTD_createDCtx();
+	if (dctx==NULL) return ERROR(memory_allocation);
+	regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
+	ZSTD_freeDCtx(dctx);
+	return regenSize;
 #else   /* stack mode */
-    ZSTD_DCtx dctx;
-    return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
+	ZSTD_DCtx dctx;
+	return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
 #endif
 }
 
@@ -1719,24 +1719,24 @@ size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t sr
 size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx) { return dctx->expected; }
 
 ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx) {
-    switch(dctx->stage)
-    {
-    default:   /* should not happen */
-    case ZSTDds_getFrameHeaderSize:
-    case ZSTDds_decodeFrameHeader:
-        return ZSTDnit_frameHeader;
-    case ZSTDds_decodeBlockHeader:
-        return ZSTDnit_blockHeader;
-    case ZSTDds_decompressBlock:
-        return ZSTDnit_block;
-    case ZSTDds_decompressLastBlock:
-        return ZSTDnit_lastBlock;
-    case ZSTDds_checkChecksum:
-        return ZSTDnit_checksum;
-    case ZSTDds_decodeSkippableHeader:
-    case ZSTDds_skipFrame:
-        return ZSTDnit_skippableFrame;
-    }
+	switch(dctx->stage)
+	{
+	default:   /* should not happen */
+	case ZSTDds_getFrameHeaderSize:
+	case ZSTDds_decodeFrameHeader:
+		return ZSTDnit_frameHeader;
+	case ZSTDds_decodeBlockHeader:
+		return ZSTDnit_blockHeader;
+	case ZSTDds_decompressBlock:
+		return ZSTDnit_block;
+	case ZSTDds_decompressLastBlock:
+		return ZSTDnit_lastBlock;
+	case ZSTDds_checkChecksum:
+		return ZSTDnit_checksum;
+	case ZSTDds_decodeSkippableHeader:
+	case ZSTDds_skipFrame:
+		return ZSTDnit_skippableFrame;
+	}
 }
 
 int ZSTD_isSkipFrame(ZSTD_DCtx* dctx) { return dctx->stage == ZSTDds_skipFrame; }   /* for zbuff */
@@ -1746,131 +1746,131 @@ int ZSTD_isSkipFrame(ZSTD_DCtx* dctx) { return dctx->stage == ZSTDds_skipFrame;
 *             or an error code, which can be tested using ZSTD_isError() */
 size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    /* Sanity check */
-    if (srcSize != dctx->expected) return ERROR(srcSize_wrong);
-    if (dstCapacity) ZSTD_checkContinuity(dctx, dst);
+	/* Sanity check */
+	if (srcSize != dctx->expected) return ERROR(srcSize_wrong);
+	if (dstCapacity) ZSTD_checkContinuity(dctx, dst);
 
-    switch (dctx->stage)
-    {
-    case ZSTDds_getFrameHeaderSize :
-        if (srcSize != ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);      /* impossible */
-        if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {        /* skippable frame */
-            memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-            dctx->expected = ZSTD_skippableHeaderSize - ZSTD_frameHeaderSize_prefix;  /* magic number + skippable frame length */
-            dctx->stage = ZSTDds_decodeSkippableHeader;
-            return 0;
-        }
-        dctx->headerSize = ZSTD_frameHeaderSize(src, ZSTD_frameHeaderSize_prefix);
-        if (ZSTD_isError(dctx->headerSize)) return dctx->headerSize;
-        memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-        if (dctx->headerSize > ZSTD_frameHeaderSize_prefix) {
-            dctx->expected = dctx->headerSize - ZSTD_frameHeaderSize_prefix;
-            dctx->stage = ZSTDds_decodeFrameHeader;
-            return 0;
-        }
-        dctx->expected = 0;   /* not necessary to copy more */
+	switch (dctx->stage)
+	{
+	case ZSTDds_getFrameHeaderSize :
+		if (srcSize != ZSTD_frameHeaderSize_prefix) return ERROR(srcSize_wrong);      /* impossible */
+		if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {        /* skippable frame */
+			memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
+			dctx->expected = ZSTD_skippableHeaderSize - ZSTD_frameHeaderSize_prefix;  /* magic number + skippable frame length */
+			dctx->stage = ZSTDds_decodeSkippableHeader;
+			return 0;
+		}
+		dctx->headerSize = ZSTD_frameHeaderSize(src, ZSTD_frameHeaderSize_prefix);
+		if (ZSTD_isError(dctx->headerSize)) return dctx->headerSize;
+		memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
+		if (dctx->headerSize > ZSTD_frameHeaderSize_prefix) {
+			dctx->expected = dctx->headerSize - ZSTD_frameHeaderSize_prefix;
+			dctx->stage = ZSTDds_decodeFrameHeader;
+			return 0;
+		}
+		dctx->expected = 0;   /* not necessary to copy more */
 
-    case ZSTDds_decodeFrameHeader:
-        memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-        CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
-        dctx->expected = ZSTD_blockHeaderSize;
-        dctx->stage = ZSTDds_decodeBlockHeader;
-        return 0;
+	case ZSTDds_decodeFrameHeader:
+		memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
+		CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
+		dctx->expected = ZSTD_blockHeaderSize;
+		dctx->stage = ZSTDds_decodeBlockHeader;
+		return 0;
 
-    case ZSTDds_decodeBlockHeader:
-        {   blockProperties_t bp;
-            size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
-            if (ZSTD_isError(cBlockSize)) return cBlockSize;
-            dctx->expected = cBlockSize;
-            dctx->bType = bp.blockType;
-            dctx->rleSize = bp.origSize;
-            if (cBlockSize) {
-                dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
-                return 0;
-            }
-            /* empty block */
-            if (bp.lastBlock) {
-                if (dctx->fParams.checksumFlag) {
-                    dctx->expected = 4;
-                    dctx->stage = ZSTDds_checkChecksum;
-                } else {
-                    dctx->expected = 0; /* end of frame */
-                    dctx->stage = ZSTDds_getFrameHeaderSize;
-                }
-            } else {
-                dctx->expected = 3;  /* go directly to next header */
-                dctx->stage = ZSTDds_decodeBlockHeader;
-            }
-            return 0;
-        }
-    case ZSTDds_decompressLastBlock:
-    case ZSTDds_decompressBlock:
-        {   size_t rSize;
-            switch(dctx->bType)
-            {
-            case bt_compressed:
-                rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
-                break;
-            case bt_raw :
-                rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize);
-                break;
-            case bt_rle :
-                rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize);
-                break;
-            case bt_reserved :   /* should never happen */
-            default:
-                return ERROR(corruption_detected);
-            }
-            if (ZSTD_isError(rSize)) return rSize;
-            if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, dst, rSize);
+	case ZSTDds_decodeBlockHeader:
+		{   blockProperties_t bp;
+			size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
+			if (ZSTD_isError(cBlockSize)) return cBlockSize;
+			dctx->expected = cBlockSize;
+			dctx->bType = bp.blockType;
+			dctx->rleSize = bp.origSize;
+			if (cBlockSize) {
+				dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
+				return 0;
+			}
+			/* empty block */
+			if (bp.lastBlock) {
+				if (dctx->fParams.checksumFlag) {
+					dctx->expected = 4;
+					dctx->stage = ZSTDds_checkChecksum;
+				} else {
+					dctx->expected = 0; /* end of frame */
+					dctx->stage = ZSTDds_getFrameHeaderSize;
+				}
+			} else {
+				dctx->expected = 3;  /* go directly to next header */
+				dctx->stage = ZSTDds_decodeBlockHeader;
+			}
+			return 0;
+		}
+	case ZSTDds_decompressLastBlock:
+	case ZSTDds_decompressBlock:
+		{   size_t rSize;
+			switch(dctx->bType)
+			{
+			case bt_compressed:
+				rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
+				break;
+			case bt_raw :
+				rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize);
+				break;
+			case bt_rle :
+				rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize);
+				break;
+			case bt_reserved :   /* should never happen */
+			default:
+				return ERROR(corruption_detected);
+			}
+			if (ZSTD_isError(rSize)) return rSize;
+			if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, dst, rSize);
 
-            if (dctx->stage == ZSTDds_decompressLastBlock) {   /* end of frame */
-                if (dctx->fParams.checksumFlag) {  /* another round for frame checksum */
-                    dctx->expected = 4;
-                    dctx->stage = ZSTDds_checkChecksum;
-                } else {
-                    dctx->expected = 0;   /* ends here */
-                    dctx->stage = ZSTDds_getFrameHeaderSize;
-                }
-            } else {
-                dctx->stage = ZSTDds_decodeBlockHeader;
-                dctx->expected = ZSTD_blockHeaderSize;
-                dctx->previousDstEnd = (char*)dst + rSize;
-            }
-            return rSize;
-        }
-    case ZSTDds_checkChecksum:
-        {   U32 const h32 = (U32)XXH64_digest(&dctx->xxhState);
-            U32 const check32 = MEM_readLE32(src);   /* srcSize == 4, guaranteed by dctx->expected */
-            if (check32 != h32) return ERROR(checksum_wrong);
-            dctx->expected = 0;
-            dctx->stage = ZSTDds_getFrameHeaderSize;
-            return 0;
-        }
-    case ZSTDds_decodeSkippableHeader:
-        {   memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-            dctx->expected = MEM_readLE32(dctx->headerBuffer + 4);
-            dctx->stage = ZSTDds_skipFrame;
-            return 0;
-        }
-    case ZSTDds_skipFrame:
-        {   dctx->expected = 0;
-            dctx->stage = ZSTDds_getFrameHeaderSize;
-            return 0;
-        }
-    default:
-        return ERROR(GENERIC);   /* impossible */
-    }
+			if (dctx->stage == ZSTDds_decompressLastBlock) {   /* end of frame */
+				if (dctx->fParams.checksumFlag) {  /* another round for frame checksum */
+					dctx->expected = 4;
+					dctx->stage = ZSTDds_checkChecksum;
+				} else {
+					dctx->expected = 0;   /* ends here */
+					dctx->stage = ZSTDds_getFrameHeaderSize;
+				}
+			} else {
+				dctx->stage = ZSTDds_decodeBlockHeader;
+				dctx->expected = ZSTD_blockHeaderSize;
+				dctx->previousDstEnd = (char*)dst + rSize;
+			}
+			return rSize;
+		}
+	case ZSTDds_checkChecksum:
+		{   U32 const h32 = (U32)XXH64_digest(&dctx->xxhState);
+			U32 const check32 = MEM_readLE32(src);   /* srcSize == 4, guaranteed by dctx->expected */
+			if (check32 != h32) return ERROR(checksum_wrong);
+			dctx->expected = 0;
+			dctx->stage = ZSTDds_getFrameHeaderSize;
+			return 0;
+		}
+	case ZSTDds_decodeSkippableHeader:
+		{   memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
+			dctx->expected = MEM_readLE32(dctx->headerBuffer + 4);
+			dctx->stage = ZSTDds_skipFrame;
+			return 0;
+		}
+	case ZSTDds_skipFrame:
+		{   dctx->expected = 0;
+			dctx->stage = ZSTDds_getFrameHeaderSize;
+			return 0;
+		}
+	default:
+		return ERROR(GENERIC);   /* impossible */
+	}
 }
 
 
 static size_t ZSTD_refDictContent(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
 {
-    dctx->dictEnd = dctx->previousDstEnd;
-    dctx->vBase = (const char*)dict - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
-    dctx->base = dict;
-    dctx->previousDstEnd = (const char*)dict + dictSize;
-    return 0;
+	dctx->dictEnd = dctx->previousDstEnd;
+	dctx->vBase = (const char*)dict - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
+	dctx->base = dict;
+	dctx->previousDstEnd = (const char*)dict + dictSize;
+	return 0;
 }
 
 /* ZSTD_loadEntropy() :
@@ -1878,181 +1878,181 @@ static size_t ZSTD_refDictContent(ZSTD_DCtx* dctx, const void* dict, size_t dict
  * @return : size of entropy tables read */
 static size_t ZSTD_loadEntropy(ZSTD_entropyTables_t* entropy, const void* const dict, size_t const dictSize)
 {
-    const BYTE* dictPtr = (const BYTE*)dict;
-    const BYTE* const dictEnd = dictPtr + dictSize;
+	const BYTE* dictPtr = (const BYTE*)dict;
+	const BYTE* const dictEnd = dictPtr + dictSize;
 
-    if (dictSize <= 8) return ERROR(dictionary_corrupted);
-    dictPtr += 8;   /* skip header = magic + dictID */
+	if (dictSize <= 8) return ERROR(dictionary_corrupted);
+	dictPtr += 8;   /* skip header = magic + dictID */
 
 
-    {   size_t const hSize = HUF_readDTableX4(entropy->hufTable, dictPtr, dictEnd-dictPtr);
-        if (HUF_isError(hSize)) return ERROR(dictionary_corrupted);
-        dictPtr += hSize;
-    }
+	{   size_t const hSize = HUF_readDTableX4(entropy->hufTable, dictPtr, dictEnd-dictPtr);
+		if (HUF_isError(hSize)) return ERROR(dictionary_corrupted);
+		dictPtr += hSize;
+	}
 
-    {   short offcodeNCount[MaxOff+1];
-        U32 offcodeMaxValue = MaxOff, offcodeLog;
-        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
-        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog), dictionary_corrupted);
-        dictPtr += offcodeHeaderSize;
-    }
+	{   short offcodeNCount[MaxOff+1];
+		U32 offcodeMaxValue = MaxOff, offcodeLog;
+		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
+		if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
+		CHECK_E(FSE_buildDTable(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog), dictionary_corrupted);
+		dictPtr += offcodeHeaderSize;
+	}
 
-    {   short matchlengthNCount[MaxML+1];
-        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog), dictionary_corrupted);
-        dictPtr += matchlengthHeaderSize;
-    }
+	{   short matchlengthNCount[MaxML+1];
+		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
+		if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
+		CHECK_E(FSE_buildDTable(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog), dictionary_corrupted);
+		dictPtr += matchlengthHeaderSize;
+	}
 
-    {   short litlengthNCount[MaxLL+1];
-        unsigned litlengthMaxValue = MaxLL, litlengthLog;
-        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog), dictionary_corrupted);
-        dictPtr += litlengthHeaderSize;
-    }
+	{   short litlengthNCount[MaxLL+1];
+		unsigned litlengthMaxValue = MaxLL, litlengthLog;
+		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+		if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
+		if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
+		CHECK_E(FSE_buildDTable(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog), dictionary_corrupted);
+		dictPtr += litlengthHeaderSize;
+	}
 
-    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
-    {   int i;
-        size_t const dictContentSize = (size_t)(dictEnd - (dictPtr+12));
-        for (i=0; i<3; i++) {
-            U32 const rep = MEM_readLE32(dictPtr); dictPtr += 4;
-            if (rep==0 || rep >= dictContentSize) return ERROR(dictionary_corrupted);
-            entropy->rep[i] = rep;
-    }   }
+	if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
+	{   int i;
+		size_t const dictContentSize = (size_t)(dictEnd - (dictPtr+12));
+		for (i=0; i<3; i++) {
+			U32 const rep = MEM_readLE32(dictPtr); dictPtr += 4;
+			if (rep==0 || rep >= dictContentSize) return ERROR(dictionary_corrupted);
+			entropy->rep[i] = rep;
+	}   }
 
-    return dictPtr - (const BYTE*)dict;
+	return dictPtr - (const BYTE*)dict;
 }
 
 static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
 {
-    if (dictSize < 8) return ZSTD_refDictContent(dctx, dict, dictSize);
-    {   U32 const magic = MEM_readLE32(dict);
-        if (magic != ZSTD_DICT_MAGIC) {
-            return ZSTD_refDictContent(dctx, dict, dictSize);   /* pure content mode */
-    }   }
-    dctx->dictID = MEM_readLE32((const char*)dict + 4);
+	if (dictSize < 8) return ZSTD_refDictContent(dctx, dict, dictSize);
+	{   U32 const magic = MEM_readLE32(dict);
+		if (magic != ZSTD_DICT_MAGIC) {
+			return ZSTD_refDictContent(dctx, dict, dictSize);   /* pure content mode */
+	}   }
+	dctx->dictID = MEM_readLE32((const char*)dict + 4);
 
-    /* load entropy tables */
-    {   size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
-        if (ZSTD_isError(eSize)) return ERROR(dictionary_corrupted);
-        dict = (const char*)dict + eSize;
-        dictSize -= eSize;
-    }
-    dctx->litEntropy = dctx->fseEntropy = 1;
+	/* load entropy tables */
+	{   size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
+		if (ZSTD_isError(eSize)) return ERROR(dictionary_corrupted);
+		dict = (const char*)dict + eSize;
+		dictSize -= eSize;
+	}
+	dctx->litEntropy = dctx->fseEntropy = 1;
 
-    /* reference dictionary content */
-    return ZSTD_refDictContent(dctx, dict, dictSize);
+	/* reference dictionary content */
+	return ZSTD_refDictContent(dctx, dict, dictSize);
 }
 
 size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
 {
-    CHECK_F(ZSTD_decompressBegin(dctx));
-    if (dict && dictSize) CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
-    return 0;
+	CHECK_F(ZSTD_decompressBegin(dctx));
+	if (dict && dictSize) CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
+	return 0;
 }
 
 
 /* ======   ZSTD_DDict   ====== */
 
 struct ZSTD_DDict_s {
-    void* dictBuffer;
-    const void* dictContent;
-    size_t dictSize;
-    ZSTD_entropyTables_t entropy;
-    U32 dictID;
-    U32 entropyPresent;
-    ZSTD_customMem cMem;
+	void* dictBuffer;
+	const void* dictContent;
+	size_t dictSize;
+	ZSTD_entropyTables_t entropy;
+	U32 dictID;
+	U32 entropyPresent;
+	ZSTD_customMem cMem;
 };  /* typedef'd to ZSTD_DDict within "zstd.h" */
 
 static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict)
 {
-    return ddict->dictContent;
+	return ddict->dictContent;
 }
 
 static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict)
 {
-    return ddict->dictSize;
+	return ddict->dictSize;
 }
 
 static void ZSTD_refDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict)
 {
-    ZSTD_decompressBegin(dstDCtx);  /* init */
-    if (ddict) {   /* support refDDict on NULL */
-        dstDCtx->dictID = ddict->dictID;
-        dstDCtx->base = ddict->dictContent;
-        dstDCtx->vBase = ddict->dictContent;
-        dstDCtx->dictEnd = (const BYTE*)ddict->dictContent + ddict->dictSize;
-        dstDCtx->previousDstEnd = dstDCtx->dictEnd;
-        if (ddict->entropyPresent) {
-            dstDCtx->litEntropy = 1;
-            dstDCtx->fseEntropy = 1;
-            dstDCtx->LLTptr = ddict->entropy.LLTable;
-            dstDCtx->MLTptr = ddict->entropy.MLTable;
-            dstDCtx->OFTptr = ddict->entropy.OFTable;
-            dstDCtx->HUFptr = ddict->entropy.hufTable;
-            dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
-            dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
-            dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
-        } else {
-            dstDCtx->litEntropy = 0;
-            dstDCtx->fseEntropy = 0;
-        }
-    }
+	ZSTD_decompressBegin(dstDCtx);  /* init */
+	if (ddict) {   /* support refDDict on NULL */
+		dstDCtx->dictID = ddict->dictID;
+		dstDCtx->base = ddict->dictContent;
+		dstDCtx->vBase = ddict->dictContent;
+		dstDCtx->dictEnd = (const BYTE*)ddict->dictContent + ddict->dictSize;
+		dstDCtx->previousDstEnd = dstDCtx->dictEnd;
+		if (ddict->entropyPresent) {
+			dstDCtx->litEntropy = 1;
+			dstDCtx->fseEntropy = 1;
+			dstDCtx->LLTptr = ddict->entropy.LLTable;
+			dstDCtx->MLTptr = ddict->entropy.MLTable;
+			dstDCtx->OFTptr = ddict->entropy.OFTable;
+			dstDCtx->HUFptr = ddict->entropy.hufTable;
+			dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
+			dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
+			dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
+		} else {
+			dstDCtx->litEntropy = 0;
+			dstDCtx->fseEntropy = 0;
+		}
+	}
 }
 
 static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict* ddict)
 {
-    ddict->dictID = 0;
-    ddict->entropyPresent = 0;
-    if (ddict->dictSize < 8) return 0;
-    {   U32 const magic = MEM_readLE32(ddict->dictContent);
-        if (magic != ZSTD_DICT_MAGIC) return 0;   /* pure content mode */
-    }
-    ddict->dictID = MEM_readLE32((const char*)ddict->dictContent + 4);
+	ddict->dictID = 0;
+	ddict->entropyPresent = 0;
+	if (ddict->dictSize < 8) return 0;
+	{   U32 const magic = MEM_readLE32(ddict->dictContent);
+		if (magic != ZSTD_DICT_MAGIC) return 0;   /* pure content mode */
+	}
+	ddict->dictID = MEM_readLE32((const char*)ddict->dictContent + 4);
 
-    /* load entropy tables */
-    CHECK_E( ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted );
-    ddict->entropyPresent = 1;
-    return 0;
+	/* load entropy tables */
+	CHECK_E( ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted );
+	ddict->entropyPresent = 1;
+	return 0;
 }
 
 
 ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
 {
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    {   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
-        if (!ddict) return NULL;
-        ddict->cMem = customMem;
+	{   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
+		if (!ddict) return NULL;
+		ddict->cMem = customMem;
 
-        if ((byReference) || (!dict) || (!dictSize)) {
-            ddict->dictBuffer = NULL;
-            ddict->dictContent = dict;
-        } else {
-            void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
-            if (!internalBuffer) { ZSTD_freeDDict(ddict); return NULL; }
-            memcpy(internalBuffer, dict, dictSize);
-            ddict->dictBuffer = internalBuffer;
-            ddict->dictContent = internalBuffer;
-        }
-        ddict->dictSize = dictSize;
-        ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
-        /* parse dictionary content */
-        {   size_t const errorCode = ZSTD_loadEntropy_inDDict(ddict);
-            if (ZSTD_isError(errorCode)) {
-                ZSTD_freeDDict(ddict);
-                return NULL;
-        }   }
+		if ((byReference) || (!dict) || (!dictSize)) {
+			ddict->dictBuffer = NULL;
+			ddict->dictContent = dict;
+		} else {
+			void* const internalBuffer = ZSTD_malloc(dictSize, customMem);
+			if (!internalBuffer) { ZSTD_freeDDict(ddict); return NULL; }
+			memcpy(internalBuffer, dict, dictSize);
+			ddict->dictBuffer = internalBuffer;
+			ddict->dictContent = internalBuffer;
+		}
+		ddict->dictSize = dictSize;
+		ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+		/* parse dictionary content */
+		{   size_t const errorCode = ZSTD_loadEntropy_inDDict(ddict);
+			if (ZSTD_isError(errorCode)) {
+				ZSTD_freeDDict(ddict);
+				return NULL;
+		}   }
 
-        return ddict;
-    }
+		return ddict;
+	}
 }
 
 /*! ZSTD_createDDict() :
@@ -2061,8 +2061,8 @@ ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigne
 *   Consequently, `dict` can be released after `ZSTD_DDict` creation */
 ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
 {
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    return ZSTD_createDDict_advanced(dict, dictSize, 0, allocator);
+	ZSTD_customMem const allocator = { NULL, NULL, NULL };
+	return ZSTD_createDDict_advanced(dict, dictSize, 0, allocator);
 }
 
 
@@ -2072,25 +2072,25 @@ ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
  *  Warning : dictBuffer must outlive DDict (DDict must be freed before dictBuffer) */
 ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize)
 {
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    return ZSTD_createDDict_advanced(dictBuffer, dictSize, 1, allocator);
+	ZSTD_customMem const allocator = { NULL, NULL, NULL };
+	return ZSTD_createDDict_advanced(dictBuffer, dictSize, 1, allocator);
 }
 
 
 size_t ZSTD_freeDDict(ZSTD_DDict* ddict)
 {
-    if (ddict==NULL) return 0;   /* support free on NULL */
-    {   ZSTD_customMem const cMem = ddict->cMem;
-        ZSTD_free(ddict->dictBuffer, cMem);
-        ZSTD_free(ddict, cMem);
-        return 0;
-    }
+	if (ddict==NULL) return 0;   /* support free on NULL */
+	{   ZSTD_customMem const cMem = ddict->cMem;
+		ZSTD_free(ddict->dictBuffer, cMem);
+		ZSTD_free(ddict, cMem);
+		return 0;
+	}
 }
 
 size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
 {
-    if (ddict==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
+	if (ddict==NULL) return 0;   /* support sizeof on NULL */
+	return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
 }
 
 /*! ZSTD_getDictID_fromDict() :
@@ -2099,9 +2099,9 @@ size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
  *  It can still be loaded, but as a content-only dictionary. */
 unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize)
 {
-    if (dictSize < 8) return 0;
-    if (MEM_readLE32(dict) != ZSTD_DICT_MAGIC) return 0;
-    return MEM_readLE32((const char*)dict + 4);
+	if (dictSize < 8) return 0;
+	if (MEM_readLE32(dict) != ZSTD_DICT_MAGIC) return 0;
+	return MEM_readLE32((const char*)dict + 4);
 }
 
 /*! ZSTD_getDictID_fromDDict() :
@@ -2110,8 +2110,8 @@ unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize)
  *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
 unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
 {
-    if (ddict==NULL) return 0;
-    return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
+	if (ddict==NULL) return 0;
+	return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
 }
 
 /*! ZSTD_getDictID_fromFrame() :
@@ -2126,10 +2126,10 @@ unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
  *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
 unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
 {
-    ZSTD_frameParams zfp = { 0 , 0 , 0 , 0 };
-    size_t const hError = ZSTD_getFrameParams(&zfp, src, srcSize);
-    if (ZSTD_isError(hError)) return 0;
-    return zfp.dictID;
+	ZSTD_frameParams zfp = { 0 , 0 , 0 , 0 };
+	size_t const hError = ZSTD_getFrameParams(&zfp, src, srcSize);
+	if (ZSTD_isError(hError)) return 0;
+	return zfp.dictID;
 }
 
 
@@ -2137,14 +2137,14 @@ unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
 *   Decompression using a pre-digested Dictionary
 *   Use dictionary without significant overhead. */
 size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
-                                  void* dst, size_t dstCapacity,
-                            const void* src, size_t srcSize,
-                            const ZSTD_DDict* ddict)
+								  void* dst, size_t dstCapacity,
+							const void* src, size_t srcSize,
+							const ZSTD_DDict* ddict)
 {
-    /* pass content and size in case legacy frames are encountered */
-    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize,
-                                     NULL, 0,
-                                     ddict);
+	/* pass content and size in case legacy frames are encountered */
+	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize,
+									 NULL, 0,
+									 ddict);
 }
 
 
@@ -2153,76 +2153,76 @@ size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
 *====================================*/
 
 typedef enum { zdss_init, zdss_loadHeader,
-               zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
+			   zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
 
 /* *** Resource management *** */
 struct ZSTD_DStream_s {
-    ZSTD_DCtx* dctx;
-    ZSTD_DDict* ddictLocal;
-    const ZSTD_DDict* ddict;
-    ZSTD_frameParams fParams;
-    ZSTD_dStreamStage stage;
-    char*  inBuff;
-    size_t inBuffSize;
-    size_t inPos;
-    size_t maxWindowSize;
-    char*  outBuff;
-    size_t outBuffSize;
-    size_t outStart;
-    size_t outEnd;
-    size_t blockSize;
-    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];   /* tmp buffer to store frame header */
-    size_t lhSize;
-    ZSTD_customMem customMem;
-    void* legacyContext;
-    U32 previousLegacyVersion;
-    U32 legacyVersion;
-    U32 hostageByte;
+	ZSTD_DCtx* dctx;
+	ZSTD_DDict* ddictLocal;
+	const ZSTD_DDict* ddict;
+	ZSTD_frameParams fParams;
+	ZSTD_dStreamStage stage;
+	char*  inBuff;
+	size_t inBuffSize;
+	size_t inPos;
+	size_t maxWindowSize;
+	char*  outBuff;
+	size_t outBuffSize;
+	size_t outStart;
+	size_t outEnd;
+	size_t blockSize;
+	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];   /* tmp buffer to store frame header */
+	size_t lhSize;
+	ZSTD_customMem customMem;
+	void* legacyContext;
+	U32 previousLegacyVersion;
+	U32 legacyVersion;
+	U32 hostageByte;
 };   /* typedef'd to ZSTD_DStream within "zstd.h" */
 
 
 ZSTD_DStream* ZSTD_createDStream(void)
 {
-    return ZSTD_createDStream_advanced(defaultCustomMem);
+	return ZSTD_createDStream_advanced(defaultCustomMem);
 }
 
 ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
 {
-    ZSTD_DStream* zds;
+	ZSTD_DStream* zds;
 
-    if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
-    if (!customMem.customAlloc || !customMem.customFree) return NULL;
+	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
+	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
-    zds = (ZSTD_DStream*) ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
-    if (zds==NULL) return NULL;
-    memset(zds, 0, sizeof(ZSTD_DStream));
-    memcpy(&zds->customMem, &customMem, sizeof(ZSTD_customMem));
-    zds->dctx = ZSTD_createDCtx_advanced(customMem);
-    if (zds->dctx == NULL) { ZSTD_freeDStream(zds); return NULL; }
-    zds->stage = zdss_init;
-    zds->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
-    return zds;
+	zds = (ZSTD_DStream*) ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
+	if (zds==NULL) return NULL;
+	memset(zds, 0, sizeof(ZSTD_DStream));
+	memcpy(&zds->customMem, &customMem, sizeof(ZSTD_customMem));
+	zds->dctx = ZSTD_createDCtx_advanced(customMem);
+	if (zds->dctx == NULL) { ZSTD_freeDStream(zds); return NULL; }
+	zds->stage = zdss_init;
+	zds->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
+	return zds;
 }
 
 size_t ZSTD_freeDStream(ZSTD_DStream* zds)
 {
-    if (zds==NULL) return 0;   /* support free on null */
-    {   ZSTD_customMem const cMem = zds->customMem;
-        ZSTD_freeDCtx(zds->dctx);
-        zds->dctx = NULL;
-        ZSTD_freeDDict(zds->ddictLocal);
-        zds->ddictLocal = NULL;
-        ZSTD_free(zds->inBuff, cMem);
-        zds->inBuff = NULL;
-        ZSTD_free(zds->outBuff, cMem);
-        zds->outBuff = NULL;
+	if (zds==NULL) return 0;   /* support free on null */
+	{   ZSTD_customMem const cMem = zds->customMem;
+		ZSTD_freeDCtx(zds->dctx);
+		zds->dctx = NULL;
+		ZSTD_freeDDict(zds->ddictLocal);
+		zds->ddictLocal = NULL;
+		ZSTD_free(zds->inBuff, cMem);
+		zds->inBuff = NULL;
+		ZSTD_free(zds->outBuff, cMem);
+		zds->outBuff = NULL;
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-        if (zds->legacyContext)
-            ZSTD_freeLegacyStreamContext(zds->legacyContext, zds->previousLegacyVersion);
+		if (zds->legacyContext)
+			ZSTD_freeLegacyStreamContext(zds->legacyContext, zds->previousLegacyVersion);
 #endif
-        ZSTD_free(zds, cMem);
-        return 0;
-    }
+		ZSTD_free(zds, cMem);
+		return 0;
+	}
 }
 
 
@@ -2233,56 +2233,56 @@ size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
 
 size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize)
 {
-    zds->stage = zdss_loadHeader;
-    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-    ZSTD_freeDDict(zds->ddictLocal);
-    if (dict && dictSize >= 8) {
-        zds->ddictLocal = ZSTD_createDDict(dict, dictSize);
-        if (zds->ddictLocal == NULL) return ERROR(memory_allocation);
-    } else zds->ddictLocal = NULL;
-    zds->ddict = zds->ddictLocal;
-    zds->legacyVersion = 0;
-    zds->hostageByte = 0;
-    return ZSTD_frameHeaderSize_prefix;
+	zds->stage = zdss_loadHeader;
+	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+	ZSTD_freeDDict(zds->ddictLocal);
+	if (dict && dictSize >= 8) {
+		zds->ddictLocal = ZSTD_createDDict(dict, dictSize);
+		if (zds->ddictLocal == NULL) return ERROR(memory_allocation);
+	} else zds->ddictLocal = NULL;
+	zds->ddict = zds->ddictLocal;
+	zds->legacyVersion = 0;
+	zds->hostageByte = 0;
+	return ZSTD_frameHeaderSize_prefix;
 }
 
 size_t ZSTD_initDStream(ZSTD_DStream* zds)
 {
-    return ZSTD_initDStream_usingDict(zds, NULL, 0);
+	return ZSTD_initDStream_usingDict(zds, NULL, 0);
 }
 
 size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
 {
-    size_t const initResult = ZSTD_initDStream(zds);
-    zds->ddict = ddict;
-    return initResult;
+	size_t const initResult = ZSTD_initDStream(zds);
+	zds->ddict = ddict;
+	return initResult;
 }
 
 size_t ZSTD_resetDStream(ZSTD_DStream* zds)
 {
-    zds->stage = zdss_loadHeader;
-    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-    zds->legacyVersion = 0;
-    zds->hostageByte = 0;
-    return ZSTD_frameHeaderSize_prefix;
+	zds->stage = zdss_loadHeader;
+	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+	zds->legacyVersion = 0;
+	zds->hostageByte = 0;
+	return ZSTD_frameHeaderSize_prefix;
 }
 
 size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds,
-                                ZSTD_DStreamParameter_e paramType, unsigned paramValue)
+								ZSTD_DStreamParameter_e paramType, unsigned paramValue)
 {
-    switch(paramType)
-    {
-        default : return ERROR(parameter_unknown);
-        case DStream_p_maxWindowSize : zds->maxWindowSize = paramValue ? paramValue : (U32)(-1); break;
-    }
-    return 0;
+	switch(paramType)
+	{
+		default : return ERROR(parameter_unknown);
+		case DStream_p_maxWindowSize : zds->maxWindowSize = paramValue ? paramValue : (U32)(-1); break;
+	}
+	return 0;
 }
 
 
 size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
 {
-    if (zds==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*zds) + ZSTD_sizeof_DCtx(zds->dctx) + ZSTD_sizeof_DDict(zds->ddictLocal) + zds->inBuffSize + zds->outBuffSize;
+	if (zds==NULL) return 0;   /* support sizeof on NULL */
+	return sizeof(*zds) + ZSTD_sizeof_DCtx(zds->dctx) + ZSTD_sizeof_DDict(zds->ddictLocal) + zds->inBuffSize + zds->outBuffSize;
 }
 
 
@@ -2290,195 +2290,195 @@ size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
 
 MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-    size_t const length = MIN(dstCapacity, srcSize);
-    memcpy(dst, src, length);
-    return length;
+	size_t const length = MIN(dstCapacity, srcSize);
+	memcpy(dst, src, length);
+	return length;
 }
 
 
 size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
 {
-    const char* const istart = (const char*)(input->src) + input->pos;
-    const char* const iend = (const char*)(input->src) + input->size;
-    const char* ip = istart;
-    char* const ostart = (char*)(output->dst) + output->pos;
-    char* const oend = (char*)(output->dst) + output->size;
-    char* op = ostart;
-    U32 someMoreWork = 1;
+	const char* const istart = (const char*)(input->src) + input->pos;
+	const char* const iend = (const char*)(input->src) + input->size;
+	const char* ip = istart;
+	char* const ostart = (char*)(output->dst) + output->pos;
+	char* const oend = (char*)(output->dst) + output->size;
+	char* op = ostart;
+	U32 someMoreWork = 1;
 
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-    if (zds->legacyVersion)
-        return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
+	if (zds->legacyVersion)
+		return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
 #endif
 
-    while (someMoreWork) {
-        switch(zds->stage)
-        {
-        case zdss_init :
-            ZSTD_resetDStream(zds);   /* transparent reset on starting decoding a new frame */
-            /* fall-through */
+	while (someMoreWork) {
+		switch(zds->stage)
+		{
+		case zdss_init :
+			ZSTD_resetDStream(zds);   /* transparent reset on starting decoding a new frame */
+			/* fall-through */
 
-        case zdss_loadHeader :
-            {   size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
-                if (ZSTD_isError(hSize))
+		case zdss_loadHeader :
+			{   size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
+				if (ZSTD_isError(hSize))
 #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-                {   U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
-                    if (legacyVersion) {
-                        const void* const dict = zds->ddict ? zds->ddict->dictContent : NULL;
-                        size_t const dictSize = zds->ddict ? zds->ddict->dictSize : 0;
-                        CHECK_F(ZSTD_initLegacyStream(&zds->legacyContext, zds->previousLegacyVersion, legacyVersion,
-                                                       dict, dictSize));
-                        zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
-                        return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
-                    } else {
-                        return hSize; /* error */
-                }   }
+				{   U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
+					if (legacyVersion) {
+						const void* const dict = zds->ddict ? zds->ddict->dictContent : NULL;
+						size_t const dictSize = zds->ddict ? zds->ddict->dictSize : 0;
+						CHECK_F(ZSTD_initLegacyStream(&zds->legacyContext, zds->previousLegacyVersion, legacyVersion,
+													   dict, dictSize));
+						zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
+						return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
+					} else {
+						return hSize; /* error */
+				}   }
 #else
-                return hSize;
+				return hSize;
 #endif
-                if (hSize != 0) {   /* need more input */
-                    size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
-                    if (toLoad > (size_t)(iend-ip)) {   /* not enough input to load full header */
-                        memcpy(zds->headerBuffer + zds->lhSize, ip, iend-ip);
-                        zds->lhSize += iend-ip;
-                        input->pos = input->size;
-                        return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) + ZSTD_blockHeaderSize;   /* remaining header bytes + next block header */
-                    }
-                    memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad); zds->lhSize = hSize; ip += toLoad;
-                    break;
-            }   }
+				if (hSize != 0) {   /* need more input */
+					size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
+					if (toLoad > (size_t)(iend-ip)) {   /* not enough input to load full header */
+						memcpy(zds->headerBuffer + zds->lhSize, ip, iend-ip);
+						zds->lhSize += iend-ip;
+						input->pos = input->size;
+						return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) + ZSTD_blockHeaderSize;   /* remaining header bytes + next block header */
+					}
+					memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad); zds->lhSize = hSize; ip += toLoad;
+					break;
+			}   }
 
-            /* check for single-pass mode opportunity */
-            if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
-                && (U64)(size_t)(oend-op) >= zds->fParams.frameContentSize) {
-                size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend-istart);
-                if (cSize <= (size_t)(iend-istart)) {
-                    size_t const decompressedSize = ZSTD_decompress_usingDDict(zds->dctx, op, oend-op, istart, cSize, zds->ddict);
-                    if (ZSTD_isError(decompressedSize)) return decompressedSize;
-                    ip = istart + cSize;
-                    op += decompressedSize;
-                    zds->dctx->expected = 0;
-                    zds->stage = zdss_init;
-                    someMoreWork = 0;
-                    break;
-            }   }
+			/* check for single-pass mode opportunity */
+			if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
+				&& (U64)(size_t)(oend-op) >= zds->fParams.frameContentSize) {
+				size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend-istart);
+				if (cSize <= (size_t)(iend-istart)) {
+					size_t const decompressedSize = ZSTD_decompress_usingDDict(zds->dctx, op, oend-op, istart, cSize, zds->ddict);
+					if (ZSTD_isError(decompressedSize)) return decompressedSize;
+					ip = istart + cSize;
+					op += decompressedSize;
+					zds->dctx->expected = 0;
+					zds->stage = zdss_init;
+					someMoreWork = 0;
+					break;
+			}   }
 
-            /* Consume header */
-            ZSTD_refDDict(zds->dctx, zds->ddict);
-            {   size_t const h1Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);  /* == ZSTD_frameHeaderSize_prefix */
-                CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer, h1Size));
-                {   size_t const h2Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-                    CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer+h1Size, h2Size));
-            }   }
+			/* Consume header */
+			ZSTD_refDDict(zds->dctx, zds->ddict);
+			{   size_t const h1Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);  /* == ZSTD_frameHeaderSize_prefix */
+				CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer, h1Size));
+				{   size_t const h2Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+					CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer+h1Size, h2Size));
+			}   }
 
-            zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
-            if (zds->fParams.windowSize > zds->maxWindowSize) return ERROR(frameParameter_windowTooLarge);
+			zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
+			if (zds->fParams.windowSize > zds->maxWindowSize) return ERROR(frameParameter_windowTooLarge);
 
-            /* Adapt buffer sizes to frame header instructions */
-            {   size_t const blockSize = MIN(zds->fParams.windowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-                size_t const neededOutSize = zds->fParams.windowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-                zds->blockSize = blockSize;
-                if (zds->inBuffSize < blockSize) {
-                    ZSTD_free(zds->inBuff, zds->customMem);
-                    zds->inBuffSize = blockSize;
-                    zds->inBuff = (char*)ZSTD_malloc(blockSize, zds->customMem);
-                    if (zds->inBuff == NULL) return ERROR(memory_allocation);
-                }
-                if (zds->outBuffSize < neededOutSize) {
-                    ZSTD_free(zds->outBuff, zds->customMem);
-                    zds->outBuffSize = neededOutSize;
-                    zds->outBuff = (char*)ZSTD_malloc(neededOutSize, zds->customMem);
-                    if (zds->outBuff == NULL) return ERROR(memory_allocation);
-            }   }
-            zds->stage = zdss_read;
-            /* pass-through */
+			/* Adapt buffer sizes to frame header instructions */
+			{   size_t const blockSize = MIN(zds->fParams.windowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
+				size_t const neededOutSize = zds->fParams.windowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
+				zds->blockSize = blockSize;
+				if (zds->inBuffSize < blockSize) {
+					ZSTD_free(zds->inBuff, zds->customMem);
+					zds->inBuffSize = blockSize;
+					zds->inBuff = (char*)ZSTD_malloc(blockSize, zds->customMem);
+					if (zds->inBuff == NULL) return ERROR(memory_allocation);
+				}
+				if (zds->outBuffSize < neededOutSize) {
+					ZSTD_free(zds->outBuff, zds->customMem);
+					zds->outBuffSize = neededOutSize;
+					zds->outBuff = (char*)ZSTD_malloc(neededOutSize, zds->customMem);
+					if (zds->outBuff == NULL) return ERROR(memory_allocation);
+			}   }
+			zds->stage = zdss_read;
+			/* pass-through */
 
-        case zdss_read:
-            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-                if (neededInSize==0) {  /* end of frame */
-                    zds->stage = zdss_init;
-                    someMoreWork = 0;
-                    break;
-                }
-                if ((size_t)(iend-ip) >= neededInSize) {  /* decode directly from src */
-                    const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-                    size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
-                        zds->outBuff + zds->outStart, (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart),
-                        ip, neededInSize);
-                    if (ZSTD_isError(decodedSize)) return decodedSize;
-                    ip += neededInSize;
-                    if (!decodedSize && !isSkipFrame) break;   /* this was just a header */
-                    zds->outEnd = zds->outStart + decodedSize;
-                    zds->stage = zdss_flush;
-                    break;
-                }
-                if (ip==iend) { someMoreWork = 0; break; }   /* no more input */
-                zds->stage = zdss_load;
-                /* pass-through */
-            }
+		case zdss_read:
+			{   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+				if (neededInSize==0) {  /* end of frame */
+					zds->stage = zdss_init;
+					someMoreWork = 0;
+					break;
+				}
+				if ((size_t)(iend-ip) >= neededInSize) {  /* decode directly from src */
+					const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
+					size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
+						zds->outBuff + zds->outStart, (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart),
+						ip, neededInSize);
+					if (ZSTD_isError(decodedSize)) return decodedSize;
+					ip += neededInSize;
+					if (!decodedSize && !isSkipFrame) break;   /* this was just a header */
+					zds->outEnd = zds->outStart + decodedSize;
+					zds->stage = zdss_flush;
+					break;
+				}
+				if (ip==iend) { someMoreWork = 0; break; }   /* no more input */
+				zds->stage = zdss_load;
+				/* pass-through */
+			}
 
-        case zdss_load:
-            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-                size_t const toLoad = neededInSize - zds->inPos;   /* should always be <= remaining space within inBuff */
-                size_t loadedSize;
-                if (toLoad > zds->inBuffSize - zds->inPos) return ERROR(corruption_detected);   /* should never happen */
-                loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend-ip);
-                ip += loadedSize;
-                zds->inPos += loadedSize;
-                if (loadedSize < toLoad) { someMoreWork = 0; break; }   /* not enough input, wait for more */
+		case zdss_load:
+			{   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+				size_t const toLoad = neededInSize - zds->inPos;   /* should always be <= remaining space within inBuff */
+				size_t loadedSize;
+				if (toLoad > zds->inBuffSize - zds->inPos) return ERROR(corruption_detected);   /* should never happen */
+				loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend-ip);
+				ip += loadedSize;
+				zds->inPos += loadedSize;
+				if (loadedSize < toLoad) { someMoreWork = 0; break; }   /* not enough input, wait for more */
 
-                /* decode loaded input */
-                {  const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-                   size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
-                        zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
-                        zds->inBuff, neededInSize);
-                    if (ZSTD_isError(decodedSize)) return decodedSize;
-                    zds->inPos = 0;   /* input is consumed */
-                    if (!decodedSize && !isSkipFrame) { zds->stage = zdss_read; break; }   /* this was just a header */
-                    zds->outEnd = zds->outStart +  decodedSize;
-                    zds->stage = zdss_flush;
-                    /* pass-through */
-            }   }
+				/* decode loaded input */
+				{  const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
+				   size_t const decodedSize = ZSTD_decompressContinue(zds->dctx,
+						zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
+						zds->inBuff, neededInSize);
+					if (ZSTD_isError(decodedSize)) return decodedSize;
+					zds->inPos = 0;   /* input is consumed */
+					if (!decodedSize && !isSkipFrame) { zds->stage = zdss_read; break; }   /* this was just a header */
+					zds->outEnd = zds->outStart +  decodedSize;
+					zds->stage = zdss_flush;
+					/* pass-through */
+			}   }
 
-        case zdss_flush:
-            {   size_t const toFlushSize = zds->outEnd - zds->outStart;
-                size_t const flushedSize = ZSTD_limitCopy(op, oend-op, zds->outBuff + zds->outStart, toFlushSize);
-                op += flushedSize;
-                zds->outStart += flushedSize;
-                if (flushedSize == toFlushSize) {  /* flush completed */
-                    zds->stage = zdss_read;
-                    if (zds->outStart + zds->blockSize > zds->outBuffSize)
-                        zds->outStart = zds->outEnd = 0;
-                    break;
-                }
-                /* cannot complete flush */
-                someMoreWork = 0;
-                break;
-            }
-        default: return ERROR(GENERIC);   /* impossible */
-    }   }
+		case zdss_flush:
+			{   size_t const toFlushSize = zds->outEnd - zds->outStart;
+				size_t const flushedSize = ZSTD_limitCopy(op, oend-op, zds->outBuff + zds->outStart, toFlushSize);
+				op += flushedSize;
+				zds->outStart += flushedSize;
+				if (flushedSize == toFlushSize) {  /* flush completed */
+					zds->stage = zdss_read;
+					if (zds->outStart + zds->blockSize > zds->outBuffSize)
+						zds->outStart = zds->outEnd = 0;
+					break;
+				}
+				/* cannot complete flush */
+				someMoreWork = 0;
+				break;
+			}
+		default: return ERROR(GENERIC);   /* impossible */
+	}   }
 
-    /* result */
-    input->pos += (size_t)(ip-istart);
-    output->pos += (size_t)(op-ostart);
-    {   size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-        if (!nextSrcSizeHint) {   /* frame fully decoded */
-            if (zds->outEnd == zds->outStart) {  /* output fully flushed */
-                if (zds->hostageByte) {
-                    if (input->pos >= input->size) { zds->stage = zdss_read; return 1; }  /* can't release hostage (not present) */
-                    input->pos++;  /* release hostage */
-                }
-                return 0;
-            }
-            if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
-                input->pos--;   /* note : pos > 0, otherwise, impossible to finish reading last block */
-                zds->hostageByte=1;
-            }
-            return 1;
-        }
-        nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds->dctx) == ZSTDnit_block);   /* preload header of next block */
-        if (zds->inPos > nextSrcSizeHint) return ERROR(GENERIC);   /* should never happen */
-        nextSrcSizeHint -= zds->inPos;   /* already loaded*/
-        return nextSrcSizeHint;
-    }
+	/* result */
+	input->pos += (size_t)(ip-istart);
+	output->pos += (size_t)(op-ostart);
+	{   size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds->dctx);
+		if (!nextSrcSizeHint) {   /* frame fully decoded */
+			if (zds->outEnd == zds->outStart) {  /* output fully flushed */
+				if (zds->hostageByte) {
+					if (input->pos >= input->size) { zds->stage = zdss_read; return 1; }  /* can't release hostage (not present) */
+					input->pos++;  /* release hostage */
+				}
+				return 0;
+			}
+			if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
+				input->pos--;   /* note : pos > 0, otherwise, impossible to finish reading last block */
+				zds->hostageByte=1;
+			}
+			return 1;
+		}
+		nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds->dctx) == ZSTDnit_block);   /* preload header of next block */
+		if (zds->inPos > nextSrcSizeHint) return ERROR(GENERIC);   /* should never happen */
+		nextSrcSizeHint -= zds->inPos;   /* already loaded*/
+		return nextSrcSizeHint;
+	}
 }
diff --git a/contrib/linux-kernel/lib/zstd_errors.h b/contrib/linux-kernel/lib/zstd_errors.h
index 3d579d969..1cf0b0adb 100644
--- a/contrib/linux-kernel/lib/zstd_errors.h
+++ b/contrib/linux-kernel/lib/zstd_errors.h
@@ -62,8 +62,8 @@ typedef enum {
 } ZSTD_ErrorCode;
 
 /*! ZSTD_getErrorCode() :
-    convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
-    which can be used to compare directly with enum list published into "error_public.h" */
+	convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
+	which can be used to compare directly with enum list published into "error_public.h" */
 ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
 ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);
 
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index 5c5b28732..8b2c27f53 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -117,27 +117,27 @@ typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingTy
 #define OffFSELog   8
 
 static const U32 LL_bits[MaxLL+1] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                                      1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9,10,11,12,
-                                     13,14,15,16 };
+									  1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9,10,11,12,
+									 13,14,15,16 };
 static const S16 LL_defaultNorm[MaxLL+1] = { 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1,
-                                             2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1,
-                                            -1,-1,-1,-1 };
+											 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1,
+											-1,-1,-1,-1 };
 #define LL_DEFAULTNORMLOG 6  /* for static allocation */
 static const U32 LL_defaultNormLog = LL_DEFAULTNORMLOG;
 
 static const U32 ML_bits[MaxML+1] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                                      0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                                      1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 9,10,11,
-                                     12,13,14,15,16 };
+									  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+									  1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 9,10,11,
+									 12,13,14,15,16 };
 static const S16 ML_defaultNorm[MaxML+1] = { 1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
-                                             1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-                                             1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,-1,-1,
-                                            -1,-1,-1,-1,-1 };
+											 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+											 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,-1,-1,
+											-1,-1,-1,-1,-1 };
 #define ML_DEFAULTNORMLOG 6  /* for static allocation */
 static const U32 ML_defaultNormLog = ML_DEFAULTNORMLOG;
 
 static const S16 OF_defaultNorm[MaxOff+1] = { 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
-                                              1, 1, 1, 1, 1, 1, 1, 1,-1,-1,-1,-1,-1 };
+											  1, 1, 1, 1, 1, 1, 1, 1,-1,-1,-1,-1,-1 };
 #define OF_DEFAULTNORMLOG 5  /* for static allocation */
 static const U32 OF_defaultNormLog = OF_DEFAULTNORMLOG;
 
@@ -153,22 +153,22 @@ static void ZSTD_copy8(void* dst, const void* src) { memcpy(dst, src, 8); }
 #define WILDCOPY_OVERLENGTH 8
 MEM_STATIC void ZSTD_wildcopy(void* dst, const void* src, ptrdiff_t length)
 {
-    const BYTE* ip = (const BYTE*)src;
-    BYTE* op = (BYTE*)dst;
-    BYTE* const oend = op + length;
-    do
-        COPY8(op, ip)
-    while (op < oend);
+	const BYTE* ip = (const BYTE*)src;
+	BYTE* op = (BYTE*)dst;
+	BYTE* const oend = op + length;
+	do
+		COPY8(op, ip)
+	while (op < oend);
 }
 
 MEM_STATIC void ZSTD_wildcopy_e(void* dst, const void* src, void* dstEnd)   /* should be faster for decoding, but strangely, not verified on all platform */
 {
-    const BYTE* ip = (const BYTE*)src;
-    BYTE* op = (BYTE*)dst;
-    BYTE* const oend = (BYTE*)dstEnd;
-    do
-        COPY8(op, ip)
-    while (op < oend);
+	const BYTE* ip = (const BYTE*)src;
+	BYTE* op = (BYTE*)dst;
+	BYTE* const oend = (BYTE*)dstEnd;
+	do
+		COPY8(op, ip)
+	while (op < oend);
 }
 
 
@@ -178,58 +178,58 @@ MEM_STATIC void ZSTD_wildcopy_e(void* dst, const void* src, void* dstEnd)   /* s
 typedef struct ZSTD_stats_s ZSTD_stats_t;
 
 typedef struct {
-    U32 off;
-    U32 len;
+	U32 off;
+	U32 len;
 } ZSTD_match_t;
 
 typedef struct {
-    U32 price;
-    U32 off;
-    U32 mlen;
-    U32 litlen;
-    U32 rep[ZSTD_REP_NUM];
+	U32 price;
+	U32 off;
+	U32 mlen;
+	U32 litlen;
+	U32 rep[ZSTD_REP_NUM];
 } ZSTD_optimal_t;
 
 
 typedef struct seqDef_s {
-    U32 offset;
-    U16 litLength;
-    U16 matchLength;
+	U32 offset;
+	U16 litLength;
+	U16 matchLength;
 } seqDef;
 
 
 typedef struct {
-    seqDef* sequencesStart;
-    seqDef* sequences;
-    BYTE* litStart;
-    BYTE* lit;
-    BYTE* llCode;
-    BYTE* mlCode;
-    BYTE* ofCode;
-    U32   longLengthID;   /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
-    U32   longLengthPos;
-    /* opt */
-    ZSTD_optimal_t* priceTable;
-    ZSTD_match_t* matchTable;
-    U32* matchLengthFreq;
-    U32* litLengthFreq;
-    U32* litFreq;
-    U32* offCodeFreq;
-    U32  matchLengthSum;
-    U32  matchSum;
-    U32  litLengthSum;
-    U32  litSum;
-    U32  offCodeSum;
-    U32  log2matchLengthSum;
-    U32  log2matchSum;
-    U32  log2litLengthSum;
-    U32  log2litSum;
-    U32  log2offCodeSum;
-    U32  factor;
-    U32  staticPrices;
-    U32  cachedPrice;
-    U32  cachedLitLength;
-    const BYTE* cachedLiterals;
+	seqDef* sequencesStart;
+	seqDef* sequences;
+	BYTE* litStart;
+	BYTE* lit;
+	BYTE* llCode;
+	BYTE* mlCode;
+	BYTE* ofCode;
+	U32   longLengthID;   /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
+	U32   longLengthPos;
+	/* opt */
+	ZSTD_optimal_t* priceTable;
+	ZSTD_match_t* matchTable;
+	U32* matchLengthFreq;
+	U32* litLengthFreq;
+	U32* litFreq;
+	U32* offCodeFreq;
+	U32  matchLengthSum;
+	U32  matchSum;
+	U32  litLengthSum;
+	U32  litSum;
+	U32  offCodeSum;
+	U32  log2matchLengthSum;
+	U32  log2matchSum;
+	U32  log2litLengthSum;
+	U32  log2litSum;
+	U32  log2offCodeSum;
+	U32  factor;
+	U32  staticPrices;
+	U32  cachedPrice;
+	U32  cachedLitLength;
+	const BYTE* cachedLiterals;
 } seqStore_t;
 
 const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx);
@@ -251,22 +251,22 @@ void ZSTD_free(void* ptr, ZSTD_customMem customMem);
 MEM_STATIC U32 ZSTD_highbit32(U32 val)
 {
 #   if defined(_MSC_VER)   /* Visual */
-    unsigned long r=0;
-    _BitScanReverse(&r, val);
-    return (unsigned)r;
+	unsigned long r=0;
+	_BitScanReverse(&r, val);
+	return (unsigned)r;
 #   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* GCC Intrinsic */
-    return 31 - __builtin_clz(val);
+	return 31 - __builtin_clz(val);
 #   else   /* Software version */
-    static const int DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
-    U32 v = val;
-    int r;
-    v |= v >> 1;
-    v |= v >> 2;
-    v |= v >> 4;
-    v |= v >> 8;
-    v |= v >> 16;
-    r = DeBruijnClz[(U32)(v * 0x07C4ACDDU) >> 27];
-    return r;
+	static const int DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+	U32 v = val;
+	int r;
+	v |= v >> 1;
+	v |= v >> 2;
+	v |= v >> 4;
+	v |= v >> 8;
+	v |= v >> 16;
+	r = DeBruijnClz[(U32)(v * 0x07C4ACDDU) >> 27];
+	return r;
 #   endif
 }
 
diff --git a/contrib/linux-kernel/lib/zstd_opt.h b/contrib/linux-kernel/lib/zstd_opt.h
index 543761191..297a71559 100644
--- a/contrib/linux-kernel/lib/zstd_opt.h
+++ b/contrib/linux-kernel/lib/zstd_opt.h
@@ -24,181 +24,181 @@
 ***************************************/
 FORCE_INLINE void ZSTD_setLog2Prices(seqStore_t* ssPtr)
 {
-    ssPtr->log2matchLengthSum = ZSTD_highbit32(ssPtr->matchLengthSum+1);
-    ssPtr->log2litLengthSum = ZSTD_highbit32(ssPtr->litLengthSum+1);
-    ssPtr->log2litSum = ZSTD_highbit32(ssPtr->litSum+1);
-    ssPtr->log2offCodeSum = ZSTD_highbit32(ssPtr->offCodeSum+1);
-    ssPtr->factor = 1 + ((ssPtr->litSum>>5) / ssPtr->litLengthSum) + ((ssPtr->litSum<<1) / (ssPtr->litSum + ssPtr->matchSum));
+	ssPtr->log2matchLengthSum = ZSTD_highbit32(ssPtr->matchLengthSum+1);
+	ssPtr->log2litLengthSum = ZSTD_highbit32(ssPtr->litLengthSum+1);
+	ssPtr->log2litSum = ZSTD_highbit32(ssPtr->litSum+1);
+	ssPtr->log2offCodeSum = ZSTD_highbit32(ssPtr->offCodeSum+1);
+	ssPtr->factor = 1 + ((ssPtr->litSum>>5) / ssPtr->litLengthSum) + ((ssPtr->litSum<<1) / (ssPtr->litSum + ssPtr->matchSum));
 }
 
 
 MEM_STATIC void ZSTD_rescaleFreqs(seqStore_t* ssPtr, const BYTE* src, size_t srcSize)
 {
-    unsigned u;
+	unsigned u;
 
-    ssPtr->cachedLiterals = NULL;
-    ssPtr->cachedPrice = ssPtr->cachedLitLength = 0;
-    ssPtr->staticPrices = 0;
+	ssPtr->cachedLiterals = NULL;
+	ssPtr->cachedPrice = ssPtr->cachedLitLength = 0;
+	ssPtr->staticPrices = 0;
 
-    if (ssPtr->litLengthSum == 0) {
-        if (srcSize <= 1024) ssPtr->staticPrices = 1;
+	if (ssPtr->litLengthSum == 0) {
+		if (srcSize <= 1024) ssPtr->staticPrices = 1;
 
-        for (u=0; u<=MaxLit; u++)
-            ssPtr->litFreq[u] = 0;
-        for (u=0; u<srcSize; u++)
-            ssPtr->litFreq[src[u]]++;
+		for (u=0; u<=MaxLit; u++)
+			ssPtr->litFreq[u] = 0;
+		for (u=0; u<srcSize; u++)
+			ssPtr->litFreq[src[u]]++;
 
-        ssPtr->litSum = 0;
-        ssPtr->litLengthSum = MaxLL+1;
-        ssPtr->matchLengthSum = MaxML+1;
-        ssPtr->offCodeSum = (MaxOff+1);
-        ssPtr->matchSum = (ZSTD_LITFREQ_ADD<<Litbits);
+		ssPtr->litSum = 0;
+		ssPtr->litLengthSum = MaxLL+1;
+		ssPtr->matchLengthSum = MaxML+1;
+		ssPtr->offCodeSum = (MaxOff+1);
+		ssPtr->matchSum = (ZSTD_LITFREQ_ADD<<Litbits);
 
-        for (u=0; u<=MaxLit; u++) {
-            ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>ZSTD_FREQ_DIV);
-            ssPtr->litSum += ssPtr->litFreq[u];
-        }
-        for (u=0; u<=MaxLL; u++)
-            ssPtr->litLengthFreq[u] = 1;
-        for (u=0; u<=MaxML; u++)
-            ssPtr->matchLengthFreq[u] = 1;
-        for (u=0; u<=MaxOff; u++)
-            ssPtr->offCodeFreq[u] = 1;
-    } else {
-        ssPtr->matchLengthSum = 0;
-        ssPtr->litLengthSum = 0;
-        ssPtr->offCodeSum = 0;
-        ssPtr->matchSum = 0;
-        ssPtr->litSum = 0;
+		for (u=0; u<=MaxLit; u++) {
+			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>ZSTD_FREQ_DIV);
+			ssPtr->litSum += ssPtr->litFreq[u];
+		}
+		for (u=0; u<=MaxLL; u++)
+			ssPtr->litLengthFreq[u] = 1;
+		for (u=0; u<=MaxML; u++)
+			ssPtr->matchLengthFreq[u] = 1;
+		for (u=0; u<=MaxOff; u++)
+			ssPtr->offCodeFreq[u] = 1;
+	} else {
+		ssPtr->matchLengthSum = 0;
+		ssPtr->litLengthSum = 0;
+		ssPtr->offCodeSum = 0;
+		ssPtr->matchSum = 0;
+		ssPtr->litSum = 0;
 
-        for (u=0; u<=MaxLit; u++) {
-            ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>(ZSTD_FREQ_DIV+1));
-            ssPtr->litSum += ssPtr->litFreq[u];
-        }
-        for (u=0; u<=MaxLL; u++) {
-            ssPtr->litLengthFreq[u] = 1 + (ssPtr->litLengthFreq[u]>>(ZSTD_FREQ_DIV+1));
-            ssPtr->litLengthSum += ssPtr->litLengthFreq[u];
-        }
-        for (u=0; u<=MaxML; u++) {
-            ssPtr->matchLengthFreq[u] = 1 + (ssPtr->matchLengthFreq[u]>>ZSTD_FREQ_DIV);
-            ssPtr->matchLengthSum += ssPtr->matchLengthFreq[u];
-            ssPtr->matchSum += ssPtr->matchLengthFreq[u] * (u + 3);
-        }
-        ssPtr->matchSum *= ZSTD_LITFREQ_ADD;
-        for (u=0; u<=MaxOff; u++) {
-            ssPtr->offCodeFreq[u] = 1 + (ssPtr->offCodeFreq[u]>>ZSTD_FREQ_DIV);
-            ssPtr->offCodeSum += ssPtr->offCodeFreq[u];
-        }
-    }
+		for (u=0; u<=MaxLit; u++) {
+			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u]>>(ZSTD_FREQ_DIV+1));
+			ssPtr->litSum += ssPtr->litFreq[u];
+		}
+		for (u=0; u<=MaxLL; u++) {
+			ssPtr->litLengthFreq[u] = 1 + (ssPtr->litLengthFreq[u]>>(ZSTD_FREQ_DIV+1));
+			ssPtr->litLengthSum += ssPtr->litLengthFreq[u];
+		}
+		for (u=0; u<=MaxML; u++) {
+			ssPtr->matchLengthFreq[u] = 1 + (ssPtr->matchLengthFreq[u]>>ZSTD_FREQ_DIV);
+			ssPtr->matchLengthSum += ssPtr->matchLengthFreq[u];
+			ssPtr->matchSum += ssPtr->matchLengthFreq[u] * (u + 3);
+		}
+		ssPtr->matchSum *= ZSTD_LITFREQ_ADD;
+		for (u=0; u<=MaxOff; u++) {
+			ssPtr->offCodeFreq[u] = 1 + (ssPtr->offCodeFreq[u]>>ZSTD_FREQ_DIV);
+			ssPtr->offCodeSum += ssPtr->offCodeFreq[u];
+		}
+	}
 
-    ZSTD_setLog2Prices(ssPtr);
+	ZSTD_setLog2Prices(ssPtr);
 }
 
 
 FORCE_INLINE U32 ZSTD_getLiteralPrice(seqStore_t* ssPtr, U32 litLength, const BYTE* literals)
 {
-    U32 price, u;
+	U32 price, u;
 
-    if (ssPtr->staticPrices)
-        return ZSTD_highbit32((U32)litLength+1) + (litLength*6);
+	if (ssPtr->staticPrices)
+		return ZSTD_highbit32((U32)litLength+1) + (litLength*6);
 
-    if (litLength == 0)
-        return ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[0]+1);
+	if (litLength == 0)
+		return ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[0]+1);
 
-    /* literals */
-    if (ssPtr->cachedLiterals == literals) {
-        U32 const additional = litLength - ssPtr->cachedLitLength;
-        const BYTE* literals2 = ssPtr->cachedLiterals + ssPtr->cachedLitLength;
-        price = ssPtr->cachedPrice + additional * ssPtr->log2litSum;
-        for (u=0; u < additional; u++)
-            price -= ZSTD_highbit32(ssPtr->litFreq[literals2[u]]+1);
-        ssPtr->cachedPrice = price;
-        ssPtr->cachedLitLength = litLength;
-    } else {
-        price = litLength * ssPtr->log2litSum;
-        for (u=0; u < litLength; u++)
-            price -= ZSTD_highbit32(ssPtr->litFreq[literals[u]]+1);
+	/* literals */
+	if (ssPtr->cachedLiterals == literals) {
+		U32 const additional = litLength - ssPtr->cachedLitLength;
+		const BYTE* literals2 = ssPtr->cachedLiterals + ssPtr->cachedLitLength;
+		price = ssPtr->cachedPrice + additional * ssPtr->log2litSum;
+		for (u=0; u < additional; u++)
+			price -= ZSTD_highbit32(ssPtr->litFreq[literals2[u]]+1);
+		ssPtr->cachedPrice = price;
+		ssPtr->cachedLitLength = litLength;
+	} else {
+		price = litLength * ssPtr->log2litSum;
+		for (u=0; u < litLength; u++)
+			price -= ZSTD_highbit32(ssPtr->litFreq[literals[u]]+1);
 
-        if (litLength >= 12) {
-            ssPtr->cachedLiterals = literals;
-            ssPtr->cachedPrice = price;
-            ssPtr->cachedLitLength = litLength;
-        }
-    }
+		if (litLength >= 12) {
+			ssPtr->cachedLiterals = literals;
+			ssPtr->cachedPrice = price;
+			ssPtr->cachedLitLength = litLength;
+		}
+	}
 
-    /* literal Length */
-    {   const BYTE LL_deltaCode = 19;
-        const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-        price += LL_bits[llCode] + ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[llCode]+1);
-    }
+	/* literal Length */
+	{   const BYTE LL_deltaCode = 19;
+		const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
+		price += LL_bits[llCode] + ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[llCode]+1);
+	}
 
-    return price;
+	return price;
 }
 
 
 FORCE_INLINE U32 ZSTD_getPrice(seqStore_t* seqStorePtr, U32 litLength, const BYTE* literals, U32 offset, U32 matchLength, const int ultra)
 {
-    /* offset */
-    U32 price;
-    BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
+	/* offset */
+	U32 price;
+	BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
 
-    if (seqStorePtr->staticPrices)
-        return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength+1) + 16 + offCode;
+	if (seqStorePtr->staticPrices)
+		return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength+1) + 16 + offCode;
 
-    price = offCode + seqStorePtr->log2offCodeSum - ZSTD_highbit32(seqStorePtr->offCodeFreq[offCode]+1);
-    if (!ultra && offCode >= 20) price += (offCode-19)*2;
+	price = offCode + seqStorePtr->log2offCodeSum - ZSTD_highbit32(seqStorePtr->offCodeFreq[offCode]+1);
+	if (!ultra && offCode >= 20) price += (offCode-19)*2;
 
-    /* match Length */
-    {   const BYTE ML_deltaCode = 36;
-        const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-        price += ML_bits[mlCode] + seqStorePtr->log2matchLengthSum - ZSTD_highbit32(seqStorePtr->matchLengthFreq[mlCode]+1);
-    }
+	/* match Length */
+	{   const BYTE ML_deltaCode = 36;
+		const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
+		price += ML_bits[mlCode] + seqStorePtr->log2matchLengthSum - ZSTD_highbit32(seqStorePtr->matchLengthFreq[mlCode]+1);
+	}
 
-    return price + ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + seqStorePtr->factor;
+	return price + ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + seqStorePtr->factor;
 }
 
 
 MEM_STATIC void ZSTD_updatePrice(seqStore_t* seqStorePtr, U32 litLength, const BYTE* literals, U32 offset, U32 matchLength)
 {
-    U32 u;
+	U32 u;
 
-    /* literals */
-    seqStorePtr->litSum += litLength*ZSTD_LITFREQ_ADD;
-    for (u=0; u < litLength; u++)
-        seqStorePtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
+	/* literals */
+	seqStorePtr->litSum += litLength*ZSTD_LITFREQ_ADD;
+	for (u=0; u < litLength; u++)
+		seqStorePtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
 
-    /* literal Length */
-    {   const BYTE LL_deltaCode = 19;
-        const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-        seqStorePtr->litLengthFreq[llCode]++;
-        seqStorePtr->litLengthSum++;
-    }
+	/* literal Length */
+	{   const BYTE LL_deltaCode = 19;
+		const BYTE llCode = (litLength>63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
+		seqStorePtr->litLengthFreq[llCode]++;
+		seqStorePtr->litLengthSum++;
+	}
 
-    /* match offset */
-    {   BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
-        seqStorePtr->offCodeSum++;
-        seqStorePtr->offCodeFreq[offCode]++;
-    }
+	/* match offset */
+	{   BYTE const offCode = (BYTE)ZSTD_highbit32(offset+1);
+		seqStorePtr->offCodeSum++;
+		seqStorePtr->offCodeFreq[offCode]++;
+	}
 
-    /* match Length */
-    {   const BYTE ML_deltaCode = 36;
-        const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-        seqStorePtr->matchLengthFreq[mlCode]++;
-        seqStorePtr->matchLengthSum++;
-    }
+	/* match Length */
+	{   const BYTE ML_deltaCode = 36;
+		const BYTE mlCode = (matchLength>127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
+		seqStorePtr->matchLengthFreq[mlCode]++;
+		seqStorePtr->matchLengthSum++;
+	}
 
-    ZSTD_setLog2Prices(seqStorePtr);
+	ZSTD_setLog2Prices(seqStorePtr);
 }
 
 
 #define SET_PRICE(pos, mlen_, offset_, litlen_, price_)   \
-    {                                                 \
-        while (last_pos < pos)  { opt[last_pos+1].price = ZSTD_MAX_PRICE; last_pos++; } \
-        opt[pos].mlen = mlen_;                         \
-        opt[pos].off = offset_;                        \
-        opt[pos].litlen = litlen_;                     \
-        opt[pos].price = price_;                       \
-    }
+	{                                                 \
+		while (last_pos < pos)  { opt[last_pos+1].price = ZSTD_MAX_PRICE; last_pos++; } \
+		opt[pos].mlen = mlen_;                         \
+		opt[pos].off = offset_;                        \
+		opt[pos].litlen = litlen_;                     \
+		opt[pos].price = price_;                       \
+	}
 
 
 
@@ -207,19 +207,19 @@ MEM_STATIC void ZSTD_updatePrice(seqStore_t* seqStorePtr, U32 litLength, const B
 FORCE_INLINE
 U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_CCtx* zc, const BYTE* ip)
 {
-    U32* const hashTable3  = zc->hashTable3;
-    U32 const hashLog3  = zc->hashLog3;
-    const BYTE* const base = zc->base;
-    U32 idx = zc->nextToUpdate3;
-    const U32 target = zc->nextToUpdate3 = (U32)(ip - base);
-    const size_t hash3 = ZSTD_hash3Ptr(ip, hashLog3);
+	U32* const hashTable3  = zc->hashTable3;
+	U32 const hashLog3  = zc->hashLog3;
+	const BYTE* const base = zc->base;
+	U32 idx = zc->nextToUpdate3;
+	const U32 target = zc->nextToUpdate3 = (U32)(ip - base);
+	const size_t hash3 = ZSTD_hash3Ptr(ip, hashLog3);
 
-    while(idx < target) {
-        hashTable3[ZSTD_hash3Ptr(base+idx, hashLog3)] = idx;
-        idx++;
-    }
+	while(idx < target) {
+		hashTable3[ZSTD_hash3Ptr(base+idx, hashLog3)] = idx;
+		idx++;
+	}
 
-    return hashTable3[hash3];
+	return hashTable3[hash3];
 }
 
 
@@ -227,170 +227,170 @@ U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_CCtx* zc, const BYTE* ip)
 *  Binary Tree search
 ***************************************/
 static U32 ZSTD_insertBtAndGetAllMatches (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        U32 nbCompares, const U32 mls,
-                        U32 extDict, ZSTD_match_t* matches, const U32 minMatchLen)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iLimit,
+						U32 nbCompares, const U32 mls,
+						U32 extDict, ZSTD_match_t* matches, const U32 minMatchLen)
 {
-    const BYTE* const base = zc->base;
-    const U32 current = (U32)(ip-base);
-    const U32 hashLog = zc->params.cParams.hashLog;
-    const size_t h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32* const hashTable = zc->hashTable;
-    U32 matchIndex  = hashTable[h];
-    U32* const bt   = zc->chainTable;
-    const U32 btLog = zc->params.cParams.chainLog - 1;
-    const U32 btMask= (1U << btLog) - 1;
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const U32 btLow = btMask >= current ? 0 : current - btMask;
-    const U32 windowLow = zc->lowLimit;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = bt + 2*(current&btMask) + 1;
-    U32 matchEndIdx = current+8;
-    U32 dummy32;   /* to be nullified at the end */
-    U32 mnum = 0;
+	const BYTE* const base = zc->base;
+	const U32 current = (U32)(ip-base);
+	const U32 hashLog = zc->params.cParams.hashLog;
+	const size_t h  = ZSTD_hashPtr(ip, hashLog, mls);
+	U32* const hashTable = zc->hashTable;
+	U32 matchIndex  = hashTable[h];
+	U32* const bt   = zc->chainTable;
+	const U32 btLog = zc->params.cParams.chainLog - 1;
+	const U32 btMask= (1U << btLog) - 1;
+	size_t commonLengthSmaller=0, commonLengthLarger=0;
+	const BYTE* const dictBase = zc->dictBase;
+	const U32 dictLimit = zc->dictLimit;
+	const BYTE* const dictEnd = dictBase + dictLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const U32 btLow = btMask >= current ? 0 : current - btMask;
+	const U32 windowLow = zc->lowLimit;
+	U32* smallerPtr = bt + 2*(current&btMask);
+	U32* largerPtr  = bt + 2*(current&btMask) + 1;
+	U32 matchEndIdx = current+8;
+	U32 dummy32;   /* to be nullified at the end */
+	U32 mnum = 0;
 
-    const U32 minMatch = (mls == 3) ? 3 : 4;
-    size_t bestLength = minMatchLen-1;
+	const U32 minMatch = (mls == 3) ? 3 : 4;
+	size_t bestLength = minMatchLen-1;
 
-    if (minMatch == 3) { /* HC3 match finder */
-        U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3 (zc, ip);
-        if (matchIndex3>windowLow && (current - matchIndex3 < (1<<18))) {
-            const BYTE* match;
-            size_t currentMl=0;
-            if ((!extDict) || matchIndex3 >= dictLimit) {
-                match = base + matchIndex3;
-                if (match[bestLength] == ip[bestLength]) currentMl = ZSTD_count(ip, match, iLimit);
-            } else {
-                match = dictBase + matchIndex3;
-                if (MEM_readMINMATCH(match, MINMATCH) == MEM_readMINMATCH(ip, MINMATCH))    /* assumption : matchIndex3 <= dictLimit-4 (by table construction) */
-                    currentMl = ZSTD_count_2segments(ip+MINMATCH, match+MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH;
-            }
+	if (minMatch == 3) { /* HC3 match finder */
+		U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3 (zc, ip);
+		if (matchIndex3>windowLow && (current - matchIndex3 < (1<<18))) {
+			const BYTE* match;
+			size_t currentMl=0;
+			if ((!extDict) || matchIndex3 >= dictLimit) {
+				match = base + matchIndex3;
+				if (match[bestLength] == ip[bestLength]) currentMl = ZSTD_count(ip, match, iLimit);
+			} else {
+				match = dictBase + matchIndex3;
+				if (MEM_readMINMATCH(match, MINMATCH) == MEM_readMINMATCH(ip, MINMATCH))    /* assumption : matchIndex3 <= dictLimit-4 (by table construction) */
+					currentMl = ZSTD_count_2segments(ip+MINMATCH, match+MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH;
+			}
 
-            /* save best solution */
-            if (currentMl > bestLength) {
-                bestLength = currentMl;
-                matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex3;
-                matches[mnum].len = (U32)currentMl;
-                mnum++;
-                if (currentMl > ZSTD_OPT_NUM) goto update;
-                if (ip+currentMl == iLimit) goto update; /* best possible, and avoid read overflow*/
-            }
-        }
-    }
+			/* save best solution */
+			if (currentMl > bestLength) {
+				bestLength = currentMl;
+				matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex3;
+				matches[mnum].len = (U32)currentMl;
+				mnum++;
+				if (currentMl > ZSTD_OPT_NUM) goto update;
+				if (ip+currentMl == iLimit) goto update; /* best possible, and avoid read overflow*/
+			}
+		}
+	}
 
-    hashTable[h] = current;   /* Update Hash Table */
+	hashTable[h] = current;   /* Update Hash Table */
 
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
-        const BYTE* match;
+	while (nbCompares-- && (matchIndex > windowLow)) {
+		U32* nextPtr = bt + 2*(matchIndex & btMask);
+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+		const BYTE* match;
 
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            match = base + matchIndex;
-            if (match[matchLength] == ip[matchLength]) {
-                matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iLimit) +1;
-            }
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
-        }
+		if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
+			match = base + matchIndex;
+			if (match[matchLength] == ip[matchLength]) {
+				matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iLimit) +1;
+			}
+		} else {
+			match = dictBase + matchIndex;
+			matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
+			if (matchIndex+matchLength >= dictLimit)
+				match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+		}
 
-        if (matchLength > bestLength) {
-            if (matchLength > matchEndIdx - matchIndex) matchEndIdx = matchIndex + (U32)matchLength;
-            bestLength = matchLength;
-            matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex;
-            matches[mnum].len = (U32)matchLength;
-            mnum++;
-            if (matchLength > ZSTD_OPT_NUM) break;
-            if (ip+matchLength == iLimit)   /* equal : no way to know if inf or sup */
-                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
-        }
+		if (matchLength > bestLength) {
+			if (matchLength > matchEndIdx - matchIndex) matchEndIdx = matchIndex + (U32)matchLength;
+			bestLength = matchLength;
+			matches[mnum].off = ZSTD_REP_MOVE_OPT + current - matchIndex;
+			matches[mnum].len = (U32)matchLength;
+			mnum++;
+			if (matchLength > ZSTD_OPT_NUM) break;
+			if (ip+matchLength == iLimit)   /* equal : no way to know if inf or sup */
+				break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+		}
 
-        if (match[matchLength] < ip[matchLength]) {
-            /* match is smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-        } else {
-            /* match is larger than current */
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
+		if (match[matchLength] < ip[matchLength]) {
+			/* match is smaller than current */
+			*smallerPtr = matchIndex;             /* update smaller idx */
+			commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+			if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+			matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+		} else {
+			/* match is larger than current */
+			*largerPtr = matchIndex;
+			commonLengthLarger = matchLength;
+			if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+			largerPtr = nextPtr;
+			matchIndex = nextPtr[0];
+	}   }
 
-    *smallerPtr = *largerPtr = 0;
+	*smallerPtr = *largerPtr = 0;
 
 update:
-    zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
-    return mnum;
+	zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
+	return mnum;
 }
 
 
 /** Tree updater, providing best match */
 static U32 ZSTD_BtGetAllMatches (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iLimit,
+						const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
 {
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen);
+	if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
+	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen);
 }
 
 
 static U32 ZSTD_BtGetAllMatches_selectMLS (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iHighLimit,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
+						ZSTD_CCtx* zc,   /* Index table will be updated */
+						const BYTE* ip, const BYTE* const iHighLimit,
+						const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
 {
-    switch(matchLengthSearch)
-    {
-    case 3 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-    default :
-    case 4 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-    case 5 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-    case 7 :
-    case 6 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-    }
+	switch(matchLengthSearch)
+	{
+	case 3 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
+	default :
+	case 4 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
+	case 5 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+	case 7 :
+	case 6 : return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
+	}
 }
 
 /** Tree updater, providing best match */
 static U32 ZSTD_BtGetAllMatches_extDict (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
+						ZSTD_CCtx* zc,
+						const BYTE* const ip, const BYTE* const iLimit,
+						const U32 maxNbAttempts, const U32 mls, ZSTD_match_t* matches, const U32 minMatchLen)
 {
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);
+	if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
+	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
+	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);
 }
 
 
 static U32 ZSTD_BtGetAllMatches_selectMLS_extDict (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iHighLimit,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
+						ZSTD_CCtx* zc,   /* Index table will be updated */
+						const BYTE* ip, const BYTE* const iHighLimit,
+						const U32 maxNbAttempts, const U32 matchLengthSearch, ZSTD_match_t* matches, const U32 minMatchLen)
 {
-    switch(matchLengthSearch)
-    {
-    case 3 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-    default :
-    case 4 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-    case 5 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-    case 7 :
-    case 6 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-    }
+	switch(matchLengthSearch)
+	{
+	case 3 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
+	default :
+	case 4 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
+	case 5 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
+	case 7 :
+	case 6 : return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
+	}
 }
 
 
@@ -399,523 +399,523 @@ static U32 ZSTD_BtGetAllMatches_selectMLS_extDict (
 *********************************/
 FORCE_INLINE
 void ZSTD_compressBlock_opt_generic(ZSTD_CCtx* ctx,
-                                    const void* src, size_t srcSize, const int ultra)
+									const void* src, size_t srcSize, const int ultra)
 {
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base;
-    const BYTE* const prefixStart = base + ctx->dictLimit;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	const BYTE* const base = ctx->base;
+	const BYTE* const prefixStart = base + ctx->dictLimit;
 
-    const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-    const U32 sufficient_len = ctx->params.cParams.targetLength;
-    const U32 mls = ctx->params.cParams.searchLength;
-    const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
+	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
+	const U32 sufficient_len = ctx->params.cParams.targetLength;
+	const U32 mls = ctx->params.cParams.searchLength;
+	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
 
-    ZSTD_optimal_t* opt = seqStorePtr->priceTable;
-    ZSTD_match_t* matches = seqStorePtr->matchTable;
-    const BYTE* inr;
-    U32 offset, rep[ZSTD_REP_NUM];
+	ZSTD_optimal_t* opt = seqStorePtr->priceTable;
+	ZSTD_match_t* matches = seqStorePtr->matchTable;
+	const BYTE* inr;
+	U32 offset, rep[ZSTD_REP_NUM];
 
-    /* init */
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
-    ip += (ip==prefixStart);
-    { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
+	/* init */
+	ctx->nextToUpdate3 = ctx->nextToUpdate;
+	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
+	ip += (ip==prefixStart);
+	{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
 
-    /* Match Loop */
-    while (ip < ilimit) {
-        U32 cur, match_num, last_pos, litlen, price;
-        U32 u, mlen, best_mlen, best_off, litLength;
-        memset(opt, 0, sizeof(ZSTD_optimal_t));
-        last_pos = 0;
-        litlen = (U32)(ip - anchor);
+	/* Match Loop */
+	while (ip < ilimit) {
+		U32 cur, match_num, last_pos, litlen, price;
+		U32 u, mlen, best_mlen, best_off, litLength;
+		memset(opt, 0, sizeof(ZSTD_optimal_t));
+		last_pos = 0;
+		litlen = (U32)(ip - anchor);
 
-        /* check repCode */
-        {   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
-            for (i=(ip == anchor); i<last_i; i++) {
-                const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-                if ( (repCur > 0) && (repCur < (S32)(ip-prefixStart))
-                    && (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(ip - repCur, minMatch))) {
-                    mlen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repCur, iend) + minMatch;
-                    if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-                        best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
-                        goto _storeSequence;
-                    }
-                    best_off = i - (ip == anchor);
-                    do {
-                        price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-                        if (mlen > last_pos || price < opt[mlen].price)
-                            SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
-                        mlen--;
-                    } while (mlen >= minMatch);
-        }   }   }
+		/* check repCode */
+		{   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
+			for (i=(ip == anchor); i<last_i; i++) {
+				const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
+				if ( (repCur > 0) && (repCur < (S32)(ip-prefixStart))
+					&& (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(ip - repCur, minMatch))) {
+					mlen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repCur, iend) + minMatch;
+					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
+						best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
+						goto _storeSequence;
+					}
+					best_off = i - (ip == anchor);
+					do {
+						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+						if (mlen > last_pos || price < opt[mlen].price)
+							SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
+						mlen--;
+					} while (mlen >= minMatch);
+		}   }   }
 
-        match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch);
+		match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch);
 
-        if (!last_pos && !match_num) { ip++; continue; }
+		if (!last_pos && !match_num) { ip++; continue; }
 
-        if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
-            best_mlen = matches[match_num-1].len;
-            best_off = matches[match_num-1].off;
-            cur = 0;
-            last_pos = 1;
-            goto _storeSequence;
-        }
+		if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+			best_mlen = matches[match_num-1].len;
+			best_off = matches[match_num-1].off;
+			cur = 0;
+			last_pos = 1;
+			goto _storeSequence;
+		}
 
-        /* set prices using matches at position = 0 */
-        best_mlen = (last_pos) ? last_pos : minMatch;
-        for (u = 0; u < match_num; u++) {
-            mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
-            best_mlen = matches[u].len;
-            while (mlen <= best_mlen) {
-                price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
-                if (mlen > last_pos || price < opt[mlen].price)
-                    SET_PRICE(mlen, mlen, matches[u].off, litlen, price);   /* note : macro modifies last_pos */
-                mlen++;
-        }   }
+		/* set prices using matches at position = 0 */
+		best_mlen = (last_pos) ? last_pos : minMatch;
+		for (u = 0; u < match_num; u++) {
+			mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+			best_mlen = matches[u].len;
+			while (mlen <= best_mlen) {
+				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+				if (mlen > last_pos || price < opt[mlen].price)
+					SET_PRICE(mlen, mlen, matches[u].off, litlen, price);   /* note : macro modifies last_pos */
+				mlen++;
+		}   }
 
-        if (last_pos < minMatch) { ip++; continue; }
+		if (last_pos < minMatch) { ip++; continue; }
 
-        /* initialize opt[0] */
-        { U32 i ; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
-        opt[0].mlen = 1;
-        opt[0].litlen = litlen;
+		/* initialize opt[0] */
+		{ U32 i ; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
+		opt[0].mlen = 1;
+		opt[0].litlen = litlen;
 
-         /* check further positions */
-        for (cur = 1; cur <= last_pos; cur++) {
-           inr = ip + cur;
+		 /* check further positions */
+		for (cur = 1; cur <= last_pos; cur++) {
+		   inr = ip + cur;
 
-           if (opt[cur-1].mlen == 1) {
-                litlen = opt[cur-1].litlen + 1;
-                if (cur > litlen) {
-                    price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
-                } else
-                    price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-           } else {
-                litlen = 1;
-                price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
-           }
+		   if (opt[cur-1].mlen == 1) {
+				litlen = opt[cur-1].litlen + 1;
+				if (cur > litlen) {
+					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
+				} else
+					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
+		   } else {
+				litlen = 1;
+				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
+		   }
 
-           if (cur > last_pos || price <= opt[cur].price)
-                SET_PRICE(cur, 1, 0, litlen, price);
+		   if (cur > last_pos || price <= opt[cur].price)
+				SET_PRICE(cur, 1, 0, litlen, price);
 
-           if (cur == last_pos) break;
+		   if (cur == last_pos) break;
 
-           if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
-               continue;
+		   if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
+			   continue;
 
-           mlen = opt[cur].mlen;
-           if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-                opt[cur].rep[2] = opt[cur-mlen].rep[1];
-                opt[cur].rep[1] = opt[cur-mlen].rep[0];
-                opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-           } else {
-                opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
-                opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
-                opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
-           }
+		   mlen = opt[cur].mlen;
+		   if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
+				opt[cur].rep[2] = opt[cur-mlen].rep[1];
+				opt[cur].rep[1] = opt[cur-mlen].rep[0];
+				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
+		   } else {
+				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
+				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
+				opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
+		   }
 
-            best_mlen = minMatch;
-            {   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-                for (i=(opt[cur].mlen != 1); i<last_i; i++) {  /* check rep */
-                    const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-                    if ( (repCur > 0) && (repCur < (S32)(inr-prefixStart))
-                       && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(inr - repCur, minMatch))) {
-                       mlen = (U32)ZSTD_count(inr+minMatch, inr+minMatch - repCur, iend) + minMatch;
+			best_mlen = minMatch;
+			{   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
+				for (i=(opt[cur].mlen != 1); i<last_i; i++) {  /* check rep */
+					const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
+					if ( (repCur > 0) && (repCur < (S32)(inr-prefixStart))
+					   && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(inr - repCur, minMatch))) {
+					   mlen = (U32)ZSTD_count(inr+minMatch, inr+minMatch - repCur, iend) + minMatch;
 
-                       if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-                            best_mlen = mlen; best_off = i; last_pos = cur + 1;
-                            goto _storeSequence;
-                       }
+					   if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
+							best_mlen = mlen; best_off = i; last_pos = cur + 1;
+							goto _storeSequence;
+					   }
 
-                       best_off = i - (opt[cur].mlen != 1);
-                       if (mlen > best_mlen) best_mlen = mlen;
+					   best_off = i - (opt[cur].mlen != 1);
+					   if (mlen > best_mlen) best_mlen = mlen;
 
-                       do {
-                           if (opt[cur].mlen == 1) {
-                                litlen = opt[cur].litlen;
-                                if (cur > litlen) {
-                                    price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
-                                } else
-                                    price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-                            } else {
-                                litlen = 0;
-                                price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-                            }
+					   do {
+						   if (opt[cur].mlen == 1) {
+								litlen = opt[cur].litlen;
+								if (cur > litlen) {
+									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
+								} else
+									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+							} else {
+								litlen = 0;
+								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
+							}
 
-                            if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-                                SET_PRICE(cur + mlen, mlen, i, litlen, price);
-                            mlen--;
-                        } while (mlen >= minMatch);
-            }   }   }
+							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
+								SET_PRICE(cur + mlen, mlen, i, litlen, price);
+							mlen--;
+						} while (mlen >= minMatch);
+			}   }   }
 
-            match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, inr, iend, maxSearches, mls, matches, best_mlen);
+			match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, inr, iend, maxSearches, mls, matches, best_mlen);
 
-            if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
-                best_mlen = matches[match_num-1].len;
-                best_off = matches[match_num-1].off;
-                last_pos = cur + 1;
-                goto _storeSequence;
-            }
+			if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+				best_mlen = matches[match_num-1].len;
+				best_off = matches[match_num-1].off;
+				last_pos = cur + 1;
+				goto _storeSequence;
+			}
 
-            /* set prices using matches at position = cur */
-            for (u = 0; u < match_num; u++) {
-                mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
-                best_mlen = matches[u].len;
+			/* set prices using matches at position = cur */
+			for (u = 0; u < match_num; u++) {
+				mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+				best_mlen = matches[u].len;
 
-                while (mlen <= best_mlen) {
-                    if (opt[cur].mlen == 1) {
-                        litlen = opt[cur].litlen;
-                        if (cur > litlen)
-                            price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
-                        else
-                            price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
-                    } else {
-                        litlen = 0;
-                        price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
-                    }
+				while (mlen <= best_mlen) {
+					if (opt[cur].mlen == 1) {
+						litlen = opt[cur].litlen;
+						if (cur > litlen)
+							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
+						else
+							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+					} else {
+						litlen = 0;
+						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
+					}
 
-                    if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-                        SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
+					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
+						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
 
-                    mlen++;
-        }   }   }
+					mlen++;
+		}   }   }
 
-        best_mlen = opt[last_pos].mlen;
-        best_off = opt[last_pos].off;
-        cur = last_pos - best_mlen;
+		best_mlen = opt[last_pos].mlen;
+		best_off = opt[last_pos].off;
+		cur = last_pos - best_mlen;
 
-        /* store sequence */
+		/* store sequence */
 _storeSequence:   /* cur, last_pos, best_mlen, best_off have to be set */
-        opt[0].mlen = 1;
+		opt[0].mlen = 1;
 
-        while (1) {
-            mlen = opt[cur].mlen;
-            offset = opt[cur].off;
-            opt[cur].mlen = best_mlen;
-            opt[cur].off = best_off;
-            best_mlen = mlen;
-            best_off = offset;
-            if (mlen > cur) break;
-            cur -= mlen;
-        }
+		while (1) {
+			mlen = opt[cur].mlen;
+			offset = opt[cur].off;
+			opt[cur].mlen = best_mlen;
+			opt[cur].off = best_off;
+			best_mlen = mlen;
+			best_off = offset;
+			if (mlen > cur) break;
+			cur -= mlen;
+		}
 
-        for (u = 0; u <= last_pos;) {
-            u += opt[u].mlen;
-        }
+		for (u = 0; u <= last_pos;) {
+			u += opt[u].mlen;
+		}
 
-        for (cur=0; cur < last_pos; ) {
-            mlen = opt[cur].mlen;
-            if (mlen == 1) { ip++; cur++; continue; }
-            offset = opt[cur].off;
-            cur += mlen;
-            litLength = (U32)(ip - anchor);
+		for (cur=0; cur < last_pos; ) {
+			mlen = opt[cur].mlen;
+			if (mlen == 1) { ip++; cur++; continue; }
+			offset = opt[cur].off;
+			cur += mlen;
+			litLength = (U32)(ip - anchor);
 
-            if (offset > ZSTD_REP_MOVE_OPT) {
-                rep[2] = rep[1];
-                rep[1] = rep[0];
-                rep[0] = offset - ZSTD_REP_MOVE_OPT;
-                offset--;
-            } else {
-                if (offset != 0) {
-                    best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-                    if (offset != 1) rep[2] = rep[1];
-                    rep[1] = rep[0];
-                    rep[0] = best_off;
-                }
-                if (litLength==0) offset--;
-            }
+			if (offset > ZSTD_REP_MOVE_OPT) {
+				rep[2] = rep[1];
+				rep[1] = rep[0];
+				rep[0] = offset - ZSTD_REP_MOVE_OPT;
+				offset--;
+			} else {
+				if (offset != 0) {
+					best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
+					if (offset != 1) rep[2] = rep[1];
+					rep[1] = rep[0];
+					rep[0] = best_off;
+				}
+				if (litLength==0) offset--;
+			}
 
-            ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
-            anchor = ip = ip + mlen;
-    }    }   /* for (cur=0; cur < last_pos; ) */
+			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+			anchor = ip = ip + mlen;
+	}    }   /* for (cur=0; cur < last_pos; ) */
 
-    /* Save reps for next block */
-    { int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
+	/* Save reps for next block */
+	{ int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
 
-    /* Last Literals */
-    {   size_t const lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t const lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 
 FORCE_INLINE
 void ZSTD_compressBlock_opt_extDict_generic(ZSTD_CCtx* ctx,
-                                     const void* src, size_t srcSize, const int ultra)
+									 const void* src, size_t srcSize, const int ultra)
 {
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base;
-    const U32 lowestIndex = ctx->lowLimit;
-    const U32 dictLimit = ctx->dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const dictEnd  = dictBase + dictLimit;
+	seqStore_t* seqStorePtr = &(ctx->seqStore);
+	const BYTE* const istart = (const BYTE*)src;
+	const BYTE* ip = istart;
+	const BYTE* anchor = istart;
+	const BYTE* const iend = istart + srcSize;
+	const BYTE* const ilimit = iend - 8;
+	const BYTE* const base = ctx->base;
+	const U32 lowestIndex = ctx->lowLimit;
+	const U32 dictLimit = ctx->dictLimit;
+	const BYTE* const prefixStart = base + dictLimit;
+	const BYTE* const dictBase = ctx->dictBase;
+	const BYTE* const dictEnd  = dictBase + dictLimit;
 
-    const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-    const U32 sufficient_len = ctx->params.cParams.targetLength;
-    const U32 mls = ctx->params.cParams.searchLength;
-    const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
+	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
+	const U32 sufficient_len = ctx->params.cParams.targetLength;
+	const U32 mls = ctx->params.cParams.searchLength;
+	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
 
-    ZSTD_optimal_t* opt = seqStorePtr->priceTable;
-    ZSTD_match_t* matches = seqStorePtr->matchTable;
-    const BYTE* inr;
+	ZSTD_optimal_t* opt = seqStorePtr->priceTable;
+	ZSTD_match_t* matches = seqStorePtr->matchTable;
+	const BYTE* inr;
 
-    /* init */
-    U32 offset, rep[ZSTD_REP_NUM];
-    { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
+	/* init */
+	U32 offset, rep[ZSTD_REP_NUM];
+	{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) rep[i]=ctx->rep[i]; }
 
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
-    ip += (ip==prefixStart);
+	ctx->nextToUpdate3 = ctx->nextToUpdate;
+	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE*)src, srcSize);
+	ip += (ip==prefixStart);
 
-    /* Match Loop */
-    while (ip < ilimit) {
-        U32 cur, match_num, last_pos, litlen, price;
-        U32 u, mlen, best_mlen, best_off, litLength;
-        U32 current = (U32)(ip-base);
-        memset(opt, 0, sizeof(ZSTD_optimal_t));
-        last_pos = 0;
-        opt[0].litlen = (U32)(ip - anchor);
+	/* Match Loop */
+	while (ip < ilimit) {
+		U32 cur, match_num, last_pos, litlen, price;
+		U32 u, mlen, best_mlen, best_off, litLength;
+		U32 current = (U32)(ip-base);
+		memset(opt, 0, sizeof(ZSTD_optimal_t));
+		last_pos = 0;
+		opt[0].litlen = (U32)(ip - anchor);
 
-        /* check repCode */
-        {   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
-            for (i = (ip==anchor); i<last_i; i++) {
-                const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-                const U32 repIndex = (U32)(current - repCur);
-                const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-                const BYTE* const repMatch = repBase + repIndex;
-                if ( (repCur > 0 && repCur <= (S32)current)
-                   && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
-                   && (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
-                    /* repcode detected we should take it */
-                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                    mlen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
+		/* check repCode */
+		{   U32 i, last_i = ZSTD_REP_CHECK + (ip==anchor);
+			for (i = (ip==anchor); i<last_i; i++) {
+				const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
+				const U32 repIndex = (U32)(current - repCur);
+				const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+				const BYTE* const repMatch = repBase + repIndex;
+				if ( (repCur > 0 && repCur <= (S32)current)
+				   && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
+				   && (MEM_readMINMATCH(ip, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
+					/* repcode detected we should take it */
+					const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+					mlen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
 
-                    if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-                        best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
-                        goto _storeSequence;
-                    }
+					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
+						best_mlen = mlen; best_off = i; cur = 0; last_pos = 1;
+						goto _storeSequence;
+					}
 
-                    best_off = i - (ip==anchor);
-                    litlen = opt[0].litlen;
-                    do {
-                        price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-                        if (mlen > last_pos || price < opt[mlen].price)
-                            SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
-                        mlen--;
-                    } while (mlen >= minMatch);
-        }   }   }
+					best_off = i - (ip==anchor);
+					litlen = opt[0].litlen;
+					do {
+						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+						if (mlen > last_pos || price < opt[mlen].price)
+							SET_PRICE(mlen, mlen, i, litlen, price);   /* note : macro modifies last_pos */
+						mlen--;
+					} while (mlen >= minMatch);
+		}   }   }
 
-        match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, ip, iend, maxSearches, mls, matches, minMatch);  /* first search (depth 0) */
+		match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, ip, iend, maxSearches, mls, matches, minMatch);  /* first search (depth 0) */
 
-        if (!last_pos && !match_num) { ip++; continue; }
+		if (!last_pos && !match_num) { ip++; continue; }
 
-        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
-        opt[0].mlen = 1;
+		{ U32 i; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
+		opt[0].mlen = 1;
 
-        if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
-            best_mlen = matches[match_num-1].len;
-            best_off = matches[match_num-1].off;
-            cur = 0;
-            last_pos = 1;
-            goto _storeSequence;
-        }
+		if (match_num && (matches[match_num-1].len > sufficient_len || matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+			best_mlen = matches[match_num-1].len;
+			best_off = matches[match_num-1].off;
+			cur = 0;
+			last_pos = 1;
+			goto _storeSequence;
+		}
 
-        best_mlen = (last_pos) ? last_pos : minMatch;
+		best_mlen = (last_pos) ? last_pos : minMatch;
 
-        /* set prices using matches at position = 0 */
-        for (u = 0; u < match_num; u++) {
-            mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
-            best_mlen = matches[u].len;
-            litlen = opt[0].litlen;
-            while (mlen <= best_mlen) {
-                price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
-                if (mlen > last_pos || price < opt[mlen].price)
-                    SET_PRICE(mlen, mlen, matches[u].off, litlen, price);
-                mlen++;
-        }   }
+		/* set prices using matches at position = 0 */
+		for (u = 0; u < match_num; u++) {
+			mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+			best_mlen = matches[u].len;
+			litlen = opt[0].litlen;
+			while (mlen <= best_mlen) {
+				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+				if (mlen > last_pos || price < opt[mlen].price)
+					SET_PRICE(mlen, mlen, matches[u].off, litlen, price);
+				mlen++;
+		}   }
 
-        if (last_pos < minMatch) {
-            ip++; continue;
-        }
+		if (last_pos < minMatch) {
+			ip++; continue;
+		}
 
-        /* check further positions */
-        for (cur = 1; cur <= last_pos; cur++) {
-            inr = ip + cur;
+		/* check further positions */
+		for (cur = 1; cur <= last_pos; cur++) {
+			inr = ip + cur;
 
-            if (opt[cur-1].mlen == 1) {
-                litlen = opt[cur-1].litlen + 1;
-                if (cur > litlen) {
-                    price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
-                } else
-                    price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-            } else {
-                litlen = 1;
-                price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
-            }
+			if (opt[cur-1].mlen == 1) {
+				litlen = opt[cur-1].litlen + 1;
+				if (cur > litlen) {
+					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-litlen);
+				} else
+					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
+			} else {
+				litlen = 1;
+				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr-1);
+			}
 
-            if (cur > last_pos || price <= opt[cur].price)
-                SET_PRICE(cur, 1, 0, litlen, price);
+			if (cur > last_pos || price <= opt[cur].price)
+				SET_PRICE(cur, 1, 0, litlen, price);
 
-            if (cur == last_pos) break;
+			if (cur == last_pos) break;
 
-            if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
-                continue;
+			if (inr > ilimit)  /* last match must start at a minimum distance of 8 from oend */
+				continue;
 
-            mlen = opt[cur].mlen;
-            if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-                opt[cur].rep[2] = opt[cur-mlen].rep[1];
-                opt[cur].rep[1] = opt[cur-mlen].rep[0];
-                opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-            } else {
-                opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
-                opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
-                opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
-            }
+			mlen = opt[cur].mlen;
+			if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
+				opt[cur].rep[2] = opt[cur-mlen].rep[1];
+				opt[cur].rep[1] = opt[cur-mlen].rep[0];
+				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
+			} else {
+				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur-mlen].rep[1] : opt[cur-mlen].rep[2];
+				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur-mlen].rep[0] : opt[cur-mlen].rep[1];
+				opt[cur].rep[0] = ((opt[cur].off==ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur-mlen].rep[0] - 1) : (opt[cur-mlen].rep[opt[cur].off]);
+			}
 
-            best_mlen = minMatch;
-            {   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-                for (i = (mlen != 1); i<last_i; i++) {
-                    const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-                    const U32 repIndex = (U32)(current+cur - repCur);
-                    const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-                    const BYTE* const repMatch = repBase + repIndex;
-                    if ( (repCur > 0 && repCur <= (S32)(current+cur))
-                      && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
-                      && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
-                        /* repcode detected */
-                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                        mlen = (U32)ZSTD_count_2segments(inr+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
+			best_mlen = minMatch;
+			{   U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
+				for (i = (mlen != 1); i<last_i; i++) {
+					const S32 repCur = (i==ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
+					const U32 repIndex = (U32)(current+cur - repCur);
+					const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+					const BYTE* const repMatch = repBase + repIndex;
+					if ( (repCur > 0 && repCur <= (S32)(current+cur))
+					  && (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex>lowestIndex))  /* intentional overflow */
+					  && (MEM_readMINMATCH(inr, minMatch) == MEM_readMINMATCH(repMatch, minMatch)) ) {
+						/* repcode detected */
+						const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+						mlen = (U32)ZSTD_count_2segments(inr+minMatch, repMatch+minMatch, iend, repEnd, prefixStart) + minMatch;
 
-                        if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-                            best_mlen = mlen; best_off = i; last_pos = cur + 1;
-                            goto _storeSequence;
-                        }
+						if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
+							best_mlen = mlen; best_off = i; last_pos = cur + 1;
+							goto _storeSequence;
+						}
 
-                        best_off = i - (opt[cur].mlen != 1);
-                        if (mlen > best_mlen) best_mlen = mlen;
+						best_off = i - (opt[cur].mlen != 1);
+						if (mlen > best_mlen) best_mlen = mlen;
 
-                        do {
-                            if (opt[cur].mlen == 1) {
-                                litlen = opt[cur].litlen;
-                                if (cur > litlen) {
-                                    price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
-                                } else
-                                    price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-                            } else {
-                                litlen = 0;
-                                price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-                            }
+						do {
+							if (opt[cur].mlen == 1) {
+								litlen = opt[cur].litlen;
+								if (cur > litlen) {
+									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr-litlen, best_off, mlen - MINMATCH, ultra);
+								} else
+									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
+							} else {
+								litlen = 0;
+								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
+							}
 
-                            if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-                                SET_PRICE(cur + mlen, mlen, i, litlen, price);
-                            mlen--;
-                        } while (mlen >= minMatch);
-            }   }   }
+							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
+								SET_PRICE(cur + mlen, mlen, i, litlen, price);
+							mlen--;
+						} while (mlen >= minMatch);
+			}   }   }
 
-            match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, inr, iend, maxSearches, mls, matches, minMatch);
+			match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, inr, iend, maxSearches, mls, matches, minMatch);
 
-            if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
-                best_mlen = matches[match_num-1].len;
-                best_off = matches[match_num-1].off;
-                last_pos = cur + 1;
-                goto _storeSequence;
-            }
+			if (match_num > 0 && (matches[match_num-1].len > sufficient_len || cur + matches[match_num-1].len >= ZSTD_OPT_NUM)) {
+				best_mlen = matches[match_num-1].len;
+				best_off = matches[match_num-1].off;
+				last_pos = cur + 1;
+				goto _storeSequence;
+			}
 
-            /* set prices using matches at position = cur */
-            for (u = 0; u < match_num; u++) {
-                mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
-                best_mlen = matches[u].len;
+			/* set prices using matches at position = cur */
+			for (u = 0; u < match_num; u++) {
+				mlen = (u>0) ? matches[u-1].len+1 : best_mlen;
+				best_mlen = matches[u].len;
 
-                while (mlen <= best_mlen) {
-                    if (opt[cur].mlen == 1) {
-                        litlen = opt[cur].litlen;
-                        if (cur > litlen)
-                            price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
-                        else
-                            price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
-                    } else {
-                        litlen = 0;
-                        price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
-                    }
+				while (mlen <= best_mlen) {
+					if (opt[cur].mlen == 1) {
+						litlen = opt[cur].litlen;
+						if (cur > litlen)
+							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip+cur-litlen, matches[u].off-1, mlen - MINMATCH, ultra);
+						else
+							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off-1, mlen - MINMATCH, ultra);
+					} else {
+						litlen = 0;
+						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off-1, mlen - MINMATCH, ultra);
+					}
 
-                    if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-                        SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
+					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
+						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
 
-                    mlen++;
-        }   }   }   /* for (cur = 1; cur <= last_pos; cur++) */
+					mlen++;
+		}   }   }   /* for (cur = 1; cur <= last_pos; cur++) */
 
-        best_mlen = opt[last_pos].mlen;
-        best_off = opt[last_pos].off;
-        cur = last_pos - best_mlen;
+		best_mlen = opt[last_pos].mlen;
+		best_off = opt[last_pos].off;
+		cur = last_pos - best_mlen;
 
-        /* store sequence */
+		/* store sequence */
 _storeSequence:   /* cur, last_pos, best_mlen, best_off have to be set */
-        opt[0].mlen = 1;
+		opt[0].mlen = 1;
 
-        while (1) {
-            mlen = opt[cur].mlen;
-            offset = opt[cur].off;
-            opt[cur].mlen = best_mlen;
-            opt[cur].off = best_off;
-            best_mlen = mlen;
-            best_off = offset;
-            if (mlen > cur) break;
-            cur -= mlen;
-        }
+		while (1) {
+			mlen = opt[cur].mlen;
+			offset = opt[cur].off;
+			opt[cur].mlen = best_mlen;
+			opt[cur].off = best_off;
+			best_mlen = mlen;
+			best_off = offset;
+			if (mlen > cur) break;
+			cur -= mlen;
+		}
 
-        for (u = 0; u <= last_pos; ) {
-            u += opt[u].mlen;
-        }
+		for (u = 0; u <= last_pos; ) {
+			u += opt[u].mlen;
+		}
 
-        for (cur=0; cur < last_pos; ) {
-            mlen = opt[cur].mlen;
-            if (mlen == 1) { ip++; cur++; continue; }
-            offset = opt[cur].off;
-            cur += mlen;
-            litLength = (U32)(ip - anchor);
+		for (cur=0; cur < last_pos; ) {
+			mlen = opt[cur].mlen;
+			if (mlen == 1) { ip++; cur++; continue; }
+			offset = opt[cur].off;
+			cur += mlen;
+			litLength = (U32)(ip - anchor);
 
-            if (offset > ZSTD_REP_MOVE_OPT) {
-                rep[2] = rep[1];
-                rep[1] = rep[0];
-                rep[0] = offset - ZSTD_REP_MOVE_OPT;
-                offset--;
-            } else {
-                if (offset != 0) {
-                    best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-                    if (offset != 1) rep[2] = rep[1];
-                    rep[1] = rep[0];
-                    rep[0] = best_off;
-                }
+			if (offset > ZSTD_REP_MOVE_OPT) {
+				rep[2] = rep[1];
+				rep[1] = rep[0];
+				rep[0] = offset - ZSTD_REP_MOVE_OPT;
+				offset--;
+			} else {
+				if (offset != 0) {
+					best_off = (offset==ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
+					if (offset != 1) rep[2] = rep[1];
+					rep[1] = rep[0];
+					rep[0] = best_off;
+				}
 
-                if (litLength==0) offset--;
-            }
+				if (litLength==0) offset--;
+			}
 
-            ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
-            anchor = ip = ip + mlen;
-    }    }   /* for (cur=0; cur < last_pos; ) */
+			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen-MINMATCH);
+			anchor = ip = ip + mlen;
+	}    }   /* for (cur=0; cur < last_pos; ) */
 
-    /* Save reps for next block */
-    { int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
+	/* Save reps for next block */
+	{ int i; for (i=0; i<ZSTD_REP_NUM; i++) ctx->repToConfirm[i] = rep[i]; }
 
-    /* Last Literals */
-    {   size_t lastLLSize = iend - anchor;
-        memcpy(seqStorePtr->lit, anchor, lastLLSize);
-        seqStorePtr->lit += lastLLSize;
-    }
+	/* Last Literals */
+	{   size_t lastLLSize = iend - anchor;
+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
+		seqStorePtr->lit += lastLLSize;
+	}
 }
 
 #endif  /* ZSTD_OPT_H_91842398743 */

From b3b41d0f6dc4cf79334d9c72fffc784da0575b3b Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 29 Mar 2017 20:26:07 -0700
Subject: [PATCH 083/255] Remove platform specific macros

---
 contrib/linux-kernel/include/zstd.h        |  21 +---
 contrib/linux-kernel/lib/bitstream.h       |  26 ----
 contrib/linux-kernel/lib/error_private.h   |  22 +---
 contrib/linux-kernel/lib/fse.h             |  18 +--
 contrib/linux-kernel/lib/fse_compress.c    |  17 +--
 contrib/linux-kernel/lib/fse_decompress.c  |  17 +--
 contrib/linux-kernel/lib/huf.h             |   9 --
 contrib/linux-kernel/lib/huf_compress.c    |   7 --
 contrib/linux-kernel/lib/huf_decompress.c  |  17 +--
 contrib/linux-kernel/lib/mem.h             | 125 ++-----------------
 contrib/linux-kernel/lib/xxhash.c          | 137 ++-------------------
 contrib/linux-kernel/lib/xxhash.h          |  58 +--------
 contrib/linux-kernel/lib/zstd_decompress.c |  93 +-------------
 contrib/linux-kernel/lib/zstd_errors.h     |  22 +---
 contrib/linux-kernel/lib/zstd_internal.h   |  29 +----
 15 files changed, 35 insertions(+), 583 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index d7f4f5a09..ff7f86a6d 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -7,10 +7,6 @@
  * of patent rights can be found in the PATENTS file in the same directory.
  */
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 #ifndef ZSTD_H_235446
 #define ZSTD_H_235446
 
@@ -19,18 +15,7 @@ extern "C" {
 
 
 /* =====   ZSTDLIB_API : control library symbols visibility   ===== */
-#if defined(__GNUC__) && (__GNUC__ >= 4)
-#  define ZSTDLIB_VISIBILITY __attribute__ ((visibility ("default")))
-#else
-#  define ZSTDLIB_VISIBILITY
-#endif
-#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
-#  define ZSTDLIB_API __declspec(dllexport) ZSTDLIB_VISIBILITY
-#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
-#  define ZSTDLIB_API __declspec(dllimport) ZSTDLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define ZSTDLIB_API ZSTDLIB_VISIBILITY
-#endif
+#define ZSTDLIB_API
 
 
 /*******************************************************************************************************
@@ -769,7 +754,3 @@ ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, siz
 
 
 #endif   /* ZSTD_H_ZSTD_STATIC_LINKING_ONLY */
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/contrib/linux-kernel/lib/bitstream.h b/contrib/linux-kernel/lib/bitstream.h
index 546f6582b..9d2154082 100644
--- a/contrib/linux-kernel/lib/bitstream.h
+++ b/contrib/linux-kernel/lib/bitstream.h
@@ -35,11 +35,6 @@
 #ifndef BITSTREAM_H_MODULE
 #define BITSTREAM_H_MODULE
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
 /*
 *  This API consists of small unitary functions, which must be inlined for best performance.
 *  Since link-time-optimization is not available for all compilers,
@@ -56,10 +51,6 @@ extern "C" {
 /*=========================================
 *  Target specific
 =========================================*/
-#if defined(__BMI__) && defined(__GNUC__)
-#  include <immintrin.h>   /* support for bextr (experimental) */
-#endif
-
 #define STREAM_ACCUMULATOR_MIN_32  25
 #define STREAM_ACCUMULATOR_MIN_64  57
 #define STREAM_ACCUMULATOR_MIN    ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
@@ -301,16 +292,7 @@ MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
 
 MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
 {
-#if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008  /* experimental */
-#  if defined(__x86_64__)
-	if (sizeof(bitContainer)==8)
-		return _bextr_u64(bitContainer, start, nbBits);
-	else
-#  endif
-		return _bextr_u32(bitContainer, start, nbBits);
-#else
 	return (bitContainer >> start) & BIT_mask[nbBits];
-#endif
 }
 
 MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
@@ -327,12 +309,8 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
  */
  MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
 {
-#if defined(__BMI__) && defined(__GNUC__)   /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
-	return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
-#else
 	U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
 	return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
-#endif
 }
 
 /*! BIT_lookBitsFast() :
@@ -410,8 +388,4 @@ MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
 	return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
 }
 
-#if defined (__cplusplus)
-}
-#endif
-
 #endif /* BITSTREAM_H_MODULE */
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index dc160914b..e88f2fd17 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -12,11 +12,6 @@
 #ifndef ERROR_H_MODULE
 #define ERROR_H_MODULE
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
 /* ****************************************
 *  Dependencies
 ******************************************/
@@ -27,15 +22,7 @@ extern "C" {
 /* ****************************************
 *  Compiler-specific
 ******************************************/
-#if defined(__GNUC__)
-#  define ERR_STATIC static __attribute__((unused))
-#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define ERR_STATIC static inline
-#elif defined(_MSC_VER)
-#  define ERR_STATIC static __inline
-#else
-#  define ERR_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
+#define ERR_STATIC static __attribute__((unused))
 
 
 /*-****************************************
@@ -48,9 +35,6 @@ typedef ZSTD_ErrorCode ERR_enum;
 /*-****************************************
 *  Error codes handling
 ******************************************/
-#ifdef ERROR
-#  undef ERROR   /* reported already defined on VS 2015 (Rich Geldreich) */
-#endif
 #define ERROR(name) ((size_t)-PREFIX(name))
 
 ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
@@ -69,8 +53,4 @@ ERR_STATIC const char* ERR_getErrorName(size_t code)
 	return ERR_getErrorString(ERR_getErrorCode(code));
 }
 
-#if defined (__cplusplus)
-}
-#endif
-
 #endif /* ERROR_H_MODULE */
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index bcb592e96..538d52427 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -34,10 +34,6 @@
 #ifndef FSE_H
 #define FSE_H
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 
 /*-*****************************************
 *  Dependencies
@@ -48,15 +44,7 @@ extern "C" {
 /*-*****************************************
 *  FSE_PUBLIC_API : control library symbols visibility
 ******************************************/
-#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
-#  define FSE_PUBLIC_API __attribute__ ((visibility ("default")))
-#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
-#  define FSE_PUBLIC_API __declspec(dllexport)
-#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
-#  define FSE_PUBLIC_API __declspec(dllimport) /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define FSE_PUBLIC_API
-#endif
+#define FSE_PUBLIC_API
 
 /*------   Version   ------*/
 #define FSE_VERSION_MAJOR    0
@@ -687,8 +675,4 @@ MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
 #endif /* FSE_STATIC_LINKING_ONLY */
 
 
-#if defined (__cplusplus)
-}
-#endif
-
 #endif  /* FSE_H */
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index 7340d413a..dbfa510c6 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -35,22 +35,7 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  include <intrin.h>                    /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
+#define FORCE_INLINE static __attribute__((always_inline))
 
 
 /* **************************************************************
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
index dd2dadc20..e53d99fb4 100644
--- a/contrib/linux-kernel/lib/fse_decompress.c
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -36,22 +36,7 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  include <intrin.h>                    /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
+#define FORCE_INLINE static __attribute__((always_inline))
 
 
 /* **************************************************************
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index 8ad3e2b42..f22a7d4f1 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -34,10 +34,6 @@
 #ifndef HUF_H_298734234
 #define HUF_H_298734234
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 
 /* *** Dependencies *** */
 #include <stddef.h>    /* size_t */
@@ -252,9 +248,4 @@ size_t HUF_decompress1X4_usingDTable(void* dst, size_t maxDstSize, const void* c
 
 #endif /* HUF_STATIC_LINKING_ONLY */
 
-
-#if defined (__cplusplus)
-}
-#endif
-
 #endif   /* HUF_H_298734234 */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index 4a6ea9963..fd5dd0edc 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -32,13 +32,6 @@
 	- Public forum : https://groups.google.com/forum/#!forum/lz4c
 ****************************************************************** */
 
-/* **************************************************************
-*  Compiler specifics
-****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#endif
-
 
 /* **************************************************************
 *  Includes
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/huf_decompress.c
index a1e9ffc32..1e19666a7 100644
--- a/contrib/linux-kernel/lib/huf_decompress.c
+++ b/contrib/linux-kernel/lib/huf_decompress.c
@@ -35,26 +35,13 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
+#define FORCE_INLINE static __attribute__((always_inline))
 
 
 /* **************************************************************
 *  Dependencies
 ****************************************************************/
-#include <string.h>     /* memcpy, memset */
+#include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"  /* BIT_* */
 #include "fse.h"        /* header compression */
 #define HUF_STATIC_LINKING_ONLY
diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
index 75e75088b..b79fc27c8 100644
--- a/contrib/linux-kernel/lib/mem.h
+++ b/contrib/linux-kernel/lib/mem.h
@@ -10,10 +10,6 @@
 #ifndef MEM_H_MODULE
 #define MEM_H_MODULE
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 /*-****************************************
 *  Dependencies
 ******************************************/
@@ -24,19 +20,7 @@ extern "C" {
 /*-****************************************
 *  Compiler specifics
 ******************************************/
-#if defined(_MSC_VER)   /* Visual Studio */
-#   include <stdlib.h>  /* _byteswap_ulong */
-#   include <intrin.h>  /* _byteswap_* */
-#endif
-#if defined(__GNUC__)
-#  define MEM_STATIC static __inline __attribute__((unused))
-#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define MEM_STATIC static inline
-#elif defined(_MSC_VER)
-#  define MEM_STATIC static __inline
-#else
-#  define MEM_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
+#define MEM_STATIC static __inline __attribute__((unused))
 
 /* code only tested on 32 and 64 bits systems */
 #define MEM_STATIC_ASSERT(c)   { enum { MEM_static_assert = 1/(int)(!!(c)) }; }
@@ -46,55 +30,21 @@ MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (size
 /*-**************************************************************
 *  Basic Types
 *****************************************************************/
-#if  !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
-# include <stdint.h>
-  typedef   uint8_t BYTE;
-  typedef  uint16_t U16;
-  typedef   int16_t S16;
-  typedef  uint32_t U32;
-  typedef   int32_t S32;
-  typedef  uint64_t U64;
-  typedef   int64_t S64;
-  typedef  intptr_t iPtrDiff;
-  typedef uintptr_t uPtrDiff;
-#else
-  typedef unsigned char      BYTE;
-  typedef unsigned short      U16;
-  typedef   signed short      S16;
-  typedef unsigned int        U32;
-  typedef   signed int        S32;
-  typedef unsigned long long  U64;
-  typedef   signed long long  S64;
-  typedef ptrdiff_t      iPtrDiff;
-  typedef size_t         uPtrDiff;
-#endif
+#include <stdint.h>
+typedef   uint8_t BYTE;
+typedef  uint16_t U16;
+typedef   int16_t S16;
+typedef  uint32_t U32;
+typedef   int32_t S32;
+typedef  uint64_t U64;
+typedef   int64_t S64;
+typedef  intptr_t iPtrDiff;
+typedef uintptr_t uPtrDiff;
 
 
 /*-**************************************************************
 *  Memory I/O
 *****************************************************************/
-/* MEM_FORCE_MEMORY_ACCESS :
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (i.e., not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method is portable but violate C standard.
- *            It can generate buggy code on targets depending on alignment.
- *            In some circumstances, it's the only known way to get the most performance (i.e. GCC + ARMv6)
- * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define MEM_FORCE_MEMORY_ACCESS 2
-#  elif defined(__INTEL_COMPILER) /*|| defined(_MSC_VER)*/ || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
-#    define MEM_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
 MEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }
 MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
 
@@ -104,45 +54,6 @@ MEM_STATIC unsigned MEM_isLittleEndian(void)
 	return one.c[0];
 }
 
-#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
-
-/* violates C standard, by lying on structure alignment.
-Only use if no other choice to achieve best performance on target platform */
-MEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }
-MEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }
-MEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }
-MEM_STATIC U64 MEM_readST(const void* memPtr) { return *(const size_t*) memPtr; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
-MEM_STATIC void MEM_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }
-MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
-
-#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-#if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
-	__pragma( pack(push, 1) )
-	typedef union { U16 u16; U32 u32; U64 u64; size_t st; } unalign;
-	__pragma( pack(pop) )
-#else
-	typedef union { U16 u16; U32 u32; U64 u64; size_t st; } __attribute__((packed)) unalign;
-#endif
-
-MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }
-MEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
-MEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
-MEM_STATIC U64 MEM_readST(const void* ptr) { return ((const unalign*)ptr)->st; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign*)memPtr)->u16 = value; }
-MEM_STATIC void MEM_write32(void* memPtr, U32 value) { ((unalign*)memPtr)->u32 = value; }
-MEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign*)memPtr)->u64 = value; }
-
-#else
-
-/* default method, safe and standard.
-   can sometimes prove slower */
-
 MEM_STATIC U16 MEM_read16(const void* memPtr)
 {
 	U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
@@ -178,13 +89,9 @@ MEM_STATIC void MEM_write64(void* memPtr, U64 value)
 	memcpy(memPtr, &value, sizeof(value));
 }
 
-#endif /* MEM_FORCE_MEMORY_ACCESS */
-
 MEM_STATIC U32 MEM_swap32(U32 in)
 {
-#if defined(_MSC_VER)     /* Visual Studio */
-	return _byteswap_ulong(in);
-#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
+#if defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
 	return __builtin_bswap32(in);
 #else
 	return  ((in << 24) & 0xff000000 ) |
@@ -196,9 +103,7 @@ MEM_STATIC U32 MEM_swap32(U32 in)
 
 MEM_STATIC U64 MEM_swap64(U64 in)
 {
-#if defined(_MSC_VER)     /* Visual Studio */
-	return _byteswap_uint64(in);
-#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
+#if defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
 	return __builtin_bswap64(in);
 #else
 	return  ((in << 56) & 0xff00000000000000ULL) |
@@ -367,8 +272,4 @@ MEM_STATIC U32 MEM_readMINMATCH(const void* memPtr, U32 length)
 	}
 }
 
-#if defined (__cplusplus)
-}
-#endif
-
 #endif /* MEM_H_MODULE */
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 19b8bb46b..808a843ee 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -36,28 +36,6 @@
 /* *************************************
 *  Tuning parameters
 ***************************************/
-/*!XXH_FORCE_MEMORY_ACCESS :
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method doesn't depend on compiler but violate C standard.
- *            It can generate buggy code on targets which do not support unaligned memory accesses.
- *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
- * See http://stackoverflow.com/a/32095106/646947 for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef XXH_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define XXH_FORCE_MEMORY_ACCESS 2
-#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
-#    define XXH_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
 /*!XXH_ACCEPT_NULL_INPUT_POINTER :
  * If the input pointer is a null pointer, xxHash default behavior is to trigger a memory access error, since it is a bad pointer.
  * When this option is enabled, xxHash output for null input pointers will be the same as a null-length input.
@@ -73,9 +51,7 @@
  * to improve speed for Big-endian CPU.
  * This option has no impact on Little_Endian CPU.
  */
-#ifndef XXH_FORCE_NATIVE_FORMAT   /* can be defined externally */
-#  define XXH_FORCE_NATIVE_FORMAT 0
-#endif
+#define XXH_FORCE_NATIVE_FORMAT 0
 
 /*!XXH_FORCE_ALIGN_CHECK :
  * This is a minor performance trick, only useful with lots of very small keys.
@@ -83,13 +59,7 @@
  * The check costs one initial branch per hash; set to 0 when the input data
  * is guaranteed to be aligned.
  */
-#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */
-#  if defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)
-#    define XXH_FORCE_ALIGN_CHECK 0
-#  else
-#    define XXH_FORCE_ALIGN_CHECK 1
-#  endif
-#endif
+#define XXH_FORCE_ALIGN_CHECK 0
 
 
 /* *************************************
@@ -108,127 +78,40 @@ static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcp
 #  define XXH_STATIC_LINKING_ONLY
 #endif
 #include "xxhash.h"
+#include "mem.h"
 
 
 /* *************************************
 *  Compiler Specific Options
 ***************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  pragma warning(disable : 4127)      /* disable: C4127: conditional expression is constant */
-#  define FORCE_INLINE static __forceinline
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
+#define FORCE_INLINE static __attribute__((always_inline))
 
 
-/* *************************************
-*  Basic Types
-***************************************/
-#ifndef MEM_MODULE
-# define MEM_MODULE
-# if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
-#   include <stdint.h>
-	typedef uint8_t  BYTE;
-	typedef uint16_t U16;
-	typedef uint32_t U32;
-	typedef  int32_t S32;
-	typedef uint64_t U64;
-#  else
-	typedef unsigned char      BYTE;
-	typedef unsigned short     U16;
-	typedef unsigned int       U32;
-	typedef   signed int       S32;
-	typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
-#  endif
-#endif
-
-
-#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))
-
-/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */
-static U32 XXH_read32(const void* memPtr) { return *(const U32*) memPtr; }
-static U64 XXH_read64(const void* memPtr) { return *(const U64*) memPtr; }
-
-#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-typedef union { U32 u32; U64 u64; } __attribute__((packed)) unalign;
-
-static U32 XXH_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
-static U64 XXH_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
-
-#else
-
-/* portable and safe solution. Generally efficient.
- * see : http://stackoverflow.com/a/32095106/646947
- */
-
 static U32 XXH_read32(const void* memPtr)
 {
-	U32 val;
-	memcpy(&val, memPtr, sizeof(val));
-	return val;
+	return MEM_read32(memPtr);
 }
 
 static U64 XXH_read64(const void* memPtr)
 {
-	U64 val;
-	memcpy(&val, memPtr, sizeof(val));
-	return val;
+	return MEM_read64(memPtr);
 }
 
-#endif   /* XXH_FORCE_DIRECT_MEMORY_ACCESS */
-
 
 /* ****************************************
 *  Compiler-specific Functions and Macros
 ******************************************/
-#define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
+#define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
+#define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
 
-/* Note : although _rotl exists for minGW (GCC under windows), performance seems poor */
-#if defined(_MSC_VER)
-#  define XXH_rotl32(x,r) _rotl(x,r)
-#  define XXH_rotl64(x,r) _rotl64(x,r)
-#else
-#  define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
-#  define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
-#endif
-
-#if defined(_MSC_VER)     /* Visual Studio */
-#  define XXH_swap32 _byteswap_ulong
-#  define XXH_swap64 _byteswap_uint64
-#elif GCC_VERSION >= 403
-#  define XXH_swap32 __builtin_bswap32
-#  define XXH_swap64 __builtin_bswap64
-#else
 static U32 XXH_swap32 (U32 x)
 {
-	return  ((x << 24) & 0xff000000 ) |
-			((x <<  8) & 0x00ff0000 ) |
-			((x >>  8) & 0x0000ff00 ) |
-			((x >> 24) & 0x000000ff );
+	return MEM_swap32(x);
 }
 static U64 XXH_swap64 (U64 x)
 {
-	return  ((x << 56) & 0xff00000000000000ULL) |
-			((x << 40) & 0x00ff000000000000ULL) |
-			((x << 24) & 0x0000ff0000000000ULL) |
-			((x << 8)  & 0x000000ff00000000ULL) |
-			((x >> 8)  & 0x00000000ff000000ULL) |
-			((x >> 24) & 0x0000000000ff0000ULL) |
-			((x >> 40) & 0x000000000000ff00ULL) |
-			((x >> 56) & 0x00000000000000ffULL);
+	return  MEM_swap64(x);
 }
-#endif
 
 
 /* *************************************
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index 82e24d17d..17a678dd4 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -64,10 +64,6 @@ XXH64       13.8 GB/s            1.9 GB/s
 XXH32        6.8 GB/s            6.0 GB/s
 */
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 #ifndef XXHASH_H_5627135585666179
 #define XXHASH_H_5627135585666179 1
 
@@ -91,22 +87,7 @@ typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
 *   `xxhash.c` is automatically included.
 *   It's not useful to compile and link it as a separate module anymore.
 */
-#ifdef XXH_PRIVATE_API
-#  ifndef XXH_STATIC_LINKING_ONLY
-#    define XXH_STATIC_LINKING_ONLY
-#  endif
-#  if defined(__GNUC__)
-#    define XXH_PUBLIC_API static __inline __attribute__((unused))
-#  elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#    define XXH_PUBLIC_API static inline
-#  elif defined(_MSC_VER)
-#    define XXH_PUBLIC_API static __inline
-#  else
-#    define XXH_PUBLIC_API static   /* this version may generate warnings for unused static functions; disable the relevant warning */
-#  endif
-#else
-#  define XXH_PUBLIC_API   /* do nothing */
-#endif /* XXH_PRIVATE_API */
+#define XXH_PUBLIC_API   /* do nothing */
 
 /*!XXH_NAMESPACE, aka Namespace Emulation :
 
@@ -119,29 +100,6 @@ with the value of XXH_NAMESPACE (so avoid to keep it NULL and avoid numeric valu
 Note that no change is required within the calling program as long as it includes `xxhash.h` :
 regular symbol name will be automatically translated by this header.
 */
-#ifdef XXH_NAMESPACE
-#  define XXH_CAT(A,B) A##B
-#  define XXH_NAME2(A,B) XXH_CAT(A,B)
-#  define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)
-#  define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)
-#  define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)
-#  define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)
-#  define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)
-#  define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)
-#  define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)
-#  define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)
-#  define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)
-#  define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)
-#  define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)
-#  define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)
-#  define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)
-#  define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)
-#  define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)
-#  define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)
-#  define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)
-#  define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)
-#  define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)
-#endif
 
 
 /* *************************************
@@ -227,10 +185,6 @@ When done, free XXH state space if it was allocated dynamically.
 /* **************************
 *  Utils
 ****************************/
-#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L))   /* ! C99 */
-#  define restrict   /* disable restrict */
-#endif
-
 XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dst_state, const XXH32_state_t* restrict src_state);
 XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dst_state, const XXH64_state_t* restrict src_state);
 
@@ -292,14 +246,4 @@ XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src
 	   unsigned reserved[2];          /* never read nor write, will be removed in a future version */
    };   /* typedef'd to XXH64_state_t */
 
-
-#  ifdef XXH_PRIVATE_API
-#    include "xxhash.c"   /* include xxhash functions as `static`, for inlining */
-#  endif
-
 #endif /* XXH_STATIC_LINKING_ONLY && XXH_STATIC_H_3543687687345 */
-
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 0c0d34686..82386c2e8 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -11,23 +11,6 @@
 /* ***************************************************************
 *  Tuning parameters
 *****************************************************************/
-/*!
- * HEAPMODE :
- * Select how default decompression function ZSTD_decompress() will allocate memory,
- * in memory stack (0), or in memory heap (1, requires malloc())
- */
-#ifndef ZSTD_HEAPMODE
-#  define ZSTD_HEAPMODE 1
-#endif
-
-/*!
-*  LEGACY_SUPPORT :
-*  if set to 1, ZSTD_decompress() can decode older formats (v0.1+)
-*/
-#ifndef ZSTD_LEGACY_SUPPORT
-#  define ZSTD_LEGACY_SUPPORT 0
-#endif
-
 /*!
 *  MAXWINDOWSIZE_DEFAULT :
 *  maximum window size accepted by DStream, by default.
@@ -49,19 +32,7 @@
 #include "huf.h"
 #include "zstd_internal.h"
 
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-#  include "zstd_legacy.h"
-#endif
-
-
-#if defined(_MSC_VER)
-#  include <mmintrin.h>   /* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */
-#  define ZSTD_PREFETCH(ptr)   _mm_prefetch((const char*)ptr, _MM_HINT_T0)
-#elif defined(__GNUC__)
-#  define ZSTD_PREFETCH(ptr)   __builtin_prefetch(ptr, 0, 0)
-#else
-#  define ZSTD_PREFETCH(ptr)   /* disabled */
-#endif
+#define ZSTD_PREFETCH(ptr)   __builtin_prefetch(ptr, 0, 0)
 
 /*-*************************************
 *  Macros
@@ -220,9 +191,6 @@ unsigned ZSTD_isFrame(const void* buffer, size_t size)
 		if (magic == ZSTD_MAGICNUMBER) return 1;
 		if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
 	}
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-	if (ZSTD_isLegacy(buffer, size)) return 1;
-#endif
 	return 0;
 }
 
@@ -320,12 +288,6 @@ size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t
 *             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
 unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
 {
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-	if (ZSTD_isLegacy(src, srcSize)) {
-		unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
-		return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
-	}
-#endif
 	{
 		ZSTD_frameParams fParams;
 		if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0) return ZSTD_CONTENTSIZE_ERROR;
@@ -1472,9 +1434,6 @@ size_t ZSTD_generateNxBytes(void* dst, size_t dstCapacity, BYTE byte, size_t len
  *  @return : the compressed size of the frame starting at `src` */
 size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
 {
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-	if (ZSTD_isLegacy(src, srcSize)) return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
-#endif
 	if (srcSize >= ZSTD_skippableHeaderSize &&
 			(MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
 		return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + 4);
@@ -1618,24 +1577,6 @@ static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
 	while (srcSize >= ZSTD_frameHeaderSize_prefix) {
 		U32 magicNumber;
 
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-		if (ZSTD_isLegacy(src, srcSize)) {
-			size_t decodedSize;
-			size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
-			if (ZSTD_isError(frameSize)) return frameSize;
-
-			decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
-
-			dst = (BYTE*)dst + decodedSize;
-			dstCapacity -= decodedSize;
-
-			src = (const BYTE*)src + frameSize;
-			srcSize -= frameSize;
-
-			continue;
-		}
-#endif
-
 		magicNumber = MEM_readLE32(src);
 		if (magicNumber != ZSTD_MAGICNUMBER) {
 			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
@@ -1698,17 +1639,8 @@ size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const
 
 size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
 {
-#if defined(ZSTD_HEAPMODE) && (ZSTD_HEAPMODE==1)
-	size_t regenSize;
-	ZSTD_DCtx* const dctx = ZSTD_createDCtx();
-	if (dctx==NULL) return ERROR(memory_allocation);
-	regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
-	ZSTD_freeDCtx(dctx);
-	return regenSize;
-#else   /* stack mode */
 	ZSTD_DCtx dctx;
 	return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
-#endif
 }
 
 
@@ -2216,10 +2148,6 @@ size_t ZSTD_freeDStream(ZSTD_DStream* zds)
 		zds->inBuff = NULL;
 		ZSTD_free(zds->outBuff, cMem);
 		zds->outBuff = NULL;
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-		if (zds->legacyContext)
-			ZSTD_freeLegacyStreamContext(zds->legacyContext, zds->previousLegacyVersion);
-#endif
 		ZSTD_free(zds, cMem);
 		return 0;
 	}
@@ -2306,11 +2234,6 @@ size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inB
 	char* op = ostart;
 	U32 someMoreWork = 1;
 
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-	if (zds->legacyVersion)
-		return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
-#endif
-
 	while (someMoreWork) {
 		switch(zds->stage)
 		{
@@ -2321,21 +2244,7 @@ size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inB
 		case zdss_loadHeader :
 			{   size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
 				if (ZSTD_isError(hSize))
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-				{   U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
-					if (legacyVersion) {
-						const void* const dict = zds->ddict ? zds->ddict->dictContent : NULL;
-						size_t const dictSize = zds->ddict ? zds->ddict->dictSize : 0;
-						CHECK_F(ZSTD_initLegacyStream(&zds->legacyContext, zds->previousLegacyVersion, legacyVersion,
-													   dict, dictSize));
-						zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
-						return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
-					} else {
-						return hSize; /* error */
-				}   }
-#else
 				return hSize;
-#endif
 				if (hSize != 0) {   /* need more input */
 					size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
 					if (toLoad > (size_t)(iend-ip)) {   /* not enough input to load full header */
diff --git a/contrib/linux-kernel/lib/zstd_errors.h b/contrib/linux-kernel/lib/zstd_errors.h
index 1cf0b0adb..8285df8e5 100644
--- a/contrib/linux-kernel/lib/zstd_errors.h
+++ b/contrib/linux-kernel/lib/zstd_errors.h
@@ -10,27 +10,12 @@
 #ifndef ZSTD_ERRORS_H_398273423
 #define ZSTD_ERRORS_H_398273423
 
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
 /*===== dependency =====*/
 #include <stddef.h>   /* size_t */
 
 
 /* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */
-#if defined(__GNUC__) && (__GNUC__ >= 4)
-#  define ZSTDERRORLIB_VISIBILITY __attribute__ ((visibility ("default")))
-#else
-#  define ZSTDERRORLIB_VISIBILITY
-#endif
-#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
-#  define ZSTDERRORLIB_API __declspec(dllexport) ZSTDERRORLIB_VISIBILITY
-#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
-#  define ZSTDERRORLIB_API __declspec(dllimport) ZSTDERRORLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define ZSTDERRORLIB_API ZSTDERRORLIB_VISIBILITY
-#endif
+#define ZSTDERRORLIB_API
 
 /*-****************************************
 *  error codes list
@@ -67,9 +52,4 @@ typedef enum {
 ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
 ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);
 
-
-#if defined (__cplusplus)
-}
-#endif
-
 #endif /* ZSTD_ERRORS_H_398273423 */
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index 8b2c27f53..16a502a69 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -13,33 +13,8 @@
 /*-*******************************************************
 *  Compiler specifics
 *********************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  include <intrin.h>                    /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
-#  pragma warning(disable : 4100)        /* disable: C4100: unreferenced formal parameter */
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
-
-#ifdef _MSC_VER
-#  define FORCE_NOINLINE static __declspec(noinline)
-#else
-#  ifdef __GNUC__
-#    define FORCE_NOINLINE static __attribute__((__noinline__))
-#  else
-#    define FORCE_NOINLINE static
-#  endif
-#endif
+#define FORCE_INLINE static __attribute__((always_inline))
+#define FORCE_NOINLINE static __attribute__((__noinline__))
 
 
 /*-*************************************

From be7da5d98b88f52eea93b4cfd41569ad9e9de247 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Thu, 30 Mar 2017 11:40:05 -0700
Subject: [PATCH 084/255] Change stdlib includes to linux includes

---
 contrib/linux-kernel/include/zstd.h        | 2 +-
 contrib/linux-kernel/lib/error_private.h   | 2 +-
 contrib/linux-kernel/lib/fse.h             | 2 +-
 contrib/linux-kernel/lib/fse_compress.c    | 4 +---
 contrib/linux-kernel/lib/fse_decompress.c  | 3 +--
 contrib/linux-kernel/lib/huf.h             | 2 +-
 contrib/linux-kernel/lib/huf_compress.c    | 3 +--
 contrib/linux-kernel/lib/mem.h             | 5 ++---
 contrib/linux-kernel/lib/xxhash.c          | 3 +--
 contrib/linux-kernel/lib/xxhash.h          | 2 +-
 contrib/linux-kernel/lib/zstd_common.c     | 1 -
 contrib/linux-kernel/lib/zstd_compress.c   | 2 +-
 contrib/linux-kernel/lib/zstd_decompress.c | 2 +-
 contrib/linux-kernel/lib/zstd_errors.h     | 2 +-
 14 files changed, 14 insertions(+), 21 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index ff7f86a6d..8e1f805d0 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -11,7 +11,7 @@
 #define ZSTD_H_235446
 
 /* ======   Dependency   ======*/
-#include <stddef.h>   /* size_t */
+#include <linux/types.h>   /* size_t */
 
 
 /* =====   ZSTDLIB_API : control library symbols visibility   ===== */
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index e88f2fd17..7b2ce36d4 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -15,7 +15,7 @@
 /* ****************************************
 *  Dependencies
 ******************************************/
-#include <stddef.h>        /* size_t */
+#include <linux/types.h>        /* size_t */
 #include "zstd_errors.h"  /* enum list */
 
 
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index 538d52427..b833f6c2c 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -38,7 +38,7 @@
 /*-*****************************************
 *  Dependencies
 ******************************************/
-#include <stddef.h>    /* size_t, ptrdiff_t */
+#include <linux/types.h>    /* size_t, ptrdiff_t */
 
 
 /*-*****************************************
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index dbfa510c6..29071c483 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -41,9 +41,7 @@
 /* **************************************************************
 *  Includes
 ****************************************************************/
-#include <stdlib.h>     /* malloc, free, qsort */
-#include <string.h>     /* memcpy, memset */
-#include <stdio.h>      /* printf (debug) */
+#include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
 #define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
index e53d99fb4..958a068bc 100644
--- a/contrib/linux-kernel/lib/fse_decompress.c
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -42,8 +42,7 @@
 /* **************************************************************
 *  Includes
 ****************************************************************/
-#include <stdlib.h>     /* malloc, free, qsort */
-#include <string.h>     /* memcpy, memset */
+#include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
 #define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index f22a7d4f1..63306b4bf 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -36,7 +36,7 @@
 
 
 /* *** Dependencies *** */
-#include <stddef.h>    /* size_t */
+#include <linux/types.h>    /* size_t */
 
 
 /* *** simple functions *** */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index fd5dd0edc..af1a1e6c3 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -36,8 +36,7 @@
 /* **************************************************************
 *  Includes
 ****************************************************************/
-#include <string.h>     /* memcpy, memset */
-#include <stdio.h>      /* printf (debug) */
+#include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
 #define FSE_STATIC_LINKING_ONLY   /* FSE_optimalTableLog_internal */
 #include "fse.h"        /* header compression */
diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
index b79fc27c8..1b8098e72 100644
--- a/contrib/linux-kernel/lib/mem.h
+++ b/contrib/linux-kernel/lib/mem.h
@@ -13,8 +13,8 @@
 /*-****************************************
 *  Dependencies
 ******************************************/
-#include <stddef.h>     /* size_t, ptrdiff_t */
-#include <string.h>     /* memcpy */
+#include <linux/types.h>     /* size_t, ptrdiff_t */
+#include <linux/string.h>     /* memcpy */
 
 
 /*-****************************************
@@ -30,7 +30,6 @@ MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (size
 /*-**************************************************************
 *  Basic Types
 *****************************************************************/
-#include <stdint.h>
 typedef   uint8_t BYTE;
 typedef  uint16_t U16;
 typedef   int16_t S16;
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 808a843ee..dccdc65c9 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -67,11 +67,10 @@
 ***************************************/
 /* Modify the local functions below should you wish to use some other memory routines */
 /* for malloc(), free() */
-#include <stdlib.h>
 static void* XXH_malloc(size_t s) { return malloc(s); }
 static void  XXH_free  (void* p)  { free(p); }
 /* for memcpy() */
-#include <string.h>
+#include <linux/string.h>
 static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
 
 #ifndef XXH_STATIC_LINKING_ONLY
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index 17a678dd4..b6a56707e 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -71,7 +71,7 @@ XXH32        6.8 GB/s            6.0 GB/s
 /* ****************************
 *  Definitions
 ******************************/
-#include <stddef.h>   /* size_t */
+#include <linux/types.h>   /* size_t */
 typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
 
 
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index 69199cb6f..3d24742ee 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -12,7 +12,6 @@
 /*-*************************************
 *  Dependencies
 ***************************************/
-#include <stdlib.h>         /* malloc */
 #include "error_private.h"
 #define ZSTD_STATIC_LINKING_ONLY
 #include "zstd.h"           /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index 84d898e57..d4b9a4751 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -11,7 +11,7 @@
 /*-*************************************
 *  Dependencies
 ***************************************/
-#include <string.h>         /* memset */
+#include <linux/string.h>         /* memset */
 #include "mem.h"
 #define FSE_STATIC_LINKING_ONLY   /* FSE_encodeSymbol */
 #include "fse.h"
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 82386c2e8..bb72d6a4a 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -24,7 +24,7 @@
 /*-*******************************************************
 *  Dependencies
 *********************************************************/
-#include <string.h>      /* memcpy, memmove, memset */
+#include <linux/string.h>      /* memcpy, memmove, memset */
 #include "mem.h"         /* low level memory routines */
 #define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
diff --git a/contrib/linux-kernel/lib/zstd_errors.h b/contrib/linux-kernel/lib/zstd_errors.h
index 8285df8e5..37e491b7e 100644
--- a/contrib/linux-kernel/lib/zstd_errors.h
+++ b/contrib/linux-kernel/lib/zstd_errors.h
@@ -11,7 +11,7 @@
 #define ZSTD_ERRORS_H_398273423
 
 /*===== dependency =====*/
-#include <stddef.h>   /* size_t */
+#include <linux/types.h>   /* size_t */
 
 
 /* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */

From 6ce58897dabc45b1118c7db85883dfa736b6a8ce Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Thu, 30 Mar 2017 12:11:19 -0700
Subject: [PATCH 085/255] Use <asm/unaligned.h> for unaligned memory access

---
 contrib/linux-kernel/lib/mem.h    | 115 +++++++-----------------------
 contrib/linux-kernel/lib/xxhash.c |  35 +++------
 2 files changed, 33 insertions(+), 117 deletions(-)

diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
index 1b8098e72..6040aa5c7 100644
--- a/contrib/linux-kernel/lib/mem.h
+++ b/contrib/linux-kernel/lib/mem.h
@@ -13,6 +13,7 @@
 /*-****************************************
 *  Dependencies
 ******************************************/
+#include <asm/unaligned.h>
 #include <linux/types.h>     /* size_t, ptrdiff_t */
 #include <linux/string.h>     /* memcpy */
 
@@ -47,104 +48,62 @@ typedef uintptr_t uPtrDiff;
 MEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }
 MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
 
+#if defined(__LITTLE_ENDIAN)
+#   define MEM_LITTLE_ENDIAN 1
+#else
+#   define MEM_LITTLE_ENDIAN 0
+#endif
+
 MEM_STATIC unsigned MEM_isLittleEndian(void)
 {
-	const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
-	return one.c[0];
+	return MEM_LITTLE_ENDIAN;
 }
 
 MEM_STATIC U16 MEM_read16(const void* memPtr)
 {
-	U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	return get_unaligned((const U16*)memPtr);
 }
 
 MEM_STATIC U32 MEM_read32(const void* memPtr)
 {
-	U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	return get_unaligned((const U32*)memPtr);
 }
 
 MEM_STATIC U64 MEM_read64(const void* memPtr)
 {
-	U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
+	return get_unaligned((const U64*)memPtr);
 }
 
 MEM_STATIC size_t MEM_readST(const void* memPtr)
 {
-	size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
+	return get_unaligned((const size_t*)memPtr);
 }
 
 MEM_STATIC void MEM_write16(void* memPtr, U16 value)
 {
-	memcpy(memPtr, &value, sizeof(value));
+	put_unaligned(value, (U16*)memPtr);
 }
 
 MEM_STATIC void MEM_write32(void* memPtr, U32 value)
 {
-	memcpy(memPtr, &value, sizeof(value));
+	put_unaligned(value, (U32*)memPtr);
 }
 
 MEM_STATIC void MEM_write64(void* memPtr, U64 value)
 {
-	memcpy(memPtr, &value, sizeof(value));
-}
-
-MEM_STATIC U32 MEM_swap32(U32 in)
-{
-#if defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-	return __builtin_bswap32(in);
-#else
-	return  ((in << 24) & 0xff000000 ) |
-			((in <<  8) & 0x00ff0000 ) |
-			((in >>  8) & 0x0000ff00 ) |
-			((in >> 24) & 0x000000ff );
-#endif
-}
-
-MEM_STATIC U64 MEM_swap64(U64 in)
-{
-#if defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-	return __builtin_bswap64(in);
-#else
-	return  ((in << 56) & 0xff00000000000000ULL) |
-			((in << 40) & 0x00ff000000000000ULL) |
-			((in << 24) & 0x0000ff0000000000ULL) |
-			((in << 8)  & 0x000000ff00000000ULL) |
-			((in >> 8)  & 0x00000000ff000000ULL) |
-			((in >> 24) & 0x0000000000ff0000ULL) |
-			((in >> 40) & 0x000000000000ff00ULL) |
-			((in >> 56) & 0x00000000000000ffULL);
-#endif
-}
-
-MEM_STATIC size_t MEM_swapST(size_t in)
-{
-	if (MEM_32bits())
-		return (size_t)MEM_swap32((U32)in);
-	else
-		return (size_t)MEM_swap64((U64)in);
+	put_unaligned(value, (U64*)memPtr);
 }
 
 /*=== Little endian r/w ===*/
 
 MEM_STATIC U16 MEM_readLE16(const void* memPtr)
 {
-	if (MEM_isLittleEndian())
-		return MEM_read16(memPtr);
-	else {
-		const BYTE* p = (const BYTE*)memPtr;
-		return (U16)(p[0] + (p[1]<<8));
-	}
+	return get_unaligned_le16(memPtr);
 }
 
 MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
 {
-	if (MEM_isLittleEndian()) {
-		MEM_write16(memPtr, val);
-	} else {
-		BYTE* p = (BYTE*)memPtr;
-		p[0] = (BYTE)val;
-		p[1] = (BYTE)(val>>8);
-	}
+	put_unaligned_le16(val, memPtr);
 }
 
 MEM_STATIC U32 MEM_readLE24(const void* memPtr)
@@ -160,34 +119,22 @@ MEM_STATIC void MEM_writeLE24(void* memPtr, U32 val)
 
 MEM_STATIC U32 MEM_readLE32(const void* memPtr)
 {
-	if (MEM_isLittleEndian())
-		return MEM_read32(memPtr);
-	else
-		return MEM_swap32(MEM_read32(memPtr));
+	return get_unaligned_le32(memPtr);
 }
 
 MEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)
 {
-	if (MEM_isLittleEndian())
-		MEM_write32(memPtr, val32);
-	else
-		MEM_write32(memPtr, MEM_swap32(val32));
+	put_unaligned_le32(val32, memPtr);
 }
 
 MEM_STATIC U64 MEM_readLE64(const void* memPtr)
 {
-	if (MEM_isLittleEndian())
-		return MEM_read64(memPtr);
-	else
-		return MEM_swap64(MEM_read64(memPtr));
+	return get_unaligned_le64(memPtr);
 }
 
 MEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)
 {
-	if (MEM_isLittleEndian())
-		MEM_write64(memPtr, val64);
-	else
-		MEM_write64(memPtr, MEM_swap64(val64));
+	put_unaligned_le64(val64, memPtr);
 }
 
 MEM_STATIC size_t MEM_readLEST(const void* memPtr)
@@ -210,34 +157,22 @@ MEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)
 
 MEM_STATIC U32 MEM_readBE32(const void* memPtr)
 {
-	if (MEM_isLittleEndian())
-		return MEM_swap32(MEM_read32(memPtr));
-	else
-		return MEM_read32(memPtr);
+	return get_unaligned_be32(memPtr);
 }
 
 MEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)
 {
-	if (MEM_isLittleEndian())
-		MEM_write32(memPtr, MEM_swap32(val32));
-	else
-		MEM_write32(memPtr, val32);
+	put_unaligned_be32(val32, memPtr);
 }
 
 MEM_STATIC U64 MEM_readBE64(const void* memPtr)
 {
-	if (MEM_isLittleEndian())
-		return MEM_swap64(MEM_read64(memPtr));
-	else
-		return MEM_read64(memPtr);
+	return get_unaligned_be64(memPtr);
 }
 
 MEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)
 {
-	if (MEM_isLittleEndian())
-		MEM_write64(memPtr, MEM_swap64(val64));
-	else
-		MEM_write64(memPtr, val64);
+	put_unaligned_be64(val64, memPtr);
 }
 
 MEM_STATIC size_t MEM_readBEST(const void* memPtr)
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index dccdc65c9..1918836d7 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -103,16 +103,6 @@ static U64 XXH_read64(const void* memPtr)
 #define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
 #define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
 
-static U32 XXH_swap32 (U32 x)
-{
-	return MEM_swap32(x);
-}
-static U64 XXH_swap64 (U64 x)
-{
-	return  MEM_swap64(x);
-}
-
-
 /* *************************************
 *  Architecture Macros
 ***************************************/
@@ -120,8 +110,7 @@ typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
 
 /* XXH_CPU_LITTLE_ENDIAN can be defined externally, for example on the compiler command line */
 #ifndef XXH_CPU_LITTLE_ENDIAN
-	static const int g_one = 1;
-#   define XXH_CPU_LITTLE_ENDIAN   (*(const char*)(&g_one))
+#   define XXH_CPU_LITTLE_ENDIAN   MEM_LITTLE_ENDIAN
 #endif
 
 
@@ -130,12 +119,9 @@ typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
 *****************************/
 typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
 
-FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
+FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess, XXH_alignment)
 {
-	if (align==XXH_unaligned)
-		return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
-	else
-		return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
+	return MEM_readLE32(ptr);
 }
 
 FORCE_INLINE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
@@ -145,15 +131,12 @@ FORCE_INLINE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
 
 static U32 XXH_readBE32(const void* ptr)
 {
-	return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
+	return MEM_readBE32(ptr);
 }
 
 FORCE_INLINE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
 {
-	if (align==XXH_unaligned)
-		return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
-	else
-		return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
+	return MEM_readLE64(ptr);
 }
 
 FORCE_INLINE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
@@ -163,7 +146,7 @@ FORCE_INLINE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
 
 static U64 XXH_readBE64(const void* ptr)
 {
-	return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
+	return MEM_readBE64(ptr);
 }
 
 
@@ -729,15 +712,13 @@ XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
 {
 	XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
-	if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
-	memcpy(dst, &hash, sizeof(*dst));
+	MEM_writeBE32(dst, hash);
 }
 
 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
 {
 	XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
-	if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
-	memcpy(dst, &hash, sizeof(*dst));
+	MEM_writeBE64(dst, hash);
 }
 
 XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)

From e48b1355213d6242d89487e69e6aba832a044c98 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Thu, 30 Mar 2017 14:33:59 -0700
Subject: [PATCH 086/255] Remove STATIC_LINKING_ONLY defines

---
 contrib/linux-kernel/include/zstd.h        |  7 +--
 contrib/linux-kernel/lib/entropy_common.c  |  2 -
 contrib/linux-kernel/lib/fse.h             |  5 ---
 contrib/linux-kernel/lib/fse_compress.c    |  1 -
 contrib/linux-kernel/lib/fse_decompress.c  |  1 -
 contrib/linux-kernel/lib/huf.h             |  4 --
 contrib/linux-kernel/lib/huf_compress.c    |  2 -
 contrib/linux-kernel/lib/huf_decompress.c  |  1 -
 contrib/linux-kernel/lib/xxhash.c          |  3 --
 contrib/linux-kernel/lib/xxhash.h          | 50 ++++++++++------------
 contrib/linux-kernel/lib/zstd_common.c     |  1 -
 contrib/linux-kernel/lib/zstd_compress.c   |  2 -
 contrib/linux-kernel/lib/zstd_decompress.c |  2 -
 contrib/linux-kernel/lib/zstd_internal.h   |  4 --
 14 files changed, 23 insertions(+), 62 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index 8e1f805d0..8b1afa4ba 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -315,11 +315,6 @@ ZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* outp
 ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
 ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
 
-#endif  /* ZSTD_H_235446 */
-
-
-#if defined(ZSTD_STATIC_LINKING_ONLY) && !defined(ZSTD_H_ZSTD_STATIC_LINKING_ONLY)
-#define ZSTD_H_ZSTD_STATIC_LINKING_ONLY
 
 /****************************************************************************************
  * START OF ADVANCED AND EXPERIMENTAL FUNCTIONS
@@ -753,4 +748,4 @@ ZSTDLIB_API size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCa
 ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize);  /**< insert block into `dctx` history. Useful for uncompressed blocks */
 
 
-#endif   /* ZSTD_H_ZSTD_STATIC_LINKING_ONLY */
+#endif  /* ZSTD_H_235446 */
diff --git a/contrib/linux-kernel/lib/entropy_common.c b/contrib/linux-kernel/lib/entropy_common.c
index c9d489bc7..f6a43662d 100644
--- a/contrib/linux-kernel/lib/entropy_common.c
+++ b/contrib/linux-kernel/lib/entropy_common.c
@@ -37,9 +37,7 @@
 ***************************************/
 #include "mem.h"
 #include "error_private.h"       /* ERR_*, ERROR */
-#define FSE_STATIC_LINKING_ONLY  /* FSE_MIN_TABLELOG */
 #include "fse.h"
-#define HUF_STATIC_LINKING_ONLY  /* HUF_TABLELOG_ABSOLUTEMAX */
 #include "huf.h"
 
 
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index b833f6c2c..a5c3980a7 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -286,8 +286,6 @@ If there is an error, the function will return an error code, which can be teste
 */
 
 
-#ifdef FSE_STATIC_LINKING_ONLY
-
 /* *** Dependency *** */
 #include "bitstream.h"
 
@@ -672,7 +670,4 @@ MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
 #define FSE_TABLESTEP(tableSize) ((tableSize>>1) + (tableSize>>3) + 3)
 
 
-#endif /* FSE_STATIC_LINKING_ONLY */
-
-
 #endif  /* FSE_H */
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index 29071c483..8b85b85f1 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -43,7 +43,6 @@
 ****************************************************************/
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
-#define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
 
 
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
index 958a068bc..ebc228daf 100644
--- a/contrib/linux-kernel/lib/fse_decompress.c
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -44,7 +44,6 @@
 ****************************************************************/
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
-#define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
 
 
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index 63306b4bf..fd26fcf27 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -91,8 +91,6 @@ size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t s
 
 
 
-#ifdef HUF_STATIC_LINKING_ONLY
-
 /* *** Dependencies *** */
 #include "mem.h"   /* U32 */
 
@@ -246,6 +244,4 @@ size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize, const void* cS
 size_t HUF_decompress1X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
 size_t HUF_decompress1X4_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
 
-#endif /* HUF_STATIC_LINKING_ONLY */
-
 #endif   /* HUF_H_298734234 */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index af1a1e6c3..16576f579 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -38,9 +38,7 @@
 ****************************************************************/
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
-#define FSE_STATIC_LINKING_ONLY   /* FSE_optimalTableLog_internal */
 #include "fse.h"        /* header compression */
-#define HUF_STATIC_LINKING_ONLY
 #include "huf.h"
 
 
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/huf_decompress.c
index 1e19666a7..4ac28bec9 100644
--- a/contrib/linux-kernel/lib/huf_decompress.c
+++ b/contrib/linux-kernel/lib/huf_decompress.c
@@ -44,7 +44,6 @@
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"  /* BIT_* */
 #include "fse.h"        /* header compression */
-#define HUF_STATIC_LINKING_ONLY
 #include "huf.h"
 
 
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 1918836d7..44392265d 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -73,9 +73,6 @@ static void  XXH_free  (void* p)  { free(p); }
 #include <linux/string.h>
 static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
 
-#ifndef XXH_STATIC_LINKING_ONLY
-#  define XXH_STATIC_LINKING_ONLY
-#endif
 #include "xxhash.h"
 #include "mem.h"
 
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index b6a56707e..6c4c79c42 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -206,9 +206,6 @@ XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t
 XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);
 XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);
 
-#endif /* XXHASH_H_5627135585666179 */
-
-
 
 /* ================================================================================================
    This section contains definitions which are not guaranteed to remain stable.
@@ -216,34 +213,31 @@ XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src
    They shall only be used with static linking.
    Never use these definitions in association with dynamic linking !
 =================================================================================================== */
-#if defined(XXH_STATIC_LINKING_ONLY) && !defined(XXH_STATIC_H_3543687687345)
-#define XXH_STATIC_H_3543687687345
-
 /* These definitions are only meant to allow allocation of XXH state
    statically, on stack, or in a struct for example.
    Do not use members directly. */
 
-   struct XXH32_state_s {
-	   unsigned total_len_32;
-	   unsigned large_len;
-	   unsigned v1;
-	   unsigned v2;
-	   unsigned v3;
-	   unsigned v4;
-	   unsigned mem32[4];   /* buffer defined as U32 for alignment */
-	   unsigned memsize;
-	   unsigned reserved;   /* never read nor write, will be removed in a future version */
-   };   /* typedef'd to XXH32_state_t */
+struct XXH32_state_s {
+	unsigned total_len_32;
+	unsigned large_len;
+	unsigned v1;
+	unsigned v2;
+	unsigned v3;
+	unsigned v4;
+	unsigned mem32[4];   /* buffer defined as U32 for alignment */
+	unsigned memsize;
+	unsigned reserved;   /* never read nor write, will be removed in a future version */
+};   /* typedef'd to XXH32_state_t */
 
-   struct XXH64_state_s {
-	   unsigned long long total_len;
-	   unsigned long long v1;
-	   unsigned long long v2;
-	   unsigned long long v3;
-	   unsigned long long v4;
-	   unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
-	   unsigned memsize;
-	   unsigned reserved[2];          /* never read nor write, will be removed in a future version */
-   };   /* typedef'd to XXH64_state_t */
+struct XXH64_state_s {
+	unsigned long long total_len;
+	unsigned long long v1;
+	unsigned long long v2;
+	unsigned long long v3;
+	unsigned long long v4;
+	unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
+	unsigned memsize;
+	unsigned reserved[2];          /* never read nor write, will be removed in a future version */
+};   /* typedef'd to XXH64_state_t */
 
-#endif /* XXH_STATIC_LINKING_ONLY && XXH_STATIC_H_3543687687345 */
+#endif /* XXHASH_H_5627135585666179 */
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index 3d24742ee..0788b6ef6 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -13,7 +13,6 @@
 *  Dependencies
 ***************************************/
 #include "error_private.h"
-#define ZSTD_STATIC_LINKING_ONLY
 #include "zstd.h"           /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
 
 
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index d4b9a4751..79b7699b8 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -13,9 +13,7 @@
 ***************************************/
 #include <linux/string.h>         /* memset */
 #include "mem.h"
-#define FSE_STATIC_LINKING_ONLY   /* FSE_encodeSymbol */
 #include "fse.h"
-#define HUF_STATIC_LINKING_ONLY
 #include "huf.h"
 #include "zstd_internal.h"  /* includes zstd.h */
 
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index bb72d6a4a..10700257b 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -26,9 +26,7 @@
 *********************************************************/
 #include <linux/string.h>      /* memcpy, memmove, memset */
 #include "mem.h"         /* low level memory routines */
-#define FSE_STATIC_LINKING_ONLY
 #include "fse.h"
-#define HUF_STATIC_LINKING_ONLY
 #include "huf.h"
 #include "zstd_internal.h"
 
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index 16a502a69..57ae77390 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -22,11 +22,7 @@
 ***************************************/
 #include "mem.h"
 #include "error_private.h"
-#define ZSTD_STATIC_LINKING_ONLY
 #include "zstd.h"
-#ifndef XXH_STATIC_LINKING_ONLY
-#  define XXH_STATIC_LINKING_ONLY   /* XXH64_state_t */
-#endif
 #include "xxhash.h"               /* XXH_reset, update, digest */
 
 

From 458e955c2341f6dd30df626ae2ff2c372d261f9f Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 15:51:58 -0700
Subject: [PATCH 087/255] improved ZSTDMT_compress()

Use a bit more threads by default.
Uses overlap segments to boost compression ratio (like the streaming variant)
---
 lib/compress/zstdmt_compress.c | 13 +++++++++----
 1 file changed, 9 insertions(+), 4 deletions(-)

diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 90f79509b..f9d722b11 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -228,7 +228,8 @@ void ZSTDMT_compressChunk(void* jobDescription)
     ZSTDMT_jobDescription* const job = (ZSTDMT_jobDescription*)jobDescription;
     const void* const src = (const char*)job->srcStart + job->dictSize;
     buffer_t const dstBuff = job->dstBuff;
-    DEBUGLOG(3, "job (first:%u) (last:%u) : dictSize %u, srcSize %u", job->firstChunk, job->lastChunk, (U32)job->dictSize, (U32)job->srcSize);
+    DEBUGLOG(3, "job (first:%u) (last:%u) : dictSize %u, srcSize %u",
+                 job->firstChunk, job->lastChunk, (U32)job->dictSize, (U32)job->srcSize);
     if (job->cdict) {  /* should only happen for first segment */
         size_t const initError = ZSTD_compressBegin_usingCDict(job->cctx, job->cdict, job->fullFrameSize);
         if (job->cdict) DEBUGLOG(3, "using CDict ");
@@ -250,7 +251,8 @@ void ZSTDMT_compressChunk(void* jobDescription)
     job->cSize = (job->lastChunk) ?
                  ZSTD_compressEnd     (job->cctx, dstBuff.start, dstBuff.size, src, job->srcSize) :
                  ZSTD_compressContinue(job->cctx, dstBuff.start, dstBuff.size, src, job->srcSize);
-    DEBUGLOG(3, "compressed %u bytes into %u bytes   (first:%u) (last:%u)", (unsigned)job->srcSize, (unsigned)job->cSize, job->firstChunk, job->lastChunk);
+    DEBUGLOG(3, "compressed %u bytes into %u bytes   (first:%u) (last:%u)",
+                (unsigned)job->srcSize, (unsigned)job->cSize, job->firstChunk, job->lastChunk);
 
 _endJob:
     PTHREAD_MUTEX_LOCK(job->jobCompleted_mutex);
@@ -388,8 +390,9 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
                            int compressionLevel)
 {
     ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, 0);
+    size_t const overlapSize = (size_t)1 << (params.cParams.windowLog - 3);
     size_t const chunkTargetSize = (size_t)1 << (params.cParams.windowLog + 2);
-    unsigned const nbChunksMax = (unsigned)(srcSize / chunkTargetSize) + (srcSize < chunkTargetSize) /* min 1 */;
+    unsigned const nbChunksMax = (unsigned)(srcSize / chunkTargetSize) + 1;
     unsigned nbChunks = MIN(nbChunksMax, mtctx->nbThreads);
     size_t const proposedChunkSize = (srcSize + (nbChunks-1)) / nbChunks;
     size_t const avgChunkSize = ((proposedChunkSize & 0x1FFFF) < 0xFFFF) ? proposedChunkSize + 0xFFFF : proposedChunkSize;   /* avoid too small last block */
@@ -413,6 +416,7 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
             buffer_t const dstAsBuffer = { dst, dstCapacity };
             buffer_t const dstBuffer = u ? ZSTDMT_getBuffer(mtctx->buffPool, dstBufferCapacity) : dstAsBuffer;
             ZSTD_CCtx* const cctx = ZSTDMT_getCCtx(mtctx->cctxPool);
+            size_t dictSize = u ? overlapSize : 0;
 
             if ((cctx==NULL) || (dstBuffer.start==NULL)) {
                 mtctx->jobs[u].cSize = ERROR(memory_allocation);   /* job result */
@@ -421,7 +425,8 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
                 break;   /* let's wait for previous jobs to complete, but don't start new ones */
             }
 
-            mtctx->jobs[u].srcStart = srcStart + frameStartPos;
+            mtctx->jobs[u].srcStart = srcStart + frameStartPos - dictSize;
+            mtctx->jobs[u].dictSize = dictSize;
             mtctx->jobs[u].srcSize = chunkSize;
             mtctx->jobs[u].fullFrameSize = srcSize;
             mtctx->jobs[u].params = params;

From 34cc487d05513fe4981c2b8832cfdd7c9f455041 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 16:23:22 -0700
Subject: [PATCH 088/255] overlap at full windowSize for max compression level

as it provides max compression ratio
---
 lib/compress/zstdmt_compress.c | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index f9d722b11..009d04a1f 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -390,7 +390,8 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
                            int compressionLevel)
 {
     ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, 0);
-    size_t const overlapSize = (size_t)1 << (params.cParams.windowLog - 3);
+    U32 const overlapLog = (compressionLevel >= ZSTD_maxCLevel()) ? 0 : 3;
+    size_t const overlapSize = (size_t)1 << (params.cParams.windowLog - overlapLog);
     size_t const chunkTargetSize = (size_t)1 << (params.cParams.windowLog + 2);
     unsigned const nbChunksMax = (unsigned)(srcSize / chunkTargetSize) + 1;
     unsigned nbChunks = MIN(nbChunksMax, mtctx->nbThreads);

From eea7858e2b17ae2ffa71d2d2e1e708b72d7323c6 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 30 Mar 2017 16:47:19 -0700
Subject: [PATCH 089/255] fixed minor warnings in debug code

---
 lib/compress/zstdmt_compress.c | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 009d04a1f..09a965478 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -44,26 +44,26 @@
     DEBUGLOGRAW(l, " \n");       \
 }
 
-static unsigned long long GetCurrentClockTimeMicroseconds()
+static unsigned long long GetCurrentClockTimeMicroseconds(void)
 {
    static clock_t _ticksPerSecond = 0;
    if (_ticksPerSecond <= 0) _ticksPerSecond = sysconf(_SC_CLK_TCK);
 
-   struct tms junk; clock_t newTicks = (clock_t) times(&junk);
-   return ((((unsigned long long)newTicks)*(1000000))/_ticksPerSecond);
+   { struct tms junk; clock_t newTicks = (clock_t) times(&junk);
+     return ((((unsigned long long)newTicks)*(1000000))/_ticksPerSecond); }
 }
 
 #define MUTEX_WAIT_TIME_DLEVEL 5
 #define PTHREAD_MUTEX_LOCK(mutex) \
 if (g_debugLevel>=MUTEX_WAIT_TIME_DLEVEL) { \
-   unsigned long long beforeTime = GetCurrentClockTimeMicroseconds(); \
-   pthread_mutex_lock(mutex); \
-   unsigned long long afterTime = GetCurrentClockTimeMicroseconds(); \
-   unsigned long long elapsedTime = (afterTime-beforeTime); \
-   if (elapsedTime > 1000) {  /* or whatever threshold you like; I'm using 1 millisecond here */ \
-      DEBUGLOG(MUTEX_WAIT_TIME_DLEVEL, "Thread took %llu microseconds to acquire mutex %s \n", \
+    unsigned long long const beforeTime = GetCurrentClockTimeMicroseconds(); \
+    pthread_mutex_lock(mutex); \
+    {   unsigned long long const afterTime = GetCurrentClockTimeMicroseconds(); \
+        unsigned long long const elapsedTime = (afterTime-beforeTime); \
+        if (elapsedTime > 1000) {  /* or whatever threshold you like; I'm using 1 millisecond here */ \
+            DEBUGLOG(MUTEX_WAIT_TIME_DLEVEL, "Thread took %llu microseconds to acquire mutex %s \n", \
                elapsedTime, #mutex); \
-  } \
+    }   } \
 } else pthread_mutex_lock(mutex);
 
 #else

From 96fe545a18b4f69cae28749bfcc304c54705959a Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Fri, 31 Mar 2017 15:16:43 -0700
Subject: [PATCH 090/255] Turn off sparse mode for OS X by default

---
 programs/fileio.c   | 3 +++
 programs/platform.h | 8 ++++++++
 programs/zstdcli.c  | 4 ++++
 3 files changed, 15 insertions(+)

diff --git a/programs/fileio.c b/programs/fileio.c
index 572e9c9ac..87871ae01 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -227,6 +227,9 @@ static FILE* FIO_openDstFile(const char* dstFileName)
             DISPLAYLEVEL(4, "Sparse File Support is automatically disabled on stdout ; try --sparse \n");
         }
     } else {
+        if (ZSTD_SPARSE_DEFAULT == 0 && g_sparseFileSupport == 1) {
+            g_sparseFileSupport = 0;
+        }
         if (!g_overwrite && strcmp (dstFileName, nulmark)) {  /* Check if destination file already exists */
             f = fopen( dstFileName, "rb" );
             if (f != 0) {  /* dest file exists, prompt for overwrite authorization */
diff --git a/programs/platform.h b/programs/platform.h
index ee7819512..74412cde3 100644
--- a/programs/platform.h
+++ b/programs/platform.h
@@ -138,6 +138,14 @@ static __inline int IS_CONSOLE(FILE* stdStream)
 #endif
 
 
+#ifndef ZSTD_SPARSE_DEFAULT
+#  if (defined(__APPLE__) && defined(__MACH__))
+#    define ZSTD_SPARSE_DEFAULT 0
+#  else
+#    define ZSTD_SPARSE_DEFAULT 1
+#  endif
+#endif
+
 
 #if defined (__cplusplus)
 }
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index e2709ec84..0cf8cacd1 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -137,7 +137,11 @@ static int usage_advanced(const char* programName)
 #endif
 #ifndef ZSTD_NODECOMPRESS
     DISPLAY( "--test  : test compressed file integrity \n");
+#if ZSTD_SPARSE_DEFAULT
     DISPLAY( "--[no-]sparse : sparse mode (default:enabled on file, disabled on stdout)\n");
+#else
+    DISPLAY( "--[no-]sparse : sparse mode (default:disabled)\n");
+#endif
 #endif
     DISPLAY( " -M#    : Set a memory usage limit for decompression \n");
     DISPLAY( "--      : All arguments after \"--\" are treated as files \n");

From eb38617175351bfaf933bc75a6604e070128ca79 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Fri, 31 Mar 2017 15:20:50 -0700
Subject: [PATCH 091/255] Clean up default sparse logic

---
 programs/fileio.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/fileio.c b/programs/fileio.c
index 87871ae01..78fb9a268 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -227,8 +227,8 @@ static FILE* FIO_openDstFile(const char* dstFileName)
             DISPLAYLEVEL(4, "Sparse File Support is automatically disabled on stdout ; try --sparse \n");
         }
     } else {
-        if (ZSTD_SPARSE_DEFAULT == 0 && g_sparseFileSupport == 1) {
-            g_sparseFileSupport = 0;
+        if (g_sparseFileSupport == 1) {
+            g_sparseFileSupport = ZSTD_SPARSE_DEFAULT;
         }
         if (!g_overwrite && strcmp (dstFileName, nulmark)) {  /* Check if destination file already exists */
             f = fopen( dstFileName, "rb" );

From 14433ca1adfa9bb17e74fcbd7942cc6d6a91c80a Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 31 Mar 2017 10:54:45 -0700
Subject: [PATCH 092/255] numerous typos and clarifications in format
 specification

fix limit values of Window_Size
bump version to 0.2.5
---
 doc/zstd_compression_format.md | 372 +++++++++++++++++----------------
 1 file changed, 197 insertions(+), 175 deletions(-)

diff --git a/doc/zstd_compression_format.md b/doc/zstd_compression_format.md
index d4b46548a..4bbdd57bc 100644
--- a/doc/zstd_compression_format.md
+++ b/doc/zstd_compression_format.md
@@ -16,7 +16,8 @@ Distribution of this document is unlimited.
 
 ### Version
 
-0.2.4 (17/02/17)
+0.2.5 (31/03/17)
+
 
 Introduction
 ------------
@@ -109,7 +110,7 @@ The structure of a single Zstandard frame is following:
 
 __`Magic_Number`__
 
-4 Bytes, little-endian format.
+4 Bytes, __little-endian__ format.
 Value : 0xFD2FB528
 
 __`Frame_Header`__
@@ -127,7 +128,7 @@ An optional 32-bit checksum, only present if `Content_Checksum_flag` is set.
 The content checksum is the result
 of [xxh64() hash function](http://www.xxhash.org)
 digesting the original (decoded) data as input, and a seed of zero.
-The low 4 bytes of the checksum are stored in little endian format.
+The low 4 bytes of the checksum are stored in __little-endian__ format.
 
 ### `Frame_Header`
 
@@ -154,41 +155,42 @@ Decoding this byte is enough to tell the size of `Frame_Header`.
 | 2          | `Content_Checksum_flag`   |
 | 1-0        | `Dictionary_ID_flag`      |
 
-In this table, bit 7 the is highest bit, while bit 0 the is lowest.
+In this table, bit 7 is the highest bit, while bit 0 is the lowest one.
 
 __`Frame_Content_Size_flag`__
 
 This is a 2-bits flag (`= Frame_Header_Descriptor >> 6`),
-specifying if decompressed data size is provided within the header.
-The `Flag_Value` can be converted into `Field_Size`,
+specifying if `Frame_Content_Size` (the decompressed data size)
+is provided within the header.
+`Flag_Value` provides `FCS_Field_Size`,
 which is the number of bytes used by `Frame_Content_Size`
 according to the following table:
 
-|`Flag_Value`|    0   |  1  |  2  |  3  |
-| ---------- | ------ | --- | --- | --- |
-|`Field_Size`| 0 or 1 |  2  |  4  |  8  |
+|  `Flag_Value`  |    0   |  1  |  2  |  3  |
+| -------------- | ------ | --- | --- | --- |
+|`FCS_Field_Size`| 0 or 1 |  2  |  4  |  8  |
 
-When `Flag_Value` is `0`, `Field_Size` depends on `Single_Segment_flag` :
+When `Flag_Value` is `0`, `FCS_Field_Size` depends on `Single_Segment_flag` :
 if `Single_Segment_flag` is set, `Field_Size` is 1.
-Otherwise, `Field_Size` is 0 (content size not provided).
+Otherwise, `Field_Size` is 0 : `Frame_Content_Size` is not provided.
 
 __`Single_Segment_flag`__
 
 If this flag is set,
 data must be regenerated within a single continuous memory segment.
 
-In this case, `Frame_Content_Size` is necessarily present,
-but `Window_Descriptor` byte is skipped.
+In this case, `Window_Descriptor` byte is skipped,
+but `Frame_Content_Size` is necessarily present.
 As a consequence, the decoder must allocate a memory segment
 of size equal or bigger than `Frame_Content_Size`.
 
 In order to preserve the decoder from unreasonable memory requirements,
-a decoder can reject a compressed frame
+a decoder is allowed to reject a compressed frame
 which requests a memory size beyond decoder's authorized range.
 
 For broader compatibility, decoders are recommended to support
 memory sizes of at least 8 MB.
-This is just a recommendation,
+This is only a recommendation,
 each decoder is free to support higher or lower limits,
 depending on local limitations.
 
@@ -224,37 +226,38 @@ It also specifies the size of this field as `Field_Size`.
 
 #### `Window_Descriptor`
 
-Provides guarantees on maximum back-reference distance
-that will be used within compressed data.
+Provides guarantees on minimum memory buffer required to decompress a frame.
 This information is important for decoders to allocate enough memory.
 
-The `Window_Descriptor` byte is optional. It is absent when `Single_Segment_flag` is set.
-In this case, the maximum back-reference distance is the content size itself,
-which can be any value from 1 to 2^64-1 bytes (16 EB).
+The `Window_Descriptor` byte is optional.
+When `Single_Segment_flag` is set, `Window_Descriptor` is not present.
+In this case, the required buffer size is the frame content size itself,
+which can be any value from 0 to 2^64-1 bytes (16 EB).
 
 | Bit numbers |     7-3    |     2-0    |
 | ----------- | ---------- | ---------- |
 | Field name  | `Exponent` | `Mantissa` |
 
-Maximum distance is given by the following formulas :
+The minimum memory buffer size is called `Window_Size`.
+It is described by the following formulas :
 ```
 windowLog = 10 + Exponent;
 windowBase = 1 << windowLog;
 windowAdd = (windowBase / 8) * Mantissa;
 Window_Size = windowBase + windowAdd;
 ```
-The minimum window size is 1 KB.
-The maximum size is `15*(1<<38)` bytes, which is 1.875 TB.
+The minimum `Window_Size` is 1 KB.
+The maximum `Window_Size` is `(1<<41) + 7*(1<<38)` bytes, which is 3.75 TB.
 
 To properly decode compressed data,
 a decoder will need to allocate a buffer of at least `Window_Size` bytes.
 
 In order to preserve decoder from unreasonable memory requirements,
-a decoder can refuse a compressed frame
+a decoder is allowed to reject a compressed frame
 which requests a memory size beyond decoder's authorized range.
 
 For improved interoperability,
-decoders are recommended to be compatible with window sizes of 8 MB,
+decoders are recommended to be compatible with `Window_Size >= 8 MB`,
 and encoders are recommended to not request more than 8 MB.
 It's merely a recommendation though,
 decoders are free to support larger or lower limits,
@@ -264,47 +267,50 @@ depending on local limitations.
 
 This is a variable size field, which contains
 the ID of the dictionary required to properly decode the frame.
-Note that this field is optional. When it's not present,
+`Dictionary_ID` field is optional. When it's not present,
 it's up to the decoder to make sure it uses the correct dictionary.
-Format is little-endian.
 
 Field size depends on `Dictionary_ID_flag`.
 1 byte can represent an ID 0-255.
 2 bytes can represent an ID 0-65535.
 4 bytes can represent an ID 0-4294967295.
+Format is __little-endian__.
 
 It's allowed to represent a small ID (for example `13`)
-with a large 4-bytes dictionary ID, losing some compacity in the process.
+with a large 4-bytes dictionary ID, even if it is less efficient.
 
 _Reserved ranges :_
 If the frame is going to be distributed in a private environment,
 any dictionary ID can be used.
 However, for public distribution of compressed frames using a dictionary,
-the following ranges are reserved for future use and should not be used :
-- low range : 1 - 32767
-- high range : >= (2^31)
-
+the following ranges are reserved and shall not be used :
+- low range : `<= 32767`
+- high range : `>= (1 << 31)`
 
 #### `Frame_Content_Size`
 
 This is the original (uncompressed) size. This information is optional.
-The `Field_Size` is provided according to value of `Frame_Content_Size_flag`.
-The `Field_Size` can be equal to 0 (not present), 1, 2, 4 or 8 bytes.
-Format is little-endian.
+`Frame_Content_Size` uses a variable number of bytes, provided by `FCS_Field_Size`.
+`FCS_Field_Size` is provided by the value of `Frame_Content_Size_flag`.
+`FCS_Field_Size` can be equal to 0 (not present), 1, 2, 4 or 8 bytes.
 
-| `Field_Size` |    Range   |
-| ------------ | ---------- |
-|      1       |   0 - 255  |
-|      2       | 256 - 65791|
-|      4       | 0 - 2^32-1 |
-|      8       | 0 - 2^64-1 |
+| `FCS_Field_Size` |    Range   |
+| ---------------- | ---------- |
+|        0         |   unknown  |
+|        1         |   0 - 255  |
+|        2         | 256 - 65791|
+|        4         | 0 - 2^32-1 |
+|        8         | 0 - 2^64-1 |
 
-When `Field_Size` is 1, 4 or 8 bytes, the value is read directly.
-When `Field_Size` is 2, _the offset of 256 is added_.
+`Frame_Content_Size` format is __little-endian__.
+When `FCS_Field_Size` is 1, 4 or 8 bytes, the value is read directly.
+When `FCS_Field_Size` is 2, _the offset of 256 is added_.
 It's allowed to represent a small size (for example `18`) using any compatible variant.
 
+
 Blocks
 -------
+
 After the magic number and header of each block,
 there are some number of blocks.
 Each frame must have at least one block  but there is no upper limit
@@ -312,64 +318,68 @@ on the number of blocks per frame.
 
 The structure of a block is as follows:
 
-| `Last_Block` | `Block_Type` | `Block_Size` | `Block_Content` |
-|:------------:|:------------:|:------------:|:---------------:|
-|   1 bit      |  2 bits      |  21 bits     |  n bytes        |
+| `Block_Header` | `Block_Content` |
+|:--------------:|:---------------:|
+|    3 bytes     |   n bytes       |
 
-The block header (`Last_Block`, `Block_Type`, and `Block_Size`) uses 3-bytes.
+`Block_Header` uses 3 bytes, written using __little-endian__ convention.
+It contains 3 fields :
+
+| `Block_Size` | `Block_Type` | `Last_Block` |
+|:------------:|:------------:|:------------:|
+|  bits 3-23   |  bits 1-2    |    bit 0     |
 
 __`Last_Block`__
 
 The lowest bit signals if this block is the last one.
-The frame will end after this one.
+The frame will end after this last block.
 It may be followed by an optional `Content_Checksum`
 (see [Zstandard Frames](#zstandard-frames)).
 
-__`Block_Type` and `Block_Size`__
-
-The next 2 bits represent the `Block_Type`,
-while the remaining 21 bits represent the `Block_Size`.
-Format is __little-endian__.
+__`Block_Type`__
 
+The next 2 bits represent the `Block_Type`.
 There are 4 block types :
 
-|    Value     |      0      |     1       |  2                 |    3      |
+|    Value     |      0      |      1      |         2          |     3     |
 | ------------ | ----------- | ----------- | ------------------ | --------- |
 | `Block_Type` | `Raw_Block` | `RLE_Block` | `Compressed_Block` | `Reserved`|
 
 - `Raw_Block` - this is an uncompressed block.
-  `Block_Content` contains `Block_Size` bytes to read and copy
-  as decoded data.
+  `Block_Content` contains `Block_Size` bytes.
 
-- `RLE_Block` - this is a single byte, repeated N times.
-  `Block_Content` consists of a single byte,
-  and `Block_Size` is the number of times this byte should be repeated.
+- `RLE_Block` - this is a single byte, repeated `Block_Size` times.
+  `Block_Content` consists of a single byte.
+  On the decompression side, this byte must be repeated `Block_Size` times.
 
 - `Compressed_Block` - this is a [Zstandard compressed block](#compressed-blocks),
   explained later on.
   `Block_Size` is the length of `Block_Content`, the compressed data.
-  The decompressed size is unknown,
+  The decompressed size is not known,
   but its maximum possible value is guaranteed (see below)
 
 - `Reserved` - this is not a block.
   This value cannot be used with current version of this specification.
 
+__`Block_Size`__
+
+The upper 21 bits of `Block_Header` represent the `Block_Size`.
+
 Block sizes must respect a few rules :
-- In compressed mode, compressed size is always strictly less than decompressed size.
-- Block decompressed size is always <= maximum back-reference distance.
+- For `Compressed_Block`, `Block_Size` is always strictly less than decompressed size.
+- Block decompressed size is always <= `Window_Size`
 - Block decompressed size is always <= 128 KB.
 
-A data block is not necessarily "full" :
-since an arbitrary “flush” may happen anytime,
-block decompressed content can be any size (even empty),
+A block can contain any number of bytes (even empty),
 up to `Block_Maximum_Decompressed_Size`, which is the smallest of :
-- Maximum back-reference distance
+- `Window_Size`
 - 128 KB
 
+
 Compressed Blocks
 -----------------
-To decompress a compressed block, the compressed size must be provided from
-`Block_Size` field in the block header.
+To decompress a compressed block, the compressed size must be provided
+from `Block_Size` field within `Block_Header`.
 
 A compressed block consists of 2 sections :
 - [Literals Section](#literals-section)
@@ -381,36 +391,34 @@ data in [Sequence Execution](#sequence-execution)
 #### Prerequisites
 To decode a compressed block, the following elements are necessary :
 - Previous decoded data, up to a distance of `Window_Size`,
-  or all previous data when `Single_Segment_flag` is set.
-- List of "recent offsets" from the previous compressed block.
-- Decoding tables of the previous compressed block for each symbol type
+  or all previously decoded data when `Single_Segment_flag` is set.
+- List of "recent offsets" from previous `Compressed_Block`.
+- Decoding tables of previous `Compressed_Block` for each symbol type
   (literals, literals lengths, match lengths, offsets).
 
 Literals Section
 ----------------
-During sequence execution, symbols from the literals section
-During sequence phase, literals will be entangled with match copy operations.
 All literals are regrouped in the first part of the block.
-They can be decoded first, and then copied during sequence operations,
-or they can be decoded on the flow, as needed by sequence commands.
-
-| `Literals_Section_Header` | [`Huffman_Tree_Description`] | Stream1 | [Stream2] | [Stream3] | [Stream4] |
-| ------------------------- | ---------------------------- | ------- | --------- | --------- | --------- |
+They can be decoded first, and then copied during [Sequence Execution],
+or they can be decoded on the flow during [Sequence Execution].
 
 Literals can be stored uncompressed or compressed using Huffman prefix codes.
 When compressed, an optional tree description can be present,
 followed by 1 or 4 streams.
 
+| `Literals_Section_Header` | [`Huffman_Tree_Description`] | Stream1 | [Stream2] | [Stream3] | [Stream4] |
+| ------------------------- | ---------------------------- | ------- | --------- | --------- | --------- |
+
 
 #### `Literals_Section_Header`
 
 Header is in charge of describing how literals are packed.
 It's a byte-aligned variable-size bitfield, ranging from 1 to 5 bytes,
-using little-endian convention.
+using __little-endian__ convention.
 
 | `Literals_Block_Type` | `Size_Format` | `Regenerated_Size` | [`Compressed_Size`] |
-| --------------------- | ------------- | ------------------ | ----------------- |
-|   2 bits              |  1 - 2 bits   |    5 - 20 bits     |    0 - 18 bits    |
+| --------------------- | ------------- | ------------------ | ------------------- |
+|       2 bits          |  1 - 2 bits   |    5 - 20 bits     |     0 - 18 bits     |
 
 In this representation, bits on the left are the lowest bits.
 
@@ -418,33 +426,38 @@ __`Literals_Block_Type`__
 
 This field uses 2 lowest bits of first byte, describing 4 different block types :
 
-| `Literals_Block_Type`         | Value |
-| ----------------------------- | ----- |
-| `Raw_Literals_Block`          |   0   |
-| `RLE_Literals_Block`          |   1   |
-| `Compressed_Literals_Block`   |   2   |
-| `Repeat_Stats_Literals_Block` |   3   |
+| `Literals_Block_Type`       | Value |
+| --------------------------- | ----- |
+| `Raw_Literals_Block`        |   0   |
+| `RLE_Literals_Block`        |   1   |
+| `Compressed_Literals_Block` |   2   |
+| `Treeless_Literals_Block`   |   3   |
 
 - `Raw_Literals_Block` - Literals are stored uncompressed.
-- `RLE_Literals_Block` - Literals consist of a single byte value repeated N times.
+- `RLE_Literals_Block` - Literals consist of a single byte value
+        repeated `Regenerated_Size` times.
 - `Compressed_Literals_Block` - This is a standard Huffman-compressed block,
         starting with a Huffman tree description.
         See details below.
-- `Repeat_Stats_Literals_Block` - This is a Huffman-compressed block,
+- `Treeless_Literals_Block` - This is a Huffman-compressed block,
         using Huffman tree _from previous Huffman-compressed literals block_.
-        Huffman tree description will be skipped.
-        Note: If this mode is used without any previous Huffman-table in the frame
-        (or [dictionary](#dictionary-format)), this should be treated as corruption.
+        `Huffman_Tree_Description` will be skipped.
+        Note: If this mode is triggering without any previous Huffman-table in the frame
+        (or [dictionary](#dictionary-format)), this should be treated as data corruption.
 
 __`Size_Format`__
 
 `Size_Format` is divided into 2 families :
 
-- For `Raw_Literals_Block` and `RLE_Literals_Block` it's enough to decode `Regenerated_Size`.
-- For `Compressed_Block`, its required to decode both `Compressed_Size`
-  and `Regenerated_Size` (the decompressed size). It will also decode the number of streams.
+- For `Raw_Literals_Block` and `RLE_Literals_Block`,
+  it's only necessary to decode `Regenerated_Size`.
+  There is no `Compressed_Size` field.
+- For `Compressed_Block` and `Treeless_Literals_Block`,
+  it's required to decode both `Compressed_Size`
+  and `Regenerated_Size` (the decompressed size).
+  It's also necessary to decode the number of streams (1 or 4).
 
-For values spanning several bytes, convention is little-endian.
+For values spanning several bytes, convention is __little-endian__.
 
 __`Size_Format` for `Raw_Literals_Block` and `RLE_Literals_Block`__ :
 
@@ -463,9 +476,9 @@ __`Size_Format` for `Raw_Literals_Block` and `RLE_Literals_Block`__ :
 
 Only Stream1 is present for these cases.
 Note : it's allowed to represent a short value (for example `13`)
-using a long format, accepting the increased compressed data size.
+using a long format, even if it's less efficient.
 
-__`Size_Format` for `Compressed_Literals_Block` and `Repeat_Stats_Literals_Block`__ :
+__`Size_Format` for `Compressed_Literals_Block` and `Treeless_Literals_Block`__ :
 
 - Value 00 : _A single stream_.
                Both `Regenerated_Size` and `Compressed_Size` use 10 bits (0-1023).
@@ -480,63 +493,64 @@ __`Size_Format` for `Compressed_Literals_Block` and `Repeat_Stats_Literals_Block
                Both `Regenerated_Size` and `Compressed_Size` use 18 bits (0-262143).
                `Literals_Section_Header` has 5 bytes.
 
-Both `Compressed_Size` and `Regenerated_Size` fields follow little-endian convention.
-Note: `Compressed_Size` __includes__ the size of the Huffman Tree description if it
-is present.
+Both `Compressed_Size` and `Regenerated_Size` fields follow __little-endian__ convention.
+Note: `Compressed_Size` __includes__ the size of the Huffman Tree description
+_when_ it is present.
 
 ### Raw Literals Block
-The data in Stream1 is `Regenerated_Size` bytes long, and contains the raw literals data
-to be used in sequence execution.
+The data in Stream1 is `Regenerated_Size` bytes long,
+it contains the raw literals data to be used during [Sequence Execution].
 
 ### RLE Literals Block
 Stream1 consists of a single byte which should be repeated `Regenerated_Size` times
 to generate the decoded literals.
 
-### Compressed Literals Block and Repeat Stats Literals Block
-Both of these modes contain Huffman encoded data 
+### Compressed Literals Block and Treeless Literals Block
+Both of these modes contain Huffman encoded data.
+`Treeless_Literals_Block` does not have a `Huffman_Tree_Description`.
 
 #### `Huffman_Tree_Description`
 This section is only present when `Literals_Block_Type` type is `Compressed_Literals_Block` (`2`).
 The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree-description).
-The size Huffman Tree description will be determined during the decoding process,
-and must be used to determine where the compressed Huffman streams begin.
+The size of `Huffman_Tree_Description` is determined during decoding process,
+it must be used to determine where streams begin.
+`Total_Streams_Size = Compress_Size - Huffman_Tree_Description_Size`.
 
-If repeat stats mode is used, the Huffman table used in the previous compressed block will
-be used to decompress this block as well.
+For `Treeless_Literals_Block`,
+the Huffman table comes from previously compressed literals block.
 
-Huffman compressed data consists either 1 or 4 Huffman-coded streams.
+Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
 
 If only one stream is present, it is a single bitstream occupying the entire
-remaining portion of the literals block, encoded as described at
+remaining portion of the literals block, encoded as described within
 [Huffman-Coded Streams](#huffman-coded-streams).
 
 If there are four streams, the literals section header only provides enough
-information to know the regenerated and compressed sizes of all four streams combined.
-The regenerated size of each stream is equal to `(totalSize+3)/4`, except for the last stream,
-which may be up to 3 bytes smaller, to reach a total decompressed size match that described
-in the literals header.
+information to know the decompressed and compressed sizes of all four streams _combined_.
+The decompressed size of each stream is equal to `(totalSize+3)/4`,
+except for the last stream which may be up to 3 bytes smaller,
+to reach a total decompressed size as specified in `Regenerated_Size`.
 
-The compressed size of each stream is provided explicitly: the first 6 bytes of the compressed
-data consist of three 2-byte little endian fields, describing the compressed sizes
-of the first three streams.
-The last streams size is computed from the total compressed size and the size of the other
-three streams.
+The compressed size of each stream is provided explicitly:
+the first 6 bytes of the compressed data consist of three 2-byte __little-endian__ fields,
+describing the compressed sizes of the first three streams.
+Stream4 size is computed from total `Total_Streams_Size` minus sizes of other streams.
 
-`stream4CSize = totalCSize - 6 - stream1CSize - stream2CSize - stream3CSize`.
+`Stream4_Size = Total_Streams_Size - 6 - Stream1_Size - Stream2_Size - Stream3_Size`.
 
-Note: remember that totalCSize may be smaller than the `Compressed_Size` found in the literals
-block header as `Compressed_Size` also contains the size of the Huffman Tree description if it
-is present.
+Note: remember that `Total_Streams_Size` can be smaller than `Compressed_Size` in header,
+because `Compressed_Size` also contains `Huffman_Tree_Description_Size` when it is present.
 
 Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
 as described at [Huffman-Coded Streams](#huffman-coded-streams)
 
+
 Sequences Section
 -----------------
 A compressed block is a succession of _sequences_ .
 A sequence is a literal copy command, followed by a match copy command.
 A literal copy command specifies a length.
-It is the number of bytes to be copied (or extracted) from the literal section.
+It is the number of bytes to be copied (or extracted) from the [Literals Section].
 A match copy command specifies an offset and a length.
 
 When all _sequences_ are decoded,
@@ -557,7 +571,7 @@ followed by the bitstream.
 | -------------------------- | ------------------------- | ---------------- | ---------------------- | --------- |
 
 To decode the `Sequences_Section`, it's required to know its size.
-This size is deduced from `blockSize - literalSectionSize`.
+This size is deduced from `Block_Size - Literals_Section_Size`.
 
 
 #### `Sequences_Section_Header`
@@ -572,7 +586,7 @@ This is a variable size field using between 1 and 3 bytes.
 Let's call its first byte `byte0`.
 - `if (byte0 == 0)` : there are no sequences.
             The sequence section stops there.
-            Regenerated content is defined entirely by literals section.
+            Decompressed content is defined entirely as [Literals Section] content.
 - `if (byte0 < 128)` : `Number_of_Sequences = byte0` . Uses 1 byte.
 - `if (byte0 < 255)` : `Number_of_Sequences = ((byte0-128) << 8) + byte1` . Uses 2 bytes.
 - `if (byte0 == 255)`: `Number_of_Sequences = byte1 + (byte2<<8) + 0x7F00` . Uses 3 bytes.
@@ -581,14 +595,14 @@ __Symbol compression modes__
 
 This is a single byte, defining the compression mode of each symbol type.
 
-|Bit number|   7-6                   |   5-4          |   3-2                |     1-0    |
+|Bit number|          7-6            |      5-4       |        3-2           |     1-0    |
 | -------- | ----------------------- | -------------- | -------------------- | ---------- |
 |Field name| `Literals_Lengths_Mode` | `Offsets_Mode` | `Match_Lengths_Mode` | `Reserved` |
 
 The last field, `Reserved`, must be all-zeroes.
 
 `Literals_Lengths_Mode`, `Offsets_Mode` and `Match_Lengths_Mode` define the `Compression_Mode` of
-literals lengths, offsets, and match lengths respectively.
+literals lengths, offsets, and match lengths symbols respectively.
 
 They follow the same enumeration :
 
@@ -598,12 +612,12 @@ They follow the same enumeration :
 
 - `Predefined_Mode` : A predefined FSE distribution table is used, defined in
           [default distributions](#default-distributions).
-          The table takes no space in the compressed data.
+          No distribution table will be present.
 - `RLE_Mode` : The table description consists of a single byte.
-          This code will be repeated for every sequence.
+          This code will be repeated for all sequences.
 - `Repeat_Mode` : The table used in the previous compressed block will be used again.
           No distribution table will be present.
-          Note: this includes RLE mode, so if repeat_mode follows rle_mode the same symbol will be repeated.
+          Note: this includes RLE mode, so if `Repeat_Mode` follows `RLE_Mode`, the same symbol will be repeated.
           If this mode is used without any previous sequence table in the frame
           (or [dictionary](#dictionary-format)) to repeat, this should be treated as corruption.
 - `FSE_Compressed_Mode` : standard FSE compression.
@@ -625,7 +639,7 @@ Literals length codes are values ranging from `0` to `35` included.
 They define lengths from 0 to 131071 bytes.
 The literals length is equal to the decoded `Baseline` plus
 the result of reading `Number_of_Bits` bits from the bitstream,
-as a little-endian value.
+as a __little-endian__ value.
 
 | `Literals_Length_Code` |         0-15           |
 | ---------------------- | ---------------------- |
@@ -654,7 +668,7 @@ Match length codes are values ranging from `0` to `52` included.
 They define lengths from 3 to 131074 bytes.
 The match length is equal to the decoded `Baseline` plus
 the result of reading `Number_of_Bits` bits from the bitstream,
-as a little-endian value.
+as a __little-endian__ value.
 
 | `Match_Length_Code` |         0-31            |
 | ------------------- | ----------------------- |
@@ -685,7 +699,7 @@ Recommendation is to support at least up to `22`.
 For information, at the time of this writing.
 the reference decoder supports a maximum `N` value of `28` in 64-bits mode.
 
-An offset code is also the number of additional bits to read in little-endian fashion,
+An offset code is also the number of additional bits to read in __little-endian__ fashion,
 and can be translated into an `Offset_Value` using the following formulas :
 
 ```
@@ -720,8 +734,8 @@ begins.
 FSE decoding requires a 'state' to be carried from symbol to symbol.
 For more explanation on FSE decoding, see the [FSE section](#fse).
 
-For sequence decoding, a separate state must be kept track of for each of
-literal lengths, offsets, and match lengths.
+For sequence decoding, a separate state keeps track of each
+literal lengths, offsets, and match lengths symbols.
 Some FSE primitives are also used.
 For more details on the operation of these primitives, see the [FSE section](#fse).
 
@@ -753,8 +767,7 @@ See the [description of the codes] for how to determine these values.
 [description of the codes]: #the-codes-for-literals-lengths-match-lengths-and-offsets
 
 Decoding starts by reading the `Number_of_Bits` required to decode `Offset`.
-It then does the same for `Match_Length`,
-and then for `Literals_Length`.
+It then does the same for `Match_Length`, and then for `Literals_Length`.
 This sequence is then used for [sequence execution](#sequence-execution).
 
 If it is not the last sequence in the block,
@@ -807,6 +820,7 @@ short offsetCodes_defaultDistribution[29] =
           1, 1, 1, 1, 1, 1, 1, 1,-1,-1,-1,-1,-1 };
 ```
 
+
 Sequence Execution
 ------------------
 Once literals and sequences have been decoded,
@@ -826,7 +840,8 @@ in this case.
 
 The offset is defined as from the current position, so an offset of 6
 and a match length of 3 means that 3 bytes should be copied from 6 bytes back.
-Note that all offsets must be at most equal to the window size defined by the frame header.
+Note that all offsets leading to previously decoded data
+must be smaller than `Window_Size` defined in `Frame_Header_Descriptor`.
 
 #### Repeat offsets
 As seen in [Sequence Execution](#sequence-execution),
@@ -842,11 +857,10 @@ so an `offset_value` of 1 means `Repeated_Offset2`,
 an `offset_value` of 2 means `Repeated_Offset3`,
 and an `offset_value` of 3 means `Repeated_Offset1 - 1_byte`.
 
-In the first block, the offset history is populated with the following values : 1, 4 and 8 (in order).
+For the first block, the starting offset history is populated with the following values : 1, 4 and 8 (in order).
 
-Then each block gets its starting offset history from the ending values of the most recent compressed block.
-Note that non-compressed blocks are skipped,
-they do not contribute to offset history.
+Then each block gets its starting offset history from the ending values of the most recent `Compressed_Block`.
+Note that blocks which are not `Compressed_Block` are skipped, they do not contribute to offset history.
 
 [Offset Codes]: #offset-codes
 
@@ -859,6 +873,7 @@ This means that when `Repeated_Offset1` (most recent) is used, history is unmodi
 When `Repeated_Offset2` is used, it's swapped with `Repeated_Offset1`.
 If any other offset is used, it becomes `Repeated_Offset1` and the rest are shift back by one.
 
+
 Skippable Frames
 ----------------
 
@@ -878,7 +893,7 @@ Skippable frames defined in this specification are compatible with [LZ4] ones.
 
 __`Magic_Number`__
 
-4 Bytes, little-endian format.
+4 Bytes, __little-endian__ format.
 Value : 0x184D2A5?, which means any value from 0x184D2A50 to 0x184D2A5F.
 All 16 values are valid to identify a skippable frame.
 
@@ -886,13 +901,14 @@ __`Frame_Size`__
 
 This is the size, in bytes, of the following `User_Data`
 (without including the magic number nor the size field itself).
-This field is represented using 4 Bytes, little-endian format, unsigned 32-bits.
+This field is represented using 4 Bytes, __little-endian__ format, unsigned 32-bits.
 This means `User_Data` can’t be bigger than (2^32-1) bytes.
 
 __`User_Data`__
 
 The `User_Data` can be anything. Data will just be skipped by the decoder.
 
+
 Entropy Encoding
 ----------------
 Two types of entropy encoding are used by the Zstandard format:
@@ -900,7 +916,7 @@ FSE, and Huffman coding.
 
 FSE
 ---
-FSE, or FiniteStateEntropy is an entropy coding based on [ANS].
+FSE, short for Finite State Entropy, is an entropy codec based on [ANS].
 FSE encoding/decoding involves a state that is carried over between symbols,
 so decoding must be done in the opposite direction as encoding.
 Therefore, all FSE bitstreams are read from end to beginning.
@@ -909,15 +925,15 @@ For additional details on FSE, see [Finite State Entropy].
 
 [Finite State Entropy]:https://github.com/Cyan4973/FiniteStateEntropy/
 
-FSE decoding involves a decoding table which has a power of 2 size and three elements:
+FSE decoding involves a decoding table which has a power of 2 size, and contain three elements:
 `Symbol`, `Num_Bits`, and `Baseline`.
 The `log2` of the table size is its `Accuracy_Log`.
 The FSE state represents an index in this table.
-The next symbol in the stream is the symbol indicated by the table value for that state.
-To obtain the next state value,
-the decoder should consume `Num_Bits` bits from the stream as a little endian value and add it to baseline.
 
-To obtain the initial state value, consume `Accuracy_Log` bits from the stream as a little endian value.
+To obtain the initial state value, consume `Accuracy_Log` bits from the stream as a __little-endian__ value.
+The next symbol in the stream is the `Symbol` indicated in the table for that state.
+To obtain the next state value,
+the decoder should consume `Num_Bits` bits from the stream as a __little-endian__ value and add it to `Baseline`.
 
 [ANS]: https://en.wikipedia.org/wiki/Asymmetric_Numeral_Systems
 
@@ -929,7 +945,7 @@ An FSE distribution table describes the probabilities of all symbols
 from `0` to the last present one (included)
 on a normalized scale of `1 << Accuracy_Log` .
 
-It's a bitstream which is read forward, in little-endian fashion.
+It's a bitstream which is read forward, in __little-endian__ fashion.
 It's not necessary to know its exact size,
 since it will be discovered and reported by the decoding process.
 
@@ -1064,7 +1080,7 @@ Huffman Coding
 --------------
 Zstandard Huffman-coded streams are read backwards,
 similar to the FSE bitstreams.
-Therefore, to find the start of the bitstream it is therefore necessary to
+Therefore, to find the start of the bitstream, it is therefore to
 know the offset of the last byte of the Huffman-coded stream.
 
 After writing the last bit containing information, the compressor
@@ -1077,7 +1093,7 @@ byte to read. The decompressor needs to skip 0-7 initial `0`-bits and
 the first `1`-bit it occurs. Afterwards, the useful part of the bitstream
 begins.
 
-The bitstream contains Huffman-coded symbols in little-endian order,
+The bitstream contains Huffman-coded symbols in __little-endian__ order,
 with the codes defined by the method below.
 
 ### Huffman Tree Description
@@ -1182,14 +1198,14 @@ The Huffman header compression uses 2 states,
 which share the same FSE distribution table.
 The first state (`State1`) encodes the even indexed symbols,
 and the second (`State2`) encodes the odd indexes.
-State1 is initialized first, and then State2, and they take turns decoding
-a single symbol and updating their state.
+`State1` is initialized first, and then `State2`, and they take turns
+decoding a single symbol and updating their state.
 For more details on these FSE operations, see the [FSE section](#fse).
 
 The number of symbols to decode is determined
 by tracking bitStream overflow condition:
 If updating state after decoding a symbol would require more bits than
-remain in the stream, it is assumed the extra bits are 0.  Then,
+remain in the stream, it is assumed that extra bits are 0.  Then,
 the symbols for each of the final states are decoded and the process is complete.
 
 ##### Conversion from weights to Huffman prefix codes
@@ -1245,7 +1261,7 @@ it would be encoded as:
 |Encoding|`0000`|`0001`|`01`|`1`| `10000` |
 
 Starting from the end,
-it's possible to read the bitstream in a little-endian fashion,
+it's possible to read the bitstream in a __little-endian__ fashion,
 keeping track of already used bits.  Since the bitstream is encoded in reverse
 order, by starting at the end the symbols can be read in forward order.
 
@@ -1258,13 +1274,14 @@ If a bitstream is not entirely and exactly consumed,
 hence reaching exactly its beginning position with _all_ bits consumed,
 the decoding process is considered faulty.
 
+
 Dictionary Format
 -----------------
 
-Zstandard is compatible with "raw content" dictionaries, free of any format restriction,
-except that they must be at least 8 bytes.
-These dictionaries function as if they were just the `Content` block of a formatted
-dictionary.
+Zstandard is compatible with "raw content" dictionaries,
+free of any format restriction, except that they must be at least 8 bytes.
+These dictionaries function as if they were just the `Content` part
+of a formatted dictionary.
 
 But dictionaries created by `zstd --train` follow a format, described here.
 
@@ -1274,9 +1291,9 @@ __Pre-requisites__ : a dictionary has a size,
 | `Magic_Number` | `Dictionary_ID` | `Entropy_Tables` | `Content` |
 | -------------- | --------------- | ---------------- | --------- |
 
-__`Magic_Number`__ : 4 bytes ID, value 0xEC30A437, little-endian format
+__`Magic_Number`__ : 4 bytes ID, value 0xEC30A437, __little-endian__ format
 
-__`Dictionary_ID`__ : 4 bytes, stored in little-endian format.
+__`Dictionary_ID`__ : 4 bytes, stored in __little-endian__ format.
               `Dictionary_ID` can be any value, except 0 (which means no `Dictionary_ID`).
               It's used by decoders to check if they use the correct dictionary.
 
@@ -1284,9 +1301,9 @@ _Reserved ranges :_
               If the frame is going to be distributed in a private environment,
               any `Dictionary_ID` can be used.
               However, for public distribution of compressed frames,
-              the following ranges are reserved for future use and should not be used :
+              the following ranges are reserved and shall not be used :
 
-              - low range : 1 - 32767
+              - low range  : <= 32767
               - high range : >= (2^31)
 
 __`Entropy_Tables`__ : following the same format as the tables in compressed blocks.
@@ -1298,26 +1315,30 @@ __`Entropy_Tables`__ : following the same format as the tables in compressed blo
               These tables populate the Repeat Stats literals mode and
               Repeat distribution mode for sequence decoding.
               It's finally followed by 3 offset values, populating recent offsets (instead of using `{1,4,8}`),
-              stored in order, 4-bytes little-endian each, for a total of 12 bytes.
+              stored in order, 4-bytes __little-endian__ each, for a total of 12 bytes.
               Each recent offset must have a value < dictionary size.
 
 __`Content`__ : The rest of the dictionary is its content.
               The content act as a "past" in front of data to compress or decompress,
               so it can be referenced in sequence commands.
               As long as the amount of data decoded from this frame is less than or
-              equal to the window-size, sequence commands may specify offsets longer
-              than the lenght of total decoded output so far to reference back to the
-              dictionary.  After the total output has surpassed the window size however,
+              equal to `Window_Size`, sequence commands may specify offsets longer
+              than the total length of decoded output so far to reference back to the
+              dictionary.  After the total output has surpassed `Window_Size` however,
               this is no longer allowed and the dictionary is no longer accessible.
 
 [compressed blocks]: #the-format-of-compressed_block
+
+
 Appendix A - Decoding tables for predefined codes
 -------------------------------------------------
 
-This appendix contains FSE decoding tables for the predefined literal length, match length, and offset
-codes. The tables have been constructed using the algorithm as given above in the
-"from normalized distribution to decoding tables" chapter. The tables here can be used as examples
-to crosscheck that an implementation implements the decoding table generation algorithm correctly.
+This appendix contains FSE decoding tables
+for the predefined literal length, match length, and offset codes.
+The tables have been constructed using the algorithm as given above in chapter
+"from normalized distribution to decoding tables".
+The tables here can be used as examples
+to crosscheck that an implementation build its decoding tables correctly.
 
 #### Literal Length Code:
 
@@ -1496,6 +1517,7 @@ to crosscheck that an implementation implements the decoding table generation al
 
 Version changes
 ---------------
+- 0.2.5 : minor typos and clarifications
 - 0.2.4 : section restructuring, by Sean Purcell
 - 0.2.3 : clarified several details, by Sean Purcell
 - 0.2.2 : added predefined codes, by Johannes Rudolph

From a935d67bf141aa2fa9fe59f4211e175b6b8d5b0f Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 31 Mar 2017 16:19:04 -0700
Subject: [PATCH 093/255] minor typo fixes in specification

---
 doc/zstd_compression_format.md | 35 +++++++++++++++++-----------------
 1 file changed, 17 insertions(+), 18 deletions(-)

diff --git a/doc/zstd_compression_format.md b/doc/zstd_compression_format.md
index 4bbdd57bc..1f212fea2 100644
--- a/doc/zstd_compression_format.md
+++ b/doc/zstd_compression_format.md
@@ -231,8 +231,8 @@ This information is important for decoders to allocate enough memory.
 
 The `Window_Descriptor` byte is optional.
 When `Single_Segment_flag` is set, `Window_Descriptor` is not present.
-In this case, the required buffer size is the frame content size itself,
-which can be any value from 0 to 2^64-1 bytes (16 EB).
+In this case, `Window_Size` is `Frame_Content_Size`,
+which can be any value from 0 to 2^64-1 bytes (16 ExaBytes).
 
 | Bit numbers |     7-3    |     2-0    |
 | ----------- | ---------- | ---------- |
@@ -284,7 +284,7 @@ If the frame is going to be distributed in a private environment,
 any dictionary ID can be used.
 However, for public distribution of compressed frames using a dictionary,
 the following ranges are reserved and shall not be used :
-- low range : `<= 32767`
+- low range  : `<= 32767`
 - high range : `>= (1 << 31)`
 
 #### `Frame_Content_Size`
@@ -311,23 +311,22 @@ It's allowed to represent a small size (for example `18`) using any compatible v
 Blocks
 -------
 
-After the magic number and header of each block,
-there are some number of blocks.
-Each frame must have at least one block  but there is no upper limit
-on the number of blocks per frame.
+After `Magic_Number` and `Frame_Header`, there are some number of blocks.
+Each frame must have at least one block,
+but there is no upper limit on the number of blocks per frame.
 
 The structure of a block is as follows:
 
 | `Block_Header` | `Block_Content` |
 |:--------------:|:---------------:|
-|    3 bytes     |   n bytes       |
+|    3 bytes     |     n bytes     |
 
 `Block_Header` uses 3 bytes, written using __little-endian__ convention.
 It contains 3 fields :
 
-| `Block_Size` | `Block_Type` | `Last_Block` |
+| `Last_Block` | `Block_Type` | `Block_Size` |
 |:------------:|:------------:|:------------:|
-|  bits 3-23   |  bits 1-2    |    bit 0     |
+|    bit 0     |  bits 1-2    |  bits 3-23   |
 
 __`Last_Block`__
 
@@ -442,7 +441,7 @@ This field uses 2 lowest bits of first byte, describing 4 different block types
 - `Treeless_Literals_Block` - This is a Huffman-compressed block,
         using Huffman tree _from previous Huffman-compressed literals block_.
         `Huffman_Tree_Description` will be skipped.
-        Note: If this mode is triggering without any previous Huffman-table in the frame
+        Note: If this mode is triggered without any previous Huffman-table in the frame
         (or [dictionary](#dictionary-format)), this should be treated as data corruption.
 
 __`Size_Format`__
@@ -514,7 +513,7 @@ This section is only present when `Literals_Block_Type` type is `Compressed_Lite
 The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree-description).
 The size of `Huffman_Tree_Description` is determined during decoding process,
 it must be used to determine where streams begin.
-`Total_Streams_Size = Compress_Size - Huffman_Tree_Description_Size`.
+`Total_Streams_Size = Compressed_Size - Huffman_Tree_Description_Size`.
 
 For `Treeless_Literals_Block`,
 the Huffman table comes from previously compressed literals block.
@@ -527,14 +526,14 @@ remaining portion of the literals block, encoded as described within
 
 If there are four streams, the literals section header only provides enough
 information to know the decompressed and compressed sizes of all four streams _combined_.
-The decompressed size of each stream is equal to `(totalSize+3)/4`,
+The decompressed size of each stream is equal to `(Regenerated_Size+3)/4`,
 except for the last stream which may be up to 3 bytes smaller,
 to reach a total decompressed size as specified in `Regenerated_Size`.
 
 The compressed size of each stream is provided explicitly:
 the first 6 bytes of the compressed data consist of three 2-byte __little-endian__ fields,
 describing the compressed sizes of the first three streams.
-Stream4 size is computed from total `Total_Streams_Size` minus sizes of other streams.
+`Stream4_Size` is computed from total `Total_Streams_Size` minus sizes of other streams.
 
 `Stream4_Size = Total_Streams_Size - 6 - Stream1_Size - Stream2_Size - Stream3_Size`.
 
@@ -550,11 +549,11 @@ Sequences Section
 A compressed block is a succession of _sequences_ .
 A sequence is a literal copy command, followed by a match copy command.
 A literal copy command specifies a length.
-It is the number of bytes to be copied (or extracted) from the [Literals Section].
+It is the number of bytes to be copied (or extracted) from the Literals Section.
 A match copy command specifies an offset and a length.
 
 When all _sequences_ are decoded,
-if there is are any literals left in the _literal section_,
+if there are literals left in the _literal section_,
 these bytes are added at the end of the block.
 
 This is described in more detail in [Sequence Execution](#sequence-execution)
@@ -586,7 +585,7 @@ This is a variable size field using between 1 and 3 bytes.
 Let's call its first byte `byte0`.
 - `if (byte0 == 0)` : there are no sequences.
             The sequence section stops there.
-            Decompressed content is defined entirely as [Literals Section] content.
+            Decompressed content is defined entirely as Literals Section content.
 - `if (byte0 < 128)` : `Number_of_Sequences = byte0` . Uses 1 byte.
 - `if (byte0 < 255)` : `Number_of_Sequences = ((byte0-128) << 8) + byte1` . Uses 2 bytes.
 - `if (byte0 == 255)`: `Number_of_Sequences = byte1 + (byte2<<8) + 0x7F00` . Uses 3 bytes.
@@ -622,7 +621,7 @@ They follow the same enumeration :
           (or [dictionary](#dictionary-format)) to repeat, this should be treated as corruption.
 - `FSE_Compressed_Mode` : standard FSE compression.
           A distribution table will be present.
-          The format of this distribution table is described in (FSE Table Description)[#fse-table-description].
+          The format of this distribution table is described in [FSE Table Description](#fse-table-description).
           Note that the maximum allowed accuracy log for literals length and match length tables is 9,
           and the maximum accuracy log for the offsets table is 8.
 

From 3f75d5252766bf0e638cf3fb7f5d63da50baaefe Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 31 Mar 2017 17:11:38 -0700
Subject: [PATCH 094/255] Changed ZSTD_compressBound()

required so that if Total = A+B
compressBound(Total) <= compressBound(A) + compressBound(B)
under condition of a minimum size for A and B

Will help for ZSTDMT_compress() memory allocation
---
 lib/compress/zstd_compress.c | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index c31f8db91..cc69f1184 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -32,7 +32,10 @@ typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZS
 *  Helper functions
 ***************************************/
 #define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
-size_t ZSTD_compressBound(size_t srcSize) { return FSE_compressBound(srcSize) + 12; }
+size_t ZSTD_compressBound(size_t srcSize) {
+    size_t const margin = (srcSize < 512 KB) ? 16 : 0;
+    return srcSize + (srcSize >> 8) + margin;
+}
 
 
 /*-*************************************

From 21b6c53b9f153b97a0a632f18a041eac53a4b8fa Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Fri, 31 Mar 2017 15:01:41 -0700
Subject: [PATCH 095/255] Working on API

---
 contrib/linux-kernel/include/zstd.h        | 317 ++++++---------------
 contrib/linux-kernel/lib/error_private.c   |  44 ---
 contrib/linux-kernel/lib/error_private.h   |   2 +-
 contrib/linux-kernel/lib/fse.h             |  66 -----
 contrib/linux-kernel/lib/fse_compress.c    |  47 +--
 contrib/linux-kernel/lib/fse_decompress.c  |  23 +-
 contrib/linux-kernel/lib/huf.h             |  42 ---
 contrib/linux-kernel/lib/huf_compress.c    |  21 --
 contrib/linux-kernel/lib/huf_decompress.c  |  43 +--
 contrib/linux-kernel/lib/xxhash.c          |  32 +--
 contrib/linux-kernel/lib/xxhash.h          |   8 -
 contrib/linux-kernel/lib/zstd_common.c     |  58 ++--
 contrib/linux-kernel/lib/zstd_compress.c   | 165 ++++-------
 contrib/linux-kernel/lib/zstd_decompress.c | 124 +++-----
 contrib/linux-kernel/lib/zstd_errors.h     |  55 ----
 contrib/linux-kernel/lib/zstd_internal.h   |  45 ++-
 16 files changed, 246 insertions(+), 846 deletions(-)
 delete mode 100644 contrib/linux-kernel/lib/error_private.c
 delete mode 100644 contrib/linux-kernel/lib/zstd_errors.h

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index 8b1afa4ba..6594521d6 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -52,77 +52,92 @@
 ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< library version number; to be used when checking dll version */
 
 
-/***************************************
-*  Simple API
-***************************************/
-/*! ZSTD_compress() :
-	Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
-	Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
-	@return : compressed size written into `dst` (<= `dstCapacity),
-			  or an error code if it fails (which can be tested using ZSTD_isError()). */
-ZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,
-							const void* src, size_t srcSize,
-								  int compressionLevel);
-
-/*! ZSTD_decompress() :
-	`compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
-	`dstCapacity` is an upper bound of originalSize.
-	If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
-	@return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
-			  or an errorCode if it fails (which can be tested using ZSTD_isError()). */
-ZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,
-							  const void* src, size_t compressedSize);
-
-/*! ZSTD_getDecompressedSize() :
-*   NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
-*   ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
-*   frame, but distinguishes empty frames from frames with an unknown size, or errors.
-*
-*   Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
-*   concatenated frames in one buffer, and so is more general.
-*   As a result however, it requires more computation and entire frames to be passed to it,
-*   as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
-*
-*   'src' is the start of a zstd compressed frame.
-*   @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
-*    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
-*             When `return==0`, data to decompress could be any size.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
-*             (For example, data may be necessarily cut into blocks <= 16 KB).
-*    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
-*    note 3 : decompressed size can be very large (64-bits value),
-*             potentially larger than what local system can handle as a single memory segment.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-*             Always ensure result fits within application's authorized limits.
-*             Each application can set its own limits.
-*    note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. */
-ZSTDLIB_API unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
-
-
 /*======  Helper functions  ======*/
+typedef enum {
+  ZSTD_error_no_error,
+  ZSTD_error_GENERIC,
+  ZSTD_error_prefix_unknown,
+  ZSTD_error_version_unsupported,
+  ZSTD_error_parameter_unknown,
+  ZSTD_error_frameParameter_unsupported,
+  ZSTD_error_frameParameter_unsupportedBy32bits,
+  ZSTD_error_frameParameter_windowTooLarge,
+  ZSTD_error_compressionParameter_unsupported,
+  ZSTD_error_init_missing,
+  ZSTD_error_memory_allocation,
+  ZSTD_error_stage_wrong,
+  ZSTD_error_dstSize_tooSmall,
+  ZSTD_error_srcSize_wrong,
+  ZSTD_error_corruption_detected,
+  ZSTD_error_checksum_wrong,
+  ZSTD_error_tableLog_tooLarge,
+  ZSTD_error_maxSymbolValue_tooLarge,
+  ZSTD_error_maxSymbolValue_tooSmall,
+  ZSTD_error_dictionary_corrupted,
+  ZSTD_error_dictionary_wrong,
+  ZSTD_error_dictionaryCreation_failed,
+  ZSTD_error_maxCode
+} ZSTD_ErrorCode;
+
 ZSTDLIB_API int         ZSTD_maxCLevel(void);               /*!< maximum compression level available */
 ZSTDLIB_API size_t      ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case scenario */
-ZSTDLIB_API unsigned    ZSTD_isError(size_t code);          /*!< tells if a `size_t` function result is an error code */
-ZSTDLIB_API const char* ZSTD_getErrorName(size_t code);     /*!< provides readable string from an error code */
-
+/*! ZSTD_isError() :
+*   tells if a `size_t` function result is an error code */
+ZSTDLIB_API static __attribute__((unused)) unsigned ZSTD_isError(size_t code) {
+	return code > (size_t)-ZSTD_error_maxCode;
+}
+/*! ZSTD_getErrorCode() :
+*   convert a `size_t` function result into a proper ZSTD_errorCode enum */
+ZSTDLIB_API static __attribute__((unused)) ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult) {
+	if (!ZSTD_isError(functionResult)) {
+		return (ZSTD_ErrorCode)0;
+	}
+	return (ZSTD_ErrorCode)(0 - functionResult);
+}
 
 /***************************************
 *  Explicit memory management
 ***************************************/
+
+typedef enum { ZSTD_fast, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2, ZSTD_btlazy2, ZSTD_btopt, ZSTD_btopt2 } ZSTD_strategy;   /* from faster to stronger */
+
+typedef struct {
+	unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
+	unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
+	unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
+	unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
+	unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
+	unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
+	ZSTD_strategy strategy;
+} ZSTD_compressionParameters;
+
+typedef struct {
+	unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
+	unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
+	unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
+} ZSTD_frameParameters;
+
+typedef struct {
+	ZSTD_compressionParameters cParams;
+	ZSTD_frameParameters fParams;
+} ZSTD_parameters;
+
+size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters params);
+size_t ZSTD_DCtxWorkspaceBound(void);
+
 /*= Compression context
 *   When compressing many times,
 *   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
 *   This will make workload friendlier for system's memory.
 *   Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_CCtx_s ZSTD_CCtx;
-ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);
-ZSTDLIB_API size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
+ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize);
 
 /*! ZSTD_compressCCtx() :
 	Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
-ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, ZSTD_parameters params);
+
+ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize, ZSTD_parameters params);
 
 /*= Decompression context
 *   When decompressing many times,
@@ -130,53 +145,28 @@ ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapaci
 *   This will make workload friendlier for system's memory.
 *   Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void);
-ZSTDLIB_API size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
+ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize);
 
 /*! ZSTD_decompressDCtx() :
 *   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
 ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 
-
-/**************************
-*  Simple dictionary API
-***************************/
-/*! ZSTD_compress_usingDict() :
-*   Compression using a predefined Dictionary (see dictBuilder/zdict.h).
-*   Note : This function loads the dictionary, resulting in significant startup delay.
-*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
-ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
-										   void* dst, size_t dstCapacity,
-									 const void* src, size_t srcSize,
-									 const void* dict,size_t dictSize,
-										   int compressionLevel);
-
-/*! ZSTD_decompress_usingDict() :
-*   Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
-*   Dictionary must be identical to the one used during compression.
-*   Note : This function loads the dictionary, resulting in significant startup delay.
-*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
-ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-											 void* dst, size_t dstCapacity,
-									   const void* src, size_t srcSize,
-									   const void* dict,size_t dictSize);
-
+ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize);
 
 /****************************
 *  Fast dictionary API
 ****************************/
+size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters params);
+size_t ZSTD_DDictWorkspaceBound(void);
+
 typedef struct ZSTD_CDict_s ZSTD_CDict;
 
 /*! ZSTD_createCDict() :
 *   When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
 *   ZSTD_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
 *   ZSTD_CDict can be created once and used by multiple threads concurrently, as its usage is read-only.
-*   `dictBuffer` can be released after ZSTD_CDict creation, as its content is copied within CDict */
-ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize, int compressionLevel);
-
-/*! ZSTD_freeCDict() :
-*   Function frees memory allocated by ZSTD_createCDict(). */
-ZSTDLIB_API size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
+*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the CDict */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize);
 
 /*! ZSTD_compress_usingCDict() :
 *   Compression using a digested Dictionary.
@@ -192,12 +182,8 @@ typedef struct ZSTD_DDict_s ZSTD_DDict;
 
 /*! ZSTD_createDDict() :
 *   Create a digested dictionary, ready to start decompression operation without startup delay.
-*   dictBuffer can be released after DDict creation, as its content is copied inside DDict */
-ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);
-
-/*! ZSTD_freeDDict() :
-*   Function frees memory allocated with ZSTD_createDDict() */
-ZSTDLIB_API size_t      ZSTD_freeDDict(ZSTD_DDict* ddict);
+*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the DDict */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize, void* workspace, size_t workspaceSize);
 
 /*! ZSTD_decompress_usingDDict() :
 *   Decompression using a digested Dictionary.
@@ -265,13 +251,17 @@ typedef struct ZSTD_outBuffer_s {
 *
 * *******************************************************************/
 
+size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters params);
+size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
+
 typedef struct ZSTD_CStream_s ZSTD_CStream;
 /*===== ZSTD_CStream management functions =====*/
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void);
-ZSTDLIB_API size_t ZSTD_freeCStream(ZSTD_CStream* zcs);
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void* workspace, size_t workspaceSize);
+ZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, ZSTD_parameters params, unsigned long long pledgedSrcSize);
+ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize);
 
 /*===== Streaming compression functions =====*/
-ZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
 ZSTDLIB_API size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
 ZSTDLIB_API size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
 ZSTDLIB_API size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
@@ -305,11 +295,12 @@ ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output
 
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
-ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void);
-ZSTDLIB_API size_t ZSTD_freeDStream(ZSTD_DStream* zds);
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void* workspace, size_t workspaceSize);
+ZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds, size_t maxWindowSize);
+ZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, size_t maxWindowSize, const ZSTD_DDict* ddict);
 
 /*===== Streaming decompression functions =====*/
-ZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds);
+ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
 ZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
 
 ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
@@ -355,35 +346,6 @@ static const size_t ZSTD_frameHeaderSize_max = ZSTD_FRAMEHEADERSIZE_MAX;
 static const size_t ZSTD_skippableHeaderSize = 8;  /* magic number + skippable frame length */
 
 
-/*--- Advanced types ---*/
-typedef enum { ZSTD_fast, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2, ZSTD_btlazy2, ZSTD_btopt, ZSTD_btopt2 } ZSTD_strategy;   /* from faster to stronger */
-
-typedef struct {
-	unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
-	unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
-	unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
-	unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
-	unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
-	unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
-	ZSTD_strategy strategy;
-} ZSTD_compressionParameters;
-
-typedef struct {
-	unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
-	unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
-	unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
-} ZSTD_frameParameters;
-
-typedef struct {
-	ZSTD_compressionParameters cParams;
-	ZSTD_frameParameters fParams;
-} ZSTD_parameters;
-
-/*= Custom memory allocation functions */
-typedef void* (*ZSTD_allocFunction) (void* opaque, size_t size);
-typedef void  (*ZSTD_freeFunction) (void* opaque, void* address);
-typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;
-
 /***************************************
 *  Compressed size functions
 ***************************************/
@@ -432,47 +394,9 @@ ZSTDLIB_API unsigned long long ZSTD_getFrameContentSize(const void *src, size_t
 *             however it does mean that all frame data must be present and valid. */
 ZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);
 
-
 /***************************************
 *  Advanced compression functions
 ***************************************/
-/*! ZSTD_estimateCCtxSize() :
- *  Gives the amount of memory allocated for a ZSTD_CCtx given a set of compression parameters.
- *  `frameContentSize` is an optional parameter, provide `0` if unknown */
-ZSTDLIB_API size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams);
-
-/*! ZSTD_createCCtx_advanced() :
- *  Create a ZSTD compression context using external alloc and free functions */
-ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem);
-
-/*! ZSTD_sizeofCCtx() :
- *  Gives the amount of memory used by a given ZSTD_CCtx */
-ZSTDLIB_API size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);
-
-typedef enum {
-	ZSTD_p_forceWindow,   /* Force back-references to remain < windowSize, even when referencing Dictionary content (default:0) */
-	ZSTD_p_forceRawDict   /* Force loading dictionary in "content-only" mode (no header analysis) */
-} ZSTD_CCtxParameter;
-/*! ZSTD_setCCtxParameter() :
- *  Set advanced parameters, selected through enum ZSTD_CCtxParameter
- *  @result : 0, or an error code (which can be tested with ZSTD_isError()) */
-ZSTDLIB_API size_t ZSTD_setCCtxParameter(ZSTD_CCtx* cctx, ZSTD_CCtxParameter param, unsigned value);
-
-/*! ZSTD_createCDict_byReference() :
- *  Create a digested dictionary for compression
- *  Dictionary content is simply referenced, and therefore stays in dictBuffer.
- *  It is important that dictBuffer outlives CDict, it must remain read accessible throughout the lifetime of CDict */
-ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, size_t dictSize, int compressionLevel);
-
-/*! ZSTD_createCDict_advanced() :
- *  Create a ZSTD_CDict using external alloc and free, and customized compression parameters */
-ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize, unsigned byReference,
-												  ZSTD_parameters params, ZSTD_customMem customMem);
-
-/*! ZSTD_sizeof_CDict() :
- *  Gives the amount of memory used by a given ZSTD_sizeof_CDict */
-ZSTDLIB_API size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict);
-
 /*! ZSTD_getCParams() :
 *   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
 *   `estimatedSrcSize` value is optional, select 0 if not known */
@@ -492,15 +416,6 @@ ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
 *   both values are optional, select `0` if unknown. */
 ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
 
-/*! ZSTD_compress_advanced() :
-*   Same as ZSTD_compress_usingDict(), with fine-tune control of each compression parameter */
-ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-										   void* dst, size_t dstCapacity,
-									 const void* src, size_t srcSize,
-									 const void* dict,size_t dictSize,
-										   ZSTD_parameters params);
-
-
 /*--- Advanced decompression functions ---*/
 
 /*! ZSTD_isFrame() :
@@ -510,33 +425,6 @@ ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
  *  Note 3 : Skippable Frame Identifiers are considered valid. */
 ZSTDLIB_API unsigned ZSTD_isFrame(const void* buffer, size_t size);
 
-/*! ZSTD_estimateDCtxSize() :
- *  Gives the potential amount of memory allocated to create a ZSTD_DCtx */
-ZSTDLIB_API size_t ZSTD_estimateDCtxSize(void);
-
-/*! ZSTD_createDCtx_advanced() :
- *  Create a ZSTD decompression context using external alloc and free functions */
-ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem);
-
-/*! ZSTD_sizeof_DCtx() :
- *  Gives the amount of memory used by a given ZSTD_DCtx */
-ZSTDLIB_API size_t ZSTD_sizeof_DCtx(const ZSTD_DCtx* dctx);
-
-/*! ZSTD_createDDict_byReference() :
- *  Create a digested dictionary, ready to start decompression operation without startup delay.
- *  Dictionary content is simply referenced, and therefore stays in dictBuffer.
- *  It is important that dictBuffer outlives DDict, it must remain read accessible throughout the lifetime of DDict */
-ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize);
-
-/*! ZSTD_createDDict_advanced() :
- *  Create a ZSTD_DDict using external alloc and free, optionally by reference */
-ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
-												  unsigned byReference, ZSTD_customMem customMem);
-
-/*! ZSTD_sizeof_DDict() :
- *  Gives the amount of memory used by a given ZSTD_DDict */
-ZSTDLIB_API size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict);
-
 /*! ZSTD_getDictID_fromDict() :
  *  Provides the dictID stored within dictionary.
  *  if @return == 0, the dictionary is not conformant with Zstandard specification.
@@ -562,31 +450,6 @@ ZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
 ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
 
 
-/********************************************************************
-*  Advanced streaming functions
-********************************************************************/
-
-/*=====   Advanced Streaming compression functions  =====*/
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
-ZSTDLIB_API size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   /**< pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
-ZSTDLIB_API size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
-ZSTDLIB_API size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
-											 ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
-ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
-ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
-ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
-
-
-/*=====   Advanced Streaming decompression functions  =====*/
-typedef enum { DStream_p_maxWindowSize } ZSTD_DStreamParameter_e;
-ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);
-ZSTDLIB_API size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
-ZSTDLIB_API size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds, ZSTD_DStreamParameter_e paramType, unsigned paramValue);
-ZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict);  /**< note : ddict will just be referenced, and must outlive decompression session */
-ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
-ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
-
-
 /*********************************************************************
 *  Buffer-less and synchronous inner streaming functions
 *
diff --git a/contrib/linux-kernel/lib/error_private.c b/contrib/linux-kernel/lib/error_private.c
deleted file mode 100644
index 83e27cb49..000000000
--- a/contrib/linux-kernel/lib/error_private.c
+++ /dev/null
@@ -1,44 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of this source tree. An additional grant
- * of patent rights can be found in the PATENTS file in the same directory.
- */
-
-/* The purpose of this file is to have a single list of error strings embedded in binary */
-
-#include "error_private.h"
-
-const char* ERR_getErrorString(ERR_enum code)
-{
-	static const char* const notErrorCode = "Unspecified error code";
-	switch( code )
-	{
-	case PREFIX(no_error): return "No error detected";
-	case PREFIX(GENERIC):  return "Error (generic)";
-	case PREFIX(prefix_unknown): return "Unknown frame descriptor";
-	case PREFIX(version_unsupported): return "Version not supported";
-	case PREFIX(parameter_unknown): return "Unknown parameter type";
-	case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
-	case PREFIX(frameParameter_unsupportedBy32bits): return "Frame parameter unsupported in 32-bits mode";
-	case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
-	case PREFIX(compressionParameter_unsupported): return "Compression parameter is out of bound";
-	case PREFIX(init_missing): return "Context should be init first";
-	case PREFIX(memory_allocation): return "Allocation error : not enough memory";
-	case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
-	case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
-	case PREFIX(srcSize_wrong): return "Src size incorrect";
-	case PREFIX(corruption_detected): return "Corrupted block detected";
-	case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
-	case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
-	case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
-	case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
-	case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
-	case PREFIX(dictionary_wrong): return "Dictionary mismatch";
-	case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
-	case PREFIX(maxCode):
-	default: return notErrorCode;
-	}
-}
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index 7b2ce36d4..680eba112 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -16,7 +16,7 @@
 *  Dependencies
 ******************************************/
 #include <linux/types.h>        /* size_t */
-#include "zstd_errors.h"  /* enum list */
+#include "zstd.h"  /* enum list */
 
 
 /* ****************************************
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index a5c3980a7..6df7ff935 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -59,34 +59,6 @@
 #define FSE_VERSION_NUMBER  (FSE_VERSION_MAJOR *100*100 + FSE_VERSION_MINOR *100 + FSE_VERSION_RELEASE)
 FSE_PUBLIC_API unsigned FSE_versionNumber(void);   /**< library version number; to be used when checking dll version */
 
-/*-****************************************
-*  FSE simple functions
-******************************************/
-/*! FSE_compress() :
-	Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
-	'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
-	@return : size of compressed data (<= dstCapacity).
-	Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-					 if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
-					 if FSE_isError(return), compression failed (more details using FSE_getErrorName())
-*/
-FSE_PUBLIC_API size_t FSE_compress(void* dst, size_t dstCapacity,
-							 const void* src, size_t srcSize);
-
-/*! FSE_decompress():
-	Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
-	into already allocated destination buffer 'dst', of size 'dstCapacity'.
-	@return : size of regenerated data (<= maxDstSize),
-			  or an error code, which can be tested using FSE_isError() .
-
-	** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
-	Why ? : making this distinction requires a header.
-	Header management is intentionally delegated to the user layer, which can better manage special cases.
-*/
-FSE_PUBLIC_API size_t FSE_decompress(void* dst,  size_t dstCapacity,
-							   const void* cSrc, size_t cSrcSize);
-
-
 /*-*****************************************
 *  Tool functions
 ******************************************/
@@ -97,20 +69,6 @@ FSE_PUBLIC_API unsigned    FSE_isError(size_t code);        /* tells if a return
 FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error code string (useful for debugging) */
 
 
-/*-*****************************************
-*  FSE advanced functions
-******************************************/
-/*! FSE_compress2() :
-	Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
-	Both parameters can be defined as '0' to mean : use default value
-	@return : size of compressed data
-	Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
-					 if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
-					 if FSE_isError(return), it's an error code.
-*/
-FSE_PUBLIC_API size_t FSE_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
-
-
 /*-*****************************************
 *  FSE detailed API
 ******************************************/
@@ -133,16 +91,6 @@ or to save and provide normalized distribution using external method.
 */
 
 /* *** COMPRESSION *** */
-
-/*! FSE_count():
-	Provides the precise count of each byte within a table 'count'.
-	'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
-	*maxSymbolValuePtr will be updated if detected smaller than initial value.
-	@return : the count of the most frequent symbol (which is not identified).
-			  if return == srcSize, there is only one symbol.
-			  Can also return an error code, which can be tested with FSE_isError(). */
-FSE_PUBLIC_API size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
 /*! FSE_optimalTableLog():
 	dynamically downsize 'tableLog' when conditions are met.
 	It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
@@ -171,13 +119,6 @@ FSE_PUBLIC_API size_t FSE_writeNCount (void* buffer, size_t bufferSize, const sh
 /*! Constructor and Destructor of FSE_CTable.
 	Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
 typedef unsigned FSE_CTable;   /* don't allocate that. It's only meant to be more restrictive than void* */
-FSE_PUBLIC_API FSE_CTable* FSE_createCTable (unsigned tableLog, unsigned maxSymbolValue);
-FSE_PUBLIC_API void        FSE_freeCTable (FSE_CTable* ct);
-
-/*! FSE_buildCTable():
-	Builds `ct`, which must be already allocated, using FSE_createCTable().
-	@return : 0, or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
 
 /*! FSE_compress_usingCTable():
 	Compress `src` using `ct` into `dst` which must be already allocated.
@@ -242,8 +183,6 @@ FSE_PUBLIC_API size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSym
 /*! Constructor and Destructor of FSE_DTable.
 	Note that its size depends on 'tableLog' */
 typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
-FSE_PUBLIC_API FSE_DTable* FSE_createDTable(unsigned tableLog);
-FSE_PUBLIC_API void        FSE_freeDTable(FSE_DTable* dt);
 
 /*! FSE_buildDTable():
 	Builds 'dt', which must be already allocated, using FSE_createDTable().
@@ -313,11 +252,6 @@ If there is an error, the function will return an error code, which can be teste
 size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
 				 const void* source, size_t sourceSize, unsigned* workSpace);
 
-/** FSE_countFast() :
- *  same as FSE_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr
- */
-size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
 /* FSE_countFast_wksp() :
  * Same as FSE_countFast(), but using an externally provided scratch buffer.
  * `workSpace` must be a table of minimum `1024` unsigned
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index 8b85b85f1..7c13a4099 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -35,12 +35,13 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#define FORCE_INLINE static __attribute__((always_inline))
+#define FORCE_INLINE static __always_inline
 
 
 /* **************************************************************
 *  Includes
 ****************************************************************/
+#include <linux/compiler.h>
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
 #include "fse.h"
@@ -164,14 +165,6 @@ size_t FSE_buildCTable_wksp(FSE_CTable* ct, const short* normalizedCounter, unsi
 }
 
 
-size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-	FSE_FUNCTION_TYPE tableSymbol[FSE_MAX_TABLESIZE];   /* memset() is not necessary, even if static analyzer complain about it */
-	return FSE_buildCTable_wksp(ct, normalizedCounter, maxSymbolValue, tableLog, tableSymbol, sizeof(tableSymbol));
-}
-
-
-
 #ifndef FSE_COMMONDEFS_ONLY
 
 /*-**************************************************************
@@ -399,14 +392,6 @@ size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
 	return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
 }
 
-/* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
-size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
-					 const void* source, size_t sourceSize)
-{
-	unsigned tmpCounters[1024];
-	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters);
-}
-
 /* FSE_count_wksp() :
  * Same as FSE_count(), but using an externally provided scratch buffer.
  * `workSpace` size must be table of >= `1024` unsigned */
@@ -445,16 +430,6 @@ size_t FSE_sizeof_CTable (unsigned maxSymbolValue, unsigned tableLog)
 	return FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
 }
 
-FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)
-{
-	size_t size;
-	if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-	size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
-	return (FSE_CTable*)malloc(size);
-}
-
-void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
-
 /* provides the minimum logSize to safely represent a distribution */
 static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
 {
@@ -817,23 +792,5 @@ size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t src
 	return op-ostart;
 }
 
-typedef struct {
-	FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
-	BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
-} fseWkspMax_t;
-
-size_t FSE_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog)
-{
-	fseWkspMax_t scratchBuffer;
-	FSE_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
-	if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-	return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
-}
-
-size_t FSE_compress (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-	return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
-}
-
 
 #endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/fse_decompress.c
index ebc228daf..2a35f1703 100644
--- a/contrib/linux-kernel/lib/fse_decompress.c
+++ b/contrib/linux-kernel/lib/fse_decompress.c
@@ -36,12 +36,13 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#define FORCE_INLINE static __attribute__((always_inline))
+#define FORCE_INLINE static __always_inline
 
 
 /* **************************************************************
 *  Includes
 ****************************************************************/
+#include <linux/compiler.h>
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"
 #include "fse.h"
@@ -81,16 +82,6 @@
 
 
 /* Function templates */
-FSE_DTable* FSE_createDTable (unsigned tableLog)
-{
-	if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-	return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
-}
-
-void FSE_freeDTable (FSE_DTable* dt)
-{
-	free(dt);
-}
 
 size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
 {
@@ -298,14 +289,4 @@ size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size
 }
 
 
-typedef FSE_DTable DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
-
-size_t FSE_decompress(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize)
-{
-	DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
-	return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
-}
-
-
-
 #endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index fd26fcf27..e0a30ce00 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -39,36 +39,6 @@
 #include <linux/types.h>    /* size_t */
 
 
-/* *** simple functions *** */
-/**
-HUF_compress() :
-	Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
-	'dst' buffer must be already allocated.
-	Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
-	`srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
-	@return : size of compressed data (<= `dstCapacity`).
-	Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-					 if return == 1, srcData is a single repeated byte symbol (RLE compression).
-					 if HUF_isError(return), compression failed (more details using HUF_getErrorName())
-*/
-size_t HUF_compress(void* dst, size_t dstCapacity,
-			  const void* src, size_t srcSize);
-
-/**
-HUF_decompress() :
-	Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
-	into already allocated buffer 'dst', of minimum size 'dstSize'.
-	`originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
-	Note : in contrast with FSE, HUF_decompress can regenerate
-		   RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
-		   because it knows size to regenerate.
-	@return : size of regenerated data (== originalSize),
-			  or an error code, which can be tested using HUF_isError()
-*/
-size_t HUF_decompress(void* dst,  size_t originalSize,
-				const void* cSrc, size_t cSrcSize);
-
-
 /* ***   Tool functions *** */
 #define HUF_BLOCKSIZE_MAX (128 * 1024)       /**< maximum input size for a single block compressed with HUF_compress */
 size_t HUF_compressBound(size_t size);       /**< maximum compressed size (worst case) */
@@ -80,11 +50,6 @@ const char* HUF_getErrorName(size_t code);   /**< provides error code string (us
 
 /* ***   Advanced function   *** */
 
-/** HUF_compress2() :
- *   Same as HUF_compress(), but offers direct control over `maxSymbolValue` and `tableLog` .
- *   `tableLog` must be `<= HUF_TABLELOG_MAX` . */
-size_t HUF_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
-
 /** HUF_compress4X_wksp() :
 *   Same as HUF_compress2(), but uses externally allocated `workSpace`, which must be a table of >= 1024 unsigned */
 size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
@@ -136,9 +101,6 @@ typedef U32 HUF_DTable;
 /* ****************************************
 *  Advanced decompression functions
 ******************************************/
-size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
-size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
-
 size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< decodes RLE and uncompressed */
 size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize); /**< considers RLE and uncompressed as errors */
 size_t HUF_decompress4X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
@@ -223,7 +185,6 @@ size_t HUF_decompress4X4_usingDTable(void* dst, size_t maxDstSize, const void* c
 
 /* single stream variants */
 
-size_t HUF_compress1X (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
 size_t HUF_compress1X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
 size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
 /** HUF_compress1X_repeat() :
@@ -233,9 +194,6 @@ size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, si
 *   If preferRepeat then the old table will always be used if valid. */
 size_t HUF_compress1X_repeat(void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize, HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
 
-size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* single-symbol decoder */
-size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* double-symbol decoder */
-
 size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
 size_t HUF_decompress1X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
 size_t HUF_decompress1X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index 16576f579..b2e71405c 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -635,14 +635,6 @@ size_t HUF_compress1X_repeat (void* dst, size_t dstSize,
 	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
 }
 
-size_t HUF_compress1X (void* dst, size_t dstSize,
-				 const void* src, size_t srcSize,
-				 unsigned maxSymbolValue, unsigned huffLog)
-{
-	unsigned workSpace[1024];
-	return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
-}
-
 size_t HUF_compress4X_wksp (void* dst, size_t dstSize,
 					  const void* src, size_t srcSize,
 					  unsigned maxSymbolValue, unsigned huffLog,
@@ -659,16 +651,3 @@ size_t HUF_compress4X_repeat (void* dst, size_t dstSize,
 {
 	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
 }
-
-size_t HUF_compress2 (void* dst, size_t dstSize,
-				const void* src, size_t srcSize,
-				unsigned maxSymbolValue, unsigned huffLog)
-{
-	unsigned workSpace[1024];
-	return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
-}
-
-size_t HUF_compress (void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-	return HUF_compress2(dst, maxDstSize, src, (U32)srcSize, 255, HUF_TABLELOG_DEFAULT);
-}
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/huf_decompress.c
index 4ac28bec9..f73223c4e 100644
--- a/contrib/linux-kernel/lib/huf_decompress.c
+++ b/contrib/linux-kernel/lib/huf_decompress.c
@@ -35,12 +35,13 @@
 /* **************************************************************
 *  Compiler specifics
 ****************************************************************/
-#define FORCE_INLINE static __attribute__((always_inline))
+#define FORCE_INLINE static __always_inline
 
 
 /* **************************************************************
 *  Dependencies
 ****************************************************************/
+#include <linux/compiler.h>
 #include <linux/string.h>     /* memcpy, memset */
 #include "bitstream.h"  /* BIT_* */
 #include "fse.h"        /* header compression */
@@ -210,12 +211,6 @@ size_t HUF_decompress1X2_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, cons
 	return HUF_decompress1X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
 }
 
-size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-	HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-	return HUF_decompress1X2_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
 
 static size_t HUF_decompress4X2_usingDTable_internal(
 		  void* dst,  size_t dstSize,
@@ -333,13 +328,6 @@ size_t HUF_decompress4X2_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, cons
 	return HUF_decompress4X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, dctx);
 }
 
-size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-	HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-	return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
-
 /* *************************/
 /* double-symbols decoding */
 /* *************************/
@@ -624,12 +612,6 @@ size_t HUF_decompress1X4_DCtx (HUF_DTable* DCtx, void* dst, size_t dstSize, cons
 	return HUF_decompress1X4_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
 }
 
-size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-	HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-	return HUF_decompress1X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
 static size_t HUF_decompress4X4_usingDTable_internal(
 		  void* dst,  size_t dstSize,
 	const void* cSrc, size_t cSrcSize,
@@ -746,12 +728,6 @@ size_t HUF_decompress4X4_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, cons
 	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
 }
 
-size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-	HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-	return HUF_decompress4X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
 
 /* ********************************/
 /* Generic decompression selector */
@@ -818,21 +794,6 @@ U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize)
 
 typedef size_t (*decompressionAlgo)(void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
 
-size_t HUF_decompress (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-	static const decompressionAlgo decompress[2] = { HUF_decompress4X2, HUF_decompress4X4 };
-
-	/* validation checks */
-	if (dstSize == 0) return ERROR(dstSize_tooSmall);
-	if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-	if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-	if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
-
-	{   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-		return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
-	}
-}
-
 size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
 {
 	/* validation checks */
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 44392265d..05ebedf7f 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -66,9 +66,6 @@
 *  Includes & Memory related functions
 ***************************************/
 /* Modify the local functions below should you wish to use some other memory routines */
-/* for malloc(), free() */
-static void* XXH_malloc(size_t s) { return malloc(s); }
-static void  XXH_free  (void* p)  { free(p); }
 /* for memcpy() */
 #include <linux/string.h>
 static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
@@ -80,7 +77,8 @@ static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcp
 /* *************************************
 *  Compiler Specific Options
 ***************************************/
-#define FORCE_INLINE static __attribute__((always_inline))
+#include <linux/compiler.h>
+#define FORCE_INLINE static __always_inline
 
 
 static U32 XXH_read32(const void* memPtr)
@@ -116,8 +114,10 @@ typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
 *****************************/
 typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
 
-FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess, XXH_alignment)
+FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
 {
+	(void)endian;
+	(void)align;
 	return MEM_readLE32(ptr);
 }
 
@@ -133,6 +133,8 @@ static U32 XXH_readBE32(const void* ptr)
 
 FORCE_INLINE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
 {
+	(void)endian;
+	(void)align;
 	return MEM_readLE64(ptr);
 }
 
@@ -397,26 +399,6 @@ XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned
 *  Advanced Hash Functions
 ****************************************************/
 
-XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)
-{
-	return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
-}
-XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)
-{
-	XXH_free(statePtr);
-	return XXH_OK;
-}
-
-XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)
-{
-	return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
-}
-XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
-{
-	XXH_free(statePtr);
-	return XXH_OK;
-}
-
 
 /*** Hash feed ***/
 
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index 6c4c79c42..36d140eca 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -140,14 +140,6 @@ XXH64() :
 typedef struct XXH32_state_s XXH32_state_t;   /* incomplete type */
 typedef struct XXH64_state_s XXH64_state_t;   /* incomplete type */
 
-/*! State allocation, compatible with dynamic libraries */
-
-XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);
-XXH_PUBLIC_API XXH_errorcode  XXH32_freeState(XXH32_state_t* statePtr);
-
-XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);
-XXH_PUBLIC_API XXH_errorcode  XXH64_freeState(XXH64_state_t* statePtr);
-
 
 /* hash streaming */
 
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index 0788b6ef6..c62cbd365 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -13,7 +13,8 @@
 *  Dependencies
 ***************************************/
 #include "error_private.h"
-#include "zstd.h"           /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
+#include "zstd_internal.h"           /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
+#include <linux/kernel.h>
 
 
 /*-****************************************
@@ -22,41 +23,38 @@
 unsigned ZSTD_versionNumber (void) { return ZSTD_VERSION_NUMBER; }
 
 
-/*-****************************************
-*  ZSTD Error Management
-******************************************/
-/*! ZSTD_isError() :
-*   tells if a return value is an error code */
-unsigned ZSTD_isError(size_t code) { return ERR_isError(code); }
-
-/*! ZSTD_getErrorName() :
-*   provides error code string from function result (useful for debugging) */
-const char* ZSTD_getErrorName(size_t code) { return ERR_getErrorName(code); }
-
-/*! ZSTD_getError() :
-*   convert a `size_t` function result into a proper ZSTD_errorCode enum */
-ZSTD_ErrorCode ZSTD_getErrorCode(size_t code) { return ERR_getErrorCode(code); }
-
-/*! ZSTD_getErrorString() :
-*   provides error code string from enum */
-const char* ZSTD_getErrorString(ZSTD_ErrorCode code) { return ERR_getErrorString(code); }
-
-
 /*=**************************************************************
 *  Custom allocator
 ****************************************************************/
-/* default uses stdlib */
-void* ZSTD_defaultAllocFunction(void* opaque, size_t size)
-{
-	void* address = malloc(size);
-	(void)opaque;
-	return address;
+
+#define stack_push(stack, size) ({                                             \
+		void* const ptr = ZSTD_PTR_ALIGN((stack)->ptr);                            \
+		(stack)->ptr = (char*)ptr + (size);                                        \
+		(stack)->ptr <= (stack)->end ? ptr : NULL;                                 \
+	})
+
+ZSTD_customMem ZSTD_initStack(void* workspace, size_t workspaceSize) {
+	ZSTD_customMem stackMem = { ZSTD_stackAlloc, ZSTD_stackFree, workspace };
+	ZSTD_stack* stack = (ZSTD_stack*) workspace;
+	/* Verify preconditions */
+	if (!workspace || workspaceSize < sizeof(ZSTD_stack) || workspace != ZSTD_PTR_ALIGN(workspace)) {
+		ZSTD_customMem error = {NULL, NULL, NULL};
+		return error;
+	}
+	/* Initialize the stack */
+	stack->ptr = workspace;
+	stack->end = (char*)workspace + workspaceSize;
+	stack_push(stack, sizeof(ZSTD_stack));
+	return stackMem;
 }
 
-void ZSTD_defaultFreeFunction(void* opaque, void* address)
-{
+void* ZSTD_stackAlloc(void* opaque, size_t size) {
+	ZSTD_stack* stack = (ZSTD_stack*)opaque;
+	return stack_push(stack, size);
+}
+void ZSTD_stackFree(void* opaque, void* address) {
 	(void)opaque;
-	free(address);
+	(void)address;
 }
 
 void* ZSTD_malloc(size_t size, ZSTD_customMem customMem)
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index 79b7699b8..df258c636 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -11,6 +11,7 @@
 /*-*************************************
 *  Dependencies
 ***************************************/
+#include <linux/kernel.h>
 #include <linux/string.h>         /* memset */
 #include "mem.h"
 #include "fse.h"
@@ -84,18 +85,26 @@ struct ZSTD_CCtx_s {
 	unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
 };
 
-ZSTD_CCtx* ZSTD_createCCtx(void)
-{
-	return ZSTD_createCCtx_advanced(defaultCustomMem);
+size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams) {
+	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << cParams.windowLog);
+	U32    const divider = (cParams.searchLength==3) ? 3 : 4;
+	size_t const maxNbSeq = blockSize / divider;
+	size_t const tokenSpace = blockSize + 11*maxNbSeq;
+	size_t const chainSize = (cParams.strategy == ZSTD_fast) ? 0 : (1 << cParams.chainLog);
+	size_t const hSize = ((size_t)1) << cParams.hashLog;
+	U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
+	size_t const h3Size = ((size_t)1) << hashLog3;
+	size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
+	size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32) + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
+	size_t const workspaceSize = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+
+	return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_CCtx)) + ZSTD_ALIGN(workspaceSize);
 }
 
-ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
+static ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
 {
 	ZSTD_CCtx* cctx;
-
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
-
 	cctx = (ZSTD_CCtx*) ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
 	if (!cctx) return NULL;
 	memset(cctx, 0, sizeof(ZSTD_CCtx));
@@ -103,6 +112,12 @@ ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
 	return cctx;
 }
 
+ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize)
+{
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createCCtx_advanced(stackMem);
+}
+
 size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
 {
 	if (cctx==NULL) return 0;   /* support free on NULL */
@@ -111,22 +126,6 @@ size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
 	return 0;   /* reserved as a potential error code in the future */
 }
 
-size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx)
-{
-	if (cctx==NULL) return 0;   /* support sizeof on NULL */
-	return sizeof(*cctx) + cctx->workSpaceSize;
-}
-
-size_t ZSTD_setCCtxParameter(ZSTD_CCtx* cctx, ZSTD_CCtxParameter param, unsigned value)
-{
-	switch(param)
-	{
-	case ZSTD_p_forceWindow : cctx->forceWindow = value>0; cctx->loadedDictEnd = 0; return 0;
-	case ZSTD_p_forceRawDict : cctx->forceRawDict = value>0; return 0;
-	default: return ERROR(parameter_unknown);
-	}
-}
-
 const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx)   /* hidden interface */
 {
 	return &(ctx->seqStore);
@@ -191,28 +190,6 @@ ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, u
 }
 
 
-size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
-{
-	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << cParams.windowLog);
-	U32    const divider = (cParams.searchLength==3) ? 3 : 4;
-	size_t const maxNbSeq = blockSize / divider;
-	size_t const tokenSpace = blockSize + 11*maxNbSeq;
-
-	size_t const chainSize = (cParams.strategy == ZSTD_fast) ? 0 : (1 << cParams.chainLog);
-	size_t const hSize = ((size_t)1) << cParams.hashLog;
-	U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
-	size_t const h3Size = ((size_t)1) << hashLog3;
-	size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-
-	size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
-						  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-	size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
-							 + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-
-	return sizeof(ZSTD_CCtx) + neededSpace;
-}
-
-
 static U32 ZSTD_equivalentParams(ZSTD_parameters param1, ZSTD_parameters param2)
 {
 	return (param1.cParams.hashLog  == param2.cParams.hashLog)
@@ -795,7 +772,6 @@ _check_compressibility:
 
 #if 0 /* for debug */
 #  define STORESEQ_DEBUG
-#include <stdio.h>   /* fprintf */
 U32 g_startDebug = 0;
 const BYTE* g_start = NULL;
 #endif
@@ -2770,37 +2746,15 @@ static size_t ZSTD_compress_internal (ZSTD_CCtx* cctx,
 	return ZSTD_compressEnd(cctx, dst,  dstCapacity, src, srcSize);
 }
 
-size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-							   void* dst, size_t dstCapacity,
-						 const void* src, size_t srcSize,
-						 const void* dict,size_t dictSize,
-							   ZSTD_parameters params)
+size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void* dict, size_t dictSize, ZSTD_parameters params)
 {
-	CHECK_F(ZSTD_checkCParams(params.cParams));
 	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
 }
 
-size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void* dict, size_t dictSize, int compressionLevel)
-{
-	ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, dict ? dictSize : 0);
-	params.fParams.contentSizeFlag = 1;
-	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
-}
 
-size_t ZSTD_compressCCtx (ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
+size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, ZSTD_parameters params)
 {
-	return ZSTD_compress_usingDict(ctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
-}
-
-size_t ZSTD_compress(void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
-{
-	size_t result;
-	ZSTD_CCtx ctxBody;
-	memset(&ctxBody, 0, sizeof(ctxBody));
-	memcpy(&ctxBody.customMem, &defaultCustomMem, sizeof(ZSTD_customMem));
-	result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
-	ZSTD_free(ctxBody.workSpace, defaultCustomMem);  /* can't free ctxBody itself, as it's on stack; free only heap content */
-	return result;
+	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, NULL, 0, params);
 }
 
 
@@ -2813,16 +2767,14 @@ struct ZSTD_CDict_s {
 	ZSTD_CCtx* refContext;
 };  /* typedef'd tp ZSTD_CDict within "zstd.h" */
 
-size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
+size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams)
 {
-	if (cdict==NULL) return 0;   /* support sizeof on NULL */
-	return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
+	return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CDict));
 }
 
-ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
-									  ZSTD_parameters params, ZSTD_customMem customMem)
+static ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
+											 ZSTD_parameters params, ZSTD_customMem customMem)
 {
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
 	{   ZSTD_CDict* const cdict = (ZSTD_CDict*) ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
@@ -2859,20 +2811,10 @@ ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, u
 	}
 }
 
-ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
+ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize)
 {
-	ZSTD_customMem const allocator = { NULL, NULL, NULL };
-	ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-	params.fParams.contentSizeFlag = 1;
-	return ZSTD_createCDict_advanced(dict, dictSize, 0, params, allocator);
-}
-
-ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
-{
-	ZSTD_customMem const allocator = { NULL, NULL, NULL };
-	ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-	params.fParams.contentSizeFlag = 1;
-	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, allocator);
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, stackMem);
 }
 
 size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
@@ -2951,16 +2893,19 @@ struct ZSTD_CStream_s {
 	ZSTD_customMem customMem;
 };   /* typedef'd to ZSTD_CStream within "zstd.h" */
 
-ZSTD_CStream* ZSTD_createCStream(void)
+size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams)
 {
-	return ZSTD_createCStream_advanced(defaultCustomMem);
+	size_t const inBuffSize = (size_t)1 << cParams.windowLog;
+	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, inBuffSize);
+	size_t const outBuffSize = ZSTD_compressBound(blockSize) + 1;
+
+	return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
 }
 
 ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
 {
 	ZSTD_CStream* zcs;
 
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
 	zcs = (ZSTD_CStream*)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
@@ -2972,6 +2917,12 @@ ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
 	return zcs;
 }
 
+ZSTD_CStream* ZSTD_createCStream(void* workspace, size_t workspaceSize)
+{
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createCStream_advanced(stackMem);
+}
+
 size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
 {
 	if (zcs==NULL) return 0;   /* support free on NULL */
@@ -3021,7 +2972,7 @@ size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
-size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
+static size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
 								 const void* dict, size_t dictSize,
 								 ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
@@ -3056,39 +3007,19 @@ size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
 }
 
 /* note : cdict must outlive compression session */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
 {
-	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-	size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
+	size_t const initError = ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
 	zcs->cdict = cdict;
 	zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
 	return initError;
 }
 
-size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
+size_t ZSTD_initCStream(ZSTD_CStream* zcs, ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
-	ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-	return ZSTD_initCStream_advanced(zcs, dict, dictSize, params, 0);
-}
-
-size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize)
-{
-	ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
-	if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
 	return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
 }
 
-size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
-{
-	return ZSTD_initCStream_usingDict(zcs, NULL, 0, compressionLevel);
-}
-
-size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)
-{
-	if (zcs==NULL) return 0;   /* support sizeof on NULL */
-	return sizeof(*zcs) + ZSTD_sizeof_CCtx(zcs->cctx) + ZSTD_sizeof_CDict(zcs->cdictLocal) + zcs->outBuffSize + zcs->inBuffSize;
-}
-
 /*======   Compression   ======*/
 
 typedef enum { zsf_gather, zsf_flush, zsf_end } ZSTD_flush_e;
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 10700257b..0d512e8f6 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -90,9 +90,10 @@ struct ZSTD_DCtx_s
 	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
 };  /* typedef'd to ZSTD_DCtx within "zstd.h" */
 
-size_t ZSTD_sizeof_DCtx (const ZSTD_DCtx* dctx) { return (dctx==NULL) ? 0 : sizeof(ZSTD_DCtx); }
-
-size_t ZSTD_estimateDCtxSize(void) { return sizeof(ZSTD_DCtx); }
+size_t ZSTD_DCtxWorkspaceBound(void)
+{
+	return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DCtx));
+}
 
 size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx)
 {
@@ -118,7 +119,6 @@ ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
 {
 	ZSTD_DCtx* dctx;
 
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
 	dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
@@ -128,9 +128,10 @@ ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
 	return dctx;
 }
 
-ZSTD_DCtx* ZSTD_createDCtx(void)
+ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize)
 {
-	return ZSTD_createDCtx_advanced(defaultCustomMem);
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createDCtx_advanced(stackMem);
 }
 
 size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx)
@@ -354,20 +355,6 @@ unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize)
 	}
 }
 
-/** ZSTD_getDecompressedSize() :
-*   compatible with legacy mode
-*   @return : decompressed size if known, 0 otherwise
-			  note : 0 can mean any of the following :
-				   - decompressed size is not present within frame header
-				   - frame header unknown / not supported
-				   - frame header not complete (`srcSize` too small) */
-unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
-{
-	unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-	return ret >= ZSTD_CONTENTSIZE_ERROR ? 0 : ret;
-}
-
-
 /** ZSTD_decodeFrameHeader() :
 *   `headerSize` must be the size provided by ZSTD_frameHeaderSize().
 *   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
@@ -1620,10 +1607,7 @@ static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
 	return (BYTE*)dst - (BYTE*)dststart;
 }
 
-size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-								 void* dst, size_t dstCapacity,
-						   const void* src, size_t srcSize,
-						   const void* dict, size_t dictSize)
+size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize)
 {
 	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
 }
@@ -1635,13 +1619,6 @@ size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const
 }
 
 
-size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-	ZSTD_DCtx dctx;
-	return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
-}
-
-
 /*-**************************************
 *   Advanced Streaming Decompression API
 *   Bufferless and synchronous
@@ -1900,6 +1877,11 @@ struct ZSTD_DDict_s {
 	ZSTD_customMem cMem;
 };  /* typedef'd to ZSTD_DDict within "zstd.h" */
 
+size_t ZSTD_DDictWorkspaceBound(void)
+{
+	return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DDict));
+}
+
 static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict)
 {
 	return ddict->dictContent;
@@ -1953,9 +1935,8 @@ static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict* ddict)
 }
 
 
-ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
+static ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
 {
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
 	{   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
@@ -1989,21 +1970,10 @@ ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, unsigne
 *   Create a digested dictionary, to start decompression without startup delay.
 *   `dict` content is copied inside DDict.
 *   Consequently, `dict` can be released after `ZSTD_DDict` creation */
-ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
+ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize, void* workspace, size_t workspaceSize)
 {
-	ZSTD_customMem const allocator = { NULL, NULL, NULL };
-	return ZSTD_createDDict_advanced(dict, dictSize, 0, allocator);
-}
-
-
-/*! ZSTD_createDDict_byReference() :
- *  Create a digested dictionary, to start decompression without startup delay.
- *  Dictionary content is simply referenced, it will be accessed during decompression.
- *  Warning : dictBuffer must outlive DDict (DDict must be freed before dictBuffer) */
-ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize)
-{
-	ZSTD_customMem const allocator = { NULL, NULL, NULL };
-	return ZSTD_createDDict_advanced(dictBuffer, dictSize, 1, allocator);
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createDDict_advanced(dict, dictSize, 1, stackMem);
 }
 
 
@@ -2017,12 +1987,6 @@ size_t ZSTD_freeDDict(ZSTD_DDict* ddict)
 	}
 }
 
-size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
-{
-	if (ddict==NULL) return 0;   /* support sizeof on NULL */
-	return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
-}
-
 /*! ZSTD_getDictID_fromDict() :
  *  Provides the dictID stored within dictionary.
  *  if @return == 0, the dictionary is not conformant with Zstandard specification.
@@ -2110,17 +2074,17 @@ struct ZSTD_DStream_s {
 	U32 hostageByte;
 };   /* typedef'd to ZSTD_DStream within "zstd.h" */
 
-
-ZSTD_DStream* ZSTD_createDStream(void)
-{
-	return ZSTD_createDStream_advanced(defaultCustomMem);
+size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize) {
+	size_t const blockSize = MIN(maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
+	size_t const inBuffSize = blockSize;
+	size_t const outBuffSize = maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
+	return ZSTD_DCtxWorkspaceBound() + ZSTD_ALIGN(sizeof(ZSTD_DStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
 }
 
-ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
+static ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
 {
 	ZSTD_DStream* zds;
 
-	if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
 	if (!customMem.customAlloc || !customMem.customFree) return NULL;
 
 	zds = (ZSTD_DStream*) ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
@@ -2134,6 +2098,12 @@ ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
 	return zds;
 }
 
+ZSTD_DStream* ZSTD_createDStream(void* workspace, size_t workspaceSize)
+{
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	return ZSTD_createDStream_advanced(stackMem);
+}
+
 size_t ZSTD_freeDStream(ZSTD_DStream* zds)
 {
 	if (zds==NULL) return 0;   /* support free on null */
@@ -2157,29 +2127,22 @@ size_t ZSTD_freeDStream(ZSTD_DStream* zds)
 size_t ZSTD_DStreamInSize(void)  { return ZSTD_BLOCKSIZE_ABSOLUTEMAX + ZSTD_blockHeaderSize; }
 size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
 
-size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize)
+size_t ZSTD_initDStream(ZSTD_DStream* zds, size_t maxWindowSize)
 {
+	zds->maxWindowSize = maxWindowSize;
 	zds->stage = zdss_loadHeader;
 	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
 	ZSTD_freeDDict(zds->ddictLocal);
-	if (dict && dictSize >= 8) {
-		zds->ddictLocal = ZSTD_createDDict(dict, dictSize);
-		if (zds->ddictLocal == NULL) return ERROR(memory_allocation);
-	} else zds->ddictLocal = NULL;
+	zds->ddictLocal = NULL;
 	zds->ddict = zds->ddictLocal;
 	zds->legacyVersion = 0;
 	zds->hostageByte = 0;
 	return ZSTD_frameHeaderSize_prefix;
 }
 
-size_t ZSTD_initDStream(ZSTD_DStream* zds)
+size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, size_t maxWindowSize, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
 {
-	return ZSTD_initDStream_usingDict(zds, NULL, 0);
-}
-
-size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
-{
-	size_t const initResult = ZSTD_initDStream(zds);
+	size_t const initResult = ZSTD_initDStream(zds, maxWindowSize);
 	zds->ddict = ddict;
 	return initResult;
 }
@@ -2193,25 +2156,6 @@ size_t ZSTD_resetDStream(ZSTD_DStream* zds)
 	return ZSTD_frameHeaderSize_prefix;
 }
 
-size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds,
-								ZSTD_DStreamParameter_e paramType, unsigned paramValue)
-{
-	switch(paramType)
-	{
-		default : return ERROR(parameter_unknown);
-		case DStream_p_maxWindowSize : zds->maxWindowSize = paramValue ? paramValue : (U32)(-1); break;
-	}
-	return 0;
-}
-
-
-size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
-{
-	if (zds==NULL) return 0;   /* support sizeof on NULL */
-	return sizeof(*zds) + ZSTD_sizeof_DCtx(zds->dctx) + ZSTD_sizeof_DDict(zds->ddictLocal) + zds->inBuffSize + zds->outBuffSize;
-}
-
-
 /* *****   Decompression   ***** */
 
 MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
diff --git a/contrib/linux-kernel/lib/zstd_errors.h b/contrib/linux-kernel/lib/zstd_errors.h
deleted file mode 100644
index 37e491b7e..000000000
--- a/contrib/linux-kernel/lib/zstd_errors.h
+++ /dev/null
@@ -1,55 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of this source tree. An additional grant
- * of patent rights can be found in the PATENTS file in the same directory.
- */
-
-#ifndef ZSTD_ERRORS_H_398273423
-#define ZSTD_ERRORS_H_398273423
-
-/*===== dependency =====*/
-#include <linux/types.h>   /* size_t */
-
-
-/* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */
-#define ZSTDERRORLIB_API
-
-/*-****************************************
-*  error codes list
-******************************************/
-typedef enum {
-  ZSTD_error_no_error,
-  ZSTD_error_GENERIC,
-  ZSTD_error_prefix_unknown,
-  ZSTD_error_version_unsupported,
-  ZSTD_error_parameter_unknown,
-  ZSTD_error_frameParameter_unsupported,
-  ZSTD_error_frameParameter_unsupportedBy32bits,
-  ZSTD_error_frameParameter_windowTooLarge,
-  ZSTD_error_compressionParameter_unsupported,
-  ZSTD_error_init_missing,
-  ZSTD_error_memory_allocation,
-  ZSTD_error_stage_wrong,
-  ZSTD_error_dstSize_tooSmall,
-  ZSTD_error_srcSize_wrong,
-  ZSTD_error_corruption_detected,
-  ZSTD_error_checksum_wrong,
-  ZSTD_error_tableLog_tooLarge,
-  ZSTD_error_maxSymbolValue_tooLarge,
-  ZSTD_error_maxSymbolValue_tooSmall,
-  ZSTD_error_dictionary_corrupted,
-  ZSTD_error_dictionary_wrong,
-  ZSTD_error_dictionaryCreation_failed,
-  ZSTD_error_maxCode
-} ZSTD_ErrorCode;
-
-/*! ZSTD_getErrorCode() :
-	convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
-	which can be used to compare directly with enum list published into "error_public.h" */
-ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
-ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);
-
-#endif /* ZSTD_ERRORS_H_398273423 */
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index 57ae77390..b7dcc03e0 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -13,13 +13,15 @@
 /*-*******************************************************
 *  Compiler specifics
 *********************************************************/
-#define FORCE_INLINE static __attribute__((always_inline))
-#define FORCE_NOINLINE static __attribute__((__noinline__))
+#define FORCE_INLINE static __always_inline
+#define FORCE_NOINLINE static noinline
 
 
 /*-*************************************
 *  Dependencies
 ***************************************/
+#include <linux/compiler.h>
+#include <linux/kernel.h>
 #include "mem.h"
 #include "error_private.h"
 #include "zstd.h"
@@ -207,25 +209,35 @@ const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx);
 void ZSTD_seqToCodes(const seqStore_t* seqStorePtr);
 int ZSTD_isSkipFrame(ZSTD_DCtx* dctx);
 
-/* custom memory allocation functions */
-void* ZSTD_defaultAllocFunction(void* opaque, size_t size);
-void ZSTD_defaultFreeFunction(void* opaque, void* address);
-#ifndef ZSTD_DLL_IMPORT
-static const ZSTD_customMem defaultCustomMem = { ZSTD_defaultAllocFunction, ZSTD_defaultFreeFunction, NULL };
-#endif
+/*= Custom memory allocation functions */
+typedef void* (*ZSTD_allocFunction) (void* opaque, size_t size);
+typedef void  (*ZSTD_freeFunction) (void* opaque, void* address);
+typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;
+
 void* ZSTD_malloc(size_t size, ZSTD_customMem customMem);
 void ZSTD_free(void* ptr, ZSTD_customMem customMem);
 
+/*====== stack allocation  ======*/
+
+typedef struct {
+	void* ptr;
+	const void* end;
+} ZSTD_stack;
+
+#define ZSTD_ALIGN(x) ALIGN(x, sizeof(size_t))
+#define ZSTD_PTR_ALIGN(p) PTR_ALIGN(p, sizeof(size_t))
+
+ZSTD_customMem ZSTD_initStack(void* workspace, size_t workspaceSize);
+
+void* ZSTD_stackAlloc(void* opaque, size_t size);
+void ZSTD_stackFree(void* opaque, void* address);
+
 
 /*======  common function  ======*/
 
 MEM_STATIC U32 ZSTD_highbit32(U32 val)
 {
-#   if defined(_MSC_VER)   /* Visual */
-	unsigned long r=0;
-	_BitScanReverse(&r, val);
-	return (unsigned)r;
-#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* GCC Intrinsic */
+#   if defined(__GNUC__) && (__GNUC__ >= 3)   /* GCC Intrinsic */
 	return 31 - __builtin_clz(val);
 #   else   /* Software version */
 	static const int DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
@@ -250,5 +262,12 @@ MEM_STATIC U32 ZSTD_highbit32(U32 val)
  *        do not use with extDict variant ! */
 void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx);
 
+size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx);
+size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx);
+size_t ZSTD_freeCDict(ZSTD_CDict* cdict);
+size_t ZSTD_freeDDict(ZSTD_DDict* cdict);
+size_t ZSTD_freeCStream(ZSTD_CStream* zcs);
+size_t ZSTD_freeDStream(ZSTD_DStream* zds);
+
 
 #endif   /* ZSTD_CCOMMON_H_MODULE */

From 30c76989704975b3fe7f3561d751a5ba24d838e8 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 31 Mar 2017 18:27:03 -0700
Subject: [PATCH 096/255] optimize ZSTDMT_compress() memory usage

does no longer allocate temporary buffers
when there is enough room in dstBuffer to decompress directly there.
(previous method would skip that for 1st chunk only).

Also : fix ZSTD_compressBound() for small srcSize
---
 lib/compress/zstd_compress.c   |  3 ++-
 lib/compress/zstdmt_compress.c | 19 ++++++++++++-------
 tests/zstreamtest.c            |  5 +++--
 3 files changed, 17 insertions(+), 10 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index cc69f1184..e1c734927 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -33,7 +33,8 @@ typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZS
 ***************************************/
 #define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
 size_t ZSTD_compressBound(size_t srcSize) {
-    size_t const margin = (srcSize < 512 KB) ? 16 : 0;
+    size_t const lowLimit = 256 KB;
+    size_t const margin = (srcSize < lowLimit) ? (lowLimit-srcSize) >> 12 : 0;  /* from 64 to 0 */
     return srcSize + (srcSize >> 8) + margin;
 }
 
diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 09a965478..c9c3e8533 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -33,7 +33,7 @@
 #  include <stdio.h>
 #  include <unistd.h>
 #  include <sys/times.h>
-   static unsigned g_debugLevel = 2;
+   static unsigned g_debugLevel = 5;
 #  define DEBUGLOGRAW(l, ...) if (l<=g_debugLevel) { fprintf(stderr, __VA_ARGS__); }
 #  define DEBUGLOG(l, ...) if (l<=g_debugLevel) { fprintf(stderr, __FILE__ ": "); fprintf(stderr, __VA_ARGS__); fprintf(stderr, " \n"); }
 
@@ -253,6 +253,7 @@ void ZSTDMT_compressChunk(void* jobDescription)
                  ZSTD_compressContinue(job->cctx, dstBuff.start, dstBuff.size, src, job->srcSize);
     DEBUGLOG(3, "compressed %u bytes into %u bytes   (first:%u) (last:%u)",
                 (unsigned)job->srcSize, (unsigned)job->cSize, job->firstChunk, job->lastChunk);
+    DEBUGLOG(5, "dstBuff.size : %u ; => %s", (U32)dstBuff.size, ZSTD_getErrorName(job->cSize));
 
 _endJob:
     PTHREAD_MUTEX_LOCK(job->jobCompleted_mutex);
@@ -399,7 +400,8 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
     size_t const avgChunkSize = ((proposedChunkSize & 0x1FFFF) < 0xFFFF) ? proposedChunkSize + 0xFFFF : proposedChunkSize;   /* avoid too small last block */
     size_t remainingSrcSize = srcSize;
     const char* const srcStart = (const char*)src;
-    size_t frameStartPos = 0;
+    unsigned const compressWithinDst = (dstCapacity >= ZSTD_compressBound(srcSize)) ? nbChunks : (unsigned)(dstCapacity / ZSTD_compressBound(avgChunkSize));  /* presumes avgChunkSize >= 256 KB, which should be the case */
+    size_t frameStartPos = 0, dstBufferPos = 0;
 
     DEBUGLOG(3, "windowLog : %2u => chunkTargetSize : %u bytes  ", params.cParams.windowLog, (U32)chunkTargetSize);
     DEBUGLOG(2, "nbChunks  : %2u   (chunkSize : %u bytes)   ", nbChunks, (U32)avgChunkSize);
@@ -413,9 +415,9 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
     {   unsigned u;
         for (u=0; u<nbChunks; u++) {
             size_t const chunkSize = MIN(remainingSrcSize, avgChunkSize);
-            size_t const dstBufferCapacity = u ? ZSTD_compressBound(chunkSize) : dstCapacity;
-            buffer_t const dstAsBuffer = { dst, dstCapacity };
-            buffer_t const dstBuffer = u ? ZSTDMT_getBuffer(mtctx->buffPool, dstBufferCapacity) : dstAsBuffer;
+            size_t const dstBufferCapacity = ZSTD_compressBound(chunkSize);
+            buffer_t const dstAsBuffer = { (char*)dst + dstBufferPos, dstBufferCapacity };
+            buffer_t const dstBuffer = u < compressWithinDst ? dstAsBuffer : ZSTDMT_getBuffer(mtctx->buffPool, dstBufferCapacity);
             ZSTD_CCtx* const cctx = ZSTDMT_getCCtx(mtctx->cctxPool);
             size_t dictSize = u ? overlapSize : 0;
 
@@ -444,6 +446,7 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
             POOL_add(mtctx->factory, ZSTDMT_compressChunk, &mtctx->jobs[u]);
 
             frameStartPos += chunkSize;
+            dstBufferPos += dstBufferCapacity;
             remainingSrcSize -= chunkSize;
     }   }
     /* note : since nbChunks <= nbThreads, all jobs should be running immediately in parallel */
@@ -467,8 +470,10 @@ size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
                 if (ZSTD_isError(cSize)) error = cSize;
                 if ((!error) && (dstPos + cSize > dstCapacity)) error = ERROR(dstSize_tooSmall);
                 if (chunkID) {   /* note : chunk 0 is already written directly into dst */
-                    if (!error) memcpy((char*)dst + dstPos, mtctx->jobs[chunkID].dstBuff.start, cSize);
-                    ZSTDMT_releaseBuffer(mtctx->buffPool, mtctx->jobs[chunkID].dstBuff);
+                    if (!error)
+                        memmove((char*)dst + dstPos, mtctx->jobs[chunkID].dstBuff.start, cSize);  /* may overlap if chunk decompressed within dst */
+                    if (chunkID >= compressWithinDst)   /* otherwise, it decompresses within dst */
+                        ZSTDMT_releaseBuffer(mtctx->buffPool, mtctx->jobs[chunkID].dstBuff);
                     mtctx->jobs[chunkID].dstBuff = g_nullBuffer;
                 }
                 dstPos += cSize ;
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 370859ca9..10bcbe0cd 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -856,6 +856,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
         /* some issues can only happen when reusing states */
         if ((FUZ_rand(&lseed) & 0xFF) == 131) {
             U32 const nbThreads = (FUZ_rand(&lseed) % 6) + 1;
+            DISPLAYLEVEL(5, "Creating new context with %u threads \n", nbThreads);
             ZSTDMT_freeCCtx(zc);
             zc = ZSTDMT_createCCtx(nbThreads);
             resetAllowed=0;
@@ -946,7 +947,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                     outBuff.size = outBuff.pos + adjustedDstSize;
                     DISPLAYLEVEL(5, "Flushing into dst buffer of size %u \n", (U32)adjustedDstSize);
                     {   size_t const flushError = ZSTDMT_flushStream(zc, &outBuff);
-                        CHECK (ZSTD_isError(flushError), "flush error : %s", ZSTD_getErrorName(flushError));
+                        CHECK (ZSTD_isError(flushError), "ZSTDMT_flushStream error : %s", ZSTD_getErrorName(flushError));
             }   }   }
 
             /* final frame epilogue */
@@ -957,7 +958,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                     outBuff.size = outBuff.pos + adjustedDstSize;
                     DISPLAYLEVEL(5, "Ending into dst buffer of size %u \n", (U32)adjustedDstSize);
                     remainingToFlush = ZSTDMT_endStream(zc, &outBuff);
-                    CHECK (ZSTD_isError(remainingToFlush), "flush error : %s", ZSTD_getErrorName(remainingToFlush));
+                    CHECK (ZSTD_isError(remainingToFlush), "ZSTDMT_endStream error : %s", ZSTD_getErrorName(remainingToFlush));
                     DISPLAYLEVEL(5, "endStream : remainingToFlush : %u \n", (U32)remainingToFlush);
             }   }
             DISPLAYLEVEL(5, "Frame completed \n");

From 805c5a3efbc22ef7735f009730aff8c3f95b6b86 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Sat, 1 Apr 2017 00:36:31 -0700
Subject: [PATCH 097/255] updated documentation on multithreading modes

---
 programs/zstd.1    | 20 +++++++++++++++++---
 programs/zstd.1.md | 30 ++++++++++++++++++++++++++++--
 programs/zstdcli.c | 16 ++++++++--------
 3 files changed, 53 insertions(+), 13 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index 8b418a0ee..3b0064993 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -1,5 +1,5 @@
 .
-.TH "ZSTD" "1" "March 2017" "zstd 1.1.5" "User Commands"
+.TH "ZSTD" "1" "April 2017" "zstd 1.1.5" "User Commands"
 .
 .SH "NAME"
 \fBzstd\fR \- zstd, unzstd, zstdcat \- Compress or decompress \.zst files
@@ -97,6 +97,10 @@ Use FILEs as a training set to create a dictionary\. The training set should con
 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
+\fB\-T#\fR
+Compress using # threads (default: 1)\. This modifier is only available if \fBzstd\fR was compiled with multithreading support\.
+.
+.TP
 \fB\-D file\fR
 use \fBfile\fR as Dictionary to compress or decompress FILE(s)
 .
@@ -126,7 +130,7 @@ remove source file(s) after successful compression or decompression
 .
 .TP
 \fB\-k\fR, \fB\-\-keep\fR
-keep source file(s) after successful compression or decompression\. This is the default behaviour\.
+keep source file(s) after successful compression or decompression\. This is the default behavior\.
 .
 .TP
 \fB\-r\fR
@@ -150,7 +154,7 @@ suppress warnings, interactivity, and notifications\. specify twice to suppress
 .
 .TP
 \fB\-C\fR, \fB\-\-[no\-]check\fR
-add integrety check computed from uncompressed data (default : enabled)
+add integrity check computed from uncompressed data (default : enabled)
 .
 .TP
 \fB\-\-\fR
@@ -226,6 +230,9 @@ set process priority to real\-time
 .
 .SH "ADVANCED COMPRESSION OPTIONS"
 .
+.SS "\-B#:"
+Select the size of each compression job\. This parameter is available only when multi\-threading is enabled\. Default value is \fB4 * windowSize\fR, which means it varies depending on compression level\. \fB\-B#\fR makes it possible to select a custom value\. Note that job size must respect a minimum value which is enforced transparently\. This minimum is either 1 MB, or \fBoverlapSize\fR, whichever is largest\.
+.
 .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:
 .
@@ -293,6 +300,13 @@ A larger minimum match length usually improves compression ratio but decreases c
 .IP
 The minimum \fItlen\fR is 4 and the maximum is 999\.
 .
+.TP
+\fBoverlapLog\fR=\fIovlog\fR, \fBovlog\fR=\fIovlog\fR
+Select the amount of data reloaded from previous job into next one\. Reloading more data improves compression ratio, but decreases speed\. This parameter is only available if multithreading is enabled\.
+.
+.IP
+The minimum \fIovlog\fR is 0, and the maximum is 9\. 0 means "no overlap", hence completely independent jobs\. 9 means "full overlap", meaning up to \fBwindowSize\fR is reloaded from previous job\. Reducing \fIovlog\fR by 1 reduces the amount of reload by a factor 2\. Default \fIovlog\fR is 6, which means "reload \fBwindowSize / 8\fR"\. Exception : the maximum compression level (22) has a default \fIovlog\fR of 9\.
+.
 .SS "Example"
 The following parameters sets advanced compression options to those of predefined level 19 for files bigger than 256 KB:
 .
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index d1161a522..f8ef513ea 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -99,6 +99,9 @@ the last one takes effect.
 * `--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.
+* `-T#`:
+    Compress using # threads (default: 1).
+    This modifier is only available if `zstd` was compiled with multithreading support.
 * `-D file`:
     use `file` as Dictionary to compress or decompress FILE(s)
 * `--nodictID`:
@@ -123,7 +126,7 @@ the last one takes effect.
     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.
+    This is the default behavior.
 * `-r`:
     operate recursively on dictionaries
 * `-h`/`-H`, `--help`:
@@ -136,10 +139,11 @@ the last one takes effect.
     suppress warnings, interactivity, and notifications.
     specify twice to suppress errors too.
 * `-C`, `--[no-]check`:
-    add integrety check computed from uncompressed data (default : enabled)
+    add integrity check computed from uncompressed data (default : enabled)
 * `--`:
     All arguments after `--` are treated as files
 
+
 DICTIONARY BUILDER
 ------------------
 `zstd` offers _dictionary_ compression,
@@ -218,8 +222,17 @@ BENCHMARK
 * `--priority=rt`:
     set process priority to real-time
 
+
 ADVANCED COMPRESSION OPTIONS
 ----------------------------
+### -B#:
+Select the size of each compression job.
+This parameter is available only when multi-threading is enabled.
+Default value is `4 * windowSize`, which means it varies depending on compression level.
+`-B#` makes it possible to select a custom value.
+Note that job size must respect a minimum value which is enforced transparently.
+This minimum is either 1 MB, or `overlapSize`, whichever is largest.
+
 ### --zstd[=options]:
 `zstd` provides 22 predefined compression levels.
 The selected or default predefined compression level can be changed with
@@ -290,6 +303,19 @@ The list of available _options_:
 
     The minimum _tlen_ is 4 and the maximum is 999.
 
+- `overlapLog`=_ovlog_,  `ovlog`=_ovlog_:
+    Select the amount of data reloaded from previous job into next one.
+    Reloading more data improves compression ratio, but decreases speed.
+    This parameter is only available if multithreading is enabled.
+
+    The minimum _ovlog_ is 0, and the maximum is 9.
+    0 means "no overlap", hence completely independent jobs.
+    9 means "full overlap", meaning up to `windowSize` is reloaded from previous job.
+    Reducing _ovlog_ by 1 reduces the amount of reload by a factor 2.
+    Default _ovlog_ is 6, which means "reload `windowSize / 8`".
+    Exception : the maximum compression level (22) has a default _ovlog_ of 9.
+
+
 ### Example
 The following parameters sets advanced compression options to those of
 predefined level 19 for files bigger than 256 KB:
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 0cf8cacd1..18e259c74 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -113,19 +113,20 @@ static int usage_advanced(const char* programName)
     DISPLAY( "\n");
     DISPLAY( "Advanced arguments :\n");
     DISPLAY( " -V     : display Version number and exit\n");
-    DISPLAY( " -v     : verbose mode; specify multiple times to increase log level (default:%d)\n", DEFAULT_DISPLAY_LEVEL);
+    DISPLAY( " -v     : verbose mode; specify multiple times to increase verbosity\n");
     DISPLAY( " -q     : suppress warnings; specify twice to suppress errors too\n");
     DISPLAY( " -c     : force write to standard output, even if it is the console\n");
-#ifdef UTIL_HAS_CREATEFILELIST
-    DISPLAY( " -r     : operate recursively on directories \n");
-#endif
 #ifndef ZSTD_NOCOMPRESS
     DISPLAY( "--ultra : enable levels beyond %i, up to %i (requires more memory)\n", ZSTDCLI_CLEVEL_MAX, ZSTD_maxCLevel());
-    DISPLAY( "--no-dictID : don't write dictID into header (dictionary compression)\n");
-    DISPLAY( "--[no-]check : integrity check (default:enabled) \n");
 #ifdef ZSTD_MULTITHREAD
     DISPLAY( " -T#    : use # threads for compression (default:1) \n");
-    DISPLAY( " -B#    : select size of independent sections (default:0==automatic) \n");
+    DISPLAY( " -B#    : select size of each job (default:0==automatic) \n");
+#endif
+    DISPLAY( "--no-dictID : don't write dictID into header (dictionary compression)\n");
+    DISPLAY( "--[no-]check : integrity check (default:enabled) \n");
+#endif
+#ifdef UTIL_HAS_CREATEFILELIST
+    DISPLAY( " -r     : operate recursively on directories \n");
 #endif
 #ifdef ZSTD_GZCOMPRESS
     DISPLAY( "--format=gzip : compress files to the .gz format \n");
@@ -134,7 +135,6 @@ static int usage_advanced(const char* programName)
     DISPLAY( "--format=xz : compress files to the .xz format \n");
     DISPLAY( "--format=lzma : compress files to the .lzma format \n");
 #endif
-#endif
 #ifndef ZSTD_NODECOMPRESS
     DISPLAY( "--test  : test compressed file integrity \n");
 #if ZSTD_SPARSE_DEFAULT

From a36330a27dc966533cf221b3dc701c4243eed5eb Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 3 Apr 2017 14:57:24 -0700
Subject: [PATCH 098/255] minor man update, for `overlapSize`

---
 programs/zstd.1    | 2 +-
 programs/zstd.1.md | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index 3b0064993..c6b2c2742 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -302,7 +302,7 @@ The minimum \fItlen\fR is 4 and the maximum is 999\.
 .
 .TP
 \fBoverlapLog\fR=\fIovlog\fR, \fBovlog\fR=\fIovlog\fR
-Select the amount of data reloaded from previous job into next one\. Reloading more data improves compression ratio, but decreases speed\. This parameter is only available if multithreading is enabled\.
+Determine \fBoverlapSize\fR, amount of data reloaded from previous job\. This parameter is only available when multithreading is enabled\. Reloading more data improves compression ratio, but decreases speed\.
 .
 .IP
 The minimum \fIovlog\fR is 0, and the maximum is 9\. 0 means "no overlap", hence completely independent jobs\. 9 means "full overlap", meaning up to \fBwindowSize\fR is reloaded from previous job\. Reducing \fIovlog\fR by 1 reduces the amount of reload by a factor 2\. Default \fIovlog\fR is 6, which means "reload \fBwindowSize / 8\fR"\. Exception : the maximum compression level (22) has a default \fIovlog\fR of 9\.
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index f8ef513ea..07c36f683 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -304,9 +304,9 @@ The list of available _options_:
     The minimum _tlen_ is 4 and the maximum is 999.
 
 - `overlapLog`=_ovlog_,  `ovlog`=_ovlog_:
-    Select the amount of data reloaded from previous job into next one.
+    Determine `overlapSize`, amount of data reloaded from previous job.
+    This parameter is only available when multithreading is enabled.
     Reloading more data improves compression ratio, but decreases speed.
-    This parameter is only available if multithreading is enabled.
 
     The minimum _ovlog_ is 0, and the maximum is 9.
     0 means "no overlap", hence completely independent jobs.

From 59aadc85dc868cd918b3eba94dba5c65b1a4f7bc Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 3 Apr 2017 15:23:09 -0700
Subject: [PATCH 099/255] Preallocate workSpace for cctx and combine create and
 init for cstream

---
 contrib/linux-kernel/include/zstd.h        | 10 ++---
 contrib/linux-kernel/lib/zstd_common.c     |  6 +++
 contrib/linux-kernel/lib/zstd_compress.c   | 35 +++++++++--------
 contrib/linux-kernel/lib/zstd_decompress.c | 44 +++++++++++-----------
 contrib/linux-kernel/lib/zstd_internal.h   |  1 +
 5 files changed, 53 insertions(+), 43 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index 6594521d6..fde751271 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -256,9 +256,8 @@ size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 
 typedef struct ZSTD_CStream_s ZSTD_CStream;
 /*===== ZSTD_CStream management functions =====*/
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void* workspace, size_t workspaceSize);
-ZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, ZSTD_parameters params, unsigned long long pledgedSrcSize);
-ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize);
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_usingCDict(ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
 
 /*===== Streaming compression functions =====*/
 ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
@@ -295,9 +294,8 @@ ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output
 
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
-ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void* workspace, size_t workspaceSize);
-ZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds, size_t maxWindowSize);
-ZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, size_t maxWindowSize, const ZSTD_DDict* ddict);
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize);
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize);
 
 /*===== Streaming decompression functions =====*/
 ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index c62cbd365..ca9382c67 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -48,6 +48,12 @@ ZSTD_customMem ZSTD_initStack(void* workspace, size_t workspaceSize) {
 	return stackMem;
 }
 
+void* ZSTD_stackAllocAll(void* opaque, size_t* size) {
+	ZSTD_stack* stack = (ZSTD_stack*)opaque;
+	*size = stack->end - ZSTD_PTR_ALIGN(stack->ptr);
+	return stack_push(stack, *size);
+}
+
 void* ZSTD_stackAlloc(void* opaque, size_t size) {
 	ZSTD_stack* stack = (ZSTD_stack*)opaque;
 	return stack_push(stack, size);
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index df258c636..f91f9f016 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -115,7 +115,11 @@ static ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
 ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createCCtx_advanced(stackMem);
+	ZSTD_CCtx* cctx = ZSTD_createCCtx_advanced(stackMem);
+	if (cctx) {
+		cctx->workSpace = ZSTD_stackAllocAll(cctx->customMem.opaque, &cctx->workSpaceSize);
+	}
+	return cctx;
 }
 
 size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
@@ -2917,12 +2921,6 @@ ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
 	return zcs;
 }
 
-ZSTD_CStream* ZSTD_createCStream(void* workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createCStream_advanced(stackMem);
-}
-
 size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
 {
 	if (zcs==NULL) return 0;   /* support free on NULL */
@@ -3006,18 +3004,25 @@ static size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
 	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
-/* note : cdict must outlive compression session */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
+ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
 {
-	size_t const initError = ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
-	zcs->cdict = cdict;
-	zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
-	return initError;
+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
+	ZSTD_CStream* const zcs = ZSTD_createCStream_advanced(stackMem);
+	if (zcs) {
+		size_t const code = ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
+		if (ZSTD_isError(code)) { return NULL; }
+	}
+	return zcs;
 }
 
-size_t ZSTD_initCStream(ZSTD_CStream* zcs, ZSTD_parameters params, unsigned long long pledgedSrcSize)
+ZSTD_CStream* ZSTD_createCStream_usingCDict(ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
 {
-	return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
+	ZSTD_CStream* const zcs = ZSTD_createCStream(params, pledgedSrcSize, workspace, workspaceSize);
+	if (zcs) {
+		zcs->cdict = cdict;
+		zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
+	}
+	return zcs;
 }
 
 /*======   Compression   ======*/
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 0d512e8f6..379806e63 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -2098,10 +2098,30 @@ static ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
 	return zds;
 }
 
-ZSTD_DStream* ZSTD_createDStream(void* workspace, size_t workspaceSize)
+ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createDStream_advanced(stackMem);
+	ZSTD_DStream* zds = ZSTD_createDStream_advanced(stackMem);
+	if (!zds) { return NULL; }
+
+	zds->maxWindowSize = maxWindowSize;
+	zds->stage = zdss_loadHeader;
+	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+	ZSTD_freeDDict(zds->ddictLocal);
+	zds->ddictLocal = NULL;
+	zds->ddict = zds->ddictLocal;
+	zds->legacyVersion = 0;
+	zds->hostageByte = 0;
+	return zds;
+}
+
+ZSTD_DStream* ZSTD_createDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize)
+{
+	ZSTD_DStream* zds = ZSTD_createDStream(maxWindowSize, workspace, workspaceSize);
+	if (zds) {
+		zds->ddict = ddict;
+	}
+	return zds;
 }
 
 size_t ZSTD_freeDStream(ZSTD_DStream* zds)
@@ -2127,26 +2147,6 @@ size_t ZSTD_freeDStream(ZSTD_DStream* zds)
 size_t ZSTD_DStreamInSize(void)  { return ZSTD_BLOCKSIZE_ABSOLUTEMAX + ZSTD_blockHeaderSize; }
 size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
 
-size_t ZSTD_initDStream(ZSTD_DStream* zds, size_t maxWindowSize)
-{
-	zds->maxWindowSize = maxWindowSize;
-	zds->stage = zdss_loadHeader;
-	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-	ZSTD_freeDDict(zds->ddictLocal);
-	zds->ddictLocal = NULL;
-	zds->ddict = zds->ddictLocal;
-	zds->legacyVersion = 0;
-	zds->hostageByte = 0;
-	return ZSTD_frameHeaderSize_prefix;
-}
-
-size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, size_t maxWindowSize, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
-{
-	size_t const initResult = ZSTD_initDStream(zds, maxWindowSize);
-	zds->ddict = ddict;
-	return initResult;
-}
-
 size_t ZSTD_resetDStream(ZSTD_DStream* zds)
 {
 	zds->stage = zdss_loadHeader;
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index b7dcc03e0..66f318af6 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -229,6 +229,7 @@ typedef struct {
 
 ZSTD_customMem ZSTD_initStack(void* workspace, size_t workspaceSize);
 
+void* ZSTD_stackAllocAll(void* opaque, size_t* size);
 void* ZSTD_stackAlloc(void* opaque, size_t size);
 void ZSTD_stackFree(void* opaque, void* address);
 

From 87cec8fd56b01147ea229482b1e492985e050dab Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 3 Apr 2017 16:08:20 -0700
Subject: [PATCH 100/255] Fix compilation errors

---
 contrib/linux-kernel/lib/entropy_common.c |  2 --
 contrib/linux-kernel/lib/error_private.h  | 12 ------------
 contrib/linux-kernel/lib/fse.h            |  1 -
 contrib/linux-kernel/lib/huf.h            |  1 -
 4 files changed, 16 deletions(-)

diff --git a/contrib/linux-kernel/lib/entropy_common.c b/contrib/linux-kernel/lib/entropy_common.c
index f6a43662d..68d880827 100644
--- a/contrib/linux-kernel/lib/entropy_common.c
+++ b/contrib/linux-kernel/lib/entropy_common.c
@@ -47,10 +47,8 @@ unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
 
 /*===   Error Management   ===*/
 unsigned FSE_isError(size_t code) { return ERR_isError(code); }
-const char* FSE_getErrorName(size_t code) { return ERR_getErrorName(code); }
 
 unsigned HUF_isError(size_t code) { return ERR_isError(code); }
-const char* HUF_getErrorName(size_t code) { return ERR_getErrorName(code); }
 
 
 /*-**************************************************************
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index 680eba112..9bfbe4b5c 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -41,16 +41,4 @@ ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
 
 ERR_STATIC ERR_enum ERR_getErrorCode(size_t code) { if (!ERR_isError(code)) return (ERR_enum)0; return (ERR_enum) (0-code); }
 
-
-/*-****************************************
-*  Error Strings
-******************************************/
-
-const char* ERR_getErrorString(ERR_enum code);   /* error_private.c */
-
-ERR_STATIC const char* ERR_getErrorName(size_t code)
-{
-	return ERR_getErrorString(ERR_getErrorCode(code));
-}
-
 #endif /* ERROR_H_MODULE */
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index 6df7ff935..fbd97fae3 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -66,7 +66,6 @@ FSE_PUBLIC_API size_t FSE_compressBound(size_t size);       /* maximum compresse
 
 /* Error Management */
 FSE_PUBLIC_API unsigned    FSE_isError(size_t code);        /* tells if a return value is an error code */
-FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error code string (useful for debugging) */
 
 
 /*-*****************************************
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index e0a30ce00..f135226dc 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -45,7 +45,6 @@ size_t HUF_compressBound(size_t size);       /**< maximum compressed size (worst
 
 /* Error Management */
 unsigned    HUF_isError(size_t code);        /**< tells if a return value is an error code */
-const char* HUF_getErrorName(size_t code);   /**< provides error code string (useful for debugging) */
 
 
 /* ***   Advanced function   *** */

From 62ecad3819e6d03b1eed8141ad8dd7abea841df3 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 3 Apr 2017 20:56:39 -0700
Subject: [PATCH 101/255] Fix ZSTD_initCStream_usingCDict() to use dictionary

---
 lib/compress/zstd_compress.c |  3 ++-
 tests/zstreamtest.c          | 28 ++++++++++++++++++++++++++++
 2 files changed, 30 insertions(+), 1 deletion(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index e1c734927..03b9758e8 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3068,7 +3068,8 @@ size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
     size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
     zcs->cdict = cdict;
     zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
-    return initError;
+    if (ZSTD_isError(initError)) return initError;
+    return ZSTD_resetCStream_internal(zcs, 0);
 }
 
 size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 10bcbe0cd..e1e68b01c 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -438,6 +438,34 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
       if (!ZSTD_isError(r)) goto _output_error;  /* must fail : frame requires > 100 bytes */
       DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r)); }
 
+    DISPLAYLEVEL(3, "test%3i : check dictionary used : ", testNb++);
+    {   ZSTD_parameters params = ZSTD_getParams(1, CNBufferSize, dictionary.filled);
+        ZSTD_CDict* cdict;
+        params.fParams.noDictIDFlag = 1;
+        cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, params, customMem);
+        { size_t const initError = ZSTD_initCStream_usingCDict(zc, cdict);
+          if (ZSTD_isError(initError)) goto _output_error; }
+        cSize = 0;
+        outBuff.dst = compressedBuffer;
+        outBuff.size = compressedBufferSize;
+        outBuff.pos = 0;
+        inBuff.src = CNBuffer;
+        inBuff.size = CNBufferSize;
+        inBuff.pos = 0;
+        { size_t const r = ZSTD_compressStream(zc, &outBuff, &inBuff);
+          if (ZSTD_isError(r)) goto _output_error; }
+        if (inBuff.pos != inBuff.size) goto _output_error;   /* entire input should be consumed */
+        { size_t const r = ZSTD_endStream(zc, &outBuff);
+          if (r != 0) goto _output_error; }  /* error, or some data not flushed */
+        cSize = outBuff.pos;
+        ZSTD_freeCDict(cdict);
+        DISPLAYLEVEL(3, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBufferSize*100);
+
+        { size_t const r = ZSTD_decompress(decodedBuffer, CNBufferSize, compressedBuffer, cSize);
+          if (!ZSTD_isError(r)) goto _output_error; /* must fail : dictionary not used */
+          DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r)); }
+    }
+
     /* Unknown srcSize */
     DISPLAYLEVEL(3, "test%3i : pledgedSrcSize == 0 behaves properly : ", testNb++);
     {   ZSTD_parameters params = ZSTD_getParams(5, 0, 0);

From 39a6cc5172ef32e8afc115fa2144d9cd23837df3 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 3 Apr 2017 21:00:44 -0700
Subject: [PATCH 102/255] Make ZSTD_compress_usingCDict() respect
 contentSizeFlag

---
 lib/compress/zstd_compress.c |  2 ++
 tests/fuzzer.c               | 33 +++++++++++++++++++++++++++++++++
 2 files changed, 35 insertions(+)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 03b9758e8..21f31b756 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2921,6 +2921,8 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
     if (cdict->refContext->params.fParams.contentSizeFlag==1) {
         cctx->params.fParams.contentSizeFlag = 1;
         cctx->frameContentSize = srcSize;
+    } else {
+        cctx->params.fParams.contentSizeFlag = 0;
     }
 
     return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index fed875843..342c953e9 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -404,6 +404,39 @@ static int basicUnitTests(U32 seed, double compressibility)
                   if (r != CNBuffSize) goto _output_error);
         DISPLAYLEVEL(4, "OK \n");
 
+        DISPLAYLEVEL(4, "test%3i : compress with preprocessed dictionary : ", testNb++);
+        {   ZSTD_parameters params = ZSTD_getParams(1, CNBuffSize, dictSize);
+            params.fParams.contentSizeFlag = 0;
+            {   ZSTD_customMem customMem = { NULL, NULL, NULL };
+                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, params, customMem);
+                cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
+                                                 CNBuffer, CNBuffSize, cdict);
+                ZSTD_freeCDict(cdict);
+                if (ZSTD_isError(cSize)) goto _output_error;
+            }
+        }
+        DISPLAYLEVEL(4, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBuffSize*100);
+
+        DISPLAYLEVEL(4, "test%3i : retrieve dictID from frame : ", testNb++);
+        {   U32 const did = ZSTD_getDictID_fromFrame(compressedBuffer, cSize);
+            if (did != dictID) goto _output_error;   /* non-conformant (content-only) dictionary */
+        }
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : frame should not have content size : ", testNb++);
+        {   unsigned long long const contentSize = ZSTD_findDecompressedSize(compressedBuffer, cSize);
+            if (contentSize != ZSTD_CONTENTSIZE_UNKNOWN)  goto _output_error;  /* cdict contentSizeFlag not used */
+        }
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : frame built with dictionary should be decompressible : ", testNb++);
+        CHECKPLUS(r, ZSTD_decompress_usingDict(dctx,
+                                       decodedBuffer, CNBuffSize,
+                                       compressedBuffer, cSize,
+                                       dictBuffer, dictSize),
+                  if (r != CNBuffSize) goto _output_error);
+        DISPLAYLEVEL(4, "OK \n");
+
         DISPLAYLEVEL(4, "test%3i : compress without dictID : ", testNb++);
         {   ZSTD_parameters p = ZSTD_getParams(3, CNBuffSize, dictSize);
             p.fParams.noDictIDFlag = 1;

From 26b046a7c42c13af544c354db3741b4f3418a352 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 3 Apr 2017 21:46:28 -0700
Subject: [PATCH 103/255] Remove unnecessary dictID store

---
 lib/compress/zstd_compress.c | 1 -
 1 file changed, 1 deletion(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 21f31b756..8318843be 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3069,7 +3069,6 @@ size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
     ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
     size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
     zcs->cdict = cdict;
-    zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
     if (ZSTD_isError(initError)) return initError;
     return ZSTD_resetCStream_internal(zcs, 0);
 }

From 33fc0ad56a624bbeaf54796e82aaa356d1e13929 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 11:52:49 -0700
Subject: [PATCH 104/255] Fix ZSTD_createCStream_usingCDict() and
 ZSTD_compress_usingCDict()

---
 contrib/linux-kernel/include/zstd.h      | 2 +-
 contrib/linux-kernel/lib/zstd_compress.c | 9 +++++++--
 2 files changed, 8 insertions(+), 3 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index fde751271..9d8fc8e0b 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -257,7 +257,7 @@ size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 typedef struct ZSTD_CStream_s ZSTD_CStream;
 /*===== ZSTD_CStream management functions =====*/
 ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_usingCDict(ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
 
 /*===== Streaming compression functions =====*/
 ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index f91f9f016..e57cd6baa 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -2861,6 +2861,8 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
 	if (cdict->refContext->params.fParams.contentSizeFlag==1) {
 		cctx->params.fParams.contentSizeFlag = 1;
 		cctx->frameContentSize = srcSize;
+	} else {
+		cctx->params.fParams.contentSizeFlag = 0;
 	}
 
 	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
@@ -3015,12 +3017,15 @@ ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pled
 	return zcs;
 }
 
-ZSTD_CStream* ZSTD_createCStream_usingCDict(ZSTD_parameters params, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
+ZSTD_CStream* ZSTD_createCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
 {
+	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
 	ZSTD_CStream* const zcs = ZSTD_createCStream(params, pledgedSrcSize, workspace, workspaceSize);
 	if (zcs) {
 		zcs->cdict = cdict;
-		zcs->cctx->dictID = params.fParams.noDictIDFlag ? 0 : cdict->refContext->dictID;
+		if (ZSTD_isError(ZSTD_resetCStream_internal(zcs, pledgedSrcSize))) {
+			return NULL;
+		}
 	}
 	return zcs;
 }

From 79298bf187181e9edc37c5b766ae4020d9972d9f Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 11:53:22 -0700
Subject: [PATCH 105/255] Add userland test with mock kernel headers

---
 contrib/linux-kernel/test/.gitignore          |   1 +
 contrib/linux-kernel/test/Makefile            |  27 +
 contrib/linux-kernel/test/UserlandTest.cpp    | 479 ++++++++++++++++++
 .../linux-kernel/test/include/asm/unaligned.h | 177 +++++++
 .../test/include/linux/compiler.h             |  12 +
 .../linux-kernel/test/include/linux/kernel.h  |  14 +
 .../linux-kernel/test/include/linux/string.h  |   1 +
 .../linux-kernel/test/include/linux/types.h   |   2 +
 8 files changed, 713 insertions(+)
 create mode 100644 contrib/linux-kernel/test/.gitignore
 create mode 100644 contrib/linux-kernel/test/Makefile
 create mode 100644 contrib/linux-kernel/test/UserlandTest.cpp
 create mode 100644 contrib/linux-kernel/test/include/asm/unaligned.h
 create mode 100644 contrib/linux-kernel/test/include/linux/compiler.h
 create mode 100644 contrib/linux-kernel/test/include/linux/kernel.h
 create mode 100644 contrib/linux-kernel/test/include/linux/string.h
 create mode 100644 contrib/linux-kernel/test/include/linux/types.h

diff --git a/contrib/linux-kernel/test/.gitignore b/contrib/linux-kernel/test/.gitignore
new file mode 100644
index 000000000..4fc10228d
--- /dev/null
+++ b/contrib/linux-kernel/test/.gitignore
@@ -0,0 +1 @@
+*Test
diff --git a/contrib/linux-kernel/test/Makefile b/contrib/linux-kernel/test/Makefile
new file mode 100644
index 000000000..b16964f84
--- /dev/null
+++ b/contrib/linux-kernel/test/Makefile
@@ -0,0 +1,27 @@
+
+IFLAGS := -isystem include/ -I ../include/ -I ../lib/ -isystem googletest/googletest/include
+
+SOURCES := $(wildcard ../lib/*.c)
+OBJECTS := $(patsubst %.c,%.o,$(SOURCES))
+
+ARFLAGS := rcs
+CXXFLAGS += -std=c++11
+CFLAGS += -g -O0
+CPPFLAGS += $(IFLAGS)
+
+../lib/libzstd.a: $(OBJECTS)
+	$(AR) $(ARFLAGS) $@ $^
+
+UserlandTest: UserlandTest.cpp ../lib/libzstd.a
+	$(CXX) $(CXXFLAGS) $(CFLAGS) $(CPPFLAGS) $^ googletest/build/googlemock/gtest/libgtest.a googletest/build/googlemock/gtest/libgtest_main.a -o $@
+
+# Install googletest
+.PHONY: googletest
+googletest:
+	@$(RM) -rf googletest
+	@git clone https://github.com/google/googletest
+	@mkdir -p googletest/build
+	@cd googletest/build && cmake .. && $(MAKE)
+
+clean:
+	$(RM) -f *.{o,a} ../lib/*.{o,a}
diff --git a/contrib/linux-kernel/test/UserlandTest.cpp b/contrib/linux-kernel/test/UserlandTest.cpp
new file mode 100644
index 000000000..7bdbd1bf7
--- /dev/null
+++ b/contrib/linux-kernel/test/UserlandTest.cpp
@@ -0,0 +1,479 @@
+extern "C" {
+#include <zstd.h>
+}
+#include <gtest/gtest.h>
+#include <memory>
+#include <string>
+#include <iostream>
+
+using namespace std;
+
+namespace {
+struct WorkspaceDeleter {
+  void *memory;
+
+  template <typename T> void operator()(T const *) { free(memory); }
+};
+
+std::unique_ptr<ZSTD_CCtx, WorkspaceDeleter>
+createCCtx(ZSTD_compressionParameters cParams) {
+  size_t const workspaceSize = ZSTD_CCtxWorkspaceBound(cParams);
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_CCtx, WorkspaceDeleter> cctx{
+      ZSTD_createCCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
+  if (!cctx) {
+    throw std::runtime_error{"Bad cctx"};
+  }
+  return cctx;
+}
+
+std::unique_ptr<ZSTD_CCtx, WorkspaceDeleter>
+createCCtx(int level, unsigned long long estimatedSrcSize = 0,
+           size_t dictSize = 0) {
+  auto const cParams = ZSTD_getCParams(level, estimatedSrcSize, dictSize);
+  return createCCtx(cParams);
+}
+
+std::unique_ptr<ZSTD_DCtx, WorkspaceDeleter>
+createDCtx() {
+  size_t const workspaceSize = ZSTD_DCtxWorkspaceBound();
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_DCtx, WorkspaceDeleter> dctx{
+      ZSTD_createDCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
+  if (!dctx) {
+    throw std::runtime_error{"Bad dctx"};
+  }
+  return dctx;
+}
+
+std::unique_ptr<ZSTD_CDict, WorkspaceDeleter>
+createCDict(std::string const& dict, ZSTD_parameters params) {
+  size_t const workspaceSize = ZSTD_CDictWorkspaceBound(params.cParams);
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_CDict, WorkspaceDeleter> cdict{
+      ZSTD_createCDict(dict.data(), dict.size(), params, workspace,
+                       workspaceSize),
+      WorkspaceDeleter{workspace}};
+  if (!cdict) {
+    throw std::runtime_error{"Bad cdict"};
+  }
+  return cdict;
+}
+
+std::unique_ptr<ZSTD_CDict, WorkspaceDeleter>
+createCDict(std::string const& dict, int level) {
+  auto const params = ZSTD_getParams(level, 0, dict.size());
+  return createCDict(dict, params);
+}
+
+std::unique_ptr<ZSTD_DDict, WorkspaceDeleter>
+createDDict(std::string const& dict) {
+  size_t const workspaceSize = ZSTD_DDictWorkspaceBound();
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_DDict, WorkspaceDeleter> ddict{
+      ZSTD_createDDict(dict.data(), dict.size(), workspace, workspaceSize),
+      WorkspaceDeleter{workspace}};
+  if (!ddict) {
+    throw std::runtime_error{"Bad ddict"};
+  }
+  return ddict;
+}
+
+std::unique_ptr<ZSTD_CStream, WorkspaceDeleter>
+createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize = 0) {
+  size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(params.cParams);
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_CStream, WorkspaceDeleter> zcs{
+      ZSTD_createCStream(params, pledgedSrcSize, workspace, workspaceSize)};
+  if (!zcs) {
+    throw std::runtime_error{"bad cstream"};
+  }
+  return zcs;
+}
+
+std::unique_ptr<ZSTD_CStream, WorkspaceDeleter>
+createCStream(ZSTD_compressionParameters cParams, ZSTD_CDict const &cdict,
+              unsigned long long pledgedSrcSize = 0) {
+  size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(cParams);
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_CStream, WorkspaceDeleter> zcs{
+      ZSTD_createCStream_usingCDict(&cdict, pledgedSrcSize, workspace,
+                                    workspaceSize)};
+  if (!zcs) {
+    throw std::runtime_error{"bad cstream"};
+  }
+  return zcs;
+}
+
+std::unique_ptr<ZSTD_CStream, WorkspaceDeleter>
+createCStream(int level, unsigned long long pledgedSrcSize = 0) {
+  auto const params = ZSTD_getParams(level, pledgedSrcSize, 0);
+  return createCStream(params, pledgedSrcSize);
+}
+
+std::unique_ptr<ZSTD_DStream, WorkspaceDeleter>
+createDStream(size_t maxWindowSize = (1ULL << ZSTD_WINDOWLOG_MAX),
+              ZSTD_DDict const *ddict = nullptr) {
+  size_t const workspaceSize = ZSTD_DStreamWorkspaceBound(maxWindowSize);
+  void *workspace = malloc(workspaceSize);
+  std::unique_ptr<ZSTD_DStream, WorkspaceDeleter> zds{
+      ddict == nullptr
+          ? ZSTD_createDStream(maxWindowSize, workspace, workspaceSize)
+          : ZSTD_createDStream_usingDDict(maxWindowSize, ddict, workspace,
+                                          workspaceSize)};
+  if (!zds) {
+    throw std::runtime_error{"bad dstream"};
+  }
+  return zds;
+}
+
+std::string compress(ZSTD_CCtx &cctx, std::string const &data,
+                     ZSTD_parameters params, std::string const &dict = "") {
+  std::string compressed;
+  compressed.resize(ZSTD_compressBound(data.size()));
+  size_t const rc =
+      dict.empty()
+          ? ZSTD_compressCCtx(&cctx, &compressed[0], compressed.size(),
+                              data.data(), data.size(), params)
+          : ZSTD_compress_usingDict(&cctx, &compressed[0], compressed.size(),
+                                    data.data(), data.size(), dict.data(),
+                                    dict.size(), params);
+  if (ZSTD_isError(rc)) {
+    throw std::runtime_error{"compression error"};
+  }
+  compressed.resize(rc);
+  return compressed;
+}
+
+std::string compress(ZSTD_CCtx& cctx, std::string const& data, int level, std::string const& dict = "") {
+  auto const params = ZSTD_getParams(level, 0, dict.size());
+  return compress(cctx, data, params, dict);
+}
+
+std::string decompress(ZSTD_DCtx& dctx, std::string const& compressed, size_t decompressedSize, std::string const& dict = "") {
+  std::string decompressed;
+  decompressed.resize(decompressedSize);
+  size_t const rc =
+      dict.empty()
+          ? ZSTD_decompressDCtx(&dctx, &decompressed[0], decompressed.size(),
+                                compressed.data(), compressed.size())
+          : ZSTD_decompress_usingDict(
+                &dctx, &decompressed[0], decompressed.size(), compressed.data(),
+                compressed.size(), dict.data(), dict.size());
+  if (ZSTD_isError(rc)) {
+    throw std::runtime_error{"decompression error"};
+  }
+  decompressed.resize(rc);
+  return decompressed;
+}
+
+std::string compress(ZSTD_CCtx& cctx, std::string const& data, ZSTD_CDict& cdict) {
+  std::string compressed;
+  compressed.resize(ZSTD_compressBound(data.size()));
+  size_t const rc =
+      ZSTD_compress_usingCDict(&cctx, &compressed[0], compressed.size(),
+                               data.data(), data.size(), &cdict);
+  if (ZSTD_isError(rc)) {
+    throw std::runtime_error{"compression error"};
+  }
+  compressed.resize(rc);
+  return compressed;
+}
+
+std::string decompress(ZSTD_DCtx& dctx, std::string const& compressed, size_t decompressedSize, ZSTD_DDict& ddict) {
+  std::string decompressed;
+  decompressed.resize(decompressedSize);
+  size_t const rc =
+      ZSTD_decompress_usingDDict(&dctx, &decompressed[0], decompressed.size(),
+                                 compressed.data(), compressed.size(), &ddict);
+  if (ZSTD_isError(rc)) {
+    throw std::runtime_error{"decompression error"};
+  }
+  decompressed.resize(rc);
+  return decompressed;
+}
+
+std::string compress(ZSTD_CStream& zcs, std::string const& data) {
+  std::string compressed;
+  compressed.resize(ZSTD_compressBound(data.size()));
+  ZSTD_inBuffer in = {data.data(), data.size(), 0};
+  ZSTD_outBuffer out = {&compressed[0], compressed.size(), 0};
+  while (in.pos != in.size) {
+    size_t const rc = ZSTD_compressStream(&zcs, &out, &in);
+    if (ZSTD_isError(rc)) {
+      throw std::runtime_error{"compress stream failed"};
+    }
+  }
+  size_t const rc = ZSTD_endStream(&zcs, &out);
+  if (rc != 0) {
+    throw std::runtime_error{"compress end failed"};
+  }
+  compressed.resize(out.pos);
+  return compressed;
+}
+
+std::string decompress(ZSTD_DStream &zds, std::string const &compressed,
+                       size_t decompressedSize) {
+  std::string decompressed;
+  decompressed.resize(decompressedSize);
+  ZSTD_inBuffer in = {compressed.data(), compressed.size(), 0};
+  ZSTD_outBuffer out = {&decompressed[0], decompressed.size(), 0};
+  while (in.pos != in.size) {
+    size_t const rc = ZSTD_decompressStream(&zds, &out, &in);
+    if (ZSTD_isError(rc)) {
+      throw std::runtime_error{"decompress stream failed"};
+    }
+  }
+  decompressed.resize(out.pos);
+  return decompressed;
+}
+
+std::string makeData(size_t size) {
+  std::string result;
+  result.reserve(size + 20);
+  while (result.size() < size) {
+    result += "Hello world";
+  }
+  return result;
+}
+
+std::string const kData = "Hello world";
+std::string const kPlainDict = makeData(10000);
+std::string const kZstdDict{
+    "\x37\xA4\x30\xEC\x99\x69\x58\x1C\x21\x10\xD8\x4A\x84\x01\xCC\xF3"
+    "\x3C\xCF\x9B\x25\xBB\xC9\x6E\xB2\x9B\xEC\x26\xAD\xCF\xDF\x4E\xCD"
+    "\xF3\x2C\x3A\x21\x84\x10\x42\x08\x21\x01\x33\xF1\x78\x3C\x1E\x8F"
+    "\xC7\xE3\xF1\x78\x3C\xCF\xF3\xBC\xF7\xD4\x42\x41\x41\x41\x41\x41"
+    "\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41"
+    "\x41\x41\x41\x41\xA1\x50\x28\x14\x0A\x85\x42\xA1\x50\x28\x14\x0A"
+    "\x85\xA2\x28\x8A\xA2\x28\x4A\x29\x7D\x74\xE1\xE1\xE1\xE1\xE1\xE1"
+    "\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xF1\x78\x3C"
+    "\x1E\x8F\xC7\xE3\xF1\x78\x9E\xE7\x79\xEF\x01\x01\x00\x00\x00\x04"
+    "\x00\x00\x00\x08\x00\x00\x00"
+    "0123456789",
+    161};
+}
+
+TEST(Block, CCtx) {
+  auto cctx = createCCtx(1);
+  auto const compressed = compress(*cctx, kData, 1);
+  auto dctx = createDCtx();
+  auto const decompressed = decompress(*dctx, compressed, kData.size());
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Block, NoContentSize) {
+  auto cctx = createCCtx(1);
+  auto const c = compress(*cctx, kData, 1);
+  auto const size = ZSTD_findDecompressedSize(c.data(), c.size());
+  EXPECT_EQ(ZSTD_CONTENTSIZE_UNKNOWN, size);
+}
+
+TEST(Block, ContentSize) {
+  auto cctx = createCCtx(1);
+  auto params = ZSTD_getParams(1, 0, 0);
+  params.fParams.contentSizeFlag = 1;
+  auto const c = compress(*cctx, kData, params);
+  auto const size = ZSTD_findDecompressedSize(c.data(), c.size());
+  EXPECT_EQ(kData.size(), size);
+}
+
+TEST(Block, CCtxLevelIncrease) {
+  std::string c;
+  auto cctx = createCCtx(6);
+  auto dctx = createDCtx();
+  for (int level = 1; level <= 6; ++level) {
+    auto compressed = compress(*cctx, kData, level);
+    auto const decompressed = decompress(*dctx, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+}
+
+TEST(Block, PlainDict) {
+  auto cctx = createCCtx(1);
+  auto const compressed = compress(*cctx, kData, 1, kPlainDict);
+  auto dctx = createDCtx();
+  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
+  auto const decompressed =
+      decompress(*dctx, compressed, kData.size(), kPlainDict);
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Block, ZstdDict) {
+  auto cctx = createCCtx(1);
+  auto const compressed = compress(*cctx, kData, 1, kZstdDict);
+  auto dctx = createDCtx();
+  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
+  auto const decompressed =
+      decompress(*dctx, compressed, kData.size(), kZstdDict);
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Block, PreprocessedPlainDict) {
+  auto cctx = createCCtx(1);
+  auto const cdict = createCDict(kPlainDict, 1);
+  auto const compressed = compress(*cctx, kData, *cdict);
+  auto dctx = createDCtx();
+  auto const ddict = createDDict(kPlainDict);
+  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
+  auto const decompressed =
+      decompress(*dctx, compressed, kData.size(), *ddict);
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Block, PreprocessedZstdDict) {
+  auto cctx = createCCtx(1);
+  auto const cdict = createCDict(kZstdDict, 1);
+  auto const compressed = compress(*cctx, kData, *cdict);
+  auto dctx = createDCtx();
+  auto const ddict = createDDict(kZstdDict);
+  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
+  auto const decompressed =
+      decompress(*dctx, compressed, kData.size(), *ddict);
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Block, RecreateCCtx) {
+  auto cctx = createCCtx(1);
+  {
+    auto const compressed = compress(*cctx, kData, 1);
+    auto dctx = createDCtx();
+    auto const decompressed = decompress(*dctx, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+  // Create the cctx with the same memory
+  auto d = cctx.get_deleter();
+  auto raw = cctx.release();
+  auto params = ZSTD_getParams(1, 0, 0);
+  cctx.reset(
+      ZSTD_createCCtx(d.memory, ZSTD_CCtxWorkspaceBound(params.cParams)));
+  // Repeat
+  {
+    auto const compressed = compress(*cctx, kData, 1);
+    auto dctx = createDCtx();
+    auto const decompressed = decompress(*dctx, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+}
+
+TEST(Block, RecreateDCtx) {
+  auto dctx = createDCtx();
+  {
+    auto cctx = createCCtx(1);
+    auto const compressed = compress(*cctx, kData, 1);
+    auto const decompressed = decompress(*dctx, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+  // Create the cctx with the same memory
+  auto d = dctx.get_deleter();
+  auto raw = dctx.release();
+  dctx.reset(ZSTD_createDCtx(d.memory, ZSTD_DCtxWorkspaceBound()));
+  // Repeat
+  {
+    auto cctx = createCCtx(1);
+    auto const compressed = compress(*cctx, kData, 1);
+    auto dctx = createDCtx();
+    auto const decompressed = decompress(*dctx, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+}
+
+TEST(Stream, Basic) {
+  auto zcs = createCStream(1);
+  auto const compressed = compress(*zcs, kData);
+  auto zds = createDStream();
+  auto const decompressed = decompress(*zds, compressed, kData.size());
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Stream, PlainDict) {
+  auto params = ZSTD_getParams(1, kData.size(), kPlainDict.size());
+  params.cParams.windowLog = 17;
+  auto cdict = createCDict(kPlainDict, params);
+  auto zcs = createCStream(params.cParams, *cdict, kData.size());
+  auto const compressed = compress(*zcs, kData);
+  auto const contentSize =
+      ZSTD_findDecompressedSize(compressed.data(), compressed.size());
+  EXPECT_ANY_THROW(decompress(*createDStream(), compressed, kData.size()));
+  auto ddict = createDDict(kPlainDict);
+  auto zds = createDStream(1 << 17, ddict.get());
+  auto const decompressed = decompress(*zds, compressed, kData.size());
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Stream, ZstdDict) {
+  auto params = ZSTD_getParams(1, 0, 0);
+  params.cParams.windowLog = 17;
+  auto cdict = createCDict(kZstdDict, 1);
+  auto zcs = createCStream(params.cParams, *cdict);
+  auto const compressed = compress(*zcs, kData);
+  EXPECT_ANY_THROW(decompress(*createDStream(), compressed, kData.size()));
+  auto ddict = createDDict(kZstdDict);
+  auto zds = createDStream(1 << 17, ddict.get());
+  auto const decompressed = decompress(*zds, compressed, kData.size());
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Stream, ResetCStream) {
+  auto zcs = createCStream(1);
+  auto zds = createDStream();
+  {
+    auto const compressed = compress(*zcs, kData);
+    auto const decompressed = decompress(*zds, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+  {
+    ZSTD_resetCStream(zcs.get(), 0);
+    auto const compressed = compress(*zcs, kData);
+    auto const decompressed = decompress(*zds, compressed, kData.size());
+    EXPECT_EQ(kData, decompressed);
+  }
+}
+
+TEST(Stream, ResetDStream) {
+  auto zcs = createCStream(1);
+  auto zds = createDStream();
+  auto const compressed = compress(*zcs, kData);
+  EXPECT_ANY_THROW(decompress(*zds, kData, kData.size()));
+  EXPECT_ANY_THROW(decompress(*zds, compressed, kData.size()));
+  ZSTD_resetDStream(zds.get());
+  auto const decompressed = decompress(*zds, compressed, kData.size());
+  EXPECT_EQ(kData, decompressed);
+}
+
+TEST(Stream, Flush) {
+  auto zcs = createCStream(1);
+  auto zds = createDStream();
+  std::string compressed;
+  {
+    compressed.resize(ZSTD_compressBound(kData.size()));
+    ZSTD_inBuffer in = {kData.data(), kData.size(), 0};
+    ZSTD_outBuffer out = {&compressed[0], compressed.size(), 0};
+    while (in.pos != in.size) {
+      size_t const rc = ZSTD_compressStream(zcs.get(), &out, &in);
+      if (ZSTD_isError(rc)) {
+        throw std::runtime_error{"compress stream failed"};
+      }
+    }
+    EXPECT_EQ(0, out.pos);
+    size_t const rc = ZSTD_flushStream(zcs.get(), &out);
+    if (rc != 0) {
+      throw std::runtime_error{"compress end failed"};
+    }
+    compressed.resize(out.pos);
+    EXPECT_LT(0, out.pos);
+  }
+  std::string decompressed;
+  {
+    decompressed.resize(kData.size());
+    ZSTD_inBuffer in = {compressed.data(), compressed.size(), 0};
+    ZSTD_outBuffer out = {&decompressed[0], decompressed.size(), 0};
+    while (in.pos != in.size) {
+      size_t const rc = ZSTD_decompressStream(zds.get(), &out, &in);
+      if (ZSTD_isError(rc)) {
+        throw std::runtime_error{"decompress stream failed"};
+      }
+    }
+  }
+  EXPECT_EQ(kData, decompressed);
+}
diff --git a/contrib/linux-kernel/test/include/asm/unaligned.h b/contrib/linux-kernel/test/include/asm/unaligned.h
new file mode 100644
index 000000000..4f4828126
--- /dev/null
+++ b/contrib/linux-kernel/test/include/asm/unaligned.h
@@ -0,0 +1,177 @@
+#ifndef ASM_UNALIGNED_H
+#define ASM_UNALIGNED_H
+
+#include <assert.h>
+#include <linux/string.h>
+#include <linux/types.h>
+
+#define _LITTLE_ENDIAN 1
+
+static unsigned _isLittleEndian(void)
+{
+    const union { uint32_t u; uint8_t c[4]; } one = { 1 };
+    assert(_LITTLE_ENDIAN == one.c[0]);
+    return _LITTLE_ENDIAN;
+}
+
+static uint16_t _swap16(uint16_t in)
+{
+    return ((in & 0xF) << 8) + ((in & 0xF0) >> 8);
+}
+
+static uint32_t _swap32(uint32_t in)
+{
+    return __builtin_bswap32(in);
+}
+
+static uint64_t _swap64(uint64_t in)
+{
+    return __builtin_bswap64(in);
+}
+
+/* Little endian */
+static uint16_t get_unaligned_le16(const void* memPtr)
+{
+    uint16_t val;
+    memcpy(&val, memPtr, sizeof(val));
+    if (!_isLittleEndian()) _swap16(val);
+    return val;
+}
+
+static uint32_t get_unaligned_le32(const void* memPtr)
+{
+    uint32_t val;
+    memcpy(&val, memPtr, sizeof(val));
+    if (!_isLittleEndian()) _swap32(val);
+    return val;
+}
+
+static uint64_t get_unaligned_le64(const void* memPtr)
+{
+    uint64_t val;
+    memcpy(&val, memPtr, sizeof(val));
+    if (!_isLittleEndian()) _swap64(val);
+    return val;
+}
+
+static void put_unaligned_le16(uint16_t value, void* memPtr)
+{
+    if (!_isLittleEndian()) value = _swap16(value);
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+static void put_unaligned_le32(uint32_t value, void* memPtr)
+{
+    if (!_isLittleEndian()) value = _swap32(value);
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+static void put_unaligned_le64(uint64_t value, void* memPtr)
+{
+    if (!_isLittleEndian()) value = _swap64(value);
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+/* big endian */
+static uint32_t get_unaligned_be32(const void* memPtr)
+{
+    uint32_t val;
+    memcpy(&val, memPtr, sizeof(val));
+    if (_isLittleEndian()) _swap32(val);
+    return val;
+}
+
+static uint64_t get_unaligned_be64(const void* memPtr)
+{
+    uint64_t val;
+    memcpy(&val, memPtr, sizeof(val));
+    if (_isLittleEndian()) _swap64(val);
+    return val;
+}
+
+static void put_unaligned_be32(uint32_t value, void* memPtr)
+{
+    if (_isLittleEndian()) value = _swap32(value);
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+static void put_unaligned_be64(uint64_t value, void* memPtr)
+{
+    if (_isLittleEndian()) value = _swap64(value);
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+/* generic */
+extern void __bad_unaligned_access_size(void);
+
+#define __get_unaligned_le(ptr) ((typeof(*(ptr)))({                            \
+    __builtin_choose_expr(sizeof(*(ptr)) == 1, *(ptr),                         \
+    __builtin_choose_expr(sizeof(*(ptr)) == 2, get_unaligned_le16((ptr)),      \
+    __builtin_choose_expr(sizeof(*(ptr)) == 4, get_unaligned_le32((ptr)),      \
+    __builtin_choose_expr(sizeof(*(ptr)) == 8, get_unaligned_le64((ptr)),      \
+    __bad_unaligned_access_size()))));                                         \
+    }))
+
+#define __get_unaligned_be(ptr) ((typeof(*(ptr)))({                            \
+    __builtin_choose_expr(sizeof(*(ptr)) == 1, *(ptr),                         \
+    __builtin_choose_expr(sizeof(*(ptr)) == 2, get_unaligned_be16((ptr)),      \
+    __builtin_choose_expr(sizeof(*(ptr)) == 4, get_unaligned_be32((ptr)),      \
+    __builtin_choose_expr(sizeof(*(ptr)) == 8, get_unaligned_be64((ptr)),      \
+    __bad_unaligned_access_size()))));                                         \
+    }))
+
+#define __put_unaligned_le(val, ptr)                                           \
+  ({                                                                           \
+    void *__gu_p = (ptr);                                                      \
+    switch (sizeof(*(ptr))) {                                                  \
+    case 1:                                                                    \
+      *(uint8_t *)__gu_p = (uint8_t)(val);                                     \
+      break;                                                                   \
+    case 2:                                                                    \
+      put_unaligned_le16((uint16_t)(val), __gu_p);                             \
+      break;                                                                   \
+    case 4:                                                                    \
+      put_unaligned_le32((uint32_t)(val), __gu_p);                             \
+      break;                                                                   \
+    case 8:                                                                    \
+      put_unaligned_le64((uint64_t)(val), __gu_p);                             \
+      break;                                                                   \
+    default:                                                                   \
+      __bad_unaligned_access_size();                                           \
+      break;                                                                   \
+    }                                                                          \
+    (void)0;                                                                   \
+  })
+
+#define __put_unaligned_be(val, ptr)                                           \
+  ({                                                                           \
+    void *__gu_p = (ptr);                                                      \
+    switch (sizeof(*(ptr))) {                                                  \
+    case 1:                                                                    \
+      *(uint8_t *)__gu_p = (uint8_t)(val);                                     \
+      break;                                                                   \
+    case 2:                                                                    \
+      put_unaligned_be16((uint16_t)(val), __gu_p);                             \
+      break;                                                                   \
+    case 4:                                                                    \
+      put_unaligned_be32((uint32_t)(val), __gu_p);                             \
+      break;                                                                   \
+    case 8:                                                                    \
+      put_unaligned_be64((uint64_t)(val), __gu_p);                             \
+      break;                                                                   \
+    default:                                                                   \
+      __bad_unaligned_access_size();                                           \
+      break;                                                                   \
+    }                                                                          \
+    (void)0;                                                                   \
+  })
+
+#if _LITTLE_ENDIAN
+#  define get_unaligned __get_unaligned_le
+#  define put_unaligned __put_unaligned_le
+#else
+#  define get_unaligned __get_unaligned_be
+#  define put_unaligned __put_unaligned_be
+#endif
+
+#endif // ASM_UNALIGNED_H
diff --git a/contrib/linux-kernel/test/include/linux/compiler.h b/contrib/linux-kernel/test/include/linux/compiler.h
new file mode 100644
index 000000000..7991b8b29
--- /dev/null
+++ b/contrib/linux-kernel/test/include/linux/compiler.h
@@ -0,0 +1,12 @@
+#ifndef LINUX_COMIPLER_H_
+#define LINUX_COMIPLER_H_
+
+#ifndef __always_inline
+#  define __always_inline inline
+#endif
+
+#ifndef noinline
+#  define noinline __attribute__((__noinline__))
+#endif
+
+#endif // LINUX_COMIPLER_H_
diff --git a/contrib/linux-kernel/test/include/linux/kernel.h b/contrib/linux-kernel/test/include/linux/kernel.h
new file mode 100644
index 000000000..b208e23ba
--- /dev/null
+++ b/contrib/linux-kernel/test/include/linux/kernel.h
@@ -0,0 +1,14 @@
+#ifndef LINUX_KERNEL_H_
+#define LINUX_KERNEL_H_
+
+#define ALIGN(x, a) ({                                                         \
+    typeof(x) const __xe = (x);                                                \
+    typeof(a) const __ae = (a);                                                \
+    typeof(a) const __m = __ae - 1;                                            \
+    typeof(x) const __r = __xe & __m;                                          \
+    __xe + (__r ? (__ae - __r) : 0);                                           \
+  })
+
+#define PTR_ALIGN(p, a) (typeof(p))ALIGN((unsigned long long)(p), (a))
+
+#endif // LINUX_KERNEL_H_
diff --git a/contrib/linux-kernel/test/include/linux/string.h b/contrib/linux-kernel/test/include/linux/string.h
new file mode 100644
index 000000000..3b2f59002
--- /dev/null
+++ b/contrib/linux-kernel/test/include/linux/string.h
@@ -0,0 +1 @@
+#include <string.h>
diff --git a/contrib/linux-kernel/test/include/linux/types.h b/contrib/linux-kernel/test/include/linux/types.h
new file mode 100644
index 000000000..c2d4f4b72
--- /dev/null
+++ b/contrib/linux-kernel/test/include/linux/types.h
@@ -0,0 +1,2 @@
+#include <stddef.h>
+#include <stdint.h>

From b5e3e3c9a82577fb2b3f9ad0e0a95188cd7f565d Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 12:10:47 -0700
Subject: [PATCH 106/255] Add zstd kernel module Makefile

---
 contrib/linux-kernel/lib/Makefile | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 contrib/linux-kernel/lib/Makefile

diff --git a/contrib/linux-kernel/lib/Makefile b/contrib/linux-kernel/lib/Makefile
new file mode 100644
index 000000000..53b4deec9
--- /dev/null
+++ b/contrib/linux-kernel/lib/Makefile
@@ -0,0 +1,9 @@
+obj-$(CONFIG_ZSTD_COMPRESS) += zstd_compress.o
+obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
+
+ccflags-y += -O3
+
+zstd_compress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
+				fse_compress.o huf_compress.o zstd_compress.o
+zstd_decompress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
+				huf_decompress.o zstd_decompress.o

From 7cf78f1be76473b84a1e505718eb1e2b4e0a3ae0 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 12:38:14 -0700
Subject: [PATCH 107/255] Protects ZSTD_compressBegin_usingCDict() vs NULL
 cdict dereference

Will issue an error (GENERIC) is cdict==NULL
---
 lib/compress/zstd_compress.c | 5 +++--
 lib/zstd.h                   | 2 +-
 2 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 8318843be..b3e0b4b3a 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2898,6 +2898,7 @@ static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict* cdict) {
 
 size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
 {
+    if (cdict==NULL) return ERROR(GENERIC);  /* does not support NULL cdict */
     if (cdict->dictContentSize) CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
     else {
         ZSTD_parameters params = cdict->refContext->params;
@@ -2916,9 +2917,9 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
                                 const void* src, size_t srcSize,
                                 const ZSTD_CDict* cdict)
 {
-    CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
+    CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));  /* will check if cdict != NULL */
 
-    if (cdict->refContext->params.fParams.contentSizeFlag==1) {
+    if (cdict->refContext->params.fParams.contentSizeFlag == 1) {
         cctx->params.fParams.contentSizeFlag = 1;
         cctx->frameContentSize = srcSize;
     } else {
diff --git a/lib/zstd.h b/lib/zstd.h
index 4531a84bf..153e244be 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -651,7 +651,7 @@ ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
 ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
-ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */
 ZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 

From b1b582b9fa9177e3e18fef81d63a1e6ecb74c7ae Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 12:56:35 -0700
Subject: [PATCH 108/255] Add module macros

---
 contrib/linux-kernel/include/zstd.h        | 10 +++---
 contrib/linux-kernel/lib/zstd_common.c     |  6 ----
 contrib/linux-kernel/lib/zstd_compress.c   | 42 ++++++++++++++++++++++
 contrib/linux-kernel/lib/zstd_decompress.c | 42 ++++++++++++++++++++++
 4 files changed, 90 insertions(+), 10 deletions(-)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/zstd.h
index 9d8fc8e0b..101e3cb21 100644
--- a/contrib/linux-kernel/include/zstd.h
+++ b/contrib/linux-kernel/include/zstd.h
@@ -49,7 +49,6 @@
 #define ZSTD_VERSION_STRING ZSTD_EXPAND_AND_QUOTE(ZSTD_LIB_VERSION)
 
 #define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
-ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< library version number; to be used when checking dll version */
 
 
 /*======  Helper functions  ======*/
@@ -123,7 +122,6 @@ typedef struct {
 } ZSTD_parameters;
 
 size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters params);
-size_t ZSTD_DCtxWorkspaceBound(void);
 
 /*= Compression context
 *   When compressing many times,
@@ -139,6 +137,8 @@ ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapaci
 
 ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize, ZSTD_parameters params);
 
+size_t ZSTD_DCtxWorkspaceBound(void);
+
 /*= Decompression context
 *   When decompressing many times,
 *   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
@@ -157,7 +157,6 @@ ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* ctx, void* dst, size_t d
 *  Fast dictionary API
 ****************************/
 size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters params);
-size_t ZSTD_DDictWorkspaceBound(void);
 
 typedef struct ZSTD_CDict_s ZSTD_CDict;
 
@@ -178,6 +177,8 @@ ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
 									  const ZSTD_CDict* cdict);
 
 
+size_t ZSTD_DDictWorkspaceBound(void);
+
 typedef struct ZSTD_DDict_s ZSTD_DDict;
 
 /*! ZSTD_createDDict() :
@@ -252,7 +253,6 @@ typedef struct ZSTD_outBuffer_s {
 * *******************************************************************/
 
 size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters params);
-size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 
 typedef struct ZSTD_CStream_s ZSTD_CStream;
 /*===== ZSTD_CStream management functions =====*/
@@ -292,6 +292,8 @@ ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output
 *            The return value is a suggested next input size (a hint to improve latency) that will never load more than the current frame.
 * *******************************************************************************/
 
+size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
+
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
 ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize);
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd_common.c
index ca9382c67..106f54055 100644
--- a/contrib/linux-kernel/lib/zstd_common.c
+++ b/contrib/linux-kernel/lib/zstd_common.c
@@ -17,12 +17,6 @@
 #include <linux/kernel.h>
 
 
-/*-****************************************
-*  Version
-******************************************/
-unsigned ZSTD_versionNumber (void) { return ZSTD_VERSION_NUMBER; }
-
-
 /*=**************************************************************
 *  Custom allocator
 ****************************************************************/
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd_compress.c
index e57cd6baa..d4b87f280 100644
--- a/contrib/linux-kernel/lib/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd_compress.c
@@ -12,6 +12,7 @@
 *  Dependencies
 ***************************************/
 #include <linux/kernel.h>
+#include <linux/module.h>
 #include <linux/string.h>         /* memset */
 #include "mem.h"
 #include "fse.h"
@@ -3337,3 +3338,44 @@ ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSize,
 	params.cParams = cParams;
 	return params;
 }
+
+EXPORT_SYMBOL(ZSTD_maxCLevel);
+EXPORT_SYMBOL(ZSTD_compressBound);
+
+EXPORT_SYMBOL(ZSTD_CCtxWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createCCtx);
+EXPORT_SYMBOL(ZSTD_compressCCtx);
+EXPORT_SYMBOL(ZSTD_compress_usingDict);
+
+EXPORT_SYMBOL(ZSTD_CDictWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createCDict);
+EXPORT_SYMBOL(ZSTD_compress_usingCDict);
+
+EXPORT_SYMBOL(ZSTD_CStreamWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createCStream);
+EXPORT_SYMBOL(ZSTD_createCStream_usingCDict);
+EXPORT_SYMBOL(ZSTD_resetCStream);
+EXPORT_SYMBOL(ZSTD_compressStream);
+EXPORT_SYMBOL(ZSTD_flushStream);
+EXPORT_SYMBOL(ZSTD_endStream);
+EXPORT_SYMBOL(ZSTD_CStreamInSize);
+EXPORT_SYMBOL(ZSTD_CStreamOutSize);
+
+EXPORT_SYMBOL(ZSTD_getCParams);
+EXPORT_SYMBOL(ZSTD_getParams);
+EXPORT_SYMBOL(ZSTD_checkCParams);
+EXPORT_SYMBOL(ZSTD_adjustCParams);
+
+EXPORT_SYMBOL(ZSTD_compressBegin);
+EXPORT_SYMBOL(ZSTD_compressBegin_usingDict);
+EXPORT_SYMBOL(ZSTD_compressBegin_advanced);
+EXPORT_SYMBOL(ZSTD_copyCCtx);
+EXPORT_SYMBOL(ZSTD_compressBegin_usingCDict);
+EXPORT_SYMBOL(ZSTD_compressContinue);
+EXPORT_SYMBOL(ZSTD_compressEnd);
+
+EXPORT_SYMBOL(ZSTD_getBlockSizeMax);
+EXPORT_SYMBOL(ZSTD_compressBlock);
+
+MODULE_LICENSE("BSD");
+MODULE_DESCRIPTION("Zstd Compressor");
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd_decompress.c
index 379806e63..9eb210af0 100644
--- a/contrib/linux-kernel/lib/zstd_decompress.c
+++ b/contrib/linux-kernel/lib/zstd_decompress.c
@@ -24,6 +24,8 @@
 /*-*******************************************************
 *  Dependencies
 *********************************************************/
+#include <linux/kernel.h>
+#include <linux/module.h>
 #include <linux/string.h>      /* memcpy, memmove, memset */
 #include "mem.h"         /* low level memory routines */
 #include "fse.h"
@@ -2333,3 +2335,43 @@ size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inB
 		return nextSrcSizeHint;
 	}
 }
+
+EXPORT_SYMBOL(ZSTD_DCtxWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createDCtx);
+EXPORT_SYMBOL(ZSTD_decompressDCtx);
+EXPORT_SYMBOL(ZSTD_decompress_usingDict);
+
+EXPORT_SYMBOL(ZSTD_DDictWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createDDict);
+EXPORT_SYMBOL(ZSTD_decompress_usingDDict);
+
+EXPORT_SYMBOL(ZSTD_DStreamWorkspaceBound);
+EXPORT_SYMBOL(ZSTD_createDStream);
+EXPORT_SYMBOL(ZSTD_createDStream_usingDDict);
+EXPORT_SYMBOL(ZSTD_resetDStream);
+EXPORT_SYMBOL(ZSTD_decompressStream);
+EXPORT_SYMBOL(ZSTD_DStreamInSize);
+EXPORT_SYMBOL(ZSTD_DStreamOutSize);
+
+EXPORT_SYMBOL(ZSTD_findFrameCompressedSize);
+EXPORT_SYMBOL(ZSTD_getFrameContentSize);
+EXPORT_SYMBOL(ZSTD_findDecompressedSize);
+
+EXPORT_SYMBOL(ZSTD_isFrame);
+EXPORT_SYMBOL(ZSTD_getDictID_fromDict);
+EXPORT_SYMBOL(ZSTD_getDictID_fromDDict);
+EXPORT_SYMBOL(ZSTD_getDictID_fromFrame);
+
+EXPORT_SYMBOL(ZSTD_getFrameParams);
+EXPORT_SYMBOL(ZSTD_decompressBegin);
+EXPORT_SYMBOL(ZSTD_decompressBegin_usingDict);
+EXPORT_SYMBOL(ZSTD_copyDCtx);
+EXPORT_SYMBOL(ZSTD_nextSrcSizeToDecompress);
+EXPORT_SYMBOL(ZSTD_decompressContinue);
+EXPORT_SYMBOL(ZSTD_nextInputType);
+
+EXPORT_SYMBOL(ZSTD_decompressBlock);
+EXPORT_SYMBOL(ZSTD_insertBlock);
+
+MODULE_LICENSE("BSD");
+MODULE_DESCRIPTION("Zstd Decompressor");

From b06507221e263047bb82031a6f5fe245e14123ab Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 12:56:44 -0700
Subject: [PATCH 109/255] Test module macros

---
 contrib/linux-kernel/test/UserlandTest.cpp    | 75 +++++++++++++++++++
 .../linux-kernel/test/include/linux/module.h  | 10 +++
 2 files changed, 85 insertions(+)
 create mode 100644 contrib/linux-kernel/test/include/linux/module.h

diff --git a/contrib/linux-kernel/test/UserlandTest.cpp b/contrib/linux-kernel/test/UserlandTest.cpp
index 7bdbd1bf7..5cff66180 100644
--- a/contrib/linux-kernel/test/UserlandTest.cpp
+++ b/contrib/linux-kernel/test/UserlandTest.cpp
@@ -477,3 +477,78 @@ TEST(Stream, Flush) {
   }
   EXPECT_EQ(kData, decompressed);
 }
+
+#define TEST_SYMBOL(symbol)                                                    \
+  do {                                                                         \
+    extern void *__##symbol;                                                   \
+    EXPECT_NE((void *)0, __##symbol);                                          \
+  } while (0)
+
+TEST(API, Symbols) {
+  TEST_SYMBOL(ZSTD_CCtxWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createCCtx);
+  TEST_SYMBOL(ZSTD_compressCCtx);
+  TEST_SYMBOL(ZSTD_compress_usingDict);
+  TEST_SYMBOL(ZSTD_DCtxWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createDCtx);
+  TEST_SYMBOL(ZSTD_decompressDCtx);
+  TEST_SYMBOL(ZSTD_decompress_usingDict);
+
+  TEST_SYMBOL(ZSTD_CDictWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createCDict);
+  TEST_SYMBOL(ZSTD_compress_usingCDict);
+  TEST_SYMBOL(ZSTD_DDictWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createDDict);
+  TEST_SYMBOL(ZSTD_decompress_usingDDict);
+
+  TEST_SYMBOL(ZSTD_CStreamWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createCStream);
+  TEST_SYMBOL(ZSTD_createCStream_usingCDict);
+  TEST_SYMBOL(ZSTD_resetCStream);
+  TEST_SYMBOL(ZSTD_compressStream);
+  TEST_SYMBOL(ZSTD_flushStream);
+  TEST_SYMBOL(ZSTD_endStream);
+  TEST_SYMBOL(ZSTD_CStreamInSize);
+  TEST_SYMBOL(ZSTD_CStreamOutSize);
+  TEST_SYMBOL(ZSTD_DStreamWorkspaceBound);
+  TEST_SYMBOL(ZSTD_createDStream);
+  TEST_SYMBOL(ZSTD_createDStream_usingDDict);
+  TEST_SYMBOL(ZSTD_resetDStream);
+  TEST_SYMBOL(ZSTD_decompressStream);
+  TEST_SYMBOL(ZSTD_DStreamInSize);
+  TEST_SYMBOL(ZSTD_DStreamOutSize);
+
+  TEST_SYMBOL(ZSTD_findFrameCompressedSize);
+  TEST_SYMBOL(ZSTD_getFrameContentSize);
+  TEST_SYMBOL(ZSTD_findDecompressedSize);
+
+  TEST_SYMBOL(ZSTD_getCParams);
+  TEST_SYMBOL(ZSTD_getParams);
+  TEST_SYMBOL(ZSTD_checkCParams);
+  TEST_SYMBOL(ZSTD_adjustCParams);
+
+  TEST_SYMBOL(ZSTD_isFrame);
+  TEST_SYMBOL(ZSTD_getDictID_fromDict);
+  TEST_SYMBOL(ZSTD_getDictID_fromDDict);
+  TEST_SYMBOL(ZSTD_getDictID_fromFrame);
+
+  TEST_SYMBOL(ZSTD_compressBegin);
+  TEST_SYMBOL(ZSTD_compressBegin_usingDict);
+  TEST_SYMBOL(ZSTD_compressBegin_advanced);
+  TEST_SYMBOL(ZSTD_copyCCtx);
+  TEST_SYMBOL(ZSTD_compressBegin_usingCDict);
+  TEST_SYMBOL(ZSTD_compressContinue);
+  TEST_SYMBOL(ZSTD_compressEnd);
+  TEST_SYMBOL(ZSTD_getFrameParams);
+  TEST_SYMBOL(ZSTD_decompressBegin);
+  TEST_SYMBOL(ZSTD_decompressBegin_usingDict);
+  TEST_SYMBOL(ZSTD_copyDCtx);
+  TEST_SYMBOL(ZSTD_nextSrcSizeToDecompress);
+  TEST_SYMBOL(ZSTD_decompressContinue);
+  TEST_SYMBOL(ZSTD_nextInputType);
+
+  TEST_SYMBOL(ZSTD_getBlockSizeMax);
+  TEST_SYMBOL(ZSTD_compressBlock);
+  TEST_SYMBOL(ZSTD_decompressBlock);
+  TEST_SYMBOL(ZSTD_insertBlock);
+}
diff --git a/contrib/linux-kernel/test/include/linux/module.h b/contrib/linux-kernel/test/include/linux/module.h
new file mode 100644
index 000000000..ef514c349
--- /dev/null
+++ b/contrib/linux-kernel/test/include/linux/module.h
@@ -0,0 +1,10 @@
+#ifndef LINUX_MODULE_H_
+#define LINUX_MODULE_H_
+
+#define EXPORT_SYMBOL(symbol)                                                  \
+  void* __##symbol = symbol
+#define MODULE_LICENSE(license) static char const *const LICENSE = license
+#define MODULE_DESCRIPTION(description)                                        \
+  static char const *const DESCRIPTION = description
+
+#endif // LINUX_MODULE_H_

From 81d638013958835f85f237f1e134a44708eb9e9c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 15:21:09 -0700
Subject: [PATCH 110/255] minor bench.c adjustments

shorter debug messages
no need to check decompressedLength==0 twice
---
 programs/bench.c | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/programs/bench.c b/programs/bench.c
index d0dac497a..712f73fd8 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -89,7 +89,7 @@ static clock_t g_time = 0;
 #define DEBUGOUTPUT(...) if (DEBUG) DISPLAY(__VA_ARGS__);
 #define EXM_THROW(error, ...)                                             \
 {                                                                         \
-    DEBUGOUTPUT("Error defined at %s, line %i : \n", __FILE__, __LINE__); \
+    DEBUGOUTPUT("%s: %i: \n", __FILE__, __LINE__); \
     DISPLAYLEVEL(1, "Error %i : ", error);                                \
     DISPLAYLEVEL(1, __VA_ARGS__);                                         \
     DISPLAYLEVEL(1, " \n");                                               \
@@ -190,8 +190,7 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
             srcPtr += fileSizes[fileNb];
         }
         {   size_t const decodedSize = (size_t)dSize64;
-            if (dSize64 > decodedSize) EXM_THROW(32, "original size is too large");
-            if (decodedSize==0) EXM_THROW(32, "Impossible to determine original size ");
+            if (dSize64 > decodedSize) EXM_THROW(32, "original size is too large");   /* size_t overflow */
             free(resultBuffer);
             resultBuffer = malloc(decodedSize);
             if (!resultBuffer) EXM_THROW(33, "not enough memory");

From c2007388a556613f2e3ce1f810f5ff2cee4dfb9c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 15:35:06 -0700
Subject: [PATCH 111/255] fixed bench.c : optional advanced parameters applied

before creating cdict
---
 programs/bench.c   | 23 ++++++++++++-----------
 tests/paramgrill.c |  6 +++++-
 2 files changed, 17 insertions(+), 12 deletions(-)

diff --git a/programs/bench.c b/programs/bench.c
index 712f73fd8..d25ff8f04 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -153,7 +153,7 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                         const char* displayName, int cLevel,
                         const size_t* fileSizes, U32 nbFiles,
                         const void* dictBuffer, size_t dictBufferSize,
-                        ZSTD_compressionParameters *comprParams)
+                        const ZSTD_compressionParameters* comprParams)
 {
     size_t const blockSize = ((g_blockSize>=32 && !g_decodeOnly) ? g_blockSize : srcSize) + (!srcSize) /* avoid div by 0 */ ;
     size_t const avgSize = MIN(blockSize, (srcSize / nbFiles));
@@ -176,21 +176,21 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
         EXM_THROW(31, "allocation error : not enough memory");
 
     /* init */
-    if (strlen(displayName)>17) displayName += strlen(displayName)-17;   /* can only display 17 characters */
+    if (strlen(displayName)>17) displayName += strlen(displayName)-17;   /* display last 17 characters */
     UTIL_initTimer(&ticksPerSecond);
 
     if (g_decodeOnly) {  /* benchmark only decompression : source must be already compressed */
-        const char* srcPtr = (const char*) srcBuffer;
-        U64 dSize64 = 0;
+        const char* srcPtr = (const char*)srcBuffer;
+        U64 totalDSize64 = 0;
         U32 fileNb;
         for (fileNb=0; fileNb<nbFiles; fileNb++) {
             U64 const fSize64 = ZSTD_findDecompressedSize(srcPtr, fileSizes[fileNb]);
             if (fSize64==0) EXM_THROW(32, "Impossible to determine original size ");
-            dSize64 += fSize64;
+            totalDSize64 += fSize64;
             srcPtr += fileSizes[fileNb];
         }
-        {   size_t const decodedSize = (size_t)dSize64;
-            if (dSize64 > decodedSize) EXM_THROW(32, "original size is too large");   /* size_t overflow */
+        {   size_t const decodedSize = (size_t)totalDSize64;
+            if (totalDSize64 > decodedSize) EXM_THROW(32, "original size is too large");   /* size_t overflow */
             free(resultBuffer);
             resultBuffer = malloc(decodedSize);
             if (!resultBuffer) EXM_THROW(33, "not enough memory");
@@ -259,12 +259,11 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                 UTIL_getTime(&clockStart);
 
                 if (!cCompleted) {   /* still some time to do compression tests */
-                    ZSTD_parameters zparams = ZSTD_getParams(cLevel, avgSize, dictBufferSize);
                     ZSTD_customMem const cmem = { NULL, NULL, NULL };
-                    U64 clockLoop = g_nbSeconds ? TIMELOOP_MICROSEC : 1;
+                    U64 const clockLoop = g_nbSeconds ? TIMELOOP_MICROSEC : 1;
                     U32 nbLoops = 0;
-                    ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams, cmem);
-                    if (cdict==NULL) EXM_THROW(1, "ZSTD_createCDict_advanced() allocation failure");
+                    ZSTD_parameters zparams = ZSTD_getParams(cLevel, avgSize, dictBufferSize);
+                    ZSTD_CDict* cdict;
                     if (comprParams->windowLog) zparams.cParams.windowLog = comprParams->windowLog;
                     if (comprParams->chainLog) zparams.cParams.chainLog = comprParams->chainLog;
                     if (comprParams->hashLog) zparams.cParams.hashLog = comprParams->hashLog;
@@ -272,6 +271,8 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                     if (comprParams->searchLength) zparams.cParams.searchLength = comprParams->searchLength;
                     if (comprParams->targetLength) zparams.cParams.targetLength = comprParams->targetLength;
                     if (comprParams->strategy) zparams.cParams.strategy = (ZSTD_strategy)(comprParams->strategy - 1);
+                    cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams, cmem);
+                    if (cdict==NULL) EXM_THROW(1, "ZSTD_createCDict_advanced() allocation failure");
                     do {
                         U32 blockNb;
                         size_t rSize;
diff --git a/tests/paramgrill.c b/tests/paramgrill.c
index 5eabcba2b..364c0e4b2 100644
--- a/tests/paramgrill.c
+++ b/tests/paramgrill.c
@@ -106,7 +106,11 @@ static size_t BMK_findMaxMem(U64 requiredMem)
 }
 
 
-#  define FUZ_rotl32(x,r) ((x << r) | (x >> (32 - r)))
+static U32 FUZ_rotl32(U32 x, U32 r)
+{
+    return ((x << r) | (x >> (32 - r)));
+}
+
 U32 FUZ_rand(U32* src)
 {
     const U32 prime1 = 2654435761U;

From 675839254d93a0f92852d6ba28e2c4abda3c6d03 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 15:41:24 -0700
Subject: [PATCH 112/255] Move zstd.h to linux/zstd.h

---
 contrib/linux-kernel/include/{ => linux}/zstd.h | 0
 contrib/linux-kernel/lib/error_private.h        | 2 +-
 contrib/linux-kernel/lib/zstd_internal.h        | 2 +-
 contrib/linux-kernel/test/UserlandTest.cpp      | 2 +-
 4 files changed, 3 insertions(+), 3 deletions(-)
 rename contrib/linux-kernel/include/{ => linux}/zstd.h (100%)

diff --git a/contrib/linux-kernel/include/zstd.h b/contrib/linux-kernel/include/linux/zstd.h
similarity index 100%
rename from contrib/linux-kernel/include/zstd.h
rename to contrib/linux-kernel/include/linux/zstd.h
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/error_private.h
index 9bfbe4b5c..8cf148bc4 100644
--- a/contrib/linux-kernel/lib/error_private.h
+++ b/contrib/linux-kernel/lib/error_private.h
@@ -16,7 +16,7 @@
 *  Dependencies
 ******************************************/
 #include <linux/types.h>        /* size_t */
-#include "zstd.h"  /* enum list */
+#include <linux/zstd.h>  /* enum list */
 
 
 /* ****************************************
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd_internal.h
index 66f318af6..479d6827d 100644
--- a/contrib/linux-kernel/lib/zstd_internal.h
+++ b/contrib/linux-kernel/lib/zstd_internal.h
@@ -22,9 +22,9 @@
 ***************************************/
 #include <linux/compiler.h>
 #include <linux/kernel.h>
+#include <linux/zstd.h>
 #include "mem.h"
 #include "error_private.h"
-#include "zstd.h"
 #include "xxhash.h"               /* XXH_reset, update, digest */
 
 
diff --git a/contrib/linux-kernel/test/UserlandTest.cpp b/contrib/linux-kernel/test/UserlandTest.cpp
index 5cff66180..556abcdaf 100644
--- a/contrib/linux-kernel/test/UserlandTest.cpp
+++ b/contrib/linux-kernel/test/UserlandTest.cpp
@@ -1,5 +1,5 @@
 extern "C" {
-#include <zstd.h>
+#include <linux/zstd.h>
 }
 #include <gtest/gtest.h>
 #include <memory>

From 0888251fb1bd95c116486402f2f543ec16fe0f6a Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 15:49:38 -0700
Subject: [PATCH 113/255] Switch intptr_t to ptrdiff_t

---
 contrib/linux-kernel/lib/mem.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/mem.h
index 6040aa5c7..76cae04fa 100644
--- a/contrib/linux-kernel/lib/mem.h
+++ b/contrib/linux-kernel/lib/mem.h
@@ -38,7 +38,7 @@ typedef  uint32_t U32;
 typedef   int32_t S32;
 typedef  uint64_t U64;
 typedef   int64_t S64;
-typedef  intptr_t iPtrDiff;
+typedef ptrdiff_t iPtrDiff;
 typedef uintptr_t uPtrDiff;
 
 

From 9c257dc268df4b6eb40e4292035c555bf9295fd6 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 15:54:39 -0700
Subject: [PATCH 114/255] Fix up xxhash

---
 contrib/linux-kernel/lib/xxhash.c | 11 -----------
 contrib/linux-kernel/lib/xxhash.h |  4 ++--
 2 files changed, 2 insertions(+), 13 deletions(-)

diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 05ebedf7f..43c2c5296 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -81,17 +81,6 @@ static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcp
 #define FORCE_INLINE static __always_inline
 
 
-static U32 XXH_read32(const void* memPtr)
-{
-	return MEM_read32(memPtr);
-}
-
-static U64 XXH_read64(const void* memPtr)
-{
-	return MEM_read64(memPtr);
-}
-
-
 /* ****************************************
 *  Compiler-specific Functions and Macros
 ******************************************/
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/xxhash.h
index 36d140eca..974a81c48 100644
--- a/contrib/linux-kernel/lib/xxhash.h
+++ b/contrib/linux-kernel/lib/xxhash.h
@@ -177,8 +177,8 @@ When done, free XXH state space if it was allocated dynamically.
 /* **************************
 *  Utils
 ****************************/
-XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dst_state, const XXH32_state_t* restrict src_state);
-XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dst_state, const XXH64_state_t* restrict src_state);
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dst_state, const XXH32_state_t* src_state);
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* dst_state, const XXH64_state_t* src_state);
 
 
 /* **************************

From dd62829ccf6c84e6a93c16c663a59b8ae200325f Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 15:55:48 -0700
Subject: [PATCH 115/255] Remove more restrict

---
 contrib/linux-kernel/lib/xxhash.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/xxhash.c
index 43c2c5296..0d301ad86 100644
--- a/contrib/linux-kernel/lib/xxhash.c
+++ b/contrib/linux-kernel/lib/xxhash.c
@@ -165,12 +165,12 @@ XXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }
 /* **************************
 *  Utils
 ****************************/
-XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dstState, const XXH32_state_t* restrict srcState)
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dstState, const XXH32_state_t* srcState)
 {
 	memcpy(dstState, srcState, sizeof(*dstState));
 }
 
-XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dstState, const XXH64_state_t* restrict srcState)
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* dstState, const XXH64_state_t* srcState)
 {
 	memcpy(dstState, srcState, sizeof(*dstState));
 }

From 16a739cab0f69ecc2848c2536eb2d61e7a012da3 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:17:21 -0700
Subject: [PATCH 116/255] Switch call of FSE_count() to FSE_count_wksp()

---
 lib/common/fse.h            | 2 +-
 lib/compress/fse_compress.c | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/lib/common/fse.h b/lib/common/fse.h
index baac39032..5e43215e3 100644
--- a/lib/common/fse.h
+++ b/lib/common/fse.h
@@ -353,7 +353,7 @@ unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsi
  * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
  * FSE_WKSP_SIZE_U32() provides the minimum size required for `workSpace` as a table of FSE_CTable.
  */
-#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + (1<<((maxTableLog>2)?(maxTableLog-2):0)) )
+#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + ((maxTableLog > 12) ? (1 << (maxTableLog - 2)) : 1024) )
 size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
 
 size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits);
diff --git a/lib/compress/fse_compress.c b/lib/compress/fse_compress.c
index 13654d6e6..0b3b24286 100644
--- a/lib/compress/fse_compress.c
+++ b/lib/compress/fse_compress.c
@@ -808,7 +808,7 @@ size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t src
     if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
 
     /* Scan input and build symbol stats */
-    {   CHECK_V_F(maxCount, FSE_count(count, &maxSymbolValue, src, srcSize) );
+    {   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, scratchBuffer) );
         if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
         if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
         if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */

From 1af700ea43bc78bfd5b5a4bfbfbd0a55f6778cf6 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:22:58 -0700
Subject: [PATCH 117/255] Remove unused FSE/HUF functions

---
 contrib/linux-kernel/lib/fse.h          |  2 +-
 contrib/linux-kernel/lib/fse_compress.c | 10 +---------
 contrib/linux-kernel/lib/huf.h          |  1 -
 contrib/linux-kernel/lib/huf_compress.c |  9 ---------
 4 files changed, 2 insertions(+), 20 deletions(-)

diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/fse.h
index fbd97fae3..14fa439ee 100644
--- a/contrib/linux-kernel/lib/fse.h
+++ b/contrib/linux-kernel/lib/fse.h
@@ -272,7 +272,7 @@ unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsi
  * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
  * FSE_WKSP_SIZE_U32() provides the minimum size required for `workSpace` as a table of FSE_CTable.
  */
-#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + (1<<((maxTableLog>2)?(maxTableLog-2):0)) )
+#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + ((maxTableLog > 12) ? (1 << (maxTableLog - 2)) : 1024) )
 size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
 
 size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits);
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/fse_compress.c
index 7c13a4099..e969fd2ca 100644
--- a/contrib/linux-kernel/lib/fse_compress.c
+++ b/contrib/linux-kernel/lib/fse_compress.c
@@ -404,14 +404,6 @@ size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
 	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
 }
 
-size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,
-				 const void* src, size_t srcSize)
-{
-	unsigned tmpCounters[1024];
-	return FSE_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters);
-}
-
-
 
 /*-**************************************************************
 *  FSE Compression Code
@@ -765,7 +757,7 @@ size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t src
 	if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
 
 	/* Scan input and build symbol stats */
-	{   CHECK_V_F(maxCount, FSE_count(count, &maxSymbolValue, src, srcSize) );
+	{   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, scratchBuffer) );
 		if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
 		if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
 		if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/huf.h
index f135226dc..f36aded00 100644
--- a/contrib/linux-kernel/lib/huf.h
+++ b/contrib/linux-kernel/lib/huf.h
@@ -124,7 +124,6 @@ or to save and regenerate 'CTable' using external methods.
 /* FSE_count() : find it within "fse.h" */
 unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
 typedef struct HUF_CElt_s HUF_CElt;   /* incomplete type */
-size_t HUF_buildCTable (HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue, unsigned maxNbBits);
 size_t HUF_writeCTable (void* dst, size_t maxDstSize, const HUF_CElt* CTable, unsigned maxSymbolValue, unsigned huffLog);
 size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
 
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/huf_compress.c
index b2e71405c..a1a1d454a 100644
--- a/contrib/linux-kernel/lib/huf_compress.c
+++ b/contrib/linux-kernel/lib/huf_compress.c
@@ -390,15 +390,6 @@ size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValu
 	return maxNbBits;
 }
 
-/** HUF_buildCTable() :
- *  Note : count is used before tree is written, so they can safely overlap
- */
-size_t HUF_buildCTable (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits)
-{
-	huffNodeTable nodeTable;
-	return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, nodeTable, sizeof(nodeTable));
-}
-
 static size_t HUF_estimateCompressedSize(HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue)
 {
 	size_t nbBits = 0;

From fd95be0adeb043fa344d0513cf7ab483adfedadf Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:30:11 -0700
Subject: [PATCH 118/255] Move sources to lib/zstd/

---
 contrib/linux-kernel/lib/{ => zstd}/bitstream.h       |  0
 contrib/linux-kernel/lib/{ => zstd}/entropy_common.c  |  0
 contrib/linux-kernel/lib/{ => zstd}/error_private.h   |  0
 contrib/linux-kernel/lib/{ => zstd}/fse.h             |  0
 contrib/linux-kernel/lib/{ => zstd}/fse_compress.c    |  0
 contrib/linux-kernel/lib/{ => zstd}/fse_decompress.c  |  0
 contrib/linux-kernel/lib/{ => zstd}/huf.h             |  0
 contrib/linux-kernel/lib/{ => zstd}/huf_compress.c    |  0
 contrib/linux-kernel/lib/{ => zstd}/huf_decompress.c  |  0
 contrib/linux-kernel/lib/{ => zstd}/mem.h             |  0
 contrib/linux-kernel/lib/{ => zstd}/xxhash.c          |  0
 contrib/linux-kernel/lib/{ => zstd}/xxhash.h          |  0
 contrib/linux-kernel/lib/{ => zstd}/zstd_common.c     |  0
 contrib/linux-kernel/lib/{ => zstd}/zstd_compress.c   |  0
 contrib/linux-kernel/lib/{ => zstd}/zstd_decompress.c |  0
 contrib/linux-kernel/lib/{ => zstd}/zstd_internal.h   |  0
 contrib/linux-kernel/lib/{ => zstd}/zstd_opt.h        |  0
 contrib/linux-kernel/test/Makefile                    | 10 +++++-----
 18 files changed, 5 insertions(+), 5 deletions(-)
 rename contrib/linux-kernel/lib/{ => zstd}/bitstream.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/entropy_common.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/error_private.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/fse.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/fse_compress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/fse_decompress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/huf.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/huf_compress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/huf_decompress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/mem.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/xxhash.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/xxhash.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/zstd_common.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/zstd_compress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/zstd_decompress.c (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/zstd_internal.h (100%)
 rename contrib/linux-kernel/lib/{ => zstd}/zstd_opt.h (100%)

diff --git a/contrib/linux-kernel/lib/bitstream.h b/contrib/linux-kernel/lib/zstd/bitstream.h
similarity index 100%
rename from contrib/linux-kernel/lib/bitstream.h
rename to contrib/linux-kernel/lib/zstd/bitstream.h
diff --git a/contrib/linux-kernel/lib/entropy_common.c b/contrib/linux-kernel/lib/zstd/entropy_common.c
similarity index 100%
rename from contrib/linux-kernel/lib/entropy_common.c
rename to contrib/linux-kernel/lib/zstd/entropy_common.c
diff --git a/contrib/linux-kernel/lib/error_private.h b/contrib/linux-kernel/lib/zstd/error_private.h
similarity index 100%
rename from contrib/linux-kernel/lib/error_private.h
rename to contrib/linux-kernel/lib/zstd/error_private.h
diff --git a/contrib/linux-kernel/lib/fse.h b/contrib/linux-kernel/lib/zstd/fse.h
similarity index 100%
rename from contrib/linux-kernel/lib/fse.h
rename to contrib/linux-kernel/lib/zstd/fse.h
diff --git a/contrib/linux-kernel/lib/fse_compress.c b/contrib/linux-kernel/lib/zstd/fse_compress.c
similarity index 100%
rename from contrib/linux-kernel/lib/fse_compress.c
rename to contrib/linux-kernel/lib/zstd/fse_compress.c
diff --git a/contrib/linux-kernel/lib/fse_decompress.c b/contrib/linux-kernel/lib/zstd/fse_decompress.c
similarity index 100%
rename from contrib/linux-kernel/lib/fse_decompress.c
rename to contrib/linux-kernel/lib/zstd/fse_decompress.c
diff --git a/contrib/linux-kernel/lib/huf.h b/contrib/linux-kernel/lib/zstd/huf.h
similarity index 100%
rename from contrib/linux-kernel/lib/huf.h
rename to contrib/linux-kernel/lib/zstd/huf.h
diff --git a/contrib/linux-kernel/lib/huf_compress.c b/contrib/linux-kernel/lib/zstd/huf_compress.c
similarity index 100%
rename from contrib/linux-kernel/lib/huf_compress.c
rename to contrib/linux-kernel/lib/zstd/huf_compress.c
diff --git a/contrib/linux-kernel/lib/huf_decompress.c b/contrib/linux-kernel/lib/zstd/huf_decompress.c
similarity index 100%
rename from contrib/linux-kernel/lib/huf_decompress.c
rename to contrib/linux-kernel/lib/zstd/huf_decompress.c
diff --git a/contrib/linux-kernel/lib/mem.h b/contrib/linux-kernel/lib/zstd/mem.h
similarity index 100%
rename from contrib/linux-kernel/lib/mem.h
rename to contrib/linux-kernel/lib/zstd/mem.h
diff --git a/contrib/linux-kernel/lib/xxhash.c b/contrib/linux-kernel/lib/zstd/xxhash.c
similarity index 100%
rename from contrib/linux-kernel/lib/xxhash.c
rename to contrib/linux-kernel/lib/zstd/xxhash.c
diff --git a/contrib/linux-kernel/lib/xxhash.h b/contrib/linux-kernel/lib/zstd/xxhash.h
similarity index 100%
rename from contrib/linux-kernel/lib/xxhash.h
rename to contrib/linux-kernel/lib/zstd/xxhash.h
diff --git a/contrib/linux-kernel/lib/zstd_common.c b/contrib/linux-kernel/lib/zstd/zstd_common.c
similarity index 100%
rename from contrib/linux-kernel/lib/zstd_common.c
rename to contrib/linux-kernel/lib/zstd/zstd_common.c
diff --git a/contrib/linux-kernel/lib/zstd_compress.c b/contrib/linux-kernel/lib/zstd/zstd_compress.c
similarity index 100%
rename from contrib/linux-kernel/lib/zstd_compress.c
rename to contrib/linux-kernel/lib/zstd/zstd_compress.c
diff --git a/contrib/linux-kernel/lib/zstd_decompress.c b/contrib/linux-kernel/lib/zstd/zstd_decompress.c
similarity index 100%
rename from contrib/linux-kernel/lib/zstd_decompress.c
rename to contrib/linux-kernel/lib/zstd/zstd_decompress.c
diff --git a/contrib/linux-kernel/lib/zstd_internal.h b/contrib/linux-kernel/lib/zstd/zstd_internal.h
similarity index 100%
rename from contrib/linux-kernel/lib/zstd_internal.h
rename to contrib/linux-kernel/lib/zstd/zstd_internal.h
diff --git a/contrib/linux-kernel/lib/zstd_opt.h b/contrib/linux-kernel/lib/zstd/zstd_opt.h
similarity index 100%
rename from contrib/linux-kernel/lib/zstd_opt.h
rename to contrib/linux-kernel/lib/zstd/zstd_opt.h
diff --git a/contrib/linux-kernel/test/Makefile b/contrib/linux-kernel/test/Makefile
index b16964f84..01e877b7e 100644
--- a/contrib/linux-kernel/test/Makefile
+++ b/contrib/linux-kernel/test/Makefile
@@ -1,7 +1,7 @@
 
-IFLAGS := -isystem include/ -I ../include/ -I ../lib/ -isystem googletest/googletest/include
+IFLAGS := -isystem include/ -I ../include/ -I ../lib/zstd/ -isystem googletest/googletest/include
 
-SOURCES := $(wildcard ../lib/*.c)
+SOURCES := $(wildcard ../lib/zstd/*.c)
 OBJECTS := $(patsubst %.c,%.o,$(SOURCES))
 
 ARFLAGS := rcs
@@ -9,10 +9,10 @@ CXXFLAGS += -std=c++11
 CFLAGS += -g -O0
 CPPFLAGS += $(IFLAGS)
 
-../lib/libzstd.a: $(OBJECTS)
+../lib/zstd/libzstd.a: $(OBJECTS)
 	$(AR) $(ARFLAGS) $@ $^
 
-UserlandTest: UserlandTest.cpp ../lib/libzstd.a
+UserlandTest: UserlandTest.cpp ../lib/zstd/libzstd.a
 	$(CXX) $(CXXFLAGS) $(CFLAGS) $(CPPFLAGS) $^ googletest/build/googlemock/gtest/libgtest.a googletest/build/googlemock/gtest/libgtest_main.a -o $@
 
 # Install googletest
@@ -24,4 +24,4 @@ googletest:
 	@cd googletest/build && cmake .. && $(MAKE)
 
 clean:
-	$(RM) -f *.{o,a} ../lib/*.{o,a}
+	$(RM) -f *.{o,a} ../lib/zstd/*.{o,a}

From 2724f25567583173dce6b2bdb36c80b620df51a8 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 16:31:17 -0700
Subject: [PATCH 119/255] fixed paramgrill -O#

find optimal settings for a minimum speed
---
 tests/paramgrill.c | 53 ++++++++++++++++++++++++----------------------
 1 file changed, 28 insertions(+), 25 deletions(-)

diff --git a/tests/paramgrill.c b/tests/paramgrill.c
index 364c0e4b2..69f2aeb10 100644
--- a/tests/paramgrill.c
+++ b/tests/paramgrill.c
@@ -129,7 +129,7 @@ U32 FUZ_rand(U32* src)
 *********************************************************/
 typedef struct {
     size_t cSize;
-    double cSpeed;
+    double cSpeed;   /* bytes / sec */
     double dSpeed;
 } BMK_result_t;
 
@@ -210,7 +210,6 @@ static size_t BMK_benchParam(BMK_result_t* resultPtr,
         size_t cSize = 0;
         double fastestC = 100000000., fastestD = 100000000.;
         double ratio = 0.;
-        U64 crcCheck = 0;
         clock_t const benchStart = clock();
 
         DISPLAY("\r%79s\r", "");
@@ -246,8 +245,8 @@ static size_t BMK_benchParam(BMK_result_t* resultPtr,
             cSize = 0;
             for (blockNb=0; blockNb<nbBlocks; blockNb++)
                 cSize += blockTable[blockNb].cSize;
-            if ((double)roundClock < fastestC * CLOCKS_PER_SEC * nbLoops) fastestC = ((double)roundClock / CLOCKS_PER_SEC) / nbLoops;
             ratio = (double)srcSize / (double)cSize;
+            if ((double)roundClock < fastestC * CLOCKS_PER_SEC * nbLoops) fastestC = ((double)roundClock / CLOCKS_PER_SEC) / nbLoops;
             DISPLAY("\r");
             DISPLAY("%1u-%s : %9u ->", loopNb, name, (U32)srcSize);
             DISPLAY(" %9u (%4.3f),%7.1f MB/s", (U32)cSize, ratio, (double)srcSize / fastestC / 1000000.);
@@ -277,18 +276,18 @@ static size_t BMK_benchParam(BMK_result_t* resultPtr,
             resultPtr->dSpeed = (double)srcSize / fastestD;
 
             /* CRC Checking */
-            crcCheck = XXH64(resultBuffer, srcSize, 0);
-            if (crcOrig!=crcCheck) {
-                unsigned u;
-                unsigned eBlockSize = (unsigned)(MIN(65536*2, blockSize));
-                DISPLAY("\n!!! WARNING !!! Invalid Checksum : %x != %x\n", (unsigned)crcOrig, (unsigned)crcCheck);
-                for (u=0; u<srcSize; u++) {
-                    if (((const BYTE*)srcBuffer)[u] != ((BYTE*)resultBuffer)[u]) {
-                        printf("Decoding error at pos %u (block %u, pos %u) \n", u, u / eBlockSize, u % eBlockSize);
-                        break;
-                }   }
-                break;
-            }
+            {   U64 const crcCheck = XXH64(resultBuffer, srcSize, 0);
+                if (crcOrig!=crcCheck) {
+                    unsigned u;
+                    unsigned eBlockSize = (unsigned)(MIN(65536*2, blockSize));
+                    DISPLAY("\n!!! WARNING !!! Invalid Checksum : %x != %x\n", (unsigned)crcOrig, (unsigned)crcCheck);
+                    for (u=0; u<srcSize; u++) {
+                        if (((const BYTE*)srcBuffer)[u] != ((BYTE*)resultBuffer)[u]) {
+                            printf("Decoding error at pos %u (block %u, pos %u) \n", u, u / eBlockSize, u % eBlockSize);
+                            break;
+                    }   }
+                    break;
+            }   }
 #endif
     }   }
 
@@ -715,6 +714,8 @@ int benchFiles(const char** fileNamesTable, int nbFiles)
 }
 
 
+/* optimizeForSize():
+ * targetSpeed : expressed in MB/s */
 int optimizeForSize(const char* inFileName, U32 targetSpeed)
 {
     FILE* const inFile = fopen( inFileName, "rb" );
@@ -727,8 +728,11 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
 
     /* Memory allocation & restrictions */
     if ((U64)benchedSize > inFileSize) benchedSize = (size_t)inFileSize;
-    if (benchedSize < inFileSize)
-        DISPLAY("Not enough memory for '%s' full size; testing %i MB only...\n", inFileName, (int)(benchedSize>>20));
+    if (benchedSize < inFileSize) {
+        DISPLAY("Not enough memory for '%s' \n", inFileName);
+        fclose(inFile);
+        return 11;
+    }
 
     /* Alloc */
     origBuff = malloc(benchedSize);
@@ -751,10 +755,9 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
     /* bench */
     DISPLAY("\r%79s\r", "");
     DISPLAY("optimizing for %s - limit speed %u MB/s \n", inFileName, targetSpeed);
-    targetSpeed *= 1000;
+    targetSpeed *= 1000000;
 
     {   ZSTD_CCtx* const ctx = ZSTD_createCCtx();
-        ZSTD_compressionParameters params;
         winnerInfo_t winner;
         BMK_result_t candidate;
         const size_t blockSize = g_blockSize ? g_blockSize : benchedSize;
@@ -768,14 +771,14 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
         {   const int maxSeeds = g_noSeed ? 1 : ZSTD_maxCLevel();
             int i;
             for (i=1; i<=maxSeeds; i++) {
-                params = ZSTD_getCParams(i, blockSize, 0);
-                BMK_benchParam(&candidate, origBuff, benchedSize, ctx, params);
+                ZSTD_compressionParameters const CParams = ZSTD_getCParams(i, blockSize, 0);
+                BMK_benchParam(&candidate, origBuff, benchedSize, ctx, CParams);
                 if (candidate.cSpeed < targetSpeed)
                     break;
                 if ( (candidate.cSize < winner.result.cSize)
                    | ((candidate.cSize == winner.result.cSize) & (candidate.cSpeed > winner.result.cSpeed)) )
                 {
-                    winner.params = params;
+                    winner.params = CParams;
                     winner.result = candidate;
                     BMK_printWinner(stdout, i, winner.result, winner.params, benchedSize);
             }   }
@@ -785,9 +788,9 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
         /* start tests */
         {   time_t const grillStart = time(NULL);
             do {
-                params = winner.params;
+                ZSTD_compressionParameters params = winner.params;
                 paramVariation(&params);
-                if ((FUZ_rand(&g_rand) & 15) == 3) params = randomParams();
+                if ((FUZ_rand(&g_rand) & 31) == 3) params = randomParams();  /* totally random config to improve search space */
 
                 /* exclude faster if already played set of params */
                 if (FUZ_rand(&g_rand) & ((1 << NB_TESTS_PLAYED(params))-1)) continue;
@@ -837,7 +840,7 @@ static int usage_advanced(void)
     DISPLAY( " -T#    : set level 1 speed objective \n");
     DISPLAY( " -B#    : cut input into blocks of size # (default : single block) \n");
     DISPLAY( " -i#    : iteration loops [1-9](default : %i) \n", NBLOOPS);
-    DISPLAY( " -O#    : find Optimized parameters for # target speed (default : 0) \n");
+    DISPLAY( " -O#    : find Optimized parameters for # MB/s compression speed (default : 0) \n");
     DISPLAY( " -S     : Single run \n");
     DISPLAY( " -P#    : generated sample compressibility (default : %.1f%%) \n", COMPRESSIBILITY_DEFAULT * 100);
     return 0;

From 405d2a102758a0b76fbe5cca5c4fb2707272a093 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:35:31 -0700
Subject: [PATCH 120/255] Explicitly convert scratchBuffer to unsigned*

---
 lib/compress/fse_compress.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/compress/fse_compress.c b/lib/compress/fse_compress.c
index 0b3b24286..26e8052dd 100644
--- a/lib/compress/fse_compress.c
+++ b/lib/compress/fse_compress.c
@@ -808,7 +808,7 @@ size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t src
     if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
 
     /* Scan input and build symbol stats */
-    {   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, scratchBuffer) );
+    {   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, (unsigned*)scratchBuffer) );
         if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
         if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
         if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */

From 2eb623a6ebbffe19388a01b4a1f7eead49d78146 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:38:13 -0700
Subject: [PATCH 121/255] Explicitly convert scratchBuffer to unsigned*

---
 contrib/linux-kernel/lib/zstd/fse_compress.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contrib/linux-kernel/lib/zstd/fse_compress.c b/contrib/linux-kernel/lib/zstd/fse_compress.c
index e969fd2ca..b6a6d4693 100644
--- a/contrib/linux-kernel/lib/zstd/fse_compress.c
+++ b/contrib/linux-kernel/lib/zstd/fse_compress.c
@@ -757,7 +757,7 @@ size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t src
 	if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
 
 	/* Scan input and build symbol stats */
-	{   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, scratchBuffer) );
+	{   CHECK_V_F(maxCount, FSE_count_wksp(count, &maxSymbolValue, src, srcSize, (unsigned*)scratchBuffer) );
 		if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
 		if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
 		if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */

From 89b32f3db029456855fc591b55adbdc19d6fabec Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 16:41:11 -0700
Subject: [PATCH 122/255] fix paramgrill -O#

ensure proposed config does not require more memory than necessary
---
 tests/paramgrill.c | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/tests/paramgrill.c b/tests/paramgrill.c
index 69f2aeb10..126e54d17 100644
--- a/tests/paramgrill.c
+++ b/tests/paramgrill.c
@@ -169,6 +169,11 @@ static size_t BMK_benchParam(BMK_result_t* resultPtr,
     char name[30] = { 0 };
     U64 crcOrig;
 
+    /* init result for early exit */
+    resultPtr->cSize = srcSize;
+    resultPtr->cSpeed = 0.;
+    resultPtr->dSpeed = 0.;
+
     /* Memory allocation & restrictions */
     snprintf(name, 30, "Sw%02uc%02uh%02us%02ul%1ut%03uS%1u", Wlog, Clog, Hlog, Slog, Slength, Tlength, strat);
     if (!compressedBuffer || !resultBuffer || !blockTable) {
@@ -791,6 +796,7 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
                 ZSTD_compressionParameters params = winner.params;
                 paramVariation(&params);
                 if ((FUZ_rand(&g_rand) & 31) == 3) params = randomParams();  /* totally random config to improve search space */
+                params = ZSTD_adjustCParams(params, blockSize, 0);
 
                 /* exclude faster if already played set of params */
                 if (FUZ_rand(&g_rand) & ((1 << NB_TESTS_PLAYED(params))-1)) continue;

From 9631e603aeb7f9bf8da0f8f23d7b8854a61e78cb Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 4 Apr 2017 16:54:33 -0700
Subject: [PATCH 123/255] paramgrill : results from optimizer use cli format

Best found configuration is displayed
using documented cli advanced parameter syntax.
---
 tests/paramgrill.c | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/tests/paramgrill.c b/tests/paramgrill.c
index 126e54d17..3c1f0150b 100644
--- a/tests/paramgrill.c
+++ b/tests/paramgrill.c
@@ -719,6 +719,12 @@ int benchFiles(const char** fileNamesTable, int nbFiles)
 }
 
 
+static void BMK_translateAdvancedParams(ZSTD_compressionParameters params)
+{
+    DISPLAY("--zstd=windowLog=%u,chainLog=%u,hashLog=%u,searchLog=%u,searchLength=%u,targetLength=%u,strategy=%u \n",
+             params.windowLog, params.chainLog, params.hashLog, params.searchLog, params.searchLength, params.targetLength, (U32)(params.strategy));
+}
+
 /* optimizeForSize():
  * targetSpeed : expressed in MB/s */
 int optimizeForSize(const char* inFileName, U32 targetSpeed)
@@ -789,6 +795,7 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
             }   }
         }
         BMK_printWinner(stdout, 99, winner.result, winner.params, benchedSize);
+        BMK_translateAdvancedParams(winner.params);
 
         /* start tests */
         {   time_t const grillStart = time(NULL);
@@ -813,6 +820,7 @@ int optimizeForSize(const char* inFileName, U32 targetSpeed)
                     winner.params = params;
                     winner.result = candidate;
                     BMK_printWinner(stdout, 99, winner.result, winner.params, benchedSize);
+                    BMK_translateAdvancedParams(winner.params);
                 }
             } while (BMK_timeSpan(grillStart) < g_grillDuration_s);
         }

From d0bbceac40a48376cc2018417bd6661edc5dc286 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 16:56:52 -0700
Subject: [PATCH 124/255] Add fs/btrfs/zstd.c

---
 contrib/linux-kernel/fs/btrfs/zstd.c | 414 +++++++++++++++++++++++++++
 1 file changed, 414 insertions(+)
 create mode 100644 contrib/linux-kernel/fs/btrfs/zstd.c

diff --git a/contrib/linux-kernel/fs/btrfs/zstd.c b/contrib/linux-kernel/fs/btrfs/zstd.c
new file mode 100644
index 000000000..4f856700e
--- /dev/null
+++ b/contrib/linux-kernel/fs/btrfs/zstd.c
@@ -0,0 +1,414 @@
+#include <linux/kernel.h>
+#include <linux/slab.h>
+#include <linux/vmalloc.h>
+#include <linux/init.h>
+#include <linux/err.h>
+#include <linux/sched.h>
+#include <linux/pagemap.h>
+#include <linux/bio.h>
+#include <linux/zstd.h>
+#include "compression.h"
+
+#define ZSTD_BTRFS_MAX_WINDOWLOG 17
+#define ZSTD_BTRFS_MAX_INPUT (1 << ZSTD_BTRFS_MAX_WINDOWLOG)
+
+static ZSTD_parameters zstd_get_btrfs_parameters(size_t src_len)
+{
+	ZSTD_parameters params = ZSTD_getParams(3, src_len, 0);
+	BUG_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
+	BUG_ON(params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG);
+	params.fParams.checksumFlag = 1;
+	return params;
+}
+
+struct workspace {
+	void *mem;
+	size_t size;
+	char *buf;
+	struct list_head list;
+};
+
+static void zstd_free_workspace(struct list_head *ws)
+{
+	struct workspace *workspace = list_entry(ws, struct workspace, list);
+
+	vfree(workspace->mem);
+	kfree(workspace->buf);
+	kfree(workspace);
+}
+
+static struct list_head *zstd_alloc_workspace(void)
+{
+	ZSTD_parameters params = zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
+	struct workspace *workspace;
+
+	workspace = kzalloc(sizeof(*workspace), GFP_NOFS);
+	if (!workspace) return ERR_PTR(-ENOMEM);
+
+	workspace->size = max_t(size_t, ZSTD_CStreamWorkspaceBound(params.cParams),
+			ZSTD_DStreamWorkspaceBound(ZSTD_BTRFS_MAX_INPUT));
+	workspace->mem = vmalloc(workspace->size);
+	workspace->buf = kmalloc(PAGE_SIZE, GFP_NOFS);
+	if (!workspace->mem || !workspace->buf) goto fail;
+
+	INIT_LIST_HEAD(&workspace->list);
+
+	return &workspace->list;
+fail:
+	zstd_free_workspace(&workspace->list);
+	return ERR_PTR(-ENOMEM);
+}
+
+static int zstd_compress_pages(struct list_head *ws,
+		struct address_space *mapping,
+		u64 start, unsigned long len,
+		struct page **pages,
+		unsigned long nr_dest_pages,
+		unsigned long *out_pages,
+		unsigned long *total_in,
+		unsigned long *total_out,
+		unsigned long max_out)
+{
+	struct workspace *workspace = list_entry(ws, struct workspace, list);
+	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
+	ZSTD_CStream *stream;
+	int ret = 0;
+	int nr_pages = 0;
+	struct page *in_page = NULL;  /* The current page to read */
+	struct page *out_page = NULL; /* The current page to write to */
+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
+	unsigned long tot_in = 0;
+	unsigned long tot_out = 0;
+
+	*out_pages = 0;
+	*total_out = 0;
+	*total_in = 0;
+
+	/* Initialize the stream */
+	stream = ZSTD_createCStream(params, len, workspace->mem, workspace->size);
+	if (!stream) {
+		pr_warn("BTRFS: ZSTD_createStream failed\n");
+		ret = -EIO;
+		goto out;
+	}
+
+	/* map in the first page of input data */
+	in_page = find_get_page(mapping, start >> PAGE_SHIFT);
+	in_buf.src = kmap(in_page);
+	in_buf.pos = 0;
+	in_buf.size = min_t(size_t, len, PAGE_SIZE);
+
+
+	/* Allocate and map in the output buffer */
+	out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
+	if (out_page == NULL) {
+		ret = -ENOMEM;
+		goto out;
+	}
+	pages[nr_pages++] = out_page;
+	out_buf.dst = kmap(out_page);
+	out_buf.pos = 0;
+	out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
+
+	while (1) {
+		const size_t rc = ZSTD_compressStream(stream, &out_buf, &in_buf);
+		if (ZSTD_isError(rc)) {
+			pr_debug("BTRFS: ZSTD_compressStream returned %d\n",
+					ZSTD_getErrorCode(rc));
+			ret = -EIO;
+			goto out;
+		}
+
+		/* Check to see if we are making it bigger */
+		if (tot_in + in_buf.pos > 8192 &&
+				tot_in + in_buf.pos <
+				tot_out + out_buf.pos) {
+			ret = -E2BIG;
+			goto out;
+		}
+
+		/* We've reached the end of our output range */
+		if (out_buf.pos >= max_out) {
+			tot_out += out_buf.pos;
+			ret = -E2BIG;
+			goto out;
+		}
+
+		/* Check if we need more output space */
+		if (out_buf.pos == out_buf.size) {
+			tot_out += PAGE_SIZE;
+			max_out -= PAGE_SIZE;
+			kunmap(out_page);
+			if (nr_pages == nr_dest_pages) {
+				out_page = NULL;
+				ret = -E2BIG;
+				goto out;
+			}
+			out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
+			if (out_page == NULL) {
+				ret = -ENOMEM;
+				goto out;
+			}
+			pages[nr_pages++] = out_page;
+			out_buf.dst = kmap(out_page);
+			out_buf.pos = 0;
+			out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
+		}
+
+		/* We've reached the end of the input */
+		if (in_buf.pos >= len) {
+			tot_in += in_buf.pos;
+			break;
+		}
+
+		/* Check if we need more input */
+		if (in_buf.pos == in_buf.size) {
+			tot_in += PAGE_SIZE;
+			kunmap(in_page);
+			put_page(in_page);
+
+			start += PAGE_SIZE;
+			len -= PAGE_SIZE;
+			in_page = find_get_page(mapping, start >> PAGE_SHIFT);
+			in_buf.src = kmap(in_page);
+			in_buf.pos = 0;
+			in_buf.size = min_t(size_t, len, PAGE_SIZE);
+		}
+	}
+	while (1) {
+		const size_t rc = ZSTD_endStream(stream, &out_buf);
+		if (ZSTD_isError(rc)) {
+			pr_debug("BTRFS: ZSTD_endStream returned %d\n",
+					ZSTD_getErrorCode(rc));
+			ret = -EIO;
+			goto out;
+		}
+		if (rc == 0) {
+			tot_out += out_buf.pos;
+			break;
+		}
+		if (out_buf.pos >= max_out) {
+			tot_out += out_buf.pos;
+			ret = -E2BIG;
+			goto out;
+		}
+
+		tot_out += PAGE_SIZE;
+		max_out -= PAGE_SIZE;
+		kunmap(out_page);
+		if (nr_pages == nr_dest_pages) {
+			out_page = NULL;
+			ret = -E2BIG;
+			goto out;
+		}
+		out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
+		if (out_page == NULL) {
+			ret = -ENOMEM;
+			goto out;
+		}
+		pages[nr_pages++] = out_page;
+		out_buf.dst = kmap(out_page);
+		out_buf.pos = 0;
+		out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
+	}
+
+	if (tot_out >= tot_in) {
+		ret = -E2BIG;
+		goto out;
+	}
+
+	ret = 0;
+	*total_in = tot_in;
+	*total_out = tot_out;
+out:
+	*out_pages = nr_pages;
+	/* Cleanup */
+	if (in_page) {
+		kunmap(in_page);
+		put_page(in_page);
+	}
+	if (out_page) { kunmap(out_page); }
+	return ret;
+}
+
+static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
+		u64 disk_start,
+		struct bio_vec *bvec,
+		int vcnt,
+		size_t srclen)
+{
+	struct workspace *workspace = list_entry(ws, struct workspace, list);
+	ZSTD_DStream *stream;
+	int ret = 0;
+	unsigned long page_in_index = 0;
+	unsigned long page_out_index = 0;
+	unsigned long total_pages_in = DIV_ROUND_UP(srclen, PAGE_SIZE);
+	unsigned long buf_start;
+	unsigned long pg_offset;
+	unsigned long total_out = 0;
+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
+
+	stream = ZSTD_createDStream(
+			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
+	if (!stream) {
+		pr_debug("BTRFS: ZSTD_createDStream failed\n");
+		ret = -EIO;
+		goto done;
+	}
+
+	in_buf.src = kmap(pages_in[page_in_index]);
+	in_buf.pos = 0;
+	in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
+
+	out_buf.dst = workspace->buf;
+	out_buf.pos = 0;
+	out_buf.size = PAGE_SIZE;
+
+	pg_offset = 0;
+
+	while (1) {
+		const size_t rc = ZSTD_decompressStream(stream, &out_buf, &in_buf);
+		if (zstd_is_error(rc)) {
+			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
+					zstd_get_error_code(rc));
+			ret = -EIO;
+			goto done;
+		}
+		buf_start = total_out;
+		total_out += out_buf.pos;
+		out_buf.pos = 0;
+
+		{
+			int ret2 = btrfs_decompress_buf2page(out_buf.dst, buf_start,
+					total_out, disk_start, bvec, vcnt,
+					&page_out_index, &pg_offset);
+			if (ret2 == 0) {
+				break;
+			}
+		}
+
+		if (in_buf.pos >= srclen) {
+			break;
+		}
+
+		/* Check if we've hit the end of a frame */
+		if (rc == 0) {
+			break;
+		}
+
+		if (in_buf.pos == in_buf.size) {
+			kunmap(pages_in[page_in_index++]);
+			if (page_in_index >= total_pages_in) {
+				in_buf.src = NULL;
+				ret = -EIO;
+				goto done;
+			}
+			srclen -= PAGE_SIZE;
+			in_buf.src = kmap(pages_in[page_in_index]);
+			in_buf.pos = 0;
+			in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
+		}
+	}
+	btrfs_clear_biovec_end(bvec, vcnt, page_out_index, pg_offset);
+	ret = 0;
+done:
+	if (in_buf.src) { kunmap(pages_in[page_in_index]); }
+	return ret;
+}
+
+static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
+		struct page *dest_page,
+		unsigned long start_byte,
+		size_t srclen, size_t destlen)
+{
+	struct workspace *workspace = list_entry(ws, struct workspace, list);
+	ZSTD_DStream *stream;
+	int ret = 0;
+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
+	unsigned long total_out = 0;
+	unsigned long pg_offset = 0;
+	char *kaddr;
+
+	stream = ZSTD_createDStream(
+			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
+	if (!stream) {
+		pr_warn("BTRFS: ZSTD_createDStream failed\n");
+		ret = -EIO;
+		goto finish;
+	}
+
+	destlen = min_t(size_t, destlen, PAGE_SIZE);
+
+	in_buf.src = data_in;
+	in_buf.pos = 0;
+	in_buf.size = srclen;
+
+	out_buf.dst = workspace->buf;
+	out_buf.pos = 0;
+	out_buf.size = PAGE_SIZE;
+
+	ret = 1;
+	while (pg_offset < destlen && in_buf.pos < in_buf.size) {
+		unsigned long buf_start;
+		unsigned long buf_offset;
+		unsigned long bytes;
+
+		/* Check if the frame is over and we still need more input */
+		if (ret == 0) {
+			pr_debug("BTRFS: ZSTD_decompressStream frame ended to early\n");
+			ret = -EIO;
+			goto finish;
+		}
+		{
+			const size_t rc = ZSTD_decompressStream(stream, &out_buf, &in_buf);
+			if (ZSTD_isError(rc)) {
+				pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
+						ZSTD_getErrorCode(rc));
+				ret = -EIO;
+				goto finish;
+			}
+			ret = rc > 0;
+		}
+		buf_start = total_out;
+		total_out += out_buf.pos;
+		out_buf.pos = 0;
+
+		if (total_out <= start_byte) {
+			continue;
+		}
+
+		if (total_out > start_byte && buf_start < start_byte) {
+			buf_offset = start_byte - buf_start;
+		} else {
+			buf_offset = 0;
+		}
+
+		bytes = min_t(unsigned long, destlen - pg_offset,
+				out_buf.size - buf_offset);
+
+		kaddr = kmap_atomic(dest_page);
+		memcpy(kaddr + pg_offset, out_buf.dst + buf_offset, bytes);
+		kunmap_atomic(kaddr);
+
+		pg_offset += bytes;
+	}
+	ret = 0;
+finish:
+	if (pg_offset < destlen) {
+		kaddr = kmap_atomic(dest_page);
+		memset(kaddr + pg_offset, 0, destlen - pg_offset);
+		kunmap_atomic(kaddr);
+	}
+	return ret;
+}
+
+const struct btrfs_compress_op btrfs_zstd_compress = {
+	.alloc_workspace = zstd_alloc_workspace,
+	.free_workspace = zstd_free_workspace,
+	.compress_pages = zstd_compress_pages,
+	.decompress_biovec = zstd_decompress_biovec,
+	.decompress = zstd_decompress,
+};

From 585910139623485db5a96b7ae6ef6059202ae07b Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 17:00:12 -0700
Subject: [PATCH 125/255] Move Makefile to lib/zstd

---
 contrib/linux-kernel/lib/Makefile | 9 ---------
 1 file changed, 9 deletions(-)
 delete mode 100644 contrib/linux-kernel/lib/Makefile

diff --git a/contrib/linux-kernel/lib/Makefile b/contrib/linux-kernel/lib/Makefile
deleted file mode 100644
index 53b4deec9..000000000
--- a/contrib/linux-kernel/lib/Makefile
+++ /dev/null
@@ -1,9 +0,0 @@
-obj-$(CONFIG_ZSTD_COMPRESS) += zstd_compress.o
-obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
-
-ccflags-y += -O3
-
-zstd_compress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
-				fse_compress.o huf_compress.o zstd_compress.o
-zstd_decompress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
-				huf_decompress.o zstd_decompress.o

From 2e4dbd2105faf5f43f65c18d920dc0e365c0c2b5 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 17:02:28 -0700
Subject: [PATCH 126/255] Really move the makefile

---
 contrib/linux-kernel/lib/zstd/Makefile | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 contrib/linux-kernel/lib/zstd/Makefile

diff --git a/contrib/linux-kernel/lib/zstd/Makefile b/contrib/linux-kernel/lib/zstd/Makefile
new file mode 100644
index 000000000..53b4deec9
--- /dev/null
+++ b/contrib/linux-kernel/lib/zstd/Makefile
@@ -0,0 +1,9 @@
+obj-$(CONFIG_ZSTD_COMPRESS) += zstd_compress.o
+obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
+
+ccflags-y += -O3
+
+zstd_compress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
+				fse_compress.o huf_compress.o zstd_compress.o
+zstd_decompress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
+				huf_decompress.o zstd_decompress.o

From c53bacc8810d93e125bf56b34acbd87650608c8a Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 17:03:48 -0700
Subject: [PATCH 127/255] Fix up some old names

---
 contrib/linux-kernel/fs/btrfs/zstd.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/contrib/linux-kernel/fs/btrfs/zstd.c b/contrib/linux-kernel/fs/btrfs/zstd.c
index 4f856700e..23a3692ad 100644
--- a/contrib/linux-kernel/fs/btrfs/zstd.c
+++ b/contrib/linux-kernel/fs/btrfs/zstd.c
@@ -270,9 +270,9 @@ static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
 
 	while (1) {
 		const size_t rc = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-		if (zstd_is_error(rc)) {
+		if (ZSTD_isError(rc)) {
 			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-					zstd_get_error_code(rc));
+					ZSTD_getErrorCode(rc));
 			ret = -EIO;
 			goto done;
 		}

From 1b3856463e24652e0f753b1ee8e1ff19d7b006d6 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 17:21:49 -0700
Subject: [PATCH 128/255] Undef current if defined

---
 contrib/linux-kernel/lib/zstd/zstd_compress.c | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/contrib/linux-kernel/lib/zstd/zstd_compress.c b/contrib/linux-kernel/lib/zstd/zstd_compress.c
index d4b87f280..00d18069a 100644
--- a/contrib/linux-kernel/lib/zstd/zstd_compress.c
+++ b/contrib/linux-kernel/lib/zstd/zstd_compress.c
@@ -19,6 +19,9 @@
 #include "huf.h"
 #include "zstd_internal.h"  /* includes zstd.h */
 
+#ifdef current
+#  undef current
+#endif
 
 /*-*************************************
 *  Constants

From bb213798d9cf3e688c0c9e48efceb988714cf406 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 18:09:02 -0700
Subject: [PATCH 129/255] Rename zstd_(de)compress.c to (de)compress.c

---
 contrib/linux-kernel/lib/zstd/Makefile                        | 4 ++--
 contrib/linux-kernel/lib/zstd/{zstd_compress.c => compress.c} | 0
 .../linux-kernel/lib/zstd/{zstd_decompress.c => decompress.c} | 0
 3 files changed, 2 insertions(+), 2 deletions(-)
 rename contrib/linux-kernel/lib/zstd/{zstd_compress.c => compress.c} (100%)
 rename contrib/linux-kernel/lib/zstd/{zstd_decompress.c => decompress.c} (100%)

diff --git a/contrib/linux-kernel/lib/zstd/Makefile b/contrib/linux-kernel/lib/zstd/Makefile
index 53b4deec9..067f68d19 100644
--- a/contrib/linux-kernel/lib/zstd/Makefile
+++ b/contrib/linux-kernel/lib/zstd/Makefile
@@ -4,6 +4,6 @@ obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
 ccflags-y += -O3
 
 zstd_compress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
-				fse_compress.o huf_compress.o zstd_compress.o
+				fse_compress.o huf_compress.o compress.o
 zstd_decompress-y := entropy_common.o fse_decompress.o xxhash.o zstd_common.o \
-				huf_decompress.o zstd_decompress.o
+				huf_decompress.o decompress.o
diff --git a/contrib/linux-kernel/lib/zstd/zstd_compress.c b/contrib/linux-kernel/lib/zstd/compress.c
similarity index 100%
rename from contrib/linux-kernel/lib/zstd/zstd_compress.c
rename to contrib/linux-kernel/lib/zstd/compress.c
diff --git a/contrib/linux-kernel/lib/zstd/zstd_decompress.c b/contrib/linux-kernel/lib/zstd/decompress.c
similarity index 100%
rename from contrib/linux-kernel/lib/zstd/zstd_decompress.c
rename to contrib/linux-kernel/lib/zstd/decompress.c

From 60b34b0d1cf0ed532d26f2b77e2c2768308282dc Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 18:12:40 -0700
Subject: [PATCH 130/255] fix gitignore

---
 contrib/linux-kernel/.gitignore | 4 ++++
 1 file changed, 4 insertions(+)
 create mode 100644 contrib/linux-kernel/.gitignore

diff --git a/contrib/linux-kernel/.gitignore b/contrib/linux-kernel/.gitignore
new file mode 100644
index 000000000..d8dfeef21
--- /dev/null
+++ b/contrib/linux-kernel/.gitignore
@@ -0,0 +1,4 @@
+!lib/zstd
+!lib/zstd/*
+*.o
+*.a

From 7f510a7797c0b96fd16ae62844ceca3954ace0c1 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 18:37:55 -0700
Subject: [PATCH 131/255] Add Kconfig and Makefile diffs

---
 contrib/linux-kernel/lib/Kconfig.diff  | 17 +++++++++++++++++
 contrib/linux-kernel/lib/Makefile.diff | 13 +++++++++++++
 2 files changed, 30 insertions(+)
 create mode 100644 contrib/linux-kernel/lib/Kconfig.diff
 create mode 100644 contrib/linux-kernel/lib/Makefile.diff

diff --git a/contrib/linux-kernel/lib/Kconfig.diff b/contrib/linux-kernel/lib/Kconfig.diff
new file mode 100644
index 000000000..07ae5398f
--- /dev/null
+++ b/contrib/linux-kernel/lib/Kconfig.diff
@@ -0,0 +1,17 @@
+diff --git a/lib/Kconfig b/lib/Kconfig
+index 260a80e..39d9347 100644
+--- a/lib/Kconfig
++++ b/lib/Kconfig
+@@ -239,6 +239,12 @@ config LZ4HC_COMPRESS
+ config LZ4_DECOMPRESS
+ 	tristate
+ 
++config ZSTD_COMPRESS
++	tristate
++
++config ZSTD_DECOMPRESS
++	tristate
++
+ source "lib/xz/Kconfig"
+ 
+ #
diff --git a/contrib/linux-kernel/lib/Makefile.diff b/contrib/linux-kernel/lib/Makefile.diff
new file mode 100644
index 000000000..be6182b39
--- /dev/null
+++ b/contrib/linux-kernel/lib/Makefile.diff
@@ -0,0 +1,13 @@
+diff --git a/lib/Makefile b/lib/Makefile
+index 50144a3..b30a998 100644
+--- a/lib/Makefile
++++ b/lib/Makefile
+@@ -106,6 +106,8 @@ obj-$(CONFIG_LZO_DECOMPRESS) += lzo/
+ obj-$(CONFIG_LZ4_COMPRESS) += lz4/
+ obj-$(CONFIG_LZ4HC_COMPRESS) += lz4/
+ obj-$(CONFIG_LZ4_DECOMPRESS) += lz4/
++obj-$(CONFIG_ZSTD_COMPRESS) += zstd/
++obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd/
+ obj-$(CONFIG_XZ_DEC) += xz/
+ obj-$(CONFIG_RAID6_PQ) += raid6/
+ 

From 97693aff9870db58fbc22bec9ec46ef1f74b3556 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 18:39:22 -0700
Subject: [PATCH 132/255] Add a README

---
 contrib/linux-kernel/README.md | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 contrib/linux-kernel/README.md

diff --git a/contrib/linux-kernel/README.md b/contrib/linux-kernel/README.md
new file mode 100644
index 000000000..11938ad62
--- /dev/null
+++ b/contrib/linux-kernel/README.md
@@ -0,0 +1,26 @@
+# Linux Kernel Patch
+
+There are two pieces, the `zstd_compress` and `zstd_decompress` kernel modules, and the BtrFS patch.
+The patches are based off of the linux kernel version 4.9.
+The BtrFS patch is not present in its entirety yet.
+
+## Zstd Kernel modules
+
+* The header is in `include/linux/zstd.h`.
+* It is split up into `zstd_compress` and `zstd_decompress`, which can be loaded independently.
+* Source files are in `lib/zstd/`.
+* `lib/Kconfig` and `lib/Makefile` need to be modified by applying `lib/Kconfig.diff` and `lib/Makefile.diff` respectively.
+* `test/UserlandTest.cpp` contains tests for the patch in userland by mocking the kernel headers.
+  It can be run with the following commands:
+  ```
+  cd test
+  make googletest
+  make UserlandTest
+  ./UserlandTest
+  ```
+
+## BtrFS
+
+* `fs/btrfs/zstd.c` is provided.
+* Some more glue is required to integrate it with BtrFS, but I haven't included the patches yet.
+  In the meantime see https://github.com/terrelln/linux/commit/1914f7d4ca6c539369c84853eafa4ac104883047 if you're interested.

From 9c7371b3eed89787f0ca469635f2e304e368375b Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 4 Apr 2017 18:49:07 -0700
Subject: [PATCH 133/255] Improve comments and ordering

---
 contrib/linux-kernel/include/linux/zstd.h | 98 +++++++++++++++--------
 1 file changed, 65 insertions(+), 33 deletions(-)

diff --git a/contrib/linux-kernel/include/linux/zstd.h b/contrib/linux-kernel/include/linux/zstd.h
index 101e3cb21..dcfcebff0 100644
--- a/contrib/linux-kernel/include/linux/zstd.h
+++ b/contrib/linux-kernel/include/linux/zstd.h
@@ -32,10 +32,6 @@
   The compression ratio achievable on small data can be highly improved using compression with a dictionary in:
 	- a single step (described as Simple dictionary API)
 	- a single step, reusing a dictionary (described as Fast dictionary API)
-
-  Advanced experimental functions can be accessed using #define ZSTD_STATIC_LINKING_ONLY before including zstd.h.
-  These APIs shall never be used with a dynamic library.
-  They are not "stable", their definition may change in the future. Only static linking is allowed.
 *********************************************************************************************************/
 
 /*------   Version   ------*/
@@ -121,28 +117,51 @@ typedef struct {
 	ZSTD_frameParameters fParams;
 } ZSTD_parameters;
 
-size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters params);
+/*! ZSTD_getCParams() :
+*   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
+*   `estimatedSrcSize` value is optional, select 0 if not known */
+ZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+/*! ZSTD_getParams() :
+*   same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
+*   All fields of `ZSTD_frameParameters` are set to default (0) */
+ZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+
+/*! ZSTD_CCtxWorkspaceBound() :
+*   Returns the minimum amount of memory that needs to be passed to ZSTD_createCCtx() in order to compress with `params.cParams`
+*   or a `cdict` created with `params.cParams`. */
+size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
 
 /*= Compression context
 *   When compressing many times,
 *   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   This will make workload friendlier for system's memory.
+*   The context pointer is placed in `workspace`, which must outlive the returned context.
 *   Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_CCtx_s ZSTD_CCtx;
 ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize);
 
 /*! ZSTD_compressCCtx() :
-	Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
+*    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()).
+*    Note : The workspace passed to ZSTD_createCCtx() must have been at least ZSTD_CCtxWorkspaceBound(params.cParams) bytes. */
 ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, ZSTD_parameters params);
 
+/*! ZSTD_compress_usingDict() :
+*   Compression using a predefined Dictionary (see dictBuilder/zdict.h).
+*   Note : The workspace passed to ZSTD_createCCtx() must have been at least ZSTD_CCtxWorkspaceBound(params.cParams) bytes.
+*   Note : This function loads the dictionary, resulting in significant startup delay.
+*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
 ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize, ZSTD_parameters params);
 
+/*! ZSTD_DCtxWorkspaceBound() :
+ *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDCtx(). */
 size_t ZSTD_DCtxWorkspaceBound(void);
 
 /*= Decompression context
 *   When decompressing many times,
 *   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   This will make workload friendlier for system's memory.
+*   The context pointer is placed in `workspace`, which must outlive the returned context.
+*   `workspace` must be at least ZSTD_DCtxWorkspaceBound() bytes.
 *   Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_DCtx_s ZSTD_DCtx;
 ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize);
@@ -151,12 +170,19 @@ ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize);
 *   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
 ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 
+/*! ZSTD_decompress_usingDict() :
+*   Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
+*   Dictionary must be identical to the one used during compression.
+*   Note : This function loads the dictionary, resulting in significant startup delay.
+*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
 ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize);
 
 /****************************
 *  Fast dictionary API
 ****************************/
-size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters params);
+/*! ZSTD_CDictWorkspaceBound() :
+ *  Returns the minimum amount of memory that needs to be passed to ZSTD_createCDict() when called with the given `params.cParams`. */
+size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
 
 typedef struct ZSTD_CDict_s ZSTD_CDict;
 
@@ -164,7 +190,9 @@ typedef struct ZSTD_CDict_s ZSTD_CDict;
 *   When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
 *   ZSTD_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
 *   ZSTD_CDict can be created once and used by multiple threads concurrently, as its usage is read-only.
-*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the CDict */
+*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the CDict.
+*   The cdict pointer is placed in `workspace`, which must outlive the returned cdict.
+*   `workspace` must be at least ZSTD_CDictWorkspaceBound(params.cParams) bytes. */
 ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize);
 
 /*! ZSTD_compress_usingCDict() :
@@ -177,13 +205,17 @@ ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
 									  const ZSTD_CDict* cdict);
 
 
+/*! ZSTD_DDictWorkspaceBound() :
+ *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDDict(). */
 size_t ZSTD_DDictWorkspaceBound(void);
 
 typedef struct ZSTD_DDict_s ZSTD_DDict;
 
 /*! ZSTD_createDDict() :
 *   Create a digested dictionary, ready to start decompression operation without startup delay.
-*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the DDict */
+*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the DDict.
+*   The ddict pointer is placed in `workspace`, which must outlive the returned ddict.
+*   `workspace` must be at least ZSTD_DDictWorkspaceBound() bytes. */
 ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize, void* workspace, size_t workspaceSize);
 
 /*! ZSTD_decompress_usingDDict() :
@@ -219,13 +251,12 @@ typedef struct ZSTD_outBuffer_s {
 *  A ZSTD_CStream object is required to track streaming operation.
 *  Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.
 *  ZSTD_CStream objects can be reused multiple times on consecutive compression operations.
-*  It is recommended to re-use ZSTD_CStream in situations where many streaming operations will be achieved consecutively,
-*  since it will play nicer with system's memory, by re-using already allocated memory.
+*  It is recommended to re-use ZSTD_CStream in situations where many streaming operations will be achieved consecutively.
 *  Use one separate ZSTD_CStream per thread for parallel execution.
 *
 *  Start a new compression by initializing ZSTD_CStream.
 *  Use ZSTD_initCStream() to start a new compression operation.
-*  Use ZSTD_initCStream_usingDict() or ZSTD_initCStream_usingCDict() for a compression which requires a dictionary (experimental section)
+*  Use  ZSTD_initCStream_usingCDict() for a compression which requires a dictionary.
 *
 *  Use ZSTD_compressStream() repetitively to consume input stream.
 *  The function will automatically update both `pos` fields.
@@ -252,11 +283,22 @@ typedef struct ZSTD_outBuffer_s {
 *
 * *******************************************************************/
 
-size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters params);
+/*! ZSTD_CStreamWorkspaceBound() :
+ *  Returns the minimum amount of memory that needs to be passed to ZSTD_createCStream() or ZSTD_createCStream_usingCDict()
+ *  when called with the given `params.cParams` or `cdict` created with `params.cParams`. */
+size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams);
 
 typedef struct ZSTD_CStream_s ZSTD_CStream;
 /*===== ZSTD_CStream management functions =====*/
+/*! ZSTD_createCStream() :
+*   Creates a cstream using params.
+*   Callers may optionally provide the size of the source they intend to compress, or pass 0 if unknown.
+*   The stream is placed in `workspace`, which must outlive the returned stream.
+*   `workspace` must be at least ZSTD_CStreamWorkspaceBound(params.cParams) bytes. */
 ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
+/*! ZSTD_createCStream_usingCDict() :
+*   Similar to ZSTD_createCStream(), but use the given preprocessed dictionary.
+*/
 ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
 
 /*===== Streaming compression functions =====*/
@@ -292,11 +334,19 @@ ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output
 *            The return value is a suggested next input size (a hint to improve latency) that will never load more than the current frame.
 * *******************************************************************************/
 
+/*! ZSTD_DStreamWorkspaceBound() :
+ *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDStream() to decompress frames with windowSize <= maxWindowSize. */
 size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
+/*! ZSTD_createDStream() :
+*   Creates a dstream that can decompress frames with windowSize up to maxWindowSize.
+*   The stream is placed in `workspace`, which must outlive the returned stream.
+*   `workspace` must be at least ZSTD_DStreamWorkspaceBound(maxWindowSize) bytes. */
 ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize);
+/*! ZSTD_createDStream_usingDDict() :
+*   Similar to ZSTD_createCStream(), but use the given preprocessed dictionary. */
 ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize);
 
 /*===== Streaming decompression functions =====*/
@@ -307,14 +357,6 @@ ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input
 ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
 
 
-/****************************************************************************************
- * START OF ADVANCED AND EXPERIMENTAL FUNCTIONS
- * The definitions in this section are considered experimental.
- * They should never be used with a dynamic library, as they may change in the future.
- * They are provided for advanced usages.
- * Use them only in association with static linking.
- * ***************************************************************************************/
-
 /* --- Constants ---*/
 #define ZSTD_MAGICNUMBER            0xFD2FB528   /* >= v0.8.0 */
 #define ZSTD_MAGIC_SKIPPABLE_START  0x184D2A50U
@@ -397,16 +439,6 @@ ZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t
 /***************************************
 *  Advanced compression functions
 ***************************************/
-/*! ZSTD_getCParams() :
-*   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
-*   `estimatedSrcSize` value is optional, select 0 if not known */
-ZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
-
-/*! ZSTD_getParams() :
-*   same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
-*   All fields of `ZSTD_frameParameters` are set to default (0) */
-ZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
-
 /*! ZSTD_checkCParams() :
 *   Ensure param values remain within authorized range */
 ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);

From 02d37aa1c10d71e8b96dbe8903448f15ee7c6061 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 5 Apr 2017 14:53:51 -0700
Subject: [PATCH 134/255] ensure correct size of internal buffers in case of
 error

---
 lib/compress/zstd_compress.c | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index b3e0b4b3a..6032e16bc 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3037,18 +3037,21 @@ size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
     /* allocate buffers */
     {   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
         if (zcs->inBuffSize < neededInBuffSize) {
-            zcs->inBuffSize = neededInBuffSize;
+            zcs->inBuffSize = 0;
             ZSTD_free(zcs->inBuff, zcs->customMem);
             zcs->inBuff = (char*) ZSTD_malloc(neededInBuffSize, zcs->customMem);
             if (zcs->inBuff == NULL) return ERROR(memory_allocation);
+            zcs->inBuffSize = neededInBuffSize;
         }
         zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
     }
     if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize)+1) {
-        zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize)+1;
+        size_t const outBuffSize = ZSTD_compressBound(zcs->blockSize)+1;
+        zcs->outBuffSize = 0;
         ZSTD_free(zcs->outBuff, zcs->customMem);
-        zcs->outBuff = (char*) ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
+        zcs->outBuff = (char*) ZSTD_malloc(outBuffSize, zcs->customMem);
         if (zcs->outBuff == NULL) return ERROR(memory_allocation);
+        zcs->outBuffSize = outBuffSize;
     }
 
     if (dict && dictSize >= 8) {

From 003a24432432e137aac68e8d73ea5f56d4da9fb6 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 5 Apr 2017 15:28:56 -0700
Subject: [PATCH 135/255] DStream : ensure correct size of internal buffers in
 case of error

---
 lib/decompress/zstd_decompress.c | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/lib/decompress/zstd_decompress.c b/lib/decompress/zstd_decompress.c
index 06337dbd5..7499b8ae1 100644
--- a/lib/decompress/zstd_decompress.c
+++ b/lib/decompress/zstd_decompress.c
@@ -2380,15 +2380,17 @@ size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inB
                 zds->blockSize = blockSize;
                 if (zds->inBuffSize < blockSize) {
                     ZSTD_free(zds->inBuff, zds->customMem);
-                    zds->inBuffSize = blockSize;
+                    zds->inBuffSize = 0;
                     zds->inBuff = (char*)ZSTD_malloc(blockSize, zds->customMem);
                     if (zds->inBuff == NULL) return ERROR(memory_allocation);
+                    zds->inBuffSize = blockSize;
                 }
                 if (zds->outBuffSize < neededOutSize) {
                     ZSTD_free(zds->outBuff, zds->customMem);
-                    zds->outBuffSize = neededOutSize;
+                    zds->outBuffSize = 0;
                     zds->outBuff = (char*)ZSTD_malloc(neededOutSize, zds->customMem);
                     if (zds->outBuff == NULL) return ERROR(memory_allocation);
+                    zds->outBuffSize = neededOutSize;
             }   }
             zds->stage = zdss_read;
             /* pass-through */

From ce80098f14ee5ea502f3c7ea9a7fcbbeb6111662 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 5 Apr 2017 16:34:09 -0700
Subject: [PATCH 136/255] improved zstreamtest --mt to trap bug #644

---
 tests/zstreamtest.c | 16 ++++++++++------
 1 file changed, 10 insertions(+), 6 deletions(-)

diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index e1e68b01c..270c0221b 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -667,7 +667,8 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compres
         if ((FUZ_rand(&lseed)&1) /* at beginning, to keep same nb of rand */
             && oldTestLog /* at least one test happened */ && resetAllowed) {
             maxTestSize = FUZ_randomLength(&lseed, oldTestLog+2);
-            if (maxTestSize >= srcBufferSize) maxTestSize = srcBufferSize-1;
+            if (maxTestSize >= srcBufferSize)
+                maxTestSize = srcBufferSize-1;
             {   U64 const pledgedSrcSize = (FUZ_rand(&lseed) & 3) ? 0 : maxTestSize;
                 size_t const resetError = ZSTD_resetCStream(zc, pledgedSrcSize);
                 CHECK(ZSTD_isError(resetError), "ZSTD_resetCStream error : %s", ZSTD_getErrorName(resetError));
@@ -675,14 +676,14 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, double compres
         } else {
             U32 const testLog = FUZ_rand(&lseed) % maxSrcLog;
             U32 const dictLog = FUZ_rand(&lseed) % maxSrcLog;
-            U32 const cLevel = (FUZ_rand(&lseed) %
+            U32 const cLevel = ( FUZ_rand(&lseed) %
                                 (ZSTD_maxCLevel() -
-                                 (MAX(testLog, dictLog) / cLevelLimiter))) +
-                               1;
+                                (MAX(testLog, dictLog) / cLevelLimiter)))
+                                 + 1;
             maxTestSize = FUZ_rLogLength(&lseed, testLog);
             oldTestLog = testLog;
             /* random dictionary selection */
-            dictSize  = ((FUZ_rand(&lseed)&63)==1) ? FUZ_rLogLength(&lseed, dictLog) : 0;
+            dictSize  = ((FUZ_rand(&lseed)&1)==1) ? FUZ_rLogLength(&lseed, dictLog) : 0;
             {   size_t const dictStart = FUZ_rand(&lseed) % (srcBufferSize - dictSize);
                 dict = srcBuffer + dictStart;
             }
@@ -935,9 +936,11 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
             }
             {   U64 const pledgedSrcSize = (FUZ_rand(&lseed) & 3) ? 0 : maxTestSize;
                 ZSTD_parameters params = ZSTD_getParams(cLevel, pledgedSrcSize, dictSize);
-                DISPLAYLEVEL(5, "Init with windowLog = %u \n", params.cParams.windowLog);
+                DISPLAYLEVEL(5, "Init with windowLog = %u and pledgedSrcSize = %u \n",
+                    params.cParams.windowLog, (U32)pledgedSrcSize);
                 params.fParams.checksumFlag = FUZ_rand(&lseed) & 1;
                 params.fParams.noDictIDFlag = FUZ_rand(&lseed) & 1;
+                params.fParams.contentSizeFlag = pledgedSrcSize>0;
                 { size_t const initError = ZSTDMT_initCStream_advanced(zc, dict, dictSize, params, pledgedSrcSize);
                   CHECK (ZSTD_isError(initError),"ZSTDMT_initCStream_advanced error : %s", ZSTD_getErrorName(initError)); }
                 ZSTDMT_setMTCtxParameter(zc, ZSTDMT_p_overlapSectionLog, FUZ_rand(&lseed) % 12);
@@ -1009,6 +1012,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                 size_t const dstBuffSize = MIN(dstBufferSize - totalGenSize, randomDstSize);
                 inBuff.size = inBuff.pos + readCSrcSize;
                 outBuff.size = inBuff.pos + dstBuffSize;
+                DISPLAYLEVEL(5, "ZSTD_decompressStream input %u bytes \n", (U32)readCSrcSize);
                 decompressionResult = ZSTD_decompressStream(zd, &outBuff, &inBuff);
                 CHECK (ZSTD_isError(decompressionResult), "decompression error : %s", ZSTD_getErrorName(decompressionResult));
             }

From 36c2a03757feb1dc44a19bf03f2b78e66325313c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 5 Apr 2017 22:06:21 -0700
Subject: [PATCH 137/255] updated comments for ZSTD_resetCStream()

---
 lib/zstd.h | 12 ++++++++++--
 1 file changed, 10 insertions(+), 2 deletions(-)

diff --git a/lib/zstd.h b/lib/zstd.h
index 153e244be..6066db45e 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -588,13 +588,21 @@ ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
 
 /*=====   Advanced Streaming compression functions  =====*/
 ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);   /**< size of CStream is variable, depending primarily on compression level */
 ZSTDLIB_API size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   /**< pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
 ZSTDLIB_API size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); /**< note: a dict will not be used if dict == NULL or dictSize < 8 */
 ZSTDLIB_API size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
                                              ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
 ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
-ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
-ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
+
+/*! ZSTD_resetCStream() :
+ *  start a new compression job, using same parameters from previous job.
+ *  This is typically useful to skip dictionary loading stage, since it will re-use it in-place..
+ *  Note that zcs must be init at least once before using ZSTD_resetCStream().
+ *  pledgedSrcSize==0 means "srcSize unknown".
+ *  If pledgedSrcSize > 0, its value must be correct, as it will be written in header, and controlled at the end.
+ *  @return : 0, or an error code (which can be tested using ZSTD_isError()) */
+ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);
 
 
 /*=====   Advanced Streaming decompression functions  =====*/

From 0181fef545229e54b77e78dcf1d18078010940b3 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 6 Apr 2017 01:25:26 -0700
Subject: [PATCH 138/255] ensure cctx internal buffer is correctly sized in
 case of memory error

---
 lib/compress/zstd_compress.c | 1 +
 1 file changed, 1 insertion(+)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 6032e16bc..4ad978a4b 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -278,6 +278,7 @@ static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
             size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
                                   + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
             if (zc->workSpaceSize < neededSpace) {
+                zc->workSpaceSize = 0;
                 ZSTD_free(zc->workSpace, zc->customMem);
                 zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
                 if (zc->workSpace == NULL) return ERROR(memory_allocation);

From e128ac096f0d3a9eb683d9f1158a298adeae8f13 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 6 Apr 2017 10:15:32 -0700
Subject: [PATCH 139/255] Don't build zstd release binary with debug symbols

---
 appveyor.yml | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/appveyor.yml b/appveyor.yml
index 81f76926e..5f0b82e80 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -88,6 +88,8 @@
       ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe ) &&
       ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true]
           lib\dll\example\build_package.bat &&
+          make -C programs DEBUGFLAGS= clean zstd &&
+          cp programs\zstd.exe bin\zstd.exe &&
           make -C programs DEBUGFLAGS= clean zstdmt &&
           cp programs\zstd.exe bin\zstdmt.exe &&
           cd bin\ && 7z a -tzip zstd-win-release-%PLATFORM%.zip * &&

From 17c12cbca62100389240006689413a1b011365c1 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 6 Apr 2017 10:34:09 -0700
Subject: [PATCH 140/255] Push both artifacts without debug symbols

---
 appveyor.yml | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/appveyor.yml b/appveyor.yml
index 5f0b82e80..27994853a 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -85,10 +85,11 @@
       SET "CPPFLAGS=-I../../zlib" &&
       SET "LDFLAGS=../../zlib/libz.a" &&
       sh -c "%SCRIPT%" &&
-      ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] COPY programs\zstd.exe zstd_%PLATFORM%.exe && appveyor PushArtifact zstd_%PLATFORM%.exe ) &&
       ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true]
           lib\dll\example\build_package.bat &&
           make -C programs DEBUGFLAGS= clean zstd &&
+          cp programs\zstd.exe zstd_%PLATFORM%.exe &&
+          appveyor PushArtifact zstd_%PLATFORM%.exe &&
           cp programs\zstd.exe bin\zstd.exe &&
           make -C programs DEBUGFLAGS= clean zstdmt &&
           cp programs\zstd.exe bin\zstdmt.exe &&

From 279be2015b4af98200b4d6b3e32c1b0155f51cd2 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 6 Apr 2017 12:56:40 -0700
Subject: [PATCH 141/255] Let zstd overwrite read-only files

---
 programs/fileio.c | 47 +++++++++++++++++++++++++++++++++++------------
 1 file changed, 35 insertions(+), 12 deletions(-)

diff --git a/programs/fileio.c b/programs/fileio.c
index 78fb9a268..b384c3c2b 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -31,6 +31,11 @@
 #include <time.h>       /* clock */
 #include <errno.h>      /* errno */
 
+#if defined (_MSC_VER)
+#  include <sys/stat.h>
+#  include <io.h>
+#endif
+
 #include "mem.h"
 #include "fileio.h"
 #define ZSTD_STATIC_LINKING_ONLY   /* ZSTD_magicNumber, ZSTD_frameHeaderSize_max */
@@ -188,6 +193,18 @@ void FIO_setOverlapLog(unsigned overlapLog){
 /*-*************************************
 *  Functions
 ***************************************/
+/** FIO_remove() :
+ * @result : Unlink `fileName`, even if it's read-only */
+static int FIO_remove(const char* path)
+{
+#if defined(_WIN32) || defined(WIN32)
+    /* windows doesn't allow remove read-only files, so try to make it
+     * writable first */
+    chmod(path, _S_IWRITE);
+#endif
+    return remove(path);
+}
+
 /** FIO_openSrcFile() :
  * condition : `dstFileName` must be non-NULL.
  * @result : FILE* to `dstFileName`, or NULL if it fails */
@@ -230,23 +247,29 @@ static FILE* FIO_openDstFile(const char* dstFileName)
         if (g_sparseFileSupport == 1) {
             g_sparseFileSupport = ZSTD_SPARSE_DEFAULT;
         }
-        if (!g_overwrite && strcmp (dstFileName, nulmark)) {  /* Check if destination file already exists */
+        if (strcmp (dstFileName, nulmark)) {  /* Check if destination file already exists */
             f = fopen( dstFileName, "rb" );
             if (f != 0) {  /* dest file exists, prompt for overwrite authorization */
                 fclose(f);
-                if (g_displayLevel <= 1) {
-                    /* No interaction possible */
-                    DISPLAY("zstd: %s already exists; not overwritten  \n", dstFileName);
-                    return NULL;
-                }
-                DISPLAY("zstd: %s already exists; do you wish to overwrite (y/N) ? ", dstFileName);
-                {   int ch = getchar();
-                    if ((ch!='Y') && (ch!='y')) {
-                        DISPLAY("    not overwritten  \n");
+                if (!g_overwrite) {
+                    if (g_displayLevel <= 1) {
+                        /* No interaction possible */
+                        DISPLAY("zstd: %s already exists; not overwritten  \n", dstFileName);
                         return NULL;
                     }
-                    while ((ch!=EOF) && (ch!='\n')) ch = getchar();  /* flush rest of input line */
-        }   }   }
+                    DISPLAY("zstd: %s already exists; do you wish to overwrite (y/N) ? ", dstFileName);
+                    {   int ch = getchar();
+                        if ((ch!='Y') && (ch!='y')) {
+                            DISPLAY("    not overwritten  \n");
+                            return NULL;
+                        }
+                        while ((ch!=EOF) && (ch!='\n')) ch = getchar();  /* flush rest of input line */
+                    }
+                }
+
+                /* need to unlink */
+                FIO_remove(dstFileName);
+        }   }
         f = fopen( dstFileName, "wb" );
         if (f==NULL) DISPLAYLEVEL(1, "zstd: %s: %s\n", dstFileName, strerror(errno));
     }

From 9da11c6aaecff37e2b167f1e5d1e5c1463689f9a Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 6 Apr 2017 12:58:49 -0700
Subject: [PATCH 142/255] Add test for overwriting read-only

---
 tests/playTests.sh | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index 5abbb14e3..5409d9aa1 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -109,6 +109,13 @@ $ZSTD -q tmp && die "overwrite check failed!"
 $ECHO "test : force overwrite"
 $ZSTD -q -f tmp
 $ZSTD -q --force tmp
+$ECHO "test : overwrite readonly file"
+$ECHO foo > tmpro.zst
+$ECHO foo > tmpro
+chmod 400 tmpro.zst
+$ZSTD -q --force tmpro || die "failed to overwrite read-only file"
+chmod 600 tmpro.zst
+rm tmpro tmpro.zst
 $ECHO "test : file removal"
 $ZSTD -f --rm tmp
 ls tmp && die "tmp should no longer be present"

From 1652172b2d11e87ef26ad04a0406428cd13be3c1 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 6 Apr 2017 17:06:30 -0700
Subject: [PATCH 143/255] Add refuse to overwrite test and fix format

---
 tests/playTests.sh | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index 5409d9aa1..266bbd91b 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -110,12 +110,13 @@ $ECHO "test : force overwrite"
 $ZSTD -q -f tmp
 $ZSTD -q --force tmp
 $ECHO "test : overwrite readonly file"
+rm -f tmpro tmpro.zst
 $ECHO foo > tmpro.zst
 $ECHO foo > tmpro
 chmod 400 tmpro.zst
-$ZSTD -q --force tmpro || die "failed to overwrite read-only file"
-chmod 600 tmpro.zst
-rm tmpro tmpro.zst
+$ZSTD -q tmpro && die "should have refused to overwrite read-only file"
+$ZSTD -q -f tmpro
+rm -f tmpro tmpro.zst
 $ECHO "test : file removal"
 $ZSTD -f --rm tmp
 ls tmp && die "tmp should no longer be present"

From bed6c0a4b022f216933fd63db825a00f013a839a Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 10 Apr 2017 14:49:34 -0700
Subject: [PATCH 144/255] Remove ZSTDLIB_API from decompress.c

---
 contrib/linux-kernel/lib/zstd/decompress.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contrib/linux-kernel/lib/zstd/decompress.c b/contrib/linux-kernel/lib/zstd/decompress.c
index 9eb210af0..3fcef0105 100644
--- a/contrib/linux-kernel/lib/zstd/decompress.c
+++ b/contrib/linux-kernel/lib/zstd/decompress.c
@@ -1399,7 +1399,7 @@ size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx,
 
 /** ZSTD_insertBlock() :
 	insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
-ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
+size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
 {
 	ZSTD_checkContinuity(dctx, blockStart);
 	dctx->previousDstEnd = (const char*)blockStart + blockSize;

From adb1974aec3428e953732c9794922f1746602559 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 10 Apr 2017 14:50:03 -0700
Subject: [PATCH 145/255] Switch comments to kernel style + limit to 80 cols

---
 contrib/linux-kernel/include/linux/zstd.h | 1509 ++++++++++++++-------
 1 file changed, 1006 insertions(+), 503 deletions(-)

diff --git a/contrib/linux-kernel/include/linux/zstd.h b/contrib/linux-kernel/include/linux/zstd.h
index dcfcebff0..38b2bca69 100644
--- a/contrib/linux-kernel/include/linux/zstd.h
+++ b/contrib/linux-kernel/include/linux/zstd.h
@@ -7,354 +7,749 @@
  * of patent rights can be found in the PATENTS file in the same directory.
  */
 
-#ifndef ZSTD_H_235446
-#define ZSTD_H_235446
+#ifndef ZSTD_H
+#define ZSTD_H
 
 /* ======   Dependency   ======*/
 #include <linux/types.h>   /* size_t */
 
 
-/* =====   ZSTDLIB_API : control library symbols visibility   ===== */
-#define ZSTDLIB_API
-
-
-/*******************************************************************************************************
-  Introduction
-
-  zstd, short for Zstandard, is a fast lossless compression algorithm, targeting real-time compression scenarios
-  at zlib-level and better compression ratios. The zstd compression library provides in-memory compression and
-  decompression functions. The library supports compression levels from 1 up to ZSTD_maxCLevel() which is 22.
-  Levels >= 20, labeled `--ultra`, should be used with caution, as they require more memory.
-  Compression can be done in:
-	- a single step (described as Simple API)
-	- a single step, reusing a context (described as Explicit memory management)
-	- unbounded multiple steps (described as Streaming compression)
-  The compression ratio achievable on small data can be highly improved using compression with a dictionary in:
-	- a single step (described as Simple dictionary API)
-	- a single step, reusing a dictionary (described as Fast dictionary API)
-*********************************************************************************************************/
-
-/*------   Version   ------*/
-#define ZSTD_VERSION_MAJOR    1
-#define ZSTD_VERSION_MINOR    1
-#define ZSTD_VERSION_RELEASE  5
-
-#define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE
-#define ZSTD_QUOTE(str) #str
-#define ZSTD_EXPAND_AND_QUOTE(str) ZSTD_QUOTE(str)
-#define ZSTD_VERSION_STRING ZSTD_EXPAND_AND_QUOTE(ZSTD_LIB_VERSION)
-
-#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
-
+/*-*****************************************************************************
+ * Introduction
+ *
+ * zstd, short for Zstandard, is a fast lossless compression algorithm,
+ * targeting real-time compression scenarios at zlib-level and better
+ * compression ratios. The zstd compression library provides in-memory
+ * compression and decompression functions. The library supports compression
+ * levels from 1 up to ZSTD_maxCLevel() which is 22. Levels >= 20, labeled
+ * ultra, should be used with caution, as they require more memory.
+ * Compression can be done in:
+ *  - a single step, reusing a context (described as Explicit memory management)
+ *  - unbounded multiple steps (described as Streaming compression)
+ * The compression ratio achievable on small data can be highly improved using
+ * compression with a dictionary in:
+ *  - a single step (described as Simple dictionary API)
+ *  - a single step, reusing a dictionary (described as Fast dictionary API)
+ ******************************************************************************/
 
 /*======  Helper functions  ======*/
+
+/**
+ * enum ZSTD_ErrorCode - zstd error codes
+ *
+ * Functions that return size_t can be checked for errors using ZSTD_isError()
+ * and the ZSTD_ErrorCode can be extracted using ZSTD_getErrorCode().
+ */
 typedef enum {
-  ZSTD_error_no_error,
-  ZSTD_error_GENERIC,
-  ZSTD_error_prefix_unknown,
-  ZSTD_error_version_unsupported,
-  ZSTD_error_parameter_unknown,
-  ZSTD_error_frameParameter_unsupported,
-  ZSTD_error_frameParameter_unsupportedBy32bits,
-  ZSTD_error_frameParameter_windowTooLarge,
-  ZSTD_error_compressionParameter_unsupported,
-  ZSTD_error_init_missing,
-  ZSTD_error_memory_allocation,
-  ZSTD_error_stage_wrong,
-  ZSTD_error_dstSize_tooSmall,
-  ZSTD_error_srcSize_wrong,
-  ZSTD_error_corruption_detected,
-  ZSTD_error_checksum_wrong,
-  ZSTD_error_tableLog_tooLarge,
-  ZSTD_error_maxSymbolValue_tooLarge,
-  ZSTD_error_maxSymbolValue_tooSmall,
-  ZSTD_error_dictionary_corrupted,
-  ZSTD_error_dictionary_wrong,
-  ZSTD_error_dictionaryCreation_failed,
-  ZSTD_error_maxCode
+	ZSTD_error_no_error,
+	ZSTD_error_GENERIC,
+	ZSTD_error_prefix_unknown,
+	ZSTD_error_version_unsupported,
+	ZSTD_error_parameter_unknown,
+	ZSTD_error_frameParameter_unsupported,
+	ZSTD_error_frameParameter_unsupportedBy32bits,
+	ZSTD_error_frameParameter_windowTooLarge,
+	ZSTD_error_compressionParameter_unsupported,
+	ZSTD_error_init_missing,
+	ZSTD_error_memory_allocation,
+	ZSTD_error_stage_wrong,
+	ZSTD_error_dstSize_tooSmall,
+	ZSTD_error_srcSize_wrong,
+	ZSTD_error_corruption_detected,
+	ZSTD_error_checksum_wrong,
+	ZSTD_error_tableLog_tooLarge,
+	ZSTD_error_maxSymbolValue_tooLarge,
+	ZSTD_error_maxSymbolValue_tooSmall,
+	ZSTD_error_dictionary_corrupted,
+	ZSTD_error_dictionary_wrong,
+	ZSTD_error_dictionaryCreation_failed,
+	ZSTD_error_maxCode
 } ZSTD_ErrorCode;
 
-ZSTDLIB_API int         ZSTD_maxCLevel(void);               /*!< maximum compression level available */
-ZSTDLIB_API size_t      ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case scenario */
-/*! ZSTD_isError() :
-*   tells if a `size_t` function result is an error code */
-ZSTDLIB_API static __attribute__((unused)) unsigned ZSTD_isError(size_t code) {
+/**
+ * ZSTD_maxCLevel() - maximum compression level available
+ *
+ * Return: Maximum compression level available.
+ */
+int ZSTD_maxCLevel(void);
+/**
+ * ZSTD_compressBound() - maximum compressed size in worst case scenario
+ * @srcSize: The size of the data to compress.
+ *
+ * Return:   The maximum compressed size in the worst case scenario.
+ */
+size_t ZSTD_compressBound(size_t srcSize);
+/**
+ * ZSTD_isError() - tells if a size_t function result is an error code
+ * @code:  The function result to check for error.
+ *
+ * Return: Non-zero iff the code is an error.
+ */
+static __attribute__((unused)) unsigned int ZSTD_isError(size_t code)
+{
 	return code > (size_t)-ZSTD_error_maxCode;
 }
-/*! ZSTD_getErrorCode() :
-*   convert a `size_t` function result into a proper ZSTD_errorCode enum */
-ZSTDLIB_API static __attribute__((unused)) ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult) {
-	if (!ZSTD_isError(functionResult)) {
+/**
+ * ZSTD_getErrorCode() - translates an error function result to a ZSTD_ErrorCode
+ * @functionResult: The result of a function for which ZSTD_isError() is true.
+ *
+ * Return:          The ZSTD_ErrorCode corresponding to the functionResult or 0
+ *                  if the functionResult isn't an error.
+ */
+static __attribute__((unused)) ZSTD_ErrorCode ZSTD_getErrorCode(
+	size_t functionResult)
+{
+	if (!ZSTD_isError(functionResult))
 		return (ZSTD_ErrorCode)0;
-	}
 	return (ZSTD_ErrorCode)(0 - functionResult);
 }
 
-/***************************************
-*  Explicit memory management
-***************************************/
-
-typedef enum { ZSTD_fast, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2, ZSTD_btlazy2, ZSTD_btopt, ZSTD_btopt2 } ZSTD_strategy;   /* from faster to stronger */
+/**
+ * enum ZSTD_strategy - zstd compression search strategy
+ *
+ * From faster to stronger.
+ */
+typedef enum {
+	ZSTD_fast,
+	ZSTD_dfast,
+	ZSTD_greedy,
+	ZSTD_lazy,
+	ZSTD_lazy2,
+	ZSTD_btlazy2,
+	ZSTD_btopt,
+	ZSTD_btopt2
+} ZSTD_strategy;
 
+/**
+ * struct ZSTD_compressionParameters - zstd compression parameters
+ * @windowLog:    Log of the largest match distance. Larger means more
+ *                compression, and more memory needed during decompression.
+ * @chainLog:     Fully searched segment. Larger means more compression, slower,
+ *                and more memory (useless for fast).
+ * @hashLog:      Dispatch table. Larger means more compression,
+ *                slower, and more memory.
+ * @searchLog:    Number of searches. Larger means more compression and slower.
+ * @searchLength: Match length searched. Larger means faster decompression,
+ *                sometimes less compression.
+ * @targetLength: Acceptable match size for optimal parser (only). Larger means
+ *                more compression, and slower.
+ * @strategy:     The zstd compression strategy.
+ */
 typedef struct {
-	unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
-	unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
-	unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
-	unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
-	unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
-	unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
+	unsigned int windowLog;
+	unsigned int chainLog;
+	unsigned int hashLog;
+	unsigned int searchLog;
+	unsigned int searchLength;
+	unsigned int targetLength;
 	ZSTD_strategy strategy;
 } ZSTD_compressionParameters;
 
+/**
+ * struct ZSTD_frameParameters - zstd frame parameters
+ * @contentSizeFlag: Controls whether content size will be present in the frame
+ *                   header (when known).
+ * @checksumFlag:    Controls whether a 32-bit checksum is generated at the end
+ *                   of the frame for error detection.
+ * @noDictIDFlag:    Controls whether dictID will be saved into the frame header
+ *                   when using dictionary compression.
+ *
+ * The default value is all fields set to 0.
+ */
 typedef struct {
-	unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
-	unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
-	unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
+	unsigned int contentSizeFlag;
+	unsigned int checksumFlag;
+	unsigned int noDictIDFlag;
 } ZSTD_frameParameters;
 
+/**
+ * struct ZSTD_parameters - zstd parameters
+ * @cParams: The compression parameters.
+ * @fParams: The frame parameters.
+ */
 typedef struct {
 	ZSTD_compressionParameters cParams;
 	ZSTD_frameParameters fParams;
 } ZSTD_parameters;
 
-/*! ZSTD_getCParams() :
-*   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
-*   `estimatedSrcSize` value is optional, select 0 if not known */
-ZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+/**
+ * ZSTD_getCParams() - returns ZSTD_compressionParameters for selected level
+ * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
+ * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
+ * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
+ *
+ * Return:            The selected ZSTD_compressionParameters.
+ */
+ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel,
+	unsigned long long estimatedSrcSize, size_t dictSize);
 
-/*! ZSTD_getParams() :
-*   same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
-*   All fields of `ZSTD_frameParameters` are set to default (0) */
-ZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+/**
+ * ZSTD_getParams() - returns ZSTD_parameters for selected level
+ * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
+ * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
+ * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
+ *
+ * The same as ZSTD_getCParams() except also selects the default frame
+ * parameters (all zero).
+ *
+ * Return:            The selected ZSTD_parameters.
+ */
+ZSTD_parameters ZSTD_getParams(int compressionLevel,
+	unsigned long long estimatedSrcSize, size_t dictSize);
 
+/*-*************************************
+ * Explicit memory management
+ **************************************/
 
-/*! ZSTD_CCtxWorkspaceBound() :
-*   Returns the minimum amount of memory that needs to be passed to ZSTD_createCCtx() in order to compress with `params.cParams`
-*   or a `cdict` created with `params.cParams`. */
+/**
+ * ZSTD_CCtxWorkspaceBound() - the amount of memory needed to create a ZSTD_CCtx
+ * @cParams: The compression parameters to be used for compression.
+ *
+ * If multiple compression parameters might be used, the caller must call
+ * ZSTD_CCtxWorkspaceBound() for each set of parameters and use the maximum
+ * size.
+ *
+ * Return:   A lower bound on the size of the workspace that is passed to
+ *           ZSTD_createCCtx().
+ */
 size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
 
-/*= Compression context
-*   When compressing many times,
-*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   The context pointer is placed in `workspace`, which must outlive the returned context.
-*   Use one context per thread for parallel execution in multi-threaded environments. */
+/**
+ * struct ZSTD_CCtx - the zstd compression context
+ *
+ * When compressing many times it is recommended to allocate a context just once
+ * and reuse it for each successive compression operation.
+ */
 typedef struct ZSTD_CCtx_s ZSTD_CCtx;
-ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createCCtx() - create a zstd compression context
+ * @workspace:     The workspace to emplace the context into. It must outlive
+ *                 the returned context.
+ * @workspaceSize: The size of workspace. Use ZSTD_CCtxWorkspaceBound() to
+ *                 determine how large the workspace must be.
+ *
+ * Return:         A compression context emplaced into workspace.
+ */
+ZSTD_CCtx *ZSTD_createCCtx(void *workspace, size_t workspaceSize);
 
-/*! ZSTD_compressCCtx() :
-*    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()).
-*    Note : The workspace passed to ZSTD_createCCtx() must have been at least ZSTD_CCtxWorkspaceBound(params.cParams) bytes. */
-ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, ZSTD_parameters params);
+/**
+ * ZSTD_compressCCtx() - compress src into dst
+ * @ctx:         The context. Must have been created with a workspace at least
+ *               as large as ZSTD_CCtxWorkspaceBound(params.cParams).
+ * @dst:         The buffer to compress src into.
+ * @dstCapacity: The size of the destination buffer. May be any size, but
+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
+ * @src:         The data to compress.
+ * @srcSize:     The size of the data to compress.
+ * @params:      The parameters to use for compression. See ZSTD_getParams().
+ *
+ * Return:       The compressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize, ZSTD_parameters params);
 
-/*! ZSTD_compress_usingDict() :
-*   Compression using a predefined Dictionary (see dictBuilder/zdict.h).
-*   Note : The workspace passed to ZSTD_createCCtx() must have been at least ZSTD_CCtxWorkspaceBound(params.cParams) bytes.
-*   Note : This function loads the dictionary, resulting in significant startup delay.
-*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
-ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize, ZSTD_parameters params);
-
-/*! ZSTD_DCtxWorkspaceBound() :
- *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDCtx(). */
+/**
+ * ZSTD_DCtxWorkspaceBound() - the amount of memory needed to create a ZSTD_DCtx
+ *
+ * Return: A lower bound on the size of the workspace that is passed to
+ *         ZSTD_createDCtx().
+ */
 size_t ZSTD_DCtxWorkspaceBound(void);
 
-/*= Decompression context
-*   When decompressing many times,
-*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   The context pointer is placed in `workspace`, which must outlive the returned context.
-*   `workspace` must be at least ZSTD_DCtxWorkspaceBound() bytes.
-*   Use one context per thread for parallel execution in multi-threaded environments. */
+/**
+ * struct ZSTD_DCtx - the zstd decompression context
+ *
+ * When decompressing many times it is recommended to allocate a context just
+ * once and reuse it for each successive decompression operation.
+ */
 typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createDCtx() - create a zstd decompression context
+ * @workspace:     The workspace to emplace the context into. It must outlive
+ *                 the returned context.
+ * @workspaceSize: The size of workspace. Use ZSTD_DCtxWorkspaceBound() to
+ *                 determine how large the workspace must be.
+ *
+ * Return:         A decompression context emplaced into workspace.
+ */
+ZSTD_DCtx *ZSTD_createDCtx(void *workspace, size_t workspaceSize);
 
-/*! ZSTD_decompressDCtx() :
-*   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
-ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+/**
+ * ZSTD_decompressDCtx() - decompress zstd compressed src into dst
+ * @ctx:         The decompression context.
+ * @dst:         The buffer to decompress src into.
+ * @dstCapacity: The size of the destination buffer. Must be at least as large
+ *               as the decompressed size. If the caller cannot upper bound the
+ *               decompressed size, then it's better to use the streaming API.
+ * @src:         The zstd compressed data to decompress. Multiple concatenated
+ *               frames and skippable frames are allowed.
+ * @srcSize:     The exact size of the data to decompress.
+ *
+ * Return:       The decompressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_decompressDCtx(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
 
-/*! ZSTD_decompress_usingDict() :
-*   Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
-*   Dictionary must be identical to the one used during compression.
-*   Note : This function loads the dictionary, resulting in significant startup delay.
-*   Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
-ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void *dict, size_t dictSize);
+/*-************************
+ * Simple dictionary API
+ **************************/
 
-/****************************
-*  Fast dictionary API
-****************************/
-/*! ZSTD_CDictWorkspaceBound() :
- *  Returns the minimum amount of memory that needs to be passed to ZSTD_createCDict() when called with the given `params.cParams`. */
+/**
+ * ZSTD_compress_usingDict() - compress src into dst using a dictionary
+ * @ctx:         The context. Must have been created with a workspace at least
+ *               as large as ZSTD_CCtxWorkspaceBound(params.cParams).
+ * @dst:         The buffer to compress src into.
+ * @dstCapacity: The size of the destination buffer. May be any size, but
+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
+ * @src:         The data to compress.
+ * @srcSize:     The size of the data to compress.
+ * @dict:        The dictionary to use for compression.
+ * @dictSize:    The size of the dictionary.
+ * @params:      The parameters to use for compression. See ZSTD_getParams().
+ *
+ * Compression using a predefined dictionary. The same dictionary must be used
+ * during decompression.
+ *
+ * Return:       The compressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_compress_usingDict(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize, const void *dict, size_t dictSize,
+	ZSTD_parameters params);
+
+/**
+ * ZSTD_decompress_usingDict() - decompress src into dst using a dictionary
+ * @ctx:         The decompression context.
+ * @dst:         The buffer to decompress src into.
+ * @dstCapacity: The size of the destination buffer. Must be at least as large
+ *               as the decompressed size. If the caller cannot upper bound the
+ *               decompressed size, then it's better to use the streaming API.
+ * @src:         The zstd compressed data to decompress. Multiple concatenated
+ *               frames and skippable frames are allowed.
+ * @srcSize:     The exact size of the data to decompress.
+ * @dict:        The dictionary to use for decompression. The same dictionary
+ *               must've been used to compress the data.
+ * @dictSize:    The size of the dictionary.
+ *
+ * Return:       The decompressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_decompress_usingDict(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize, const void *dict, size_t dictSize);
+
+/*-**************************
+ * Fast dictionary API
+ ***************************/
+
+/**
+ * ZSTD_CDictWorkspaceBound() - amount of memory needed to create a ZSTD_CDict
+ * @cParams: The compression parameters to be used for compression.
+ *
+ * Return:   A lower bound on the size of the workspace that is passed to
+ *           ZSTD_createCDict().
+ */
 size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
 
+/**
+ * struct ZSTD_CDict - a digested dictionary to be used for compression
+ */
 typedef struct ZSTD_CDict_s ZSTD_CDict;
 
-/*! ZSTD_createCDict() :
-*   When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
-*   ZSTD_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
-*   ZSTD_CDict can be created once and used by multiple threads concurrently, as its usage is read-only.
-*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the CDict.
-*   The cdict pointer is placed in `workspace`, which must outlive the returned cdict.
-*   `workspace` must be at least ZSTD_CDictWorkspaceBound(params.cParams) bytes. */
-ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createCDict() - create a digested dictionary for compression
+ * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
+ *                 ZSTD_CDict so it must outlive the returned ZSTD_CDict.
+ * @dictSize:      The size of the dictionary.
+ * @params:        The parameters to use for compression. See ZSTD_getParams().
+ * @workspace:     The workspace. It must outlive the returned ZSTD_CDict.
+ * @workspaceSize: The workspace size. Must be at least
+ *                 ZSTD_CDictWorkspaceBound(params.cParams).
+ *
+ * When compressing multiple messages / blocks with the same dictionary it is
+ * recommended to load it just once. The ZSTD_CDict merely references the
+ * dictBuffer, so it must outlive the returned ZSTD_CDict.
+ *
+ * Return:         The digested dictionary emplaced into workspace.
+ */
+ZSTD_CDict *ZSTD_createCDict(const void *dictBuffer, size_t dictSize,
+	ZSTD_parameters params, void *workspace, size_t workspaceSize);
 
-/*! ZSTD_compress_usingCDict() :
-*   Compression using a digested Dictionary.
-*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-*   Note that compression level is decided during dictionary creation. */
-ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
-											void* dst, size_t dstCapacity,
-									  const void* src, size_t srcSize,
-									  const ZSTD_CDict* cdict);
+/**
+ * ZSTD_compress_usingCDict() - compress src into dst using a ZSTD_CDict
+ * @ctx:         The context. Must have been created with a workspace at least
+ *               as large as ZSTD_CCtxWorkspaceBound(cParams) where cParams are
+ *               the compression parameters used to create cdict.
+ * @dst:         The buffer to compress src into.
+ * @dstCapacity: The size of the destination buffer. May be any size, but
+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
+ * @src:         The data to compress.
+ * @srcSize:     The size of the data to compress.
+ * @cdict:       The digested dictionary to use for compression.
+ * @params:      The parameters to use for compression. See ZSTD_getParams().
+ *
+ * Compression using a digested dictionary. The same dictionary must be used
+ * during decompression.
+ *
+ * Return:       The compressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize, const ZSTD_CDict *cdict);
 
 
-/*! ZSTD_DDictWorkspaceBound() :
- *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDDict(). */
+/**
+ * ZSTD_DDictWorkspaceBound() - amount of memory needed to create a ZSTD_DDict
+ *
+ * Return:  A lower bound on the size of the workspace that is passed to
+ *          ZSTD_createDDict().
+ */
 size_t ZSTD_DDictWorkspaceBound(void);
 
+/**
+ * struct ZSTD_DDict - a digested dictionary to be used for decompression
+ */
 typedef struct ZSTD_DDict_s ZSTD_DDict;
 
-/*! ZSTD_createDDict() :
-*   Create a digested dictionary, ready to start decompression operation without startup delay.
-*   `dictBuffer` content is referenced, and it must remain accessible throughout the lifetime of the DDict.
-*   The ddict pointer is placed in `workspace`, which must outlive the returned ddict.
-*   `workspace` must be at least ZSTD_DDictWorkspaceBound() bytes. */
-ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize, void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createDDict() - create a digested dictionary for decompression
+ * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
+ *                 ZSTD_DDict so it must outlive the returned ZSTD_DDict.
+ * @dictSize:      The size of the dictionary.
+ * @workspace:     The workspace. It must outlive the returned ZSTD_DDict.
+ * @workspaceSize: The workspace size. Must be at least
+ *                 ZSTD_DDictWorkspaceBound().
+ *
+ * When decompressing multiple messages / blocks with the same dictionary it is
+ * recommended to load it just once. The ZSTD_DDict merely references the
+ * dictBuffer, so it must outlive the returned ZSTD_DDict.
+ *
+ * Return:         The digested dictionary emplaced into workspace.
+ */
+ZSTD_DDict *ZSTD_createDDict(const void *dictBuffer, size_t dictSize,
+	void *workspace, size_t workspaceSize);
 
-/*! ZSTD_decompress_usingDDict() :
-*   Decompression using a digested Dictionary.
-*   Faster startup than ZSTD_decompress_usingDict(), recommended when same dictionary is used multiple times. */
-ZSTDLIB_API size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
-											  void* dst, size_t dstCapacity,
-										const void* src, size_t srcSize,
-										const ZSTD_DDict* ddict);
+/**
+ * ZSTD_decompress_usingDDict() - decompress src into dst using a ZSTD_DDict
+ * @ctx:         The decompression context.
+ * @dst:         The buffer to decompress src into.
+ * @dstCapacity: The size of the destination buffer. Must be at least as large
+ *               as the decompressed size. If the caller cannot upper bound the
+ *               decompressed size, then it's better to use the streaming API.
+ * @src:         The zstd compressed data to decompress. Multiple concatenated
+ *               frames and skippable frames are allowed.
+ * @srcSize:     The exact size of the data to decompress.
+ * @ddict:       The digested dictionary to use for decompression. The same
+ *               dictionary must've been used to compress the data.
+ *
+ * Return:       The decompressed size or an error, which can be checked using
+ *               ZSTD_isError().
+ */
+size_t ZSTD_decompress_usingDDict(ZSTD_DCtx *dctx, void *dst,
+	size_t dstCapacity, const void *src, size_t srcSize,
+	const ZSTD_DDict *ddict);
 
 
-/****************************
-*  Streaming
-****************************/
+/*-**************************
+ * Streaming
+ ***************************/
 
+/**
+ * struct ZSTD_inBuffer - input buffer for streaming
+ * @src:  Start of the input buffer.
+ * @size: Size of the input buffer.
+ * @pos:  Position where reading stopped. Will be updated.
+ *        Necessarily 0 <= pos <= size.
+ */
 typedef struct ZSTD_inBuffer_s {
-  const void* src;    /**< start of input buffer */
-  size_t size;        /**< size of input buffer */
-  size_t pos;         /**< position where reading stopped. Will be updated. Necessarily 0 <= pos <= size */
+	const void *src;
+	size_t size;
+	size_t pos;
 } ZSTD_inBuffer;
 
+/**
+ * struct ZSTD_outBuffer - output buffer for streaming
+ * @dst:  Start of the output buffer.
+ * @size: Size of the output buffer.
+ * @pos:  Position where writing stopped. Will be updated.
+ *        Necessarily 0 <= pos <= size.
+ */
 typedef struct ZSTD_outBuffer_s {
-  void*  dst;         /**< start of output buffer */
-  size_t size;        /**< size of output buffer */
-  size_t pos;         /**< position where writing stopped. Will be updated. Necessarily 0 <= pos <= size */
+	void *dst;
+	size_t size;
+	size_t pos;
 } ZSTD_outBuffer;
 
 
 
-/*-***********************************************************************
-*  Streaming compression - HowTo
-*
-*  A ZSTD_CStream object is required to track streaming operation.
-*  Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.
-*  ZSTD_CStream objects can be reused multiple times on consecutive compression operations.
-*  It is recommended to re-use ZSTD_CStream in situations where many streaming operations will be achieved consecutively.
-*  Use one separate ZSTD_CStream per thread for parallel execution.
-*
-*  Start a new compression by initializing ZSTD_CStream.
-*  Use ZSTD_initCStream() to start a new compression operation.
-*  Use  ZSTD_initCStream_usingCDict() for a compression which requires a dictionary.
-*
-*  Use ZSTD_compressStream() repetitively to consume input stream.
-*  The function will automatically update both `pos` fields.
-*  Note that it may not consume the entire input, in which case `pos < size`,
-*  and it's up to the caller to present again remaining data.
-*  @return : a size hint, preferred nb of bytes to use as input for next function call
-*            or an error code, which can be tested using ZSTD_isError().
-*            Note 1 : it's just a hint, to help latency a little, any other value will work fine.
-*            Note 2 : size hint is guaranteed to be <= ZSTD_CStreamInSize()
-*
-*  At any moment, it's possible to flush whatever data remains within internal buffer, using ZSTD_flushStream().
-*  `output->pos` will be updated.
-*  Note that some content might still be left within internal buffer if `output->size` is too small.
-*  @return : nb of bytes still present within internal buffer (0 if it's empty)
-*            or an error code, which can be tested using ZSTD_isError().
-*
-*  ZSTD_endStream() instructs to finish a frame.
-*  It will perform a flush and write frame epilogue.
-*  The epilogue is required for decoders to consider a frame completed.
-*  Similar to ZSTD_flushStream(), it may not be able to flush the full content if `output->size` is too small.
-*  In which case, call again ZSTD_endStream() to complete the flush.
-*  @return : nb of bytes still present within internal buffer (0 if it's empty, hence compression completed)
-*            or an error code, which can be tested using ZSTD_isError().
-*
-* *******************************************************************/
+/*-*****************************************************************************
+ * Streaming compression - HowTo
+ *
+ * A ZSTD_CStream object is required to track streaming operation.
+ * Use ZSTD_createCStream() to create and initialize a ZSTD_CStream object.
+ * ZSTD_CStream objects can be reused multiple times on consecutive compression
+ * operations. It is recommended to re-use ZSTD_CStream in situations where many
+ * streaming operations will be achieved consecutively. Use one separate
+ * ZSTD_CStream per thread for parallel execution.
+ *
+ * Use ZSTD_compressStream() repetitively to consume input stream.
+ * The function will automatically update both `pos` fields.
+ * Note that it may not consume the entire input, in which case `pos < size`,
+ * and it's up to the caller to present again remaining data.
+ * It returns a hint for the preferred number of bytes to use as an input for
+ * the next function call.
+ *
+ * At any moment, it's possible to flush whatever data remains within internal
+ * buffer, using ZSTD_flushStream(). `output->pos` will be updated. There might
+ * still be some content left within the internal buffer if `output->size` is
+ * too small. It returns the number of bytes left in the internal buffer and
+ * must be called until it returns 0.
+ *
+ * ZSTD_endStream() instructs to finish a frame. It will perform a flush and
+ * write frame epilogue. The epilogue is required for decoders to consider a
+ * frame completed. Similar to ZSTD_flushStream(), it may not be able to flush
+ * the full content if `output->size` is too small. In which case, call again
+ * ZSTD_endStream() to complete the flush. It returns the number of bytes left
+ * in the internal buffer and must be called until it returns 0.
+ ******************************************************************************/
 
-/*! ZSTD_CStreamWorkspaceBound() :
- *  Returns the minimum amount of memory that needs to be passed to ZSTD_createCStream() or ZSTD_createCStream_usingCDict()
- *  when called with the given `params.cParams` or `cdict` created with `params.cParams`. */
+/**
+ * ZSTD_CStreamWorkspaceBound() - memory needed to create a ZSTD_CStream
+ * @cParams: The compression parameters to be used for compression.
+ *
+ * Return:   A lower bound on the size of the workspace that is passed to
+ *           ZSTD_createCStream() and ZSTD_createCStream_usingCDict().
+ */
 size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams);
 
+/**
+ * struct ZSTD_CStream - the zstd streaming compression context
+ */
 typedef struct ZSTD_CStream_s ZSTD_CStream;
+
 /*===== ZSTD_CStream management functions =====*/
-/*! ZSTD_createCStream() :
-*   Creates a cstream using params.
-*   Callers may optionally provide the size of the source they intend to compress, or pass 0 if unknown.
-*   The stream is placed in `workspace`, which must outlive the returned stream.
-*   `workspace` must be at least ZSTD_CStreamWorkspaceBound(params.cParams) bytes. */
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
-/*! ZSTD_createCStream_usingCDict() :
-*   Similar to ZSTD_createCStream(), but use the given preprocessed dictionary.
-*/
-ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createCStream() - create a zstd streaming compression context
+ * @params:         The zstd compression parameters.
+ * @pledgedSrcSize: If params.fParams.contentSizeFlag == 1 then the caller must
+ *                  pass the source size (zero means empty source). Otherwise,
+ *                  the caller may optionally pass the source size, or zero if
+ *                  unknown.
+ * @workspace:      The workspace to emplace the context into. It must outlive
+ *                  the returned context.
+ * @workspaceSize:  The size of workspace.
+ *                  Use ZSTD_CStreamWorkspaceBound(params.cParams) to determine
+ *                  how large the workspace must be.
+ *
+ * Return:          The zstd streaming compression context.
+ */
+ZSTD_CStream *ZSTD_createCStream(ZSTD_parameters params,
+	unsigned long long pledgedSrcSize, void *workspace,
+	size_t workspaceSize);
+
+/**
+ * ZSTD_createCStream_usingCDict() - create a zstd streaming compression context
+ * @cdict:          The digested dictionary to use for compression.
+ * @pledgedSrcSize: Optionally the source size, or zero if unknown.
+ * @workspace:      The workspace to emplace the context into. It must outlive
+ *                  the returned context.
+ * @workspaceSize:  The size of workspace. Call ZSTD_CStreamWorkspaceBound()
+ *                  with the cParams used to create the cdict to determine how
+ *                  large the workspace must be.
+ *
+ * Return:          The zstd streaming compression context.
+ */
+ZSTD_CStream *ZSTD_createCStream_usingCDict(const ZSTD_CDict *cdict,
+	unsigned long long pledgedSrcSize, void *workspace,
+	size_t workspaceSize);
 
 /*===== Streaming compression functions =====*/
-ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  /**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */
-ZSTDLIB_API size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
-ZSTDLIB_API size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
-ZSTDLIB_API size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
+/**
+ * ZSTD_resetCStream() - reset the context using parameters from creation
+ * @zcs:            The zstd streaming compression context to reset.
+ * @pledgedSrcSize: Optionally the source size, or zero if unknown.
+ *
+ * Resets the context using the parameters from creation. Skips dictionary
+ * loading, since it can be reused. If `pledgedSrcSize` is non-zero the frame
+ * content size is always written into the frame header.
+ *
+ * Return:          Zero or an error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_resetCStream(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize);
+/**
+ * ZSTD_compressStream() - streaming compress some of input into output
+ * @zcs:    The zstd streaming compression context.
+ * @output: Destination buffer. `output->pos` is updated to indicate how much
+ *          compressed data was written.
+ * @input:  Source buffer. `input->pos` is updated to indicate how much data was
+ *          read. Note that it may not consume the entire input, in which case
+ *          `input->pos < input->size`, and it's up to the caller to present
+ *          remaining data again.
+ *
+ * The `input` and `output` buffers may be any size. Guaranteed to make some
+ * forward progress if `input` and `output` are not empty.
+ *
+ * Return:  A hint for the number of bytes to use as the input for the next
+ *          function call or an error, which can be checked using
+ *          ZSTD_isError().
+ */
+size_t ZSTD_compressStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output,
+	ZSTD_inBuffer *input);
+/**
+ * ZSTD_flushStream() - flush internal buffers into output
+ * @zcs:    The zstd streaming compression context.
+ * @output: Destination buffer. `output->pos` is updated to indicate how much
+ *          compressed data was written.
+ *
+ * ZSTD_flushStream() must be called until it returns 0, meaning all the data
+ * has been flushed. Since ZSTD_flushStream() causes a block to be ended,
+ * calling it too often will degrade the compression ratio.
+ *
+ * Return:  The number of bytes still present within internal buffers or an
+ *          error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_flushStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
+/**
+ * ZSTD_endStream() - flush internal buffers into output and end the frame
+ * @zcs:    The zstd streaming compression context.
+ * @output: Destination buffer. `output->pos` is updated to indicate how much
+ *          compressed data was written.
+ *
+ * ZSTD_endStream() must be called until it returns 0, meaning all the data has
+ * been flushed and the frame epilogue has been written.
+ *
+ * Return:  The number of bytes still present within internal buffers or an
+ *          error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_endStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
 
-ZSTDLIB_API size_t ZSTD_CStreamInSize(void);    /**< recommended size for input buffer */
-ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output buffer. Guarantee to successfully flush at least one complete compressed block in all circumstances. */
+/**
+ * ZSTD_CStreamInSize() - recommended size for the input buffer
+ *
+ * Return: The recommended size for the input buffer.
+ */
+size_t ZSTD_CStreamInSize(void);
+/**
+ * ZSTD_CStreamOutSize() - recommended size for the output buffer
+ *
+ * When the output buffer is at least this large, it is guaranteed to be large
+ * enough to flush at least one complete compressed block.
+ *
+ * Return: The recommended size for the output buffer.
+ */
+size_t ZSTD_CStreamOutSize(void);
 
 
 
-/*-***************************************************************************
-*  Streaming decompression - HowTo
-*
-*  A ZSTD_DStream object is required to track streaming operations.
-*  Use ZSTD_createDStream() and ZSTD_freeDStream() to create/release resources.
-*  ZSTD_DStream objects can be re-used multiple times.
-*
-*  Use ZSTD_initDStream() to start a new decompression operation,
-*   or ZSTD_initDStream_usingDict() if decompression requires a dictionary.
-*   @return : recommended first input size
-*
-*  Use ZSTD_decompressStream() repetitively to consume your input.
-*  The function will update both `pos` fields.
-*  If `input.pos < input.size`, some input has not been consumed.
-*  It's up to the caller to present again remaining data.
-*  If `output.pos < output.size`, decoder has flushed everything it could.
-*  @return : 0 when a frame is completely decoded and fully flushed,
-*            an error code, which can be tested using ZSTD_isError(),
-*            any other value > 0, which means there is still some decoding to do to complete current frame.
-*            The return value is a suggested next input size (a hint to improve latency) that will never load more than the current frame.
-* *******************************************************************************/
+/*-*****************************************************************************
+ * Streaming decompression - HowTo
+ *
+ * A ZSTD_DStream object is required to track streaming operations.
+ * Use ZSTD_createDStream() to initialize a ZSTD_DStream object.
+ * ZSTD_DStream objects can be re-used multiple times.
+ *
+ * Use ZSTD_decompressStream() repetitively to consume your input.
+ * The function will update both `pos` fields.
+ * If `input->pos < input->size`, some input has not been consumed.
+ * It's up to the caller to present again remaining data.
+ * If `output->pos < output->size`, decoder has flushed everything it could.
+ * Returns 0 iff a frame is completely decoded and fully flushed.
+ * Otherwise it returns a suggested next input size that will never load more
+ * than the current frame.
+ ******************************************************************************/
 
-/*! ZSTD_DStreamWorkspaceBound() :
- *  Returns the minimum amount of memory that needs to be passed to ZSTD_createDStream() to decompress frames with windowSize <= maxWindowSize. */
+/**
+ * ZSTD_DStreamWorkspaceBound() - memory needed to create a ZSTD_DStream
+ * @maxWindowSize: The maximum window size allowed for compressed frames.
+ *
+ * Return:         A lower bound on the size of the workspace that is passed to
+ *                 ZSTD_createDStream() and ZSTD_createDStream_usingDDict().
+ */
 size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 
+/**
+ * struct ZSTD_DStream - the zstd streaming decompression context
+ */
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
-/*! ZSTD_createDStream() :
-*   Creates a dstream that can decompress frames with windowSize up to maxWindowSize.
-*   The stream is placed in `workspace`, which must outlive the returned stream.
-*   `workspace` must be at least ZSTD_DStreamWorkspaceBound(maxWindowSize) bytes. */
-ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize);
-/*! ZSTD_createDStream_usingDDict() :
-*   Similar to ZSTD_createCStream(), but use the given preprocessed dictionary. */
-ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize);
+/**
+ * ZSTD_createDStream() - create a zstd streaming decompression context
+ * @maxWindowSize: The maximum window size allowed for compressed frames.
+ * @workspace:     The workspace to emplace the context into. It must outlive
+ *                 the returned context.
+ * @workspaceSize: The size of workspace.
+ *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
+ *                 how large the workspace must be.
+ *
+ * Return:         The zstd streaming decompression context.
+ */
+ZSTD_DStream *ZSTD_createDStream(size_t maxWindowSize, void *workspace,
+	size_t workspaceSize);
+/**
+ * ZSTD_createDStream_usingDDict() - create zstd streaming decompression context
+ * @maxWindowSize: The maximum window size allowed for compressed frames.
+ * @ddict:         The digested dictionary to use for decompression.
+ * @workspace:     The workspace to emplace the context into. It must outlive
+ *                 the returned context.
+ * @workspaceSize: The size of workspace.
+ *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
+ *                 how large the workspace must be.
+ *
+ * Return:         The zstd streaming decompression context.
+ */
+ZSTD_DStream *ZSTD_createDStream_usingDDict(size_t maxWindowSize,
+	const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize);
 
 /*===== Streaming decompression functions =====*/
-ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
-ZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
+/**
+ * ZSTD_resetDStream() - reset the context using parameters from creation
+ * @zds:   The zstd streaming decompression context to reset.
+ *
+ * Resets the context using the parameters from creation. Skips dictionary
+ * loading, since it can be reused.
+ *
+ * Return: Zero or an error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_resetDStream(ZSTD_DStream *zds);
+/**
+ * ZSTD_decompressStream() - streaming decompress some of input into output
+ * @zds:    The zstd streaming decompression context.
+ * @output: Destination buffer. `output.pos` is updated to indicate how much
+ *          decompressed data was written.
+ * @input:  Source buffer. `input.pos` is updated to indicate how much data was
+ *          read. Note that it may not consume the entire input, in which case
+ *          `input.pos < input.size`, and it's up to the caller to present
+ *          remaining data again.
+ *
+ * The `input` and `output` buffers may be any size. Guaranteed to make some
+ * forward progress if `input` and `output` are not empty.
+ * ZSTD_decompressStream() will not consume the last byte of the frame until
+ * the entire frame is flushed.
+ *
+ * Return:  Returns 0 iff a frame is completely decoded and fully flushed.
+ *          Otherwise returns a hint for the number of bytes to use as the input
+ *          for the next function call or an error, which can be checked using
+ *          ZSTD_isError(). The size hint will never load more than the frame.
+ */
+size_t ZSTD_decompressStream(ZSTD_DStream *zds, ZSTD_outBuffer *output,
+	ZSTD_inBuffer *input);
 
-ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
-ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
+/**
+ * ZSTD_DStreamInSize() - recommended size for the input buffer
+ *
+ * Return: The recommended size for the input buffer.
+ */
+size_t ZSTD_DStreamInSize(void);
+/**
+ * ZSTD_DStreamOutSize() - recommended size for the output buffer
+ *
+ * When the output buffer is at least this large, it is guaranteed to be large
+ * enough to flush at least one complete decompressed block.
+ *
+ * Return: The recommended size for the output buffer.
+ */
+size_t ZSTD_DStreamOutSize(void);
 
 
 /* --- Constants ---*/
@@ -366,281 +761,389 @@ ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output
 
 #define ZSTD_WINDOWLOG_MAX_32  27
 #define ZSTD_WINDOWLOG_MAX_64  27
-#define ZSTD_WINDOWLOG_MAX    ((unsigned)(sizeof(size_t) == 4 ? ZSTD_WINDOWLOG_MAX_32 : ZSTD_WINDOWLOG_MAX_64))
-#define ZSTD_WINDOWLOG_MIN     10
-#define ZSTD_HASHLOG_MAX       ZSTD_WINDOWLOG_MAX
+#define ZSTD_WINDOWLOG_MAX \
+	((unsigned int)(sizeof(size_t) == 4 \
+		? ZSTD_WINDOWLOG_MAX_32 \
+		: ZSTD_WINDOWLOG_MAX_64))
+#define ZSTD_WINDOWLOG_MIN 10
+#define ZSTD_HASHLOG_MAX ZSTD_WINDOWLOG_MAX
 #define ZSTD_HASHLOG_MIN        6
 #define ZSTD_CHAINLOG_MAX     (ZSTD_WINDOWLOG_MAX+1)
 #define ZSTD_CHAINLOG_MIN      ZSTD_HASHLOG_MIN
 #define ZSTD_HASHLOG3_MAX      17
 #define ZSTD_SEARCHLOG_MAX    (ZSTD_WINDOWLOG_MAX-1)
 #define ZSTD_SEARCHLOG_MIN      1
-#define ZSTD_SEARCHLENGTH_MAX   7   /* only for ZSTD_fast, other strategies are limited to 6 */
-#define ZSTD_SEARCHLENGTH_MIN   3   /* only for ZSTD_btopt, other strategies are limited to 4 */
+/* only for ZSTD_fast, other strategies are limited to 6 */
+#define ZSTD_SEARCHLENGTH_MAX   7
+/* only for ZSTD_btopt, other strategies are limited to 4 */
+#define ZSTD_SEARCHLENGTH_MIN   3
 #define ZSTD_TARGETLENGTH_MIN   4
 #define ZSTD_TARGETLENGTH_MAX 999
 
-#define ZSTD_FRAMEHEADERSIZE_MAX 18    /* for static allocation */
+/* for static allocation */
+#define ZSTD_FRAMEHEADERSIZE_MAX 18
 #define ZSTD_FRAMEHEADERSIZE_MIN  6
 static const size_t ZSTD_frameHeaderSize_prefix = 5;
 static const size_t ZSTD_frameHeaderSize_min = ZSTD_FRAMEHEADERSIZE_MIN;
 static const size_t ZSTD_frameHeaderSize_max = ZSTD_FRAMEHEADERSIZE_MAX;
-static const size_t ZSTD_skippableHeaderSize = 8;  /* magic number + skippable frame length */
+/* magic number + skippable frame length */
+static const size_t ZSTD_skippableHeaderSize = 8;
 
 
-/***************************************
-*  Compressed size functions
-***************************************/
+/*-*************************************
+ * Compressed size functions
+ **************************************/
 
-/*! ZSTD_findFrameCompressedSize() :
- *  `src` should point to the start of a ZSTD encoded frame or skippable frame
- *  `srcSize` must be at least as large as the frame
- *  @return : the compressed size of the frame pointed to by `src`, suitable to pass to
- *      `ZSTD_decompress` or similar, or an error code if given invalid input. */
-ZSTDLIB_API size_t ZSTD_findFrameCompressedSize(const void* src, size_t srcSize);
+/**
+ * ZSTD_findFrameCompressedSize() - returns the size of a compressed frame
+ * @src:     Source buffer. It should point to the start of a zstd encoded frame
+ *           or a skippable frame.
+ * @srcSize: The size of the source buffer. It must be at least as large as the
+ *           size of the frame.
+ *
+ * Return:   The compressed size of the frame pointed to by `src` or an error,
+ *           which can be check with ZSTD_isError().
+ *           Suitable to pass to ZSTD_decompress() or similar functions.
+ */
+size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize);
 
-/***************************************
-*  Decompressed size functions
-***************************************/
-/*! ZSTD_getFrameContentSize() :
-*   `src` should point to the start of a ZSTD encoded frame
-*   `srcSize` must be at least as large as the frame header.  A value greater than or equal
-*       to `ZSTD_frameHeaderSize_max` is guaranteed to be large enough in all cases.
-*   @return : decompressed size of the frame pointed to be `src` if known, otherwise
-*             - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
-*             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
-ZSTDLIB_API unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
+/*-*************************************
+ * Decompressed size functions
+ **************************************/
+/**
+ * ZSTD_getFrameContentSize() - returns the content size in a zstd frame header
+ * @src:     It should point to the start of a zstd encoded frame.
+ * @srcSize: The size of the source buffer. It must be at least as large as the
+ *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
+ *
+ * Return:   The frame content size stored in the frame header if known.
+ *           `ZSTD_CONTENTSIZE_UNKNOWN` if the content size isn't stored in the
+ *           frame header. `ZSTD_CONTENTSIZE_ERROR` on invalid input.
+ */
+unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
 
-/*! ZSTD_findDecompressedSize() :
-*   `src` should point the start of a series of ZSTD encoded and/or skippable frames
-*   `srcSize` must be the _exact_ size of this series
-*       (i.e. there should be a frame boundary exactly `srcSize` bytes after `src`)
-*   @return : the decompressed size of all data in the contained frames, as a 64-bit value _if known_
-*             - if the decompressed size cannot be determined: ZSTD_CONTENTSIZE_UNKNOWN
-*             - if an error occurred: ZSTD_CONTENTSIZE_ERROR
-*
-*    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
-*             When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
-*             (For example, data may be necessarily cut into blocks <= 16 KB).
-*    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
-*    note 3 : decompressed size can be very large (64-bits value),
-*             potentially larger than what local system can handle as a single memory segment.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-*             Always ensure result fits within application's authorized limits.
-*             Each application can set its own limits.
-*    note 5 : ZSTD_findDecompressedSize handles multiple frames, and so it must traverse the input to
-*             read each contained frame header.  This is efficient as most of the data is skipped,
-*             however it does mean that all frame data must be present and valid. */
-ZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);
+/**
+ * ZSTD_findDecompressedSize() - returns decompressed size of a series of frames
+ * @src:     It should point to the start of a series of zstd encoded and/or
+ *           skippable frames.
+ * @srcSize: The exact size of the series of frames.
+ *
+ * If any zstd encoded frame in the series doesn't have the frame content size
+ * set, `ZSTD_CONTENTSIZE_UNKNOWN` is returned. But frame content size is always
+ * set when using ZSTD_compress(). The decompressed size can be very large.
+ * If the source is untrusted, the decompressed size could be wrong or
+ * intentionally modified. Always ensure the result fits within the
+ * application's authorized limits. ZSTD_findDecompressedSize() handles multiple
+ * frames, and so it must traverse the input to read each frame header. This is
+ * efficient as most of the data is skipped, however it does mean that all frame
+ * data must be present and valid.
+ *
+ * Return:   Decompressed size of all the data contained in the frames if known.
+ *           `ZSTD_CONTENTSIZE_UNKNOWN` if the decompressed size is unknown.
+ *           `ZSTD_CONTENTSIZE_ERROR` if an error occurred.
+ */
+unsigned long long ZSTD_findDecompressedSize(const void *src, size_t srcSize);
 
-/***************************************
-*  Advanced compression functions
-***************************************/
-/*! ZSTD_checkCParams() :
-*   Ensure param values remain within authorized range */
-ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
+/*-*************************************
+ * Advanced compression functions
+ **************************************/
+/**
+ * ZSTD_checkCParams() - ensure parameter values remain within authorized range
+ * @cParams: The zstd compression parameters.
+ *
+ * Return:   Zero or an error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams);
 
-/*! ZSTD_adjustCParams() :
-*   optimize params for a given `srcSize` and `dictSize`.
-*   both values are optional, select `0` if unknown. */
-ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
+/**
+ * ZSTD_adjustCParams() - optimize parameters for a given srcSize and dictSize
+ * @srcSize:  Optionally the estimated source size, or zero if unknown.
+ * @dictSize: Optionally the estimated dictionary size, or zero if unknown.
+ *
+ * Return:    The optimized parameters.
+ */
+ZSTD_compressionParameters ZSTD_adjustCParams(
+	ZSTD_compressionParameters cParams, unsigned long long srcSize,
+	size_t dictSize);
 
 /*--- Advanced decompression functions ---*/
 
-/*! ZSTD_isFrame() :
- *  Tells if the content of `buffer` starts with a valid Frame Identifier.
- *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
- *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
- *  Note 3 : Skippable Frame Identifiers are considered valid. */
-ZSTDLIB_API unsigned ZSTD_isFrame(const void* buffer, size_t size);
-
-/*! ZSTD_getDictID_fromDict() :
- *  Provides the dictID stored within dictionary.
- *  if @return == 0, the dictionary is not conformant with Zstandard specification.
- *  It can still be loaded, but as a content-only dictionary. */
-ZSTDLIB_API unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize);
-
-/*! ZSTD_getDictID_fromDDict() :
- *  Provides the dictID of the dictionary loaded into `ddict`.
- *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
- *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
-ZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
-
-/*! ZSTD_getDictID_fromFrame() :
- *  Provides the dictID required to decompressed the frame stored within `src`.
- *  If @return == 0, the dictID could not be decoded.
- *  This could for one of the following reasons :
- *  - The frame does not require a dictionary to be decoded (most common case).
- *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
- *    Note : this use case also happens when using a non-conformant dictionary.
- *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
- *  - This is not a Zstandard frame.
- *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
-ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
-
-
-/*********************************************************************
-*  Buffer-less and synchronous inner streaming functions
-*
-*  This is an advanced API, giving full control over buffer management, for users which need direct control over memory.
-*  But it's also a complex one, with many restrictions (documented below).
-*  Prefer using normal streaming API for an easier experience
-********************************************************************* */
+/**
+ * ZSTD_isFrame() - returns true iff the buffer starts with a valid frame
+ * @buffer: The source buffer to check.
+ * @size:   The size of the source buffer, must be at least 4 bytes.
+ *
+ * Return: True iff the buffer starts with a zstd or skippable frame identifier.
+ */
+unsigned int ZSTD_isFrame(const void *buffer, size_t size);
 
 /**
-  Buffer-less streaming compression (synchronous mode)
+ * ZSTD_getDictID_fromDict() - returns the dictionary id stored in a dictionary
+ * @dict:     The dictionary buffer.
+ * @dictSize: The size of the dictionary buffer.
+ *
+ * Return:    The dictionary id stored within the dictionary or 0 if the
+ *            dictionary is not a zstd dictionary. If it returns 0 the
+ *            dictionary can still be loaded as a content-only dictionary.
+ */
+unsigned int ZSTD_getDictID_fromDict(const void *dict, size_t dictSize);
 
-  A ZSTD_CCtx object is required to track streaming operations.
-  Use ZSTD_createCCtx() / ZSTD_freeCCtx() to manage resource.
-  ZSTD_CCtx object can be re-used multiple times within successive compression operations.
+/**
+ * ZSTD_getDictID_fromDDict() - returns the dictionary id stored in a ZSTD_DDict
+ * @ddict: The ddict to find the id of.
+ *
+ * Return: The dictionary id stored within `ddict` or 0 if the dictionary is not
+ *         a zstd dictionary. If it returns 0 `ddict` will be loaded as a
+ *         content-only dictionary.
+ */
+unsigned int ZSTD_getDictID_fromDDict(const ZSTD_DDict *ddict);
 
-  Start by initializing a context.
-  Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary compression,
-  or ZSTD_compressBegin_advanced(), for finer parameter control.
-  It's also possible to duplicate a reference context which has already been initialized, using ZSTD_copyCCtx()
-
-  Then, consume your input using ZSTD_compressContinue().
-  There are some important considerations to keep in mind when using this advanced function :
-  - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffer only.
-  - Interface is synchronous : input is consumed entirely and produce 1+ (or more) compressed blocks.
-  - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.
-	Worst case evaluation is provided by ZSTD_compressBound().
-	ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
-  - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).
-	It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
-  - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.
-	In which case, it will "discard" the relevant memory section from its history.
-
-  Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.
-  It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.
-  Without last block mark, frames will be considered unfinished (corrupted) by decoders.
-
-  `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress some new frame.
-*/
-
-/*=====   Buffer-less streaming compression functions  =====*/
-ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
-ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
-ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
-ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
-ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
-ZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-
-
-
-/*-
-  Buffer-less streaming decompression (synchronous mode)
-
-  A ZSTD_DCtx object is required to track streaming operations.
-  Use ZSTD_createDCtx() / ZSTD_freeDCtx() to manage it.
-  A ZSTD_DCtx object can be re-used multiple times.
-
-  First typical operation is to retrieve frame parameters, using ZSTD_getFrameParams().
-  It fills a ZSTD_frameParams structure which provide important information to correctly decode the frame,
-  such as the minimum rolling buffer size to allocate to decompress data (`windowSize`),
-  and the dictionary ID used.
-  (Note : content size is optional, it may not be present. 0 means : content size unknown).
-  Note that these values could be wrong, either because of data malformation, or because an attacker is spoofing deliberate false information.
-  As a consequence, check that values remain within valid application range, especially `windowSize`, before allocation.
-  Each application can set its own limit, depending on local restrictions. For extended interoperability, it is recommended to support at least 8 MB.
-  Frame parameters are extracted from the beginning of the compressed frame.
-  Data fragment must be large enough to ensure successful decoding, typically `ZSTD_frameHeaderSize_max` bytes.
-  @result : 0 : successful decoding, the `ZSTD_frameParams` structure is correctly filled.
-		   >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
-		   errorCode, which can be tested using ZSTD_isError().
-
-  Start decompression, with ZSTD_decompressBegin() or ZSTD_decompressBegin_usingDict().
-  Alternatively, you can copy a prepared context, using ZSTD_copyDCtx().
-
-  Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue() alternatively.
-  ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize' to ZSTD_decompressContinue().
-  ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will fail.
-
-  @result of ZSTD_decompressContinue() is the number of bytes regenerated within 'dst' (necessarily <= dstCapacity).
-  It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some metadata item.
-  It can also be an error code, which can be tested with ZSTD_isError().
-
-  ZSTD_decompressContinue() needs previous data blocks during decompression, up to `windowSize`.
-  They should preferably be located contiguously, prior to current block.
-  Alternatively, a round buffer of sufficient size is also possible. Sufficient size is determined by frame parameters.
-  ZSTD_decompressContinue() is very sensitive to contiguity,
-  if 2 blocks don't follow each other, make sure that either the compressor breaks contiguity at the same place,
-  or that previous contiguous segment is large enough to properly handle maximum back-reference.
-
-  A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
-  Context can then be reset to start a new decompression.
-
-  Note : it's possible to know if next input to present is a header or a block, using ZSTD_nextInputType().
-  This information is not required to properly decode a frame.
-
-  == Special case : skippable frames ==
-
-  Skippable frames allow integration of user-defined data into a flow of concatenated frames.
-  Skippable frames will be ignored (skipped) by a decompressor. The format of skippable frames is as follows :
-  a) Skippable frame ID - 4 Bytes, Little endian format, any value from 0x184D2A50 to 0x184D2A5F
-  b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
-  c) Frame Content - any content (User Data) of length equal to Frame Size
-  For skippable frames ZSTD_decompressContinue() always returns 0.
-  For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0 what means that a frame is skippable.
-	Note : If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might actually be a Zstd encoded frame with no content.
-		   For purposes of decompression, it is valid in both cases to skip the frame using
-		   ZSTD_findFrameCompressedSize to find its size in bytes.
-  It also returns Frame Size as fparamsPtr->frameContentSize.
-*/
+/**
+ * ZSTD_getDictID_fromFrame() - returns the dictionary id stored in a zstd frame
+ * @src:     Source buffer. It must be a zstd encoded frame.
+ * @srcSize: The size of the source buffer. It must be at least as large as the
+ *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
+ *
+ * Return:   The dictionary id required to decompress the frame stored within
+ *           `src` or 0 if the dictionary id could not be decoded. It can return
+ *           0 if the frame does not require a dictionary, the dictionary id
+ *           wasn't stored in the frame, `src` is not a zstd frame, or `srcSize`
+ *           is too small.
+ */
+unsigned int ZSTD_getDictID_fromFrame(const void *src, size_t srcSize);
 
+/**
+ * struct ZSTD_frameParams - zstd frame parameters stored in the frame header
+ * @frameContentSize: The frame content size, or 0 if not present.
+ * @windowSize:       The window size, or 0 if the frame is a skippable frame.
+ * @dictID:           The dictionary id, or 0 if not present.
+ * @checksumFlag:     Whether a checksum was used.
+ */
 typedef struct {
 	unsigned long long frameContentSize;
-	unsigned windowSize;
-	unsigned dictID;
-	unsigned checksumFlag;
+	unsigned int windowSize;
+	unsigned int dictID;
+	unsigned int checksumFlag;
 } ZSTD_frameParams;
 
-/*=====   Buffer-less streaming decompression functions  =====*/
-ZSTDLIB_API size_t ZSTD_getFrameParams(ZSTD_frameParams* fparamsPtr, const void* src, size_t srcSize);   /**< doesn't consume input, see details below */
-ZSTDLIB_API size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx);
-ZSTDLIB_API size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);
-ZSTDLIB_API void   ZSTD_copyDCtx(ZSTD_DCtx* dctx, const ZSTD_DCtx* preparedDCtx);
-ZSTDLIB_API size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx);
-ZSTDLIB_API size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-typedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_lastBlock, ZSTDnit_checksum, ZSTDnit_skippableFrame } ZSTD_nextInputType_e;
-ZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
-
 /**
-	Block functions
+ * ZSTD_getFrameParams() - extracts parameters from a zstd or skippable frame
+ * @fparamsPtr: On success the frame parameters are written here.
+ * @src:        The source buffer. It must point to a zstd or skippable frame.
+ * @srcSize:    The size of the source buffer. `ZSTD_frameHeaderSize_max` is
+ *              always large enough to succeed.
+ *
+ * Return:      0 on success. If more data is required it returns how many bytes
+ *              must be provided to make forward progress. Otherwise it returns
+ *              an error, which can be checked using ZSTD_isError().
+ */
+size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src,
+	size_t srcSize);
 
-	Block functions produce and decode raw zstd blocks, without frame metadata.
-	Frame metadata cost is typically ~18 bytes, which can be non-negligible for very small blocks (< 100 bytes).
-	User will have to take in charge required information to regenerate data, such as compressed and content sizes.
+/*-*****************************************************************************
+ * Buffer-less and synchronous inner streaming functions
+ *
+ * This is an advanced API, giving full control over buffer management, for
+ * users which need direct control over memory.
+ * But it's also a complex one, with many restrictions (documented below).
+ * Prefer using normal streaming API for an easier experience
+ ******************************************************************************/
 
-	A few rules to respect :
-	- Compressing and decompressing require a context structure
-	  + Use ZSTD_createCCtx() and ZSTD_createDCtx()
-	- It is necessary to init context before starting
-	  + compression : ZSTD_compressBegin()
-	  + decompression : ZSTD_decompressBegin()
-	  + variants _usingDict() are also allowed
-	  + copyCCtx() and copyDCtx() work too
-	- Block size is limited, it must be <= ZSTD_getBlockSizeMax()
-	  + If you need to compress more, cut data into multiple blocks
-	  + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
-	- When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
-	  In which case, nothing is produced into `dst`.
-	  + User must test for such outcome and deal directly with uncompressed data
-	  + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
-	  + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
-		Use ZSTD_insertBlock() in such a case.
-*/
+/*-*****************************************************************************
+ * Buffer-less streaming compression (synchronous mode)
+ *
+ * A ZSTD_CCtx object is required to track streaming operations.
+ * Use ZSTD_createCCtx() to create a context.
+ * ZSTD_CCtx object can be re-used multiple times within successive compression
+ * operations.
+ *
+ * Start by initializing a context.
+ * Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary
+ * compression,
+ * or ZSTD_compressBegin_advanced(), for finer parameter control.
+ * It's also possible to duplicate a reference context which has already been
+ * initialized, using ZSTD_copyCCtx()
+ *
+ * Then, consume your input using ZSTD_compressContinue().
+ * There are some important considerations to keep in mind when using this
+ * advanced function :
+ * - ZSTD_compressContinue() has no internal buffer. It uses externally provided
+ *   buffer only.
+ * - Interface is synchronous : input is consumed entirely and produce 1+
+ *   (or more) compressed blocks.
+ * - Caller must ensure there is enough space in `dst` to store compressed data
+ *   under worst case scenario. Worst case evaluation is provided by
+ *   ZSTD_compressBound().
+ *   ZSTD_compressContinue() doesn't guarantee recover after a failed
+ *   compression.
+ * - ZSTD_compressContinue() presumes prior input ***is still accessible and
+ *   unmodified*** (up to maximum distance size, see WindowLog).
+ *   It remembers all previous contiguous blocks, plus one separated memory
+ *   segment (which can itself consists of multiple contiguous blocks)
+ * - ZSTD_compressContinue() detects that prior input has been overwritten when
+ *   `src` buffer overlaps. In which case, it will "discard" the relevant memory
+ *   section from its history.
+ *
+ * Finish a frame with ZSTD_compressEnd(), which will write the last block(s)
+ * and optional checksum. It's possible to use srcSize==0, in which case, it
+ * will write a final empty block to end the frame. Without last block mark,
+ * frames will be considered unfinished (corrupted) by decoders.
+ *
+ * `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress some new
+ * frame.
+ ******************************************************************************/
 
-#define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)   /* define, for static allocation */
+/*=====   Buffer-less streaming compression functions  =====*/
+size_t ZSTD_compressBegin(ZSTD_CCtx *cctx, int compressionLevel);
+size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx *cctx, const void *dict,
+	size_t dictSize, int compressionLevel);
+size_t ZSTD_compressBegin_advanced(ZSTD_CCtx *cctx, const void *dict,
+	size_t dictSize, ZSTD_parameters params,
+	unsigned long long pledgedSrcSize);
+size_t ZSTD_copyCCtx(ZSTD_CCtx *cctx, const ZSTD_CCtx *preparedCCtx,
+	unsigned long long pledgedSrcSize);
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx *cctx, const ZSTD_CDict *cdict,
+	unsigned long long pledgedSrcSize);
+size_t ZSTD_compressContinue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
+size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
+
+
+
+/*-*****************************************************************************
+ * Buffer-less streaming decompression (synchronous mode)
+ *
+ * A ZSTD_DCtx object is required to track streaming operations.
+ * Use ZSTD_createDCtx() to create a context.
+ * A ZSTD_DCtx object can be re-used multiple times.
+ *
+ * First typical operation is to retrieve frame parameters, using
+ * ZSTD_getFrameParams(). It fills a ZSTD_frameParams structure which provide
+ * important information to correctly decode the frame, such as the minimum
+ * rolling buffer size to allocate to decompress data (`windowSize`), and the
+ * dictionary ID used.
+ * Note: content size is optional, it may not be present. 0 means unknown.
+ * Note that these values could be wrong, either because of data malformation,
+ * or because an attacker is spoofing deliberate false information. As a
+ * consequence, check that values remain within valid application range,
+ * especially `windowSize`, before allocation. Each application can set its own
+ * limit, depending on local restrictions. For extended interoperability, it is
+ * recommended to support at least 8 MB.
+ * Frame parameters are extracted from the beginning of the compressed frame.
+ * Data fragment must be large enough to ensure successful decoding, typically
+ * `ZSTD_frameHeaderSize_max` bytes.
+ * Result: 0: successful decoding, the `ZSTD_frameParams` structure is filled.
+ *        >0: `srcSize` is too small, provide at least this many bytes.
+ *        errorCode, which can be tested using ZSTD_isError().
+ *
+ * Start decompression, with ZSTD_decompressBegin() or
+ * ZSTD_decompressBegin_usingDict(). Alternatively, you can copy a prepared
+ * context, using ZSTD_copyDCtx().
+ *
+ * Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue()
+ * alternatively.
+ * ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize'
+ * to ZSTD_decompressContinue().
+ * ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will
+ * fail.
+ *
+ * The result of ZSTD_decompressContinue() is the number of bytes regenerated
+ * within 'dst' (necessarily <= dstCapacity). It can be zero, which is not an
+ * error; it just means ZSTD_decompressContinue() has decoded some metadata
+ * item. It can also be an error code, which can be tested with ZSTD_isError().
+ *
+ * ZSTD_decompressContinue() needs previous data blocks during decompression, up
+ * to `windowSize`. They should preferably be located contiguously, prior to
+ * current block. Alternatively, a round buffer of sufficient size is also
+ * possible. Sufficient size is determined by frame parameters.
+ * ZSTD_decompressContinue() is very sensitive to contiguity, if 2 blocks don't
+ * follow each other, make sure that either the compressor breaks contiguity at
+ * the same place, or that previous contiguous segment is large enough to
+ * properly handle maximum back-reference.
+ *
+ * A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
+ * Context can then be reset to start a new decompression.
+ *
+ * Note: it's possible to know if next input to present is a header or a block,
+ * using ZSTD_nextInputType(). This information is not required to properly
+ * decode a frame.
+ *
+ * == Special case: skippable frames ==
+ *
+ * Skippable frames allow integration of user-defined data into a flow of
+ * concatenated frames. Skippable frames will be ignored (skipped) by a
+ * decompressor. The format of skippable frames is as follows:
+ * a) Skippable frame ID - 4 Bytes, Little endian format, any value from
+ *    0x184D2A50 to 0x184D2A5F
+ * b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
+ * c) Frame Content - any content (User Data) of length equal to Frame Size
+ * For skippable frames ZSTD_decompressContinue() always returns 0.
+ * For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0
+ * what means that a frame is skippable.
+ * Note: If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might
+ *       actually be a zstd encoded frame with no content. For purposes of
+ *       decompression, it is valid in both cases to skip the frame using
+ *       ZSTD_findFrameCompressedSize() to find its size in bytes.
+ * It also returns frame size as fparamsPtr->frameContentSize.
+ ******************************************************************************/
+
+/*=====   Buffer-less streaming decompression functions  =====*/
+size_t ZSTD_decompressBegin(ZSTD_DCtx *dctx);
+size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx *dctx, const void *dict,
+	size_t dictSize);
+void   ZSTD_copyDCtx(ZSTD_DCtx *dctx, const ZSTD_DCtx *preparedDCtx);
+size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx *dctx);
+size_t ZSTD_decompressContinue(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
+typedef enum {
+	ZSTDnit_frameHeader,
+	ZSTDnit_blockHeader,
+	ZSTDnit_block,
+	ZSTDnit_lastBlock,
+	ZSTDnit_checksum,
+	ZSTDnit_skippableFrame
+} ZSTD_nextInputType_e;
+ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx);
+
+/*-*****************************************************************************
+ * Block functions
+ *
+ * Block functions produce and decode raw zstd blocks, without frame metadata.
+ * Frame metadata cost is typically ~18 bytes, which can be non-negligible for
+ * very small blocks (< 100 bytes). User will have to take in charge required
+ * information to regenerate data, such as compressed and content sizes.
+ *
+ * A few rules to respect:
+ * - Compressing and decompressing require a context structure
+ *   + Use ZSTD_createCCtx() and ZSTD_createDCtx()
+ * - It is necessary to init context before starting
+ *   + compression : ZSTD_compressBegin()
+ *   + decompression : ZSTD_decompressBegin()
+ *   + variants _usingDict() are also allowed
+ *   + copyCCtx() and copyDCtx() work too
+ * - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
+ *   + If you need to compress more, cut data into multiple blocks
+ *   + Consider using the regular ZSTD_compress() instead, as frame metadata
+ *     costs become negligible when source size is large.
+ * - When a block is considered not compressible enough, ZSTD_compressBlock()
+ *   result will be zero. In which case, nothing is produced into `dst`.
+ *   + User must test for such outcome and deal directly with uncompressed data
+ *   + ZSTD_decompressBlock() doesn't accept uncompressed data as input!!!
+ *   + In case of multiple successive blocks, decoder must be informed of
+ *     uncompressed block existence to follow proper history. Use
+ *     ZSTD_insertBlock() in such a case.
+ ******************************************************************************/
+
+/* Define for static allocation */
+#define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)
 /*=====   Raw zstd block functions  =====*/
-ZSTDLIB_API size_t ZSTD_getBlockSizeMax(ZSTD_CCtx* cctx);
-ZSTDLIB_API size_t ZSTD_compressBlock  (ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-ZSTDLIB_API size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize);  /**< insert block into `dctx` history. Useful for uncompressed blocks */
+size_t ZSTD_getBlockSizeMax(ZSTD_CCtx *cctx);
+size_t ZSTD_compressBlock(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
+size_t ZSTD_decompressBlock(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
+	const void *src, size_t srcSize);
+size_t ZSTD_insertBlock(ZSTD_DCtx *dctx, const void *blockStart,
+	size_t blockSize);
 
-
-#endif  /* ZSTD_H_235446 */
+#endif  /* ZSTD_H */

From 4b987ad8ce9fe0deb90853eace96a9fe9ef4622e Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 10 Apr 2017 17:50:44 -0700
Subject: [PATCH 146/255] Introduce ZSTD_initCStream_internal()

This is now the regroup point for ZSTD_initCStream*() functions

ZSTD_initCStream_advanced() now properly checks for parameters validity.

Also : added <assert.h> usage inside zstd_compress.c
Needs ZSTD_DEBUG=1 macro to be triggered.
Will be triggered by default from `tests` directory
---
 doc/zstd_manual.html         | 14 +++++++++++---
 lib/compress/zstd_compress.c | 30 ++++++++++++++++++++++++------
 tests/Makefile               |  4 +++-
 tests/zstreamtest.c          | 10 ++++++++++
 4 files changed, 48 insertions(+), 10 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index a66f0a49c..a5b66f7d3 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -497,14 +497,22 @@ typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; v
 <a name="Chapter16"></a><h2>Advanced streaming functions</h2><pre></pre>
 
 <h3>Advanced Streaming compression functions</h3><pre></pre><b><pre>ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
+size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);   </b>/**< size of CStream is variable, depending primarily on compression level */<b>
 size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   </b>/**< pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */<b>
 size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); </b>/**< note: a dict will not be used if dict == NULL or dictSize < 8 */<b>
 size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
                                              ZSTD_parameters params, unsigned long long pledgedSrcSize);  </b>/**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */<b>
 size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  </b>/**< note : cdict will just be referenced, and must outlive compression session */<b>
-size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);  </b>/**< re-use compression parameters from previous init; skip dictionary loading stage; zcs must be init at least once before. note: pledgedSrcSize must be correct, a size of 0 means unknown.  for a frame size of 0 use initCStream_advanced */<b>
-size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
 </pre></b><BR>
+<pre><b>size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);
+</b><p>  start a new compression job, using same parameters from previous job.
+  This is typically useful to skip dictionary loading stage, since it will re-use it in-place..
+  Note that zcs must be init at least once before using ZSTD_resetCStream().
+  pledgedSrcSize==0 means "srcSize unknown".
+  If pledgedSrcSize > 0, its value must be correct, as it will be written in header, and controlled at the end.
+  @return : 0, or an error code (which can be tested using ZSTD_isError()) 
+</p></pre><BR>
+
 <h3>Advanced Streaming decompression functions</h3><pre></pre><b><pre>typedef enum { DStream_p_maxWindowSize } ZSTD_DStreamParameter_e;
 ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);
 size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize); </b>/**< note: a dict will not be used if dict == NULL or dictSize < 8 */<b>
@@ -553,7 +561,7 @@ size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
 size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); </b>/**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */<b>
 size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); </b>/**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */<b>
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); </b>/**< note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */<b>
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); </b>/**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */<b>
 size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 </pre></b><BR>
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 4ad978a4b..c0ccf83cd 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -31,7 +31,14 @@ typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZS
 /*-*************************************
 *  Helper functions
 ***************************************/
+#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG==1)
+#  include <assert.h>
+#else
+#  define assert(condition) ((void)0)
+#endif
+
 #define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
+
 size_t ZSTD_compressBound(size_t srcSize) {
     size_t const lowLimit = 256 KB;
     size_t const margin = (srcSize < lowLimit) ? (lowLimit-srcSize) >> 12 : 0;  /* from 64 to 0 */
@@ -3031,10 +3038,13 @@ size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
-size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
-                                 const void* dict, size_t dictSize,
-                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
+/* ZSTD_initCStream_internal() :
+ * params are supposed validated at this stage */
+static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
+                                const void* dict, size_t dictSize,
+                                ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
+    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
     /* allocate buffers */
     {   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
         if (zcs->inBuffSize < neededInBuffSize) {
@@ -3068,11 +3078,19 @@ size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
+size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
+                                 const void* dict, size_t dictSize,
+                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
+{
+    CHECK_F( ZSTD_checkCParams(params.cParams) );
+    return ZSTD_initCStream_internal(zcs, dict, dictSize, params, pledgedSrcSize);
+}
+
 /* note : cdict must outlive compression session */
 size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
 {
     ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-    size_t const initError =  ZSTD_initCStream_advanced(zcs, NULL, 0, params, 0);
+    size_t const initError =  ZSTD_initCStream_internal(zcs, NULL, 0, params, 0);
     zcs->cdict = cdict;
     if (ZSTD_isError(initError)) return initError;
     return ZSTD_resetCStream_internal(zcs, 0);
@@ -3081,14 +3099,14 @@ size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
 size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
 {
     ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    return ZSTD_initCStream_advanced(zcs, dict, dictSize, params, 0);
+    return ZSTD_initCStream_internal(zcs, dict, dictSize, params, 0);
 }
 
 size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize)
 {
     ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
     if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
-    return ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
+    return ZSTD_initCStream_internal(zcs, NULL, 0, params, pledgedSrcSize);
 }
 
 size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
diff --git a/tests/Makefile b/tests/Makefile
index 809c90df5..70ef51878 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -26,7 +26,9 @@ PYTHON ?= python3
 TESTARTEFACT := versionsTest namespaceTest
 
 
-CPPFLAGS+= -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR)
+CPPFLAGS+= -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress \
+           -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR) \
+           -DZSTD_DEBUG=1
 CFLAGS  ?= -O3
 CFLAGS  += -g -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 270c0221b..6f26ea555 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -207,6 +207,16 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
       DISPLAYLEVEL(3, "OK (%u bytes) \n", (U32)s);
     }
 
+    /* Attempt bad compression parameters */
+    DISPLAYLEVEL(3, "test%3i : use bad compression parameters : ", testNb++);
+    {   size_t r;
+        ZSTD_parameters params = ZSTD_getParams(1, 0, 0);
+        params.cParams.searchLength = 2;
+        r = ZSTD_initCStream_advanced(zc, NULL, 0, params, 0);
+        if (!ZSTD_isError(r)) goto _output_error;
+        DISPLAYLEVEL(3, "init error : %s \n", ZSTD_getErrorName(r));
+    }
+
     /* skippable frame test */
     DISPLAYLEVEL(3, "test%3i : decompress skippable frame : ", testNb++);
     ZSTD_initDStream_usingDict(zd, CNBuffer, 128 KB);

From e88034fe2639f2d83470df861e1ce95676113236 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 10 Apr 2017 22:24:02 -0700
Subject: [PATCH 147/255] simplified ZSTD_initCStream*() flow

all variants converge towards ZSTD_initCStream_stage2()
---
 lib/compress/zstd_compress.c | 60 +++++++++++++++++++++---------------
 1 file changed, 36 insertions(+), 24 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index c0ccf83cd..a4a3ee084 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3034,17 +3034,18 @@ size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 {
 
     zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
 /* ZSTD_initCStream_internal() :
- * params are supposed validated at this stage */
-static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
-                                const void* dict, size_t dictSize,
-                                ZSTD_parameters params, unsigned long long pledgedSrcSize)
+ * params are supposed validated at this stage
+ * and zcs->cdict is supposed to be correct */
+static size_t ZSTD_initCStream_stage2(ZSTD_CStream* zcs,
+                                const ZSTD_parameters params,
+                                unsigned long long pledgedSrcSize)
 {
     assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
+
     /* allocate buffers */
     {   size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
         if (zcs->inBuffSize < neededInBuffSize) {
@@ -3065,19 +3066,39 @@ static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
         zcs->outBuffSize = outBuffSize;
     }
 
-    if (dict && dictSize >= 8) {
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
-        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
-        zcs->cdict = zcs->cdictLocal;
-    } else zcs->cdict = NULL;
-
     zcs->checksum = params.fParams.checksumFlag > 0;
     zcs->params = params;
 
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
+/* note : cdict must outlive compression session */
+size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+{
+    if (!cdict) return ERROR(GENERIC);   /* cannot handle NULL cdict (does not know what to do) */
+    {   ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
+        zcs->cdict = cdict;
+        return ZSTD_initCStream_stage2(zcs, params, 0);
+    }
+}
+
+static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
+                                const void* dict, size_t dictSize,
+                                ZSTD_parameters params, unsigned long long pledgedSrcSize)
+{
+    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
+    zcs->cdict = NULL;
+
+    if (dict && dictSize >= 8) {
+        ZSTD_freeCDict(zcs->cdictLocal);
+        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0 /* copy */, params, zcs->customMem);
+        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
+        zcs->cdict = zcs->cdictLocal;
+    }
+
+    return ZSTD_initCStream_stage2(zcs, params, pledgedSrcSize);
+}
+
 size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
                                  const void* dict, size_t dictSize,
                                  ZSTD_parameters params, unsigned long long pledgedSrcSize)
@@ -3086,16 +3107,6 @@ size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
     return ZSTD_initCStream_internal(zcs, dict, dictSize, params, pledgedSrcSize);
 }
 
-/* note : cdict must outlive compression session */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
-{
-    ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-    size_t const initError =  ZSTD_initCStream_internal(zcs, NULL, 0, params, 0);
-    zcs->cdict = cdict;
-    if (ZSTD_isError(initError)) return initError;
-    return ZSTD_resetCStream_internal(zcs, 0);
-}
-
 size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
 {
     ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
@@ -3105,13 +3116,14 @@ size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t di
 size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize)
 {
     ZSTD_parameters params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
-    if (pledgedSrcSize) params.fParams.contentSizeFlag = 1;
+    params.fParams.contentSizeFlag = (pledgedSrcSize>0);
     return ZSTD_initCStream_internal(zcs, NULL, 0, params, pledgedSrcSize);
 }
 
 size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
 {
-    return ZSTD_initCStream_usingDict(zcs, NULL, 0, compressionLevel);
+    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, 0);
+    return ZSTD_initCStream_internal(zcs, NULL, 0, params, 0);
 }
 
 size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)

From ab9162ebb49ff00e2df0431e3b2a9de8510604b6 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 11 Apr 2017 10:46:20 -0700
Subject: [PATCH 148/255] simplified call graph

by calling ZSTD_compressBegin_internal() instead of ZSTD_compressBegin_advanced()
---
 lib/compress/zstd_compress.c | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index a4a3ee084..62c1c6cdd 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2690,6 +2690,7 @@ static size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
                                    ZSTD_parameters params, U64 pledgedSrcSize)
 {
     ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
+    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
     CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
     return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
 }
@@ -2911,7 +2912,7 @@ size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, u
     else {
         ZSTD_parameters params = cdict->refContext->params;
         params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-        CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
+        CHECK_F(ZSTD_compressBegin_internal(cctx, NULL, 0, params, pledgedSrcSize));
     }
     return 0;
 }
@@ -3017,7 +3018,7 @@ static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long p
     if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
 
     if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
-    else CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
+    else CHECK_F(ZSTD_compressBegin_internal(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
 
     zcs->inToCompress = 0;
     zcs->inBuffPos = 0;

From b4dd3378f10b7ba83077826129f59805176ef728 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 11 Apr 2017 11:35:36 -0700
Subject: [PATCH 149/255] Add BtrFS patch for 4.10 kernel

---
 contrib/linux-kernel/README.md       |  10 +-
 contrib/linux-kernel/btrfs.diff      | 633 +++++++++++++++++++++++++++
 contrib/linux-kernel/fs/btrfs/zstd.c | 127 +++---
 3 files changed, 702 insertions(+), 68 deletions(-)
 create mode 100644 contrib/linux-kernel/btrfs.diff

diff --git a/contrib/linux-kernel/README.md b/contrib/linux-kernel/README.md
index 11938ad62..1cc74cca6 100644
--- a/contrib/linux-kernel/README.md
+++ b/contrib/linux-kernel/README.md
@@ -1,8 +1,7 @@
 # Linux Kernel Patch
 
 There are two pieces, the `zstd_compress` and `zstd_decompress` kernel modules, and the BtrFS patch.
-The patches are based off of the linux kernel version 4.9.
-The BtrFS patch is not present in its entirety yet.
+The patches are based off of the linux kernel master branch (version 4.10).
 
 ## Zstd Kernel modules
 
@@ -21,6 +20,7 @@ The BtrFS patch is not present in its entirety yet.
 
 ## BtrFS
 
-* `fs/btrfs/zstd.c` is provided.
-* Some more glue is required to integrate it with BtrFS, but I haven't included the patches yet.
-  In the meantime see https://github.com/terrelln/linux/commit/1914f7d4ca6c539369c84853eafa4ac104883047 if you're interested.
+* The patch is located in `btrfs.diff`.
+* Additionally `fs/btrfs/zstd.c` is provided as a source for convenience.
+* The patch seems to be working, it doesn't crash the kernel, and compresses at speeds and ratios athat are expected.
+  It can still use some more testing for fringe features, like printing options.
diff --git a/contrib/linux-kernel/btrfs.diff b/contrib/linux-kernel/btrfs.diff
new file mode 100644
index 000000000..b0f8b924b
--- /dev/null
+++ b/contrib/linux-kernel/btrfs.diff
@@ -0,0 +1,633 @@
+diff --git a/fs/btrfs/Kconfig b/fs/btrfs/Kconfig
+index 80e9c18..a26c63b 100644
+--- a/fs/btrfs/Kconfig
++++ b/fs/btrfs/Kconfig
+@@ -6,6 +6,8 @@ config BTRFS_FS
+ 	select ZLIB_DEFLATE
+ 	select LZO_COMPRESS
+ 	select LZO_DECOMPRESS
++	select ZSTD_COMPRESS
++	select ZSTD_DECOMPRESS
+ 	select RAID6_PQ
+ 	select XOR_BLOCKS
+ 	select SRCU
+diff --git a/fs/btrfs/Makefile b/fs/btrfs/Makefile
+index 128ce17..962a95a 100644
+--- a/fs/btrfs/Makefile
++++ b/fs/btrfs/Makefile
+@@ -6,7 +6,7 @@ btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
+ 	   transaction.o inode.o file.o tree-defrag.o \
+ 	   extent_map.o sysfs.o struct-funcs.o xattr.o ordered-data.o \
+ 	   extent_io.o volumes.o async-thread.o ioctl.o locking.o orphan.o \
+-	   export.o tree-log.o free-space-cache.o zlib.o lzo.o \
++	   export.o tree-log.o free-space-cache.o zlib.o lzo.o zstd.o \
+ 	   compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o \
+ 	   reada.o backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
+ 	   uuid-tree.o props.o hash.o free-space-tree.o
+diff --git a/fs/btrfs/compression.c b/fs/btrfs/compression.c
+index c7721a6..66d4ced 100644
+--- a/fs/btrfs/compression.c
++++ b/fs/btrfs/compression.c
+@@ -761,6 +761,7 @@ static struct {
+ static const struct btrfs_compress_op * const btrfs_compress_op[] = {
+ 	&btrfs_zlib_compress,
+ 	&btrfs_lzo_compress,
++	&btrfs_zstd_compress,
+ };
+ 
+ void __init btrfs_init_compress(void)
+diff --git a/fs/btrfs/compression.h b/fs/btrfs/compression.h
+index 39ec43a..d99fc21 100644
+--- a/fs/btrfs/compression.h
++++ b/fs/btrfs/compression.h
+@@ -60,8 +60,9 @@ enum btrfs_compression_type {
+ 	BTRFS_COMPRESS_NONE  = 0,
+ 	BTRFS_COMPRESS_ZLIB  = 1,
+ 	BTRFS_COMPRESS_LZO   = 2,
+-	BTRFS_COMPRESS_TYPES = 2,
+-	BTRFS_COMPRESS_LAST  = 3,
++	BTRFS_COMPRESS_ZSTD  = 3,
++	BTRFS_COMPRESS_TYPES = 3,
++	BTRFS_COMPRESS_LAST  = 4,
+ };
+ 
+ struct btrfs_compress_op {
+@@ -92,5 +93,6 @@ struct btrfs_compress_op {
+ 
+ extern const struct btrfs_compress_op btrfs_zlib_compress;
+ extern const struct btrfs_compress_op btrfs_lzo_compress;
++extern const struct btrfs_compress_op btrfs_zstd_compress;
+ 
+ #endif
+diff --git a/fs/btrfs/ctree.h b/fs/btrfs/ctree.h
+index 29b7fc2..878b23b9 100644
+--- a/fs/btrfs/ctree.h
++++ b/fs/btrfs/ctree.h
+@@ -270,6 +270,7 @@ struct btrfs_super_block {
+ 	 BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS |		\
+ 	 BTRFS_FEATURE_INCOMPAT_BIG_METADATA |		\
+ 	 BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO |		\
++	 BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD |		\
+ 	 BTRFS_FEATURE_INCOMPAT_RAID56 |		\
+ 	 BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF |		\
+ 	 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA |	\
+diff --git a/fs/btrfs/disk-io.c b/fs/btrfs/disk-io.c
+index 08b74da..0c43e4e 100644
+--- a/fs/btrfs/disk-io.c
++++ b/fs/btrfs/disk-io.c
+@@ -2853,6 +2853,8 @@ int open_ctree(struct super_block *sb,
+ 	features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
+ 	if (fs_info->compress_type == BTRFS_COMPRESS_LZO)
+ 		features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
++	else if (tree_root->fs_info->compress_type == BTRFS_COMPRESS_ZSTD)
++		features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD;
+ 
+ 	if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)
+ 		btrfs_info(fs_info, "has skinny extents");
+diff --git a/fs/btrfs/ioctl.c b/fs/btrfs/ioctl.c
+index dabfc7a..d8ea727 100644
+--- a/fs/btrfs/ioctl.c
++++ b/fs/btrfs/ioctl.c
+@@ -327,8 +327,10 @@ static int btrfs_ioctl_setflags(struct file *file, void __user *arg)
+ 
+ 		if (fs_info->compress_type == BTRFS_COMPRESS_LZO)
+ 			comp = "lzo";
+-		else
++		else if (fs_info->compress_type == BTRFS_COMPRESS_ZLIB)
+ 			comp = "zlib";
++		else
++			comp = "zstd";
+ 		ret = btrfs_set_prop(inode, "btrfs.compression",
+ 				     comp, strlen(comp), 0);
+ 		if (ret)
+@@ -1463,6 +1465,8 @@ int btrfs_defrag_file(struct inode *inode, struct file *file,
+ 
+ 	if (range->compress_type == BTRFS_COMPRESS_LZO) {
+ 		btrfs_set_fs_incompat(fs_info, COMPRESS_LZO);
++	} else if (range->compress_type == BTRFS_COMPRESS_ZSTD) {
++		btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD);
+ 	}
+ 
+ 	ret = defrag_count;
+diff --git a/fs/btrfs/props.c b/fs/btrfs/props.c
+index d6cb155..162105f 100644
+--- a/fs/btrfs/props.c
++++ b/fs/btrfs/props.c
+@@ -383,6 +383,8 @@ static int prop_compression_validate(const char *value, size_t len)
+ 		return 0;
+ 	else if (!strncmp("zlib", value, len))
+ 		return 0;
++	else if (!strncmp("zstd", value, len))
++		return 0;
+ 
+ 	return -EINVAL;
+ }
+@@ -405,6 +407,8 @@ static int prop_compression_apply(struct inode *inode,
+ 		type = BTRFS_COMPRESS_LZO;
+ 	else if (!strncmp("zlib", value, len))
+ 		type = BTRFS_COMPRESS_ZLIB;
++	else if (!strncmp("zstd", value, len))
++		type = BTRFS_COMPRESS_ZSTD;
+ 	else
+ 		return -EINVAL;
+ 
+@@ -422,6 +426,8 @@ static const char *prop_compression_extract(struct inode *inode)
+ 		return "zlib";
+ 	case BTRFS_COMPRESS_LZO:
+ 		return "lzo";
++	case BTRFS_COMPRESS_ZSTD:
++		return "zstd";
+ 	}
+ 
+ 	return NULL;
+diff --git a/fs/btrfs/super.c b/fs/btrfs/super.c
+index da687dc..b064456 100644
+--- a/fs/btrfs/super.c
++++ b/fs/btrfs/super.c
+@@ -513,6 +513,14 @@ int btrfs_parse_options(struct btrfs_fs_info *info, char *options,
+ 				btrfs_clear_opt(info->mount_opt, NODATASUM);
+ 				btrfs_set_fs_incompat(info, COMPRESS_LZO);
+ 				no_compress = 0;
++			} else if (strcmp(args[0].from, "zstd") == 0) {
++				compress_type = "zstd";
++				info->compress_type = BTRFS_COMPRESS_ZSTD;
++				btrfs_set_opt(info->mount_opt, COMPRESS);
++				btrfs_clear_opt(info->mount_opt, NODATACOW);
++				btrfs_clear_opt(info->mount_opt, NODATASUM);
++				btrfs_set_fs_incompat(info, COMPRESS_ZSTD);
++				no_compress = 0;
+ 			} else if (strncmp(args[0].from, "no", 2) == 0) {
+ 				compress_type = "no";
+ 				btrfs_clear_opt(info->mount_opt, COMPRESS);
+@@ -1230,8 +1238,10 @@ static int btrfs_show_options(struct seq_file *seq, struct dentry *dentry)
+ 	if (btrfs_test_opt(info, COMPRESS)) {
+ 		if (info->compress_type == BTRFS_COMPRESS_ZLIB)
+ 			compress_type = "zlib";
+-		else
++		else if (info->compress_type == BTRFS_COMPRESS_LZO)
+ 			compress_type = "lzo";
++		else
++			compress_type = "zstd";
+ 		if (btrfs_test_opt(info, FORCE_COMPRESS))
+ 			seq_printf(seq, ",compress-force=%s", compress_type);
+ 		else
+diff --git a/fs/btrfs/sysfs.c b/fs/btrfs/sysfs.c
+index 1f157fb..b0dec90 100644
+--- a/fs/btrfs/sysfs.c
++++ b/fs/btrfs/sysfs.c
+@@ -200,6 +200,7 @@ BTRFS_FEAT_ATTR_INCOMPAT(mixed_backref, MIXED_BACKREF);
+ BTRFS_FEAT_ATTR_INCOMPAT(default_subvol, DEFAULT_SUBVOL);
+ BTRFS_FEAT_ATTR_INCOMPAT(mixed_groups, MIXED_GROUPS);
+ BTRFS_FEAT_ATTR_INCOMPAT(compress_lzo, COMPRESS_LZO);
++BTRFS_FEAT_ATTR_INCOMPAT(compress_zstd, COMPRESS_ZSTD);
+ BTRFS_FEAT_ATTR_INCOMPAT(big_metadata, BIG_METADATA);
+ BTRFS_FEAT_ATTR_INCOMPAT(extended_iref, EXTENDED_IREF);
+ BTRFS_FEAT_ATTR_INCOMPAT(raid56, RAID56);
+@@ -212,6 +213,7 @@ static struct attribute *btrfs_supported_feature_attrs[] = {
+ 	BTRFS_FEAT_ATTR_PTR(default_subvol),
+ 	BTRFS_FEAT_ATTR_PTR(mixed_groups),
+ 	BTRFS_FEAT_ATTR_PTR(compress_lzo),
++	BTRFS_FEAT_ATTR_PTR(compress_zstd),
+ 	BTRFS_FEAT_ATTR_PTR(big_metadata),
+ 	BTRFS_FEAT_ATTR_PTR(extended_iref),
+ 	BTRFS_FEAT_ATTR_PTR(raid56),
+diff --git a/fs/btrfs/zstd.c b/fs/btrfs/zstd.c
+new file mode 100644
+index 0000000..b7f319e
+--- /dev/null
++++ b/fs/btrfs/zstd.c
+@@ -0,0 +1,415 @@
++#include <linux/kernel.h>
++#include <linux/slab.h>
++#include <linux/vmalloc.h>
++#include <linux/init.h>
++#include <linux/err.h>
++#include <linux/sched.h>
++#include <linux/pagemap.h>
++#include <linux/bio.h>
++#include <linux/zstd.h>
++#include "compression.h"
++
++#define ZSTD_BTRFS_MAX_WINDOWLOG 17
++#define ZSTD_BTRFS_MAX_INPUT (1 << ZSTD_BTRFS_MAX_WINDOWLOG)
++
++static ZSTD_parameters zstd_get_btrfs_parameters(size_t src_len)
++{
++	ZSTD_parameters params = ZSTD_getParams(3, src_len, 0);
++
++	if (params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG)
++		params.cParams.windowLog = ZSTD_BTRFS_MAX_WINDOWLOG;
++	WARN_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
++	return params;
++}
++
++struct workspace {
++	void *mem;
++	size_t size;
++	char *buf;
++	struct list_head list;
++};
++
++static void zstd_free_workspace(struct list_head *ws)
++{
++	struct workspace *workspace = list_entry(ws, struct workspace, list);
++
++	vfree(workspace->mem);
++	kfree(workspace->buf);
++	kfree(workspace);
++}
++
++static struct list_head *zstd_alloc_workspace(void)
++{
++	ZSTD_parameters params =
++			zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
++	struct workspace *workspace;
++
++	workspace = kzalloc(sizeof(*workspace), GFP_NOFS);
++	if (!workspace)
++		return ERR_PTR(-ENOMEM);
++
++	workspace->size = max_t(size_t,
++			ZSTD_CStreamWorkspaceBound(params.cParams),
++			ZSTD_DStreamWorkspaceBound(ZSTD_BTRFS_MAX_INPUT));
++	workspace->mem = vmalloc(workspace->size);
++	workspace->buf = kmalloc(PAGE_SIZE, GFP_NOFS);
++	if (!workspace->mem || !workspace->buf)
++		goto fail;
++
++	INIT_LIST_HEAD(&workspace->list);
++
++	return &workspace->list;
++fail:
++	zstd_free_workspace(&workspace->list);
++	return ERR_PTR(-ENOMEM);
++}
++
++static int zstd_compress_pages(struct list_head *ws,
++		struct address_space *mapping,
++		u64 start,
++		struct page **pages,
++		unsigned long *out_pages,
++		unsigned long *total_in,
++		unsigned long *total_out)
++{
++	struct workspace *workspace = list_entry(ws, struct workspace, list);
++	ZSTD_CStream *stream;
++	int ret = 0;
++	int nr_pages = 0;
++	struct page *in_page = NULL;  /* The current page to read */
++	struct page *out_page = NULL; /* The current page to write to */
++	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
++	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
++	unsigned long tot_in = 0;
++	unsigned long tot_out = 0;
++	unsigned long len = *total_out;
++	const unsigned long nr_dest_pages = *out_pages;
++	unsigned long max_out = nr_dest_pages * PAGE_SIZE;
++	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
++
++	*out_pages = 0;
++	*total_out = 0;
++	*total_in = 0;
++
++	/* Initialize the stream */
++	stream = ZSTD_createCStream(params, len, workspace->mem,
++			workspace->size);
++	if (!stream) {
++		pr_warn("BTRFS: ZSTD_createStream failed\n");
++		ret = -EIO;
++		goto out;
++	}
++
++	/* map in the first page of input data */
++	in_page = find_get_page(mapping, start >> PAGE_SHIFT);
++	in_buf.src = kmap(in_page);
++	in_buf.pos = 0;
++	in_buf.size = min_t(size_t, len, PAGE_SIZE);
++
++
++	/* Allocate and map in the output buffer */
++	out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
++	if (out_page == NULL) {
++		ret = -ENOMEM;
++		goto out;
++	}
++	pages[nr_pages++] = out_page;
++	out_buf.dst = kmap(out_page);
++	out_buf.pos = 0;
++	out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
++
++	while (1) {
++		size_t ret2;
++
++		ret2 = ZSTD_compressStream(stream, &out_buf, &in_buf);
++		if (ZSTD_isError(ret2)) {
++			pr_debug("BTRFS: ZSTD_compressStream returned %d\n",
++					ZSTD_getErrorCode(ret2));
++			ret = -EIO;
++			goto out;
++		}
++
++		/* Check to see if we are making it bigger */
++		if (tot_in + in_buf.pos > 8192 &&
++				tot_in + in_buf.pos <
++				tot_out + out_buf.pos) {
++			ret = -E2BIG;
++			goto out;
++		}
++
++		/* We've reached the end of our output range */
++		if (out_buf.pos >= max_out) {
++			tot_out += out_buf.pos;
++			ret = -E2BIG;
++			goto out;
++		}
++
++		/* Check if we need more output space */
++		if (out_buf.pos == out_buf.size) {
++			tot_out += PAGE_SIZE;
++			max_out -= PAGE_SIZE;
++			kunmap(out_page);
++			if (nr_pages == nr_dest_pages) {
++				out_page = NULL;
++				ret = -E2BIG;
++				goto out;
++			}
++			out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
++			if (out_page == NULL) {
++				ret = -ENOMEM;
++				goto out;
++			}
++			pages[nr_pages++] = out_page;
++			out_buf.dst = kmap(out_page);
++			out_buf.pos = 0;
++			out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
++		}
++
++		/* We've reached the end of the input */
++		if (in_buf.pos >= len) {
++			tot_in += in_buf.pos;
++			break;
++		}
++
++		/* Check if we need more input */
++		if (in_buf.pos == in_buf.size) {
++			tot_in += PAGE_SIZE;
++			kunmap(in_page);
++			put_page(in_page);
++
++			start += PAGE_SIZE;
++			len -= PAGE_SIZE;
++			in_page = find_get_page(mapping, start >> PAGE_SHIFT);
++			in_buf.src = kmap(in_page);
++			in_buf.pos = 0;
++			in_buf.size = min_t(size_t, len, PAGE_SIZE);
++		}
++	}
++	while (1) {
++		size_t ret2;
++
++		ret2 = ZSTD_endStream(stream, &out_buf);
++		if (ZSTD_isError(ret2)) {
++			pr_debug("BTRFS: ZSTD_endStream returned %d\n",
++					ZSTD_getErrorCode(ret2));
++			ret = -EIO;
++			goto out;
++		}
++		if (ret2 == 0) {
++			tot_out += out_buf.pos;
++			break;
++		}
++		if (out_buf.pos >= max_out) {
++			tot_out += out_buf.pos;
++			ret = -E2BIG;
++			goto out;
++		}
++
++		tot_out += PAGE_SIZE;
++		max_out -= PAGE_SIZE;
++		kunmap(out_page);
++		if (nr_pages == nr_dest_pages) {
++			out_page = NULL;
++			ret = -E2BIG;
++			goto out;
++		}
++		out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
++		if (out_page == NULL) {
++			ret = -ENOMEM;
++			goto out;
++		}
++		pages[nr_pages++] = out_page;
++		out_buf.dst = kmap(out_page);
++		out_buf.pos = 0;
++		out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
++	}
++
++	if (tot_out >= tot_in) {
++		ret = -E2BIG;
++		goto out;
++	}
++
++	ret = 0;
++	*total_in = tot_in;
++	*total_out = tot_out;
++out:
++	*out_pages = nr_pages;
++	/* Cleanup */
++	if (in_page) {
++		kunmap(in_page);
++		put_page(in_page);
++	}
++	if (out_page)
++		kunmap(out_page);
++	return ret;
++}
++
++static int zstd_decompress_bio(struct list_head *ws, struct page **pages_in,
++		u64 disk_start,
++		struct bio *orig_bio,
++		size_t srclen)
++{
++	struct workspace *workspace = list_entry(ws, struct workspace, list);
++	ZSTD_DStream *stream;
++	int ret = 0;
++	unsigned long page_in_index = 0;
++	unsigned long total_pages_in = DIV_ROUND_UP(srclen, PAGE_SIZE);
++	unsigned long buf_start;
++	unsigned long total_out = 0;
++	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
++	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
++
++	stream = ZSTD_createDStream(
++			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
++	if (!stream) {
++		pr_debug("BTRFS: ZSTD_createDStream failed\n");
++		ret = -EIO;
++		goto done;
++	}
++
++	in_buf.src = kmap(pages_in[page_in_index]);
++	in_buf.pos = 0;
++	in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
++
++	out_buf.dst = workspace->buf;
++	out_buf.pos = 0;
++	out_buf.size = PAGE_SIZE;
++
++	while (1) {
++		size_t ret2;
++
++		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
++		if (ZSTD_isError(ret2)) {
++			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
++					ZSTD_getErrorCode(ret2));
++			ret = -EIO;
++			goto done;
++		}
++		buf_start = total_out;
++		total_out += out_buf.pos;
++		out_buf.pos = 0;
++
++		ret = btrfs_decompress_buf2page(out_buf.dst, buf_start,
++				total_out, disk_start, orig_bio);
++		if (ret == 0)
++			break;
++
++		if (in_buf.pos >= srclen)
++			break;
++
++		/* Check if we've hit the end of a frame */
++		if (ret2 == 0)
++			break;
++
++		if (in_buf.pos == in_buf.size) {
++			kunmap(pages_in[page_in_index++]);
++			if (page_in_index >= total_pages_in) {
++				in_buf.src = NULL;
++				ret = -EIO;
++				goto done;
++			}
++			srclen -= PAGE_SIZE;
++			in_buf.src = kmap(pages_in[page_in_index]);
++			in_buf.pos = 0;
++			in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
++		}
++	}
++	ret = 0;
++	zero_fill_bio(orig_bio);
++done:
++	if (in_buf.src)
++		kunmap(pages_in[page_in_index]);
++	return ret;
++}
++
++static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
++		struct page *dest_page,
++		unsigned long start_byte,
++		size_t srclen, size_t destlen)
++{
++	struct workspace *workspace = list_entry(ws, struct workspace, list);
++	ZSTD_DStream *stream;
++	int ret = 0;
++	size_t ret2;
++	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
++	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
++	unsigned long total_out = 0;
++	unsigned long pg_offset = 0;
++	char *kaddr;
++
++	stream = ZSTD_createDStream(
++			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
++	if (!stream) {
++		pr_warn("BTRFS: ZSTD_createDStream failed\n");
++		ret = -EIO;
++		goto finish;
++	}
++
++	destlen = min_t(size_t, destlen, PAGE_SIZE);
++
++	in_buf.src = data_in;
++	in_buf.pos = 0;
++	in_buf.size = srclen;
++
++	out_buf.dst = workspace->buf;
++	out_buf.pos = 0;
++	out_buf.size = PAGE_SIZE;
++
++	ret2 = 1;
++	while (pg_offset < destlen && in_buf.pos < in_buf.size) {
++		unsigned long buf_start;
++		unsigned long buf_offset;
++		unsigned long bytes;
++
++		/* Check if the frame is over and we still need more input */
++		if (ret2 == 0) {
++			pr_debug("BTRFS: ZSTD_decompressStream ended early\n");
++			ret = -EIO;
++			goto finish;
++		}
++		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
++		if (ZSTD_isError(ret2)) {
++			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
++					ZSTD_getErrorCode(ret2));
++			ret = -EIO;
++			goto finish;
++		}
++
++		buf_start = total_out;
++		total_out += out_buf.pos;
++		out_buf.pos = 0;
++
++		if (total_out <= start_byte)
++			continue;
++
++		if (total_out > start_byte && buf_start < start_byte)
++			buf_offset = start_byte - buf_start;
++		else
++			buf_offset = 0;
++
++		bytes = min_t(unsigned long, destlen - pg_offset,
++				out_buf.size - buf_offset);
++
++		kaddr = kmap_atomic(dest_page);
++		memcpy(kaddr + pg_offset, out_buf.dst + buf_offset, bytes);
++		kunmap_atomic(kaddr);
++
++		pg_offset += bytes;
++	}
++	ret = 0;
++finish:
++	if (pg_offset < destlen) {
++		kaddr = kmap_atomic(dest_page);
++		memset(kaddr + pg_offset, 0, destlen - pg_offset);
++		kunmap_atomic(kaddr);
++	}
++	return ret;
++}
++
++const struct btrfs_compress_op btrfs_zstd_compress = {
++	.alloc_workspace = zstd_alloc_workspace,
++	.free_workspace = zstd_free_workspace,
++	.compress_pages = zstd_compress_pages,
++	.decompress_bio = zstd_decompress_bio,
++	.decompress = zstd_decompress,
++};
+diff --git a/include/uapi/linux/btrfs.h b/include/uapi/linux/btrfs.h
+index db4c253..f26c34f 100644
+--- a/include/uapi/linux/btrfs.h
++++ b/include/uapi/linux/btrfs.h
+@@ -255,13 +255,7 @@ struct btrfs_ioctl_fs_info_args {
+ #define BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL	(1ULL << 1)
+ #define BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS	(1ULL << 2)
+ #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO	(1ULL << 3)
+-/*
+- * some patches floated around with a second compression method
+- * lets save that incompat here for when they do get in
+- * Note we don't actually support it, we're just reserving the
+- * number
+- */
+-#define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZOv2	(1ULL << 4)
++#define BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD	(1ULL << 4)
+ 
+ /*
+  * older kernels tried to do bigger metadata blocks, but the
diff --git a/contrib/linux-kernel/fs/btrfs/zstd.c b/contrib/linux-kernel/fs/btrfs/zstd.c
index 23a3692ad..b7f319e7a 100644
--- a/contrib/linux-kernel/fs/btrfs/zstd.c
+++ b/contrib/linux-kernel/fs/btrfs/zstd.c
@@ -15,9 +15,10 @@
 static ZSTD_parameters zstd_get_btrfs_parameters(size_t src_len)
 {
 	ZSTD_parameters params = ZSTD_getParams(3, src_len, 0);
-	BUG_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
-	BUG_ON(params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG);
-	params.fParams.checksumFlag = 1;
+
+	if (params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG)
+		params.cParams.windowLog = ZSTD_BTRFS_MAX_WINDOWLOG;
+	WARN_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
 	return params;
 }
 
@@ -39,17 +40,21 @@ static void zstd_free_workspace(struct list_head *ws)
 
 static struct list_head *zstd_alloc_workspace(void)
 {
-	ZSTD_parameters params = zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
+	ZSTD_parameters params =
+			zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
 	struct workspace *workspace;
 
 	workspace = kzalloc(sizeof(*workspace), GFP_NOFS);
-	if (!workspace) return ERR_PTR(-ENOMEM);
+	if (!workspace)
+		return ERR_PTR(-ENOMEM);
 
-	workspace->size = max_t(size_t, ZSTD_CStreamWorkspaceBound(params.cParams),
+	workspace->size = max_t(size_t,
+			ZSTD_CStreamWorkspaceBound(params.cParams),
 			ZSTD_DStreamWorkspaceBound(ZSTD_BTRFS_MAX_INPUT));
 	workspace->mem = vmalloc(workspace->size);
 	workspace->buf = kmalloc(PAGE_SIZE, GFP_NOFS);
-	if (!workspace->mem || !workspace->buf) goto fail;
+	if (!workspace->mem || !workspace->buf)
+		goto fail;
 
 	INIT_LIST_HEAD(&workspace->list);
 
@@ -61,16 +66,13 @@ fail:
 
 static int zstd_compress_pages(struct list_head *ws,
 		struct address_space *mapping,
-		u64 start, unsigned long len,
+		u64 start,
 		struct page **pages,
-		unsigned long nr_dest_pages,
 		unsigned long *out_pages,
 		unsigned long *total_in,
-		unsigned long *total_out,
-		unsigned long max_out)
+		unsigned long *total_out)
 {
 	struct workspace *workspace = list_entry(ws, struct workspace, list);
-	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
 	ZSTD_CStream *stream;
 	int ret = 0;
 	int nr_pages = 0;
@@ -80,13 +82,18 @@ static int zstd_compress_pages(struct list_head *ws,
 	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
 	unsigned long tot_in = 0;
 	unsigned long tot_out = 0;
+	unsigned long len = *total_out;
+	const unsigned long nr_dest_pages = *out_pages;
+	unsigned long max_out = nr_dest_pages * PAGE_SIZE;
+	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
 
 	*out_pages = 0;
 	*total_out = 0;
 	*total_in = 0;
 
 	/* Initialize the stream */
-	stream = ZSTD_createCStream(params, len, workspace->mem, workspace->size);
+	stream = ZSTD_createCStream(params, len, workspace->mem,
+			workspace->size);
 	if (!stream) {
 		pr_warn("BTRFS: ZSTD_createStream failed\n");
 		ret = -EIO;
@@ -112,10 +119,12 @@ static int zstd_compress_pages(struct list_head *ws,
 	out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
 
 	while (1) {
-		const size_t rc = ZSTD_compressStream(stream, &out_buf, &in_buf);
-		if (ZSTD_isError(rc)) {
+		size_t ret2;
+
+		ret2 = ZSTD_compressStream(stream, &out_buf, &in_buf);
+		if (ZSTD_isError(ret2)) {
 			pr_debug("BTRFS: ZSTD_compressStream returned %d\n",
-					ZSTD_getErrorCode(rc));
+					ZSTD_getErrorCode(ret2));
 			ret = -EIO;
 			goto out;
 		}
@@ -177,14 +186,16 @@ static int zstd_compress_pages(struct list_head *ws,
 		}
 	}
 	while (1) {
-		const size_t rc = ZSTD_endStream(stream, &out_buf);
-		if (ZSTD_isError(rc)) {
+		size_t ret2;
+
+		ret2 = ZSTD_endStream(stream, &out_buf);
+		if (ZSTD_isError(ret2)) {
 			pr_debug("BTRFS: ZSTD_endStream returned %d\n",
-					ZSTD_getErrorCode(rc));
+					ZSTD_getErrorCode(ret2));
 			ret = -EIO;
 			goto out;
 		}
-		if (rc == 0) {
+		if (ret2 == 0) {
 			tot_out += out_buf.pos;
 			break;
 		}
@@ -228,24 +239,22 @@ out:
 		kunmap(in_page);
 		put_page(in_page);
 	}
-	if (out_page) { kunmap(out_page); }
+	if (out_page)
+		kunmap(out_page);
 	return ret;
 }
 
-static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
+static int zstd_decompress_bio(struct list_head *ws, struct page **pages_in,
 		u64 disk_start,
-		struct bio_vec *bvec,
-		int vcnt,
+		struct bio *orig_bio,
 		size_t srclen)
 {
 	struct workspace *workspace = list_entry(ws, struct workspace, list);
 	ZSTD_DStream *stream;
 	int ret = 0;
 	unsigned long page_in_index = 0;
-	unsigned long page_out_index = 0;
 	unsigned long total_pages_in = DIV_ROUND_UP(srclen, PAGE_SIZE);
 	unsigned long buf_start;
-	unsigned long pg_offset;
 	unsigned long total_out = 0;
 	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
 	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
@@ -266,13 +275,13 @@ static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
 	out_buf.pos = 0;
 	out_buf.size = PAGE_SIZE;
 
-	pg_offset = 0;
-
 	while (1) {
-		const size_t rc = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-		if (ZSTD_isError(rc)) {
+		size_t ret2;
+
+		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
+		if (ZSTD_isError(ret2)) {
 			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-					ZSTD_getErrorCode(rc));
+					ZSTD_getErrorCode(ret2));
 			ret = -EIO;
 			goto done;
 		}
@@ -280,23 +289,17 @@ static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
 		total_out += out_buf.pos;
 		out_buf.pos = 0;
 
-		{
-			int ret2 = btrfs_decompress_buf2page(out_buf.dst, buf_start,
-					total_out, disk_start, bvec, vcnt,
-					&page_out_index, &pg_offset);
-			if (ret2 == 0) {
-				break;
-			}
-		}
+		ret = btrfs_decompress_buf2page(out_buf.dst, buf_start,
+				total_out, disk_start, orig_bio);
+		if (ret == 0)
+			break;
 
-		if (in_buf.pos >= srclen) {
+		if (in_buf.pos >= srclen)
 			break;
-		}
 
 		/* Check if we've hit the end of a frame */
-		if (rc == 0) {
+		if (ret2 == 0)
 			break;
-		}
 
 		if (in_buf.pos == in_buf.size) {
 			kunmap(pages_in[page_in_index++]);
@@ -311,10 +314,11 @@ static int zstd_decompress_biovec(struct list_head *ws, struct page **pages_in,
 			in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
 		}
 	}
-	btrfs_clear_biovec_end(bvec, vcnt, page_out_index, pg_offset);
 	ret = 0;
+	zero_fill_bio(orig_bio);
 done:
-	if (in_buf.src) { kunmap(pages_in[page_in_index]); }
+	if (in_buf.src)
+		kunmap(pages_in[page_in_index]);
 	return ret;
 }
 
@@ -326,6 +330,7 @@ static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
 	struct workspace *workspace = list_entry(ws, struct workspace, list);
 	ZSTD_DStream *stream;
 	int ret = 0;
+	size_t ret2;
 	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
 	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
 	unsigned long total_out = 0;
@@ -350,41 +355,37 @@ static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
 	out_buf.pos = 0;
 	out_buf.size = PAGE_SIZE;
 
-	ret = 1;
+	ret2 = 1;
 	while (pg_offset < destlen && in_buf.pos < in_buf.size) {
 		unsigned long buf_start;
 		unsigned long buf_offset;
 		unsigned long bytes;
 
 		/* Check if the frame is over and we still need more input */
-		if (ret == 0) {
-			pr_debug("BTRFS: ZSTD_decompressStream frame ended to early\n");
+		if (ret2 == 0) {
+			pr_debug("BTRFS: ZSTD_decompressStream ended early\n");
 			ret = -EIO;
 			goto finish;
 		}
-		{
-			const size_t rc = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-			if (ZSTD_isError(rc)) {
-				pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-						ZSTD_getErrorCode(rc));
-				ret = -EIO;
-				goto finish;
-			}
-			ret = rc > 0;
+		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
+		if (ZSTD_isError(ret2)) {
+			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
+					ZSTD_getErrorCode(ret2));
+			ret = -EIO;
+			goto finish;
 		}
+
 		buf_start = total_out;
 		total_out += out_buf.pos;
 		out_buf.pos = 0;
 
-		if (total_out <= start_byte) {
+		if (total_out <= start_byte)
 			continue;
-		}
 
-		if (total_out > start_byte && buf_start < start_byte) {
+		if (total_out > start_byte && buf_start < start_byte)
 			buf_offset = start_byte - buf_start;
-		} else {
+		else
 			buf_offset = 0;
-		}
 
 		bytes = min_t(unsigned long, destlen - pg_offset,
 				out_buf.size - buf_offset);
@@ -409,6 +410,6 @@ const struct btrfs_compress_op btrfs_zstd_compress = {
 	.alloc_workspace = zstd_alloc_workspace,
 	.free_workspace = zstd_free_workspace,
 	.compress_pages = zstd_compress_pages,
-	.decompress_biovec = zstd_decompress_biovec,
+	.decompress_bio = zstd_decompress_bio,
 	.decompress = zstd_decompress,
 };

From 4ee6b15dac055e7e653b1fbfd7f65755f42597c8 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 11 Apr 2017 11:59:44 -0700
Subject: [PATCH 150/255] force contentSizeFlag=0 when using
 ZSTD_initCStream_usingCDict()

because by definition srcSize is not known when using this prototype.
added relevant test

Note : this use was already working, because at a later stage
(both ZSTD_compressBegin_usingCDict() and ZSTD_copyCCtx())
pledgedSrcSize=0 is translated into "unknown", no matter the frame parameter.
This is not correct, but of little importance,
as the medium term plan is to no longer set fParams within CDict
---
 lib/compress/zstd_compress.c |  3 ++-
 tests/zstreamtest.c          | 14 +++++++++-----
 2 files changed, 11 insertions(+), 6 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 62c1c6cdd..0ce2054fc 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3077,7 +3077,8 @@ static size_t ZSTD_initCStream_stage2(ZSTD_CStream* zcs,
 size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
 {
     if (!cdict) return ERROR(GENERIC);   /* cannot handle NULL cdict (does not know what to do) */
-    {   ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
+    {   ZSTD_parameters params = ZSTD_getParamsFromCDict(cdict);
+        params.fParams.contentSizeFlag = 0;
         zcs->cdict = cdict;
         return ZSTD_initCStream_stage2(zcs, params, 0);
     }
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 6f26ea555..ac200a7a6 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -448,10 +448,11 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
       if (!ZSTD_isError(r)) goto _output_error;  /* must fail : frame requires > 100 bytes */
       DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r)); }
 
-    DISPLAYLEVEL(3, "test%3i : check dictionary used : ", testNb++);
+    DISPLAYLEVEL(3, "test%3i : dictionary compression with masked dictID : ", testNb++);
     {   ZSTD_parameters params = ZSTD_getParams(1, CNBufferSize, dictionary.filled);
         ZSTD_CDict* cdict;
         params.fParams.noDictIDFlag = 1;
+        params.fParams.contentSizeFlag = 1;  /* test contentSize, should be disabled with initCStream_usingCDict */
         cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, params, customMem);
         { size_t const initError = ZSTD_initCStream_usingCDict(zc, cdict);
           if (ZSTD_isError(initError)) goto _output_error; }
@@ -470,17 +471,20 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
         cSize = outBuff.pos;
         ZSTD_freeCDict(cdict);
         DISPLAYLEVEL(3, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBufferSize*100);
+    }
 
-        { size_t const r = ZSTD_decompress(decodedBuffer, CNBufferSize, compressedBuffer, cSize);
-          if (!ZSTD_isError(r)) goto _output_error; /* must fail : dictionary not used */
-          DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r)); }
+    DISPLAYLEVEL(3, "test%3i : decompress without dictionary : ", testNb++);
+    {   size_t const r = ZSTD_decompress(decodedBuffer, CNBufferSize, compressedBuffer, cSize);
+        if (!ZSTD_isError(r)) goto _output_error;  /* must fail : dictionary not used */
+        DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r));
     }
 
     /* Unknown srcSize */
     DISPLAYLEVEL(3, "test%3i : pledgedSrcSize == 0 behaves properly : ", testNb++);
     {   ZSTD_parameters params = ZSTD_getParams(5, 0, 0);
         params.fParams.contentSizeFlag = 1;
-        ZSTD_initCStream_advanced(zc, NULL, 0, params, 0); } /* cstream advanced should write the 0 size field */
+        ZSTD_initCStream_advanced(zc, NULL, 0, params, 0);
+    } /* cstream advanced shall write content size = 0 */
     inBuff.src = CNBuffer;
     inBuff.size = 0;
     inBuff.pos = 0;

From b633377d0e6e2857e2ad2ffaa57f3015b7bc0b8f Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 11 Apr 2017 12:40:53 -0700
Subject: [PATCH 151/255] Add BtrFS benchmarks

---
 contrib/linux-kernel/README.md          |  26 ++++++
 contrib/linux-kernel/btrfs-benchmark.sh | 104 ++++++++++++++++++++++++
 2 files changed, 130 insertions(+)
 create mode 100755 contrib/linux-kernel/btrfs-benchmark.sh

diff --git a/contrib/linux-kernel/README.md b/contrib/linux-kernel/README.md
index 1cc74cca6..a62838517 100644
--- a/contrib/linux-kernel/README.md
+++ b/contrib/linux-kernel/README.md
@@ -24,3 +24,29 @@ The patches are based off of the linux kernel master branch (version 4.10).
 * Additionally `fs/btrfs/zstd.c` is provided as a source for convenience.
 * The patch seems to be working, it doesn't crash the kernel, and compresses at speeds and ratios athat are expected.
   It can still use some more testing for fringe features, like printing options.
+
+### Benchmarks
+
+Benchmarks run on a Ubuntu 14.04 with 2 cores and 4 GiB of RAM.
+The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor,
+16 GB of ram, and a SSD.
+
+The compression benchmark is copying 10 copies of the
+unzipped [silesia corpus](http://mattmahoney.net/dc/silesia.html) into a BtrFS
+filesystem mounted with `-o compress-force={none, lzo, zlib, zstd}`.
+The decompression benchmark is timing how long it takes to `tar` all 10 copies
+into `/dev/null`.
+The compression ratio is measured by comparing the output of `df` and `du`.
+See `btrfs-benchmark.sh` for details.
+
+| Algorithm | Compression ratio | Compression speed | Decompression speed |
+|-----------|-------------------|-------------------|---------------------|
+| None      | 0.99              | 504 MB/s          | 686 MB/s            |
+| lzo       | 1.66              | 398 MB/s          | 442 MB/s            |
+| zlib      | 2.58              | 65 MB/s           | 241 MB/s            |
+| zstd 1    | 2.57              | 260 MB/s          | 383 MB/s            |
+| zstd 3    | 2.71              | 174 MB/s          | 408 MB/s            |
+| zstd 6    | 2.87              | 70 MB/s           | 398 MB/s            |
+| zstd 9    | 2.92              | 43 MB/s           | 406 MB/s            |
+| zstd 12   | 2.93              | 21 MB/s           | 408 MB/s            |
+| zstd 15   | 3.01              | 11 MB/s           | 354 MB/s            |
diff --git a/contrib/linux-kernel/btrfs-benchmark.sh b/contrib/linux-kernel/btrfs-benchmark.sh
new file mode 100755
index 000000000..5e28da9c6
--- /dev/null
+++ b/contrib/linux-kernel/btrfs-benchmark.sh
@@ -0,0 +1,104 @@
+# !/bin/sh
+set -e
+
+# Benchmarks run on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
+# The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor and
+# 16 GB of RAM and an SSD.
+
+# silesia is a directory that can be downloaded from
+# http://mattmahoney.net/dc/silesia.html
+# ls -l silesia/
+# total 203M
+# -rwxr-xr-x 1 terrelln 9.8M Apr 12  2002 dickens
+# -rwxr-xr-x 1 terrelln  49M May 31  2002 mozilla
+# -rwxr-xr-x 1 terrelln 9.6M Mar 20  2003 mr
+# -rwxr-xr-x 1 terrelln  32M Apr  2  2002 nci
+# -rwxr-xr-x 1 terrelln 5.9M Jul  4  2002 ooffice
+# -rwxr-xr-x 1 terrelln 9.7M Apr 11  2002 osdb
+# -rwxr-xr-x 1 terrelln 6.4M Apr  2  2002 reymont
+# -rwxr-xr-x 1 terrelln  21M Mar 25  2002 samba
+# -rwxr-xr-x 1 terrelln 7.0M Mar 24  2002 sao
+# -rwxr-xr-x 1 terrelln  40M Mar 25  2002 webster
+# -rwxr-xr-x 1 terrelln 8.1M Apr  4  2002 x-ray
+# -rwxr-xr-x 1 terrelln 5.1M Nov 30  2000 xml
+
+# $HOME is on a ext4 filesystem
+BENCHMARK_DIR="$HOME/silesia/"
+N=10
+
+# Normalize the environment
+sudo umount /mnt/btrfs 2> /dev/null > /dev/null || true
+sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
+sudo rm -rf /mnt/btrfs/*
+sync
+sudo umount /mnt/btrfs
+sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
+
+# Run the benchmark
+echo "Compression"
+time sh -c "for i in \$(seq $N); do sudo cp -r $BENCHMARK_DIR /mnt/btrfs/\$i; done; sync"
+
+echo "Approximate compression ratio"
+printf "%d / %d\n"                                                             \
+  $(df /mnt/btrfs --output=used -B 1 | tail -n 1)                              \
+  $(sudo du /mnt/btrfs -b -d 0 | tr '\t' '\n' | head -n 1);
+
+# Unmount and remount to avoid any caching
+sudo umount /mnt/btrfs
+sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
+
+echo "Decompression"
+time sudo tar -c /mnt/btrfs 2> /dev/null | wc -c > /dev/null
+
+sudo rm -rf /mnt/btrfs/*
+sudo umount /mnt/btrfs
+
+# Run for each of -o compress-force={none, lzo, zlib, zstd} 5 times and take the
+# min time and ratio.
+# Ran zstd with compression levels {1, 3, 6, 9, 12, 15}.
+# Original size: 2119415342 B (using du /mnt/btrfs)
+
+# none
+# compress: 4.205 s
+# decompress: 3.090 s
+# ratio: 0.99
+
+# lzo
+# compress: 5.328 s
+# decompress: 4.793 s
+# ratio: 1.66
+
+# zlib
+# compress: 32.588 s
+# decompress: 8.791 s
+# ratio : 2.58
+
+# zstd 1
+# compress: 8.147 s
+# decompress: 5.527 s
+# ratio : 2.57
+
+# zstd 3
+# compress: 12.207 s
+# decompress: 5.195 s
+# ratio : 2.71
+
+# zstd 6
+# compress: 30.253 s
+# decompress: 5.324 s
+# ratio : 2.87
+
+# zstd 9
+# compress: 49.659 s
+# decompress: 5.220 s
+# ratio : 2.92
+
+# zstd 12
+# compress: 99.245 s
+# decompress: 5.193 s
+# ratio : 2.93
+
+# zstd 15
+# compress: 196.997 s
+# decompress: 5.992 s
+# ratio : 3.01

From 0e30059ba1cba30730174bc44c7a69e5bd7c3c5d Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 11 Apr 2017 14:41:02 -0700
Subject: [PATCH 152/255] cli : FIO_createDictBuffer() replaces FIO_loadFile()

makes it more explicit that it allocates a buffer
and that it's meant to be used for dictionary.

Also : simplified function a bit,
now only works for dictionaries up to DICTSIZE_MAX
---
 programs/fileio.c | 29 +++++++++++------------------
 1 file changed, 11 insertions(+), 18 deletions(-)

diff --git a/programs/fileio.c b/programs/fileio.c
index b384c3c2b..a3bc7e913 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -76,7 +76,7 @@
 
 #define CACHELINE 64
 
-#define MAX_DICT_SIZE (8 MB)   /* protection against large input (attack scenario) */
+#define DICTSIZE_MAX (32 MB)   /* protection against large input (attack scenario) */
 
 #define FNSPACE 30
 
@@ -278,13 +278,13 @@ static FILE* FIO_openDstFile(const char* dstFileName)
 }
 
 
-/*! FIO_loadFile() :
-*   creates a buffer, pointed by `*bufferPtr`,
-*   loads `filename` content into it,
-*   up to MAX_DICT_SIZE bytes.
-*   @return : loaded size
-*/
-static size_t FIO_loadFile(void** bufferPtr, const char* fileName)
+/*! FIO_createDictBuffer() :
+ *  creates a buffer, pointed by `*bufferPtr`,
+ *  loads `filename` content into it, up to DICTSIZE_MAX bytes.
+ *  @return : loaded size
+ *  if fileName==NULL, returns 0 and a NULL pointer
+ */
+static size_t FIO_createDictBuffer(void** bufferPtr, const char* fileName)
 {
     FILE* fileHandle;
     U64 fileSize;
@@ -296,14 +296,7 @@ static size_t FIO_loadFile(void** bufferPtr, const char* fileName)
     fileHandle = fopen(fileName, "rb");
     if (fileHandle==0) EXM_THROW(31, "zstd: %s: %s", fileName, strerror(errno));
     fileSize = UTIL_getFileSize(fileName);
-    if (fileSize > MAX_DICT_SIZE) {
-        int seekResult;
-        if (fileSize > 1 GB) EXM_THROW(32, "Dictionary file %s is too large", fileName);   /* avoid extreme cases */
-        DISPLAYLEVEL(2,"Dictionary %s is too large : using last %u bytes only \n", fileName, (U32)MAX_DICT_SIZE);
-        seekResult = fseek(fileHandle, (long int)(fileSize-MAX_DICT_SIZE), SEEK_SET);   /* use end of file */
-        if (seekResult != 0) EXM_THROW(33, "zstd: %s: %s", fileName, strerror(errno));
-        fileSize = MAX_DICT_SIZE;
-    }
+    if (fileSize > DICTSIZE_MAX) EXM_THROW(32, "Dictionary file %s is too large (> %u MB)", fileName, DICTSIZE_MAX >> 20);   /* avoid extreme cases */
     *bufferPtr = malloc((size_t)fileSize);
     if (*bufferPtr==NULL) EXM_THROW(34, "zstd: %s", strerror(errno));
     { size_t const readSize = fread(*bufferPtr, 1, (size_t)fileSize, fileHandle);
@@ -356,7 +349,7 @@ static cRess_t FIO_createCResources(const char* dictFileName, int cLevel,
 
     /* dictionary */
     {   void* dictBuffer;
-        size_t const dictBuffSize = FIO_loadFile(&dictBuffer, dictFileName);
+        size_t const dictBuffSize = FIO_createDictBuffer(&dictBuffer, dictFileName);
         if (dictFileName && (dictBuffer==NULL)) EXM_THROW(32, "zstd: allocation error : can't create dictBuffer");
         {   ZSTD_parameters params = ZSTD_getParams(cLevel, srcSize, dictBuffSize);
             params.fParams.contentSizeFlag = srcRegFile;
@@ -776,7 +769,7 @@ static dRess_t FIO_createDResources(const char* dictFileName)
 
     /* dictionary */
     {   void* dictBuffer;
-        size_t const dictBufferSize = FIO_loadFile(&dictBuffer, dictFileName);
+        size_t const dictBufferSize = FIO_createDictBuffer(&dictBuffer, dictFileName);
         size_t const initError = ZSTD_initDStream_usingDict(ress.dctx, dictBuffer, dictBufferSize);
         if (ZSTD_isError(initError)) EXM_THROW(61, "ZSTD_initDStream_usingDict error : %s", ZSTD_getErrorName(initError));
         free(dictBuffer);

From 5c42d0edc88e75fdc6ee9cf3e400e3dedd670162 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 11 Apr 2017 16:57:32 -0700
Subject: [PATCH 153/255] cli : better status display for zstdmt in 1-thread
 mode

---
 programs/fileio.c | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/programs/fileio.c b/programs/fileio.c
index a3bc7e913..f1f5a5577 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -349,7 +349,7 @@ static cRess_t FIO_createCResources(const char* dictFileName, int cLevel,
 
     /* dictionary */
     {   void* dictBuffer;
-        size_t const dictBuffSize = FIO_createDictBuffer(&dictBuffer, dictFileName);
+        size_t const dictBuffSize = FIO_createDictBuffer(&dictBuffer, dictFileName);   /* works with dictFileName==NULL */
         if (dictFileName && (dictBuffer==NULL)) EXM_THROW(32, "zstd: allocation error : can't create dictBuffer");
         {   ZSTD_parameters params = ZSTD_getParams(cLevel, srcSize, dictBuffSize);
             params.fParams.contentSizeFlag = srcRegFile;
@@ -361,7 +361,7 @@ static cRess_t FIO_createCResources(const char* dictFileName, int cLevel,
             if (comprParams->searchLog) params.cParams.searchLog = comprParams->searchLog;
             if (comprParams->searchLength) params.cParams.searchLength = comprParams->searchLength;
             if (comprParams->targetLength) params.cParams.targetLength = comprParams->targetLength;
-            if (comprParams->strategy) params.cParams.strategy = (ZSTD_strategy)(comprParams->strategy - 1);
+            if (comprParams->strategy) params.cParams.strategy = (ZSTD_strategy)(comprParams->strategy - 1);   /* 0 means : do not change */
 #ifdef ZSTD_MULTITHREAD
             {   size_t const errorCode = ZSTDMT_initCStream_advanced(ress.cctx, dictBuffer, dictBuffSize, params, srcSize);
                 if (ZSTD_isError(errorCode)) EXM_THROW(33, "Error initializing CStream : %s", ZSTD_getErrorName(errorCode));
@@ -567,8 +567,8 @@ static int FIO_compressFilename_internal(cRess_t ress,
         readsize += inSize;
 
         {   ZSTD_inBuffer  inBuff = { ress.srcBuffer, inSize, 0 };
-            while (inBuff.pos != inBuff.size) {   /* note : is there any possibility of endless loop ? for example, if outBuff is not large enough ? */
-                ZSTD_outBuffer outBuff= { ress.dstBuffer, ress.dstBufferSize, 0 };
+            while (inBuff.pos != inBuff.size) {
+                ZSTD_outBuffer outBuff = { ress.dstBuffer, ress.dstBufferSize, 0 };
 #ifdef ZSTD_MULTITHREAD
                 size_t const result = ZSTDMT_compressStream(ress.cctx, &outBuff, &inBuff);
 #else
@@ -582,13 +582,13 @@ static int FIO_compressFilename_internal(cRess_t ress,
                     if (sizeCheck!=outBuff.pos) EXM_THROW(25, "Write error : cannot write compressed block into %s", dstFileName);
                     compressedfilesize += outBuff.pos;
         }   }   }
-#ifdef ZSTD_MULTITHREAD
-        if (!fileSize) DISPLAYUPDATE(2, "\rRead : %u MB", (U32)(readsize>>20))
-        else DISPLAYUPDATE(2, "\rRead : %u / %u MB", (U32)(readsize>>20), (U32)(fileSize>>20));
-#else
-        if (!fileSize) DISPLAYUPDATE(2, "\rRead : %u MB ==> %.2f%%", (U32)(readsize>>20), (double)compressedfilesize/readsize*100)
-        else DISPLAYUPDATE(2, "\rRead : %u / %u MB ==> %.2f%%", (U32)(readsize>>20), (U32)(fileSize>>20), (double)compressedfilesize/readsize*100);
-#endif
+        if (g_nbThreads > 1) {
+            if (!fileSize) DISPLAYUPDATE(2, "\rRead : %u MB", (U32)(readsize>>20))
+            else DISPLAYUPDATE(2, "\rRead : %u / %u MB", (U32)(readsize>>20), (U32)(fileSize>>20));
+        } else {
+            if (!fileSize) DISPLAYUPDATE(2, "\rRead : %u MB ==> %.2f%%", (U32)(readsize>>20), (double)compressedfilesize/readsize*100)
+            else DISPLAYUPDATE(2, "\rRead : %u / %u MB ==> %.2f%%", (U32)(readsize>>20), (U32)(fileSize>>20), (double)compressedfilesize/readsize*100);
+        }
     }
 
     /* End of Frame */

From eb70d219fdbd0834f83bf2c66551a4b3fa145de0 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 11 Apr 2017 17:15:13 -0700
Subject: [PATCH 154/255] Add test of file > 4GB to playTests

---
 tests/playTests.sh | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index 266bbd91b..6ef5914a9 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -11,6 +11,7 @@ roundTripTest() {
         local_p="$2"
     else
         local_c="$2"
+        local_p=""
     fi
 
     rm -f tmp1 tmp2
@@ -20,6 +21,23 @@ roundTripTest() {
     $DIFF -q tmp1 tmp2
 }
 
+fileRoundTripTest() {
+    if [ -n "$3" ]; then
+        local_c="$3"
+        local_p="$2"
+    else
+        local_c="$2"
+        local_p=""
+    fi
+
+    rm -f tmp.zstd tmp.md5.1 tmp.md5.2
+    $ECHO "fileRoundTripTest: ./datagen $1 $local_p > tmp1 && $ZSTD -v$local_c -c | $ZSTD -d | $MD5SUM > tmp.md5.2"
+    ./datagen $1 $local_p > tmp
+    cat tmp | $MD5SUM > tmp.md5.1
+    $ZSTD --ultra -v$local_c -c tmp | $ZSTD -d | $MD5SUM > tmp.md5.2
+    $DIFF -q tmp.md5.1 tmp.md5.2
+}
+
 isTerminal=false
 if [ -t 0 ] && [ -t 1 ]
 then
@@ -441,6 +459,8 @@ roundTripTest -g519K 6    # greedy, hash chain
 roundTripTest -g517K 16   # btlazy2
 roundTripTest -g516K 19   # btopt
 
+fileRoundTripTest -g500K
+
 rm tmp*
 
 if [ "$1" != "--test-large-data" ]; then
@@ -476,4 +496,6 @@ roundTripTest -g50000000 -P94 19
 roundTripTest -g99000000 -P99 20
 roundTripTest -g6000000000 -P99 1
 
+fileRoundTripTest -g4193M -P99 1
+
 rm tmp*

From d37e1df2ab26b9cbb22e6b602ea5da9b3662af89 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 11 Apr 2017 17:33:26 -0700
Subject: [PATCH 155/255] Fix message

---
 tests/playTests.sh | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index 6ef5914a9..3675bb168 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -31,7 +31,7 @@ fileRoundTripTest() {
     fi
 
     rm -f tmp.zstd tmp.md5.1 tmp.md5.2
-    $ECHO "fileRoundTripTest: ./datagen $1 $local_p > tmp1 && $ZSTD -v$local_c -c | $ZSTD -d | $MD5SUM > tmp.md5.2"
+    $ECHO "fileRoundTripTest: ./datagen $1 $local_p > tmp && $ZSTD -v$local_c -c | $ZSTD -d"
     ./datagen $1 $local_p > tmp
     cat tmp | $MD5SUM > tmp.md5.1
     $ZSTD --ultra -v$local_c -c tmp | $ZSTD -d | $MD5SUM > tmp.md5.2

From 20d5e03893004cf236297808a0ee51a2a94d506b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 11 Apr 2017 18:34:02 -0700
Subject: [PATCH 156/255] content size is controlled at bufferless level

so it's active for all entry points

Also : added relevant test (wrong content size) in fuzzer
---
 lib/common/error_private.c     |  2 +-
 lib/compress/zstd_compress.c   | 13 ++++++++++---
 lib/compress/zstdmt_compress.c | 11 ++++++-----
 tests/fuzzer.c                 | 30 ++++++++++++++++++++++--------
 4 files changed, 39 insertions(+), 17 deletions(-)

diff --git a/lib/common/error_private.c b/lib/common/error_private.c
index 44ae20104..b3287245f 100644
--- a/lib/common/error_private.c
+++ b/lib/common/error_private.c
@@ -29,7 +29,7 @@ const char* ERR_getErrorString(ERR_enum code)
     case PREFIX(memory_allocation): return "Allocation error : not enough memory";
     case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
     case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
-    case PREFIX(srcSize_wrong): return "Src size incorrect";
+    case PREFIX(srcSize_wrong): return "Src size is incorrect";
     case PREFIX(corruption_detected): return "Corrupted block detected";
     case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
     case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 0ce2054fc..110698c2f 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -81,6 +81,7 @@ struct ZSTD_CCtx_s {
     size_t workSpaceSize;
     size_t blockSize;
     U64 frameContentSize;
+    U64 consumedSrcSize;
     XXH64_state_t xxhState;
     ZSTD_customMem customMem;
 
@@ -241,6 +242,7 @@ static size_t ZSTD_continueCCtx(ZSTD_CCtx* cctx, ZSTD_parameters params, U64 fra
     U32 const end = (U32)(cctx->nextSrc - cctx->base);
     cctx->params = params;
     cctx->frameContentSize = frameContentSize;
+    cctx->consumedSrcSize = 0;
     cctx->lowLimit = end;
     cctx->dictLimit = end;
     cctx->nextToUpdate = end+1;
@@ -313,6 +315,7 @@ static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
         zc->params = params;
         zc->blockSize = blockSize;
         zc->frameContentSize = frameContentSize;
+        zc->consumedSrcSize = 0;
         { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = repStartValue[i]; }
 
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
@@ -2493,6 +2496,7 @@ static size_t ZSTD_compressContinue_internal (ZSTD_CCtx* cctx,
                              ZSTD_compress_generic (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
                              ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize);
         if (ZSTD_isError(cSize)) return cSize;
+        cctx->consumedSrcSize += srcSize;
         return cSize + fhSize;
     } else
         return fhSize;
@@ -2503,7 +2507,7 @@ size_t ZSTD_compressContinue (ZSTD_CCtx* cctx,
                               void* dst, size_t dstCapacity,
                         const void* src, size_t srcSize)
 {
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1 /* frame mode */, 0 /* last chunk */);
 }
 
 
@@ -2516,7 +2520,7 @@ size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const
 {
     size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
     if (srcSize > blockSizeMax) return ERROR(srcSize_wrong);
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0 /* frame mode */, 0 /* last chunk */);
 }
 
 /*! ZSTD_loadDictionaryContent() :
@@ -2767,10 +2771,13 @@ size_t ZSTD_compressEnd (ZSTD_CCtx* cctx,
                    const void* src, size_t srcSize)
 {
     size_t endResult;
-    size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
+    size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1 /* frame mode */, 1 /* last chunk */);
     if (ZSTD_isError(cSize)) return cSize;
     endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
     if (ZSTD_isError(endResult)) return endResult;
+    if (cctx->params.fParams.contentSizeFlag) {  /* control src size */
+        if (cctx->frameContentSize != cctx->consumedSrcSize) return ERROR(srcSize_wrong);
+    }
     return cSize + endResult;
 }
 
diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index c9c3e8533..50c98ae93 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -235,11 +235,12 @@ void ZSTDMT_compressChunk(void* jobDescription)
         if (job->cdict) DEBUGLOG(3, "using CDict ");
         if (ZSTD_isError(initError)) { job->cSize = initError; goto _endJob; }
     } else {  /* srcStart points at reloaded section */
-        size_t const dictModeError = ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceRawDict, 1);  /* Force loading dictionary in "content-only" mode (no header analysis) */
-        size_t const initError = ZSTD_compressBegin_advanced(job->cctx, job->srcStart, job->dictSize, job->params, job->fullFrameSize);
-        if (ZSTD_isError(initError) || ZSTD_isError(dictModeError)) { job->cSize = initError; goto _endJob; }
-        ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceWindow, 1);
-    }
+        if (!job->firstChunk) job->params.fParams.contentSizeFlag = 0;  /* ensure no srcSize control */
+        {   size_t const dictModeError = ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceRawDict, 1);  /* Force loading dictionary in "content-only" mode (no header analysis) */
+            size_t const initError = ZSTD_compressBegin_advanced(job->cctx, job->srcStart, job->dictSize, job->params, job->fullFrameSize);
+            if (ZSTD_isError(initError) || ZSTD_isError(dictModeError)) { job->cSize = initError; goto _endJob; }
+            ZSTD_setCCtxParameter(job->cctx, ZSTD_p_forceWindow, 1);
+    }   }
     if (!job->firstChunk) {  /* flush and overwrite frame header when it's not first segment */
         size_t const hSize = ZSTD_compressContinue(job->cctx, dstBuff.start, dstBuff.size, src, 0);
         if (ZSTD_isError(hSize)) { job->cSize = hSize; goto _endJob; }
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 342c953e9..cdbbe8a22 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -524,9 +524,9 @@ static int basicUnitTests(U32 seed, double compressibility)
 
     /* Decompression defense tests */
     DISPLAYLEVEL(4, "test%3i : Check input length for magic number : ", testNb++);
-    { size_t const r = ZSTD_decompress(decodedBuffer, CNBuffSize, CNBuffer, 3);
+    { size_t const r = ZSTD_decompress(decodedBuffer, CNBuffSize, CNBuffer, 3);   /* too small input */
       if (!ZSTD_isError(r)) goto _output_error;
-      if (r != (size_t)-ZSTD_error_srcSize_wrong) goto _output_error; }
+      if (ZSTD_getErrorCode(r) != ZSTD_error_srcSize_wrong) goto _output_error; }
     DISPLAYLEVEL(4, "OK \n");
 
     DISPLAYLEVEL(4, "test%3i : Check magic Number : ", testNb++);
@@ -535,6 +535,22 @@ static int basicUnitTests(U32 seed, double compressibility)
       if (!ZSTD_isError(r)) goto _output_error; }
     DISPLAYLEVEL(4, "OK \n");
 
+    /* content size verification test */
+    DISPLAYLEVEL(4, "test%3i : Content size verification : ", testNb++);
+    {   ZSTD_CCtx* const cctx = ZSTD_createCCtx();
+        size_t const srcSize = 5000;
+        size_t const wrongSrcSize = (srcSize + 1000);
+        ZSTD_parameters params = ZSTD_getParams(1, wrongSrcSize, 0);
+        params.fParams.contentSizeFlag = 1;
+        {   size_t const result = ZSTD_compressBegin_advanced(cctx, NULL, 0, params, wrongSrcSize);
+            if (ZSTD_isError(result)) goto _output_error;
+        }
+        {   size_t const result = ZSTD_compressEnd(cctx, decodedBuffer, CNBuffSize, CNBuffer, srcSize);
+            if (!ZSTD_isError(result)) goto _output_error;
+            if (ZSTD_getErrorCode(result) != ZSTD_error_srcSize_wrong) goto _output_error;
+            DISPLAYLEVEL(4, "OK : %s \n", ZSTD_getErrorName(result));
+    }   }
+
     /* block API tests */
     {   ZSTD_CCtx* const cctx = ZSTD_createCCtx();
         static const size_t dictSize = 65 KB;
@@ -788,12 +804,10 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
         crcOrig = XXH64(sampleBuffer, sampleSize, 0);
 
         /* compression tests */
-        {
-            unsigned const cLevel =
-                    (FUZ_rand(&lseed) %
-                     (ZSTD_maxCLevel() -
-                      (FUZ_highbit32((U32)sampleSize) / cLevelLimiter))) +
-                    1;
+        {   unsigned const cLevel =
+                    ( FUZ_rand(&lseed) %
+                     (ZSTD_maxCLevel() - (FUZ_highbit32((U32)sampleSize) / cLevelLimiter)) )
+                     + 1;
             cSize = ZSTD_compressCCtx(ctx, cBuffer, cBufferSize, sampleBuffer, sampleSize, cLevel);
             CHECK(ZSTD_isError(cSize), "ZSTD_compressCCtx failed : %s", ZSTD_getErrorName(cSize));
 

From 88009a8ba27820f9a261d1f48cc8f307eb546b35 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 12 Apr 2017 00:51:24 -0700
Subject: [PATCH 157/255] removed srcSize control from CStream

since it's already done from lower bufferless API level
---
 lib/compress/zstd_compress.c | 7 +------
 1 file changed, 1 insertion(+), 6 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 110698c2f..d6774372b 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2971,7 +2971,6 @@ struct ZSTD_CStream_s {
     U32    checksum;
     U32    frameEnded;
     U64    pledgedSrcSize;
-    U64    inputProcessed;
     ZSTD_parameters params;
     ZSTD_customMem customMem;
 };   /* typedef'd to ZSTD_CStream within "zstd.h" */
@@ -3034,7 +3033,6 @@ static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long p
     zcs->stage = zcss_load;
     zcs->frameEnded = 0;
     zcs->pledgedSrcSize = pledgedSrcSize;
-    zcs->inputProcessed = 0;
     return 0;   /* ready to go */
 }
 
@@ -3226,7 +3224,6 @@ static size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
 
     *srcSizePtr = ip - istart;
     *dstCapacityPtr = op - ostart;
-    zcs->inputProcessed += *srcSizePtr;
     if (zcs->frameEnded) return 0;
     {   size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
         if (hintInSize==0) hintInSize = zcs->blockSize;
@@ -3271,9 +3268,6 @@ size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
     BYTE* const oend = (BYTE*)(output->dst) + output->size;
     BYTE* op = ostart;
 
-    if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
-        return ERROR(srcSize_wrong);   /* pledgedSrcSize not respected */
-
     if (zcs->stage != zcss_final) {
         /* flush whatever remains */
         size_t srcSize = 0;
@@ -3289,6 +3283,7 @@ size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
         zcs->stage = zcss_final;
         zcs->outBuffContentSize = !notEnded ? 0 :
             ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);  /* write epilogue, including final empty block, into outBuff */
+        if (ZSTD_isError(zcs->outBuffContentSize)) return zcs->outBuffContentSize;
     }
 
     /* flush epilogue */

From afa48518e2fbd5dfce3982e4ed003f4c707d1801 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 12:28:28 -0700
Subject: [PATCH 158/255] -T0 detects number of physical cores

---
 programs/util.h    | 172 +++++++++++++++++++++++++++++++++++++++++++++
 programs/zstdcli.c |   5 ++
 2 files changed, 177 insertions(+)

diff --git a/programs/util.h b/programs/util.h
index 9992d79da..0b90cda19 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -25,6 +25,7 @@ extern "C" {
 #include <stdlib.h>       /* malloc */
 #include <stddef.h>       /* size_t, ptrdiff_t */
 #include <stdio.h>        /* fprintf */
+#include <string.h>       /* strncmp */
 #include <sys/types.h>    /* stat, utime */
 #include <sys/stat.h>     /* stat */
 #if defined(_MSC_VER)
@@ -488,6 +489,177 @@ UTIL_STATIC void UTIL_freeFileList(const char** filenameTable, char* allocatedBu
     if (filenameTable) free((void*)filenameTable);
 }
 
+/* count the number of physical cores */
+#if defined(_WIN32) || defined(WIN32)
+
+#include <windows.h>
+
+typedef BOOL(WINAPI* LPFN_GLPI)(PSYSTEM_LOGICAL_PROCESSOR_INFORMATION, PDWORD);
+
+UTIL_STATIC int UTIL_countPhysicalCores(void)
+{
+    static int numPhysicalCores;
+    if (numPhysicalCores != 0) return numPhysicalCores;
+
+    {   LPFN_GLPI glpi;
+        BOOL done = FALSE;
+        PSYSTEM_LOGICAL_PROCESSOR_INFORMATION buffer = NULL;
+        PSYSTEM_LOGICAL_PROCESSOR_INFORMATION ptr = NULL;
+        DWORD returnLength = 0;
+        size_t byteOffset = 0;
+
+        glpi = (LPFN_GLPI)GetProcAddress(GetModuleHandle(TEXT("kernel32")),
+                                         "GetLogicalProcessorInformation");
+
+        if (glpi == NULL) {
+            goto failed;
+        }
+
+        while(!done) {
+            DWORD rc = glpi(buffer, &returnLength);
+            if (FALSE == rc) {
+                if (GetLastError() == ERROR_INSUFFICIENT_BUFFER) {
+                    if (buffer)
+                        free(buffer);
+                    buffer = (PSYSTEM_LOGICAL_PROCESSOR_INFORMATION)malloc(returnLength);
+
+                    if (buffer == NULL) {
+                        perror("zstd");
+                        exit(1);
+                    }
+                } else {
+                    /* some other error */
+                    goto failed;
+                }
+            } else {
+                done = TRUE;
+            }
+        }
+
+        while (byteOffset + sizeof(SYSTEM_LOGICAL_PROCESSOR_INFORMATION) <= returnLength) {
+            ptr = buffer;
+
+            if (ptr->RelationShip == RelationProcessorCore) {
+                numPhysicalCores++;
+            }
+        }
+
+        free(buffer);
+
+        return numPhysicalCores;
+    }
+
+failed:
+    /* try to fall back on GetSystemInfo */
+    SYSTEM_INFO sysinfo;
+    GetSystemInfo(&sysinfo);
+    numPhysicalCores = sysinfo.dwNumberOfProcessors;
+    if (numPhysicalCores == 0) numPhysicalCores = 1; /* just in case */
+    return numPhysicalCores;
+}
+
+#elif defined(__APPLE__)
+
+#include <sys/sysctl.h>
+
+/* Use apple-provided syscall
+ * see: man 3 sysctl */
+UTIL_STATIC int UTIL_countPhysicalCores(void)
+{
+    static S32 numPhysicalCores; /* apple specifies int32_t */
+    if (numPhysicalCores != 0) return numPhysicalCores;
+
+    {   int const ret = sysctlbyname("hw.physicalcpu", &numPhysicalCores, sizeof(int), NULL, 0);
+        if (ret != 0) {
+            if (errno == ENOENT) {
+                /* entry not present, fall back on 1 */
+                numPhysicalCores = 1;
+            } else {
+                perror("zstd: can't get number of physical cpus");
+                exit(1);
+            }
+        }
+
+        return numPhysicalCores;
+    }
+}
+
+#elif defined(__linux__)
+
+/* parse /proc/cpuinfo
+ * siblings / cpu cores should give hyperthreading ratio
+ * otherwise fall back on sysconf */
+UTIL_STATIC int UTIL_countPhysicalCores(void)
+{
+    static int numPhysicalCores;
+
+    if (numPhysicalCores != 0) return numPhysicalCores;
+
+    numPhysicalCores = sysconf(_SC_NPROCESSORS_ONLN);
+    if (numPhysicalCores == -1) {
+        /* value not queryable, fall back on 1 */
+        return numPhysicalCores = 1;
+    }
+
+    /* try to determine if there's hyperthreading */
+    {   FILE* const cpuinfo = fopen("/proc/cpuinfo", "r");
+        size_t const BUF_SIZE = 80;
+        char buff[BUF_SIZE];
+
+        int siblings = 0;
+        int cpu_cores = 0;
+        int ratio = 1;
+
+        if (cpuinfo == NULL) {
+            /* fall back on the sysconf value */
+            return numPhysicalCores;
+        }
+
+        /* assume the cpu cores/siblings values will be constant across all
+         * present processors */
+        while (!feof(cpuinfo)) {
+            if (fgets(buff, BUF_SIZE, cpuinfo) != NULL) {
+                if (strncmp(buff, "siblings", 8) == 0) {
+                    const char* const sep = strchr(buff, ':');
+                    if (*sep == '\0') {
+                        /* formatting was broken? */
+                        goto failed;
+                    }
+
+                    siblings = atoi(sep + 1);
+                }
+                if (strncmp(buff, "cpu cores", 9) == 0) {
+                    const char* const sep = strchr(buff, ':');
+                    if (*sep == '\0') {
+                        /* formatting was broken? */
+                        goto failed;
+                    }
+
+                    cpu_cores = atoi(sep + 1);
+                }
+            } else if (ferror(cpuinfo)) {
+                /* fall back on the sysconf value */
+                goto failed;
+            }
+        }
+        if (siblings && cpu_cores) {
+            ratio = siblings / cpu_cores;
+        }
+failed:
+        fclose(cpuinfo);
+        return numPhysicalCores = numPhysicalCores / ratio;
+    }
+}
+
+#else
+
+UTIL_STATIC int UTIL_countPhysicalCores(void)
+{
+    /* assume 1 */
+    return 1;
+}
+
+#endif
 
 #if defined (__cplusplus)
 }
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 18e259c74..73b4eab9d 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -602,6 +602,11 @@ int main(int argCount, const char* argv[])
     DISPLAYLEVEL(4, "PLATFORM_POSIX_VERSION defined: %ldL\n", (long) PLATFORM_POSIX_VERSION);
 #endif
 
+    if (nbThreads == 0) {
+        /* try to guess */
+        nbThreads = UTIL_countPhysicalCores();
+        DISPLAYLEVEL(3, "Note: %d physical core(s) detected\n", nbThreads);
+    }
 
     g_utilDisplayLevel = g_displayLevel;
     if (!followLinks) {

From f876f1200cab5d616bdecfb30144a23ea76bf9fd Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 12:33:45 -0700
Subject: [PATCH 159/255] Fix compilation on macOS

---
 programs/bench.c  | 9 +++++++--
 programs/dibio.c  | 4 +++-
 programs/fileio.c | 4 +++-
 programs/util.h   | 3 ++-
 4 files changed, 15 insertions(+), 5 deletions(-)

diff --git a/programs/bench.c b/programs/bench.c
index d25ff8f04..8d8ed4ffa 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -146,8 +146,13 @@ typedef struct {
 } blockParam_t;
 
 
-#define MIN(a,b) ((a)<(b) ? (a) : (b))
-#define MAX(a,b) ((a)>(b) ? (a) : (b))
+
+#ifndef MIN
+#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
+#endif
+#ifndef MAX
+#   define MAX(a,b)    ((a) > (b) ? (a) : (b))
+#endif
 
 static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                         const char* displayName, int cLevel,
diff --git a/programs/dibio.c b/programs/dibio.c
index b7ed280ea..5e685a325 100644
--- a/programs/dibio.c
+++ b/programs/dibio.c
@@ -89,7 +89,9 @@ unsigned DiB_isError(size_t errorCode) { return ERR_isError(errorCode); }
 
 const char* DiB_getErrorName(size_t errorCode) { return ERR_getErrorName(errorCode); }
 
-#define MIN(a,b)   ( (a) < (b) ? (a) : (b) )
+#ifndef MIN
+#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
+#endif
 
 
 /* ********************************************************
diff --git a/programs/fileio.c b/programs/fileio.c
index f1f5a5577..1dc222b65 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -96,7 +96,9 @@ void FIO_setNotificationLevel(unsigned level) { g_displayLevel=level; }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_time = 0;
 
-#define MIN(a,b)    ((a) < (b) ? (a) : (b))
+#ifndef MIN
+#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
+#endif
 
 /* ************************************************************
 * Avoid fseek()'s 2GiB barrier with MSVC, MacOS, *BSD, MinGW
diff --git a/programs/util.h b/programs/util.h
index 0b90cda19..104f8dad2 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -569,7 +569,8 @@ UTIL_STATIC int UTIL_countPhysicalCores(void)
     static S32 numPhysicalCores; /* apple specifies int32_t */
     if (numPhysicalCores != 0) return numPhysicalCores;
 
-    {   int const ret = sysctlbyname("hw.physicalcpu", &numPhysicalCores, sizeof(int), NULL, 0);
+    {   size_t size = sizeof(S32);
+        int const ret = sysctlbyname("hw.physicalcpu", &numPhysicalCores, &size, NULL, 0);
         if (ret != 0) {
             if (errno == ENOENT) {
                 /* entry not present, fall back on 1 */

From 3b6207d4bd9143204745f90a38278891dbaa4474 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 14:03:56 -0700
Subject: [PATCH 160/255] Fix compilation on windows

---
 programs/util.h | 19 ++++++++++++-------
 1 file changed, 12 insertions(+), 7 deletions(-)

diff --git a/programs/util.h b/programs/util.h
index 104f8dad2..63cfa9647 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -536,12 +536,16 @@ UTIL_STATIC int UTIL_countPhysicalCores(void)
             }
         }
 
-        while (byteOffset + sizeof(SYSTEM_LOGICAL_PROCESSOR_INFORMATION) <= returnLength) {
-            ptr = buffer;
+        ptr = buffer;
 
-            if (ptr->RelationShip == RelationProcessorCore) {
+        while (byteOffset + sizeof(SYSTEM_LOGICAL_PROCESSOR_INFORMATION) <= returnLength) {
+
+            if (ptr->Relationship == RelationProcessorCore) {
                 numPhysicalCores++;
             }
+
+            ptr++;
+            byteOffset += sizeof(SYSTEM_LOGICAL_PROCESSOR_INFORMATION);
         }
 
         free(buffer);
@@ -551,10 +555,11 @@ UTIL_STATIC int UTIL_countPhysicalCores(void)
 
 failed:
     /* try to fall back on GetSystemInfo */
-    SYSTEM_INFO sysinfo;
-    GetSystemInfo(&sysinfo);
-    numPhysicalCores = sysinfo.dwNumberOfProcessors;
-    if (numPhysicalCores == 0) numPhysicalCores = 1; /* just in case */
+    {   SYSTEM_INFO sysinfo;
+        GetSystemInfo(&sysinfo);
+        numPhysicalCores = sysinfo.dwNumberOfProcessors;
+        if (numPhysicalCores == 0) numPhysicalCores = 1; /* just in case */
+    }
     return numPhysicalCores;
 }
 

From 9227aae0013b44fc7628911d735731e01d1f9480 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 14:06:40 -0700
Subject: [PATCH 161/255] Fix clang linux compilation

---
 programs/util.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/programs/util.h b/programs/util.h
index 63cfa9647..a50b5e55b 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -601,7 +601,7 @@ UTIL_STATIC int UTIL_countPhysicalCores(void)
 
     if (numPhysicalCores != 0) return numPhysicalCores;
 
-    numPhysicalCores = sysconf(_SC_NPROCESSORS_ONLN);
+    numPhysicalCores = (int)sysconf(_SC_NPROCESSORS_ONLN);
     if (numPhysicalCores == -1) {
         /* value not queryable, fall back on 1 */
         return numPhysicalCores = 1;

From ad8da8855bd3a14c84789eda116d7f33920f454b Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 14:40:06 -0700
Subject: [PATCH 162/255] Make appveyor small tests use new mingw as well

---
 appveyor.yml | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index 27994853a..5887d52e6 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -218,10 +218,10 @@
   - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION%
   - SET PATH_ORIGINAL=%PATH%
   - if [%HOST%]==[mingw] (
-      SET "PATH_MINGW32=C:\MinGW\bin;C:\MinGW\usr\bin" &&
-      SET "PATH_MINGW64=C:\msys64\mingw64\bin;C:\msys64\usr\bin" &&
-      COPY C:\msys64\usr\bin\make.exe C:\MinGW\bin\make.exe &&
-      COPY C:\MinGW\bin\gcc.exe C:\MinGW\bin\cc.exe
+      SET "PATH_MINGW32=C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin" &&
+      SET "PATH_MINGW64=C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin" &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin\make.exe &&
+      COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin\make.exe
     )
   - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] (
       SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;"

From 42bac7fa84e5ce26c582ea517e4c51befd19cd88 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 15:35:05 -0700
Subject: [PATCH 163/255] Change ifndef's to undef's

---
 programs/bench.c  | 10 ++++------
 programs/dibio.c  |  5 ++---
 programs/fileio.c |  5 ++---
 3 files changed, 8 insertions(+), 12 deletions(-)

diff --git a/programs/bench.c b/programs/bench.c
index 8d8ed4ffa..c3681eb05 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -147,12 +147,10 @@ typedef struct {
 
 
 
-#ifndef MIN
-#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
-#endif
-#ifndef MAX
-#   define MAX(a,b)    ((a) > (b) ? (a) : (b))
-#endif
+#undef MIN
+#undef MAX
+#define MIN(a,b)    ((a) < (b) ? (a) : (b))
+#define MAX(a,b)    ((a) > (b) ? (a) : (b))
 
 static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                         const char* displayName, int cLevel,
diff --git a/programs/dibio.c b/programs/dibio.c
index 5e685a325..aac36425c 100644
--- a/programs/dibio.c
+++ b/programs/dibio.c
@@ -89,9 +89,8 @@ unsigned DiB_isError(size_t errorCode) { return ERR_isError(errorCode); }
 
 const char* DiB_getErrorName(size_t errorCode) { return ERR_getErrorName(errorCode); }
 
-#ifndef MIN
-#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
-#endif
+#undef MIN
+#define MIN(a,b)    ((a) < (b) ? (a) : (b))
 
 
 /* ********************************************************
diff --git a/programs/fileio.c b/programs/fileio.c
index 1dc222b65..9bca20664 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -96,9 +96,8 @@ void FIO_setNotificationLevel(unsigned level) { g_displayLevel=level; }
 static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
 static clock_t g_time = 0;
 
-#ifndef MIN
-#   define MIN(a,b)    ((a) < (b) ? (a) : (b))
-#endif
+#undef MIN
+#define MIN(a,b)    ((a) < (b) ? (a) : (b))
 
 /* ************************************************************
 * Avoid fseek()'s 2GiB barrier with MSVC, MacOS, *BSD, MinGW

From e4f3235c85303cee20a2f93732b93a346f273c48 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 13 Apr 2017 16:34:28 -0700
Subject: [PATCH 164/255] Add 0 initializers to static variables

---
 programs/util.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/programs/util.h b/programs/util.h
index a50b5e55b..b989e8232 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -498,7 +498,7 @@ typedef BOOL(WINAPI* LPFN_GLPI)(PSYSTEM_LOGICAL_PROCESSOR_INFORMATION, PDWORD);
 
 UTIL_STATIC int UTIL_countPhysicalCores(void)
 {
-    static int numPhysicalCores;
+    static int numPhysicalCores = 0;
     if (numPhysicalCores != 0) return numPhysicalCores;
 
     {   LPFN_GLPI glpi;
@@ -571,7 +571,7 @@ failed:
  * see: man 3 sysctl */
 UTIL_STATIC int UTIL_countPhysicalCores(void)
 {
-    static S32 numPhysicalCores; /* apple specifies int32_t */
+    static S32 numPhysicalCores = 0; /* apple specifies int32_t */
     if (numPhysicalCores != 0) return numPhysicalCores;
 
     {   size_t size = sizeof(S32);
@@ -597,7 +597,7 @@ UTIL_STATIC int UTIL_countPhysicalCores(void)
  * otherwise fall back on sysconf */
 UTIL_STATIC int UTIL_countPhysicalCores(void)
 {
-    static int numPhysicalCores;
+    static int numPhysicalCores = 0;
 
     if (numPhysicalCores != 0) return numPhysicalCores;
 

From f913cbed33e4707fab0fdf61bacf1b5076454a14 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 13 Apr 2017 22:46:41 -0700
Subject: [PATCH 165/255] fixed : memory leak in fuzzer test

---
 tests/fuzzer.c | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index cdbbe8a22..ee051be3e 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -549,7 +549,9 @@ static int basicUnitTests(U32 seed, double compressibility)
             if (!ZSTD_isError(result)) goto _output_error;
             if (ZSTD_getErrorCode(result) != ZSTD_error_srcSize_wrong) goto _output_error;
             DISPLAYLEVEL(4, "OK : %s \n", ZSTD_getErrorName(result));
-    }   }
+        }
+        ZSTD_freeCCtx(cctx);
+    }
 
     /* block API tests */
     {   ZSTD_CCtx* const cctx = ZSTD_createCCtx();

From 7dd14d03b069965c9577869841ce5646da7b7081 Mon Sep 17 00:00:00 2001
From: Baptiste Daroussin <bapt@FreeBSD.org>
Date: Sat, 15 Apr 2017 16:25:08 +0200
Subject: [PATCH 166/255] Enable multithreading on BSD

---
 programs/util.h | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/programs/util.h b/programs/util.h
index b989e8232..5f437b2b2 100644
--- a/programs/util.h
+++ b/programs/util.h
@@ -657,6 +657,24 @@ failed:
     }
 }
 
+#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)
+
+/* Use apple-provided syscall
+ * see: man 3 sysctl */
+UTIL_STATIC int UTIL_countPhysicalCores(void)
+{
+    static int numPhysicalCores = 0;
+
+    if (numPhysicalCores != 0) return numPhysicalCores;
+
+    numPhysicalCores = (int)sysconf(_SC_NPROCESSORS_ONLN);
+    if (numPhysicalCores == -1) {
+        /* value not queryable, fall back on 1 */
+        return numPhysicalCores = 1;
+    }
+    return numPhysicalCores;
+}
+
 #else
 
 UTIL_STATIC int UTIL_countPhysicalCores(void)

From c424ec2eae3cbb5451ab82f7390ceb3a28b98878 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 11:38:53 -0700
Subject: [PATCH 167/255] Add multithreading tests to playTests.sh

---
 tests/playTests.sh | 33 +++++++++++++++++++++++++++++----
 1 file changed, 29 insertions(+), 4 deletions(-)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index 3675bb168..ce1e2582e 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -31,7 +31,7 @@ fileRoundTripTest() {
     fi
 
     rm -f tmp.zstd tmp.md5.1 tmp.md5.2
-    $ECHO "fileRoundTripTest: ./datagen $1 $local_p > tmp && $ZSTD -v$local_c -c | $ZSTD -d"
+    $ECHO "fileRoundTripTest: ./datagen $1 $local_p > tmp && $ZSTD -v$local_c -c tmp | $ZSTD -d"
     ./datagen $1 $local_p > tmp
     cat tmp | $MD5SUM > tmp.md5.1
     $ZSTD --ultra -v$local_c -c tmp | $ZSTD -d | $MD5SUM > tmp.md5.2
@@ -45,12 +45,11 @@ then
 fi
 
 isWindows=false
-ECHO="echo"
+ECHO="echo -e"
 INTOVOID="/dev/null"
 case "$OS" in
   Windows*)
     isWindows=true
-    ECHO="echo -e"
     INTOVOID="NUL"
     ;;
 esac
@@ -67,11 +66,17 @@ case "$UNAME" in
   SunOS) DIFF="gdiff" ;;
 esac
 
-
 $ECHO "\nStarting playTests.sh isWindows=$isWindows ZSTD='$ZSTD'"
 
 [ -n "$ZSTD" ] || die "ZSTD variable must be defined!"
 
+if [ -n "$(echo hello | $ZSTD -v -T2 2>&1 > $INTOVOID | grep 'multi-threading is disabled')" ]
+then
+    hasMT=""
+else
+    hasMT="true"
+fi
+
 $ECHO "\n**** simple tests **** "
 
 ./datagen > tmp
@@ -461,6 +466,16 @@ roundTripTest -g516K 19   # btopt
 
 fileRoundTripTest -g500K
 
+if [ -n "$hasMT" ]
+then
+    $ECHO "\n**** zstdmt round-trip tests **** "
+    roundTripTest -g516K "16 -T0"
+    roundTripTest -g516K "19 -T2"
+    fileRoundTripTest -g500K " -T2"
+else
+    $ECHO "\n**** no multithreading, skipping zstdmt tests **** "
+fi
+
 rm tmp*
 
 if [ "$1" != "--test-large-data" ]; then
@@ -498,4 +513,14 @@ roundTripTest -g6000000000 -P99 1
 
 fileRoundTripTest -g4193M -P99 1
 
+if [ -n "$hasMT" ]
+then
+    $ECHO "\n**** zstdmt long round-trip tests **** "
+    roundTripTest -g99000000 -P99 "20 -T2"
+    roundTripTest -g6000000000 -P99 "1 -T2"
+    fileRoundTripTest -g4193M -P98 " -T0"
+else
+    $ECHO "\n**** no multithreading, skipping zstdmt tests **** "
+fi
+
 rm tmp*

From 5a61f36474b7384dc16bdc77f884ef9b0ce41c9f Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Fri, 14 Apr 2017 11:33:04 -0700
Subject: [PATCH 168/255] Make zstd compile with mt by default

---
 appveyor.yml                                 |  7 +++--
 build/VS2005/zstd/zstd.vcproj                |  8 ++---
 build/VS2005/zstdlib/zstdlib.vcproj          |  8 ++---
 build/VS2008/zstd/zstd.vcproj                |  8 ++---
 build/VS2008/zstdlib/zstdlib.vcproj          |  8 ++---
 build/VS2010/libzstd-dll/libzstd-dll.vcxproj |  8 ++---
 build/VS2010/libzstd/libzstd.vcxproj         |  8 ++---
 build/VS2010/zstd/zstd.vcxproj               |  8 ++---
 build/cmake/programs/CMakeLists.txt          |  9 +++---
 programs/Makefile                            | 32 +++++++++++++++-----
 programs/zstdcli.c                           |  2 ++
 11 files changed, 63 insertions(+), 43 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index 5887d52e6..4aad71469 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -15,7 +15,7 @@
     - COMPILER: "gcc"
       HOST:     "mingw"
       PLATFORM: "x86"
-      SCRIPT:   "make lib && make zstd && make -C tests allnothread"
+      SCRIPT:   "make allarch"
       ARTIFACT: "true"
       BUILD:    "true"
     - COMPILER: "clang"
@@ -191,7 +191,7 @@
     - COMPILER: "gcc"
       HOST:     "mingw"
       PLATFORM: "x86"
-      SCRIPT:   "make lib && make zstd && make -C tests allnothread"
+      SCRIPT:   "make allarch"
     - COMPILER: "clang"
       HOST:     "mingw"
       PLATFORM: "x64"
@@ -237,7 +237,8 @@
       ) ) &&
       make -v &&
       sh -c "%COMPILER% -v" &&
-      sh -c "CC=%COMPILER% %SCRIPT%"
+      set "CC=%COMPILER%" &&
+      sh -c "%SCRIPT%"
     )
   - if [%HOST%]==[visual] (
       ECHO *** &&
diff --git a/build/VS2005/zstd/zstd.vcproj b/build/VS2005/zstd/zstd.vcproj
index 1f4febead..46cabbf6e 100644
--- a/build/VS2005/zstd/zstd.vcproj
+++ b/build/VS2005/zstd/zstd.vcproj
@@ -44,7 +44,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -121,7 +121,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
@@ -196,7 +196,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -274,7 +274,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
diff --git a/build/VS2005/zstdlib/zstdlib.vcproj b/build/VS2005/zstdlib/zstdlib.vcproj
index 8da313673..f77df786f 100644
--- a/build/VS2005/zstdlib/zstdlib.vcproj
+++ b/build/VS2005/zstdlib/zstdlib.vcproj
@@ -44,7 +44,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -120,7 +120,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
@@ -194,7 +194,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -271,7 +271,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
diff --git a/build/VS2008/zstd/zstd.vcproj b/build/VS2008/zstd/zstd.vcproj
index 468d25672..2e2923d55 100644
--- a/build/VS2008/zstd/zstd.vcproj
+++ b/build/VS2008/zstd/zstd.vcproj
@@ -45,7 +45,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -122,7 +122,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
@@ -197,7 +197,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -275,7 +275,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress"
-				PreprocessorDefinitions="ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
diff --git a/build/VS2008/zstdlib/zstdlib.vcproj b/build/VS2008/zstdlib/zstdlib.vcproj
index 857e1463e..ac85f7aeb 100644
--- a/build/VS2008/zstdlib/zstdlib.vcproj
+++ b/build/VS2008/zstdlib/zstdlib.vcproj
@@ -45,7 +45,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -121,7 +121,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
@@ -195,7 +195,7 @@
 				Name="VCCLCompilerTool"
 				Optimization="0"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE"
 				MinimalRebuild="true"
 				BasicRuntimeChecks="3"
 				RuntimeLibrary="3"
@@ -272,7 +272,7 @@
 				EnableIntrinsicFunctions="true"
 				OmitFramePointers="true"
 				AdditionalIncludeDirectories="$(SolutionDir)..\..\lib;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\dictBuilder"
-				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
+				PreprocessorDefinitions="ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE"
 				RuntimeLibrary="0"
 				EnableFunctionLevelLinking="true"
 				UsePrecompiledHeader="0"
diff --git a/build/VS2010/libzstd-dll/libzstd-dll.vcxproj b/build/VS2010/libzstd-dll/libzstd-dll.vcxproj
index 866d04a04..364b3bea5 100644
--- a/build/VS2010/libzstd-dll/libzstd-dll.vcxproj
+++ b/build/VS2010/libzstd-dll/libzstd-dll.vcxproj
@@ -149,7 +149,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <MinimalRebuild>true</MinimalRebuild>
       <BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
       <RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
@@ -169,7 +169,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>true</TreatWarningAsError>
       <BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
       <RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
@@ -189,7 +189,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <EnablePREfast>false</EnablePREfast>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
       <DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
@@ -211,7 +211,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>false</TreatWarningAsError>
       <EnablePREfast>false</EnablePREfast>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
diff --git a/build/VS2010/libzstd/libzstd.vcxproj b/build/VS2010/libzstd/libzstd.vcxproj
index 186b4c4da..6087d737c 100644
--- a/build/VS2010/libzstd/libzstd.vcxproj
+++ b/build/VS2010/libzstd/libzstd.vcxproj
@@ -146,7 +146,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <MinimalRebuild>true</MinimalRebuild>
       <BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
       <RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
@@ -166,7 +166,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>true</TreatWarningAsError>
       <BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
       <RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
@@ -186,7 +186,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <EnablePREfast>false</EnablePREfast>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
       <DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
@@ -208,7 +208,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>false</TreatWarningAsError>
       <EnablePREfast>false</EnablePREfast>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
diff --git a/build/VS2010/zstd/zstd.vcxproj b/build/VS2010/zstd/zstd.vcxproj
index 7568e4902..438dc6173 100644
--- a/build/VS2010/zstd/zstd.vcxproj
+++ b/build/VS2010/zstd/zstd.vcxproj
@@ -155,7 +155,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>true</TreatWarningAsError>
       <EnablePREfast>false</EnablePREfast>
     </ClCompile>
@@ -171,7 +171,7 @@
       </PrecompiledHeader>
       <WarningLevel>Level4</WarningLevel>
       <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>true</TreatWarningAsError>
       <EnablePREfast>false</EnablePREfast>
     </ClCompile>
@@ -189,7 +189,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <EnablePREfast>false</EnablePREfast>
       <TreatWarningAsError>false</TreatWarningAsError>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
@@ -210,7 +210,7 @@
       <Optimization>MaxSpeed</Optimization>
       <FunctionLevelLinking>true</FunctionLevelLinking>
       <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <PreprocessorDefinitions>ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
       <TreatWarningAsError>false</TreatWarningAsError>
       <EnablePREfast>false</EnablePREfast>
       <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index a481a8e1d..588fea41e 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -51,17 +51,16 @@ IF (UNIX)
 ENDIF (UNIX)
 
 IF (ZSTD_MULTITHREAD_SUPPORT)
-    ADD_EXECUTABLE(zstdmt ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
-    SET_TARGET_PROPERTIES(zstdmt PROPERTIES COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
-    TARGET_LINK_LIBRARIES(zstdmt libzstd_shared)
+    SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
 
     SET(THREADS_PREFER_PTHREAD_FLAG ON)
     FIND_PACKAGE(Threads REQUIRED)
     IF (CMAKE_USE_PTHREADS_INIT)
-        TARGET_LINK_LIBRARIES(zstdmt ${CMAKE_THREAD_LIBS_INIT})
+        TARGET_LINK_LIBRARIES(zstd ${CMAKE_THREAD_LIBS_INIT})
     ELSE()
         MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads")
     ENDIF()
 
-    INSTALL(TARGETS zstdmt RUNTIME DESTINATION "bin")
+    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd zstdmt COMMENT "Creating zstdmt symlink")
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdmt DESTINATION "bin")
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)
diff --git a/programs/Makefile b/programs/Makefile
index b8e976b21..3f71a5334 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -82,9 +82,22 @@ else
 EXT =
 endif
 
+VOID = /dev/null
+
+# thread detection
+NO_THREAD_MSG := ==> no threads, building without multithreading support
+HAVE_PTHREAD := $(shell printf '\#include <pthread.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_pthread$(EXT) -x c - -pthread 2> $(VOID) && rm have_pthread$(EXT) && echo 1 || echo 0)
+HAVE_THREAD := $(shell [ "$(HAVE_PTHREAD)" -eq "1" -o -n "$(filter Windows%,$(OS))" ] && echo 1 || echo 0)
+ifeq ($(HAVE_THREAD), 1)
+THREAD_MSG := ==> building with threading support
+THREAD_CPP := -DZSTD_MULTITHREAD
+THREAD_LD := -pthread
+else
+THREAD_MSG := NO_THREAD_MSG
+endif
+
 # zlib detection
 NO_ZLIB_MSG := ==> no zlib, building zstd without .gz support
-VOID = /dev/null
 HAVE_ZLIB := $(shell printf '\#include <zlib.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_zlib$(EXT) -x c - -lz 2> $(VOID) && rm have_zlib$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_ZLIB), 1)
 ZLIB_MSG := ==> building zstd with .gz compression support
@@ -115,8 +128,8 @@ all: zstd
 
 $(ZSTDDECOMP_O): CFLAGS += $(ALIGN_LOOP)
 
-zstd : CPPFLAGS += $(ZLIBCPP)
-zstd : LDFLAGS += $(ZLIBLD)
+zstd : CPPFLAGS += $(ZLIBCPP) $(THREAD_CPP)
+zstd : LDFLAGS += $(ZLIBLD) $(THREAD_LD)
 zstd : LZMA_MSG := $(NO_LZMA_MSG)
 zstd-nogz : ZLIB_MSG := $(NO_ZLIB_MSG)
 zstd-nogz : LZMA_MSG := $(NO_LZMA_MSG)
@@ -124,6 +137,7 @@ xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
 zstd zstd-nogz xzstd : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
 zstd zstd-nogz xzstd : $(ZSTDLIB_OBJ) zstdcli.o fileio.o bench.o datagen.o dibio.o
+	@echo "$(THREAD_MSG)"
 	@echo "$(ZLIB_MSG)"
 	@echo "$(LZMA_MSG)"
 ifneq (,$(filter Windows%,$(OS)))
@@ -145,6 +159,11 @@ endif
 zstd-nolegacy : clean_decomp_o
 	$(MAKE) zstd ZSTD_LEGACY_SUPPORT=0
 
+zstd-nomt : THREAD_CPP :=
+zstd-nomt : THREAD_LD :=
+zstd-nomt : THREAD_MSG := NO_THREAD_MSG
+zstd-nomt : zstd
+
 zstd-pgo : MOREFLAGS = -fprofile-generate
 zstd-pgo : clean zstd
 	./zstd -b19i1 $(PROFILE_WITH)
@@ -169,10 +188,6 @@ zstd-decompress: $(ZSTDCOMMON_FILES) $(ZSTDDECOMP_FILES) zstdcli.c fileio.c
 zstd-compress: $(ZSTDCOMMON_FILES) $(ZSTDCOMP_FILES) zstdcli.c fileio.c
 	$(CC) $(FLAGS) -DZSTD_NOBENCH -DZSTD_NODICT -DZSTD_NODECOMPRESS $^ -o $@$(EXT)
 
-zstdmt: CPPFLAGS += -DZSTD_MULTITHREAD
-ifeq (,$(filter Windows%,$(OS)))
-zstdmt: LDFLAGS += -lpthread
-endif
 zstdmt: zstd
 
 generate_res:
@@ -231,6 +246,9 @@ install: zstd
 	@$(INSTALL_PROGRAM) zstd $(DESTDIR)$(BINDIR)/zstd
 	@ln -sf zstd $(DESTDIR)$(BINDIR)/zstdcat
 	@ln -sf zstd $(DESTDIR)$(BINDIR)/unzstd
+ifeq ($(HAVE_THREAD),1)
+	@ln -sf zstd $(DESTDIR)$(BINDIR)/zstdmt
+endif
 	@$(INSTALL_SCRIPT) zstdless $(DESTDIR)$(BINDIR)/zstdless
 	@$(INSTALL_SCRIPT) zstdgrep $(DESTDIR)$(BINDIR)/zstdgrep
 	@echo Installing man pages
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 73b4eab9d..6cbe7383f 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -49,6 +49,7 @@
 #define AUTHOR "Yann Collet"
 #define WELCOME_MESSAGE "*** %s %i-bits %s, by %s ***\n", COMPRESSOR_NAME, (int)(sizeof(size_t)*8), ZSTD_VERSION, AUTHOR
 
+#define ZSTD_ZSTDMT "zstdmt"
 #define ZSTD_UNZSTD "unzstd"
 #define ZSTD_CAT "zstdcat"
 #define ZSTD_GZ "gzip"
@@ -343,6 +344,7 @@ int main(int argCount, const char* argv[])
     programName = lastNameFromPath(programName);
 
     /* preset behaviors */
+    if (exeNameMatch(programName, ZSTD_ZSTDMT)) nbThreads=0;
     if (exeNameMatch(programName, ZSTD_UNZSTD)) operation=zom_decompress;
     if (exeNameMatch(programName, ZSTD_CAT)) { operation=zom_decompress; forceStdout=1; FIO_overwriteMode(); outFileName=stdoutmark; g_displayLevel=1; }
     if (exeNameMatch(programName, ZSTD_GZ)) { suffix = GZ_EXTENSION; FIO_setCompressionType(FIO_gzipCompression); FIO_setRemoveSrcFile(1); }    /* behave like gzip */

From d845dab69c15896ea2d857266ef889ef52e9f7aa Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 12:10:58 -0700
Subject: [PATCH 169/255] Fix input size too small to trigger zstdmt

---
 tests/playTests.sh | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/tests/playTests.sh b/tests/playTests.sh
index ce1e2582e..deeebee2e 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -469,9 +469,9 @@ fileRoundTripTest -g500K
 if [ -n "$hasMT" ]
 then
     $ECHO "\n**** zstdmt round-trip tests **** "
-    roundTripTest -g516K "16 -T0"
-    roundTripTest -g516K "19 -T2"
-    fileRoundTripTest -g500K " -T2"
+    roundTripTest -g4M "1 -T0"
+    roundTripTest -g8M "3 -T2"
+    fileRoundTripTest -g4M "19 -T2 -B1M"
 else
     $ECHO "\n**** no multithreading, skipping zstdmt tests **** "
 fi

From f6ef4db20e3025146a338fc399b48b4f1705fa4d Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 12:21:11 -0700
Subject: [PATCH 170/255] Install zstdmt even without threading support

---
 programs/Makefile | 2 --
 1 file changed, 2 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 3f71a5334..aca442644 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -246,9 +246,7 @@ install: zstd
 	@$(INSTALL_PROGRAM) zstd $(DESTDIR)$(BINDIR)/zstd
 	@ln -sf zstd $(DESTDIR)$(BINDIR)/zstdcat
 	@ln -sf zstd $(DESTDIR)$(BINDIR)/unzstd
-ifeq ($(HAVE_THREAD),1)
 	@ln -sf zstd $(DESTDIR)$(BINDIR)/zstdmt
-endif
 	@$(INSTALL_SCRIPT) zstdless $(DESTDIR)$(BINDIR)/zstdless
 	@$(INSTALL_SCRIPT) zstdgrep $(DESTDIR)$(BINDIR)/zstdgrep
 	@echo Installing man pages

From 5935c990a0653abd71727d2cb5ebc5775a792864 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 16:05:20 -0700
Subject: [PATCH 171/255] Add zstdmt and -T0 to man page

---
 programs/zstd.1    | 7 +++++--
 programs/zstd.1.md | 8 ++++++--
 2 files changed, 11 insertions(+), 4 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index c6b2c2742..b8389042e 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -2,12 +2,15 @@
 .TH "ZSTD" "1" "April 2017" "zstd 1.1.5" "User Commands"
 .
 .SH "NAME"
-\fBzstd\fR \- zstd, unzstd, zstdcat \- Compress or decompress \.zst files
+\fBzstd\fR \- zstd, zstdmt, unzstd, zstdcat \- Compress or decompress \.zst files
 .
 .SH "SYNOPSIS"
 \fBzstd\fR [\fIOPTIONS\fR] [\-|<INPUT\-FILE>] [\-o <OUTPUT\-FILE>]
 .
 .P
+\fBzstdmt\fR is equivalent to \fBzstd \-T0\fR
+.
+.P
 \fBunzstd\fR is equivalent to \fBzstd \-d\fR
 .
 .P
@@ -98,7 +101,7 @@ unlocks high compression levels 20+ (maximum 22), using a lot more memory\. Note
 .
 .TP
 \fB\-T#\fR
-Compress using # threads (default: 1)\. This modifier is only available if \fBzstd\fR was compiled with multithreading support\.
+Compress using # threads (default: 1)\. If \fB#\fR is 0, attempt to detect the number of physical CPU cores and compress with that many threads\. This modifier is only available if \fBzstd\fR was compiled with multithreading support\.
 .
 .TP
 \fB\-D file\fR
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index 07c36f683..9044eb34e 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -1,11 +1,13 @@
-zstd(1) -- zstd, unzstd, zstdcat - Compress or decompress .zst files
-====================================================================
+zstd(1) -- zstd, zstdmt, unzstd, zstdcat - Compress or decompress .zst files
+============================================================================
 
 SYNOPSIS
 --------
 
 `zstd` [*OPTIONS*] [-|&lt;INPUT-FILE&gt;] [-o &lt;OUTPUT-FILE&gt;]
 
+`zstdmt` is equivalent to `zstd -T0`
+
 `unzstd` is equivalent to `zstd -d`
 
 `zstdcat` is equivalent to `zstd -dcf`
@@ -101,6 +103,8 @@ the last one takes effect.
     Note that decompression will also require more memory when using these levels.
 * `-T#`:
     Compress using # threads (default: 1).
+    If `#` is 0, attempt to detect the number of physical CPU cores and compress with
+    that many threads.
     This modifier is only available if `zstd` was compiled with multithreading support.
 * `-D file`:
     use `file` as Dictionary to compress or decompress FILE(s)

From c47c68f6ca6f782cd9d24c4b8a11c45553cd1700 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 17 Apr 2017 16:14:21 -0700
Subject: [PATCH 172/255] proper evaluation of Huffman CTable size

---
 lib/common/huf.h             | 4 +++-
 lib/compress/zstd_compress.c | 5 ++---
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/lib/common/huf.h b/lib/common/huf.h
index e5572760a..32313cf74 100644
--- a/lib/common/huf.h
+++ b/lib/common/huf.h
@@ -121,8 +121,10 @@ size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t s
 #define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
 
 /* static allocation of HUF's Compression Table */
+#define HUF_CTABLE_SIZE_U32(maxSymbolValue)   ((maxSymbolValue)+1)   /* Use tables of U32, for proper alignment */
+#define HUF_CTABLE_SIZE(maxSymbolValue)       (HUF_CTABLE_SIZE_U32(maxSymbolValue) * sizeof(U32))
 #define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
-    U32 name##hb[maxSymbolValue+1]; \
+    U32 name##hb[HUF_CTABLE_SIZE_U32(maxSymbolValue)]; \
     void* name##hv = &(name##hb); \
     HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
 
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index d6774372b..04791ba95 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -304,7 +304,7 @@ static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
         zc->hufTable = (HUF_CElt*)ptr;
         zc->flagStaticTables = 0;
         zc->flagStaticHufTable = HUF_repeat_none;
-        ptr = ((U32*)ptr) + 256;  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
+        ptr = ((U32*)ptr) + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
 
         zc->nextToUpdate = 1;
         zc->nextSrc = NULL;
@@ -362,7 +362,6 @@ size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long
 {
     if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
 
-
     memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
     {   ZSTD_parameters params = srcCCtx->params;
         params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
@@ -397,7 +396,7 @@ size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long
         memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
     }
     if (srcCCtx->flagStaticHufTable) {
-        memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256*4);
+        memcpy(dstCCtx->hufTable, srcCCtx->hufTable, HUF_CTABLE_SIZE(255));
     }
 
     return 0;

From e6c504dbe604ffab1e6f9b68a62face1c4c23758 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 17:11:33 -0700
Subject: [PATCH 173/255] Update -T0 comment in man page

---
 programs/zstd.1    | 2 +-
 programs/zstd.1.md | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index b8389042e..b84ab3324 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -101,7 +101,7 @@ unlocks high compression levels 20+ (maximum 22), using a lot more memory\. Note
 .
 .TP
 \fB\-T#\fR
-Compress using # threads (default: 1)\. If \fB#\fR is 0, attempt to detect the number of physical CPU cores and compress with that many threads\. This modifier is only available if \fBzstd\fR was compiled with multithreading support\.
+Compress using # threads (default: 1)\. If \fB#\fR is 0, attempt to detect the number of physical CPU cores and compress with that many threads\. This modified does nothing if \fBzstd\fR was compiled without multithread support\.
 .
 .TP
 \fB\-D file\fR
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index 9044eb34e..4b918d8fd 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -105,7 +105,7 @@ the last one takes effect.
     Compress using # threads (default: 1).
     If `#` is 0, attempt to detect the number of physical CPU cores and compress with
     that many threads.
-    This modifier is only available if `zstd` was compiled with multithreading support.
+    This modified does nothing if `zstd` was compiled without multithread support.
 * `-D file`:
     use `file` as Dictionary to compress or decompress FILE(s)
 * `--nodictID`:

From c8b2df7d6220f62f4f930e62dc361098b5a002c7 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 17 Apr 2017 17:13:44 -0700
Subject: [PATCH 174/255] Compile CLI using files instead of objs

This avoids conflicts between how the library was
configured and how the CLI was configured.
---
 programs/Makefile | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/programs/Makefile b/programs/Makefile
index aca442644..f3140a19c 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -136,7 +136,7 @@ zstd-nogz : LZMA_MSG := $(NO_LZMA_MSG)
 xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
 zstd zstd-nogz xzstd : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
-zstd zstd-nogz xzstd : $(ZSTDLIB_OBJ) zstdcli.o fileio.o bench.o datagen.o dibio.o
+zstd zstd-nogz xzstd : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
 	@echo "$(ZLIB_MSG)"
 	@echo "$(LZMA_MSG)"

From 4f818182b80946c21b4196755228bb7136923176 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 17 Apr 2017 17:57:35 -0700
Subject: [PATCH 175/255] clarified frame parameters for
 ZSTD_compress*_usingCDict()

created ZSTD_compressBegin_usingCDict_internal(),
which gives direct control to frame Parameters.
ZSTD_resetCStream_internal() now points into it.
---
 lib/common/zstd_internal.h        |  2 ++
 lib/compress/zstd_compress.c      | 41 +++++++++++++++++++------------
 lib/zstd.h                        |  7 +++---
 tests/fuzzer.c                    |  7 ------
 tests/paramgrill.c                |  9 ++++---
 zlibWrapper/examples/zwrapbench.c |  8 +++---
 6 files changed, 41 insertions(+), 33 deletions(-)

diff --git a/lib/common/zstd_internal.h b/lib/common/zstd_internal.h
index 5c5b28732..1e2cbd4d7 100644
--- a/lib/common/zstd_internal.h
+++ b/lib/common/zstd_internal.h
@@ -58,6 +58,8 @@
 /*-*************************************
 *  shared macros
 ***************************************/
+#undef MIN
+#undef MAX
 #define MIN(a,b) ((a)<(b) ? (a) : (b))
 #define MAX(a,b) ((a)>(b) ? (a) : (b))
 #define CHECK_F(f) { size_t const errcod = f; if (ERR_isError(errcod)) return errcod; }  /* check and Forward error code */
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 04791ba95..851158f61 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2911,36 +2911,45 @@ static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict* cdict) {
     return ZSTD_getParamsFromCCtx(cdict->refContext);
 }
 
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
+/* ZSTD_compressBegin_usingCDict_internal() :
+ * cdict must be != NULL */
+static size_t ZSTD_compressBegin_usingCDict_internal(
+    ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict,
+    ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize)
 {
     if (cdict==NULL) return ERROR(GENERIC);  /* does not support NULL cdict */
-    if (cdict->dictContentSize) CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
+    if (cdict->dictContentSize)
+        CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))  /* to be changed, to consider fParams */
     else {
         ZSTD_parameters params = cdict->refContext->params;
-        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+        params.fParams = fParams;
         CHECK_F(ZSTD_compressBegin_internal(cctx, NULL, 0, params, pledgedSrcSize));
     }
     return 0;
 }
 
+/* ZSTD_compressBegin_usingCDict() :
+ * pledgedSrcSize=0 means "unknown"
+ * if pledgedSrcSize>0, it will enable contentSizeFlag */
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
+{
+    ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    fParams.contentSizeFlag = (pledgedSrcSize > 0);
+    return ZSTD_compressBegin_usingCDict_internal(cctx, cdict, fParams, pledgedSrcSize);
+}
+
 /*! ZSTD_compress_usingCDict() :
-*   Compression using a digested Dictionary.
-*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-*   Note that compression level is decided during dictionary creation */
+ *  Compression using a digested Dictionary.
+ *  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+ *  Note that compression parameters are decided at CDict creation time
+ *  while frame parameters are hardcoded */
 size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
                                 void* dst, size_t dstCapacity,
                                 const void* src, size_t srcSize,
                                 const ZSTD_CDict* cdict)
 {
-    CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));  /* will check if cdict != NULL */
-
-    if (cdict->refContext->params.fParams.contentSizeFlag == 1) {
-        cctx->params.fParams.contentSizeFlag = 1;
-        cctx->frameContentSize = srcSize;
-    } else {
-        cctx->params.fParams.contentSizeFlag = 0;
-    }
-
+    ZSTD_frameParameters const fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    CHECK_F (ZSTD_compressBegin_usingCDict_internal(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
     return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
 }
 
@@ -3022,7 +3031,7 @@ static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long p
 {
     if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
 
-    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
+    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict_internal(zcs->cctx, zcs->cdict, zcs->params.fParams, pledgedSrcSize))
     else CHECK_F(ZSTD_compressBegin_internal(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
 
     zcs->inToCompress = 0;
diff --git a/lib/zstd.h b/lib/zstd.h
index 6066db45e..18ec1cd7f 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -194,9 +194,10 @@ ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize
 ZSTDLIB_API size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
 
 /*! ZSTD_compress_usingCDict() :
-*   Compression using a digested Dictionary.
-*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-*   Note that compression level is decided during dictionary creation. */
+ *  Compression using a digested Dictionary.
+ *  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+ *  Note that compression level is decided during dictionary creation.
+ *  Frame parameters are hardcoded (dictID=yes, contentSize=yes, checksum=no) */
 ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
                                             void* dst, size_t dstCapacity,
                                       const void* src, size_t srcSize,
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index ee051be3e..3123d1825 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -406,7 +406,6 @@ static int basicUnitTests(U32 seed, double compressibility)
 
         DISPLAYLEVEL(4, "test%3i : compress with preprocessed dictionary : ", testNb++);
         {   ZSTD_parameters params = ZSTD_getParams(1, CNBuffSize, dictSize);
-            params.fParams.contentSizeFlag = 0;
             {   ZSTD_customMem customMem = { NULL, NULL, NULL };
                 ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, params, customMem);
                 cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
@@ -423,12 +422,6 @@ static int basicUnitTests(U32 seed, double compressibility)
         }
         DISPLAYLEVEL(4, "OK \n");
 
-        DISPLAYLEVEL(4, "test%3i : frame should not have content size : ", testNb++);
-        {   unsigned long long const contentSize = ZSTD_findDecompressedSize(compressedBuffer, cSize);
-            if (contentSize != ZSTD_CONTENTSIZE_UNKNOWN)  goto _output_error;  /* cdict contentSizeFlag not used */
-        }
-        DISPLAYLEVEL(4, "OK \n");
-
         DISPLAYLEVEL(4, "test%3i : frame built with dictionary should be decompressible : ", testNb++);
         CHECKPLUS(r, ZSTD_decompress_usingDict(dctx,
                                        decodedBuffer, CNBuffSize,
diff --git a/tests/paramgrill.c b/tests/paramgrill.c
index 3c1f0150b..1913b54d0 100644
--- a/tests/paramgrill.c
+++ b/tests/paramgrill.c
@@ -58,6 +58,11 @@ static const int g_maxNbVariations = 64;
 **************************************/
 #define DISPLAY(...)  fprintf(stderr, __VA_ARGS__)
 
+#undef MIN
+#undef MAX
+#define MIN(a,b)   ( (a) < (b) ? (a) : (b) )
+#define MAX(a,b)   ( (a) > (b) ? (a) : (b) )
+
 
 /*-************************************
 *  Benchmark Parameters
@@ -145,8 +150,6 @@ typedef struct
 } blockParam_t;
 
 
-#define MIN(a,b)  ( (a) < (b) ? (a) : (b) )
-
 static size_t BMK_benchParam(BMK_result_t* resultPtr,
                              const void* srcBuffer, size_t srcSize,
                              ZSTD_CCtx* ctx,
@@ -513,8 +516,6 @@ static BYTE g_alreadyTested[PARAMTABLESIZE] = {0};   /* init to zero */
     g_alreadyTested[(XXH64(sanitizeParams(p), sizeof(p), 0) >> 3) & PARAMTABLEMASK]
 
 
-#define MAX(a,b)   ( (a) > (b) ? (a) : (b) )
-
 static void playAround(FILE* f, winnerInfo_t* winners,
                        ZSTD_compressionParameters params,
                        const void* srcBuffer, size_t srcSize,
diff --git a/zlibWrapper/examples/zwrapbench.c b/zlibWrapper/examples/zwrapbench.c
index 1c3391e90..401daa1b5 100644
--- a/zlibWrapper/examples/zwrapbench.c
+++ b/zlibWrapper/examples/zwrapbench.c
@@ -128,6 +128,11 @@ void BMK_SetBlockSize(size_t blockSize)
 /* ********************************************************
 *  Bench functions
 **********************************************************/
+#undef MIN
+#undef MAX
+#define MIN(a,b) ((a)<(b) ? (a) : (b))
+#define MAX(a,b) ((a)>(b) ? (a) : (b))
+
 typedef struct
 {
     z_const char* srcPtr;
@@ -142,9 +147,6 @@ typedef struct
 typedef enum { BMK_ZSTD, BMK_ZSTD_STREAM, BMK_ZLIB, BMK_ZWRAP_ZLIB, BMK_ZWRAP_ZSTD, BMK_ZLIB_REUSE, BMK_ZWRAP_ZLIB_REUSE, BMK_ZWRAP_ZSTD_REUSE } BMK_compressor;
 
 
-#define MIN(a,b) ((a)<(b) ? (a) : (b))
-#define MAX(a,b) ((a)>(b) ? (a) : (b))
-
 static int BMK_benchMem(z_const void* srcBuffer, size_t srcSize,
                         const char* displayName, int cLevel,
                         const size_t* fileSizes, U32 nbFiles,

From af4f45b68243748b7c16c09a7a1cb4529363b054 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 03:17:44 -0700
Subject: [PATCH 176/255] Improved code comments for block functions

---
 lib/zstd.h | 19 ++++++++++---------
 1 file changed, 10 insertions(+), 9 deletions(-)

diff --git a/lib/zstd.h b/lib/zstd.h
index 18ec1cd7f..2f195636a 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -754,19 +754,20 @@ ZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
     - Compressing and decompressing require a context structure
       + Use ZSTD_createCCtx() and ZSTD_createDCtx()
     - It is necessary to init context before starting
-      + compression : ZSTD_compressBegin()
-      + decompression : ZSTD_decompressBegin()
-      + variants _usingDict() are also allowed
-      + copyCCtx() and copyDCtx() work too
-    - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
-      + If you need to compress more, cut data into multiple blocks
-      + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
+      + compression : any ZSTD_compressBegin*() variant, including with dictionary
+      + decompression : any ZSTD_decompressBegin*() variant, including with dictionary
+      + copyCCtx() and copyDCtx() can be used too
+    - Block size is limited, it must be <= ZSTD_getBlockSizeMax() <= ZSTD_BLOCKSIZE_ABSOLUTEMAX
+      + If input is larger than a block size, it's necessary to split input data into multiple blocks
+      + For inputs larger than a single block size, consider using the regular ZSTD_compress() instead.
+        Frame metadata is not that costly, and quickly becomes negligible as source size grows larger.
     - When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
       In which case, nothing is produced into `dst`.
       + User must test for such outcome and deal directly with uncompressed data
       + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
-      + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
-        Use ZSTD_insertBlock() in such a case.
+      + In case of multiple successive blocks, should some of them be uncompressed,
+        decoder must be informed of their existence in order to follow proper history.
+        Use ZSTD_insertBlock() for such a case.
 */
 
 #define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)   /* define, for static allocation */

From 9606256a8d4c24ecf93740d37d55e14676122626 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 18 Apr 2017 13:52:00 -0700
Subject: [PATCH 177/255] Fix no thread message

---
 programs/Makefile | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index f3140a19c..4ab4dfd62 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -93,7 +93,7 @@ THREAD_MSG := ==> building with threading support
 THREAD_CPP := -DZSTD_MULTITHREAD
 THREAD_LD := -pthread
 else
-THREAD_MSG := NO_THREAD_MSG
+THREAD_MSG := $(NO_THREAD_MSG)
 endif
 
 # zlib detection
@@ -161,7 +161,7 @@ zstd-nolegacy : clean_decomp_o
 
 zstd-nomt : THREAD_CPP :=
 zstd-nomt : THREAD_LD :=
-zstd-nomt : THREAD_MSG := NO_THREAD_MSG
+zstd-nomt : THREAD_MSG := $(NO_THREAD_MSG)
 zstd-nomt : zstd
 
 zstd-pgo : MOREFLAGS = -fprofile-generate

From 715b9aa113e4c9d7953b0cbeb1756d0ea3572f79 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 13:55:53 -0700
Subject: [PATCH 178/255] created ZSTD_compressBegin_usingCDict_advanced()

---
 doc/zstd_manual.html         | 31 ++++++++++++++++---------------
 lib/compress/zstd_compress.c | 10 +++++-----
 lib/zstd.h                   |  4 +++-
 3 files changed, 24 insertions(+), 21 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index a5b66f7d3..d267cfc3c 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -169,9 +169,10 @@ size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
                                 void* dst, size_t dstCapacity,
                           const void* src, size_t srcSize,
                           const ZSTD_CDict* cdict);
-</b><p>   Compression using a digested Dictionary.
-   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-   Note that compression level is decided during dictionary creation. 
+</b><p>  Compression using a digested Dictionary.
+  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+  Note that compression level is decided during dictionary creation.
+  Frame parameters are hardcoded (dictID=yes, contentSize=yes, checksum=no) 
 </p></pre><BR>
 
 <pre><b>ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);
@@ -560,10 +561,9 @@ size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
 <h3>Buffer-less streaming compression functions</h3><pre></pre><b><pre>size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
 size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); </b>/**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */<b>
-size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); </b>/**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */<b>
 size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); </b>/**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */<b>
-size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   </b>/* compression parameters are already set within cdict. pledgedSrcSize=0 means null-size */<b>
+size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); </b>/**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */<b>
 </pre></b><BR>
 <a name="Chapter19"></a><h2>Buffer-less streaming decompression (synchronous mode)</h2><pre>
   A ZSTD_DCtx object is required to track streaming operations.
@@ -648,19 +648,20 @@ ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
     - Compressing and decompressing require a context structure
       + Use ZSTD_createCCtx() and ZSTD_createDCtx()
     - It is necessary to init context before starting
-      + compression : ZSTD_compressBegin()
-      + decompression : ZSTD_decompressBegin()
-      + variants _usingDict() are also allowed
-      + copyCCtx() and copyDCtx() work too
-    - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
-      + If you need to compress more, cut data into multiple blocks
-      + Consider using the regular ZSTD_compress() instead, as frame metadata costs become negligible when source size is large.
+      + compression : any ZSTD_compressBegin*() variant, including with dictionary
+      + decompression : any ZSTD_decompressBegin*() variant, including with dictionary
+      + copyCCtx() and copyDCtx() can be used too
+    - Block size is limited, it must be <= ZSTD_getBlockSizeMax() <= ZSTD_BLOCKSIZE_ABSOLUTEMAX
+      + If input is larger than a block size, it's necessary to split input data into multiple blocks
+      + For inputs larger than a single block size, consider using the regular ZSTD_compress() instead.
+        Frame metadata is not that costly, and quickly becomes negligible as source size grows larger.
     - When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
       In which case, nothing is produced into `dst`.
       + User must test for such outcome and deal directly with uncompressed data
       + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
-      + In case of multiple successive blocks, decoder must be informed of uncompressed block existence to follow proper history.
-        Use ZSTD_insertBlock() in such a case.
+      + In case of multiple successive blocks, should some of them be uncompressed,
+        decoder must be informed of their existence in order to follow proper history.
+        Use ZSTD_insertBlock() for such a case.
 <BR></pre>
 
 <h3>Raw zstd block functions</h3><pre></pre><b><pre>size_t ZSTD_getBlockSizeMax(ZSTD_CCtx* cctx);
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 851158f61..33d4ab005 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2911,9 +2911,9 @@ static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict* cdict) {
     return ZSTD_getParamsFromCCtx(cdict->refContext);
 }
 
-/* ZSTD_compressBegin_usingCDict_internal() :
+/* ZSTD_compressBegin_usingCDict_advanced() :
  * cdict must be != NULL */
-static size_t ZSTD_compressBegin_usingCDict_internal(
+size_t ZSTD_compressBegin_usingCDict_advanced(
     ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict,
     ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize)
 {
@@ -2935,7 +2935,7 @@ size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, u
 {
     ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
     fParams.contentSizeFlag = (pledgedSrcSize > 0);
-    return ZSTD_compressBegin_usingCDict_internal(cctx, cdict, fParams, pledgedSrcSize);
+    return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, pledgedSrcSize);
 }
 
 /*! ZSTD_compress_usingCDict() :
@@ -2949,7 +2949,7 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
                                 const ZSTD_CDict* cdict)
 {
     ZSTD_frameParameters const fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    CHECK_F (ZSTD_compressBegin_usingCDict_internal(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
+    CHECK_F (ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
     return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
 }
 
@@ -3031,7 +3031,7 @@ static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long p
 {
     if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
 
-    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict_internal(zcs->cctx, zcs->cdict, zcs->params.fParams, pledgedSrcSize))
+    if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict_advanced(zcs->cctx, zcs->cdict, zcs->params.fParams, pledgedSrcSize))
     else CHECK_F(ZSTD_compressBegin_internal(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
 
     zcs->inToCompress = 0;
diff --git a/lib/zstd.h b/lib/zstd.h
index 2f195636a..5101fd26c 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -659,8 +659,10 @@ ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
 ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
-ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
 ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   /* compression parameters are already set within cdict. pledgedSrcSize=0 means null-size */
+ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
+
 ZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 

From 30fb499208e650ba3e5f28bafde788fda474dfff Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 14:08:50 -0700
Subject: [PATCH 179/255] Changed ZSTD_resetCCtx_advanced() into
 ZSTD_resetCCtx_internal()

for naming consistency :
_advanced() can be invoked
while _internal() are strictly static
---
 lib/compress/zstd_compress.c | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 33d4ab005..9328b7c40 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -257,9 +257,9 @@ static size_t ZSTD_continueCCtx(ZSTD_CCtx* cctx, ZSTD_parameters params, U64 fra
 
 typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset, ZSTDcrp_fullReset } ZSTD_compResetPolicy_e;
 
-/*! ZSTD_resetCCtx_advanced() :
+/*! ZSTD_resetCCtx_internal() :
     note : `params` must be validated */
-static size_t ZSTD_resetCCtx_advanced (ZSTD_CCtx* zc,
+static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                                        ZSTD_parameters params, U64 frameContentSize,
                                        ZSTD_compResetPolicy_e const crp)
 {
@@ -365,7 +365,7 @@ size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long
     memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
     {   ZSTD_parameters params = srcCCtx->params;
         params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-        ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
+        ZSTD_resetCCtx_internal(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
     }
 
     /* copy tables */
@@ -2694,7 +2694,7 @@ static size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
 {
     ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
     assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-    CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
+    CHECK_F(ZSTD_resetCCtx_internal(cctx, params, pledgedSrcSize, crp));
     return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
 }
 

From ca6fae78080d0a532ce90be830584212c7350fc2 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 18 Apr 2017 14:13:01 -0700
Subject: [PATCH 180/255] Add MT enabled targets for libzstd

---
 lib/Makefile | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/lib/Makefile b/lib/Makefile
index 197fdeeea..d8d8e179d 100644
--- a/lib/Makefile
+++ b/lib/Makefile
@@ -71,6 +71,9 @@ libzstd.a: $(ZSTD_OBJ)
 	@echo compiling static library
 	@$(AR) $(ARFLAGS) $@ $^
 
+libzstd.a-mt: CPPFLAGS += -DZSTD_MULTHREAD
+libzstd.a-mt: libzstd.a
+
 $(LIBZSTD): LDFLAGS += -shared -fPIC -fvisibility=hidden
 $(LIBZSTD): $(ZSTD_FILES)
 	@echo compiling dynamic library $(LIBVER)
@@ -86,10 +89,17 @@ endif
 
 libzstd : $(LIBZSTD)
 
+libzstd-mt : CPPFLAGS += -DZSTD_MULTITHREAD
+libzstd-mt : libzstd
+
 lib: libzstd.a libzstd
 
-lib-release: DEBUGFLAGS :=
+lib-mt: CPPFLAGS += -DZSTD_MULTITHREAD
+lib-mt: lib
+
+lib-release lib-release-mt: DEBUGFLAGS :=
 lib-release: lib
+lib-release-mt: lib-mt
 
 clean:
 	@$(RM) -r *.dSYM   # Mac OS-X specific

From b402f1ef37b76a44803da8ed6104d8e01ce8f223 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 14:34:24 -0700
Subject: [PATCH 181/255] added make list

---
 Makefile | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/Makefile b/Makefile
index 7e57e1680..dc2ac4ce0 100644
--- a/Makefile
+++ b/Makefile
@@ -109,10 +109,15 @@ clean:
 # make install is validated only for Linux, OSX, Hurd and some BSD targets
 #------------------------------------------------------------------------------
 ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU FreeBSD DragonFly NetBSD))
+
 HOST_OS = POSIX
 CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON
-.PHONY: install uninstall travis-install clangtest gpptest armtest usan asan uasan
 
+.PHONY: list
+list:
+	@$(MAKE) -pRrq -f $(lastword $(MAKEFILE_LIST)) : 2>/dev/null | awk -v RS= -F: '/^# File/,/^# Finished Make data base/ {if ($$1 !~ "^[#.]") {print $$1}}' | sort | egrep -v -e '^[^[:alnum:]]' -e '^$@$$' | xargs
+
+.PHONY: install uninstall travis-install clangtest gpptest armtest usan asan uasan
 install:
 	@$(MAKE) -C $(ZSTDDIR) $@
 	@$(MAKE) -C $(PRGDIR) $@

From a4cab801835561ef63a8005482b8090f81c14aca Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 14:54:54 -0700
Subject: [PATCH 182/255] added ZSTD_copyCCtx_internal()

which respects provided fParams.
---
 lib/compress/zstd_compress.c | 32 ++++++++++++++++++++++++--------
 1 file changed, 24 insertions(+), 8 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 9328b7c40..9d9cb394f 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -354,17 +354,20 @@ void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
     for (i=0; i<ZSTD_REP_NUM; i++) cctx->rep[i] = 0;
 }
 
-/*! ZSTD_copyCCtx() :
-*   Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
-*   Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
-*   @return : 0, or an error code */
-size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
+
+/*! ZSTD_copyCCtx_internal() :
+ *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
+ *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
+ *  pledgedSrcSize=0 means "empty" if fParams.contentSizeFlag=1
+ *  @return : 0, or an error code */
+size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
+                              ZSTD_frameParameters fParams, unsigned long long pledgedSrcSize)
 {
     if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
 
     memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
     {   ZSTD_parameters params = srcCCtx->params;
-        params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+        params.fParams = fParams;
         ZSTD_resetCCtx_internal(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
     }
 
@@ -402,9 +405,22 @@ size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long
     return 0;
 }
 
+/*! ZSTD_copyCCtx() :
+ *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
+ *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
+ *  pledgedSrcSize==0 means "unknown".
+*   @return : 0, or an error code */
+size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
+{
+    ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    fParams.contentSizeFlag = pledgedSrcSize>0;
+
+    return ZSTD_copyCCtx_internal(dstCCtx, srcCCtx, fParams, pledgedSrcSize);
+}
+
 
 /*! ZSTD_reduceTable() :
-*   reduce table indexes by `reducerValue` */
+ *  reduce table indexes by `reducerValue` */
 static void ZSTD_reduceTable (U32* const table, U32 const size, U32 const reducerValue)
 {
     U32 u;
@@ -2919,7 +2935,7 @@ size_t ZSTD_compressBegin_usingCDict_advanced(
 {
     if (cdict==NULL) return ERROR(GENERIC);  /* does not support NULL cdict */
     if (cdict->dictContentSize)
-        CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))  /* to be changed, to consider fParams */
+        CHECK_F( ZSTD_copyCCtx_internal(cctx, cdict->refContext, fParams, pledgedSrcSize) )
     else {
         ZSTD_parameters params = cdict->refContext->params;
         params.fParams = fParams;

From 0bb381dad88105946728d04c3ea45c19204c2636 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 15:08:52 -0700
Subject: [PATCH 183/255] added test for ZSTD_initCStream_advanced()

when params.fParams.contentSizeFlags = 1
and pledgedSrcSize = 0
then srcSize should be considered 0 (empty), and not "unknown"
---
 tests/zstreamtest.c | 19 ++++++++++++++++++-
 1 file changed, 18 insertions(+), 1 deletion(-)

diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index ac200a7a6..6673208b0 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -479,7 +479,24 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
         DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r));
     }
 
-    /* Unknown srcSize */
+    /* Empty srcSize */
+    DISPLAYLEVEL(3, "test%3i : ZSTD_initCStream_advanced with pledgedSrcSize=0 and dict : ", testNb++);
+    {   ZSTD_parameters params = ZSTD_getParams(5, 0, 0);
+        params.fParams.contentSizeFlag = 1;
+        ZSTD_initCStream_advanced(zc, dictionary.start, dictionary.filled, params, 0);
+    } /* cstream advanced shall write content size = 0 */
+    inBuff.src = CNBuffer;
+    inBuff.size = 0;
+    inBuff.pos = 0;
+    outBuff.dst = compressedBuffer;
+    outBuff.size = compressedBufferSize;
+    outBuff.pos = 0;
+    if (ZSTD_isError(ZSTD_compressStream(zc, &outBuff, &inBuff))) goto _output_error;
+    if (ZSTD_endStream(zc, &outBuff) != 0) goto _output_error;
+    cSize = outBuff.pos;
+    if (ZSTD_findDecompressedSize(compressedBuffer, cSize) != 0) goto _output_error;
+    DISPLAYLEVEL(3, "OK \n");
+
     DISPLAYLEVEL(3, "test%3i : pledgedSrcSize == 0 behaves properly : ", testNb++);
     {   ZSTD_parameters params = ZSTD_getParams(5, 0, 0);
         params.fParams.contentSizeFlag = 1;

From 98cf7fcb2ab311dc40a616cd15774813e1e8517d Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 18 Apr 2017 17:03:37 -0700
Subject: [PATCH 184/255] Update README

---
 lib/README.md | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/lib/README.md b/lib/README.md
index 3357e3d87..8fa60a20f 100644
--- a/lib/README.md
+++ b/lib/README.md
@@ -22,6 +22,14 @@ Some additional API may be useful if you're looking into advanced features :
                           They are not "stable", their definition may change in the future.
                           Only static linking is allowed.
 
+#### ZSTDMT API
+
+To enable building the multithreaded compression API, use the `make lib-mt` target.
+The header file zstdmt_compress.h (in compress/) provides the prototypes for the API.
+If linking a program that uses the ZSTDMT API against libzstd.a on a POSIX system,
+the -pthread flag must be provided to the compiler at link time.
+Note that these prototypes may still be used in a version built without multithread support,
+but they will be single threaded (i.e. no benefits will be given over the standard ZSTD API).
 
 #### Modular build
 

From 2c5514c759a747ea902a346a9a9911ce726272e7 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 22:52:41 -0700
Subject: [PATCH 185/255] fixed ZSTDMT_initCStream_advanced()

Must use the new ZSTD_compressBegin_usingCDict_advanced()
to enforce correct frame parameters
---
 lib/compress/zstd_compress.c   | 2 +-
 lib/compress/zstdmt_compress.c | 2 +-
 tests/zstreamtest.c            | 6 ++++--
 3 files changed, 6 insertions(+), 4 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 9d9cb394f..29dc0b773 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -392,12 +392,12 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
 
     /* copy entropy tables */
     dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
-    dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
     if (srcCCtx->flagStaticTables) {
         memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
         memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
         memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
     }
+    dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
     if (srcCCtx->flagStaticHufTable) {
         memcpy(dstCCtx->hufTable, srcCCtx->hufTable, HUF_CTABLE_SIZE(255));
     }
diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 50c98ae93..04a448981 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -231,7 +231,7 @@ void ZSTDMT_compressChunk(void* jobDescription)
     DEBUGLOG(3, "job (first:%u) (last:%u) : dictSize %u, srcSize %u",
                  job->firstChunk, job->lastChunk, (U32)job->dictSize, (U32)job->srcSize);
     if (job->cdict) {  /* should only happen for first segment */
-        size_t const initError = ZSTD_compressBegin_usingCDict(job->cctx, job->cdict, job->fullFrameSize);
+        size_t const initError = ZSTD_compressBegin_usingCDict_advanced(job->cctx, job->cdict, job->params.fParams, job->fullFrameSize);
         if (job->cdict) DEBUGLOG(3, "using CDict ");
         if (ZSTD_isError(initError)) { job->cSize = initError; goto _endJob; }
     } else {  /* srcStart points at reloaded section */
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 6673208b0..4048a7df0 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -131,7 +131,7 @@ static buffer_t FUZ_createDictionary(const void* src, size_t srcSize, size_t blo
     }
     {   size_t const dictSize = ZDICT_trainFromBuffer(dict.start, requestedDictSize, src, blockSizes, (unsigned)nbBlocks);
         free(blockSizes);
-        if (ZDICT_isError(dictSize)) { free(dict.start); return (buffer_t){ NULL, 0, 0 }; }
+        if (ZDICT_isError(dictSize)) { free(dict.start); return g_nullBuffer; }
         dict.size = requestedDictSize;
         dict.filled = dictSize;
         return dict;   /* how to return dictSize ? */
@@ -972,6 +972,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                 params.fParams.checksumFlag = FUZ_rand(&lseed) & 1;
                 params.fParams.noDictIDFlag = FUZ_rand(&lseed) & 1;
                 params.fParams.contentSizeFlag = pledgedSrcSize>0;
+                DISPLAYLEVEL(5, "checksumFlag : %u \n", params.fParams.checksumFlag);
                 { size_t const initError = ZSTDMT_initCStream_advanced(zc, dict, dictSize, params, pledgedSrcSize);
                   CHECK (ZSTD_isError(initError),"ZSTDMT_initCStream_advanced error : %s", ZSTD_getErrorName(initError)); }
                 ZSTDMT_setMTCtxParameter(zc, ZSTDMT_p_overlapSectionLog, FUZ_rand(&lseed) % 12);
@@ -1023,9 +1024,9 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                     CHECK (ZSTD_isError(remainingToFlush), "ZSTDMT_endStream error : %s", ZSTD_getErrorName(remainingToFlush));
                     DISPLAYLEVEL(5, "endStream : remainingToFlush : %u \n", (U32)remainingToFlush);
             }   }
-            DISPLAYLEVEL(5, "Frame completed \n");
             crcOrig = XXH64_digest(&xxhState);
             cSize = outBuff.pos;
+            DISPLAYLEVEL(5, "Frame completed : %u bytes \n", (U32)cSize);
         }
 
         /* multi - fragments decompression test */
@@ -1046,6 +1047,7 @@ static int fuzzerTests_MT(U32 seed, U32 nbTests, unsigned startTest, double comp
                 DISPLAYLEVEL(5, "ZSTD_decompressStream input %u bytes \n", (U32)readCSrcSize);
                 decompressionResult = ZSTD_decompressStream(zd, &outBuff, &inBuff);
                 CHECK (ZSTD_isError(decompressionResult), "decompression error : %s", ZSTD_getErrorName(decompressionResult));
+                DISPLAYLEVEL(5, "inBuff.pos = %u \n", (U32)readCSrcSize);
             }
             CHECK (outBuff.pos != totalTestSize, "decompressed data : wrong size (%u != %u)", (U32)outBuff.pos, (U32)totalTestSize);
             CHECK (inBuff.pos != cSize, "compressed data should be fully read (%u != %u)", (U32)inBuff.pos, (U32)cSize);

From e847730452ba155888c193acf63f1038af0bfa81 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 18 Apr 2017 23:15:28 -0700
Subject: [PATCH 186/255] slightly refined README comments on lib-mt

---
 lib/README.md | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/lib/README.md b/lib/README.md
index 8fa60a20f..79b6fd500 100644
--- a/lib/README.md
+++ b/lib/README.md
@@ -24,12 +24,12 @@ Some additional API may be useful if you're looking into advanced features :
 
 #### ZSTDMT API
 
-To enable building the multithreaded compression API, use the `make lib-mt` target.
-The header file zstdmt_compress.h (in compress/) provides the prototypes for the API.
-If linking a program that uses the ZSTDMT API against libzstd.a on a POSIX system,
-the -pthread flag must be provided to the compiler at link time.
-Note that these prototypes may still be used in a version built without multithread support,
-but they will be single threaded (i.e. no benefits will be given over the standard ZSTD API).
+To enable multithreaded compression within the library, invoke `make lib-mt` target.
+Prototypes are defined in header file `compress/zstdmt_compress.h`.
+When linking a program that uses ZSTDMT API against libzstd.a on a POSIX system,
+`-pthread` flag must be provided to the compiler and linker.
+Note : ZSTDMT prototypes can still be used with a library built without multithread support,
+but in this case, they will be single threaded only.
 
 #### Modular build
 

From 522df42e10710a543414f84d620a8b858645d0e2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Wed, 19 Apr 2017 19:20:27 +0200
Subject: [PATCH 187/255] Add lzma and zlib support to cmake build system

cmake 2.8.9 needed for FindLibLZMA
---
 build/cmake/CMakeLists.txt          |  2 +-
 build/cmake/programs/CMakeLists.txt | 27 +++++++++++++++++++++++++++
 2 files changed, 28 insertions(+), 1 deletion(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index 9ce52ed21..bf6890818 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -8,7 +8,7 @@
 # ################################################################
 
 PROJECT(zstd)
-CMAKE_MINIMUM_REQUIRED(VERSION 2.8.7)
+CMAKE_MINIMUM_REQUIRED(VERSION 2.8.9)
 SET(ZSTD_SOURCE_DIR "${CMAKE_SOURCE_DIR}/../..")
 
 #-----------------------------------------------------------------------------
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index 588fea41e..b6f79aba3 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -64,3 +64,30 @@ IF (ZSTD_MULTITHREAD_SUPPORT)
     ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd zstdmt COMMENT "Creating zstdmt symlink")
     INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdmt DESTINATION "bin")
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)
+
+OPTION(ZSTD_ZLIB_SUPPORT "ZLIB SUPPORT" OFF)
+OPTION(ZSTD_LZMA_SUPPORT "LZMA SUPPORT" OFF)
+
+IF (ZSTD_ZLIB_SUPPORT)
+    FIND_PACKAGE(ZLIB REQUIRED)
+
+    IF (ZLIB_FOUND)
+        INCLUDE_DIRECTORIES(${ZLIB_INCLUDE_DIRS})
+	TARGET_LINK_LIBRARIES(zstd ${ZLIB_LIBRARIES})
+        SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_GZCOMPRESS;ZSTD_GZDECOMPRESS")
+    ELSE ()
+        MESSAGE(SEND_ERROR "zlib library is missing")
+    ENDIF ()
+ENDIF ()
+
+IF (ZSTD_LZMA_SUPPORT)
+    FIND_PACKAGE(LibLZMA REQUIRED)
+
+    IF (LIBLZMA_FOUND)
+        INCLUDE_DIRECTORIES(${LIBLZMA_INCLUDE_DIRS})
+	TARGET_LINK_LIBRARIES(zstd ${LIBLZMA_LIBRARIES})
+	SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_LZMACOMPRESS;ZSTD_LZMADECOMPRESS")
+    ELSE ()
+        MESSAGE(SEND_ERROR "lzma library is missing")
+    ENDIF ()
+ENDIF ()

From fce21777bdce8695ab75f0ae781bfbca39b22d53 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Wed, 19 Apr 2017 19:22:17 +0200
Subject: [PATCH 188/255] Copy files during build phase, custom targets instead
 of commands

Previously some files were copied only during configure phase.
Custom targets seem nicer.
---
 build/cmake/programs/CMakeLists.txt | 14 ++++++++------
 1 file changed, 8 insertions(+), 6 deletions(-)

diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index b6f79aba3..c3e68e01c 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -31,16 +31,18 @@ ENDIF (MSVC)
 
 ADD_EXECUTABLE(zstd ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources})
 TARGET_LINK_LIBRARIES(zstd libzstd_shared)
-ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd zstdcat COMMENT "Creating zstdcat symlink")
-ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd unzstd COMMENT "Creating unzstd symlink")
+ADD_CUSTOM_TARGET(zstdcat ALL ${CMAKE_COMMAND} -E create_symlink zstd zstdcat DEPENDS zstd COMMENT "Creating zstdcat symlink")
+ADD_CUSTOM_TARGET(unzstd ALL ${CMAKE_COMMAND} -E create_symlink zstd unzstd DEPENDS zstd COMMENT "Creating unzstd symlink")
 INSTALL(TARGETS zstd RUNTIME DESTINATION "bin")
 INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat DESTINATION "bin")
 INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd DESTINATION "bin")
 
 IF (UNIX)
-    FILE(COPY ${PROGRAMS_DIR}/zstd.1 DESTINATION .)
-    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd.1 zstdcat.1 COMMENT "Creating zstdcat.1 symlink")
-    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd.1 unzstd.1 COMMENT "Creating unzstd.1 symlink")
+    ADD_CUSTOM_TARGET(zstd.1 ALL
+        ${CMAKE_COMMAND} -E copy ${PROGRAMS_DIR}/zstd.1 .
+        COMMENT "Copying manpage zstd.1")
+    ADD_CUSTOM_TARGET(zstdcat.1 ALL ${CMAKE_COMMAND} -E create_symlink zstd.1 zstdcat.1 DEPENDS zstd.1 COMMENT "Creating zstdcat.1 symlink")
+    ADD_CUSTOM_TARGET(unzstd.1 ALL ${CMAKE_COMMAND} -E create_symlink zstd.1 unzstd.1 DEPENDS zstd.1 COMMENT "Creating unzstd.1 symlink")
     INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstd.1 DESTINATION "share/man/man1")
     INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat.1 DESTINATION "share/man/man1")
     INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd.1 DESTINATION "share/man/man1")
@@ -61,7 +63,7 @@ IF (ZSTD_MULTITHREAD_SUPPORT)
         MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads")
     ENDIF()
 
-    ADD_CUSTOM_COMMAND(TARGET zstd POST_BUILD COMMAND ${CMAKE_COMMAND} -E create_symlink zstd zstdmt COMMENT "Creating zstdmt symlink")
+    ADD_CUSTOM_TARGET(zstdmt ALL ${CMAKE_COMMAND} -E create_symlink zstd zstdmt DEPENDS zstd COMMENT "Creating zstdmt symlink")
     INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdmt DESTINATION "bin")
 ENDIF (ZSTD_MULTITHREAD_SUPPORT)
 

From cba4e79a9314b4bc216d25bf80b59f1d221c141f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Wed, 19 Apr 2017 19:25:29 +0200
Subject: [PATCH 189/255] Create and install pkg-config file with cmake

---
 build/cmake/lib/CMakeLists.txt  | 12 ++++++++++++
 build/cmake/lib/pkgconfig.cmake |  1 +
 2 files changed, 13 insertions(+)
 create mode 100644 build/cmake/lib/pkgconfig.cmake

diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 7a345bf56..50618f4a8 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -130,8 +130,20 @@ IF (ZSTD_BUILD_STATIC)
 ENDIF (ZSTD_BUILD_STATIC)
 
 IF (UNIX)
+    # pkg-config
+    SET(PREFIX "${CMAKE_INSTALL_PREFIX}")
+    SET(LIBDIR "${CMAKE_INSTALL_PREFIX}/lib")
+    SET(INCLUDEDIR "${CMAKE_INSTALL_PREFIX}/include")
+    SET(VERSION "${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}")
+    ADD_CUSTOM_TARGET(libzstd.pc ALL
+            ${CMAKE_COMMAND} -DIN="${LIBRARY_DIR}/libzstd.pc.in" -DOUT="libzstd.pc"
+            -DPREFIX="${PREFIX}" -DLIBDIR="${LIBDIR}" -DINCLUDEDIR="${INCLUDEDIR}" -DVERSION="${VERSION}"
+            -P "${CMAKE_SOURCE_DIR}/lib/pkgconfig.cmake"
+            COMMENT "Creating pkg-config file")
+
     # install target
     INSTALL(FILES ${LIBRARY_DIR}/zstd.h ${LIBRARY_DIR}/deprecated/zbuff.h ${LIBRARY_DIR}/dictBuilder/zdict.h DESTINATION "include")
+    INSTALL(FILES "${CMAKE_CURRENT_BINARY_DIR}/libzstd.pc" DESTINATION "share/pkgconfig")
     INSTALL(TARGETS libzstd_shared LIBRARY DESTINATION "lib")
     IF (ZSTD_BUILD_STATIC)
         INSTALL(TARGETS libzstd_static ARCHIVE DESTINATION "lib")
diff --git a/build/cmake/lib/pkgconfig.cmake b/build/cmake/lib/pkgconfig.cmake
new file mode 100644
index 000000000..5434ff75c
--- /dev/null
+++ b/build/cmake/lib/pkgconfig.cmake
@@ -0,0 +1 @@
+CONFIGURE_FILE("${IN}" "${OUT}" @ONLY)

From f49f760b41caea2ead424c8e8f2f8affef2a594b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Wed, 19 Apr 2017 19:25:53 +0200
Subject: [PATCH 190/255] Test new cmake branches with Circle CI

---
 Makefile   | 2 +-
 circle.yml | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Makefile b/Makefile
index 7e57e1680..ae2f68867 100644
--- a/Makefile
+++ b/Makefile
@@ -110,7 +110,7 @@ clean:
 #------------------------------------------------------------------------------
 ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU FreeBSD DragonFly NetBSD))
 HOST_OS = POSIX
-CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON
+CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON -DZSTD_ZLIB_SUPPORT:BOOL=ON -DZSTD_LZMA_SUPPORT:BOOL=ON
 .PHONY: install uninstall travis-install clangtest gpptest armtest usan asan uasan
 
 install:
diff --git a/circle.yml b/circle.yml
index 298569d14..218e33bfc 100644
--- a/circle.yml
+++ b/circle.yml
@@ -3,7 +3,7 @@ dependencies:
     - sudo dpkg --add-architecture i386
     - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test; sudo apt-get -y -qq update
     - sudo apt-get -y install gcc-powerpc-linux-gnu gcc-arm-linux-gnueabi libc6-dev-armel-cross gcc-aarch64-linux-gnu libc6-dev-arm64-cross
-    - sudo apt-get -y install libstdc++-6-dev clang gcc g++ gcc-5 gcc-6
+    - sudo apt-get -y install libstdc++-6-dev clang gcc g++ gcc-5 gcc-6 zlib1g-dev liblzma-dev
     - sudo apt-get -y install linux-libc-dev:i386 libc6-dev-i386
 
 test:

From eb7371f1794378cad706734031279f4afbb29102 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Milan=20=C5=A0ev=C4=8D=C3=ADk?= <majlen@civ.zcu.cz>
Date: Wed, 19 Apr 2017 20:16:11 +0200
Subject: [PATCH 191/255] Change all SET_TARGET_PROPERTIES to SET_PROPERTY

SET_PROPERTY function can append to lists, whereas previously used
SET_TARGET_PROPERTIES cannot.
---
 build/cmake/contrib/pzstd/CMakeLists.txt |  4 ++--
 build/cmake/lib/CMakeLists.txt           |  4 ++--
 build/cmake/programs/CMakeLists.txt      | 12 ++++++------
 3 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/build/cmake/contrib/pzstd/CMakeLists.txt b/build/cmake/contrib/pzstd/CMakeLists.txt
index b4fbe1689..71def02cd 100644
--- a/build/cmake/contrib/pzstd/CMakeLists.txt
+++ b/build/cmake/contrib/pzstd/CMakeLists.txt
@@ -21,8 +21,8 @@ SET(PZSTD_DIR ${ZSTD_SOURCE_DIR}/contrib/pzstd)
 INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${PZSTD_DIR})
 
 ADD_EXECUTABLE(pzstd ${PZSTD_DIR}/main.cpp ${PZSTD_DIR}/Options.cpp ${PZSTD_DIR}/Pzstd.cpp ${PZSTD_DIR}/SkippableFrame.cpp)
-SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_DEFINITIONS "NDEBUG")
-SET_TARGET_PROPERTIES(pzstd PROPERTIES COMPILE_OPTIONS "-Wno-shadow")
+SET_PROPERTY(TARGET pzstd APPEND PROPERTY COMPILE_DEFINITIONS "NDEBUG")
+SET_PROPERTY(TARGET pzstd APPEND PROPERTY COMPILE_OPTIONS "-Wno-shadow")
 
 SET(THREADS_PREFER_PTHREAD_FLAG ON)
 FIND_PACKAGE(Threads REQUIRED)
diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 50618f4a8..5e945ff12 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -97,9 +97,9 @@ ENDIF (ZSTD_BUILD_STATIC)
 
 # Add specific compile definitions for MSVC project
 IF (MSVC)
-    SET_TARGET_PROPERTIES(libzstd_shared PROPERTIES COMPILE_DEFINITIONS "ZSTD_DLL_EXPORT=1;ZSTD_HEAPMODE=0;_CONSOLE;_CRT_SECURE_NO_WARNINGS")
+    SET_PROPERTY(TARGET libzstd_shared APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_DLL_EXPORT=1;ZSTD_HEAPMODE=0;_CONSOLE;_CRT_SECURE_NO_WARNINGS")
     IF (ZSTD_BUILD_STATIC)
-        SET_TARGET_PROPERTIES(libzstd_static PROPERTIES COMPILE_DEFINITIONS "ZSTD_HEAPMODE=0;_CRT_SECURE_NO_WARNINGS")
+        SET_PROPERTY(TARGET libzstd_static APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_HEAPMODE=0;_CRT_SECURE_NO_WARNINGS")
     ENDIF (ZSTD_BUILD_STATIC)
 ENDIF (MSVC)
 
diff --git a/build/cmake/programs/CMakeLists.txt b/build/cmake/programs/CMakeLists.txt
index c3e68e01c..cb6aa9218 100644
--- a/build/cmake/programs/CMakeLists.txt
+++ b/build/cmake/programs/CMakeLists.txt
@@ -49,11 +49,11 @@ IF (UNIX)
 
     ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c)
     TARGET_LINK_LIBRARIES(zstd-frugal libzstd_shared)
-    SET_TARGET_PROPERTIES(zstd-frugal PROPERTIES COMPILE_DEFINITIONS "ZSTD_NOBENCH;ZSTD_NODICT")
+    SET_PROPERTY(TARGET zstd-frugal APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_NOBENCH;ZSTD_NODICT")
 ENDIF (UNIX)
 
 IF (ZSTD_MULTITHREAD_SUPPORT)
-    SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
+    SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_MULTITHREAD")
 
     SET(THREADS_PREFER_PTHREAD_FLAG ON)
     FIND_PACKAGE(Threads REQUIRED)
@@ -75,8 +75,8 @@ IF (ZSTD_ZLIB_SUPPORT)
 
     IF (ZLIB_FOUND)
         INCLUDE_DIRECTORIES(${ZLIB_INCLUDE_DIRS})
-	TARGET_LINK_LIBRARIES(zstd ${ZLIB_LIBRARIES})
-        SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_GZCOMPRESS;ZSTD_GZDECOMPRESS")
+        TARGET_LINK_LIBRARIES(zstd ${ZLIB_LIBRARIES})
+        SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_GZCOMPRESS;ZSTD_GZDECOMPRESS")
     ELSE ()
         MESSAGE(SEND_ERROR "zlib library is missing")
     ENDIF ()
@@ -87,8 +87,8 @@ IF (ZSTD_LZMA_SUPPORT)
 
     IF (LIBLZMA_FOUND)
         INCLUDE_DIRECTORIES(${LIBLZMA_INCLUDE_DIRS})
-	TARGET_LINK_LIBRARIES(zstd ${LIBLZMA_LIBRARIES})
-	SET_TARGET_PROPERTIES(zstd PROPERTIES COMPILE_DEFINITIONS "ZSTD_LZMACOMPRESS;ZSTD_LZMADECOMPRESS")
+        TARGET_LINK_LIBRARIES(zstd ${LIBLZMA_LIBRARIES})
+        SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_LZMACOMPRESS;ZSTD_LZMADECOMPRESS")
     ELSE ()
         MESSAGE(SEND_ERROR "lzma library is missing")
     ENDIF ()

From e348dad3053c0ffd801a2fc27a7b939570cbf737 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 11:14:13 -0700
Subject: [PATCH 192/255] minor long line reformatting

---
 lib/compress/zstd_compress.c | 20 ++++++++++++++++----
 1 file changed, 16 insertions(+), 4 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 4ad978a4b..a95f4b930 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -510,8 +510,10 @@ static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
     {   HUF_repeat repeat = zc->flagStaticHufTable;
         int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
         if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
-        cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
-                                : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11, zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
+        cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
+                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
+                                : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
+                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
         if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
         else { zc->flagStaticHufTable = HUF_repeat_check; }       /* now have a table to reuse */
     }
@@ -856,7 +858,14 @@ static unsigned ZSTD_NbCommonBytes (register size_t val)
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
             return (__builtin_ctzll((U64)val) >> 3);
 #       else
-            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2, 0, 3, 1, 3, 1, 4, 2, 7, 0, 2, 3, 6, 1, 5, 3, 5, 1, 3, 4, 4, 2, 5, 6, 7, 7, 0, 1, 2, 3, 3, 4, 6, 2, 6, 5, 5, 3, 4, 5, 6, 7, 1, 2, 4, 6, 4, 4, 5, 7, 2, 6, 5, 7, 6, 7, 7 };
+            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2,
+                                                     0, 3, 1, 3, 1, 4, 2, 7,
+                                                     0, 2, 3, 6, 1, 5, 3, 5,
+                                                     1, 3, 4, 4, 2, 5, 6, 7,
+                                                     7, 0, 1, 2, 3, 3, 4, 6,
+                                                     2, 6, 5, 5, 3, 4, 5, 6,
+                                                     7, 1, 2, 4, 6, 4, 4, 5,
+                                                     7, 2, 6, 5, 7, 6, 7, 7 };
             return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
 #       endif
         } else { /* 32 bits */
@@ -867,7 +876,10 @@ static unsigned ZSTD_NbCommonBytes (register size_t val)
 #       elif defined(__GNUC__) && (__GNUC__ >= 3)
             return (__builtin_ctz((U32)val) >> 3);
 #       else
-            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0, 3, 2, 2, 1, 3, 2, 0, 1, 3, 3, 1, 2, 2, 2, 2, 0, 3, 1, 2, 0, 1, 0, 1, 1 };
+            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0,
+                                                     3, 2, 2, 1, 3, 2, 0, 1,
+                                                     3, 3, 1, 2, 2, 2, 2, 0,
+                                                     3, 1, 2, 0, 1, 0, 1, 1 };
             return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
 #       endif
         }

From c17e020c9aedbd421e19e3607a16d87559d29d97 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 12:50:02 -0700
Subject: [PATCH 193/255] disable assert when compiling paramgrill

paramgrill is a benchmark calibration function.
Speed accuracy is critical, it cannot be altered by assert.
---
 lib/compress/zstd_compress.c | 60 ++++++++++++++++++++++++------------
 tests/Makefile               |  4 ++-
 2 files changed, 44 insertions(+), 20 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 891094e46..5f18121b3 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -1315,7 +1315,8 @@ void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
         const BYTE* match = base + matchIndexS;
         hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
 
-        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) { /* note : by construction, offset_1 <= current */
+        assert(offset_1 <= current);   /* supposed guaranteed by construction */
+        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
             mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
             ip++;
             ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
@@ -1893,7 +1894,11 @@ size_t ZSTD_HcFindBestMatch_generic (
         }
 
         /* save best solution */
-        if (currentMl > ml) { ml = currentMl; *offsetPtr = current - matchIndex + ZSTD_REP_MOVE; if (ip+currentMl == iLimit) break; /* best possible, and avoid read overflow*/ }
+        if (currentMl > ml) {
+            ml = currentMl;
+            *offsetPtr = current - matchIndex + ZSTD_REP_MOVE;
+            if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
+        }
 
         if (matchIndex <= minChain) break;
         matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
@@ -2038,7 +2043,9 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
 
         /* catch up */
         if (offset) {
-            while ((start>anchor) && (start>base+offset-ZSTD_REP_MOVE) && (start[-1] == start[-1-offset+ZSTD_REP_MOVE]))   /* only search for offset within prefix */
+            while ( (start > anchor)
+                 && (start > base+offset-ZSTD_REP_MOVE)
+                 && (start[-1] == start[-1-offset+ZSTD_REP_MOVE]) )  /* only search for offset within prefix */
                 { start--; matchLength++; }
             offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
         }
@@ -2204,9 +2211,9 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                     if (MEM_read32(ip) == MEM_read32(repMatch)) {
                         /* repcode detected */
                         const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                        size_t repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-                        int gain2 = (int)(repLength * 4);
-                        int gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                        size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                        int const gain2 = (int)(repLength * 4);
+                        int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
                         if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
                             matchLength = repLength, offset = 0, start = ip;
                 }   }
@@ -2339,8 +2346,12 @@ typedef void (*ZSTD_blockCompressor) (ZSTD_CCtx* ctx, const void* src, size_t sr
 static ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
 {
     static const ZSTD_blockCompressor blockCompressor[2][8] = {
-        { ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2 },
-        { ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict }
+        { ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy,
+          ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2,
+          ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2 },
+        { ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict,
+          ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict,
+          ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict }
     };
 
     return blockCompressor[extDict][(U32)strat];
@@ -2356,7 +2367,7 @@ static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc, void* dst, size_t dstCa
     if (srcSize < MIN_CBLOCK_SIZE+ZSTD_blockHeaderSize+1) return 0;   /* don't even attempt compression below a certain srcSize */
     ZSTD_resetSeqStore(&(zc->seqStore));
     if (current > zc->nextToUpdate + 384)
-        zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));   /* update tree not updated after finding very long rep matches */
+        zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));   /* limited update after finding a very long match */
     blockCompressor(zc, src, srcSize);
     return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
 }
@@ -2388,7 +2399,8 @@ static size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
         U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
         size_t cSize;
 
-        if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE) return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
+        if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE)
+            return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
         if (remaining < blockSize) blockSize = remaining;
 
         /* preemptive overflow correction */
@@ -2647,7 +2659,8 @@ static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t
         if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
         if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
         /* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
-        CHECK_E (FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        CHECK_E( FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, scratchBuffer, sizeof(scratchBuffer)),
+                 dictionary_corrupted);
         dictPtr += offcodeHeaderSize;
     }
 
@@ -2657,8 +2670,9 @@ static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t
         if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
         if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
         /* Every match length code must have non-zero probability */
-        CHECK_F (ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
-        CHECK_E (FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        CHECK_F( ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
+        CHECK_E( FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, scratchBuffer, sizeof(scratchBuffer)),
+                 dictionary_corrupted);
         dictPtr += matchlengthHeaderSize;
     }
 
@@ -2668,8 +2682,9 @@ static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t
         if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
         if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
         /* Every literal length code must have non-zero probability */
-        CHECK_F (ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
-        CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, scratchBuffer, sizeof(scratchBuffer)), dictionary_corrupted);
+        CHECK_F( ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
+        CHECK_E( FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, scratchBuffer, sizeof(scratchBuffer)),
+                 dictionary_corrupted);
         dictPtr += litlengthHeaderSize;
     }
 
@@ -2829,7 +2844,8 @@ size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
     return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
 }
 
-size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, const void* dict, size_t dictSize, int compressionLevel)
+size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize,
+                               const void* dict, size_t dictSize, int compressionLevel)
 {
     ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, dict ? dictSize : 0);
     params.fParams.contentSizeFlag = 1;
@@ -3053,7 +3069,11 @@ size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
 /*======   Initialization   ======*/
 
 size_t ZSTD_CStreamInSize(void)  { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
-size_t ZSTD_CStreamOutSize(void) { return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSOLUTEMAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */ ; }
+
+size_t ZSTD_CStreamOutSize(void)
+{
+    return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSOLUTEMAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */ ;
+}
 
 static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 {
@@ -3308,7 +3328,8 @@ size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
         /* flush whatever remains */
         size_t srcSize = 0;
         size_t sizeWritten = output->size - output->pos;
-        size_t const notEnded = ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end);  /* use a valid src address instead of NULL */
+        size_t const notEnded = ZSTD_compressStream_generic(zcs, ostart, &sizeWritten,
+                                     &srcSize /* use a valid src address instead of NULL */, &srcSize, zsf_end);
         size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
         op += sizeWritten;
         if (remainingToFlush) {
@@ -3318,7 +3339,8 @@ size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
         /* create epilogue */
         zcs->stage = zcss_final;
         zcs->outBuffContentSize = !notEnded ? 0 :
-            ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);  /* write epilogue, including final empty block, into outBuff */
+            /* write epilogue, including final empty block, into outBuff */
+            ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL, 0);
         if (ZSTD_isError(zcs->outBuffContentSize)) return zcs->outBuffContentSize;
     }
 
diff --git a/tests/Makefile b/tests/Makefile
index 70ef51878..f5260e50e 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -26,9 +26,10 @@ PYTHON ?= python3
 TESTARTEFACT := versionsTest namespaceTest
 
 
+DEBUGFLAG= -DZSTD_DEBUG=1
 CPPFLAGS+= -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress \
            -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR) \
-           -DZSTD_DEBUG=1
+           $(DEBUGFLAG)
 CFLAGS  ?= -O3
 CFLAGS  += -g -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
@@ -156,6 +157,7 @@ zstreamtest-dll : $(ZSTDDIR)/common/xxhash.c $(PRGDIR)/datagen.c zstreamtest.c
 	$(MAKE) -C $(ZSTDDIR) libzstd
 	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@$(EXT)
 
+paramgrill : DEBUGFLAG =
 paramgrill : $(ZSTD_FILES) $(PRGDIR)/datagen.c paramgrill.c
 	$(CC)      $(FLAGS) $^ -lm -o $@$(EXT)
 

From 1a96bec8dba9d8b8147259a703dd3b7f26584080 Mon Sep 17 00:00:00 2001
From: Michael Maltese <michaeljosephmaltese@gmail.com>
Date: Thu, 20 Apr 2017 15:35:56 -0700
Subject: [PATCH 194/255] CMake: Set ZSTD_SOURCE_DIR from
 CMAKE_CURRENT_SOURCE_DIR

Instead of CMAKE_SOURCE_DIR, which is not correct when embedding Zstd
within a larger project.
---
 build/cmake/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index bf6890818..0aa7b3072 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -9,7 +9,7 @@
 
 PROJECT(zstd)
 CMAKE_MINIMUM_REQUIRED(VERSION 2.8.9)
-SET(ZSTD_SOURCE_DIR "${CMAKE_SOURCE_DIR}/../..")
+SET(ZSTD_SOURCE_DIR "${CMAKE_CURRENT_SOURCE_DIR}/../..")
 
 #-----------------------------------------------------------------------------
 # Add extra compilation flags

From e6fa70a0a1d8a229b0bf29218155cb3db53a03e7 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 17:28:31 -0700
Subject: [PATCH 195/255] reorganized ZSTD_resetCCtx_internal()

clearer separation between variables and buffers
clearer buffers category
kept static buffers at the beginning, favoring cache locality
(it will be easier to add FSE tables there later)

This break a few assumptions that hashTable was always at the beginning.
This is fixed.
And remaining assumptions (namely that tables stand next to each other in memory)
are now tested with assert.
---
 lib/common/fse.h             |  4 +-
 lib/compress/zstd_compress.c | 98 ++++++++++++++++++++++--------------
 2 files changed, 62 insertions(+), 40 deletions(-)

diff --git a/lib/common/fse.h b/lib/common/fse.h
index 5e43215e3..4ecd8d741 100644
--- a/lib/common/fse.h
+++ b/lib/common/fse.h
@@ -550,9 +550,9 @@ MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U3
 
 MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, U32 symbol)
 {
-    const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+    FSE_symbolCompressionTransform const symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
     const U16* const stateTable = (const U16*)(statePtr->stateTable);
-    U32 nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
+    U32 const nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
     BIT_addBits(bitC, statePtr->value, nbBitsOut);
     statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
 }
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 5f18121b3..e049aa076 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -282,9 +282,11 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         void* ptr;
 
         /* Check if workSpace is large enough, alloc a new one if needed */
-        {   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
-                                  + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-            size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+        {   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits)) * sizeof(U32)
+                                  + (ZSTD_OPT_NUM+1) * (sizeof(ZSTD_match_t)+sizeof(ZSTD_optimal_t));
+            size_t const neededSpace = tableSpace
+                                  + HUF_CTABLE_SIZE(255)
+                                  + tokenSpace
                                   + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
             if (zc->workSpaceSize < neededSpace) {
                 zc->workSpaceSize = 0;
@@ -294,31 +296,37 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 zc->workSpaceSize = neededSpace;
         }   }
 
-        if (crp!=ZSTDcrp_noMemset) memset(zc->workSpace, 0, tableSpace);   /* reset tables only */
+        /* init params */
+        zc->params = params;
+        zc->blockSize = blockSize;
+        zc->frameContentSize = frameContentSize;
+        zc->consumedSrcSize = 0;
+
         XXH64_reset(&zc->xxhState, 0);
-        zc->hashLog3 = hashLog3;
-        zc->hashTable = (U32*)(zc->workSpace);
-        zc->chainTable = zc->hashTable + hSize;
-        zc->hashTable3 = zc->chainTable + chainSize;
-        ptr = zc->hashTable3 + h3Size;
-        zc->hufTable = (HUF_CElt*)ptr;
+        zc->stage = ZSTDcs_init;
+        zc->dictID = 0;
+        zc->loadedDictEnd = 0;
         zc->flagStaticTables = 0;
         zc->flagStaticHufTable = HUF_repeat_none;
-        ptr = ((U32*)ptr) + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
-
         zc->nextToUpdate = 1;
         zc->nextSrc = NULL;
         zc->base = NULL;
         zc->dictBase = NULL;
         zc->dictLimit = 0;
         zc->lowLimit = 0;
-        zc->params = params;
-        zc->blockSize = blockSize;
-        zc->frameContentSize = frameContentSize;
-        zc->consumedSrcSize = 0;
         { int i; for (i=0; i<ZSTD_REP_NUM; i++) zc->rep[i] = repStartValue[i]; }
+        zc->hashLog3 = hashLog3;
+        zc->seqStore.litLengthSum = 0;
 
+        ptr = zc->workSpace;
+
+        /* entropy space */
+        zc->hufTable = (HUF_CElt*)ptr;
+        ptr = (U32*)zc->hufTable + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
+
+        /* opt parser space */
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
+            assert(((size_t)ptr & 3) == 0);  /* ensure ptr is properly aligned */
             zc->seqStore.litFreq = (U32*)ptr;
             zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1<<Litbits);
             zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL+1);
@@ -328,8 +336,17 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
             ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM+1;
             zc->seqStore.priceTable = (ZSTD_optimal_t*)ptr;
             ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM+1;
-            zc->seqStore.litLengthSum = 0;
         }
+
+        /* table Space */
+        if (crp!=ZSTDcrp_noMemset) memset(ptr, 0, tableSpace);   /* reset tables only */
+        assert(((size_t)ptr & 3) == 0);  /* ensure ptr is properly aligned */
+        zc->hashTable = (U32*)(ptr);
+        zc->chainTable = zc->hashTable + hSize;
+        zc->hashTable3 = zc->chainTable + chainSize;
+        ptr = zc->hashTable3 + h3Size;
+
+        /* sequences storage */
         zc->seqStore.sequencesStart = (seqDef*)ptr;
         ptr = zc->seqStore.sequencesStart + maxNbSeq;
         zc->seqStore.llCode = (BYTE*) ptr;
@@ -337,10 +354,6 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
         zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
 
-        zc->stage = ZSTDcs_init;
-        zc->dictID = 0;
-        zc->loadedDictEnd = 0;
-
         return 0;
     }
 }
@@ -373,10 +386,12 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
 
     /* copy tables */
     {   size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
-        size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
+        size_t const hSize =  (size_t)1 << srcCCtx->params.cParams.hashLog;
         size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
         size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-        memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
+        assert((U32*)dstCCtx->chainTable == (U32*)dstCCtx->hashTable + hSize);  /* chainTable must follow hashTable */
+        assert((U32*)dstCCtx->hashTable3 == (U32*)dstCCtx->chainTable + chainSize);
+        memcpy(dstCCtx->hashTable, srcCCtx->hashTable, tableSpace);   /* presumes all tables follow each other */
     }
 
     /* copy dictionary offsets */
@@ -393,7 +408,7 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
     /* copy entropy tables */
     dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
     if (srcCCtx->flagStaticTables) {
-        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
+        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));  /* depends on litlengthCTable being a table and not a pointer */
         memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
         memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
     }
@@ -855,14 +870,20 @@ MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const v
     seqStorePtr->lit += litLength;
 
     /* literal Length */
-    if (litLength>0xFFFF) { seqStorePtr->longLengthID = 1; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+    if (litLength>0xFFFF) {
+        seqStorePtr->longLengthID = 1;
+        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    }
     seqStorePtr->sequences[0].litLength = (U16)litLength;
 
     /* match offset */
     seqStorePtr->sequences[0].offset = offsetCode + 1;
 
     /* match Length */
-    if (matchCode>0xFFFF) { seqStorePtr->longLengthID = 2; seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart); }
+    if (matchCode>0xFFFF) {
+        seqStorePtr->longLengthID = 2;
+        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    }
     seqStorePtr->sequences[0].matchLength = (U16)matchCode;
 
     seqStorePtr->sequences++;
@@ -976,7 +997,7 @@ static size_t ZSTD_count_2segments(const BYTE* ip, const BYTE* match, const BYTE
 ***************************************/
 static const U32 prime3bytes = 506832829U;
 static U32    ZSTD_hash3(U32 u, U32 h) { return ((u << (32-24)) * prime3bytes)  >> (32-h) ; }
-MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); }   /* only in zstd_opt.h */
+MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); } /* only in zstd_opt.h */
 
 static const U32 prime4bytes = 2654435761U;
 static U32    ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32-h) ; }
@@ -1176,7 +1197,7 @@ static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
         if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
            && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
             const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-            mLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
+            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
             ip++;
             ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
         } else {
@@ -1188,7 +1209,7 @@ static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
             {   const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
                 const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
                 U32 offset;
-                mLength = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
+                mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
                 while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
                 offset = current - matchIndex;
                 offset_2 = offset_1;
@@ -1212,7 +1233,7 @@ static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
                 if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
                    && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
                     const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, lowPrefixPtr) + 4;
                     U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
                     ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
                     hashTable[ZSTD_hashPtr(ip, hBits, mls)] = current2;
@@ -1317,6 +1338,7 @@ void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
 
         assert(offset_1 <= current);   /* supposed guaranteed by construction */
         if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
+            /* favor repcode */
             mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
             ip++;
             ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
@@ -1327,15 +1349,15 @@ void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
                 offset = (U32)(ip-matchLong);
                 while (((ip>anchor) & (matchLong>lowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
             } else if ( (matchIndexS > lowestIndex) && (MEM_read32(match) == MEM_read32(ip)) ) {
-                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
-                U32 const matchIndex3 = hashLong[h3];
-                const BYTE* match3 = base + matchIndex3;
-                hashLong[h3] = current + 1;
-                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
-                    mLength = ZSTD_count(ip+9, match3+8, iend) + 8;
+                size_t const hl3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+                U32 const matchIndexL3 = hashLong[hl3];
+                const BYTE* matchL3 = base + matchIndexL3;
+                hashLong[hl3] = current + 1;
+                if ( (matchIndexL3 > lowestIndex) && (MEM_read64(matchL3) == MEM_read64(ip+1)) ) {
+                    mLength = ZSTD_count(ip+9, matchL3+8, iend) + 8;
                     ip++;
-                    offset = (U32)(ip-match3);
-                    while (((ip>anchor) & (match3>lowest)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+                    offset = (U32)(ip-matchL3);
+                    while (((ip>anchor) & (matchL3>lowest)) && (ip[-1] == matchL3[-1])) { ip--; matchL3--; mLength++; } /* catch up */
                 } else {
                     mLength = ZSTD_count(ip+4, match+4, iend) + 4;
                     offset = (U32)(ip-match);

From 7bb60b17d860e7a298dfb9984c15fa315a20a58c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 17:38:56 -0700
Subject: [PATCH 196/255] init entropy table pointers only once

per workSpace resize
---
 lib/compress/zstd_compress.c | 10 ++++++----
 1 file changed, 6 insertions(+), 4 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index e049aa076..ac0519fba 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -294,6 +294,12 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
                 if (zc->workSpace == NULL) return ERROR(memory_allocation);
                 zc->workSpaceSize = neededSpace;
+                ptr = zc->workSpace;
+
+                /* entropy space */
+                zc->hufTable = (HUF_CElt*)ptr;
+                ptr = (U32*)zc->hufTable + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
+
         }   }
 
         /* init params */
@@ -318,10 +324,6 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         zc->hashLog3 = hashLog3;
         zc->seqStore.litLengthSum = 0;
 
-        ptr = zc->workSpace;
-
-        /* entropy space */
-        zc->hufTable = (HUF_CElt*)ptr;
         ptr = (U32*)zc->hufTable + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
 
         /* opt parser space */

From a34a39c1838552027342e859a5a3917db07ef700 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 18:17:58 -0700
Subject: [PATCH 197/255] changed size evaluation of entropy tables

so that memcpy() does no longer depends on fse pointer being a static table
---
 lib/compress/zstd_compress.c | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index ac0519fba..6855297fd 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -27,6 +27,11 @@ static const U32 g_searchStrength = 8;   /* control skip over incompressible dat
 #define HASH_READ_SIZE 8
 typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
 
+static size_t const offcodeCTable_size = FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff) * sizeof(FSE_CTable);
+static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE_U32(MLFSELog, MaxML) * sizeof(FSE_CTable);
+static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
+
+
 
 /*-*************************************
 *  Helper functions
@@ -410,9 +415,9 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
     /* copy entropy tables */
     dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
     if (srcCCtx->flagStaticTables) {
-        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));  /* depends on litlengthCTable being a table and not a pointer */
-        memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
-        memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
+        memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, litlengthCTable_size);
+        memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, matchlengthCTable_size);
+        memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, offcodeCTable_size);
     }
     dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
     if (srcCCtx->flagStaticHufTable) {

From 7f1fb955662d0df4425db0322b1fd3037edf42f1 Mon Sep 17 00:00:00 2001
From: Michael Maltese <michaeljosephmaltese@gmail.com>
Date: Thu, 20 Apr 2017 15:46:44 -0700
Subject: [PATCH 198/255] CMake: namespace modules and set CMAKE_MODULE_PATH

---
 build/cmake/CMakeLists.txt                                   | 5 +++--
 ...aCompilationFlags.cmake => AddZstdCompilationFlags.cmake} | 4 ++--
 .../{GetLibraryVersion.cmake => GetZstdLibraryVersion.cmake} | 2 +-
 build/cmake/contrib/gen_html/CMakeLists.txt                  | 4 ++--
 build/cmake/lib/CMakeLists.txt                               | 4 ++--
 5 files changed, 10 insertions(+), 9 deletions(-)
 rename build/cmake/CMakeModules/{AddExtraCompilationFlags.cmake => AddZstdCompilationFlags.cmake} (98%)
 rename build/cmake/CMakeModules/{GetLibraryVersion.cmake => GetZstdLibraryVersion.cmake} (86%)

diff --git a/build/cmake/CMakeLists.txt b/build/cmake/CMakeLists.txt
index 0aa7b3072..5c4eca61c 100644
--- a/build/cmake/CMakeLists.txt
+++ b/build/cmake/CMakeLists.txt
@@ -10,12 +10,13 @@
 PROJECT(zstd)
 CMAKE_MINIMUM_REQUIRED(VERSION 2.8.9)
 SET(ZSTD_SOURCE_DIR "${CMAKE_CURRENT_SOURCE_DIR}/../..")
+LIST(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/CMakeModules")
 
 #-----------------------------------------------------------------------------
 # Add extra compilation flags
 #-----------------------------------------------------------------------------
-INCLUDE(CMakeModules/AddExtraCompilationFlags.cmake)
-ADD_EXTRA_COMPILATION_FLAGS()
+INCLUDE(AddZstdCompilationFlags)
+ADD_ZSTD_COMPILATION_FLAGS()
 
 #-----------------------------------------------------------------------------
 # Options
diff --git a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
similarity index 98%
rename from build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
rename to build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
index e099a01da..177db541c 100644
--- a/build/cmake/CMakeModules/AddExtraCompilationFlags.cmake
+++ b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
@@ -19,7 +19,7 @@ function(EnableCompilerFlag _flag _C _CXX)
     endif ()
 endfunction()
 
-MACRO(ADD_EXTRA_COMPILATION_FLAGS)
+MACRO(ADD_ZSTD_COMPILATION_FLAGS)
     if (CMAKE_CXX_COMPILER_ID MATCHES "GNU|Clang" OR MINGW) #Not only UNIX but also WIN32 for MinGW
         #Set c++11 by default
         EnableCompilerFlag("-std=c++11" false true)
@@ -95,4 +95,4 @@ MACRO(ADD_EXTRA_COMPILATION_FLAGS)
     set(CMAKE_C_FLAGS_MINSIZEREL "${CMAKE_C_FLAGS_MINSIZEREL}" CACHE STRING "Updated flags" FORCE)
     set(CMAKE_C_FLAGS_RELWITHDEBINFO "${CMAKE_C_FLAGS_RELWITHDEBINFO}" CACHE STRING "Updated flags" FORCE)
 
-ENDMACRO(ADD_EXTRA_COMPILATION_FLAGS)
+ENDMACRO(ADD_ZSTD_COMPILATION_FLAGS)
diff --git a/build/cmake/CMakeModules/GetLibraryVersion.cmake b/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake
similarity index 86%
rename from build/cmake/CMakeModules/GetLibraryVersion.cmake
rename to build/cmake/CMakeModules/GetZstdLibraryVersion.cmake
index 95d84a89f..8b6f394da 100644
--- a/build/cmake/CMakeModules/GetLibraryVersion.cmake
+++ b/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake
@@ -1,4 +1,4 @@
-function(GetLibraryVersion _header _major _minor _release)
+function(GetZstdLibraryVersion _header _major _minor _release)
     # Read file content
     FILE(READ ${_header} CONTENT)
 
diff --git a/build/cmake/contrib/gen_html/CMakeLists.txt b/build/cmake/contrib/gen_html/CMakeLists.txt
index dff8c7a11..c10c62b54 100644
--- a/build/cmake/contrib/gen_html/CMakeLists.txt
+++ b/build/cmake/contrib/gen_html/CMakeLists.txt
@@ -11,7 +11,7 @@
 # ################################################################
 
 PROJECT(gen_html)
-INCLUDE(${CMAKE_SOURCE_DIR}/CMakeModules/GetLibraryVersion.cmake)
+INCLUDE(GetZstdLibraryVersion)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
@@ -24,7 +24,7 @@ INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${GENHT
 
 ADD_EXECUTABLE(gen_html ${GENHTML_DIR}/gen_html.cpp)
 
-GetLibraryVersion(${LIBRARY_DIR}/zstd.h VMAJOR VMINOR VRELEASE)
+GetZstdLibraryVersion(${LIBRARY_DIR}/zstd.h VMAJOR VMINOR VRELEASE)
 SET(LIBVERSION "${VMAJOR}.${VMINOR}.${VRELEASE}")
 ADD_CUSTOM_TARGET(zstd_manual.html ALL
                   ${GENHTML_BINARY} "${LIBVERSION}" "${LIBRARY_DIR}/zstd.h" "${PROJECT_BINARY_DIR}/zstd_manual.html"
diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 5e945ff12..937ddbc50 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -11,7 +11,6 @@
 # ################################################################
 
 PROJECT(libzstd)
-INCLUDE(${CMAKE_SOURCE_DIR}/CMakeModules/GetLibraryVersion.cmake)
 
 SET(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 OPTION(ZSTD_BUILD_STATIC "BUILD STATIC LIBRARIES" OFF)
@@ -21,7 +20,8 @@ SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib)
 INCLUDE_DIRECTORIES(${LIBRARY_DIR} ${LIBRARY_DIR}/common)
 
 # Parse version
-GetLibraryVersion(${LIBRARY_DIR}/zstd.h LIBVER_MAJOR LIBVER_MINOR LIBVER_RELEASE)
+INCLUDE(GetZstdLibraryVersion)
+GetZstdLibraryVersion(${LIBRARY_DIR}/zstd.h LIBVER_MAJOR LIBVER_MINOR LIBVER_RELEASE)
 MESSAGE("ZSTD VERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}")
 
 SET(Sources

From 554a13dd4b7b61920c9bd8bdc6df81f040f80871 Mon Sep 17 00:00:00 2001
From: Michael Maltese <michaeljosephmaltese@gmail.com>
Date: Thu, 20 Apr 2017 15:47:31 -0700
Subject: [PATCH 199/255] CMake: various configure_file fixes to use
 CMAKE_CURRENT_SOURCE_DIR

---
 build/cmake/lib/CMakeLists.txt                 | 8 ++++----
 build/cmake/{ => lib}/cmake_uninstall.cmake.in | 0
 2 files changed, 4 insertions(+), 4 deletions(-)
 rename build/cmake/{ => lib}/cmake_uninstall.cmake.in (100%)

diff --git a/build/cmake/lib/CMakeLists.txt b/build/cmake/lib/CMakeLists.txt
index 937ddbc50..429d49449 100644
--- a/build/cmake/lib/CMakeLists.txt
+++ b/build/cmake/lib/CMakeLists.txt
@@ -138,7 +138,7 @@ IF (UNIX)
     ADD_CUSTOM_TARGET(libzstd.pc ALL
             ${CMAKE_COMMAND} -DIN="${LIBRARY_DIR}/libzstd.pc.in" -DOUT="libzstd.pc"
             -DPREFIX="${PREFIX}" -DLIBDIR="${LIBDIR}" -DINCLUDEDIR="${INCLUDEDIR}" -DVERSION="${VERSION}"
-            -P "${CMAKE_SOURCE_DIR}/lib/pkgconfig.cmake"
+            -P "${CMAKE_CURRENT_SOURCE_DIR}/pkgconfig.cmake"
             COMMENT "Creating pkg-config file")
 
     # install target
@@ -151,10 +151,10 @@ IF (UNIX)
 
     # uninstall target
     CONFIGURE_FILE(
-            "${CMAKE_SOURCE_DIR}/cmake_uninstall.cmake.in"
-            "${CMAKE_BINARY_DIR}/cmake_uninstall.cmake"
+            "${CMAKE_CURRENT_SOURCE_DIR}/cmake_uninstall.cmake.in"
+            "${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake"
             IMMEDIATE @ONLY)
 
     ADD_CUSTOM_TARGET(uninstall
-            COMMAND ${CMAKE_COMMAND} -P ${CMAKE_BINARY_DIR}/cmake_uninstall.cmake)
+            COMMAND ${CMAKE_COMMAND} -P ${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake)
 ENDIF (UNIX)
diff --git a/build/cmake/cmake_uninstall.cmake.in b/build/cmake/lib/cmake_uninstall.cmake.in
similarity index 100%
rename from build/cmake/cmake_uninstall.cmake.in
rename to build/cmake/lib/cmake_uninstall.cmake.in

From 377401f161e413962630e4f98a9e4eb55335cd7c Mon Sep 17 00:00:00 2001
From: Michael Maltese <michaeljosephmaltese@gmail.com>
Date: Thu, 20 Apr 2017 15:54:17 -0700
Subject: [PATCH 200/255] CMake: don't recheck compile flags every time

Doesn't cause a problem when embedded within a larger project, but is
annoying.
---
 .../CMakeModules/AddZstdCompilationFlags.cmake    | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)

diff --git a/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
index 177db541c..05ad86439 100644
--- a/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
+++ b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
@@ -2,20 +2,21 @@ include(CheckCXXCompilerFlag)
 include(CheckCCompilerFlag)
 
 function(EnableCompilerFlag _flag _C _CXX)
-    message("Checking flag ${_flag}")
+    string(REGEX REPLACE "\\+" "PLUS" varname "${_flag}")
+    string(REGEX REPLACE "[^A-Za-z0-9]+" "_" varname "${varname}")
+    string(REGEX REPLACE "^_+" "" varname "${varname}")
+    string(TOUPPER "${varname}" varname)
     if (_C)
-        CHECK_C_COMPILER_FLAG(${_flag} C_FLAG)
-        if (C_FLAG)
+        CHECK_C_COMPILER_FLAG(${_flag} C_FLAG_${varname})
+        if (C_FLAG_${varname})
             set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_flag}" CACHE INTERNAL "C Flags")
         endif ()
-        unset(C_FLAG CACHE)
     endif ()
     if (_CXX)
-        CHECK_CXX_COMPILER_FLAG(${_flag} CXX_FLAG)
-        if (CXX_FLAG)
+        CHECK_CXX_COMPILER_FLAG(${_flag} CXX_FLAG_${varname})
+        if (CXX_FLAG_${varname})
             set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${_flag}" CACHE INTERNAL "CXX Flags")
         endif ()
-        unset(CXX_FLAG CACHE)
     endif ()
 endfunction()
 

From 9eda436733bf41eca2c31e77b3b601aeca215786 Mon Sep 17 00:00:00 2001
From: Michael Maltese <michaeljosephmaltese@gmail.com>
Date: Thu, 20 Apr 2017 15:55:48 -0700
Subject: [PATCH 201/255] CMake: don't modify global C_FLAGS and CXX_FLAGS

---
 .../AddZstdCompilationFlags.cmake             | 21 ++++---------------
 1 file changed, 4 insertions(+), 17 deletions(-)

diff --git a/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
index 05ad86439..e812418e3 100644
--- a/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
+++ b/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake
@@ -9,13 +9,13 @@ function(EnableCompilerFlag _flag _C _CXX)
     if (_C)
         CHECK_C_COMPILER_FLAG(${_flag} C_FLAG_${varname})
         if (C_FLAG_${varname})
-            set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_flag}" CACHE INTERNAL "C Flags")
+            set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_flag}" PARENT_SCOPE)
         endif ()
     endif ()
     if (_CXX)
         CHECK_CXX_COMPILER_FLAG(${_flag} CXX_FLAG_${varname})
         if (CXX_FLAG_${varname})
-            set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${_flag}" CACHE INTERNAL "CXX Flags")
+            set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${_flag}" PARENT_SCOPE)
         endif ()
     endif ()
 endfunction()
@@ -69,8 +69,7 @@ MACRO(ADD_ZSTD_COMPILATION_FLAGS)
         separate_arguments(${flag_var})
         list(REMOVE_DUPLICATES ${flag_var})
         string(REPLACE ";" " " ${flag_var} "${${flag_var}}")
-        set(${flag_var} "${${flag_var}}" CACHE STRING "common build flags" FORCE)
-    ENDFOREACH (flag_var)  
+    ENDFOREACH (flag_var)
 
     if (MSVC)
         # Replace /MT to /MD flag
@@ -81,19 +80,7 @@ MACRO(ADD_ZSTD_COMPILATION_FLAGS)
                  CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
             STRING(REGEX REPLACE "/MT" "/MD" ${flag_var} "${${flag_var}}")
             STRING(REGEX REPLACE "/O2" "/Ox" ${flag_var} "${${flag_var}}")
-        ENDFOREACH (flag_var)      
+        ENDFOREACH (flag_var)
     endif ()
 
-    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_CXX_FLAGS_MINSIZEREL "${CMAKE_CXX_FLAGS_MINSIZEREL}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_CXX_FLAGS_RELWITHDEBINFO "${CMAKE_CXX_FLAGS_RELWITHDEBINFO}" CACHE STRING "Updated flags" FORCE)
-
-    set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS_DEBUG}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS_RELEASE}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_C_FLAGS_MINSIZEREL "${CMAKE_C_FLAGS_MINSIZEREL}" CACHE STRING "Updated flags" FORCE)
-    set(CMAKE_C_FLAGS_RELWITHDEBINFO "${CMAKE_C_FLAGS_RELWITHDEBINFO}" CACHE STRING "Updated flags" FORCE)
-
 ENDMACRO(ADD_ZSTD_COMPILATION_FLAGS)

From 71ddeb67b1998cc48424dcc524d7e1f9bf568fd6 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 22:54:54 -0700
Subject: [PATCH 202/255] made room in workspace for FSE tables

still need to be transferred from CCtx into workspace
---
 lib/compress/zstd_compress.c | 79 +++++++++++++++++----------------
 lib/zstd.h                   | 86 ++++++++++++++++++------------------
 2 files changed, 84 insertions(+), 81 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 6855297fd..4530cff9a 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -27,10 +27,11 @@ static const U32 g_searchStrength = 8;   /* control skip over incompressible dat
 #define HASH_READ_SIZE 8
 typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
 
+/* entropy tables always have same size */
+static size_t const hufCTable_size = HUF_CTABLE_SIZE(255);
+static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
 static size_t const offcodeCTable_size = FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff) * sizeof(FSE_CTable);
 static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE_U32(MLFSELog, MaxML) * sizeof(FSE_CTable);
-static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
-
 
 
 /*-*************************************
@@ -94,9 +95,9 @@ struct ZSTD_CCtx_s {
     U32* hashTable;
     U32* hashTable3;
     U32* chainTable;
-    HUF_CElt* hufTable;
-    U32 flagStaticTables;
-    HUF_repeat flagStaticHufTable;
+    HUF_repeat hufCTable_repeatMode;
+    HUF_CElt* hufCTable;
+    U32 fseCTables_ready;
     FSE_CTable offcodeCTable  [FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
     FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
     FSE_CTable litlengthCTable  [FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
@@ -221,11 +222,13 @@ size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
     size_t const hSize = ((size_t)1) << cParams.hashLog;
     U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
     size_t const h3Size = ((size_t)1) << hashLog3;
+    size_t const entropySpace = hufCTable_size + litlengthCTable_size
+                              + offcodeCTable_size + matchlengthCTable_size;
     size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
 
     size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
                           + (ZSTD_OPT_NUM+1)*(sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-    size_t const neededSpace = tableSpace + (256*sizeof(U32)) /* huffTable */ + tokenSpace
+    size_t const neededSpace = entropySpace + tableSpace + tokenSpace
                              + (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
 
     return sizeof(ZSTD_CCtx) + neededSpace;
@@ -270,8 +273,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
 {
     if (crp == ZSTDcrp_continue)
         if (ZSTD_equivalentParams(params, zc->params)) {
-            zc->flagStaticTables = 0;
-            zc->flagStaticHufTable = HUF_repeat_none;
+            zc->fseCTables_ready = 0;
+            zc->hufCTable_repeatMode = HUF_repeat_none;
             return ZSTD_continueCCtx(zc, params, frameContentSize);
         }
 
@@ -287,12 +290,12 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         void* ptr;
 
         /* Check if workSpace is large enough, alloc a new one if needed */
-        {   size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits)) * sizeof(U32)
+        {   size_t const entropySpace = hufCTable_size + litlengthCTable_size
+                                  + offcodeCTable_size + matchlengthCTable_size;
+            size_t const optPotentialSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits)) * sizeof(U32)
                                   + (ZSTD_OPT_NUM+1) * (sizeof(ZSTD_match_t)+sizeof(ZSTD_optimal_t));
-            size_t const neededSpace = tableSpace
-                                  + HUF_CTABLE_SIZE(255)
-                                  + tokenSpace
-                                  + (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
+            size_t const optSpace = ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optPotentialSpace : 0;
+            size_t const neededSpace = entropySpace + optSpace + tableSpace + tokenSpace;
             if (zc->workSpaceSize < neededSpace) {
                 zc->workSpaceSize = 0;
                 ZSTD_free(zc->workSpace, zc->customMem);
@@ -302,8 +305,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 ptr = zc->workSpace;
 
                 /* entropy space */
-                zc->hufTable = (HUF_CElt*)ptr;
-                ptr = (U32*)zc->hufTable + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
+                zc->hufCTable = (HUF_CElt*)ptr;
+                ptr = (char*)zc->hufCTable + hufCTable_size;  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
 
         }   }
 
@@ -317,8 +320,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         zc->stage = ZSTDcs_init;
         zc->dictID = 0;
         zc->loadedDictEnd = 0;
-        zc->flagStaticTables = 0;
-        zc->flagStaticHufTable = HUF_repeat_none;
+        zc->fseCTables_ready = 0;
+        zc->hufCTable_repeatMode = HUF_repeat_none;
         zc->nextToUpdate = 1;
         zc->nextSrc = NULL;
         zc->base = NULL;
@@ -329,7 +332,7 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         zc->hashLog3 = hashLog3;
         zc->seqStore.litLengthSum = 0;
 
-        ptr = (U32*)zc->hufTable + HUF_CTABLE_SIZE_U32(255);  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
+        ptr = (char*)zc->hufCTable + hufCTable_size;  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
 
         /* opt parser space */
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
@@ -413,15 +416,15 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
     dstCCtx->dictID       = srcCCtx->dictID;
 
     /* copy entropy tables */
-    dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
-    if (srcCCtx->flagStaticTables) {
+    dstCCtx->fseCTables_ready = srcCCtx->fseCTables_ready;
+    if (srcCCtx->fseCTables_ready) {
         memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, litlengthCTable_size);
         memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, matchlengthCTable_size);
         memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, offcodeCTable_size);
     }
-    dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
-    if (srcCCtx->flagStaticHufTable) {
-        memcpy(dstCCtx->hufTable, srcCCtx->hufTable, HUF_CTABLE_SIZE(255));
+    dstCCtx->hufCTable_repeatMode = srcCCtx->hufCTable_repeatMode;
+    if (srcCCtx->hufCTable_repeatMode) {
+        memcpy(dstCCtx->hufCTable, srcCCtx->hufCTable, hufCTable_size);
     }
 
     return 0;
@@ -549,28 +552,28 @@ static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
 
     /* small ? don't even attempt compression (speed opt) */
 #   define LITERAL_NOENTROPY 63
-    {   size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
+    {   size_t const minLitSize = zc->hufCTable_repeatMode == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
         if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
     }
 
     if (dstCapacity < lhSize+1) return ERROR(dstSize_tooSmall);   /* not enough space for compression */
-    {   HUF_repeat repeat = zc->flagStaticHufTable;
+    {   HUF_repeat repeat = zc->hufCTable_repeatMode;
         int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
         if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
         cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
+                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufCTable, &repeat, preferRepeat)
                                 : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
+                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufCTable, &repeat, preferRepeat);
         if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
-        else { zc->flagStaticHufTable = HUF_repeat_check; }       /* now have a table to reuse */
+        else { zc->hufCTable_repeatMode = HUF_repeat_check; }       /* now have a table to reuse */
     }
 
     if ((cLitSize==0) | (cLitSize >= srcSize - minGain)) {
-        zc->flagStaticHufTable = HUF_repeat_none;
+        zc->hufCTable_repeatMode = HUF_repeat_none;
         return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
     }
     if (cLitSize==1) {
-        zc->flagStaticHufTable = HUF_repeat_none;
+        zc->hufCTable_repeatMode = HUF_repeat_none;
         return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
     }
 
@@ -694,7 +697,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             *op++ = llCodeTable[0];
             FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
             LLtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+        } else if ((zc->fseCTables_ready) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
             LLtype = set_repeat;
         } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog-1)))) {
             FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
@@ -718,7 +721,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             *op++ = ofCodeTable[0];
             FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
             Offtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+        } else if ((zc->fseCTables_ready) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
             Offtype = set_repeat;
         } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog-1)))) {
             FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
@@ -742,7 +745,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
             *op++ = *mlCodeTable;
             FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
             MLtype = set_rle;
-        } else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
+        } else if ((zc->fseCTables_ready) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
             MLtype = set_repeat;
         } else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog-1)))) {
             FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, scratchBuffer, sizeof(scratchBuffer));
@@ -760,7 +763,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
     }   }
 
     *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
-    zc->flagStaticTables = 0;
+    zc->fseCTables_ready = 0;
 
     /* Encoding Sequences */
     {   BIT_CStream_t blockStream;
@@ -839,7 +842,7 @@ _check_compressibility:
     {   size_t const minGain = ZSTD_minGain(srcSize);
         size_t const maxCSize = srcSize - minGain;
         if ((size_t)(op-ostart) >= maxCSize) {
-            zc->flagStaticHufTable = HUF_repeat_none;
+            zc->hufCTable_repeatMode = HUF_repeat_none;
             return 0;
     }   }
 
@@ -2678,7 +2681,7 @@ static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t
     cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
     dictPtr += 4;
 
-    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufTable, 255, dictPtr, dictEnd-dictPtr);
+    {   size_t const hufHeaderSize = HUF_readCTable(cctx->hufCTable, 255, dictPtr, dictEnd-dictPtr);
         if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
         dictPtr += hufHeaderSize;
     }
@@ -2738,8 +2741,8 @@ static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t
                 if (cctx->rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
         }   }
 
-        cctx->flagStaticTables = 1;
-        cctx->flagStaticHufTable = HUF_repeat_valid;
+        cctx->fseCTables_ready = 1;
+        cctx->hufCTable_repeatMode = HUF_repeat_valid;
         return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
     }
 }
diff --git a/lib/zstd.h b/lib/zstd.h
index 5101fd26c..a99e497fc 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -71,48 +71,48 @@ ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< library version number; to
 *  Simple API
 ***************************************/
 /*! ZSTD_compress() :
-    Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
-    Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
-    @return : compressed size written into `dst` (<= `dstCapacity),
-              or an error code if it fails (which can be tested using ZSTD_isError()). */
+ *  Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
+ *  Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+ *  @return : compressed size written into `dst` (<= `dstCapacity),
+ *            or an error code if it fails (which can be tested using ZSTD_isError()). */
 ZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,
                             const void* src, size_t srcSize,
                                   int compressionLevel);
 
 /*! ZSTD_decompress() :
-    `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
-    `dstCapacity` is an upper bound of originalSize.
-    If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
-    @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
-              or an errorCode if it fails (which can be tested using ZSTD_isError()). */
+ *  `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
+ *  `dstCapacity` is an upper bound of originalSize.
+ *  If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
+ *  @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
+ *            or an errorCode if it fails (which can be tested using ZSTD_isError()). */
 ZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,
                               const void* src, size_t compressedSize);
 
 /*! ZSTD_getDecompressedSize() :
-*   NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
-*   ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
-*   frame, but distinguishes empty frames from frames with an unknown size, or errors.
-*
-*   Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
-*   concatenated frames in one buffer, and so is more general.
-*   As a result however, it requires more computation and entire frames to be passed to it,
-*   as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
-*
-*   'src' is the start of a zstd compressed frame.
-*   @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
-*    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
-*             When `return==0`, data to decompress could be any size.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
-*             (For example, data may be necessarily cut into blocks <= 16 KB).
-*    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
-*    note 3 : decompressed size can be very large (64-bits value),
-*             potentially larger than what local system can handle as a single memory segment.
-*             In which case, it's necessary to use streaming mode to decompress data.
-*    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-*             Always ensure result fits within application's authorized limits.
-*             Each application can set its own limits.
-*    note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. */
+ *  NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
+ *  ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
+ *  frame, but distinguishes empty frames from frames with an unknown size, or errors.
+ *
+ *  Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
+ *  concatenated frames in one buffer, and so is more general.
+ *  As a result however, it requires more computation and entire frames to be passed to it,
+ *  as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
+ *
+ *  'src' is the start of a zstd compressed frame.
+ *  @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
+ *   note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
+ *            When `return==0`, data to decompress could be any size.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *            Optionally, application can still use ZSTD_decompress() while relying on implied limits.
+ *            (For example, data may be necessarily cut into blocks <= 16 KB).
+ *   note 2 : decompressed size is always present when compression is done with ZSTD_compress()
+ *   note 3 : decompressed size can be very large (64-bits value),
+ *            potentially larger than what local system can handle as a single memory segment.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *   note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+ *            Always ensure result fits within application's authorized limits.
+ *            Each application can set its own limits.
+ *   note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. */
 ZSTDLIB_API unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
 
 
@@ -127,29 +127,29 @@ ZSTDLIB_API const char* ZSTD_getErrorName(size_t code);     /*!< provides readab
 *  Explicit memory management
 ***************************************/
 /*= Compression context
-*   When compressing many times,
-*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   This will make workload friendlier for system's memory.
-*   Use one context per thread for parallel execution in multi-threaded environments. */
+ *  When compressing many times,
+ *  it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+ *  This will make workload friendlier for system's memory.
+ *  Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_CCtx_s ZSTD_CCtx;
 ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);
 ZSTDLIB_API size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
 
 /*! ZSTD_compressCCtx() :
-    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
+ *  Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). */
 ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel);
 
 /*= Decompression context
-*   When decompressing many times,
-*   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-*   This will make workload friendlier for system's memory.
-*   Use one context per thread for parallel execution in multi-threaded environments. */
+ *  When decompressing many times,
+ *  it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+ *  This will make workload friendlier for system's memory.
+ *  Use one context per thread for parallel execution in multi-threaded environments. */
 typedef struct ZSTD_DCtx_s ZSTD_DCtx;
 ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void);
 ZSTDLIB_API size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
 
 /*! ZSTD_decompressDCtx() :
-*   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
+ *  Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). */
 ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
 
 

From 71aaa32c3c41a9a02de561b82bf0d3e8190744f0 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 23:03:38 -0700
Subject: [PATCH 203/255] transferred FSE tables from CCtx into workspace

Saved 5 KB from CCtx
---
 lib/compress/zstd_compress.c | 19 ++++++++++++++-----
 1 file changed, 14 insertions(+), 5 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 4530cff9a..783d2661f 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -98,9 +98,9 @@ struct ZSTD_CCtx_s {
     HUF_repeat hufCTable_repeatMode;
     HUF_CElt* hufCTable;
     U32 fseCTables_ready;
-    FSE_CTable offcodeCTable  [FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
-    FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
-    FSE_CTable litlengthCTable  [FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
+    FSE_CTable* offcodeCTable;
+    FSE_CTable* matchlengthCTable;
+    FSE_CTable* litlengthCTable;
     unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
 };
 
@@ -307,7 +307,11 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 /* entropy space */
                 zc->hufCTable = (HUF_CElt*)ptr;
                 ptr = (char*)zc->hufCTable + hufCTable_size;  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
-
+                zc->offcodeCTable = (FSE_CTable*) ptr;
+                ptr = (char*)ptr + offcodeCTable_size;
+                zc->matchlengthCTable = ptr;
+                ptr = (char*)ptr + matchlengthCTable_size;
+                zc->litlengthCTable = ptr;
         }   }
 
         /* init params */
@@ -332,7 +336,12 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         zc->hashLog3 = hashLog3;
         zc->seqStore.litLengthSum = 0;
 
-        ptr = (char*)zc->hufCTable + hufCTable_size;  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
+        /* ensure entropy tables are close together at the beginning */
+        assert((void*)zc->hufCTable == zc->workSpace);
+        assert((char*)zc->offcodeCTable == (char*)zc->hufCTable + hufCTable_size);
+        assert((char*)zc->matchlengthCTable == (char*)zc->offcodeCTable + offcodeCTable_size);
+        assert((char*)zc->litlengthCTable == (char*)zc->matchlengthCTable + matchlengthCTable_size);
+        ptr = (char*)zc->litlengthCTable + litlengthCTable_size;
 
         /* opt parser space */
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {

From a408645f500078c903bf0c73ec760bffc866ef0b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 23:09:39 -0700
Subject: [PATCH 204/255] made some room for entropy scratch space

---
 lib/compress/zstd_compress.c | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 783d2661f..63266df93 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -32,6 +32,7 @@ static size_t const hufCTable_size = HUF_CTABLE_SIZE(255);
 static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
 static size_t const offcodeCTable_size = FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff) * sizeof(FSE_CTable);
 static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE_U32(MLFSELog, MaxML) * sizeof(FSE_CTable);
+static size_t const entropyScratchSpace = HUF_WORKSPACE_SIZE;
 
 
 /*-*************************************
@@ -223,7 +224,8 @@ size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
     U32    const hashLog3 = (cParams.searchLength>3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
     size_t const h3Size = ((size_t)1) << hashLog3;
     size_t const entropySpace = hufCTable_size + litlengthCTable_size
-                              + offcodeCTable_size + matchlengthCTable_size;
+                              + offcodeCTable_size + matchlengthCTable_size
+                              + entropyScratchSpace;
     size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
 
     size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
@@ -291,7 +293,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
 
         /* Check if workSpace is large enough, alloc a new one if needed */
         {   size_t const entropySpace = hufCTable_size + litlengthCTable_size
-                                  + offcodeCTable_size + matchlengthCTable_size;
+                                  + offcodeCTable_size + matchlengthCTable_size
+                                  + entropyScratchSpace;
             size_t const optPotentialSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits)) * sizeof(U32)
                                   + (ZSTD_OPT_NUM+1) * (sizeof(ZSTD_match_t)+sizeof(ZSTD_optimal_t));
             size_t const optSpace = ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optPotentialSpace : 0;

From 7271203bdb915ac5ff00cc05efd0aa76a97c6bf0 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 20 Apr 2017 23:21:19 -0700
Subject: [PATCH 205/255] transferred entropy scratch space from CCtx into
 workSpace

Saved 6 KB
---
 lib/compress/zstd_compress.c | 22 +++++++++++++---------
 1 file changed, 13 insertions(+), 9 deletions(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 63266df93..4e3760b54 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -32,7 +32,7 @@ static size_t const hufCTable_size = HUF_CTABLE_SIZE(255);
 static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
 static size_t const offcodeCTable_size = FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff) * sizeof(FSE_CTable);
 static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE_U32(MLFSELog, MaxML) * sizeof(FSE_CTable);
-static size_t const entropyScratchSpace = HUF_WORKSPACE_SIZE;
+static size_t const entropyScratchSpace_size = HUF_WORKSPACE_SIZE;
 
 
 /*-*************************************
@@ -102,7 +102,7 @@ struct ZSTD_CCtx_s {
     FSE_CTable* offcodeCTable;
     FSE_CTable* matchlengthCTable;
     FSE_CTable* litlengthCTable;
-    unsigned tmpCounters[HUF_WORKSPACE_SIZE_U32];
+    unsigned* tmpCounters;
 };
 
 ZSTD_CCtx* ZSTD_createCCtx(void)
@@ -225,7 +225,7 @@ size_t ZSTD_estimateCCtxSize(ZSTD_compressionParameters cParams)
     size_t const h3Size = ((size_t)1) << hashLog3;
     size_t const entropySpace = hufCTable_size + litlengthCTable_size
                               + offcodeCTable_size + matchlengthCTable_size
-                              + entropyScratchSpace;
+                              + entropyScratchSpace_size;
     size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
 
     size_t const optSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits))*sizeof(U32)
@@ -294,7 +294,7 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         /* Check if workSpace is large enough, alloc a new one if needed */
         {   size_t const entropySpace = hufCTable_size + litlengthCTable_size
                                   + offcodeCTable_size + matchlengthCTable_size
-                                  + entropyScratchSpace;
+                                  + entropyScratchSpace_size;
             size_t const optPotentialSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<<Litbits)) * sizeof(U32)
                                   + (ZSTD_OPT_NUM+1) * (sizeof(ZSTD_match_t)+sizeof(ZSTD_optimal_t));
             size_t const optSpace = ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optPotentialSpace : 0;
@@ -312,9 +312,12 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 ptr = (char*)zc->hufCTable + hufCTable_size;  /* note : HUF_CElt* is incomplete type, size is estimated via macro */
                 zc->offcodeCTable = (FSE_CTable*) ptr;
                 ptr = (char*)ptr + offcodeCTable_size;
-                zc->matchlengthCTable = ptr;
+                zc->matchlengthCTable = (FSE_CTable*) ptr;
                 ptr = (char*)ptr + matchlengthCTable_size;
-                zc->litlengthCTable = ptr;
+                zc->litlengthCTable = (FSE_CTable*) ptr;
+                ptr = (char*)ptr + litlengthCTable_size;
+                assert(((size_t)ptr & 3) == 0);   /* ensure correct alignment */
+                zc->tmpCounters = (unsigned*) ptr;
         }   }
 
         /* init params */
@@ -344,7 +347,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         assert((char*)zc->offcodeCTable == (char*)zc->hufCTable + hufCTable_size);
         assert((char*)zc->matchlengthCTable == (char*)zc->offcodeCTable + offcodeCTable_size);
         assert((char*)zc->litlengthCTable == (char*)zc->matchlengthCTable + matchlengthCTable_size);
-        ptr = (char*)zc->litlengthCTable + litlengthCTable_size;
+        assert((char*)zc->tmpCounters == (char*)zc->litlengthCTable + litlengthCTable_size);
+        ptr = (char*)zc->tmpCounters + entropyScratchSpace_size;
 
         /* opt parser space */
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
@@ -573,9 +577,9 @@ static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
         int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
         if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
         cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufCTable, &repeat, preferRepeat)
+                                      zc->tmpCounters, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat)
                                 : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, sizeof(zc->tmpCounters), zc->hufCTable, &repeat, preferRepeat);
+                                      zc->tmpCounters, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat);
         if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
         else { zc->hufCTable_repeatMode = HUF_repeat_check; }       /* now have a table to reuse */
     }

From d0b1846cf47d3989ce7fb3afb12734c695dddb4b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 21 Apr 2017 10:59:36 -0700
Subject: [PATCH 206/255] ignore more cmake build artefacts

---
 build/cmake/lib/.gitignore      | 2 ++
 build/cmake/programs/.gitignore | 2 ++
 2 files changed, 4 insertions(+)
 create mode 100644 build/cmake/lib/.gitignore

diff --git a/build/cmake/lib/.gitignore b/build/cmake/lib/.gitignore
new file mode 100644
index 000000000..a4444c8d3
--- /dev/null
+++ b/build/cmake/lib/.gitignore
@@ -0,0 +1,2 @@
+# cmake build artefact
+libzstd.pc
diff --git a/build/cmake/programs/.gitignore b/build/cmake/programs/.gitignore
index f04c5b429..ae3a8a356 100644
--- a/build/cmake/programs/.gitignore
+++ b/build/cmake/programs/.gitignore
@@ -1,3 +1,5 @@
 # produced by make
 zstd
 zstd-frugal
+unzstd
+zstdcat

From 230d7acc7d3d0b08ba2b09acf1bda93bb5c9aa62 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 21 Apr 2017 11:38:13 -0700
Subject: [PATCH 207/255] cli : add support for --threads=# command

updated documentation
add relevant test case
---
 programs/zstd.1    | 23 +++++++++++++----------
 programs/zstd.1.md | 41 +++++++++++++++++++++--------------------
 programs/zstdcli.c |  1 +
 tests/playTests.sh |  1 +
 4 files changed, 36 insertions(+), 30 deletions(-)

diff --git a/programs/zstd.1 b/programs/zstd.1
index b84ab3324..999dc8169 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -5,7 +5,7 @@
 \fBzstd\fR \- zstd, zstdmt, unzstd, zstdcat \- Compress or decompress \.zst files
 .
 .SH "SYNOPSIS"
-\fBzstd\fR [\fIOPTIONS\fR] [\-|<INPUT\-FILE>] [\-o <OUTPUT\-FILE>]
+\fBzstd\fR [\fIOPTIONS\fR] [\-|\fIINPUT\-FILE\fR] [\-o \fIOUTPUT\-FILE\fR]
 .
 .P
 \fBzstdmt\fR is equivalent to \fBzstd \-T0\fR
@@ -100,8 +100,8 @@ Use FILEs as a training set to create a dictionary\. The training set should con
 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
-\fB\-T#\fR
-Compress using # threads (default: 1)\. If \fB#\fR is 0, attempt to detect the number of physical CPU cores and compress with that many threads\. This modified does nothing if \fBzstd\fR was compiled without multithread support\.
+\fB\-T#\fR, \fB\-\-threads=#\fR
+Compress using \fB#\fR threads (default: 1)\. If \fB#\fR is 0, attempt to detect and use the number of physical CPU cores\. This modifier does nothing if \fBzstd\fR is compiled without multithread support\.
 .
 .TP
 \fB\-D file\fR
@@ -113,7 +113,7 @@ do not store dictionary ID within frame header (dictionary compression)\. The de
 .
 .TP
 \fB\-o file\fR
-save result into \fBfile\fR (only possible with a single INPUT\-FILE)
+save result into \fBfile\fR (only possible with a single \fIINPUT\-FILE\fR)
 .
 .TP
 \fB\-f\fR, \fB\-\-force\fR
@@ -172,7 +172,7 @@ use FILEs as training set to create a dictionary\. The training set should conta
 .
 .TP
 \fB\-o file\fR
-dictionary saved into \fBfile\fR (default: dictionary)
+dictionary saved into \fBfile\fR (default name: dictionary)
 .
 .TP
 \fB\-\-maxdict=#\fR
@@ -198,15 +198,18 @@ Example: \fB\-\-train \-\-cover=k=64,d=8 FILEs\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\.
+Runs the cover dictionary builder for each parameter set and saves the optimal parameters and dictionary\. Prints optimal parameters and writes optimal dictionary into 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
+Examples :
+.
+.IP
 \fBzstd \-\-train \-\-optimize\-cover FILEs\fR
 .
-.br
+.IP
 \fBzstd \-\-train \-\-optimize\-cover=d=d,steps=512 FILEs\fR
 .
 .SH "BENCHMARK"
@@ -233,9 +236,6 @@ set process priority to real\-time
 .
 .SH "ADVANCED COMPRESSION OPTIONS"
 .
-.SS "\-B#:"
-Select the size of each compression job\. This parameter is available only when multi\-threading is enabled\. Default value is \fB4 * windowSize\fR, which means it varies depending on compression level\. \fB\-B#\fR makes it possible to select a custom value\. Note that job size must respect a minimum value which is enforced transparently\. This minimum is either 1 MB, or \fBoverlapSize\fR, whichever is largest\.
-.
 .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:
 .
@@ -310,6 +310,9 @@ Determine \fBoverlapSize\fR, amount of data reloaded from previous job\. This pa
 .IP
 The minimum \fIovlog\fR is 0, and the maximum is 9\. 0 means "no overlap", hence completely independent jobs\. 9 means "full overlap", meaning up to \fBwindowSize\fR is reloaded from previous job\. Reducing \fIovlog\fR by 1 reduces the amount of reload by a factor 2\. Default \fIovlog\fR is 6, which means "reload \fBwindowSize / 8\fR"\. Exception : the maximum compression level (22) has a default \fIovlog\fR of 9\.
 .
+.SS "\-B#:"
+Select the size of each compression job\. This parameter is available only when multi\-threading is enabled\. Default value is \fB4 * windowSize\fR, which means it varies depending on compression level\. \fB\-B#\fR makes it possible to select a custom value\. Note that job size must respect a minimum value which is enforced transparently\. This minimum is either 1 MB, or \fBoverlapSize\fR, whichever is largest\.
+.
 .SS "Example"
 The following parameters sets advanced compression options to those of predefined level 19 for files bigger than 256 KB:
 .
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index 4b918d8fd..f2d04d16f 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -4,7 +4,7 @@ zstd(1) -- zstd, zstdmt, unzstd, zstdcat - Compress or decompress .zst files
 SYNOPSIS
 --------
 
-`zstd` [*OPTIONS*] [-|&lt;INPUT-FILE&gt;] [-o &lt;OUTPUT-FILE&gt;]
+`zstd` [*OPTIONS*] [-|_INPUT-FILE_] [-o _OUTPUT-FILE_]
 
 `zstdmt` is equivalent to `zstd -T0`
 
@@ -101,11 +101,10 @@ the last one takes effect.
 * `--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.
-* `-T#`:
-    Compress using # threads (default: 1).
-    If `#` is 0, attempt to detect the number of physical CPU cores and compress with
-    that many threads.
-    This modified does nothing if `zstd` was compiled without multithread support.
+* `-T#`, `--threads=#`:
+    Compress using `#` threads (default: 1).
+    If `#` is 0, attempt to detect and use the number of physical CPU cores.
+    This modifier does nothing if `zstd` is compiled without multithread support.
 * `-D file`:
     use `file` as Dictionary to compress or decompress FILE(s)
 * `--nodictID`:
@@ -113,7 +112,7 @@ the last one takes effect.
     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)
+    save result into `file` (only possible with a single _INPUT-FILE_)
 * `-f`, `--force`:
     overwrite output without prompting, and (de)compress symbolic links
 * `-c`, `--stdout`:
@@ -164,7 +163,7 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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)
+    dictionary saved into `file` (default name: dictionary)
 * `--maxdict=#`:
     limit dictionary to specified size (default : (112640)
 * `--dictID=#`:
@@ -198,9 +197,9 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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.
+    Runs the cover dictionary builder for each parameter set
+    and saves the optimal parameters and dictionary.
+    Prints optimal parameters and writes optimal dictionary into 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.
@@ -208,7 +207,10 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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 />
+    Examples :
+
+    `zstd --train --optimize-cover FILEs`
+
     `zstd --train --optimize-cover=d=d,steps=512 FILEs`
 
 
@@ -229,14 +231,6 @@ BENCHMARK
 
 ADVANCED COMPRESSION OPTIONS
 ----------------------------
-### -B#:
-Select the size of each compression job.
-This parameter is available only when multi-threading is enabled.
-Default value is `4 * windowSize`, which means it varies depending on compression level.
-`-B#` makes it possible to select a custom value.
-Note that job size must respect a minimum value which is enforced transparently.
-This minimum is either 1 MB, or `overlapSize`, whichever is largest.
-
 ### --zstd[=options]:
 `zstd` provides 22 predefined compression levels.
 The selected or default predefined compression level can be changed with
@@ -319,6 +313,13 @@ The list of available _options_:
     Default _ovlog_ is 6, which means "reload `windowSize / 8`".
     Exception : the maximum compression level (22) has a default _ovlog_ of 9.
 
+### -B#:
+Select the size of each compression job.
+This parameter is available only when multi-threading is enabled.
+Default value is `4 * windowSize`, which means it varies depending on compression level.
+`-B#` makes it possible to select a custom value.
+Note that job size must respect a minimum value which is enforced transparently.
+This minimum is either 1 MB, or `overlapSize`, whichever is largest.
 
 ### Example
 The following parameters sets advanced compression options to those of
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 6cbe7383f..76f55de53 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -420,6 +420,7 @@ int main(int argCount, const char* argv[])
                       continue;
                     }
 #endif
+                    if (longCommandWArg(&argument, "--threads=")) { nbThreads = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--memlimit=")) { memLimit = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--memory=")) { memLimit = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--memlimit-decompress=")) { memLimit = readU32FromChar(&argument); continue; }
diff --git a/tests/playTests.sh b/tests/playTests.sh
index deeebee2e..a91e9e8bb 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -471,6 +471,7 @@ then
     $ECHO "\n**** zstdmt round-trip tests **** "
     roundTripTest -g4M "1 -T0"
     roundTripTest -g8M "3 -T2"
+    roundTripTest -g8000K "2 --threads=2"
     fileRoundTripTest -g4M "19 -T2 -B1M"
 else
     $ECHO "\n**** no multithreading, skipping zstdmt tests **** "

From 4de86329576ab5b5f4c7e190ea573243c11866b5 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Mon, 24 Apr 2017 16:48:25 -0700
Subject: [PATCH 208/255] Add LZ4 compress/decompress support to CLI

---
 programs/Makefile  |  19 +++++-
 programs/fileio.c  | 154 ++++++++++++++++++++++++++++++++++++++++++++-
 programs/fileio.h  |   3 +-
 programs/zstdcli.c |   6 ++
 tests/playTests.sh |  41 +++++++++++-
 5 files changed, 216 insertions(+), 7 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 4ab4dfd62..b3763484e 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -116,6 +116,16 @@ LZMALD = -llzma
 else
 LZMA_MSG := $(NO_LZMA_MSG)
 endif
+# lz4 detection
+NO_LZ4_MSG := ==> no liblz4, building zstd without .lz4 support
+HAVE_LZ4 := $(shell printf '\#include <lz4.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lz4$(EXT) -x c - -llz4 2> $(VOID) && rm have_lz4$(EXT) && echo 1 || echo 0)
+ifeq ($(HAVE_LZ4), 1)
+LZ4_MSG := ==> building zstd with .lz4 compression support
+LZ4CPP = -DZSTD_LZ4COMPRESS -DZSTD_LZ4DECOMPRESS
+LZ4LD = -llz4
+else
+LZ4_MSG := $(NO_LZ4_MSG)
+endif
 
 MD2ROFF  =ronn
 MD2ROFF_FLAGS  = --roff --warnings --manual="User Commands" --organization="zstd $(ZSTD_VERSION)"
@@ -135,11 +145,16 @@ zstd-nogz : ZLIB_MSG := $(NO_ZLIB_MSG)
 zstd-nogz : LZMA_MSG := $(NO_LZMA_MSG)
 xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
-zstd zstd-nogz xzstd : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
-zstd zstd-nogz xzstd : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
+xzstd : LZ4_MSG := $(NO_LZMA_MSG)
+zstd4 : CPPFLAGS += $(ZLIBCPP) $(LZ4CPP)
+zstd4 : LDFLAGS += $(ZLIBLD) $(LZ4LD)
+zstd4 : LZMA_MSG := $(NO_LZMA_MSG)
+zstd zstd-nogz xzstd zstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
+zstd zstd-nogz xzstd zstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
 	@echo "$(ZLIB_MSG)"
 	@echo "$(LZMA_MSG)"
+	@echo "$(LZ4_MSG)"
 ifneq (,$(filter Windows%,$(OS)))
 	windres/generate_res.bat
 endif
diff --git a/programs/fileio.c b/programs/fileio.c
index 9bca20664..1b54256ec 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -53,6 +53,11 @@
 #  include <lzma.h>
 #endif
 
+#define LZ4_MAGICNUMBER 0x184D2204
+#if defined(ZSTD_LZ4COMPRESS) || defined(ZSTD_LZ4DECOMPRESS)
+#  include <lz4frame.h>
+#endif
+
 
 /*-*************************************
 *  Constants
@@ -514,6 +519,77 @@ static unsigned long long FIO_compressLzmaFrame(cRess_t* ress, const char* srcFi
 }
 #endif
 
+#ifdef ZSTD_LZ4COMPRESS
+static int FIO_LZ4_GetBlockSize_FromBlockId (int id) { return (1 << (8 + (2 * id))); }
+static unsigned long long FIO_compressLz4Frame(cRess_t* ress, const char* srcFileName, U64 const srcFileSize, int compressionLevel, U64* readsize)
+{
+    unsigned long long inFileSize = 0, outFileSize = 0;
+
+    LZ4F_preferences_t prefs;
+    LZ4F_cctx* ctx;
+
+    LZ4F_errorCode_t const errorCode = LZ4F_createCompressionContext(&ctx, LZ4F_VERSION);
+    if (LZ4F_isError(errorCode)) EXM_THROW(31, "zstd: failed to create lz4 compression context");
+
+    memset(&prefs, 0, sizeof(prefs));
+
+    prefs.autoFlush = 1;
+    prefs.compressionLevel = compressionLevel;
+    prefs.frameInfo.blockMode = LZ4F_blockIndependent; /* stick to defaults for lz4 cli */
+    prefs.frameInfo.blockSizeID = LZ4F_max4MB;
+    prefs.frameInfo.contentChecksumFlag = (LZ4F_contentChecksum_t)g_checksumFlag;
+    prefs.frameInfo.contentSize = srcFileSize;
+
+    {
+        size_t blockSize = FIO_LZ4_GetBlockSize_FromBlockId(LZ4F_max4MB);
+        size_t readSize;
+        size_t headerSize = LZ4F_compressBegin(ctx, ress->dstBuffer, ress->dstBufferSize, &prefs);
+        if (LZ4F_isError(headerSize)) EXM_THROW(33, "File header generation failed : %s", LZ4F_getErrorName(headerSize));
+        { size_t const sizeCheck = fwrite(ress->dstBuffer, 1, headerSize, ress->dstFile);
+          if (sizeCheck!=headerSize) EXM_THROW(34, "Write error : cannot write header"); }
+        outFileSize += headerSize;
+
+        /* Read first block */
+        readSize  = fread(ress->srcBuffer, (size_t)1, (size_t)blockSize, ress->srcFile);
+        inFileSize += readSize;
+
+        /* Main Loop */
+        while (readSize>0) {
+            size_t outSize;
+
+            /* Compress Block */
+            outSize = LZ4F_compressUpdate(ctx, ress->dstBuffer, ress->dstBufferSize, ress->srcBuffer, readSize, NULL);
+            if (LZ4F_isError(outSize)) EXM_THROW(35, "zstd: %s: lz4 compression failed : %s", srcFileName, LZ4F_getErrorName(outSize));
+            outFileSize += outSize;
+            if (!srcFileSize) DISPLAYUPDATE(2, "\rRead : %u MB ==> %.2f%%", (U32)(inFileSize>>20), (double)outFileSize/inFileSize*100)
+            else DISPLAYUPDATE(2, "\rRead : %u / %u MB ==> %.2f%%", (U32)(inFileSize>>20), (U32)(srcFileSize>>20), (double)outFileSize/inFileSize*100);
+
+            /* Write Block */
+            { size_t const sizeCheck = fwrite(ress->dstBuffer, 1, outSize, ress->dstFile);
+              if (sizeCheck!=outSize) EXM_THROW(36, "Write error : cannot write compressed block"); }
+
+            /* Read next block */
+            readSize  = fread(ress->srcBuffer, (size_t)1, (size_t)blockSize, ress->srcFile);
+            inFileSize += readSize;
+        }
+        if (ferror(ress->srcFile)) EXM_THROW(37, "Error reading %s ", srcFileName);
+
+        /* End of Stream mark */
+        headerSize = LZ4F_compressEnd(ctx, ress->dstBuffer, ress->dstBufferSize, NULL);
+        if (LZ4F_isError(headerSize)) EXM_THROW(38, "zstd: %s: lz4 end of file generation failed : %s", srcFileName, LZ4F_getErrorName(headerSize));
+
+        { size_t const sizeCheck = fwrite(ress->dstBuffer, 1, headerSize, ress->dstFile);
+          if (sizeCheck!=headerSize) EXM_THROW(39, "Write error : cannot write end of stream"); }
+        outFileSize += headerSize;
+    }
+
+    *readsize = inFileSize;
+    LZ4F_freeCompressionContext(ctx);
+
+    return outFileSize;
+}
+#endif
+
 
 /*! FIO_compressFilename_internal() :
  *  same as FIO_compressFilename_extRess(), with `ress.desFile` already opened.
@@ -547,6 +623,13 @@ static int FIO_compressFilename_internal(cRess_t ress,
 #else
             (void)compressionLevel;
             EXM_THROW(20, "zstd: %s: file cannot be compressed as xz/lzma (zstd compiled without ZSTD_LZMACOMPRESS) -- ignored \n", srcFileName);
+#endif
+        case FIO_lz4Compression:
+#ifdef ZSTD_LZ4COMPRESS
+            compressedfilesize = FIO_compressLz4Frame(&ress, srcFileName, fileSize, compressionLevel, &readsize);
+#else
+            (void)compressionLevel;
+            EXM_THROW(20, "zstd: %s: file cannot be compressed as lz4 (zstd compiled without ZSTD_LZ4COMPRESS) -- ignored \n", srcFileName);
 #endif
             goto finish;
     }
@@ -1039,6 +1122,66 @@ static unsigned long long FIO_decompressLzmaFrame(dRess_t* ress, FILE* srcFile,
 }
 #endif
 
+#ifdef ZSTD_LZ4DECOMPRESS
+static unsigned long long FIO_decompressLz4Frame(dRess_t* ress, FILE* srcFile, const char* srcFileName)
+{
+    unsigned long long filesize = 0;
+    LZ4F_errorCode_t nextToLoad;
+    LZ4F_dctx* dCtx;
+    LZ4F_errorCode_t const errorCode = LZ4F_createDecompressionContext(&dCtx, LZ4F_VERSION);
+
+    if (LZ4F_isError(errorCode)) EXM_THROW(61, "zstd: failed to create lz4 decompression context");
+
+    /* Init feed with magic number (already consumed from FILE* sFile) */
+    {   size_t inSize = 4;
+        size_t outSize= 0;
+        MEM_writeLE32(ress->srcBuffer, LZ4_MAGICNUMBER);
+        nextToLoad = LZ4F_decompress(dCtx, ress->dstBuffer, &outSize, ress->srcBuffer, &inSize, NULL);
+        if (LZ4F_isError(nextToLoad)) EXM_THROW(62, "zstd: %s: lz4 header error : %s", srcFileName, LZ4F_getErrorName(nextToLoad));
+    }
+
+    /* Main Loop */
+    for (;nextToLoad;) {
+        size_t readSize;
+        size_t pos = 0;
+        size_t decodedBytes = ress->dstBufferSize;
+
+        /* Read input */
+        if (nextToLoad > ress->srcBufferSize) nextToLoad = ress->srcBufferSize;
+        readSize = fread(ress->srcBuffer, 1, nextToLoad, srcFile);
+        if (!readSize) break;   /* reached end of file or stream */
+
+        while ((pos < readSize) || (decodedBytes == ress->dstBufferSize)) {  /* still to read, or still to flush */
+            /* Decode Input (at least partially) */
+            size_t remaining = readSize - pos;
+            decodedBytes = ress->dstBufferSize;
+            nextToLoad = LZ4F_decompress(dCtx, ress->dstBuffer, &decodedBytes, (char*)(ress->srcBuffer)+pos, &remaining, NULL);
+            if (LZ4F_isError(nextToLoad)) EXM_THROW(66, "zstd: %s: decompression error : %s", srcFileName, LZ4F_getErrorName(nextToLoad));
+            pos += remaining;
+
+            /* Write Block */
+            if (decodedBytes) {
+                if (fwrite(ress->dstBuffer, 1, decodedBytes, ress->dstFile) != decodedBytes) EXM_THROW(63, "Write error : cannot write to output file");
+                filesize += decodedBytes;
+                DISPLAYUPDATE(2, "\rDecompressed : %u MB  ", (unsigned)(filesize>>20));
+            }
+
+            if (!nextToLoad) break;
+        }
+    }
+    /* can be out because readSize == 0, which could be an fread() error */
+    if (ferror(srcFile)) EXM_THROW(67, "zstd: %s: read error", srcFileName);
+
+    if (nextToLoad!=0) EXM_THROW(68, "zstd: %s: unfinished stream", srcFileName);
+
+    LZ4F_freeDecompressionContext(dCtx);
+    ress->srcBufferLoaded = 0; /* LZ4F will go to the frame boundary */
+
+    return filesize;
+}
+#endif
+
+
 
 /** FIO_decompressSrcFile() :
     Decompression `srcFileName` into `ress.dstFile`
@@ -1090,6 +1233,15 @@ static int FIO_decompressSrcFile(dRess_t ress, const char* dstFileName, const ch
 #else
             DISPLAYLEVEL(1, "zstd: %s: xz/lzma file cannot be uncompressed (zstd compiled without ZSTD_LZMADECOMPRESS) -- ignored \n", srcFileName);
             return 1;
+#endif
+        } else if (MEM_readLE32(buf) == LZ4_MAGICNUMBER) {
+#ifdef ZSTD_LZ4DECOMPRESS
+            unsigned long long const result = FIO_decompressLz4Frame(&ress, srcFile, srcFileName);
+            if (result == 0) return 1;
+            filesize += result;
+#else
+            DISPLAYLEVEL(1, "zstd: %s: lz4 file cannot be uncompressed (zstd compiled without ZSTD_LZ4DECOMPRESS) -- ignored \n", srcFileName);
+            return 1;
 #endif
         } else {
             if (!ZSTD_isFrame(ress.srcBuffer, toRead)) {
@@ -1199,7 +1351,7 @@ int FIO_decompressMultipleFilenames(const char** srcNamesTable, unsigned nbFiles
                 dstFileName = (char*)malloc(dfnSize);
                 if (dstFileName==NULL) EXM_THROW(74, "not enough memory for dstFileName");
             }
-            if (sfnSize <= suffixSize || (strcmp(suffixPtr, GZ_EXTENSION) && strcmp(suffixPtr, XZ_EXTENSION) && strcmp(suffixPtr, ZSTD_EXTENSION) && strcmp(suffixPtr, LZMA_EXTENSION))) {
+            if (sfnSize <= suffixSize || (strcmp(suffixPtr, GZ_EXTENSION) && strcmp(suffixPtr, XZ_EXTENSION) && strcmp(suffixPtr, ZSTD_EXTENSION) && strcmp(suffixPtr, LZMA_EXTENSION) && strcmp(suffixPtr, LZ4_EXTENSION))) {
                 DISPLAYLEVEL(1, "zstd: %s: unknown suffix (%s/%s/%s/%s expected) -- ignored \n", srcFileName, GZ_EXTENSION, XZ_EXTENSION, ZSTD_EXTENSION, LZMA_EXTENSION);
                 skippedFiles++;
                 continue;
diff --git a/programs/fileio.h b/programs/fileio.h
index 0dd58d625..65da98d7f 100644
--- a/programs/fileio.h
+++ b/programs/fileio.h
@@ -33,12 +33,13 @@ extern "C" {
 #define XZ_EXTENSION    ".xz"
 #define GZ_EXTENSION    ".gz"
 #define ZSTD_EXTENSION  ".zst"
+#define LZ4_EXTENSION   ".lz4"
 
 
 /*-*************************************
 *  Types
 ***************************************/
-typedef enum { FIO_zstdCompression, FIO_gzipCompression, FIO_xzCompression, FIO_lzmaCompression } FIO_compressionType_t;
+typedef enum { FIO_zstdCompression, FIO_gzipCompression, FIO_xzCompression, FIO_lzmaCompression, FIO_lz4Compression } FIO_compressionType_t;
 
 
 /*-*************************************
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 76f55de53..79bc84877 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -136,6 +136,9 @@ static int usage_advanced(const char* programName)
     DISPLAY( "--format=xz : compress files to the .xz format \n");
     DISPLAY( "--format=lzma : compress files to the .lzma format \n");
 #endif
+#ifdef ZSTD_LZ4COMPRESS
+    DISPLAY( "--format=lz4 : compress files to the .lz4 format \n");
+#endif
 #ifndef ZSTD_NODECOMPRESS
     DISPLAY( "--test  : test compressed file integrity \n");
 #if ZSTD_SPARSE_DEFAULT
@@ -404,6 +407,9 @@ int main(int argCount, const char* argv[])
                     if (!strcmp(argument, "--format=lzma")) { suffix = LZMA_EXTENSION; FIO_setCompressionType(FIO_lzmaCompression);  continue; }
                     if (!strcmp(argument, "--format=xz")) { suffix = XZ_EXTENSION; FIO_setCompressionType(FIO_xzCompression);  continue; }
 #endif
+#ifdef ZSTD_LZ4COMPRESS
+                    if (!strcmp(argument, "--format=lz4")) { suffix = LZ4_EXTENSION; FIO_setCompressionType(FIO_lz4Compression);  continue; }
+#endif
 
                     /* long commands with arguments */
 #ifndef ZSTD_NODICT
diff --git a/tests/playTests.sh b/tests/playTests.sh
index a91e9e8bb..369506c2e 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -403,7 +403,7 @@ if [ $GZIPMODE -eq 1 ]; then
     $ZSTD -f --format=gzip tmp
     $ZSTD -f tmp
     cat tmp.gz tmp.zst tmp.gz tmp.zst | $ZSTD -d -f -o tmp
-    head -c -1 tmp.gz | $ZSTD -t && die "incomplete frame not detected !"
+    head -c -1 tmp.gz | $ZSTD -t > $INTOVOID && die "incomplete frame not detected !"
     rm tmp*
 else
     $ECHO "gzip mode not supported"
@@ -445,13 +445,48 @@ if [ $LZMAMODE -eq 1 ]; then
     $ZSTD -f --format=lzma tmp
     $ZSTD -f tmp
     cat tmp.xz tmp.lzma tmp.zst tmp.lzma tmp.xz tmp.zst | $ZSTD -d -f -o tmp
-    head -c -1 tmp.xz | $ZSTD -t && die "incomplete frame not detected !"
-    head -c -1 tmp.lzma | $ZSTD -t && die "incomplete frame not detected !"
+    head -c -1 tmp.xz | $ZSTD -t > $INTOVOID && die "incomplete frame not detected !"
+    head -c -1 tmp.lzma | $ZSTD -t > $INTOVOID && die "incomplete frame not detected !"
     rm tmp*
 else
     $ECHO "xz mode not supported"
 fi
 
+$ECHO "\n**** lz4 compatibility tests **** "
+
+LZ4MODE=1
+$ZSTD --format=lz4 -V || LZ4MODE=0
+if [ $LZ4MODE -eq 1 ]; then
+    $ECHO "lz4 support detected"
+    LZ4EXE=1
+    lz4 -V || LZ4EXE=0
+    if [ $LZ4EXE -eq 1 ]; then
+        ./datagen > tmp
+        $ZSTD --format=lz4 -f tmp
+        lz4 -t -v tmp.lz4
+        lz4 -f tmp
+        $ZSTD -d -f -v tmp.lz4
+        rm tmp*
+    else
+        $ECHO "lz4 binary not detected"
+    fi
+else
+    $ECHO "lz4 mode not supported"
+fi
+
+
+$ECHO "\n**** lz4 frame tests **** "
+
+if [ $LZ4MODE -eq 1 ]; then
+    ./datagen > tmp
+    $ZSTD -f --format=lz4 tmp
+    $ZSTD -f tmp
+    cat tmp.lz4 tmp.zst tmp.lz4 tmp.zst | $ZSTD -d -f -o tmp
+    head -c -1 tmp.lz4 | $ZSTD -t > $INTOVOID && die "incomplete frame not detected !"
+    rm tmp*
+else
+    $ECHO "lz4 mode not supported"
+fi
 
 $ECHO "\n**** zstd round-trip tests **** "
 

From 2c4b6fe6b3d53eff421841200dead4dc314bf077 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Tue, 25 Apr 2017 11:00:54 -0700
Subject: [PATCH 209/255] Make lz4 compression/decompression compatible with
 library r123

---
 programs/Makefile |  2 +-
 programs/fileio.c | 15 +++++++++------
 2 files changed, 10 insertions(+), 7 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index b3763484e..2619614c5 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -118,7 +118,7 @@ LZMA_MSG := $(NO_LZMA_MSG)
 endif
 # lz4 detection
 NO_LZ4_MSG := ==> no liblz4, building zstd without .lz4 support
-HAVE_LZ4 := $(shell printf '\#include <lz4.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lz4$(EXT) -x c - -llz4 2> $(VOID) && rm have_lz4$(EXT) && echo 1 || echo 0)
+HAVE_LZ4 := $(shell printf '\#include <lz4frame.h>\n\#include <lz4.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lz4$(EXT) -x c - -llz4 2> $(VOID) && rm have_lz4$(EXT) && echo 1 || echo 0)
 ifeq ($(HAVE_LZ4), 1)
 LZ4_MSG := ==> building zstd with .lz4 compression support
 LZ4CPP = -DZSTD_LZ4COMPRESS -DZSTD_LZ4DECOMPRESS
diff --git a/programs/fileio.c b/programs/fileio.c
index 1b54256ec..2bf5cb209 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -56,6 +56,7 @@
 #define LZ4_MAGICNUMBER 0x184D2204
 #if defined(ZSTD_LZ4COMPRESS) || defined(ZSTD_LZ4DECOMPRESS)
 #  include <lz4frame.h>
+#  include <lz4.h>
 #endif
 
 
@@ -526,7 +527,7 @@ static unsigned long long FIO_compressLz4Frame(cRess_t* ress, const char* srcFil
     unsigned long long inFileSize = 0, outFileSize = 0;
 
     LZ4F_preferences_t prefs;
-    LZ4F_cctx* ctx;
+    LZ4F_compressionContext_t ctx;
 
     LZ4F_errorCode_t const errorCode = LZ4F_createCompressionContext(&ctx, LZ4F_VERSION);
     if (LZ4F_isError(errorCode)) EXM_THROW(31, "zstd: failed to create lz4 compression context");
@@ -535,13 +536,15 @@ static unsigned long long FIO_compressLz4Frame(cRess_t* ress, const char* srcFil
 
     prefs.autoFlush = 1;
     prefs.compressionLevel = compressionLevel;
-    prefs.frameInfo.blockMode = LZ4F_blockIndependent; /* stick to defaults for lz4 cli */
-    prefs.frameInfo.blockSizeID = LZ4F_max4MB;
-    prefs.frameInfo.contentChecksumFlag = (LZ4F_contentChecksum_t)g_checksumFlag;
+    prefs.frameInfo.blockMode = blockIndependent; /* stick to defaults for lz4 cli */
+    prefs.frameInfo.blockSizeID = max4MB;
+    prefs.frameInfo.contentChecksumFlag = (contentChecksum_t)g_checksumFlag;
+#if LZ4_VERSION_NUMBER >= 10600
     prefs.frameInfo.contentSize = srcFileSize;
+#endif
 
     {
-        size_t blockSize = FIO_LZ4_GetBlockSize_FromBlockId(LZ4F_max4MB);
+        size_t blockSize = FIO_LZ4_GetBlockSize_FromBlockId(max4MB);
         size_t readSize;
         size_t headerSize = LZ4F_compressBegin(ctx, ress->dstBuffer, ress->dstBufferSize, &prefs);
         if (LZ4F_isError(headerSize)) EXM_THROW(33, "File header generation failed : %s", LZ4F_getErrorName(headerSize));
@@ -1127,7 +1130,7 @@ static unsigned long long FIO_decompressLz4Frame(dRess_t* ress, FILE* srcFile, c
 {
     unsigned long long filesize = 0;
     LZ4F_errorCode_t nextToLoad;
-    LZ4F_dctx* dCtx;
+    LZ4F_decompressionContext_t dCtx;
     LZ4F_errorCode_t const errorCode = LZ4F_createDecompressionContext(&dCtx, LZ4F_VERSION);
 
     if (LZ4F_isError(errorCode)) EXM_THROW(61, "zstd: failed to create lz4 decompression context");

From 65e2cda7aaa4e1504ee8d9f9b01460348c8d1e3b Mon Sep 17 00:00:00 2001
From: niXman <i.nixman@autistici.org>
Date: Wed, 26 Apr 2017 13:04:04 +0300
Subject: [PATCH 210/255] unchecked argv[idx] access

---
 examples/simple_compression.c      | 3 ++-
 examples/streaming_compression.c   | 3 ++-
 examples/streaming_decompression.c | 3 ++-
 3 files changed, 6 insertions(+), 3 deletions(-)

diff --git a/examples/simple_compression.c b/examples/simple_compression.c
index 9d448712e..ab1131475 100644
--- a/examples/simple_compression.c
+++ b/examples/simple_compression.c
@@ -116,7 +116,6 @@ static char* createOutFilename_orDie(const char* filename)
 int main(int argc, const char** argv)
 {
     const char* const exeName = argv[0];
-    const char* const inFilename = argv[1];
 
     if (argc!=2) {
         printf("wrong arguments\n");
@@ -125,6 +124,8 @@ int main(int argc, const char** argv)
         return 1;
     }
 
+    const char* const inFilename = argv[1];
+
     char* const outFilename = createOutFilename_orDie(inFilename);
     compress_orDie(inFilename, outFilename);
     free(outFilename);
diff --git a/examples/streaming_compression.c b/examples/streaming_compression.c
index 4c2c1a1d8..24ad15bd6 100644
--- a/examples/streaming_compression.c
+++ b/examples/streaming_compression.c
@@ -112,7 +112,6 @@ static const char* createOutFilename_orDie(const char* filename)
 int main(int argc, const char** argv)
 {
     const char* const exeName = argv[0];
-    const char* const inFilename = argv[1];
 
     if (argc!=2) {
         printf("wrong arguments\n");
@@ -121,6 +120,8 @@ int main(int argc, const char** argv)
         return 1;
     }
 
+    const char* const inFilename = argv[1];
+
     const char* const outFilename = createOutFilename_orDie(inFilename);
     compressFile_orDie(inFilename, outFilename, 1);
 
diff --git a/examples/streaming_decompression.c b/examples/streaming_decompression.c
index 400aa673d..bb2d80987 100644
--- a/examples/streaming_decompression.c
+++ b/examples/streaming_decompression.c
@@ -99,7 +99,6 @@ static void decompressFile_orDie(const char* fname)
 int main(int argc, const char** argv)
 {
     const char* const exeName = argv[0];
-    const char* const inFilename = argv[1];
 
     if (argc!=2) {
         fprintf(stderr, "wrong arguments\n");
@@ -108,6 +107,8 @@ int main(int argc, const char** argv)
         return 1;
     }
 
+    const char* const inFilename = argv[1];
+
     decompressFile_orDie(inFilename);
     return 0;
 }

From eab41c1872fbaf99a949bc082c3169a754d7d147 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Wed, 26 Apr 2017 10:17:38 -0700
Subject: [PATCH 211/255] Fix LZ4 wrapper deprecation warnings

---
 programs/fileio.c | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/programs/fileio.c b/programs/fileio.c
index 2bf5cb209..70d35ad67 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -534,17 +534,22 @@ static unsigned long long FIO_compressLz4Frame(cRess_t* ress, const char* srcFil
 
     memset(&prefs, 0, sizeof(prefs));
 
+#if LZ4_VERSION_NUMBER <= 10600
+#define LZ4F_blockIndependent blockIndependent
+#define LZ4F_max4MB max4MB
+#endif
+
     prefs.autoFlush = 1;
     prefs.compressionLevel = compressionLevel;
-    prefs.frameInfo.blockMode = blockIndependent; /* stick to defaults for lz4 cli */
-    prefs.frameInfo.blockSizeID = max4MB;
+    prefs.frameInfo.blockMode = LZ4F_blockIndependent; /* stick to defaults for lz4 cli */
+    prefs.frameInfo.blockSizeID = LZ4F_max4MB;
     prefs.frameInfo.contentChecksumFlag = (contentChecksum_t)g_checksumFlag;
 #if LZ4_VERSION_NUMBER >= 10600
     prefs.frameInfo.contentSize = srcFileSize;
 #endif
 
     {
-        size_t blockSize = FIO_LZ4_GetBlockSize_FromBlockId(max4MB);
+        size_t blockSize = FIO_LZ4_GetBlockSize_FromBlockId(LZ4F_max4MB);
         size_t readSize;
         size_t headerSize = LZ4F_compressBegin(ctx, ress->dstBuffer, ress->dstBufferSize, &prefs);
         if (LZ4F_isError(headerSize)) EXM_THROW(33, "File header generation failed : %s", LZ4F_getErrorName(headerSize));

From e42afbc6fa8fee6e93e7216a146a861b6af4684c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 26 Apr 2017 11:39:35 -0700
Subject: [PATCH 212/255] Comply with suggested comments by @terrelln

created FSE_CTABLE_SIZE() and FSE_DTABLE_SIZE()
---
 doc/zstd_manual.html         | 82 ++++++++++++++++++------------------
 lib/common/fse.h             |  4 ++
 lib/common/zstd_internal.h   |  1 -
 lib/compress/zstd_compress.c | 66 ++++++++++++++---------------
 4 files changed, 78 insertions(+), 75 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index d267cfc3c..73e200b4e 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -57,46 +57,46 @@
 <pre><b>size_t ZSTD_compress( void* dst, size_t dstCapacity,
                 const void* src, size_t srcSize,
                       int compressionLevel);
-</b><p>    Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
-    Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
-    @return : compressed size written into `dst` (<= `dstCapacity),
-              or an error code if it fails (which can be tested using ZSTD_isError()). 
+</b><p>  Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
+  Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+  @return : compressed size written into `dst` (<= `dstCapacity),
+            or an error code if it fails (which can be tested using ZSTD_isError()). 
 </p></pre><BR>
 
 <pre><b>size_t ZSTD_decompress( void* dst, size_t dstCapacity,
                   const void* src, size_t compressedSize);
-</b><p>    `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
-    `dstCapacity` is an upper bound of originalSize.
-    If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
-    @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
-              or an errorCode if it fails (which can be tested using ZSTD_isError()). 
+</b><p>  `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
+  `dstCapacity` is an upper bound of originalSize.
+  If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
+  @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
+            or an errorCode if it fails (which can be tested using ZSTD_isError()). 
 </p></pre><BR>
 
 <pre><b>unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
-</b><p>   NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
-   ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
-   frame, but distinguishes empty frames from frames with an unknown size, or errors.
+</b><p>  NOTE: This function is planned to be obsolete, in favour of ZSTD_getFrameContentSize.
+  ZSTD_getFrameContentSize functions the same way, returning the decompressed size of a single
+  frame, but distinguishes empty frames from frames with an unknown size, or errors.
 
-   Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
-   concatenated frames in one buffer, and so is more general.
-   As a result however, it requires more computation and entire frames to be passed to it,
-   as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
+  Additionally, ZSTD_findDecompressedSize can be used instead.  It can handle multiple
+  concatenated frames in one buffer, and so is more general.
+  As a result however, it requires more computation and entire frames to be passed to it,
+  as opposed to ZSTD_getFrameContentSize which requires only a single frame's header.
 
-   'src' is the start of a zstd compressed frame.
-   @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
-    note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
-             When `return==0`, data to decompress could be any size.
-             In which case, it's necessary to use streaming mode to decompress data.
-             Optionally, application can still use ZSTD_decompress() while relying on implied limits.
-             (For example, data may be necessarily cut into blocks <= 16 KB).
-    note 2 : decompressed size is always present when compression is done with ZSTD_compress()
-    note 3 : decompressed size can be very large (64-bits value),
-             potentially larger than what local system can handle as a single memory segment.
-             In which case, it's necessary to use streaming mode to decompress data.
-    note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-             Always ensure result fits within application's authorized limits.
-             Each application can set its own limits.
-    note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. 
+  'src' is the start of a zstd compressed frame.
+  @return : content size to be decompressed, as a 64-bits value _if known_, 0 otherwise.
+   note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
+            When `return==0`, data to decompress could be any size.
+            In which case, it's necessary to use streaming mode to decompress data.
+            Optionally, application can still use ZSTD_decompress() while relying on implied limits.
+            (For example, data may be necessarily cut into blocks <= 16 KB).
+   note 2 : decompressed size is always present when compression is done with ZSTD_compress()
+   note 3 : decompressed size can be very large (64-bits value),
+            potentially larger than what local system can handle as a single memory segment.
+            In which case, it's necessary to use streaming mode to decompress data.
+   note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+            Always ensure result fits within application's authorized limits.
+            Each application can set its own limits.
+   note 5 : when `return==0`, if precise failure cause is needed, use ZSTD_getFrameParams() to know more. 
 </p></pre><BR>
 
 <h3>Helper functions</h3><pre></pre><b><pre>int         ZSTD_maxCLevel(void);               </b>/*!< maximum compression level available */<b>
@@ -106,28 +106,28 @@ const char* ZSTD_getErrorName(size_t code);     </b>/*!< provides readable strin
 </pre></b><BR>
 <a name="Chapter4"></a><h2>Explicit memory management</h2><pre></pre>
 
-<h3>Compression context</h3><pre>   When compressing many times,
-   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-   This will make workload friendlier for system's memory.
-   Use one context per thread for parallel execution in multi-threaded environments. 
+<h3>Compression context</h3><pre>  When compressing many times,
+  it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+  This will make workload friendlier for system's memory.
+  Use one context per thread for parallel execution in multi-threaded environments. 
 </pre><b><pre>typedef struct ZSTD_CCtx_s ZSTD_CCtx;
 ZSTD_CCtx* ZSTD_createCCtx(void);
 size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
 </pre></b><BR>
 <pre><b>size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel);
-</b><p>    Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). 
+</b><p>  Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). 
 </p></pre><BR>
 
-<h3>Decompression context</h3><pre>   When decompressing many times,
-   it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-   This will make workload friendlier for system's memory.
-   Use one context per thread for parallel execution in multi-threaded environments. 
+<h3>Decompression context</h3><pre>  When decompressing many times,
+  it is recommended to allocate a context just once, and re-use it for each successive compression operation.
+  This will make workload friendlier for system's memory.
+  Use one context per thread for parallel execution in multi-threaded environments. 
 </pre><b><pre>typedef struct ZSTD_DCtx_s ZSTD_DCtx;
 ZSTD_DCtx* ZSTD_createDCtx(void);
 size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
 </pre></b><BR>
 <pre><b>size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-</b><p>   Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). 
+</b><p>  Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()). 
 </p></pre><BR>
 
 <a name="Chapter5"></a><h2>Simple dictionary API</h2><pre></pre>
diff --git a/lib/common/fse.h b/lib/common/fse.h
index 4ecd8d741..6d5d41def 100644
--- a/lib/common/fse.h
+++ b/lib/common/fse.h
@@ -316,6 +316,10 @@ If there is an error, the function will return an error code, which can be teste
 #define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue)   (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))
 #define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<<maxTableLog))
 
+/* or use the size to malloc() space directly. Pay attention to alignment restrictions though */
+#define FSE_CTABLE_SIZE(maxTableLog, maxSymbolValue)   (FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) * sizeof(FSE_CTable))
+#define FSE_DTABLE_SIZE(maxTableLog)                   (FSE_DTABLE_SIZE_U32(maxTableLog) * sizeof(FSE_DTable))
+
 
 /* *****************************************
 *  FSE advanced API
diff --git a/lib/common/zstd_internal.h b/lib/common/zstd_internal.h
index 1e2cbd4d7..559d8bec6 100644
--- a/lib/common/zstd_internal.h
+++ b/lib/common/zstd_internal.h
@@ -106,7 +106,6 @@ typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingTy
 #define LONGNBSEQ 0x7F00
 
 #define MINMATCH 3
-#define EQUAL_READ32 4
 
 #define Litbits  8
 #define MaxLit ((1<<Litbits) - 1)
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 4e3760b54..9a2d194ad 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -29,9 +29,9 @@ typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZS
 
 /* entropy tables always have same size */
 static size_t const hufCTable_size = HUF_CTABLE_SIZE(255);
-static size_t const litlengthCTable_size = FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL) * sizeof(FSE_CTable);
-static size_t const offcodeCTable_size = FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff) * sizeof(FSE_CTable);
-static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE_U32(MLFSELog, MaxML) * sizeof(FSE_CTable);
+static size_t const litlengthCTable_size = FSE_CTABLE_SIZE(LLFSELog, MaxLL);
+static size_t const offcodeCTable_size = FSE_CTABLE_SIZE(OffFSELog, MaxOff);
+static size_t const matchlengthCTable_size = FSE_CTABLE_SIZE(MLFSELog, MaxML);
 static size_t const entropyScratchSpace_size = HUF_WORKSPACE_SIZE;
 
 
@@ -102,7 +102,7 @@ struct ZSTD_CCtx_s {
     FSE_CTable* offcodeCTable;
     FSE_CTable* matchlengthCTable;
     FSE_CTable* litlengthCTable;
-    unsigned* tmpCounters;
+    unsigned* entropyScratchSpace;
 };
 
 ZSTD_CCtx* ZSTD_createCCtx(void)
@@ -317,7 +317,7 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
                 zc->litlengthCTable = (FSE_CTable*) ptr;
                 ptr = (char*)ptr + litlengthCTable_size;
                 assert(((size_t)ptr & 3) == 0);   /* ensure correct alignment */
-                zc->tmpCounters = (unsigned*) ptr;
+                zc->entropyScratchSpace = (unsigned*) ptr;
         }   }
 
         /* init params */
@@ -347,8 +347,8 @@ static size_t ZSTD_resetCCtx_internal (ZSTD_CCtx* zc,
         assert((char*)zc->offcodeCTable == (char*)zc->hufCTable + hufCTable_size);
         assert((char*)zc->matchlengthCTable == (char*)zc->offcodeCTable + offcodeCTable_size);
         assert((char*)zc->litlengthCTable == (char*)zc->matchlengthCTable + matchlengthCTable_size);
-        assert((char*)zc->tmpCounters == (char*)zc->litlengthCTable + litlengthCTable_size);
-        ptr = (char*)zc->tmpCounters + entropyScratchSpace_size;
+        assert((char*)zc->entropyScratchSpace == (char*)zc->litlengthCTable + litlengthCTable_size);
+        ptr = (char*)zc->entropyScratchSpace + entropyScratchSpace_size;
 
         /* opt parser space */
         if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
@@ -577,9 +577,9 @@ static size_t ZSTD_compressLiterals (ZSTD_CCtx* zc,
         int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
         if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
         cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat)
+                                      zc->entropyScratchSpace, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat)
                                 : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      zc->tmpCounters, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat);
+                                      zc->entropyScratchSpace, entropyScratchSpace_size, zc->hufCTable, &repeat, preferRepeat);
         if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
         else { zc->hufCTable_repeatMode = HUF_repeat_check; }       /* now have a table to reuse */
     }
@@ -708,7 +708,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
 
     /* CTable for Literal Lengths */
     {   U32 max = MaxLL;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, zc->tmpCounters);
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, zc->entropyScratchSpace);
         if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
             *op++ = llCodeTable[0];
             FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
@@ -732,7 +732,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
 
     /* CTable for Offsets */
     {   U32 max = MaxOff;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, zc->tmpCounters);
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, zc->entropyScratchSpace);
         if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
             *op++ = ofCodeTable[0];
             FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
@@ -756,7 +756,7 @@ MEM_STATIC size_t ZSTD_compressSequences (ZSTD_CCtx* zc,
 
     /* CTable for MatchLengths */
     {   U32 max = MaxML;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, zc->tmpCounters);
+        size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, zc->entropyScratchSpace);
         if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
             *op++ = *mlCodeTable;
             FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
@@ -1564,7 +1564,7 @@ static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx* ctx,
                 if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
                    && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
                     const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t const repLength2 = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch2+EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, lowPrefixPtr) + 4;
                     U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
                     ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
                     hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
@@ -1923,7 +1923,7 @@ size_t ZSTD_HcFindBestMatch_generic (
     const U32 current = (U32)(ip-base);
     const U32 minChain = current > chainSize ? current - chainSize : 0;
     int nbAttempts=maxNbAttempts;
-    size_t ml=EQUAL_READ32-1;
+    size_t ml=4-1;
 
     /* HC4 match finder */
     U32 matchIndex = ZSTD_insertAndFindFirstIndex (zc, ip, mls);
@@ -1938,7 +1938,7 @@ size_t ZSTD_HcFindBestMatch_generic (
         } else {
             match = dictBase + matchIndex;
             if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
-                currentMl = ZSTD_count_2segments(ip+EQUAL_READ32, match+EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
+                currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;
         }
 
         /* save best solution */
@@ -2032,7 +2032,7 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
         /* check repCode */
         if ((offset_1>0) & (MEM_read32(ip+1) == MEM_read32(ip+1 - offset_1))) {
             /* repcode : we take it */
-            matchLength = ZSTD_count(ip+1+EQUAL_READ32, ip+1+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+            matchLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
             if (depth==0) goto _storeSequence;
         }
 
@@ -2043,7 +2043,7 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
                 matchLength = ml2, start = ip, offset=offsetFound;
         }
 
-        if (matchLength < EQUAL_READ32) {
+        if (matchLength < 4) {
             ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
             continue;
         }
@@ -2053,17 +2053,17 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
         while (ip<ilimit) {
             ip ++;
             if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                size_t const mlRep = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+                size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
                 int const gain2 = (int)(mlRep * 3);
                 int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
+                if ((mlRep >= 4) && (gain2 > gain1))
                     matchLength = mlRep, offset = 0, start = ip;
             }
             {   size_t offset2=99999999;
                 size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
                 int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
                 int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                if ((ml2 >= 4) && (gain2 > gain1)) {
                     matchLength = ml2, offset = offset2, start = ip;
                     continue;   /* search a better one */
             }   }
@@ -2072,17 +2072,17 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
             if ((depth==2) && (ip<ilimit)) {
                 ip ++;
                 if ((offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                    size_t const ml2 = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_1, iend) + EQUAL_READ32;
+                    size_t const ml2 = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
                     int const gain2 = (int)(ml2 * 4);
                     int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
+                    if ((ml2 >= 4) && (gain2 > gain1))
                         matchLength = ml2, offset = 0, start = ip;
                 }
                 {   size_t offset2=99999999;
                     size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
                     int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
                     int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                    if ((ml2 >= 4) && (gain2 > gain1)) {
                         matchLength = ml2, offset = offset2, start = ip;
                         continue;
             }   }   }
@@ -2110,7 +2110,7 @@ _storeSequence:
              && ((offset_2>0)
              & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
             /* store sequence */
-            matchLength = ZSTD_count(ip+EQUAL_READ32, ip+EQUAL_READ32-offset_2, iend) + EQUAL_READ32;
+            matchLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
             offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
             ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
             ip += matchLength;
@@ -2199,7 +2199,7 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
             if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
                 /* repcode detected we should take it */
                 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+1+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repEnd, prefixStart) + 4;
                 if (depth==0) goto _storeSequence;
         }   }
 
@@ -2210,7 +2210,7 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                 matchLength = ml2, start = ip, offset=offsetFound;
         }
 
-         if (matchLength < EQUAL_READ32) {
+         if (matchLength < 4) {
             ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
             continue;
         }
@@ -2229,10 +2229,10 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                 if (MEM_read32(ip) == MEM_read32(repMatch)) {
                     /* repcode detected */
                     const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                    size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                    size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
                     int const gain2 = (int)(repLength * 3);
                     int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+                    if ((repLength >= 4) && (gain2 > gain1))
                         matchLength = repLength, offset = 0, start = ip;
             }   }
 
@@ -2241,7 +2241,7 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                 size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
                 int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
                 int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                if ((ml2 >= 4) && (gain2 > gain1)) {
                     matchLength = ml2, offset = offset2, start = ip;
                     continue;   /* search a better one */
             }   }
@@ -2259,10 +2259,10 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                     if (MEM_read32(ip) == MEM_read32(repMatch)) {
                         /* repcode detected */
                         const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                        size_t const repLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                        size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
                         int const gain2 = (int)(repLength * 4);
                         int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                        if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
+                        if ((repLength >= 4) && (gain2 > gain1))
                             matchLength = repLength, offset = 0, start = ip;
                 }   }
 
@@ -2271,7 +2271,7 @@ void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
                     size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
                     int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
                     int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
+                    if ((ml2 >= 4) && (gain2 > gain1)) {
                         matchLength = ml2, offset = offset2, start = ip;
                         continue;
             }   }   }
@@ -2303,7 +2303,7 @@ _storeSequence:
             if (MEM_read32(ip) == MEM_read32(repMatch)) {
                 /* repcode detected we should take it */
                 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+EQUAL_READ32, repMatch+EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
+                matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
                 offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
                 ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
                 ip += matchLength;

From 5087c1761f1dbe4158a4333e6a4b437aacb6d34b Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 26 Apr 2017 13:06:38 -0700
Subject: [PATCH 213/255] Rename ZSTD_create*() to ZSTD_init*()

---
 contrib/linux-kernel/include/linux/zstd.h  | 85 +++++++++++-----------
 contrib/linux-kernel/lib/zstd/compress.c   | 18 ++---
 contrib/linux-kernel/lib/zstd/decompress.c | 20 ++---
 contrib/linux-kernel/test/UserlandTest.cpp | 46 ++++++------
 4 files changed, 85 insertions(+), 84 deletions(-)

diff --git a/contrib/linux-kernel/include/linux/zstd.h b/contrib/linux-kernel/include/linux/zstd.h
index 38b2bca69..ee7bd8207 100644
--- a/contrib/linux-kernel/include/linux/zstd.h
+++ b/contrib/linux-kernel/include/linux/zstd.h
@@ -202,7 +202,7 @@ ZSTD_parameters ZSTD_getParams(int compressionLevel,
  **************************************/
 
 /**
- * ZSTD_CCtxWorkspaceBound() - the amount of memory needed to create a ZSTD_CCtx
+ * ZSTD_CCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_CCtx
  * @cParams: The compression parameters to be used for compression.
  *
  * If multiple compression parameters might be used, the caller must call
@@ -210,7 +210,7 @@ ZSTD_parameters ZSTD_getParams(int compressionLevel,
  * size.
  *
  * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_createCCtx().
+ *           ZSTD_initCCtx().
  */
 size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
 
@@ -222,7 +222,7 @@ size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
  */
 typedef struct ZSTD_CCtx_s ZSTD_CCtx;
 /**
- * ZSTD_createCCtx() - create a zstd compression context
+ * ZSTD_initCCtx() - initialize a zstd compression context
  * @workspace:     The workspace to emplace the context into. It must outlive
  *                 the returned context.
  * @workspaceSize: The size of workspace. Use ZSTD_CCtxWorkspaceBound() to
@@ -230,12 +230,12 @@ typedef struct ZSTD_CCtx_s ZSTD_CCtx;
  *
  * Return:         A compression context emplaced into workspace.
  */
-ZSTD_CCtx *ZSTD_createCCtx(void *workspace, size_t workspaceSize);
+ZSTD_CCtx *ZSTD_initCCtx(void *workspace, size_t workspaceSize);
 
 /**
  * ZSTD_compressCCtx() - compress src into dst
- * @ctx:         The context. Must have been created with a workspace at least
- *               as large as ZSTD_CCtxWorkspaceBound(params.cParams).
+ * @ctx:         The context. Must have been initialized with a workspace at
+ *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
  * @dst:         The buffer to compress src into.
  * @dstCapacity: The size of the destination buffer. May be any size, but
  *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
@@ -250,10 +250,10 @@ size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
 	const void *src, size_t srcSize, ZSTD_parameters params);
 
 /**
- * ZSTD_DCtxWorkspaceBound() - the amount of memory needed to create a ZSTD_DCtx
+ * ZSTD_DCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_DCtx
  *
  * Return: A lower bound on the size of the workspace that is passed to
- *         ZSTD_createDCtx().
+ *         ZSTD_initDCtx().
  */
 size_t ZSTD_DCtxWorkspaceBound(void);
 
@@ -265,7 +265,7 @@ size_t ZSTD_DCtxWorkspaceBound(void);
  */
 typedef struct ZSTD_DCtx_s ZSTD_DCtx;
 /**
- * ZSTD_createDCtx() - create a zstd decompression context
+ * ZSTD_initDCtx() - initialize a zstd decompression context
  * @workspace:     The workspace to emplace the context into. It must outlive
  *                 the returned context.
  * @workspaceSize: The size of workspace. Use ZSTD_DCtxWorkspaceBound() to
@@ -273,7 +273,7 @@ typedef struct ZSTD_DCtx_s ZSTD_DCtx;
  *
  * Return:         A decompression context emplaced into workspace.
  */
-ZSTD_DCtx *ZSTD_createDCtx(void *workspace, size_t workspaceSize);
+ZSTD_DCtx *ZSTD_initDCtx(void *workspace, size_t workspaceSize);
 
 /**
  * ZSTD_decompressDCtx() - decompress zstd compressed src into dst
@@ -298,8 +298,8 @@ size_t ZSTD_decompressDCtx(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
 
 /**
  * ZSTD_compress_usingDict() - compress src into dst using a dictionary
- * @ctx:         The context. Must have been created with a workspace at least
- *               as large as ZSTD_CCtxWorkspaceBound(params.cParams).
+ * @ctx:         The context. Must have been initialized with a workspace at
+ *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
  * @dst:         The buffer to compress src into.
  * @dstCapacity: The size of the destination buffer. May be any size, but
  *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
@@ -344,11 +344,11 @@ size_t ZSTD_decompress_usingDict(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
  ***************************/
 
 /**
- * ZSTD_CDictWorkspaceBound() - amount of memory needed to create a ZSTD_CDict
+ * ZSTD_CDictWorkspaceBound() - memory needed to initialize a ZSTD_CDict
  * @cParams: The compression parameters to be used for compression.
  *
  * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_createCDict().
+ *           ZSTD_initCDict().
  */
 size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
 
@@ -358,7 +358,7 @@ size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
 typedef struct ZSTD_CDict_s ZSTD_CDict;
 
 /**
- * ZSTD_createCDict() - create a digested dictionary for compression
+ * ZSTD_initCDict() - initialize a digested dictionary for compression
  * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
  *                 ZSTD_CDict so it must outlive the returned ZSTD_CDict.
  * @dictSize:      The size of the dictionary.
@@ -373,14 +373,15 @@ typedef struct ZSTD_CDict_s ZSTD_CDict;
  *
  * Return:         The digested dictionary emplaced into workspace.
  */
-ZSTD_CDict *ZSTD_createCDict(const void *dictBuffer, size_t dictSize,
+ZSTD_CDict *ZSTD_initCDict(const void *dictBuffer, size_t dictSize,
 	ZSTD_parameters params, void *workspace, size_t workspaceSize);
 
 /**
  * ZSTD_compress_usingCDict() - compress src into dst using a ZSTD_CDict
- * @ctx:         The context. Must have been created with a workspace at least
- *               as large as ZSTD_CCtxWorkspaceBound(cParams) where cParams are
- *               the compression parameters used to create cdict.
+ * @ctx:         The context. Must have been initialized with a workspace at
+ *               least as large as ZSTD_CCtxWorkspaceBound(cParams) where
+ *               cParams are the compression parameters used to initialize the
+ *               cdict.
  * @dst:         The buffer to compress src into.
  * @dstCapacity: The size of the destination buffer. May be any size, but
  *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
@@ -400,10 +401,10 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
 
 
 /**
- * ZSTD_DDictWorkspaceBound() - amount of memory needed to create a ZSTD_DDict
+ * ZSTD_DDictWorkspaceBound() - memory needed to initialize a ZSTD_DDict
  *
  * Return:  A lower bound on the size of the workspace that is passed to
- *          ZSTD_createDDict().
+ *          ZSTD_initDDict().
  */
 size_t ZSTD_DDictWorkspaceBound(void);
 
@@ -413,7 +414,7 @@ size_t ZSTD_DDictWorkspaceBound(void);
 typedef struct ZSTD_DDict_s ZSTD_DDict;
 
 /**
- * ZSTD_createDDict() - create a digested dictionary for decompression
+ * ZSTD_initDDict() - initialize a digested dictionary for decompression
  * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
  *                 ZSTD_DDict so it must outlive the returned ZSTD_DDict.
  * @dictSize:      The size of the dictionary.
@@ -427,7 +428,7 @@ typedef struct ZSTD_DDict_s ZSTD_DDict;
  *
  * Return:         The digested dictionary emplaced into workspace.
  */
-ZSTD_DDict *ZSTD_createDDict(const void *dictBuffer, size_t dictSize,
+ZSTD_DDict *ZSTD_initDDict(const void *dictBuffer, size_t dictSize,
 	void *workspace, size_t workspaceSize);
 
 /**
@@ -487,7 +488,7 @@ typedef struct ZSTD_outBuffer_s {
  * Streaming compression - HowTo
  *
  * A ZSTD_CStream object is required to track streaming operation.
- * Use ZSTD_createCStream() to create and initialize a ZSTD_CStream object.
+ * Use ZSTD_initCStream() to initialize a ZSTD_CStream object.
  * ZSTD_CStream objects can be reused multiple times on consecutive compression
  * operations. It is recommended to re-use ZSTD_CStream in situations where many
  * streaming operations will be achieved consecutively. Use one separate
@@ -515,11 +516,11 @@ typedef struct ZSTD_outBuffer_s {
  ******************************************************************************/
 
 /**
- * ZSTD_CStreamWorkspaceBound() - memory needed to create a ZSTD_CStream
+ * ZSTD_CStreamWorkspaceBound() - memory needed to initialize a ZSTD_CStream
  * @cParams: The compression parameters to be used for compression.
  *
  * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_createCStream() and ZSTD_createCStream_usingCDict().
+ *           ZSTD_initCStream() and ZSTD_initCStream_usingCDict().
  */
 size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams);
 
@@ -530,7 +531,7 @@ typedef struct ZSTD_CStream_s ZSTD_CStream;
 
 /*===== ZSTD_CStream management functions =====*/
 /**
- * ZSTD_createCStream() - create a zstd streaming compression context
+ * ZSTD_initCStream() - initialize a zstd streaming compression context
  * @params:         The zstd compression parameters.
  * @pledgedSrcSize: If params.fParams.contentSizeFlag == 1 then the caller must
  *                  pass the source size (zero means empty source). Otherwise,
@@ -544,23 +545,23 @@ typedef struct ZSTD_CStream_s ZSTD_CStream;
  *
  * Return:          The zstd streaming compression context.
  */
-ZSTD_CStream *ZSTD_createCStream(ZSTD_parameters params,
+ZSTD_CStream *ZSTD_initCStream(ZSTD_parameters params,
 	unsigned long long pledgedSrcSize, void *workspace,
 	size_t workspaceSize);
 
 /**
- * ZSTD_createCStream_usingCDict() - create a zstd streaming compression context
+ * ZSTD_initCStream_usingCDict() - initialize a streaming compression context
  * @cdict:          The digested dictionary to use for compression.
  * @pledgedSrcSize: Optionally the source size, or zero if unknown.
  * @workspace:      The workspace to emplace the context into. It must outlive
  *                  the returned context.
  * @workspaceSize:  The size of workspace. Call ZSTD_CStreamWorkspaceBound()
- *                  with the cParams used to create the cdict to determine how
- *                  large the workspace must be.
+ *                  with the cParams used to initialize the cdict to determine
+ *                  how large the workspace must be.
  *
  * Return:          The zstd streaming compression context.
  */
-ZSTD_CStream *ZSTD_createCStream_usingCDict(const ZSTD_CDict *cdict,
+ZSTD_CStream *ZSTD_initCStream_usingCDict(const ZSTD_CDict *cdict,
 	unsigned long long pledgedSrcSize, void *workspace,
 	size_t workspaceSize);
 
@@ -646,7 +647,7 @@ size_t ZSTD_CStreamOutSize(void);
  * Streaming decompression - HowTo
  *
  * A ZSTD_DStream object is required to track streaming operations.
- * Use ZSTD_createDStream() to initialize a ZSTD_DStream object.
+ * Use ZSTD_initDStream() to initialize a ZSTD_DStream object.
  * ZSTD_DStream objects can be re-used multiple times.
  *
  * Use ZSTD_decompressStream() repetitively to consume your input.
@@ -660,11 +661,11 @@ size_t ZSTD_CStreamOutSize(void);
  ******************************************************************************/
 
 /**
- * ZSTD_DStreamWorkspaceBound() - memory needed to create a ZSTD_DStream
+ * ZSTD_DStreamWorkspaceBound() - memory needed to initialize a ZSTD_DStream
  * @maxWindowSize: The maximum window size allowed for compressed frames.
  *
  * Return:         A lower bound on the size of the workspace that is passed to
- *                 ZSTD_createDStream() and ZSTD_createDStream_usingDDict().
+ *                 ZSTD_initDStream() and ZSTD_initDStream_usingDDict().
  */
 size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 
@@ -674,7 +675,7 @@ size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
 typedef struct ZSTD_DStream_s ZSTD_DStream;
 /*===== ZSTD_DStream management functions =====*/
 /**
- * ZSTD_createDStream() - create a zstd streaming decompression context
+ * ZSTD_initDStream() - initialize a zstd streaming decompression context
  * @maxWindowSize: The maximum window size allowed for compressed frames.
  * @workspace:     The workspace to emplace the context into. It must outlive
  *                 the returned context.
@@ -684,10 +685,10 @@ typedef struct ZSTD_DStream_s ZSTD_DStream;
  *
  * Return:         The zstd streaming decompression context.
  */
-ZSTD_DStream *ZSTD_createDStream(size_t maxWindowSize, void *workspace,
+ZSTD_DStream *ZSTD_initDStream(size_t maxWindowSize, void *workspace,
 	size_t workspaceSize);
 /**
- * ZSTD_createDStream_usingDDict() - create zstd streaming decompression context
+ * ZSTD_initDStream_usingDDict() - initialize streaming decompression context
  * @maxWindowSize: The maximum window size allowed for compressed frames.
  * @ddict:         The digested dictionary to use for decompression.
  * @workspace:     The workspace to emplace the context into. It must outlive
@@ -698,7 +699,7 @@ ZSTD_DStream *ZSTD_createDStream(size_t maxWindowSize, void *workspace,
  *
  * Return:         The zstd streaming decompression context.
  */
-ZSTD_DStream *ZSTD_createDStream_usingDDict(size_t maxWindowSize,
+ZSTD_DStream *ZSTD_initDStream_usingDDict(size_t maxWindowSize,
 	const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize);
 
 /*===== Streaming decompression functions =====*/
@@ -953,7 +954,7 @@ size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src,
  * Buffer-less streaming compression (synchronous mode)
  *
  * A ZSTD_CCtx object is required to track streaming operations.
- * Use ZSTD_createCCtx() to create a context.
+ * Use ZSTD_initCCtx() to initialize a context.
  * ZSTD_CCtx object can be re-used multiple times within successive compression
  * operations.
  *
@@ -1015,7 +1016,7 @@ size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
  * Buffer-less streaming decompression (synchronous mode)
  *
  * A ZSTD_DCtx object is required to track streaming operations.
- * Use ZSTD_createDCtx() to create a context.
+ * Use ZSTD_initDCtx() to initialize a context.
  * A ZSTD_DCtx object can be re-used multiple times.
  *
  * First typical operation is to retrieve frame parameters, using
@@ -1116,7 +1117,7 @@ ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx);
  *
  * A few rules to respect:
  * - Compressing and decompressing require a context structure
- *   + Use ZSTD_createCCtx() and ZSTD_createDCtx()
+ *   + Use ZSTD_initCCtx() and ZSTD_initDCtx()
  * - It is necessary to init context before starting
  *   + compression : ZSTD_compressBegin()
  *   + decompression : ZSTD_decompressBegin()
diff --git a/contrib/linux-kernel/lib/zstd/compress.c b/contrib/linux-kernel/lib/zstd/compress.c
index 00d18069a..5f6d955a4 100644
--- a/contrib/linux-kernel/lib/zstd/compress.c
+++ b/contrib/linux-kernel/lib/zstd/compress.c
@@ -116,7 +116,7 @@ static ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
 	return cctx;
 }
 
-ZSTD_CCtx* ZSTD_createCCtx(void* workspace, size_t workspaceSize)
+ZSTD_CCtx* ZSTD_initCCtx(void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	ZSTD_CCtx* cctx = ZSTD_createCCtx_advanced(stackMem);
@@ -2819,7 +2819,7 @@ static ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dict
 	}
 }
 
-ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize)
+ZSTD_CDict* ZSTD_initCDict(const void* dict, size_t dictSize, ZSTD_parameters params, void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, stackMem);
@@ -3010,7 +3010,7 @@ static size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
 	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
-ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
+ZSTD_CStream* ZSTD_initCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	ZSTD_CStream* const zcs = ZSTD_createCStream_advanced(stackMem);
@@ -3021,10 +3021,10 @@ ZSTD_CStream* ZSTD_createCStream(ZSTD_parameters params, unsigned long long pled
 	return zcs;
 }
 
-ZSTD_CStream* ZSTD_createCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
+ZSTD_CStream* ZSTD_initCStream_usingCDict(const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, void* workspace, size_t workspaceSize)
 {
 	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-	ZSTD_CStream* const zcs = ZSTD_createCStream(params, pledgedSrcSize, workspace, workspaceSize);
+	ZSTD_CStream* const zcs = ZSTD_initCStream(params, pledgedSrcSize, workspace, workspaceSize);
 	if (zcs) {
 		zcs->cdict = cdict;
 		if (ZSTD_isError(ZSTD_resetCStream_internal(zcs, pledgedSrcSize))) {
@@ -3346,17 +3346,17 @@ EXPORT_SYMBOL(ZSTD_maxCLevel);
 EXPORT_SYMBOL(ZSTD_compressBound);
 
 EXPORT_SYMBOL(ZSTD_CCtxWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createCCtx);
+EXPORT_SYMBOL(ZSTD_initCCtx);
 EXPORT_SYMBOL(ZSTD_compressCCtx);
 EXPORT_SYMBOL(ZSTD_compress_usingDict);
 
 EXPORT_SYMBOL(ZSTD_CDictWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createCDict);
+EXPORT_SYMBOL(ZSTD_initCDict);
 EXPORT_SYMBOL(ZSTD_compress_usingCDict);
 
 EXPORT_SYMBOL(ZSTD_CStreamWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createCStream);
-EXPORT_SYMBOL(ZSTD_createCStream_usingCDict);
+EXPORT_SYMBOL(ZSTD_initCStream);
+EXPORT_SYMBOL(ZSTD_initCStream_usingCDict);
 EXPORT_SYMBOL(ZSTD_resetCStream);
 EXPORT_SYMBOL(ZSTD_compressStream);
 EXPORT_SYMBOL(ZSTD_flushStream);
diff --git a/contrib/linux-kernel/lib/zstd/decompress.c b/contrib/linux-kernel/lib/zstd/decompress.c
index 3fcef0105..94f5fd560 100644
--- a/contrib/linux-kernel/lib/zstd/decompress.c
+++ b/contrib/linux-kernel/lib/zstd/decompress.c
@@ -130,7 +130,7 @@ ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
 	return dctx;
 }
 
-ZSTD_DCtx* ZSTD_createDCtx(void* workspace, size_t workspaceSize)
+ZSTD_DCtx* ZSTD_initDCtx(void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	return ZSTD_createDCtx_advanced(stackMem);
@@ -1968,11 +1968,11 @@ static ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
 	}
 }
 
-/*! ZSTD_createDDict() :
+/*! ZSTD_initDDict() :
 *   Create a digested dictionary, to start decompression without startup delay.
 *   `dict` content is copied inside DDict.
 *   Consequently, `dict` can be released after `ZSTD_DDict` creation */
-ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize, void* workspace, size_t workspaceSize)
+ZSTD_DDict* ZSTD_initDDict(const void* dict, size_t dictSize, void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	return ZSTD_createDDict_advanced(dict, dictSize, 1, stackMem);
@@ -2100,7 +2100,7 @@ static ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
 	return zds;
 }
 
-ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize)
+ZSTD_DStream* ZSTD_initDStream(size_t maxWindowSize, void* workspace, size_t workspaceSize)
 {
 	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
 	ZSTD_DStream* zds = ZSTD_createDStream_advanced(stackMem);
@@ -2117,9 +2117,9 @@ ZSTD_DStream* ZSTD_createDStream(size_t maxWindowSize, void* workspace, size_t w
 	return zds;
 }
 
-ZSTD_DStream* ZSTD_createDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize)
+ZSTD_DStream* ZSTD_initDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict* ddict, void* workspace, size_t workspaceSize)
 {
-	ZSTD_DStream* zds = ZSTD_createDStream(maxWindowSize, workspace, workspaceSize);
+	ZSTD_DStream* zds = ZSTD_initDStream(maxWindowSize, workspace, workspaceSize);
 	if (zds) {
 		zds->ddict = ddict;
 	}
@@ -2337,17 +2337,17 @@ size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inB
 }
 
 EXPORT_SYMBOL(ZSTD_DCtxWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createDCtx);
+EXPORT_SYMBOL(ZSTD_initDCtx);
 EXPORT_SYMBOL(ZSTD_decompressDCtx);
 EXPORT_SYMBOL(ZSTD_decompress_usingDict);
 
 EXPORT_SYMBOL(ZSTD_DDictWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createDDict);
+EXPORT_SYMBOL(ZSTD_initDDict);
 EXPORT_SYMBOL(ZSTD_decompress_usingDDict);
 
 EXPORT_SYMBOL(ZSTD_DStreamWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_createDStream);
-EXPORT_SYMBOL(ZSTD_createDStream_usingDDict);
+EXPORT_SYMBOL(ZSTD_initDStream);
+EXPORT_SYMBOL(ZSTD_initDStream_usingDDict);
 EXPORT_SYMBOL(ZSTD_resetDStream);
 EXPORT_SYMBOL(ZSTD_decompressStream);
 EXPORT_SYMBOL(ZSTD_DStreamInSize);
diff --git a/contrib/linux-kernel/test/UserlandTest.cpp b/contrib/linux-kernel/test/UserlandTest.cpp
index 556abcdaf..73b30be4c 100644
--- a/contrib/linux-kernel/test/UserlandTest.cpp
+++ b/contrib/linux-kernel/test/UserlandTest.cpp
@@ -20,7 +20,7 @@ createCCtx(ZSTD_compressionParameters cParams) {
   size_t const workspaceSize = ZSTD_CCtxWorkspaceBound(cParams);
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_CCtx, WorkspaceDeleter> cctx{
-      ZSTD_createCCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
+      ZSTD_initCCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
   if (!cctx) {
     throw std::runtime_error{"Bad cctx"};
   }
@@ -39,7 +39,7 @@ createDCtx() {
   size_t const workspaceSize = ZSTD_DCtxWorkspaceBound();
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_DCtx, WorkspaceDeleter> dctx{
-      ZSTD_createDCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
+      ZSTD_initDCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
   if (!dctx) {
     throw std::runtime_error{"Bad dctx"};
   }
@@ -51,8 +51,8 @@ createCDict(std::string const& dict, ZSTD_parameters params) {
   size_t const workspaceSize = ZSTD_CDictWorkspaceBound(params.cParams);
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_CDict, WorkspaceDeleter> cdict{
-      ZSTD_createCDict(dict.data(), dict.size(), params, workspace,
-                       workspaceSize),
+      ZSTD_initCDict(dict.data(), dict.size(), params, workspace,
+                     workspaceSize),
       WorkspaceDeleter{workspace}};
   if (!cdict) {
     throw std::runtime_error{"Bad cdict"};
@@ -71,7 +71,7 @@ createDDict(std::string const& dict) {
   size_t const workspaceSize = ZSTD_DDictWorkspaceBound();
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_DDict, WorkspaceDeleter> ddict{
-      ZSTD_createDDict(dict.data(), dict.size(), workspace, workspaceSize),
+      ZSTD_initDDict(dict.data(), dict.size(), workspace, workspaceSize),
       WorkspaceDeleter{workspace}};
   if (!ddict) {
     throw std::runtime_error{"Bad ddict"};
@@ -84,7 +84,7 @@ createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize = 0) {
   size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(params.cParams);
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_CStream, WorkspaceDeleter> zcs{
-      ZSTD_createCStream(params, pledgedSrcSize, workspace, workspaceSize)};
+      ZSTD_initCStream(params, pledgedSrcSize, workspace, workspaceSize)};
   if (!zcs) {
     throw std::runtime_error{"bad cstream"};
   }
@@ -97,8 +97,8 @@ createCStream(ZSTD_compressionParameters cParams, ZSTD_CDict const &cdict,
   size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(cParams);
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_CStream, WorkspaceDeleter> zcs{
-      ZSTD_createCStream_usingCDict(&cdict, pledgedSrcSize, workspace,
-                                    workspaceSize)};
+      ZSTD_initCStream_usingCDict(&cdict, pledgedSrcSize, workspace,
+                                  workspaceSize)};
   if (!zcs) {
     throw std::runtime_error{"bad cstream"};
   }
@@ -118,9 +118,9 @@ createDStream(size_t maxWindowSize = (1ULL << ZSTD_WINDOWLOG_MAX),
   void *workspace = malloc(workspaceSize);
   std::unique_ptr<ZSTD_DStream, WorkspaceDeleter> zds{
       ddict == nullptr
-          ? ZSTD_createDStream(maxWindowSize, workspace, workspaceSize)
-          : ZSTD_createDStream_usingDDict(maxWindowSize, ddict, workspace,
-                                          workspaceSize)};
+          ? ZSTD_initDStream(maxWindowSize, workspace, workspaceSize)
+          : ZSTD_initDStream_usingDDict(maxWindowSize, ddict, workspace,
+                                        workspaceSize)};
   if (!zds) {
     throw std::runtime_error{"bad dstream"};
   }
@@ -333,7 +333,7 @@ TEST(Block, PreprocessedZstdDict) {
   EXPECT_EQ(kData, decompressed);
 }
 
-TEST(Block, RecreateCCtx) {
+TEST(Block, ReinitializeCCtx) {
   auto cctx = createCCtx(1);
   {
     auto const compressed = compress(*cctx, kData, 1);
@@ -346,7 +346,7 @@ TEST(Block, RecreateCCtx) {
   auto raw = cctx.release();
   auto params = ZSTD_getParams(1, 0, 0);
   cctx.reset(
-      ZSTD_createCCtx(d.memory, ZSTD_CCtxWorkspaceBound(params.cParams)));
+      ZSTD_initCCtx(d.memory, ZSTD_CCtxWorkspaceBound(params.cParams)));
   // Repeat
   {
     auto const compressed = compress(*cctx, kData, 1);
@@ -356,7 +356,7 @@ TEST(Block, RecreateCCtx) {
   }
 }
 
-TEST(Block, RecreateDCtx) {
+TEST(Block, ReinitializeDCtx) {
   auto dctx = createDCtx();
   {
     auto cctx = createCCtx(1);
@@ -367,7 +367,7 @@ TEST(Block, RecreateDCtx) {
   // Create the cctx with the same memory
   auto d = dctx.get_deleter();
   auto raw = dctx.release();
-  dctx.reset(ZSTD_createDCtx(d.memory, ZSTD_DCtxWorkspaceBound()));
+  dctx.reset(ZSTD_initDCtx(d.memory, ZSTD_DCtxWorkspaceBound()));
   // Repeat
   {
     auto cctx = createCCtx(1);
@@ -486,24 +486,24 @@ TEST(Stream, Flush) {
 
 TEST(API, Symbols) {
   TEST_SYMBOL(ZSTD_CCtxWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createCCtx);
+  TEST_SYMBOL(ZSTD_initCCtx);
   TEST_SYMBOL(ZSTD_compressCCtx);
   TEST_SYMBOL(ZSTD_compress_usingDict);
   TEST_SYMBOL(ZSTD_DCtxWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createDCtx);
+  TEST_SYMBOL(ZSTD_initDCtx);
   TEST_SYMBOL(ZSTD_decompressDCtx);
   TEST_SYMBOL(ZSTD_decompress_usingDict);
 
   TEST_SYMBOL(ZSTD_CDictWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createCDict);
+  TEST_SYMBOL(ZSTD_initCDict);
   TEST_SYMBOL(ZSTD_compress_usingCDict);
   TEST_SYMBOL(ZSTD_DDictWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createDDict);
+  TEST_SYMBOL(ZSTD_initDDict);
   TEST_SYMBOL(ZSTD_decompress_usingDDict);
 
   TEST_SYMBOL(ZSTD_CStreamWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createCStream);
-  TEST_SYMBOL(ZSTD_createCStream_usingCDict);
+  TEST_SYMBOL(ZSTD_initCStream);
+  TEST_SYMBOL(ZSTD_initCStream_usingCDict);
   TEST_SYMBOL(ZSTD_resetCStream);
   TEST_SYMBOL(ZSTD_compressStream);
   TEST_SYMBOL(ZSTD_flushStream);
@@ -511,8 +511,8 @@ TEST(API, Symbols) {
   TEST_SYMBOL(ZSTD_CStreamInSize);
   TEST_SYMBOL(ZSTD_CStreamOutSize);
   TEST_SYMBOL(ZSTD_DStreamWorkspaceBound);
-  TEST_SYMBOL(ZSTD_createDStream);
-  TEST_SYMBOL(ZSTD_createDStream_usingDDict);
+  TEST_SYMBOL(ZSTD_initDStream);
+  TEST_SYMBOL(ZSTD_initDStream_usingDDict);
   TEST_SYMBOL(ZSTD_resetDStream);
   TEST_SYMBOL(ZSTD_decompressStream);
   TEST_SYMBOL(ZSTD_DStreamInSize);

From 768df129d2c81c5c82b444225f62983e2cf3423e Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 26 Apr 2017 15:42:10 -0700
Subject: [PATCH 214/255] changed ZSTD_compressBegin_usingCDict()

No longer takes `pledgedSrcSize` as argument
this is in line with similar functions ZSTD_compress_usingCDict()
and ZSTD_initCStream_usingCDict().
---
 doc/zstd_manual.html         | 2 +-
 lib/compress/zstd_compress.c | 7 +++----
 lib/zstd.h                   | 2 +-
 3 files changed, 5 insertions(+), 6 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 73e200b4e..0ef9b8385 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -561,7 +561,7 @@ size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
 <h3>Buffer-less streaming compression functions</h3><pre></pre><b><pre>size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
 size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); </b>/**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */<b>
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); </b>/**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */<b>
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict); </b>/**< note: fails if cdict==NULL */<b>
 size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   </b>/* compression parameters are already set within cdict. pledgedSrcSize=0 means null-size */<b>
 size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); </b>/**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */<b>
 </pre></b><BR>
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 9a2d194ad..e4d82661e 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3023,11 +3023,10 @@ size_t ZSTD_compressBegin_usingCDict_advanced(
 /* ZSTD_compressBegin_usingCDict() :
  * pledgedSrcSize=0 means "unknown"
  * if pledgedSrcSize>0, it will enable contentSizeFlag */
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize)
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
 {
-    ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    fParams.contentSizeFlag = (pledgedSrcSize > 0);
-    return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, pledgedSrcSize);
+    ZSTD_frameParameters const fParams = { 0 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, 0);
 }
 
 /*! ZSTD_compress_usingCDict() :
diff --git a/lib/zstd.h b/lib/zstd.h
index a99e497fc..158ff66a1 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -659,7 +659,7 @@ ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
 ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
 ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
-ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize); /**< note: fail if cdict==NULL. pledgedSrcSize can be 0, indicating unknown size.  For 0 size frames, use compressBegin_advanced */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict); /**< note: fails if cdict==NULL */
 ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   /* compression parameters are already set within cdict. pledgedSrcSize=0 means null-size */
 ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize can be 0, indicating unknown size.  if it is non-zero, it must be accurate.  for 0 size frames, use compressBegin_advanced */
 

From 31533bacce265904ecc376206ebf52f4cbb2e0b5 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 00:29:04 -0700
Subject: [PATCH 215/255] Changed ZSTD_createCDict_advanced()

It now only uses compressionParameters as argument.
It produces many changes throughout user code,
though hopefully they tend to be simple :
just provide the cParams part from existing ZSTD_parameters.

Some programs might depend on ZSTD_createCDict_advanced() to pass frame parameters.
This change will force them to revisit this strategy and fix it,
since frame parameters are effectively silently ignored in current version.
---
 doc/zstd_manual.html              |  2 +-
 lib/compress/zstd_compress.c      | 66 +++++++++++++++++++++----------
 lib/compress/zstdmt_compress.c    |  2 +-
 lib/zstd.h                        |  2 +-
 programs/bench.c                  |  2 +-
 programs/fileio.c                 |  1 +
 tests/fuzzer.c                    |  2 +-
 tests/zstreamtest.c               |  2 +-
 zlibWrapper/examples/zwrapbench.c |  2 +-
 9 files changed, 54 insertions(+), 27 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 0ef9b8385..9121b460f 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -400,7 +400,7 @@ typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; v
 </p></pre><BR>
 
 <pre><b>ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize, unsigned byReference,
-                                      ZSTD_parameters params, ZSTD_customMem customMem);
+                                      ZSTD_compressionParameters cParams, ZSTD_customMem customMem);
 </b><p>  Create a ZSTD_CDict using external alloc and free, and customized compression parameters 
 </p></pre><BR>
 
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index e4d82661e..5daa55542 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -20,6 +20,26 @@
 #include "zstd_internal.h"  /* includes zstd.h */
 
 
+/*-*************************************
+*  Debug
+***************************************/
+#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=1)
+#  include <assert.h>
+#else
+#  define assert(condition) ((void)0)
+#endif
+
+#define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
+
+#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=2)
+#  include <stdio.h>
+   static unsigned g_debugLevel = ZSTD_DEBUG;
+#  define DEBUGLOG(l, ...) if (l<=g_debugLevel) { fprintf(stderr, __FILE__ ": "); fprintf(stderr, __VA_ARGS__); fprintf(stderr, " \n"); }
+#else
+#  define DEBUGLOG(l, ...)      {}    /* disabled */
+#endif
+
+
 /*-*************************************
 *  Constants
 ***************************************/
@@ -38,14 +58,6 @@ static size_t const entropyScratchSpace_size = HUF_WORKSPACE_SIZE;
 /*-*************************************
 *  Helper functions
 ***************************************/
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG==1)
-#  include <assert.h>
-#else
-#  define assert(condition) ((void)0)
-#endif
-
-#define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
-
 size_t ZSTD_compressBound(size_t srcSize) {
     size_t const lowLimit = 256 KB;
     size_t const margin = (srcSize < lowLimit) ? (lowLimit-srcSize) >> 12 : 0;  /* from 64 to 0 */
@@ -407,6 +419,7 @@ size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx,
     memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
     {   ZSTD_parameters params = srcCCtx->params;
         params.fParams = fParams;
+        DEBUGLOG(5, "ZSTD_resetCCtx_internal : dictIDFlag : %u \n", !fParams.noDictIDFlag);
         ZSTD_resetCCtx_internal(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
     }
 
@@ -887,7 +900,7 @@ MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const v
         const U32 pos = (U32)((const BYTE*)literals - g_start);
         if (g_start==NULL) g_start = (const BYTE*)literals;
         if ((pos > 1895000) && (pos < 1895300))
-            fprintf(stderr, "Cpos %6u :%5u literals & match %3u bytes at distance %6u \n",
+            DEBUGLOG(5, "Cpos %6u :%5u literals & match %3u bytes at distance %6u \n",
                    pos, (U32)litLength, (U32)matchCode+MINMATCH, (U32)offsetCode);
     }
 #endif
@@ -1049,7 +1062,6 @@ static size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
 {
     switch(mls)
     {
-    //case 3: return ZSTD_hash3Ptr(p, hBits);
     default:
     case 4: return ZSTD_hash4Ptr(p, hBits);
     case 5: return ZSTD_hash5Ptr(p, hBits);
@@ -2503,7 +2515,8 @@ static size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
 static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
                                     ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
 {   BYTE* const op = (BYTE*)dst;
-    U32   const dictIDSizeCode = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
+    U32   const dictIDSizeCodeLength = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
+    U32   const dictIDSizeCode = params.fParams.noDictIDFlag ? 0 : dictIDSizeCodeLength;   /* 0-3 */
     U32   const checksumFlag = params.fParams.checksumFlag>0;
     U32   const windowSize = 1U << params.cParams.windowLog;
     U32   const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
@@ -2515,6 +2528,9 @@ static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
     size_t pos;
 
     if (dstCapacity < ZSTD_frameHeaderSize_max) return ERROR(dstSize_tooSmall);
+    DEBUGLOG(5, "ZSTD_writeFrameHeader : dictIDFlag : %u \n", !params.fParams.noDictIDFlag);
+    DEBUGLOG(5, "ZSTD_writeFrameHeader : dictID : %u \n", dictID);
+    DEBUGLOG(5, "ZSTD_writeFrameHeader : dictIDSizeCode : %u \n", dictIDSizeCode);
 
     MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
     op[4] = frameHeaderDecriptionByte; pos=5;
@@ -2933,7 +2949,7 @@ size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
 }
 
 ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
-                                      ZSTD_parameters params, ZSTD_customMem customMem)
+                                      ZSTD_compressionParameters cParams, ZSTD_customMem customMem)
 {
     if (!customMem.customAlloc && !customMem.customFree) customMem = defaultCustomMem;
     if (!customMem.customAlloc || !customMem.customFree) return NULL;
@@ -2958,7 +2974,11 @@ ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, u
             cdict->dictContent = internalBuffer;
         }
 
-        {   size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
+        {   ZSTD_frameParameters const fParams = { 0 /* contentSizeFlag */, 0 /* checksumFlag */, 0 /* noDictIDFlag */ };   /* dummy */
+            ZSTD_parameters params;
+            params.cParams = cParams;
+            params.fParams = fParams;
+            size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
             if (ZSTD_isError(errorCode)) {
                 ZSTD_free(cdict->dictBuffer, customMem);
                 ZSTD_free(cdict, customMem);
@@ -2975,17 +2995,15 @@ ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, u
 ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
 {
     ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTD_createCDict_advanced(dict, dictSize, 0, params, allocator);
+    ZSTD_compressionParameters cParams = ZSTD_getCParams(compressionLevel, 0, dictSize);
+    return ZSTD_createCDict_advanced(dict, dictSize, 0, cParams, allocator);
 }
 
 ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
 {
     ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTD_createCDict_advanced(dict, dictSize, 1, params, allocator);
+    ZSTD_compressionParameters cParams = ZSTD_getCParams(compressionLevel, 0, dictSize);
+    return ZSTD_createCDict_advanced(dict, dictSize, 1, cParams, allocator);
 }
 
 size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
@@ -3010,6 +3028,7 @@ size_t ZSTD_compressBegin_usingCDict_advanced(
     ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize)
 {
     if (cdict==NULL) return ERROR(GENERIC);  /* does not support NULL cdict */
+    DEBUGLOG(5, "ZSTD_compressBegin_usingCDict_advanced : dictIDFlag == %u \n", !fParams.noDictIDFlag);
     if (cdict->dictContentSize)
         CHECK_F( ZSTD_copyCCtx_internal(cctx, cdict->refContext, fParams, pledgedSrcSize) )
     else {
@@ -3026,6 +3045,7 @@ size_t ZSTD_compressBegin_usingCDict_advanced(
 size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
 {
     ZSTD_frameParameters const fParams = { 0 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    DEBUGLOG(5, "ZSTD_compressBegin_usingCDict : dictIDFlag == %u \n", !fParams.noDictIDFlag);
     return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, 0);
 }
 
@@ -3126,6 +3146,8 @@ static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs, unsigned long long p
 {
     if (zcs->inBuffSize==0) return ERROR(stage_wrong);   /* zcs has not been init at least once => can't reset */
 
+    DEBUGLOG(5, "ZSTD_resetCStream_internal : dictIDFlag == %u \n", !zcs->params.fParams.noDictIDFlag);
+
     if (zcs->cdict) CHECK_F(ZSTD_compressBegin_usingCDict_advanced(zcs->cctx, zcs->cdict, zcs->params.fParams, pledgedSrcSize))
     else CHECK_F(ZSTD_compressBegin_internal(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
 
@@ -3143,6 +3165,7 @@ size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
 {
 
     zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
+    DEBUGLOG(5, "ZSTD_resetCStream : dictIDFlag == %u \n", !zcs->params.fParams.noDictIDFlag);
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
@@ -3178,6 +3201,7 @@ static size_t ZSTD_initCStream_stage2(ZSTD_CStream* zcs,
     zcs->checksum = params.fParams.checksumFlag > 0;
     zcs->params = params;
 
+    DEBUGLOG(5, "ZSTD_initCStream_stage2 : dictIDFlag == %u \n", !params.fParams.noDictIDFlag);
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
@@ -3201,11 +3225,12 @@ static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
 
     if (dict && dictSize >= 8) {
         ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0 /* copy */, params, zcs->customMem);
+        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0 /* copy */, params.cParams, zcs->customMem);
         if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
         zcs->cdict = zcs->cdictLocal;
     }
 
+    DEBUGLOG(5, "ZSTD_initCStream_internal : dictIDFlag == %u \n", !params.fParams.noDictIDFlag);
     return ZSTD_initCStream_stage2(zcs, params, pledgedSrcSize);
 }
 
@@ -3214,6 +3239,7 @@ size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
                                  ZSTD_parameters params, unsigned long long pledgedSrcSize)
 {
     CHECK_F( ZSTD_checkCParams(params.cParams) );
+    DEBUGLOG(5, "ZSTD_initCStream_advanced : dictIDFlag == %u \n", !params.fParams.noDictIDFlag);
     return ZSTD_initCStream_internal(zcs, dict, dictSize, params, pledgedSrcSize);
 }
 
diff --git a/lib/compress/zstdmt_compress.c b/lib/compress/zstdmt_compress.c
index 04a448981..fc7f52a29 100644
--- a/lib/compress/zstdmt_compress.c
+++ b/lib/compress/zstdmt_compress.c
@@ -521,7 +521,7 @@ static size_t ZSTDMT_initCStream_internal(ZSTDMT_CCtx* zcs,
     if (updateDict) {
         ZSTD_freeCDict(zcs->cdict); zcs->cdict = NULL;
         if (dict && dictSize) {
-            zcs->cdict = ZSTD_createCDict_advanced(dict, dictSize, 0, params, cmem);
+            zcs->cdict = ZSTD_createCDict_advanced(dict, dictSize, 0, params.cParams, cmem);
             if (zcs->cdict == NULL) return ERROR(memory_allocation);
     }   }
     zcs->frameContentSize = pledgedSrcSize;
diff --git a/lib/zstd.h b/lib/zstd.h
index 158ff66a1..b7637f0f3 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -488,7 +488,7 @@ ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, siz
 /*! ZSTD_createCDict_advanced() :
  *  Create a ZSTD_CDict using external alloc and free, and customized compression parameters */
 ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize, unsigned byReference,
-                                                  ZSTD_parameters params, ZSTD_customMem customMem);
+                                                  ZSTD_compressionParameters cParams, ZSTD_customMem customMem);
 
 /*! ZSTD_sizeof_CDict() :
  *  Gives the amount of memory used by a given ZSTD_sizeof_CDict */
diff --git a/programs/bench.c b/programs/bench.c
index c3681eb05..22b871952 100644
--- a/programs/bench.c
+++ b/programs/bench.c
@@ -274,7 +274,7 @@ static int BMK_benchMem(const void* srcBuffer, size_t srcSize,
                     if (comprParams->searchLength) zparams.cParams.searchLength = comprParams->searchLength;
                     if (comprParams->targetLength) zparams.cParams.targetLength = comprParams->targetLength;
                     if (comprParams->strategy) zparams.cParams.strategy = (ZSTD_strategy)(comprParams->strategy - 1);
-                    cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams, cmem);
+                    cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams.cParams, cmem);
                     if (cdict==NULL) EXM_THROW(1, "ZSTD_createCDict_advanced() allocation failure");
                     do {
                         U32 blockNb;
diff --git a/programs/fileio.c b/programs/fileio.c
index 70d35ad67..944b11ab4 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -105,6 +105,7 @@ static clock_t g_time = 0;
 #undef MIN
 #define MIN(a,b)    ((a) < (b) ? (a) : (b))
 
+
 /* ************************************************************
 * Avoid fseek()'s 2GiB barrier with MSVC, MacOS, *BSD, MinGW
 ***************************************************************/
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 3123d1825..dd9898d37 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -407,7 +407,7 @@ static int basicUnitTests(U32 seed, double compressibility)
         DISPLAYLEVEL(4, "test%3i : compress with preprocessed dictionary : ", testNb++);
         {   ZSTD_parameters params = ZSTD_getParams(1, CNBuffSize, dictSize);
             {   ZSTD_customMem customMem = { NULL, NULL, NULL };
-                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, params, customMem);
+                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, params.cParams, customMem);
                 cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
                                                  CNBuffer, CNBuffSize, cdict);
                 ZSTD_freeCDict(cdict);
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 4048a7df0..e3bb77d8b 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -453,7 +453,7 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
         ZSTD_CDict* cdict;
         params.fParams.noDictIDFlag = 1;
         params.fParams.contentSizeFlag = 1;  /* test contentSize, should be disabled with initCStream_usingCDict */
-        cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, params, customMem);
+        cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, params.cParams, customMem);
         { size_t const initError = ZSTD_initCStream_usingCDict(zc, cdict);
           if (ZSTD_isError(initError)) goto _output_error; }
         cSize = 0;
diff --git a/zlibWrapper/examples/zwrapbench.c b/zlibWrapper/examples/zwrapbench.c
index 401daa1b5..a57ed51ec 100644
--- a/zlibWrapper/examples/zwrapbench.c
+++ b/zlibWrapper/examples/zwrapbench.c
@@ -236,7 +236,7 @@ static int BMK_benchMem(z_const void* srcBuffer, size_t srcSize,
                 if (compressor == BMK_ZSTD) {
                     ZSTD_parameters const zparams = ZSTD_getParams(cLevel, avgSize, dictBufferSize);
                     ZSTD_customMem const cmem = { NULL, NULL, NULL };
-                    ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams, cmem);
+                    ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictBuffer, dictBufferSize, 1, zparams.cParams, cmem);
                     if (cdict==NULL) EXM_THROW(1, "ZSTD_createCDict_advanced() allocation failure");
 
                     do {

From 69a54d138ac71f5fc7e935a9f373663a644dc591 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 01:10:36 -0700
Subject: [PATCH 216/255] fixed compilation warning :
 declaration-after-statement

---
 lib/common/zstd_internal.h   | 5 +++--
 lib/compress/zstd_compress.c | 4 +---
 2 files changed, 4 insertions(+), 5 deletions(-)

diff --git a/lib/common/zstd_internal.h b/lib/common/zstd_internal.h
index 559d8bec6..9bcb40ffc 100644
--- a/lib/common/zstd_internal.h
+++ b/lib/common/zstd_internal.h
@@ -16,9 +16,10 @@
 #ifdef _MSC_VER    /* Visual Studio */
 #  define FORCE_INLINE static __forceinline
 #  include <intrin.h>                    /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
 #  pragma warning(disable : 4100)        /* disable: C4100: unreferenced formal parameter */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#  pragma warning(disable : 4204)        /* disable: C4204: non-constant aggregate initializer */
+#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
 #else
 #  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
 #    ifdef __GNUC__
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 5daa55542..1ed0715b4 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2975,9 +2975,7 @@ ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, u
         }
 
         {   ZSTD_frameParameters const fParams = { 0 /* contentSizeFlag */, 0 /* checksumFlag */, 0 /* noDictIDFlag */ };   /* dummy */
-            ZSTD_parameters params;
-            params.cParams = cParams;
-            params.fParams = fParams;
+            ZSTD_parameters const params = { cParams, fParams };
             size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
             if (ZSTD_isError(errorCode)) {
                 ZSTD_free(cdict->dictBuffer, customMem);

From 0bd5d25d020b8112993156a6501d7adcea0edaa8 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Thu, 27 Apr 2017 09:55:19 -0700
Subject: [PATCH 217/255] [pzstd] Add logging statements to tests

---
 contrib/pzstd/utils/test/ThreadPoolTest.cpp | 6 +++++-
 contrib/pzstd/utils/test/WorkQueueTest.cpp  | 7 +++++++
 2 files changed, 12 insertions(+), 1 deletion(-)

diff --git a/contrib/pzstd/utils/test/ThreadPoolTest.cpp b/contrib/pzstd/utils/test/ThreadPoolTest.cpp
index 1d857aae8..89085afd4 100644
--- a/contrib/pzstd/utils/test/ThreadPoolTest.cpp
+++ b/contrib/pzstd/utils/test/ThreadPoolTest.cpp
@@ -10,6 +10,7 @@
 
 #include <gtest/gtest.h>
 #include <atomic>
+#include <iostream>
 #include <thread>
 #include <vector>
 
@@ -34,16 +35,19 @@ TEST(ThreadPool, AllJobsFinished) {
   std::atomic<unsigned> numFinished{0};
   std::atomic<bool> start{false};
   {
+    std::cerr << "Creating executor" << std::endl;
     ThreadPool executor(5);
     for (int i = 0; i < 10; ++i) {
       executor.add([ &numFinished, &start ] {
         while (!start.load()) {
-          // spin
+          std::this_thread::yield();
         }
         ++numFinished;
       });
     }
+    std::cerr << "Starting" << std::endl;
     start.store(true);
+    std::cerr << "Finishing" << std::endl;
   }
   EXPECT_EQ(10, numFinished.load());
 }
diff --git a/contrib/pzstd/utils/test/WorkQueueTest.cpp b/contrib/pzstd/utils/test/WorkQueueTest.cpp
index 7f58ccb3f..8caf170d2 100644
--- a/contrib/pzstd/utils/test/WorkQueueTest.cpp
+++ b/contrib/pzstd/utils/test/WorkQueueTest.cpp
@@ -10,6 +10,7 @@
 #include "utils/WorkQueue.h"
 
 #include <gtest/gtest.h>
+#include <iostream>
 #include <memory>
 #include <mutex>
 #include <thread>
@@ -201,11 +202,13 @@ TEST(WorkQueue, BoundedSizeMPMC) {
   WorkQueue<int> queue(10);
   std::vector<int> results(200, -1);
   std::mutex mutex;
+  std::cerr << "Creating popperThreads" << std::endl;
   std::vector<std::thread> popperThreads;
   for (int i = 0; i < 4; ++i) {
     popperThreads.emplace_back(Popper{&queue, results.data(), &mutex});
   }
 
+  std::cerr << "Creating pusherThreads" << std::endl;
   std::vector<std::thread> pusherThreads;
   for (int i = 0; i < 2; ++i) {
     auto min = i * 100;
@@ -218,15 +221,19 @@ TEST(WorkQueue, BoundedSizeMPMC) {
         });
   }
 
+  std::cerr << "Joining pusherThreads" << std::endl;
   for (auto& thread : pusherThreads) {
     thread.join();
   }
+  std::cerr << "Finishing queue" << std::endl;
   queue.finish();
 
+  std::cerr << "Joining popperThreads" << std::endl;
   for (auto& thread : popperThreads) {
     thread.join();
   }
 
+  std::cerr << "Inspecting results" << std::endl;
   for (int i = 0; i < 200; ++i) {
     EXPECT_EQ(i, results[i]);
   }

From f4bd857d8139d81c1f6f72ae15ed746b67197cfc Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 11:31:55 -0700
Subject: [PATCH 218/255] created ZSTD_compress_usingCDict_advanced()

---
 doc/zstd_manual.html         | 19 +++++++++++++------
 lib/compress/zstd_compress.c | 12 ++++++++++--
 lib/zstd.h                   | 19 +++++++++++++------
 tests/fuzzer.c               | 28 ++++++++++++++--------------
 4 files changed, 50 insertions(+), 28 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 9121b460f..6023189ba 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -427,12 +427,19 @@ typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; v
    both values are optional, select `0` if unknown. 
 </p></pre><BR>
 
-<pre><b>size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               ZSTD_parameters params);
-</b><p>   Same as ZSTD_compress_usingDict(), with fine-tune control of each compression parameter 
+<pre><b>size_t ZSTD_compress_advanced (ZSTD_CCtx* cctx,
+                      void* dst, size_t dstCapacity,
+                const void* src, size_t srcSize,
+                const void* dict,size_t dictSize,
+                      ZSTD_parameters params);
+</b><p>   Same as ZSTD_compress_usingDict(), with fine-tune control over each compression parameter 
+</p></pre><BR>
+
+<pre><b>size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
+                      void* dst, size_t dstCapacity,
+                const void* src, size_t srcSize,
+                const ZSTD_CDict* cdict, ZSTD_frameParameters fParams);
+</b><p>   Same as ZSTD_compress_usingDict_advanced(), with fine-tune control over frame parameters 
 </p></pre><BR>
 
 <a name="Chapter15"></a><h2>Advanced decompression functions</h2><pre></pre>
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 1ed0715b4..d8d29bde8 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3047,6 +3047,15 @@ size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
     return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, 0);
 }
 
+size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
+                                void* dst, size_t dstCapacity,
+                                const void* src, size_t srcSize,
+                                const ZSTD_CDict* cdict, ZSTD_frameParameters fParams)
+{
+    CHECK_F (ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
+    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+}
+
 /*! ZSTD_compress_usingCDict() :
  *  Compression using a digested Dictionary.
  *  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
@@ -3058,8 +3067,7 @@ size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
                                 const ZSTD_CDict* cdict)
 {
     ZSTD_frameParameters const fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    CHECK_F (ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
-    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+    return ZSTD_compress_usingCDict_advanced(cctx, dst, dstCapacity, src, srcSize, cdict, fParams);
 }
 
 
diff --git a/lib/zstd.h b/lib/zstd.h
index b7637f0f3..6a21cd65a 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -514,12 +514,19 @@ ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
 ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
 
 /*! ZSTD_compress_advanced() :
-*   Same as ZSTD_compress_usingDict(), with fine-tune control of each compression parameter */
-ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-                                           void* dst, size_t dstCapacity,
-                                     const void* src, size_t srcSize,
-                                     const void* dict,size_t dictSize,
-                                           ZSTD_parameters params);
+*   Same as ZSTD_compress_usingDict(), with fine-tune control over each compression parameter */
+ZSTDLIB_API size_t ZSTD_compress_advanced (ZSTD_CCtx* cctx,
+                                  void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                            const void* dict,size_t dictSize,
+                                  ZSTD_parameters params);
+
+/*! ZSTD_compress_usingCDict_advanced() :
+*   Same as ZSTD_compress_usingCDict(), with fine-tune control over frame parameters */
+ZSTDLIB_API size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
+                                  void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                            const ZSTD_CDict* cdict, ZSTD_frameParameters fParams);
 
 
 /*--- Advanced decompression functions ---*/
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index dd9898d37..1515e6f6d 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -405,9 +405,9 @@ static int basicUnitTests(U32 seed, double compressibility)
         DISPLAYLEVEL(4, "OK \n");
 
         DISPLAYLEVEL(4, "test%3i : compress with preprocessed dictionary : ", testNb++);
-        {   ZSTD_parameters params = ZSTD_getParams(1, CNBuffSize, dictSize);
+        {   ZSTD_compressionParameters cParams = ZSTD_getCParams(1, CNBuffSize, dictSize);
             {   ZSTD_customMem customMem = { NULL, NULL, NULL };
-                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, params.cParams, customMem);
+                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, cParams, customMem);
                 cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
                                                  CNBuffer, CNBuffSize, cdict);
                 ZSTD_freeCDict(cdict);
@@ -760,7 +760,6 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
     for ( ; (testNb <= nbTests) || (FUZ_clockSpan(startClock) < maxClockSpan); testNb++ ) {
         size_t sampleSize, maxTestSize, totalTestSize;
         size_t cSize, totalCSize, totalGenSize;
-        XXH64_state_t xxhState;
         U64 crcOrig;
         BYTE* sampleBuffer;
         const BYTE* dict;
@@ -917,22 +916,22 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
                 CHECK (ZSTD_isError(errorCode), "ZSTD_compressBegin_usingDict error : %s", ZSTD_getErrorName(errorCode));
             } else {
                 ZSTD_compressionParameters const cPar = ZSTD_getCParams(cLevel, 0, dictSize);
-                ZSTD_frameParameters const fpar = { FUZ_rand(&lseed)&1 /* contentSizeFlag */,
+                ZSTD_frameParameters const fPar = { FUZ_rand(&lseed)&1 /* contentSizeFlag */,
                                                     !(FUZ_rand(&lseed)&3) /* contentChecksumFlag*/,
                                                     0 /*NodictID*/ };   /* note : since dictionary is fake, dictIDflag has no impact */
-                ZSTD_parameters p;
-                size_t errorCode;
-                p.cParams = cPar; p.fParams = fpar;
-                errorCode = ZSTD_compressBegin_advanced(refCtx, dict, dictSize, p, 0);
+                ZSTD_parameters const p = { cPar, fPar };
+                size_t const errorCode = ZSTD_compressBegin_advanced(refCtx, dict, dictSize, p, 0);
                 CHECK (ZSTD_isError(errorCode), "ZSTD_compressBegin_advanced error : %s", ZSTD_getErrorName(errorCode));
             }
             {   size_t const errorCode = ZSTD_copyCCtx(ctx, refCtx, 0);
                 CHECK (ZSTD_isError(errorCode), "ZSTD_copyCCtx error : %s", ZSTD_getErrorName(errorCode));
         }   }
-        XXH64_reset(&xxhState, 0);
         ZSTD_setCCtxParameter(ctx, ZSTD_p_forceWindow, FUZ_rand(&lseed) & 1);
+
         {   U32 const nbChunks = (FUZ_rand(&lseed) & 127) + 2;
             U32 n;
+            XXH64_state_t xxhState;
+            XXH64_reset(&xxhState, 0);
             for (totalTestSize=0, cSize=0, n=0 ; n<nbChunks ; n++) {
                 size_t const segmentSize = FUZ_randomLength(&lseed, maxSampleLog);
                 size_t const segmentStart = FUZ_rand(&lseed) % (srcBufferSize - segmentSize);
@@ -947,13 +946,14 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
                 XXH64_update(&xxhState, srcBuffer+segmentStart, segmentSize);
                 memcpy(mirrorBuffer + totalTestSize, srcBuffer+segmentStart, segmentSize);
                 totalTestSize += segmentSize;
-        }   }
+            }
 
-        {   size_t const flushResult = ZSTD_compressEnd(ctx, cBuffer+cSize, cBufferSize-cSize, NULL, 0);
-            CHECK (ZSTD_isError(flushResult), "multi-segments epilogue error : %s", ZSTD_getErrorName(flushResult));
-            cSize += flushResult;
+            {   size_t const flushResult = ZSTD_compressEnd(ctx, cBuffer+cSize, cBufferSize-cSize, NULL, 0);
+                CHECK (ZSTD_isError(flushResult), "multi-segments epilogue error : %s", ZSTD_getErrorName(flushResult));
+                cSize += flushResult;
+            }
+            crcOrig = XXH64_digest(&xxhState);
         }
-        crcOrig = XXH64_digest(&xxhState);
 
         /* streaming decompression test */
         if (dictSize<8) dictSize=0, dict=NULL;   /* disable dictionary */

From 77bf59ef508b1a3b546bdbae821eca94e20a7c92 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 11:43:04 -0700
Subject: [PATCH 219/255] added ZSTD_initCStream_usingCDict_advanced()

---
 doc/zstd_manual.html         |  3 ++-
 lib/compress/zstd_compress.c | 16 ++++++++++++----
 lib/zstd.h                   |  1 +
 3 files changed, 15 insertions(+), 5 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 6023189ba..5a9d1b5d4 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -439,7 +439,7 @@ typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; v
                       void* dst, size_t dstCapacity,
                 const void* src, size_t srcSize,
                 const ZSTD_CDict* cdict, ZSTD_frameParameters fParams);
-</b><p>   Same as ZSTD_compress_usingDict_advanced(), with fine-tune control over frame parameters 
+</b><p>   Same as ZSTD_compress_usingCDict(), with fine-tune control over frame parameters 
 </p></pre><BR>
 
 <a name="Chapter15"></a><h2>Advanced decompression functions</h2><pre></pre>
@@ -511,6 +511,7 @@ size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t di
 size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
                                              ZSTD_parameters params, unsigned long long pledgedSrcSize);  </b>/**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */<b>
 size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  </b>/**< note : cdict will just be referenced, and must outlive compression session */<b>
+size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, ZSTD_frameParameters fParams);  </b>/**< same as ZSTD_initCStream_usingCDict(), with control over frame parameters */<b>
 </pre></b><BR>
 <pre><b>size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);
 </b><p>  start a new compression job, using same parameters from previous job.
diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index d8d29bde8..d6c5fffb7 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3211,17 +3211,25 @@ static size_t ZSTD_initCStream_stage2(ZSTD_CStream* zcs,
     return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
 }
 
-/* note : cdict must outlive compression session */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+/* ZSTD_initCStream_usingCDict_advanced() :
+ * same as ZSTD_initCStream_usingCDict(), with control over frame parameters */
+size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, ZSTD_frameParameters fParams)
 {
     if (!cdict) return ERROR(GENERIC);   /* cannot handle NULL cdict (does not know what to do) */
     {   ZSTD_parameters params = ZSTD_getParamsFromCDict(cdict);
-        params.fParams.contentSizeFlag = 0;
+        params.fParams = fParams;
         zcs->cdict = cdict;
-        return ZSTD_initCStream_stage2(zcs, params, 0);
+        return ZSTD_initCStream_stage2(zcs, params, pledgedSrcSize);
     }
 }
 
+/* note : cdict must outlive compression session */
+size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+{
+    ZSTD_frameParameters const fParams = { 0 /* content */, 0 /* checksum */, 0 /* noDictID */ };
+    return ZSTD_initCStream_usingCDict_advanced(zcs, cdict, 0, fParams);
+}
+
 static size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
                                 const void* dict, size_t dictSize,
                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
diff --git a/lib/zstd.h b/lib/zstd.h
index 6a21cd65a..3852b7200 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -602,6 +602,7 @@ ZSTDLIB_API size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dic
 ZSTDLIB_API size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
                                              ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize is optional and can be 0 (meaning unknown). note: if the contentSizeFlag is set, pledgedSrcSize == 0 means the source size is actually 0 */
 ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
+ZSTDLIB_API size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs, const ZSTD_CDict* cdict, unsigned long long pledgedSrcSize, ZSTD_frameParameters fParams);  /**< same as ZSTD_initCStream_usingCDict(), with control over frame parameters */
 
 /*! ZSTD_resetCStream() :
  *  start a new compression job, using same parameters from previous job.

From 5a804456bc9b2056ce3f7d3ca29fa2440d8f5bc9 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 12:49:22 -0700
Subject: [PATCH 220/255] updated NEWS

---
 NEWS | 27 +++++++++++++++++++++------
 1 file changed, 21 insertions(+), 6 deletions(-)

diff --git a/NEWS b/NEWS
index fe0c64624..3f23d3f41 100644
--- a/NEWS
+++ b/NEWS
@@ -1,6 +1,21 @@
 v1.1.5
-cli : fix : does not output compressed data on console, by Sean Purcell
+cli : changed : Multithreading enabled by default (use target zstd-nomt or HAVE_THREAD=0 to disable)
+cli : new : command -T0 means "detect and use nb of cores", by Sean Purcell
+cli : new : zstdmt symlink hardwired to `zstd -T0`
+cli : new : experimental target `zstd4`, with support for lz4 format, by Sean Purcell
+cli : fix : does not output compressed data on console
+cli : fix : ignore symbolic links unless --force specified,
+API : breaking change : ZSTD_createCDict_advanced(), only use compressionParameters as argument
+API : changed : added prototypes ZSTD_*_usingCDict_advanced(), for direct control over frameParameters.
+API : changed : enforced consistent rules for pledgedSrcSize==0
+API : improved: ZSTDMT_compressCCtx() reduced memory usage
+API : fix : ZSTDMT_compressCCtx() now provides srcSize in header (#634)
+API : fix : src size stored in frame header is controlled at end of frame
+API : fix : ensure error code "dstSizeTooSmall" is generated when dst size is too small
 build: improved cmake script, by @Majlen
+build: enabled Multi-threading support for *BSD, by Baptiste Daroussin
+tools: updated Paramgrill. Command -O# provides best parameters for sample and speed target.
+new : contrib/linux-kernel version, by Nick Terrell
 
 v1.1.4
 cli : new : can compress in *.gz format, using --format=gzip command, by Przemyslaw Skibinski
@@ -9,13 +24,13 @@ cli : fix : write on sparse-enabled file systems in 32-bits mode, by @ds77
 cli : fix : --rm remains silent when input is stdin
 cli : experimental : xzstd, with support for xz/lzma decoding, by Przemyslaw Skibinski
 speed : improved decompression speed in streaming mode for single shot scenarios (+5%)
-memory : DDict (decompression dictionary) memory usage down from 150 KB to 20 KB
-arch : 32-bits variant able to generate and decode very long matches (>32 MB), by Sean Purcell
+memory: DDict (decompression dictionary) memory usage down from 150 KB to 20 KB
+arch: 32-bits variant able to generate and decode very long matches (>32 MB), by Sean Purcell
 API : new : ZSTD_findFrameCompressedSize(), ZSTD_getFrameContentSize(), ZSTD_findDecompressedSize()
 API : changed : dropped support of legacy versions <= v0.3 (can be changed by modifying ZSTD_LEGACY_SUPPORT value)
-build: new: meson build system in contrib/meson, by Dima Krasner
-build: improved cmake script, by @Majlen
-build: added -Wformat-security flag, as recommended by Padraig Brady
+build : new: meson build system in contrib/meson, by Dima Krasner
+build : improved cmake script, by @Majlen
+build : added -Wformat-security flag, as recommended by Padraig Brady
 doc : new : educational decoder, by Sean Purcell
 
 v1.1.3

From 8b669535f899725bf5bcb9547ffb8427751c03d1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 12:50:20 -0700
Subject: [PATCH 221/255] bumped version number to v1.2.0

---
 NEWS                 | 2 +-
 doc/zstd_manual.html | 4 ++--
 lib/zstd.h           | 4 ++--
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/NEWS b/NEWS
index 3f23d3f41..4f9bd2eff 100644
--- a/NEWS
+++ b/NEWS
@@ -1,4 +1,4 @@
-v1.1.5
+v1.2.0
 cli : changed : Multithreading enabled by default (use target zstd-nomt or HAVE_THREAD=0 to disable)
 cli : new : command -T0 means "detect and use nb of cores", by Sean Purcell
 cli : new : zstdmt symlink hardwired to `zstd -T0`
diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 73e200b4e..5bfd4e291 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -1,10 +1,10 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>zstd 1.1.5 Manual</title>
+<title>zstd 1.2.0 Manual</title>
 </head>
 <body>
-<h1>zstd 1.1.5 Manual</h1>
+<h1>zstd 1.2.0 Manual</h1>
 <hr>
 <a name="Contents"></a><h2>Contents</h2>
 <ol>
diff --git a/lib/zstd.h b/lib/zstd.h
index a99e497fc..88ce6c693 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -55,8 +55,8 @@ extern "C" {
 
 /*------   Version   ------*/
 #define ZSTD_VERSION_MAJOR    1
-#define ZSTD_VERSION_MINOR    1
-#define ZSTD_VERSION_RELEASE  5
+#define ZSTD_VERSION_MINOR    2
+#define ZSTD_VERSION_RELEASE  0
 
 #define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE
 #define ZSTD_QUOTE(str) #str

From 1c3ab0c77f7924ee2a9f2206ceb5416ea6108ea5 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 12:57:11 -0700
Subject: [PATCH 222/255] fixed init error on Visual 2008

---
 lib/compress/zstd_compress.c | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index d6c5fffb7..518358711 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -2948,6 +2948,14 @@ size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
     return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
 }
 
+static ZSTD_parameters ZSTD_makeParams(ZSTD_compressionParameters cParams, ZSTD_frameParameters fParams)
+{
+    ZSTD_parameters params;
+    params.cParams = cParams;
+    params.fParams = fParams;
+    return params;
+}
+
 ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, unsigned byReference,
                                       ZSTD_compressionParameters cParams, ZSTD_customMem customMem)
 {
@@ -2975,7 +2983,7 @@ ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize, u
         }
 
         {   ZSTD_frameParameters const fParams = { 0 /* contentSizeFlag */, 0 /* checksumFlag */, 0 /* noDictIDFlag */ };   /* dummy */
-            ZSTD_parameters const params = { cParams, fParams };
+            ZSTD_parameters const params = ZSTD_makeParams(cParams, fParams);
             size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
             if (ZSTD_isError(errorCode)) {
                 ZSTD_free(cdict->dictBuffer, customMem);

From 7321345fd2d70ae25187aaa0c437ec1b01827fb2 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 14:19:34 -0700
Subject: [PATCH 223/255] fixed another VS2008 init error

---
 tests/fuzzer.c | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 1515e6f6d..dadf42c9f 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -697,6 +697,14 @@ static size_t findDiff(const void* buf1, const void* buf2, size_t max)
 }
 
 
+static ZSTD_parameters FUZ_makeParams(ZSTD_compressionParameters cParams, ZSTD_frameParameters fParams)
+{
+    ZSTD_parameters params;
+    params.cParams = cParams;
+    params.fParams = fParams;
+    return params;
+}
+
 static size_t FUZ_rLogLength(U32* seed, U32 logLength)
 {
     size_t const lengthMask = ((size_t)1 << logLength) - 1;
@@ -919,7 +927,7 @@ static int fuzzerTests(U32 seed, U32 nbTests, unsigned startTest, U32 const maxD
                 ZSTD_frameParameters const fPar = { FUZ_rand(&lseed)&1 /* contentSizeFlag */,
                                                     !(FUZ_rand(&lseed)&3) /* contentChecksumFlag*/,
                                                     0 /*NodictID*/ };   /* note : since dictionary is fake, dictIDflag has no impact */
-                ZSTD_parameters const p = { cPar, fPar };
+                ZSTD_parameters const p = FUZ_makeParams(cPar, fPar);
                 size_t const errorCode = ZSTD_compressBegin_advanced(refCtx, dict, dictSize, p, 0);
                 CHECK (ZSTD_isError(errorCode), "ZSTD_compressBegin_advanced error : %s", ZSTD_getErrorName(errorCode));
             }

From d3694e6c70702502d7704ec4af5426b488836528 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 14:29:35 -0700
Subject: [PATCH 224/255] removed C4204

---
 lib/common/zstd_internal.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/lib/common/zstd_internal.h b/lib/common/zstd_internal.h
index 9bcb40ffc..2533333ba 100644
--- a/lib/common/zstd_internal.h
+++ b/lib/common/zstd_internal.h
@@ -18,7 +18,6 @@
 #  include <intrin.h>                    /* For Visual 2005 */
 #  pragma warning(disable : 4100)        /* disable: C4100: unreferenced formal parameter */
 #  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4204)        /* disable: C4204: non-constant aggregate initializer */
 #  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
 #else
 #  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */

From 2f73427d35863b83a057dda3c2cb2794cf446f90 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 14:39:39 -0700
Subject: [PATCH 225/255] added test for ZSTD_compress_usingCDict_advanced()

---
 tests/fuzzer.c | 41 +++++++++++++++++++++++++++++++++--------
 1 file changed, 33 insertions(+), 8 deletions(-)

diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index dadf42c9f..687e7a371 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -405,14 +405,13 @@ static int basicUnitTests(U32 seed, double compressibility)
         DISPLAYLEVEL(4, "OK \n");
 
         DISPLAYLEVEL(4, "test%3i : compress with preprocessed dictionary : ", testNb++);
-        {   ZSTD_compressionParameters cParams = ZSTD_getCParams(1, CNBuffSize, dictSize);
-            {   ZSTD_customMem customMem = { NULL, NULL, NULL };
-                ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, cParams, customMem);
-                cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
+        {   ZSTD_compressionParameters const cParams = ZSTD_getCParams(1, CNBuffSize, dictSize);
+            ZSTD_customMem customMem = { NULL, NULL, NULL };
+            ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, cParams, customMem);
+            cSize = ZSTD_compress_usingCDict(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
                                                  CNBuffer, CNBuffSize, cdict);
-                ZSTD_freeCDict(cdict);
-                if (ZSTD_isError(cSize)) goto _output_error;
-            }
+            ZSTD_freeCDict(cdict);
+            if (ZSTD_isError(cSize)) goto _output_error;
         }
         DISPLAYLEVEL(4, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBuffSize*100);
 
@@ -430,7 +429,33 @@ static int basicUnitTests(U32 seed, double compressibility)
                   if (r != CNBuffSize) goto _output_error);
         DISPLAYLEVEL(4, "OK \n");
 
-        DISPLAYLEVEL(4, "test%3i : compress without dictID : ", testNb++);
+        DISPLAYLEVEL(4, "test%3i : ZSTD_compress_usingCDict_advanced, no contentSize, no dictID : ", testNb++);
+        {   ZSTD_frameParameters const fParams = { 0 /* frameSize */, 1 /* checksum */, 1 /* noDictID*/ };
+            ZSTD_compressionParameters const cParams = ZSTD_getCParams(1, CNBuffSize, dictSize);
+            ZSTD_customMem const customMem = { NULL, NULL, NULL };
+            ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictBuffer, dictSize, 1, cParams, customMem);
+            cSize = ZSTD_compress_usingCDict_advanced(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),
+                                                 CNBuffer, CNBuffSize, cdict, fParams);
+            ZSTD_freeCDict(cdict);
+            if (ZSTD_isError(cSize)) goto _output_error;
+        }
+        DISPLAYLEVEL(4, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBuffSize*100);
+
+        DISPLAYLEVEL(4, "test%3i : try retrieving contentSize from frame : ", testNb++);
+        {   U64 const contentSize = ZSTD_getFrameContentSize(compressedBuffer, cSize);
+            if (contentSize != ZSTD_CONTENTSIZE_UNKNOWN) goto _output_error;
+        }
+        DISPLAYLEVEL(4, "OK (unknown)\n");
+
+        DISPLAYLEVEL(4, "test%3i : frame built without dictID should be decompressible : ", testNb++);
+        CHECKPLUS(r, ZSTD_decompress_usingDict(dctx,
+                                       decodedBuffer, CNBuffSize,
+                                       compressedBuffer, cSize,
+                                       dictBuffer, dictSize),
+                  if (r != CNBuffSize) goto _output_error);
+        DISPLAYLEVEL(4, "OK \n");
+
+        DISPLAYLEVEL(4, "test%3i : ZSTD_compress_advanced, no dictID : ", testNb++);
         {   ZSTD_parameters p = ZSTD_getParams(3, CNBuffSize, dictSize);
             p.fParams.noDictIDFlag = 1;
             cSize = ZSTD_compress_advanced(cctx, compressedBuffer, ZSTD_compressBound(CNBuffSize),

From 7d283cdfa230c5884c56c0d59563a0ebb6684a39 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 14:48:34 -0700
Subject: [PATCH 226/255] added test for ZSTD_initCStream_usingCDict_advanced()

---
 tests/zstreamtest.c | 14 ++++++--------
 1 file changed, 6 insertions(+), 8 deletions(-)

diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index e3bb77d8b..6d9694e45 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -448,14 +448,12 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
       if (!ZSTD_isError(r)) goto _output_error;  /* must fail : frame requires > 100 bytes */
       DISPLAYLEVEL(3, "OK (%s)\n", ZSTD_getErrorName(r)); }
 
-    DISPLAYLEVEL(3, "test%3i : dictionary compression with masked dictID : ", testNb++);
-    {   ZSTD_parameters params = ZSTD_getParams(1, CNBufferSize, dictionary.filled);
-        ZSTD_CDict* cdict;
-        params.fParams.noDictIDFlag = 1;
-        params.fParams.contentSizeFlag = 1;  /* test contentSize, should be disabled with initCStream_usingCDict */
-        cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, params.cParams, customMem);
-        { size_t const initError = ZSTD_initCStream_usingCDict(zc, cdict);
-          if (ZSTD_isError(initError)) goto _output_error; }
+    DISPLAYLEVEL(3, "test%3i : ZSTD_initCStream_usingCDict_advanced with masked dictID : ", testNb++);
+    {   ZSTD_compressionParameters const cParams = ZSTD_getCParams(1, CNBufferSize, dictionary.filled);
+        ZSTD_frameParameters const fParams = { 1 /* contentSize */, 1 /* checksum */, 1 /* noDictID */};
+        ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, cParams, customMem);
+        size_t const initError = ZSTD_initCStream_usingCDict_advanced(zc, cdict, CNBufferSize, fParams);
+        if (ZSTD_isError(initError)) goto _output_error;
         cSize = 0;
         outBuff.dst = compressedBuffer;
         outBuff.size = compressedBufferSize;

From 32c658a2898e37f3e78ba64efff5fdc061389a36 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 27 Apr 2017 15:04:31 -0700
Subject: [PATCH 227/255] SquashFS linux kernel patch

---
 .../linux-kernel/fs/squashfs/zstd_wrapper.c   | 146 +++++++++++
 contrib/linux-kernel/squashfs.diff            | 242 ++++++++++++++++++
 2 files changed, 388 insertions(+)
 create mode 100644 contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
 create mode 100644 contrib/linux-kernel/squashfs.diff

diff --git a/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
new file mode 100644
index 000000000..81f4b5a4b
--- /dev/null
+++ b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
@@ -0,0 +1,146 @@
+/*
+ * Squashfs - a compressed read only filesystem for Linux
+ *
+ * Copyright (c) 2017 Facebook
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2,
+ * or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
+ *
+ * zstd_wrapper.c
+ */
+
+#include <linux/mutex.h>
+#include <linux/buffer_head.h>
+#include <linux/slab.h>
+#include <linux/zstd.h>
+#include <linux/vmalloc.h>
+
+#include "squashfs_fs.h"
+#include "squashfs_fs_sb.h"
+#include "squashfs.h"
+#include "decompressor.h"
+#include "page_actor.h"
+
+struct workspace {
+	void *mem;
+	size_t mem_size;
+};
+
+static void *zstd_init(struct squashfs_sb_info *msblk, void *buff)
+{
+	struct workspace *wksp = kmalloc(sizeof(*wksp), GFP_KERNEL);
+	if (wksp == NULL)
+		goto failed;
+	wksp->mem_size = ZSTD_DStreamWorkspaceBound(max_t(size_t,
+				msblk->block_size, SQUASHFS_METADATA_SIZE));
+	wksp->mem = vmalloc(wksp->mem_size);
+	if (wksp->mem == NULL)
+		goto failed;
+
+	return wksp;
+
+failed:
+	ERROR("Failed to allocate zstd workspace\n");
+	kfree(wksp);
+	return ERR_PTR(-ENOMEM);
+}
+
+
+static void zstd_free(void *strm)
+{
+	struct workspace *wksp = strm;
+
+	if (wksp)
+		vfree(wksp->mem);
+	kfree(wksp);
+}
+
+
+static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
+	struct buffer_head **bh, int b, int offset, int length,
+	struct squashfs_page_actor *output)
+{
+	struct workspace *wksp = strm;
+	ZSTD_DStream *stream;
+	size_t total_out = 0;
+	size_t zstd_err;
+	int k = 0;
+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
+
+	stream = ZSTD_initDStream(wksp->mem_size, wksp->mem, wksp->mem_size);
+
+	if (!stream) {
+		ERROR("Failed to initialize zstd decompressor\n");
+		goto out;
+	}
+
+	out_buf.size = PAGE_SIZE;
+	out_buf.dst = squashfs_first_page(output);
+
+	do {
+		if (in_buf.pos == in_buf.size && k < b) {
+			int avail = min(length, msblk->devblksize - offset);
+			length -= avail;
+			in_buf.src = bh[k]->b_data + offset;
+			in_buf.size = avail;
+			in_buf.pos = 0;
+			offset = 0;
+		}
+
+		if (out_buf.pos == out_buf.size) {
+			out_buf.dst = squashfs_next_page(output);
+			out_buf.pos = 0;
+			if (out_buf.dst != NULL) {
+				out_buf.size = PAGE_SIZE;
+			} else {
+				out_buf.size = 0;
+			}
+		}
+
+		total_out -= out_buf.pos;
+		zstd_err = ZSTD_decompressStream(stream, &out_buf, &in_buf);
+		total_out += out_buf.pos; /* add the additional data produced */
+
+		if (in_buf.pos == in_buf.size && k < b)
+			put_bh(bh[k++]);
+	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
+
+	if (ZSTD_isError(zstd_err)) {
+		ERROR("zstd decompression error: %d\n",
+				(int)ZSTD_getErrorCode(zstd_err));
+	}
+
+	squashfs_finish_page(output);
+
+	if (k < b)
+		goto out;
+
+	return total_out;
+
+out:
+	for (; k < b; k++)
+		put_bh(bh[k]);
+
+	return -EIO;
+}
+
+const struct squashfs_decompressor squashfs_zstd_comp_ops = {
+	.init = zstd_init,
+	.free = zstd_free,
+	.decompress = zstd_uncompress,
+	.id = ZSTD_COMPRESSION,
+	.name = "zstd",
+	.supported = 1
+};
diff --git a/contrib/linux-kernel/squashfs.diff b/contrib/linux-kernel/squashfs.diff
new file mode 100644
index 000000000..e1e1235f0
--- /dev/null
+++ b/contrib/linux-kernel/squashfs.diff
@@ -0,0 +1,242 @@
+commit 7289653483a0579c3b63a06abf008210c8cc6c8b
+Author: Sean Purcell <me@seanp.xyz>
+Date:   Thu Apr 27 14:56:25 2017 -0700
+
+    Add zstd support to kernel squashfs
+
+diff --git a/fs/squashfs/Kconfig b/fs/squashfs/Kconfig
+index ffb093e..1adb334 100644
+--- a/fs/squashfs/Kconfig
++++ b/fs/squashfs/Kconfig
+@@ -165,6 +165,20 @@ config SQUASHFS_XZ
+ 
+ 	  If unsure, say N.
+ 
++config SQUASHFS_ZSTD
++	bool "Include support for ZSTD compressed file systems"
++	depends on SQUASHFS
++	select ZSTD_DECOMPRESS
++	help
++	  Saying Y here includes support for reading Squashfs file systems
++	  compressed with ZSTD compression.  ZSTD gives better compression than
++	  the default ZLIB compression, while using less CPU.
++
++	  ZSTD is not the standard compression used in Squashfs and so most
++	  file systems will be readable without selecting this option.
++
++	  If unsure, say N.
++
+ config SQUASHFS_4K_DEVBLK_SIZE
+ 	bool "Use 4K device block size?"
+ 	depends on SQUASHFS
+diff --git a/fs/squashfs/Makefile b/fs/squashfs/Makefile
+index 246a6f3..6655631 100644
+--- a/fs/squashfs/Makefile
++++ b/fs/squashfs/Makefile
+@@ -15,3 +15,4 @@ squashfs-$(CONFIG_SQUASHFS_LZ4) += lz4_wrapper.o
+ squashfs-$(CONFIG_SQUASHFS_LZO) += lzo_wrapper.o
+ squashfs-$(CONFIG_SQUASHFS_XZ) += xz_wrapper.o
+ squashfs-$(CONFIG_SQUASHFS_ZLIB) += zlib_wrapper.o
++squashfs-$(CONFIG_SQUASHFS_ZSTD) += zstd_wrapper.o
+diff --git a/fs/squashfs/decompressor.c b/fs/squashfs/decompressor.c
+index d2bc136..8366398 100644
+--- a/fs/squashfs/decompressor.c
++++ b/fs/squashfs/decompressor.c
+@@ -65,6 +65,12 @@ static const struct squashfs_decompressor squashfs_zlib_comp_ops = {
+ };
+ #endif
+ 
++#ifndef CONFIG_SQUASHFS_ZSTD
++static const struct squashfs_decompressor squashfs_zstd_comp_ops = {
++	NULL, NULL, NULL, NULL, ZSTD_COMPRESSION, "zstd", 0
++};
++#endif
++
+ static const struct squashfs_decompressor squashfs_unknown_comp_ops = {
+ 	NULL, NULL, NULL, NULL, 0, "unknown", 0
+ };
+@@ -75,6 +81,7 @@ static const struct squashfs_decompressor *decompressor[] = {
+ 	&squashfs_lzo_comp_ops,
+ 	&squashfs_xz_comp_ops,
+ 	&squashfs_lzma_unsupported_comp_ops,
++	&squashfs_zstd_comp_ops,
+ 	&squashfs_unknown_comp_ops
+ };
+ 
+diff --git a/fs/squashfs/decompressor.h b/fs/squashfs/decompressor.h
+index a25713c..0f5a8e4 100644
+--- a/fs/squashfs/decompressor.h
++++ b/fs/squashfs/decompressor.h
+@@ -58,4 +58,8 @@ extern const struct squashfs_decompressor squashfs_lzo_comp_ops;
+ extern const struct squashfs_decompressor squashfs_zlib_comp_ops;
+ #endif
+ 
++#ifdef CONFIG_SQUASHFS_ZSTD
++extern const struct squashfs_decompressor squashfs_zstd_comp_ops;
++#endif
++
+ #endif
+diff --git a/fs/squashfs/squashfs_fs.h b/fs/squashfs/squashfs_fs.h
+index 506f4ba..24d12fd 100644
+--- a/fs/squashfs/squashfs_fs.h
++++ b/fs/squashfs/squashfs_fs.h
+@@ -241,6 +241,7 @@ struct meta_index {
+ #define LZO_COMPRESSION		3
+ #define XZ_COMPRESSION		4
+ #define LZ4_COMPRESSION		5
++#define ZSTD_COMPRESSION	6
+ 
+ struct squashfs_super_block {
+ 	__le32			s_magic;
+diff --git a/fs/squashfs/zstd_wrapper.c b/fs/squashfs/zstd_wrapper.c
+new file mode 100644
+index 0000000..81f4b5a
+--- /dev/null
++++ b/fs/squashfs/zstd_wrapper.c
+@@ -0,0 +1,146 @@
++/*
++ * Squashfs - a compressed read only filesystem for Linux
++ *
++ * Copyright (c) 2017 Facebook
++ *
++ * This program is free software; you can redistribute it and/or
++ * modify it under the terms of the GNU General Public License
++ * as published by the Free Software Foundation; either version 2,
++ * or (at your option) any later version.
++ *
++ * This program is distributed in the hope that it will be useful,
++ * but WITHOUT ANY WARRANTY; without even the implied warranty of
++ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
++ * GNU General Public License for more details.
++ *
++ * You should have received a copy of the GNU General Public License
++ * along with this program; if not, write to the Free Software
++ * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
++ *
++ * zstd_wrapper.c
++ */
++
++#include <linux/mutex.h>
++#include <linux/buffer_head.h>
++#include <linux/slab.h>
++#include <linux/zstd.h>
++#include <linux/vmalloc.h>
++
++#include "squashfs_fs.h"
++#include "squashfs_fs_sb.h"
++#include "squashfs.h"
++#include "decompressor.h"
++#include "page_actor.h"
++
++struct workspace {
++	void *mem;
++	size_t mem_size;
++};
++
++static void *zstd_init(struct squashfs_sb_info *msblk, void *buff)
++{
++	struct workspace *wksp = kmalloc(sizeof(*wksp), GFP_KERNEL);
++	if (wksp == NULL)
++		goto failed;
++	wksp->mem_size = ZSTD_DStreamWorkspaceBound(max_t(size_t,
++				msblk->block_size, SQUASHFS_METADATA_SIZE));
++	wksp->mem = vmalloc(wksp->mem_size);
++	if (wksp->mem == NULL)
++		goto failed;
++
++	return wksp;
++
++failed:
++	ERROR("Failed to allocate zstd workspace\n");
++	kfree(wksp);
++	return ERR_PTR(-ENOMEM);
++}
++
++
++static void zstd_free(void *strm)
++{
++	struct workspace *wksp = strm;
++
++	if (wksp)
++		vfree(wksp->mem);
++	kfree(wksp);
++}
++
++
++static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
++	struct buffer_head **bh, int b, int offset, int length,
++	struct squashfs_page_actor *output)
++{
++	struct workspace *wksp = strm;
++	ZSTD_DStream *stream;
++	size_t total_out = 0;
++	size_t zstd_err;
++	int k = 0;
++	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
++	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
++
++	stream = ZSTD_initDStream(wksp->mem_size, wksp->mem, wksp->mem_size);
++
++	if (!stream) {
++		ERROR("Failed to initialize zstd decompressor\n");
++		goto out;
++	}
++
++	out_buf.size = PAGE_SIZE;
++	out_buf.dst = squashfs_first_page(output);
++
++	do {
++		if (in_buf.pos == in_buf.size && k < b) {
++			int avail = min(length, msblk->devblksize - offset);
++			length -= avail;
++			in_buf.src = bh[k]->b_data + offset;
++			in_buf.size = avail;
++			in_buf.pos = 0;
++			offset = 0;
++		}
++
++		if (out_buf.pos == out_buf.size) {
++			out_buf.dst = squashfs_next_page(output);
++			out_buf.pos = 0;
++			if (out_buf.dst != NULL) {
++				out_buf.size = PAGE_SIZE;
++			} else {
++				out_buf.size = 0;
++			}
++		}
++
++		total_out -= out_buf.pos;
++		zstd_err = ZSTD_decompressStream(stream, &out_buf, &in_buf);
++		total_out += out_buf.pos; /* add the additional data produced */
++
++		if (in_buf.pos == in_buf.size && k < b)
++			put_bh(bh[k++]);
++	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
++
++	if (ZSTD_isError(zstd_err)) {
++		ERROR("zstd decompression error: %d\n",
++				(int)ZSTD_getErrorCode(zstd_err));
++	}
++
++	squashfs_finish_page(output);
++
++	if (k < b)
++		goto out;
++
++	return total_out;
++
++out:
++	for (; k < b; k++)
++		put_bh(bh[k]);
++
++	return -EIO;
++}
++
++const struct squashfs_decompressor squashfs_zstd_comp_ops = {
++	.init = zstd_init,
++	.free = zstd_free,
++	.decompress = zstd_uncompress,
++	.id = ZSTD_COMPRESSION,
++	.name = "zstd",
++	.supported = 1
++};

From a92cbb70045313ece955d33e7dfe1e2c815b7fab Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 15:08:56 -0700
Subject: [PATCH 228/255] Added a secondary test, checking dictID presence
 after setting noDictIdFLag=1

---
 lib/zstd.h          | 2 +-
 tests/zstreamtest.c | 8 +++++++-
 2 files changed, 8 insertions(+), 2 deletions(-)

diff --git a/lib/zstd.h b/lib/zstd.h
index 3852b7200..9a50f23cd 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -586,7 +586,7 @@ ZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
  *    Note : this use case also happens when using a non-conformant dictionary.
  *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
  *  - This is not a Zstandard frame.
- *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
+ *  When identifying the exact failure cause, it's possible to use ZSTD_getFrameParams(), which will provide a more precise error code. */
 ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
 
 
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index 6d9694e45..0e09e1856 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -451,7 +451,7 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
     DISPLAYLEVEL(3, "test%3i : ZSTD_initCStream_usingCDict_advanced with masked dictID : ", testNb++);
     {   ZSTD_compressionParameters const cParams = ZSTD_getCParams(1, CNBufferSize, dictionary.filled);
         ZSTD_frameParameters const fParams = { 1 /* contentSize */, 1 /* checksum */, 1 /* noDictID */};
-        ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1, cParams, customMem);
+        ZSTD_CDict* const cdict = ZSTD_createCDict_advanced(dictionary.start, dictionary.filled, 1 /* byReference */, cParams, customMem);
         size_t const initError = ZSTD_initCStream_usingCDict_advanced(zc, cdict, CNBufferSize, fParams);
         if (ZSTD_isError(initError)) goto _output_error;
         cSize = 0;
@@ -471,6 +471,12 @@ static int basicUnitTests(U32 seed, double compressibility, ZSTD_customMem custo
         DISPLAYLEVEL(3, "OK (%u bytes : %.2f%%)\n", (U32)cSize, (double)cSize/CNBufferSize*100);
     }
 
+    DISPLAYLEVEL(3, "test%3i : try retrieving dictID from frame : ", testNb++);
+    {   U32 const did = ZSTD_getDictID_fromFrame(compressedBuffer, cSize);
+        if (did != 0) goto _output_error;
+    }
+    DISPLAYLEVEL(3, "OK (not detected) \n");
+
     DISPLAYLEVEL(3, "test%3i : decompress without dictionary : ", testNb++);
     {   size_t const r = ZSTD_decompress(decodedBuffer, CNBufferSize, compressedBuffer, cSize);
         if (!ZSTD_isError(r)) goto _output_error;  /* must fail : dictionary not used */

From c6915429f234f03d7f75633e3a9f4f08843bf765 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 16:24:53 -0700
Subject: [PATCH 229/255] shortened Appveyor release tests

fuzzer supports time suffix `s` for "seconds"
---
 appveyor.yml   |  2 +-
 tests/fuzzer.c | 81 +++++++++++++++++++++++++-------------------------
 2 files changed, 41 insertions(+), 42 deletions(-)

diff --git a/appveyor.yml b/appveyor.yml
index 4aad71469..67c4f72d7 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -166,7 +166,7 @@
       make -C contrib\pzstd check &&
       make -C contrib\pzstd clean
     )
-  - SET "FUZZERTEST=-T1mn"
+  - SET "FUZZERTEST=-T30s"
   - if [%HOST%]==[visual] if [%CONFIGURATION%]==[Release] (
       CD tests &&
       SET ZSTD=./zstd.exe &&
diff --git a/tests/fuzzer.c b/tests/fuzzer.c
index 3123d1825..a4423f244 100644
--- a/tests/fuzzer.c
+++ b/tests/fuzzer.c
@@ -1003,7 +1003,7 @@ _output_error:
 /*_*******************************************************
 *  Command line
 *********************************************************/
-int FUZ_usage(const char* programName)
+static int FUZ_usage(const char* programName)
 {
     DISPLAY( "Usage :\n");
     DISPLAY( "      %s [args]\n", programName);
@@ -1019,20 +1019,39 @@ int FUZ_usage(const char* programName)
     return 0;
 }
 
+/*! readU32FromChar() :
+    @return : unsigned integer value read from input in `char` format
+    allows and interprets K, KB, KiB, M, MB and MiB suffix.
+    Will also modify `*stringPtr`, advancing it to position where it stopped reading.
+    Note : function result can overflow if digit string > MAX_UINT */
+static unsigned readU32FromChar(const char** stringPtr)
+{
+    unsigned result = 0;
+    while ((**stringPtr >='0') && (**stringPtr <='9'))
+        result *= 10, result += **stringPtr - '0', (*stringPtr)++ ;
+    if ((**stringPtr=='K') || (**stringPtr=='M')) {
+        result <<= 10;
+        if (**stringPtr=='M') result <<= 10;
+        (*stringPtr)++ ;
+        if (**stringPtr=='i') (*stringPtr)++;
+        if (**stringPtr=='B') (*stringPtr)++;
+    }
+    return result;
+}
 
 int main(int argc, const char** argv)
 {
-    U32 seed=0;
-    int seedset=0;
+    U32 seed = 0;
+    int seedset = 0;
     int argNb;
     int nbTests = nbTestsDefault;
     int testNb = 0;
     U32 proba = FUZ_compressibility_default;
-    int result=0;
+    int result = 0;
     U32 mainPause = 0;
     U32 maxDuration = 0;
     int bigTests = 1;
-    const char* programName = argv[0];
+    const char* const programName = argv[0];
 
     /* Check command line */
     for (argNb=1; argNb<argc; argNb++) {
@@ -1050,75 +1069,55 @@ int main(int argc, const char** argv)
                 {
                 case 'h':
                     return FUZ_usage(programName);
+
                 case 'v':
                     argument++;
-                    g_displayLevel=4;
+                    g_displayLevel = 4;
                     break;
+
                 case 'q':
                     argument++;
                     g_displayLevel--;
                     break;
+
                 case 'p': /* pause at the end */
                     argument++;
                     mainPause = 1;
                     break;
 
                 case 'i':
-                    argument++; maxDuration=0;
-                    nbTests=0;
-                    while ((*argument>='0') && (*argument<='9')) {
-                        nbTests *= 10;
-                        nbTests += *argument - '0';
-                        argument++;
-                    }
+                    argument++; maxDuration = 0;
+                    nbTests = readU32FromChar(&argument);
                     break;
 
                 case 'T':
                     argument++;
-                    nbTests=0; maxDuration=0;
-                    while ((*argument>='0') && (*argument<='9')) {
-                        maxDuration *= 10;
-                        maxDuration += *argument - '0';
-                        argument++;
-                    }
-                    if (*argument=='m') maxDuration *=60, argument++;
+                    nbTests = 0;
+                    maxDuration = readU32FromChar(&argument);
+                    if (*argument=='s') argument++;   /* seconds */
+                    if (*argument=='m') maxDuration *= 60, argument++;   /* minutes */
                     if (*argument=='n') argument++;
                     break;
 
                 case 's':
                     argument++;
-                    seed=0;
-                    seedset=1;
-                    while ((*argument>='0') && (*argument<='9')) {
-                        seed *= 10;
-                        seed += *argument - '0';
-                        argument++;
-                    }
+                    seedset = 1;
+                    seed = readU32FromChar(&argument);
                     break;
 
                 case 't':
                     argument++;
-                    testNb=0;
-                    while ((*argument>='0') && (*argument<='9')) {
-                        testNb *= 10;
-                        testNb += *argument - '0';
-                        argument++;
-                    }
+                    testNb = readU32FromChar(&argument);
                     break;
 
                 case 'P':   /* compressibility % */
                     argument++;
-                    proba=0;
-                    while ((*argument>='0') && (*argument<='9')) {
-                        proba *= 10;
-                        proba += *argument - '0';
-                        argument++;
-                    }
-                    if (proba>100) proba=100;
+                    proba = readU32FromChar(&argument);
+                    if (proba>100) proba = 100;
                     break;
 
                 default:
-                    return FUZ_usage(programName);
+                    return (FUZ_usage(programName), 1);
     }   }   }   }   /* for (argNb=1; argNb<argc; argNb++) */
 
     /* Get Seed */

From eeeb201e700dfe592c352cf92077095e2a539b89 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 27 Apr 2017 16:54:05 -0700
Subject: [PATCH 230/255] Fix case where pages run out before end of stream

---
 .../linux-kernel/fs/squashfs/zstd_wrapper.c   | 13 ++++++------
 contrib/linux-kernel/squashfs.diff            | 21 ++++++++++---------
 2 files changed, 18 insertions(+), 16 deletions(-)

diff --git a/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
index 81f4b5a4b..af72c7b22 100644
--- a/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
+++ b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
@@ -101,12 +101,13 @@ static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
 
 		if (out_buf.pos == out_buf.size) {
 			out_buf.dst = squashfs_next_page(output);
-			out_buf.pos = 0;
-			if (out_buf.dst != NULL) {
-				out_buf.size = PAGE_SIZE;
-			} else {
-				out_buf.size = 0;
+			if (out_buf.dst == NULL) {
+				/* shouldn't run out of pages before stream is
+				 * done */
+				goto out;
 			}
+			out_buf.pos = 0;
+			out_buf.size = PAGE_SIZE;
 		}
 
 		total_out -= out_buf.pos;
@@ -127,7 +128,7 @@ static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
 	if (k < b)
 		goto out;
 
-	return total_out;
+	return (int)total_out;
 
 out:
 	for (; k < b; k++)
diff --git a/contrib/linux-kernel/squashfs.diff b/contrib/linux-kernel/squashfs.diff
index e1e1235f0..e3b9e8552 100644
--- a/contrib/linux-kernel/squashfs.diff
+++ b/contrib/linux-kernel/squashfs.diff
@@ -1,6 +1,6 @@
-commit 7289653483a0579c3b63a06abf008210c8cc6c8b
+commit 47ba72b36506f91c3774c0bb1fa3c7a5dcfe3ea1
 Author: Sean Purcell <me@seanp.xyz>
-Date:   Thu Apr 27 14:56:25 2017 -0700
+Date:   Thu Apr 27 16:50:53 2017 -0700
 
     Add zstd support to kernel squashfs
 
@@ -90,10 +90,10 @@ index 506f4ba..24d12fd 100644
  	__le32			s_magic;
 diff --git a/fs/squashfs/zstd_wrapper.c b/fs/squashfs/zstd_wrapper.c
 new file mode 100644
-index 0000000..81f4b5a
+index 0000000..af72c7b
 --- /dev/null
 +++ b/fs/squashfs/zstd_wrapper.c
-@@ -0,0 +1,146 @@
+@@ -0,0 +1,147 @@
 +/*
 + * Squashfs - a compressed read only filesystem for Linux
 + *
@@ -197,12 +197,13 @@ index 0000000..81f4b5a
 +
 +		if (out_buf.pos == out_buf.size) {
 +			out_buf.dst = squashfs_next_page(output);
-+			out_buf.pos = 0;
-+			if (out_buf.dst != NULL) {
-+				out_buf.size = PAGE_SIZE;
-+			} else {
-+				out_buf.size = 0;
++			if (out_buf.dst == NULL) {
++				/* shouldn't run out of pages before stream is
++				 * done */
++				goto out;
 +			}
++			out_buf.pos = 0;
++			out_buf.size = PAGE_SIZE;
 +		}
 +
 +		total_out -= out_buf.pos;
@@ -223,7 +224,7 @@ index 0000000..81f4b5a
 +	if (k < b)
 +		goto out;
 +
-+	return total_out;
++	return (int)total_out;
 +
 +out:
 +	for (; k < b; k++)

From c7e107197a80577057adfa3c2bd1cbc152f72285 Mon Sep 17 00:00:00 2001
From: Sean Purcell <me@seanp.xyz>
Date: Thu, 27 Apr 2017 17:19:20 -0700
Subject: [PATCH 231/255] Fix missing squashfs_finish_page's

---
 contrib/linux-kernel/fs/squashfs/zstd_wrapper.c |  6 ++++--
 contrib/linux-kernel/squashfs.diff              | 16 +++++++++-------
 2 files changed, 13 insertions(+), 9 deletions(-)

diff --git a/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
index af72c7b22..7cc93030b 100644
--- a/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
+++ b/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
@@ -104,6 +104,7 @@ static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
 			if (out_buf.dst == NULL) {
 				/* shouldn't run out of pages before stream is
 				 * done */
+				squashfs_finish_page(output);
 				goto out;
 			}
 			out_buf.pos = 0;
@@ -118,13 +119,14 @@ static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
 			put_bh(bh[k++]);
 	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
 
+	squashfs_finish_page(output);
+
 	if (ZSTD_isError(zstd_err)) {
 		ERROR("zstd decompression error: %d\n",
 				(int)ZSTD_getErrorCode(zstd_err));
+		goto out;
 	}
 
-	squashfs_finish_page(output);
-
 	if (k < b)
 		goto out;
 
diff --git a/contrib/linux-kernel/squashfs.diff b/contrib/linux-kernel/squashfs.diff
index e3b9e8552..ddf7b3578 100644
--- a/contrib/linux-kernel/squashfs.diff
+++ b/contrib/linux-kernel/squashfs.diff
@@ -1,8 +1,8 @@
-commit 47ba72b36506f91c3774c0bb1fa3c7a5dcfe3ea1
+commit 16bb6b9fd684eadba41a36223d67805d7ea741e7
 Author: Sean Purcell <me@seanp.xyz>
-Date:   Thu Apr 27 16:50:53 2017 -0700
+Date:   Thu Apr 27 17:17:58 2017 -0700
 
-    Add zstd support to kernel squashfs
+    Add zstd support to squashfs
 
 diff --git a/fs/squashfs/Kconfig b/fs/squashfs/Kconfig
 index ffb093e..1adb334 100644
@@ -90,10 +90,10 @@ index 506f4ba..24d12fd 100644
  	__le32			s_magic;
 diff --git a/fs/squashfs/zstd_wrapper.c b/fs/squashfs/zstd_wrapper.c
 new file mode 100644
-index 0000000..af72c7b
+index 0000000..7cc9303
 --- /dev/null
 +++ b/fs/squashfs/zstd_wrapper.c
-@@ -0,0 +1,147 @@
+@@ -0,0 +1,149 @@
 +/*
 + * Squashfs - a compressed read only filesystem for Linux
 + *
@@ -200,6 +200,7 @@ index 0000000..af72c7b
 +			if (out_buf.dst == NULL) {
 +				/* shouldn't run out of pages before stream is
 +				 * done */
++				squashfs_finish_page(output);
 +				goto out;
 +			}
 +			out_buf.pos = 0;
@@ -214,13 +215,14 @@ index 0000000..af72c7b
 +			put_bh(bh[k++]);
 +	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
 +
++	squashfs_finish_page(output);
++
 +	if (ZSTD_isError(zstd_err)) {
 +		ERROR("zstd decompression error: %d\n",
 +				(int)ZSTD_getErrorCode(zstd_err));
++		goto out;
 +	}
 +
-+	squashfs_finish_page(output);
-+
 +	if (k < b)
 +		goto out;
 +

From 36e79a1a1f2126061782ae4719bc888b8f4e112b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 17:28:32 -0700
Subject: [PATCH 232/255] tests : -g is part of DEBUGFLAGS

---
 tests/Makefile | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/tests/Makefile b/tests/Makefile
index f5260e50e..ea58c0fe5 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -26,12 +26,12 @@ PYTHON ?= python3
 TESTARTEFACT := versionsTest namespaceTest
 
 
-DEBUGFLAG= -DZSTD_DEBUG=1
+DEBUGFLAGS=-g -DZSTD_DEBUG=1
 CPPFLAGS+= -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress \
            -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR) \
            $(DEBUGFLAG)
 CFLAGS  ?= -O3
-CFLAGS  += -g -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
+CFLAGS  += -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
            -Wstrict-prototypes -Wundef -Wformat-security
 CFLAGS  += $(MOREFLAGS)

From 29297c6751289087d3d52688012dc776eccf1d2b Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Thu, 27 Apr 2017 17:44:01 -0700
Subject: [PATCH 233/255] Changed default level 18 (large input)

Previous -18 : 4.7 MB/s, R:3.833
New -18 : 5.1 MB/s. R:3.825

It's a better fit within -17 (6.8 MB/s) and -19 (4.0 MB/s)
The new level 18 also uses significantly less memory.
And, it makes a good transition between level 17 (mml5)
and level 19 (mml3).
Up to now, there was no level with mml4.

(note : minmatch setting can have a large impact on some (specific) datasets)
---
 lib/compress/zstd_compress.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/compress/zstd_compress.c b/lib/compress/zstd_compress.c
index 9a2d194ad..74ae66cb7 100644
--- a/lib/compress/zstd_compress.c
+++ b/lib/compress/zstd_compress.c
@@ -3432,7 +3432,7 @@ static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEV
     { 22, 21, 21,  5,  5, 16, ZSTD_btlazy2 },  /* level 15 */
     { 23, 22, 22,  5,  5, 16, ZSTD_btlazy2 },  /* level 16 */
     { 23, 21, 22,  4,  5, 24, ZSTD_btopt   },  /* level 17 */
-    { 23, 23, 22,  6,  5, 32, ZSTD_btopt   },  /* level 18 */
+    { 23, 22, 22,  5,  4, 32, ZSTD_btopt   },  /* level 18 */
     { 23, 23, 22,  6,  3, 48, ZSTD_btopt   },  /* level 19 */
     { 25, 25, 23,  7,  3, 64, ZSTD_btopt2  },  /* level 20 */
     { 26, 26, 23,  7,  3,256, ZSTD_btopt2  },  /* level 21 */

From 7bd68e194d84c09ff2b86f9068a26d0247fee821 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 28 Apr 2017 08:54:13 -0700
Subject: [PATCH 234/255] minor release note update

---
 NEWS | 1 +
 1 file changed, 1 insertion(+)

diff --git a/NEWS b/NEWS
index 4f9bd2eff..2a9921e8e 100644
--- a/NEWS
+++ b/NEWS
@@ -2,6 +2,7 @@ v1.2.0
 cli : changed : Multithreading enabled by default (use target zstd-nomt or HAVE_THREAD=0 to disable)
 cli : new : command -T0 means "detect and use nb of cores", by Sean Purcell
 cli : new : zstdmt symlink hardwired to `zstd -T0`
+cli : new : command --threads=# (#671)
 cli : new : experimental target `zstd4`, with support for lz4 format, by Sean Purcell
 cli : fix : does not output compressed data on console
 cli : fix : ignore symbolic links unless --force specified,

From 68a7d3d49a776954cb0d1b6f6c5ae86b35f0e029 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 28 Apr 2017 12:46:48 -0700
Subject: [PATCH 235/255] added HUF_PUBLIC_API macro to huf.h

to make it possible to control symbol visibility.
Also : better separation and comments between "public" and "static" sections
---
 NEWS             |  4 ++--
 lib/common/huf.h | 57 +++++++++++++++++++++++++++++++++---------------
 2 files changed, 41 insertions(+), 20 deletions(-)

diff --git a/NEWS b/NEWS
index 2a9921e8e..b910e2993 100644
--- a/NEWS
+++ b/NEWS
@@ -7,11 +7,11 @@ cli : new : experimental target `zstd4`, with support for lz4 format, by Sean Pu
 cli : fix : does not output compressed data on console
 cli : fix : ignore symbolic links unless --force specified,
 API : breaking change : ZSTD_createCDict_advanced(), only use compressionParameters as argument
-API : changed : added prototypes ZSTD_*_usingCDict_advanced(), for direct control over frameParameters.
-API : changed : enforced consistent rules for pledgedSrcSize==0
+API : added : prototypes ZSTD_*_usingCDict_advanced(), for direct control over frameParameters.
 API : improved: ZSTDMT_compressCCtx() reduced memory usage
 API : fix : ZSTDMT_compressCCtx() now provides srcSize in header (#634)
 API : fix : src size stored in frame header is controlled at end of frame
+API : fix : enforced consistent rules for pledgedSrcSize==0
 API : fix : ensure error code "dstSizeTooSmall" is generated when dst size is too small
 build: improved cmake script, by @Majlen
 build: enabled Multi-threading support for *BSD, by Baptiste Daroussin
diff --git a/lib/common/huf.h b/lib/common/huf.h
index 32313cf74..7873ca3d4 100644
--- a/lib/common/huf.h
+++ b/lib/common/huf.h
@@ -43,6 +43,21 @@ extern "C" {
 #include <stddef.h>    /* size_t */
 
 
+/* *** library symbols visibility *** */
+/* Note : when linking with -fvisibility=hidden on gcc, or by default on Visual,
+ *        HUF symbols remain "private" (internal symbols for library only).
+ *        Set macro FSE_DLL_EXPORT to 1 if you want HUF symbols visible on DLL interface */
+#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
+#  define HUF_PUBLIC_API __attribute__ ((visibility ("default")))
+#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
+#  define HUF_PUBLIC_API __declspec(dllexport)
+#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
+#  define HUF_PUBLIC_API __declspec(dllimport)  /* not required, just to generate faster code (saves a function pointer load from IAT and an indirect jump) */
+#else
+#  define HUF_PUBLIC_API
+#endif
+
+
 /* *** simple functions *** */
 /**
 HUF_compress() :
@@ -55,8 +70,8 @@ HUF_compress() :
                      if return == 1, srcData is a single repeated byte symbol (RLE compression).
                      if HUF_isError(return), compression failed (more details using HUF_getErrorName())
 */
-size_t HUF_compress(void* dst, size_t dstCapacity,
-              const void* src, size_t srcSize);
+HUF_PUBLIC_API size_t HUF_compress(void* dst, size_t dstCapacity,
+                             const void* src, size_t srcSize);
 
 /**
 HUF_decompress() :
@@ -69,32 +84,42 @@ HUF_decompress() :
     @return : size of regenerated data (== originalSize),
               or an error code, which can be tested using HUF_isError()
 */
-size_t HUF_decompress(void* dst,  size_t originalSize,
-                const void* cSrc, size_t cSrcSize);
+HUF_PUBLIC_API size_t HUF_decompress(void* dst,  size_t originalSize,
+                               const void* cSrc, size_t cSrcSize);
 
 
 /* ***   Tool functions *** */
-#define HUF_BLOCKSIZE_MAX (128 * 1024)       /**< maximum input size for a single block compressed with HUF_compress */
-size_t HUF_compressBound(size_t size);       /**< maximum compressed size (worst case) */
+#define HUF_BLOCKSIZE_MAX (128 * 1024)                  /**< maximum input size for a single block compressed with HUF_compress */
+HUF_PUBLIC_API size_t HUF_compressBound(size_t size);   /**< maximum compressed size (worst case) */
 
 /* Error Management */
-unsigned    HUF_isError(size_t code);        /**< tells if a return value is an error code */
-const char* HUF_getErrorName(size_t code);   /**< provides error code string (useful for debugging) */
+HUF_PUBLIC_API unsigned    HUF_isError(size_t code);       /**< tells if a return value is an error code */
+HUF_PUBLIC_API const char* HUF_getErrorName(size_t code);  /**< provides error code string (useful for debugging) */
 
 
 /* ***   Advanced function   *** */
 
 /** HUF_compress2() :
- *   Same as HUF_compress(), but offers direct control over `maxSymbolValue` and `tableLog` .
- *   `tableLog` must be `<= HUF_TABLELOG_MAX` . */
-size_t HUF_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+ *  Same as HUF_compress(), but offers direct control over `maxSymbolValue` and `tableLog`.
+ *  `tableLog` must be `<= HUF_TABLELOG_MAX` . */
+HUF_PUBLIC_API size_t HUF_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
 
 /** HUF_compress4X_wksp() :
-*   Same as HUF_compress2(), but uses externally allocated `workSpace`, which must be a table of >= 1024 unsigned */
-size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+ *  Same as HUF_compress2(), but uses externally allocated `workSpace`.
+ *  `workspace` must have minimum alignment of 4, and be at least as large as following macro */
+#define HUF_WORKSPACE_SIZE (6 << 10)
+#define HUF_WORKSPACE_SIZE_U32 (HUF_WORKSPACE_SIZE / sizeof(U32))
+HUF_PUBLIC_API size_t HUF_compress4X_wksp (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
 
 
 
+/* ******************************************************************
+ *  WARNING !!
+ *  The following section contains advanced and experimental definitions
+ *  which shall never be used in the context of dll
+ *  because they are not guaranteed to remain stable in the future.
+ *  Only consider them in association with static linking.
+ *******************************************************************/
 #ifdef HUF_STATIC_LINKING_ONLY
 
 /* *** Dependencies *** */
@@ -117,7 +142,7 @@ size_t HUF_compress4X_wksp (void* dst, size_t dstSize, const void* src, size_t s
 ******************************************/
 /* HUF buffer bounds */
 #define HUF_CTABLEBOUND 129
-#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true if incompressible pre-filtered with fast heuristic */
+#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true when incompressible is pre-filtered with fast heuristic */
 #define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
 
 /* static allocation of HUF's Compression Table */
@@ -136,10 +161,6 @@ typedef U32 HUF_DTable;
 #define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) \
         HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
 
-/* The workspace must have alignment at least 4 and be at least this large */
-#define HUF_WORKSPACE_SIZE (6 << 10)
-#define HUF_WORKSPACE_SIZE_U32 (HUF_WORKSPACE_SIZE / sizeof(U32))
-
 
 /* ****************************************
 *  Advanced decompression functions

From 89f50deec7b37ff2c7c01cfa85ef487189ae7701 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 28 Apr 2017 16:52:36 -0700
Subject: [PATCH 236/255] minor code refactoring

clearer tables
---
 lib/decompress/zstd_decompress.c | 252 ++++++++-----------------------
 1 file changed, 62 insertions(+), 190 deletions(-)

diff --git a/lib/decompress/zstd_decompress.c b/lib/decompress/zstd_decompress.c
index 7499b8ae1..634e2152e 100644
--- a/lib/decompress/zstd_decompress.c
+++ b/lib/decompress/zstd_decompress.c
@@ -177,30 +177,6 @@ void ZSTD_copyDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
     memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize);  /* no need to copy workspace */
 }
 
-#if 0
-/* deprecated */
-static void ZSTD_refDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
-{
-    ZSTD_decompressBegin(dstDCtx);  /* init */
-    if (srcDCtx) {   /* support refDCtx on NULL */
-        dstDCtx->dictEnd = srcDCtx->dictEnd;
-        dstDCtx->vBase = srcDCtx->vBase;
-        dstDCtx->base = srcDCtx->base;
-        dstDCtx->previousDstEnd = srcDCtx->previousDstEnd;
-        dstDCtx->dictID = srcDCtx->dictID;
-        dstDCtx->litEntropy = srcDCtx->litEntropy;
-        dstDCtx->fseEntropy = srcDCtx->fseEntropy;
-        dstDCtx->LLTptr = srcDCtx->entropy.LLTable;
-        dstDCtx->MLTptr = srcDCtx->entropy.MLTable;
-        dstDCtx->OFTptr = srcDCtx->entropy.OFTable;
-        dstDCtx->HUFptr = srcDCtx->entropy.hufTable;
-        dstDCtx->entropy.rep[0] = srcDCtx->entropy.rep[0];
-        dstDCtx->entropy.rep[1] = srcDCtx->entropy.rep[1];
-        dstDCtx->entropy.rep[2] = srcDCtx->entropy.rep[2];
-    }
-}
-#endif
-
 static void ZSTD_refDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict);
 
 
@@ -431,7 +407,8 @@ typedef struct
 
 /*! ZSTD_getcBlockSize() :
 *   Provides the size of compressed block from block header `src` */
-size_t ZSTD_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)
+size_t ZSTD_getcBlockSize(const void* src, size_t srcSize,
+                          blockProperties_t* bpPtr)
 {
     if (srcSize < ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
     {   U32 const cBlockHeader = MEM_readLE24(src);
@@ -446,7 +423,8 @@ size_t ZSTD_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bp
 }
 
 
-static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity,
+                          const void* src, size_t srcSize)
 {
     if (srcSize > dstCapacity) return ERROR(dstSize_tooSmall);
     memcpy(dst, src, srcSize);
@@ -454,7 +432,9 @@ static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity, const void* src,
 }
 
 
-static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity, const void* src, size_t srcSize, size_t regenSize)
+static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize,
+                               size_t regenSize)
 {
     if (srcSize != 1) return ERROR(srcSize_wrong);
     if (regenSize > dstCapacity) return ERROR(dstSize_tooSmall);
@@ -595,176 +575,70 @@ typedef union {
     U32 alignedBy4;
 } FSE_decode_t4;
 
+/* Default FSE distribution table for Literal Lengths */
 static const FSE_decode_t4 LL_defaultDTable[(1<<LL_DEFAULTNORMLOG)+1] = {
     { { LL_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  4 } },              /* 0 : base, symbol, bits */
-    { { 16,  0,  4 } },
-    { { 32,  1,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  4,  5 } },
-    { {  0,  6,  5 } },
-    { {  0,  7,  5 } },
-    { {  0,  9,  5 } },
-    { {  0, 10,  5 } },
-    { {  0, 12,  5 } },
-    { {  0, 14,  6 } },
-    { {  0, 16,  5 } },
-    { {  0, 18,  5 } },
-    { {  0, 19,  5 } },
-    { {  0, 21,  5 } },
-    { {  0, 22,  5 } },
-    { {  0, 24,  5 } },
-    { { 32, 25,  5 } },
-    { {  0, 26,  5 } },
-    { {  0, 27,  6 } },
-    { {  0, 29,  6 } },
-    { {  0, 31,  6 } },
-    { { 32,  0,  4 } },
-    { {  0,  1,  4 } },
-    { {  0,  2,  5 } },
-    { { 32,  4,  5 } },
-    { {  0,  5,  5 } },
-    { { 32,  7,  5 } },
-    { {  0,  8,  5 } },
-    { { 32, 10,  5 } },
-    { {  0, 11,  5 } },
-    { {  0, 13,  6 } },
-    { { 32, 16,  5 } },
-    { {  0, 17,  5 } },
-    { { 32, 19,  5 } },
-    { {  0, 20,  5 } },
-    { { 32, 22,  5 } },
-    { {  0, 23,  5 } },
-    { {  0, 25,  4 } },
-    { { 16, 25,  4 } },
-    { { 32, 26,  5 } },
-    { {  0, 28,  6 } },
-    { {  0, 30,  6 } },
-    { { 48,  0,  4 } },
-    { { 16,  1,  4 } },
-    { { 32,  2,  5 } },
-    { { 32,  3,  5 } },
-    { { 32,  5,  5 } },
-    { { 32,  6,  5 } },
-    { { 32,  8,  5 } },
-    { { 32,  9,  5 } },
-    { { 32, 11,  5 } },
-    { { 32, 12,  5 } },
-    { {  0, 15,  6 } },
-    { { 32, 17,  5 } },
-    { { 32, 18,  5 } },
-    { { 32, 20,  5 } },
-    { { 32, 21,  5 } },
-    { { 32, 23,  5 } },
-    { { 32, 24,  5 } },
-    { {  0, 35,  6 } },
-    { {  0, 34,  6 } },
-    { {  0, 33,  6 } },
-    { {  0, 32,  6 } },
+     /* base, symbol, bits */
+    { {  0,  0,  4 } }, { { 16,  0,  4 } }, { { 32,  1,  5 } }, { {  0,  3,  5 } },
+    { {  0,  4,  5 } }, { {  0,  6,  5 } }, { {  0,  7,  5 } }, { {  0,  9,  5 } },
+    { {  0, 10,  5 } }, { {  0, 12,  5 } }, { {  0, 14,  6 } }, { {  0, 16,  5 } },
+    { {  0, 18,  5 } }, { {  0, 19,  5 } }, { {  0, 21,  5 } }, { {  0, 22,  5 } },
+    { {  0, 24,  5 } }, { { 32, 25,  5 } }, { {  0, 26,  5 } }, { {  0, 27,  6 } },
+    { {  0, 29,  6 } }, { {  0, 31,  6 } }, { { 32,  0,  4 } }, { {  0,  1,  4 } },
+    { {  0,  2,  5 } }, { { 32,  4,  5 } }, { {  0,  5,  5 } }, { { 32,  7,  5 } },
+    { {  0,  8,  5 } }, { { 32, 10,  5 } }, { {  0, 11,  5 } }, { {  0, 13,  6 } },
+    { { 32, 16,  5 } }, { {  0, 17,  5 } }, { { 32, 19,  5 } }, { {  0, 20,  5 } },
+    { { 32, 22,  5 } }, { {  0, 23,  5 } }, { {  0, 25,  4 } }, { { 16, 25,  4 } },
+    { { 32, 26,  5 } }, { {  0, 28,  6 } }, { {  0, 30,  6 } }, { { 48,  0,  4 } },
+    { { 16,  1,  4 } }, { { 32,  2,  5 } }, { { 32,  3,  5 } }, { { 32,  5,  5 } },
+    { { 32,  6,  5 } }, { { 32,  8,  5 } }, { { 32,  9,  5 } }, { { 32, 11,  5 } },
+    { { 32, 12,  5 } }, { {  0, 15,  6 } }, { { 32, 17,  5 } }, { { 32, 18,  5 } },
+    { { 32, 20,  5 } }, { { 32, 21,  5 } }, { { 32, 23,  5 } }, { { 32, 24,  5 } },
+    { {  0, 35,  6 } }, { {  0, 34,  6 } }, { {  0, 33,  6 } }, { {  0, 32,  6 } },
 };   /* LL_defaultDTable */
 
+/* Default FSE distribution table for Match Lengths */
 static const FSE_decode_t4 ML_defaultDTable[(1<<ML_DEFAULTNORMLOG)+1] = {
     { { ML_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  6 } },              /* 0 : base, symbol, bits */
-    { {  0,  1,  4 } },
-    { { 32,  2,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  5,  5 } },
-    { {  0,  6,  5 } },
-    { {  0,  8,  5 } },
-    { {  0, 10,  6 } },
-    { {  0, 13,  6 } },
-    { {  0, 16,  6 } },
-    { {  0, 19,  6 } },
-    { {  0, 22,  6 } },
-    { {  0, 25,  6 } },
-    { {  0, 28,  6 } },
-    { {  0, 31,  6 } },
-    { {  0, 33,  6 } },
-    { {  0, 35,  6 } },
-    { {  0, 37,  6 } },
-    { {  0, 39,  6 } },
-    { {  0, 41,  6 } },
-    { {  0, 43,  6 } },
-    { {  0, 45,  6 } },
-    { { 16,  1,  4 } },
-    { {  0,  2,  4 } },
-    { { 32,  3,  5 } },
-    { {  0,  4,  5 } },
-    { { 32,  6,  5 } },
-    { {  0,  7,  5 } },
-    { {  0,  9,  6 } },
-    { {  0, 12,  6 } },
-    { {  0, 15,  6 } },
-    { {  0, 18,  6 } },
-    { {  0, 21,  6 } },
-    { {  0, 24,  6 } },
-    { {  0, 27,  6 } },
-    { {  0, 30,  6 } },
-    { {  0, 32,  6 } },
-    { {  0, 34,  6 } },
-    { {  0, 36,  6 } },
-    { {  0, 38,  6 } },
-    { {  0, 40,  6 } },
-    { {  0, 42,  6 } },
-    { {  0, 44,  6 } },
-    { { 32,  1,  4 } },
-    { { 48,  1,  4 } },
-    { { 16,  2,  4 } },
-    { { 32,  4,  5 } },
-    { { 32,  5,  5 } },
-    { { 32,  7,  5 } },
-    { { 32,  8,  5 } },
-    { {  0, 11,  6 } },
-    { {  0, 14,  6 } },
-    { {  0, 17,  6 } },
-    { {  0, 20,  6 } },
-    { {  0, 23,  6 } },
-    { {  0, 26,  6 } },
-    { {  0, 29,  6 } },
-    { {  0, 52,  6 } },
-    { {  0, 51,  6 } },
-    { {  0, 50,  6 } },
-    { {  0, 49,  6 } },
-    { {  0, 48,  6 } },
-    { {  0, 47,  6 } },
-    { {  0, 46,  6 } },
+    /* base, symbol, bits */
+    { {  0,  0,  6 } }, { {  0,  1,  4 } }, { { 32,  2,  5 } }, { {  0,  3,  5 } },
+    { {  0,  5,  5 } }, { {  0,  6,  5 } }, { {  0,  8,  5 } }, { {  0, 10,  6 } },
+    { {  0, 13,  6 } }, { {  0, 16,  6 } }, { {  0, 19,  6 } }, { {  0, 22,  6 } },
+    { {  0, 25,  6 } }, { {  0, 28,  6 } }, { {  0, 31,  6 } }, { {  0, 33,  6 } },
+    { {  0, 35,  6 } }, { {  0, 37,  6 } }, { {  0, 39,  6 } }, { {  0, 41,  6 } },
+    { {  0, 43,  6 } }, { {  0, 45,  6 } }, { { 16,  1,  4 } }, { {  0,  2,  4 } },
+    { { 32,  3,  5 } }, { {  0,  4,  5 } }, { { 32,  6,  5 } }, { {  0,  7,  5 } },
+    { {  0,  9,  6 } }, { {  0, 12,  6 } }, { {  0, 15,  6 } }, { {  0, 18,  6 } },
+    { {  0, 21,  6 } }, { {  0, 24,  6 } }, { {  0, 27,  6 } }, { {  0, 30,  6 } },
+    { {  0, 32,  6 } }, { {  0, 34,  6 } }, { {  0, 36,  6 } }, { {  0, 38,  6 } },
+    { {  0, 40,  6 } }, { {  0, 42,  6 } }, { {  0, 44,  6 } }, { { 32,  1,  4 } },
+    { { 48,  1,  4 } }, { { 16,  2,  4 } }, { { 32,  4,  5 } }, { { 32,  5,  5 } },
+    { { 32,  7,  5 } }, { { 32,  8,  5 } }, { {  0, 11,  6 } }, { {  0, 14,  6 } },
+    { {  0, 17,  6 } }, { {  0, 20,  6 } }, { {  0, 23,  6 } }, { {  0, 26,  6 } },
+    { {  0, 29,  6 } }, { {  0, 52,  6 } }, { {  0, 51,  6 } }, { {  0, 50,  6 } },
+    { {  0, 49,  6 } }, { {  0, 48,  6 } }, { {  0, 47,  6 } }, { {  0, 46,  6 } },
 };   /* ML_defaultDTable */
 
+/* Default FSE distribution table for Offset Codes */
 static const FSE_decode_t4 OF_defaultDTable[(1<<OF_DEFAULTNORMLOG)+1] = {
     { { OF_DEFAULTNORMLOG, 1, 1 } }, /* header : tableLog, fastMode, fastMode */
-    { {  0,  0,  5 } },              /* 0 : base, symbol, bits */
-    { {  0,  6,  4 } },
-    { {  0,  9,  5 } },
-    { {  0, 15,  5 } },
-    { {  0, 21,  5 } },
-    { {  0,  3,  5 } },
-    { {  0,  7,  4 } },
-    { {  0, 12,  5 } },
-    { {  0, 18,  5 } },
-    { {  0, 23,  5 } },
-    { {  0,  5,  5 } },
-    { {  0,  8,  4 } },
-    { {  0, 14,  5 } },
-    { {  0, 20,  5 } },
-    { {  0,  2,  5 } },
-    { { 16,  7,  4 } },
-    { {  0, 11,  5 } },
-    { {  0, 17,  5 } },
-    { {  0, 22,  5 } },
-    { {  0,  4,  5 } },
-    { { 16,  8,  4 } },
-    { {  0, 13,  5 } },
-    { {  0, 19,  5 } },
-    { {  0,  1,  5 } },
-    { { 16,  6,  4 } },
-    { {  0, 10,  5 } },
-    { {  0, 16,  5 } },
-    { {  0, 28,  5 } },
-    { {  0, 27,  5 } },
-    { {  0, 26,  5 } },
-    { {  0, 25,  5 } },
-    { {  0, 24,  5 } },
+    /* base, symbol, bits */
+    { {  0,  0,  5 } }, { {  0,  6,  4 } },
+    { {  0,  9,  5 } }, { {  0, 15,  5 } },
+    { {  0, 21,  5 } }, { {  0,  3,  5 } },
+    { {  0,  7,  4 } }, { {  0, 12,  5 } },
+    { {  0, 18,  5 } }, { {  0, 23,  5 } },
+    { {  0,  5,  5 } }, { {  0,  8,  4 } },
+    { {  0, 14,  5 } }, { {  0, 20,  5 } },
+    { {  0,  2,  5 } }, { { 16,  7,  4 } },
+    { {  0, 11,  5 } }, { {  0, 17,  5 } },
+    { {  0, 22,  5 } }, { {  0,  4,  5 } },
+    { { 16,  8,  4 } }, { {  0, 13,  5 } },
+    { {  0, 19,  5 } }, { {  0,  1,  5 } },
+    { { 16,  6,  4 } }, { {  0, 10,  5 } },
+    { {  0, 16,  5 } }, { {  0, 28,  5 } },
+    { {  0, 27,  5 } }, { {  0, 26,  5 } },
+    { {  0, 25,  5 } }, { {  0, 24,  5 } },
 };   /* OF_defaultDTable */
 
 /*! ZSTD_buildSeqTable() :
@@ -927,8 +801,6 @@ size_t ZSTD_execSequenceLast7(BYTE* op,
 }
 
 
-
-
 static seq_t ZSTD_decodeSequence(seqState_t* seqState)
 {
     seq_t seq;
@@ -1031,7 +903,7 @@ size_t ZSTD_execSequence(BYTE* op,
 
     /* copy Match */
     if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix */
+        /* offset beyond prefix -> go into extDict */
         if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
         match = dictEnd + (match - base);
         if (match + sequence.matchLength <= dictEnd) {

From 202082f285ed5a9d971b29a42f52ae5bf9995584 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Fri, 28 Apr 2017 16:56:39 -0700
Subject: [PATCH 237/255] sync bitstream from FSE project

add assert into unsafe *_fast() variants
---
 doc/zstd_manual.html   |  2 +-
 lib/common/bitstream.h | 17 +++++++++++++++--
 2 files changed, 16 insertions(+), 3 deletions(-)

diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index 4755396e3..2e77e7742 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -499,7 +499,7 @@ typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; v
     Note : this use case also happens when using a non-conformant dictionary.
   - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
   - This is not a Zstandard frame.
-  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. 
+  When identifying the exact failure cause, it's possible to use ZSTD_getFrameParams(), which will provide a more precise error code. 
 </p></pre><BR>
 
 <a name="Chapter16"></a><h2>Advanced streaming functions</h2><pre></pre>
diff --git a/lib/common/bitstream.h b/lib/common/bitstream.h
index 0e3d2fc55..c7a764465 100644
--- a/lib/common/bitstream.h
+++ b/lib/common/bitstream.h
@@ -2,7 +2,7 @@
    bitstream
    Part of FSE library
    header file (to include)
-   Copyright (C) 2013-2016, Yann Collet.
+   Copyright (C) 2013-2017, Yann Collet.
 
    BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
 
@@ -53,6 +53,16 @@ extern "C" {
 #include "error_private.h"  /* error codes and messages */
 
 
+/*-*************************************
+*  Debug
+***************************************/
+#if defined(BIT_DEBUG) && (BIT_DEBUG>=1)
+#  include <assert.h>
+#else
+#  define assert(condition) ((void)0)
+#endif
+
+
 /*=========================================
 *  Target specific
 =========================================*/
@@ -209,6 +219,7 @@ MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
  *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
 MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
 {
+    assert((value>>nbBits) == 0);
     bitC->bitContainer |= value << bitC->bitPos;
     bitC->bitPos += nbBits;
 }
@@ -336,10 +347,11 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
 }
 
 /*! BIT_lookBitsFast() :
-*   unsafe version; only works only if nbBits >= 1 */
+ *  unsafe version; only works if nbBits >= 1 */
 MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
 {
     U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+    assert(nbBits >= 1);
     return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
 }
 
@@ -365,6 +377,7 @@ MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
 MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
 {
     size_t const value = BIT_lookBitsFast(bitD, nbBits);
+    assert(nbBits >= 1);
     BIT_skipBits(bitD, nbBits);
     return value;
 }

From f39a6731ec0f2e83964ed3f732f5492fb7fe7c78 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 1 May 2017 09:56:03 -0700
Subject: [PATCH 238/255] sync bitstream.h from fse library

---
 lib/common/bitstream.h | 55 +++++++++++++++++++++++++++---------------
 1 file changed, 36 insertions(+), 19 deletions(-)

diff --git a/lib/common/bitstream.h b/lib/common/bitstream.h
index c7a764465..ad07b2aa9 100644
--- a/lib/common/bitstream.h
+++ b/lib/common/bitstream.h
@@ -84,7 +84,7 @@ extern "C" {
 typedef struct
 {
     size_t bitContainer;
-    int    bitPos;
+    unsigned bitPos;
     char*  startPtr;
     char*  ptr;
     char*  endPtr;
@@ -122,6 +122,7 @@ typedef struct
     unsigned bitsConsumed;
     const char* ptr;
     const char* start;
+    const char* limitPtr;
 } BIT_DStream_t;
 
 typedef enum { BIT_DStream_unfinished = 0,
@@ -173,7 +174,10 @@ MEM_STATIC unsigned BIT_highbit32 (register U32 val)
 #   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
     return 31 - __builtin_clz (val);
 #   else   /* Software version */
-    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+    static const unsigned DeBruijnClz[32] = { 0,  9,  1, 10, 13, 21,  2, 29,
+                                             11, 14, 16, 18, 22, 25,  3, 30,
+                                              8, 12, 20, 28, 15, 17, 24,  7,
+                                             19, 27, 23,  6, 26,  5,  4, 31 };
     U32 v = val;
     v |= v >> 1;
     v |= v >> 2;
@@ -185,31 +189,36 @@ MEM_STATIC unsigned BIT_highbit32 (register U32 val)
 }
 
 /*=====    Local Constants   =====*/
-static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F, 0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF, 0x1FFFF, 0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF,  0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF };   /* up to 26 bits */
+static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F,
+                                    0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF,
+                                    0xFFFF, 0x1FFFF, 0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF,
+                                    0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF };   /* up to 26 bits */
 
 
 /*-**************************************************************
 *  bitStream encoding
 ****************************************************************/
 /*! BIT_initCStream() :
- *  `dstCapacity` must be > sizeof(void*)
+ *  `dstCapacity` must be > sizeof(size_t)
  *  @return : 0 if success,
               otherwise an error code (can be tested using ERR_isError() ) */
-MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* startPtr, size_t dstCapacity)
+MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
+                                  void* const startPtr, size_t const dstCapacity)
 {
     bitC->bitContainer = 0;
     bitC->bitPos = 0;
     bitC->startPtr = (char*)startPtr;
     bitC->ptr = bitC->startPtr;
-    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
-    if (dstCapacity <= sizeof(bitC->ptr)) return ERROR(dstSize_tooSmall);
+    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->bitContainer);
+    if (dstCapacity <= sizeof(bitC->bitContainer)) return ERROR(dstSize_tooSmall);
     return 0;
 }
 
 /*! BIT_addBits() :
     can add up to 26 bits into `bitC`.
     Does not check for register overflow ! */
-MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
+MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
+                            size_t const value, unsigned const nbBits)
 {
     bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
     bitC->bitPos += nbBits;
@@ -217,7 +226,8 @@ MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
 
 /*! BIT_addBitsFast() :
  *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
-MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits)
+MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
+                                size_t const value, unsigned const nbBits)
 {
     assert((value>>nbBits) == 0);
     bitC->bitContainer |= value << bitC->bitPos;
@@ -225,22 +235,27 @@ MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBi
 }
 
 /*! BIT_flushBitsFast() :
+ *  assumption : bitContainer has not overflowed
  *  unsafe version; does not check buffer overflow */
 MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
 {
     size_t const nbBytes = bitC->bitPos >> 3;
+    assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
     MEM_writeLEST(bitC->ptr, bitC->bitContainer);
     bitC->ptr += nbBytes;
+    assert(bitC->ptr <= bitC->endPtr);
     bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+    bitC->bitContainer >>= nbBytes*8;
 }
 
 /*! BIT_flushBits() :
+ *  assumption : bitContainer has not overflowed
  *  safe version; check for buffer overflow, and prevents it.
  *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
 MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
 {
     size_t const nbBytes = bitC->bitPos >> 3;
+    assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
     MEM_writeLEST(bitC->ptr, bitC->bitContainer);
     bitC->ptr += nbBytes;
     if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
@@ -275,15 +290,16 @@ MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, si
 {
     if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
 
+    bitD->start = (const char*)srcBuffer;
+    bitD->limitPtr = bitD->start + sizeof(bitD->bitContainer);
+
     if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
-        bitD->start = (const char*)srcBuffer;
         bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
         bitD->bitContainer = MEM_readLEST(bitD->ptr);
         { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
           bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
           if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
     } else {
-        bitD->start = (const char*)srcBuffer;
         bitD->ptr   = bitD->start;
         bitD->bitContainer = *(const BYTE*)(bitD->start);
         switch(srcSize)
@@ -341,8 +357,8 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
 #if defined(__BMI__) && defined(__GNUC__)   /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
     return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
 #else
-    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
+    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
+    return ((bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> 1) >> ((regMask-nbBits) & regMask);
 #endif
 }
 
@@ -350,9 +366,9 @@ MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
  *  unsafe version; only works if nbBits >= 1 */
 MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
 {
-    U32 const bitMask = sizeof(bitD->bitContainer)*8 - 1;
+    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
     assert(nbBits >= 1);
-    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
+    return (bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> (((regMask+1)-nbBits) & regMask);
 }
 
 MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
@@ -389,10 +405,10 @@ MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
               if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
 MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
 {
-    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should not happen => corruption detected */
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* overflow detected, like end of stream */
         return BIT_DStream_overflow;
 
-    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
+    if (bitD->ptr >= bitD->limitPtr) {
         bitD->ptr -= bitD->bitsConsumed >> 3;
         bitD->bitsConsumed &= 7;
         bitD->bitContainer = MEM_readLEST(bitD->ptr);
@@ -402,6 +418,7 @@ MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
         if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
         return BIT_DStream_completed;
     }
+    /* start < ptr < limitPtr */
     {   U32 nbBytes = bitD->bitsConsumed >> 3;
         BIT_DStream_status result = BIT_DStream_unfinished;
         if (bitD->ptr - nbBytes < bitD->start) {
@@ -410,7 +427,7 @@ MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
         }
         bitD->ptr -= nbBytes;
         bitD->bitsConsumed -= nbBytes*8;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD->bitContainer), otherwise bitD->ptr == bitD->start */
         return result;
     }
 }

From 33c38b092538717de110fb03cf313a5095537a8f Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 1 May 2017 11:12:30 -0700
Subject: [PATCH 239/255] fixed const in prototype, that Visual doesn't accept

---
 lib/common/bitstream.h | 15 +++++++--------
 1 file changed, 7 insertions(+), 8 deletions(-)

diff --git a/lib/common/bitstream.h b/lib/common/bitstream.h
index ad07b2aa9..ca42850df 100644
--- a/lib/common/bitstream.h
+++ b/lib/common/bitstream.h
@@ -203,7 +203,7 @@ static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F,
  *  @return : 0 if success,
               otherwise an error code (can be tested using ERR_isError() ) */
 MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
-                                  void* const startPtr, size_t const dstCapacity)
+                                  void* startPtr, size_t dstCapacity)
 {
     bitC->bitContainer = 0;
     bitC->bitPos = 0;
@@ -218,7 +218,7 @@ MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
     can add up to 26 bits into `bitC`.
     Does not check for register overflow ! */
 MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
-                            size_t const value, unsigned const nbBits)
+                            size_t value, unsigned nbBits)
 {
     bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
     bitC->bitPos += nbBits;
@@ -227,7 +227,7 @@ MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
 /*! BIT_addBitsFast() :
  *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
 MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
-                                size_t const value, unsigned const nbBits)
+                                size_t value, unsigned nbBits)
 {
     assert((value>>nbBits) == 0);
     bitC->bitContainer |= value << bitC->bitPos;
@@ -251,7 +251,8 @@ MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
 /*! BIT_flushBits() :
  *  assumption : bitContainer has not overflowed
  *  safe version; check for buffer overflow, and prevents it.
- *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
+ *  note : does not signal buffer overflow.
+ *  overflow will be revealed later on using BIT_closeCStream() */
 MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
 {
     size_t const nbBytes = bitC->bitPos >> 3;
@@ -260,7 +261,7 @@ MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
     bitC->ptr += nbBytes;
     if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
     bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;   /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
+    bitC->bitContainer >>= nbBytes*8;
 }
 
 /*! BIT_closeCStream() :
@@ -270,9 +271,7 @@ MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
 {
     BIT_addBitsFast(bitC, 1, 1);   /* endMark */
     BIT_flushBits(bitC);
-
-    if (bitC->ptr >= bitC->endPtr) return 0; /* doesn't fit within authorized budget : cancel */
-
+    if (bitC->ptr >= bitC->endPtr) return 0; /* overflow detected */
     return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
 }
 

From b184589c4c8d33ce6960eb5a1114f133e957cfbc Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Mon, 1 May 2017 11:22:24 -0700
Subject: [PATCH 240/255] minor code refactoring for clarity

---
 lib/decompress/zstd_decompress.c | 70 ++++++++++++++++++++------------
 1 file changed, 44 insertions(+), 26 deletions(-)

diff --git a/lib/decompress/zstd_decompress.c b/lib/decompress/zstd_decompress.c
index 634e2152e..910f9ab78 100644
--- a/lib/decompress/zstd_decompress.c
+++ b/lib/decompress/zstd_decompress.c
@@ -815,21 +815,26 @@ static seq_t ZSTD_decodeSequence(seqState_t* seqState)
     U32 const totalBits = llBits+mlBits+ofBits;
 
     static const U32 LL_base[MaxLL+1] = {
-                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
-                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+                             0,    1,    2,     3,     4,     5,     6,      7,
+                             8,    9,   10,    11,    12,    13,    14,     15,
+                            16,   18,   20,    22,    24,    28,    32,     40,
+                            48,   64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
                             0x2000, 0x4000, 0x8000, 0x10000 };
 
     static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+                             3,  4,  5,    6,     7,     8,     9,    10,
+                            11, 12, 13,   14,    15,    16,    17,    18,
+                            19, 20, 21,   22,    23,    24,    25,    26,
+                            27, 28, 29,   30,    31,    32,    33,    34,
+                            35, 37, 39,   41,    43,    47,    51,    59,
+                            67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
                             0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
 
     static const U32 OF_base[MaxOff+1] = {
-                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+                     0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+                     0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+                     0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+                     0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
 
     /* sequence */
     {   size_t offset;
@@ -1028,21 +1033,26 @@ FORCE_INLINE seq_t ZSTD_decodeSequenceLong_generic(seqState_t* seqState, int con
     U32 const totalBits = llBits+mlBits+ofBits;
 
     static const U32 LL_base[MaxLL+1] = {
-                             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,   10,    11,    12,    13,    14,     15,
-                            16, 18, 20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+                             0,  1,    2,     3,     4,     5,     6,      7,
+                             8,  9,   10,    11,    12,    13,    14,     15,
+                            16, 18,   20,    22,    24,    28,    32,     40,
+                            48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
                             0x2000, 0x4000, 0x8000, 0x10000 };
 
     static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39, 41, 43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+                             3,  4,  5,    6,     7,     8,     9,    10,
+                            11, 12, 13,   14,    15,    16,    17,    18,
+                            19, 20, 21,   22,    23,    24,    25,    26,
+                            27, 28, 29,   30,    31,    32,    33,    34,
+                            35, 37, 39,   41,    43,    47,    51,    59,
+                            67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
                             0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
 
     static const U32 OF_base[MaxOff+1] = {
-                             0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                             0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                             0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                             0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
+                     0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+                     0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+                     0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+                     0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD };
 
     /* sequence */
     {   size_t offset;
@@ -1987,15 +1997,18 @@ unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
 }
 
 /*! ZSTD_getDictID_fromFrame() :
- *  Provides the dictID required to decompressed the frame stored within `src`.
+ *  Provides the dictID required to decompresse frame stored within `src`.
  *  If @return == 0, the dictID could not be decoded.
  *  This could for one of the following reasons :
- *  - The frame does not require a dictionary to be decoded (most common case).
- *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
+ *  - The frame does not require a dictionary (most common case).
+ *  - The frame was built with dictID intentionally removed.
+ *    Needed dictionary is a hidden information.
  *    Note : this use case also happens when using a non-conformant dictionary.
- *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
+ *  - `srcSize` is too small, and as a result, frame header could not be decoded.
+ *    Note : possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`.
  *  - This is not a Zstandard frame.
- *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
+ *  When identifying the exact failure cause, it's possible to use
+ *  ZSTD_getFrameParams(), which will provide a more precise error code. */
 unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
 {
     ZSTD_frameParams zfp = { 0 , 0 , 0 , 0 };
@@ -2123,7 +2136,9 @@ size_t ZSTD_initDStream(ZSTD_DStream* zds)
     return ZSTD_initDStream_usingDict(zds, NULL, 0);
 }
 
-size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)  /**< note : ddict will just be referenced, and must outlive decompression session */
+/* ZSTD_initDStream_usingDDict() :
+ * ddict will just be referenced, and must outlive decompression session */
+size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)
 {
     size_t const initResult = ZSTD_initDStream(zds);
     zds->ddict = ddict;
@@ -2153,8 +2168,11 @@ size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds,
 
 size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
 {
-    if (zds==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*zds) + ZSTD_sizeof_DCtx(zds->dctx) + ZSTD_sizeof_DDict(zds->ddictLocal) + zds->inBuffSize + zds->outBuffSize;
+    if (zds==NULL) return 0;   /* support sizeof NULL */
+    return sizeof(*zds)
+           + ZSTD_sizeof_DCtx(zds->dctx)
+           + ZSTD_sizeof_DDict(zds->ddictLocal)
+           + zds->inBuffSize + zds->outBuffSize;
 }
 
 

From feba969a6932d35b97701e4581ae042dcc32ab00 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 1 May 2017 10:13:56 -0700
Subject: [PATCH 241/255] Fix LZ4_MSG in xzstd

---
 programs/Makefile | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/programs/Makefile b/programs/Makefile
index 2619614c5..2ab29e1ef 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -145,7 +145,7 @@ zstd-nogz : ZLIB_MSG := $(NO_ZLIB_MSG)
 zstd-nogz : LZMA_MSG := $(NO_LZMA_MSG)
 xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
-xzstd : LZ4_MSG := $(NO_LZMA_MSG)
+xzstd : LZ4_MSG := $(NO_LZ4_MSG)
 zstd4 : CPPFLAGS += $(ZLIBCPP) $(LZ4CPP)
 zstd4 : LDFLAGS += $(ZLIBLD) $(LZ4LD)
 zstd4 : LZMA_MSG := $(NO_LZMA_MSG)

From 865918dd041ec7bdfb730ecc2c346659e469216e Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 1 May 2017 10:14:15 -0700
Subject: [PATCH 242/255] Fix typo in zdict.h

---
 lib/dictBuilder/zdict.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/dictBuilder/zdict.h b/lib/dictBuilder/zdict.h
index 669b78d08..9b53de346 100644
--- a/lib/dictBuilder/zdict.h
+++ b/lib/dictBuilder/zdict.h
@@ -88,7 +88,7 @@ ZDICTLIB_API size_t ZDICT_trainFromBuffer_advanced(void* dictBuffer, size_t dict
 
 /*! COVER_params_t :
     For all values 0 means default.
-    kMin and d are the only required parameters.
+    k and d are the only required parameters.
 */
 typedef struct {
     unsigned k;                  /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */

From f2d9ef1dc0d491b75877a9200876a7c16dd9694d Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 1 May 2017 10:25:49 -0700
Subject: [PATCH 243/255] [cover] Optimize case where d <= 8

---
 lib/dictBuilder/cover.c | 37 ++++++++++++++++++++++++++++++-------
 programs/zstd.1         |  4 ++--
 programs/zstd.1.md      |  3 ++-
 3 files changed, 34 insertions(+), 10 deletions(-)

diff --git a/lib/dictBuilder/cover.c b/lib/dictBuilder/cover.c
index 1db42f95b..4235f112b 100644
--- a/lib/dictBuilder/cover.c
+++ b/lib/dictBuilder/cover.c
@@ -234,10 +234,22 @@ static size_t COVER_sum(const size_t *samplesSizes, unsigned nbSamples) {
  * Returns 1 if the dmer at lp is greater than the dmer at rp.
  */
 static int COVER_cmp(COVER_ctx_t *ctx, const void *lp, const void *rp) {
-  const U32 lhs = *(const U32 *)lp;
-  const U32 rhs = *(const U32 *)rp;
+  U32 const lhs = *(U32 const *)lp;
+  U32 const rhs = *(U32 const *)rp;
   return memcmp(ctx->samples + lhs, ctx->samples + rhs, ctx->d);
 }
+/**
+ * Faster version for d <= 8.
+ */
+static int COVER_cmp8(COVER_ctx_t *ctx, const void *lp, const void *rp) {
+  U64 const mask = (ctx->d == 8) ? (U64)-1 : (((U64)1 << (8 * ctx->d)) - 1);
+  U64 const lhs = MEM_readLE64(ctx->samples + *(U32 const *)lp) & mask;
+  U64 const rhs = MEM_readLE64(ctx->samples + *(U32 const *)rp) & mask;
+  if (lhs < rhs) {
+    return -1;
+  }
+  return (lhs > rhs);
+}
 
 /**
  * Same as COVER_cmp() except ties are broken by pointer value
@@ -251,6 +263,16 @@ static int COVER_strict_cmp(const void *lp, const void *rp) {
   }
   return result;
 }
+/**
+ * Faster version for d <= 8.
+ */
+static int COVER_strict_cmp8(const void *lp, const void *rp) {
+  int result = COVER_cmp8(g_ctx, lp, rp);
+  if (result == 0) {
+    result = lp < rp ? -1 : 1;
+  }
+  return result;
+}
 
 /**
  * Returns the first pointer in [first, last) whose element does not compare
@@ -506,7 +528,7 @@ static int COVER_ctx_init(COVER_ctx_t *ctx, const void *samplesBuffer,
   const BYTE *const samples = (const BYTE *)samplesBuffer;
   const size_t totalSamplesSize = COVER_sum(samplesSizes, nbSamples);
   /* Checks */
-  if (totalSamplesSize < d ||
+  if (totalSamplesSize < MAX(d, sizeof(U64)) ||
       totalSamplesSize >= (size_t)COVER_MAX_SAMPLES_SIZE) {
     DISPLAYLEVEL(1, "Total samples size is too large, maximum size is %u MB\n",
                  (COVER_MAX_SAMPLES_SIZE >> 20));
@@ -520,7 +542,7 @@ static int COVER_ctx_init(COVER_ctx_t *ctx, const void *samplesBuffer,
   ctx->samplesSizes = samplesSizes;
   ctx->nbSamples = nbSamples;
   /* Partial suffix array */
-  ctx->suffixSize = totalSamplesSize - d + 1;
+  ctx->suffixSize = totalSamplesSize - MAX(d, sizeof(U64)) + 1;
   ctx->suffix = (U32 *)malloc(ctx->suffixSize * sizeof(U32));
   /* Maps index to the dmerID */
   ctx->dmerAt = (U32 *)malloc(ctx->suffixSize * sizeof(U32));
@@ -554,7 +576,8 @@ static int COVER_ctx_init(COVER_ctx_t *ctx, const void *samplesBuffer,
     }
     /* qsort doesn't take an opaque pointer, so pass as a global */
     g_ctx = ctx;
-    qsort(ctx->suffix, ctx->suffixSize, sizeof(U32), &COVER_strict_cmp);
+    qsort(ctx->suffix, ctx->suffixSize, sizeof(U32),
+          (ctx->d <= 8 ? &COVER_strict_cmp8 : &COVER_strict_cmp));
   }
   DISPLAYLEVEL(2, "Computing frequencies\n");
   /* For each dmer group (group of positions with the same first d bytes):
@@ -564,8 +587,8 @@ static int COVER_ctx_init(COVER_ctx_t *ctx, const void *samplesBuffer,
    * 2. We calculate how many samples the dmer occurs in and save it in
    *    freqs[dmerId].
    */
-  COVER_groupBy(ctx->suffix, ctx->suffixSize, sizeof(U32), ctx, &COVER_cmp,
-                &COVER_group);
+  COVER_groupBy(ctx->suffix, ctx->suffixSize, sizeof(U32), ctx,
+                (ctx->d <= 8 ? &COVER_cmp8 : &COVER_cmp), &COVER_group);
   ctx->freqs = ctx->suffix;
   ctx->suffix = NULL;
   return 1;
diff --git a/programs/zstd.1 b/programs/zstd.1
index 999dc8169..5bd966a84 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -1,5 +1,5 @@
 .
-.TH "ZSTD" "1" "April 2017" "zstd 1.1.5" "User Commands"
+.TH "ZSTD" "1" "May 2017" "zstd 1.2.0" "User Commands"
 .
 .SH "NAME"
 \fBzstd\fR \- zstd, zstdmt, unzstd, zstdcat \- Compress or decompress \.zst files
@@ -188,7 +188,7 @@ dictionary selectivity level (default: 9) the smaller the value, the denser the
 .
 .TP
 \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]\.
+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, 8], but no more than 24\. When \fId\fR <= 8, the dictionary builder will run significantly faster\. Good values for \fIk\fR vary widely based on the input data, but a safe range is [32, 2048]\.
 .
 .br
 Example: \fB\-\-train \-\-cover=k=64,d=8 FILEs\fR\.
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index f2d04d16f..0919da702 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -186,7 +186,8 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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].
+    Generally _d_ should be in the range [6, 8], but no more than 24.
+    When _d_ <= 8, the dictionary builder will run significantly faster.
     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`.

From 020b960e13499cb2cd524cc6b7ddb0ccbd76c361 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 1 May 2017 21:26:33 -0700
Subject: [PATCH 244/255] [cover] Make optimization faster

---
 lib/dictBuilder/cover.c | 4 ++--
 programs/zstd.1         | 6 +++---
 programs/zstd.1.md      | 9 +++------
 3 files changed, 8 insertions(+), 11 deletions(-)

diff --git a/lib/dictBuilder/cover.c b/lib/dictBuilder/cover.c
index 4235f112b..0e156bd58 100644
--- a/lib/dictBuilder/cover.c
+++ b/lib/dictBuilder/cover.c
@@ -939,8 +939,8 @@ ZDICTLIB_API size_t COVER_optimizeTrainFromBuffer(void *dictBuffer,
   /* constants */
   const unsigned nbThreads = parameters->nbThreads;
   const unsigned kMinD = parameters->d == 0 ? 6 : parameters->d;
-  const unsigned kMaxD = parameters->d == 0 ? 16 : parameters->d;
-  const unsigned kMinK = parameters->k == 0 ? kMaxD : parameters->k;
+  const unsigned kMaxD = parameters->d == 0 ? 8 : parameters->d;
+  const unsigned kMinK = parameters->k == 0 ? 40 + kMaxD : parameters->k;
   const unsigned kMaxK = parameters->k == 0 ? 2048 : parameters->k;
   const unsigned kSteps = parameters->steps == 0 ? 32 : parameters->steps;
   const unsigned kStepSize = MAX((kMaxK - kMinK) / kSteps, 1);
diff --git a/programs/zstd.1 b/programs/zstd.1
index 5bd966a84..648c3365c 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -195,13 +195,13 @@ 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]\.
+If \fIsteps\fR is not specified, the default value of 32 is used\. If \fIk\fR is not specified, the \fIk\fR values in [48, 2048] are checked for each value of \fId\fR\. If \fId\fR is not specified, the values checked are [6, 8]\.
 .
 .IP
 Runs the cover dictionary builder for each parameter set and saves the optimal parameters and dictionary\. Prints optimal parameters and writes optimal dictionary into 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])\.
+The parameter \fIk\fR is more sensitive than \fId\fR, and is faster to optimize over\.
 .
 .IP
 Examples :
@@ -210,7 +210,7 @@ Examples :
 \fBzstd \-\-train \-\-optimize\-cover FILEs\fR
 .
 .IP
-\fBzstd \-\-train \-\-optimize\-cover=d=d,steps=512 FILEs\fR
+\fBzstd \-\-train \-\-optimize\-cover=d=8,steps=512 FILEs\fR
 .
 .SH "BENCHMARK"
 .
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index 0919da702..ea346cfb7 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -194,9 +194,9 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
 
 * `--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
+    If _k_ is not specified, the _k_ values in [48, 2048] are checked for each
     value of _d_.
-    If _d_ is not specified, the values checked are [6, 8, ..., 16].
+    If _d_ is not specified, the values checked are [6, 8].
 
     Runs the cover dictionary builder for each parameter set
     and saves the optimal parameters and dictionary.
@@ -204,15 +204,12 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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]).
 
     Examples :
 
     `zstd --train --optimize-cover FILEs`
 
-    `zstd --train --optimize-cover=d=d,steps=512 FILEs`
+    `zstd --train --optimize-cover=d=8,steps=512 FILEs`
 
 
 BENCHMARK

From f376d47c11e083c08a35ec3de6e4a66b7da60b14 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Mon, 1 May 2017 23:40:20 -0700
Subject: [PATCH 245/255] [CLI] Switch dictionary builder on CLI to cover

---
 lib/dictBuilder/cover.c |  6 ++--
 programs/zstd.1         | 54 ++++++++++++++++++-------------
 programs/zstd.1.md      | 71 +++++++++++++++++++++++------------------
 programs/zstdcli.c      | 62 ++++++++++++++++++++++++++---------
 tests/playTests.sh      | 32 +++++++++++++++----
 5 files changed, 147 insertions(+), 78 deletions(-)

diff --git a/lib/dictBuilder/cover.c b/lib/dictBuilder/cover.c
index 0e156bd58..1863c8f34 100644
--- a/lib/dictBuilder/cover.c
+++ b/lib/dictBuilder/cover.c
@@ -940,9 +940,9 @@ ZDICTLIB_API size_t COVER_optimizeTrainFromBuffer(void *dictBuffer,
   const unsigned nbThreads = parameters->nbThreads;
   const unsigned kMinD = parameters->d == 0 ? 6 : parameters->d;
   const unsigned kMaxD = parameters->d == 0 ? 8 : parameters->d;
-  const unsigned kMinK = parameters->k == 0 ? 40 + kMaxD : parameters->k;
-  const unsigned kMaxK = parameters->k == 0 ? 2048 : parameters->k;
-  const unsigned kSteps = parameters->steps == 0 ? 32 : parameters->steps;
+  const unsigned kMinK = parameters->k == 0 ? 50 : parameters->k;
+  const unsigned kMaxK = parameters->k == 0 ? 2000 : parameters->k;
+  const unsigned kSteps = parameters->steps == 0 ? 40 : parameters->steps;
   const unsigned kStepSize = MAX((kMaxK - kMinK) / kSteps, 1);
   const unsigned kIterations =
       (1 + (kMaxD - kMinD) / 2) * (1 + (kMaxK - kMinK) / kStepSize);
diff --git a/programs/zstd.1 b/programs/zstd.1
index 648c3365c..6cc5f7e9d 100644
--- a/programs/zstd.1
+++ b/programs/zstd.1
@@ -168,49 +168,57 @@ All arguments after \fB\-\-\fR are treated as files
 .
 .TP
 \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)\.
+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)\.
+.
+.IP
+Supports multithreading if \fBzstd\fR is compiled with threading support\. Additional parameters can be specified with \fB\-\-train\-cover\fR\. The legacy dictionary builder can be accessed with \fB\-\-train\-legacy\fR\. Equivalent to \fB\-\-train\-cover=d=8,steps=4\fR\.
 .
 .TP
 \fB\-o file\fR
-dictionary saved into \fBfile\fR (default name: dictionary)
+Dictionary saved into \fBfile\fR (default name: dictionary)\.
 .
 .TP
 \fB\-\-maxdict=#\fR
-limit dictionary to specified size (default : (112640)
+Limit dictionary to specified size (default: 112640)\.
 .
 .TP
 \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
-\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\.
+\fB\-\-train\-cover[=k#,d=#,steps=#]\fR
+Select parameters for the default dictionary builder algorithm named cover\. If \fId\fR is not specified, then it tries \fId\fR = 6 and \fId\fR = 8\. If \fIk\fR is not specified, then it tries \fIsteps\fR values in the range [50, 2000]\. If \fIsteps\fR is not specified, then the default value of 40 is used\. Requires that \fId\fR <= \fIk\fR\.
+.
+.IP
+Selects segments of size \fIk\fR with 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 size \fId\fR\. Generally \fId\fR should be in the range [6, 8], occasionally up to 16, but the algorithm will run faster with d <= \fI8\fR\. Good values for \fIk\fR vary widely based on the input data, but a safe range is [2 * \fId\fR, 2000]\. Supports multithreading if \fBzstd\fR is compiled with threading support\.
+.
+.IP
+Examples:
+.
+.IP
+\fBzstd \-\-train\-cover FILEs\fR
+.
+.IP
+\fBzstd \-\-train\-cover=k=50,d=8 FILEs\fR
+.
+.IP
+\fBzstd \-\-train\-cover=d=8,steps=500 FILEs\fR
+.
+.IP
+\fBzstd \-\-train\-cover=k=50 FILEs\fR
 .
 .TP
-\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, 8], but no more than 24\. When \fId\fR <= 8, the dictionary builder will run significantly faster\. Good values for \fIk\fR vary widely based on the input data, but a safe range is [32, 2048]\.
-.
-.br
-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 [48, 2048] are checked for each value of \fId\fR\. If \fId\fR is not specified, the values checked are [6, 8]\.
+\fB\-\-train\-legacy[=selectivity=#]\fR
+Use legacy dictionary builder algorithm with the given dictionary \fIselectivity\fR (default: 9)\. The smaller the \fIselectivity\fR value, the denser the dictionary, improving its efficiency but reducing its possible maximum size\. \fB\-\-train\-legacy=s=#\fR is also accepted\.
 .
 .IP
-Runs the cover dictionary builder for each parameter set and saves the optimal parameters and dictionary\. Prints optimal parameters and writes optimal dictionary into output file\. Supports multithreading if \fBzstd\fR is compiled with threading support\.
+Examples:
 .
 .IP
-The parameter \fIk\fR is more sensitive than \fId\fR, and is faster to optimize over\.
+\fBzstd \-\-train\-legacy FILEs\fR
 .
 .IP
-Examples :
-.
-.IP
-\fBzstd \-\-train \-\-optimize\-cover FILEs\fR
-.
-.IP
-\fBzstd \-\-train \-\-optimize\-cover=d=8,steps=512 FILEs\fR
+\fBzstd \-\-train\-legacy=selectivity=8 FILEs\fR
 .
 .SH "BENCHMARK"
 .
diff --git a/programs/zstd.1.md b/programs/zstd.1.md
index ea346cfb7..118c9f2f8 100644
--- a/programs/zstd.1.md
+++ b/programs/zstd.1.md
@@ -158,14 +158,19 @@ 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.
+    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).
+
+    Supports multithreading if `zstd` is compiled with threading support.
+    Additional parameters can be specified with `--train-cover`.
+    The legacy dictionary builder can be accessed with `--train-legacy`.
+    Equivalent to `--train-cover=d=8,steps=4`.
 * `-o file`:
-    dictionary saved into `file` (default name: dictionary)
+    Dictionary saved into `file` (default name: dictionary).
 * `--maxdict=#`:
-    limit dictionary to specified size (default : (112640)
+    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.
@@ -176,40 +181,44 @@ Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
     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.
+* `--train-cover[=k#,d=#,steps=#]`:
+    Select parameters for the default dictionary builder algorithm named cover.
+    If _d_ is not specified, then it tries _d_ = 6 and _d_ = 8.
+    If _k_ is not specified, then it tries _steps_ values in the range [50, 2000].
+    If _steps_ is not specified, then the default value of 40 is used.
+    Requires that _d_ <= _k_.
+
+    Selects segments of size _k_ with 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, 8], but no more than 24.
-    When _d_ <= 8, the dictionary builder will run significantly faster.
-    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 [48, 2048] are checked for each
-    value of _d_.
-    If _d_ is not specified, the values checked are [6, 8].
-
-    Runs the cover dictionary builder for each parameter set
-    and saves the optimal parameters and dictionary.
-    Prints optimal parameters and writes optimal dictionary into output file.
+    subsegments of size _d_.
+    Generally _d_ should be in the range [6, 8], occasionally up to 16, but the
+    algorithm will run faster with d <= _8_.
+    Good values for _k_ vary widely based on the input data, but a safe range is
+    [2 * _d_, 2000].
     Supports multithreading if `zstd` is compiled with threading support.
 
-    The parameter _k_ is more sensitive than _d_, and is faster to optimize over.
+    Examples:
 
-    Examples :
+    `zstd --train-cover FILEs`
 
-    `zstd --train --optimize-cover FILEs`
+    `zstd --train-cover=k=50,d=8 FILEs`
 
-    `zstd --train --optimize-cover=d=8,steps=512 FILEs`
+    `zstd --train-cover=d=8,steps=500 FILEs`
+
+    `zstd --train-cover=k=50 FILEs`
+
+* `--train-legacy[=selectivity=#]`:
+    Use legacy dictionary builder algorithm with the given dictionary
+    _selectivity_ (default: 9).
+    The smaller the _selectivity_ value, the denser the dictionary,
+    improving its efficiency but reducing its possible maximum size.
+    `--train-legacy=s=#` is also accepted.
+
+    Examples:
+
+    `zstd --train-legacy FILEs`
+
+    `zstd --train-legacy=selectivity=8 FILEs`
 
 
 BENCHMARK
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index 79bc84877..f6ce2e1a6 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -153,11 +153,10 @@ static int usage_advanced(const char* programName)
     DISPLAY( "\n");
     DISPLAY( "Dictionary builder :\n");
     DISPLAY( "--train ## : create a dictionary from a training set of files \n");
-    DISPLAY( "--cover=k=#,d=# : use the cover algorithm with parameters k and d \n");
-    DISPLAY( "--optimize-cover[=steps=#,k=#,d=#] : optimize cover parameters with optional parameters\n");
+    DISPLAY( "--train-cover[=k=#,d=#,steps=#] : use the cover algorithm with optional args\n");
+    DISPLAY( "--train-legacy[=s=#] : use the legacy algorithm with selectivity (default: %u)\n", g_defaultSelectivityLevel);
     DISPLAY( " -o file : `file` is dictionary name (default: %s) \n", g_defaultDictName);
     DISPLAY( "--maxdict=# : limit dictionary to specified size (default : %u) \n", g_defaultMaxDictSize);
-    DISPLAY( " -s#    : dictionary selectivity level (default: %u)\n", g_defaultSelectivityLevel);
     DISPLAY( "--dictID=# : force dictionary ID to specified value (default: random)\n");
 #endif
 #ifndef ZSTD_NOBENCH
@@ -241,11 +240,11 @@ static unsigned longCommandWArg(const char** stringPtr, const char* longCommand)
 #ifndef ZSTD_NODICT
 /**
  * parseCoverParameters() :
- * reads cover parameters from *stringPtr (e.g. "--cover=smoothing=100,kmin=48,kstep=4,kmax=64,d=8") into *params
+ * reads cover parameters from *stringPtr (e.g. "--train-cover=k=48,d=8,steps=32") into *params
  * @return 1 means that cover parameters were correct
  * @return 0 in case of malformed parameters
  */
-static unsigned parseCoverParameters(const char* stringPtr, COVER_params_t *params)
+static unsigned parseCoverParameters(const char* stringPtr, COVER_params_t* params)
 {
     memset(params, 0, sizeof(*params));
     for (; ;) {
@@ -255,9 +254,33 @@ static unsigned parseCoverParameters(const char* stringPtr, COVER_params_t *para
         return 0;
     }
     if (stringPtr[0] != 0) return 0;
-    DISPLAYLEVEL(4, "k=%u\nd=%u\nsteps=%u\n", params->k, params->d, params->steps);
+    DISPLAYLEVEL(4, "cover: k=%u\nd=%u\nsteps=%u\n", params->k, params->d, params->steps);
     return 1;
 }
+
+/**
+ * parseLegacyParameters() :
+ * reads legacy dictioanry builter parameters from *stringPtr (e.g. "--train-legacy=selectivity=8") into *selectivity
+ * @return 1 means that legacy dictionary builder parameters were correct
+ * @return 0 in case of malformed parameters
+ */
+static unsigned parseLegacyParameters(const char* stringPtr, unsigned* selectivity)
+{
+    if (!longCommandWArg(&stringPtr, "s=") && !longCommandWArg(&stringPtr, "selectivity=")) { return 0; }
+    *selectivity = readU32FromChar(&stringPtr);
+    if (stringPtr[0] != 0) return 0;
+    DISPLAYLEVEL(4, "legacy: selectivity=%u\n", *selectivity);
+    return 1;
+}
+
+static COVER_params_t defaultCoverParams(void)
+{
+    COVER_params_t params;
+    memset(&params, 0, sizeof(params));
+    params.d = 8;
+    params.steps = 4;
+    return params;
+}
 #endif
 
 
@@ -331,8 +354,8 @@ int main(int argCount, const char* argv[])
     unsigned fileNamesNb;
 #endif
 #ifndef ZSTD_NODICT
-    COVER_params_t coverParams;
-    int cover = 0;
+    COVER_params_t coverParams = defaultCoverParams();
+    int cover = 1;
 #endif
 
     /* init */
@@ -413,18 +436,26 @@ int main(int argCount, const char* argv[])
 
                     /* long commands with arguments */
 #ifndef ZSTD_NODICT
-                    if (longCommandWArg(&argument, "--cover=")) {
-                      cover=1; if (!parseCoverParameters(argument, &coverParams)) CLEAN_RETURN(badusage(programName));
-                      continue;
-                    }
-                    if (longCommandWArg(&argument, "--optimize-cover")) {
-                      cover=2;
+                    if (longCommandWArg(&argument, "--train-cover")) {
+                      operation = zom_train;
+                      outFileName = g_defaultDictName;
+                      cover = 1;
                       /* Allow optional arguments following an = */
                       if (*argument == 0) { memset(&coverParams, 0, sizeof(coverParams)); }
                       else if (*argument++ != '=') { CLEAN_RETURN(badusage(programName)); }
                       else if (!parseCoverParameters(argument, &coverParams)) { CLEAN_RETURN(badusage(programName)); }
                       continue;
                     }
+                    if (longCommandWArg(&argument, "--train-legacy")) {
+                      operation = zom_train;
+                      outFileName = g_defaultDictName;
+                      cover = 0;
+                      /* Allow optional arguments following an = */
+                      if (*argument == 0) { continue; }
+                      else if (*argument++ != '=') { CLEAN_RETURN(badusage(programName)); }
+                      else if (!parseLegacyParameters(argument, &dictSelect)) { CLEAN_RETURN(badusage(programName)); }
+                      continue;
+                    }
 #endif
                     if (longCommandWArg(&argument, "--threads=")) { nbThreads = readU32FromChar(&argument); continue; }
                     if (longCommandWArg(&argument, "--memlimit=")) { memLimit = readU32FromChar(&argument); continue; }
@@ -659,11 +690,12 @@ int main(int argCount, const char* argv[])
     if (operation==zom_train) {
 #ifndef ZSTD_NODICT
         if (cover) {
+            int const optimize = !coverParams.k || !coverParams.d;
             coverParams.nbThreads = nbThreads;
             coverParams.compressionLevel = dictCLevel;
             coverParams.notificationLevel = g_displayLevel;
             coverParams.dictID = dictID;
-            operationResult = DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, NULL, &coverParams, cover - 1);
+            operationResult = DiB_trainFromFiles(outFileName, maxDictSize, filenameTable, filenameIdx, NULL, &coverParams, optimize);
         } else {
             ZDICT_params_t dictParams;
             memset(&dictParams, 0, sizeof(dictParams));
diff --git a/tests/playTests.sh b/tests/playTests.sh
index 369506c2e..021fd59fe 100755
--- a/tests/playTests.sh
+++ b/tests/playTests.sh
@@ -314,9 +314,9 @@ esac
 rm -rf dirTestDict
 $ECHO "- dictionary builder on bogus input"
 $ECHO "Hello World" > tmp
-$ZSTD --train -q tmp && die "Dictionary training should fail : not enough input source"
+$ZSTD --train-legacy -q tmp && die "Dictionary training should fail : not enough input source"
 ./datagen -P0 -g10M > tmp
-$ZSTD --train -q tmp && die "Dictionary training should fail : source is pure noise"
+$ZSTD --train-legacy -q tmp && die "Dictionary training should fail : source is pure noise"
 rm tmp*
 
 
@@ -325,19 +325,39 @@ $ECHO "\n**** cover dictionary tests **** "
 TESTFILE=../programs/zstdcli.c
 ./datagen > tmpDict
 $ECHO "- Create first dictionary"
-$ZSTD --train --cover=k=46,d=8 *.c ../programs/*.c -o tmpDict
+$ZSTD --train-cover=k=46,d=8 *.c ../programs/*.c -o tmpDict
 cp $TESTFILE tmp
 $ZSTD -f tmp -D tmpDict
 $ZSTD -d tmp.zst -D tmpDict -fo result
 $DIFF $TESTFILE result
 $ECHO "- Create second (different) dictionary"
-$ZSTD --train --cover=k=56,d=8 *.c ../programs/*.c ../programs/*.h -o tmpDictC
+$ZSTD --train-cover=k=56,d=8 *.c ../programs/*.c ../programs/*.h -o tmpDictC
 $ZSTD -d tmp.zst -D tmpDictC -fo result && die "wrong dictionary not detected!"
 $ECHO "- Create dictionary with short dictID"
-$ZSTD --train --cover=k=46,d=8 *.c ../programs/*.c --dictID=1 -o tmpDict1
+$ZSTD --train-cover=k=46,d=8 *.c ../programs/*.c --dictID=1 -o tmpDict1
 cmp tmpDict tmpDict1 && die "dictionaries should have different ID !"
 $ECHO "- Create dictionary with size limit"
-$ZSTD --train --optimize-cover=steps=8 *.c ../programs/*.c -o tmpDict2 --maxdict=4K
+$ZSTD --train-cover=steps=8 *.c ../programs/*.c -o tmpDict2 --maxdict=4K
+rm tmp*
+
+$ECHO "\n**** legacy dictionary tests **** "
+
+TESTFILE=../programs/zstdcli.c
+./datagen > tmpDict
+$ECHO "- Create first dictionary"
+$ZSTD --train-legacy=selectivity=8 *.c ../programs/*.c -o tmpDict
+cp $TESTFILE tmp
+$ZSTD -f tmp -D tmpDict
+$ZSTD -d tmp.zst -D tmpDict -fo result
+$DIFF $TESTFILE result
+$ECHO "- Create second (different) dictionary"
+$ZSTD --train-legacy=s=5 *.c ../programs/*.c ../programs/*.h -o tmpDictC
+$ZSTD -d tmp.zst -D tmpDictC -fo result && die "wrong dictionary not detected!"
+$ECHO "- Create dictionary with short dictID"
+$ZSTD --train-legacy -s5 *.c ../programs/*.c --dictID=1 -o tmpDict1
+cmp tmpDict tmpDict1 && die "dictionaries should have different ID !"
+$ECHO "- Create dictionary with size limit"
+$ZSTD --train-legacy -s9 *.c ../programs/*.c -o tmpDict2 --maxdict=4K
 rm tmp*
 
 

From 7aada3ca44831d6d9b714427107b6c38390dcc31 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 12:14:12 -0700
Subject: [PATCH 246/255] updated NEWS for v1.2.0

---
 NEWS | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/NEWS b/NEWS
index b910e2993..407f3b8ac 100644
--- a/NEWS
+++ b/NEWS
@@ -3,6 +3,8 @@ cli : changed : Multithreading enabled by default (use target zstd-nomt or HAVE_
 cli : new : command -T0 means "detect and use nb of cores", by Sean Purcell
 cli : new : zstdmt symlink hardwired to `zstd -T0`
 cli : new : command --threads=# (#671)
+cli : changed : cover dictionary builder by default, for improved quality, by Nick Terrell
+cli : new : commands --train-cover and --train-legacy, to select dictionary algorithm and parameters
 cli : new : experimental target `zstd4`, with support for lz4 format, by Sean Purcell
 cli : fix : does not output compressed data on console
 cli : fix : ignore symbolic links unless --force specified,
@@ -11,8 +13,8 @@ API : added : prototypes ZSTD_*_usingCDict_advanced(), for direct control over f
 API : improved: ZSTDMT_compressCCtx() reduced memory usage
 API : fix : ZSTDMT_compressCCtx() now provides srcSize in header (#634)
 API : fix : src size stored in frame header is controlled at end of frame
-API : fix : enforced consistent rules for pledgedSrcSize==0
-API : fix : ensure error code "dstSizeTooSmall" is generated when dst size is too small
+API : fix : enforced consistent rules for pledgedSrcSize==0 (#641)
+API : fix : error code "GENERIC" replaced by "dstSizeTooSmall" when appropriate
 build: improved cmake script, by @Majlen
 build: enabled Multi-threading support for *BSD, by Baptiste Daroussin
 tools: updated Paramgrill. Command -O# provides best parameters for sample and speed target.

From 79a85e13719eba7dbd47877d706f941d624be286 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 2 May 2017 13:41:57 -0700
Subject: [PATCH 247/255] [btrfs] Update patch to use ZSTD_init{C,D}Stream()

---
 contrib/linux-kernel/btrfs.diff      | 14 +++++++-------
 contrib/linux-kernel/fs/btrfs/zstd.c | 12 ++++++------
 2 files changed, 13 insertions(+), 13 deletions(-)

diff --git a/contrib/linux-kernel/btrfs.diff b/contrib/linux-kernel/btrfs.diff
index b0f8b924b..51fc52fad 100644
--- a/contrib/linux-kernel/btrfs.diff
+++ b/contrib/linux-kernel/btrfs.diff
@@ -193,7 +193,7 @@ index 1f157fb..b0dec90 100644
  	BTRFS_FEAT_ATTR_PTR(raid56),
 diff --git a/fs/btrfs/zstd.c b/fs/btrfs/zstd.c
 new file mode 100644
-index 0000000..b7f319e
+index 0000000..010548c
 --- /dev/null
 +++ b/fs/btrfs/zstd.c
 @@ -0,0 +1,415 @@
@@ -291,10 +291,10 @@ index 0000000..b7f319e
 +	*total_in = 0;
 +
 +	/* Initialize the stream */
-+	stream = ZSTD_createCStream(params, len, workspace->mem,
++	stream = ZSTD_initCStream(params, len, workspace->mem,
 +			workspace->size);
 +	if (!stream) {
-+		pr_warn("BTRFS: ZSTD_createStream failed\n");
++		pr_warn("BTRFS: ZSTD_initStream failed\n");
 +		ret = -EIO;
 +		goto out;
 +	}
@@ -458,10 +458,10 @@ index 0000000..b7f319e
 +	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
 +	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
 +
-+	stream = ZSTD_createDStream(
++	stream = ZSTD_initDStream(
 +			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
 +	if (!stream) {
-+		pr_debug("BTRFS: ZSTD_createDStream failed\n");
++		pr_debug("BTRFS: ZSTD_initDStream failed\n");
 +		ret = -EIO;
 +		goto done;
 +	}
@@ -536,10 +536,10 @@ index 0000000..b7f319e
 +	unsigned long pg_offset = 0;
 +	char *kaddr;
 +
-+	stream = ZSTD_createDStream(
++	stream = ZSTD_initDStream(
 +			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
 +	if (!stream) {
-+		pr_warn("BTRFS: ZSTD_createDStream failed\n");
++		pr_warn("BTRFS: ZSTD_initDStream failed\n");
 +		ret = -EIO;
 +		goto finish;
 +	}
diff --git a/contrib/linux-kernel/fs/btrfs/zstd.c b/contrib/linux-kernel/fs/btrfs/zstd.c
index b7f319e7a..010548cea 100644
--- a/contrib/linux-kernel/fs/btrfs/zstd.c
+++ b/contrib/linux-kernel/fs/btrfs/zstd.c
@@ -92,10 +92,10 @@ static int zstd_compress_pages(struct list_head *ws,
 	*total_in = 0;
 
 	/* Initialize the stream */
-	stream = ZSTD_createCStream(params, len, workspace->mem,
+	stream = ZSTD_initCStream(params, len, workspace->mem,
 			workspace->size);
 	if (!stream) {
-		pr_warn("BTRFS: ZSTD_createStream failed\n");
+		pr_warn("BTRFS: ZSTD_initStream failed\n");
 		ret = -EIO;
 		goto out;
 	}
@@ -259,10 +259,10 @@ static int zstd_decompress_bio(struct list_head *ws, struct page **pages_in,
 	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
 	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
 
-	stream = ZSTD_createDStream(
+	stream = ZSTD_initDStream(
 			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
 	if (!stream) {
-		pr_debug("BTRFS: ZSTD_createDStream failed\n");
+		pr_debug("BTRFS: ZSTD_initDStream failed\n");
 		ret = -EIO;
 		goto done;
 	}
@@ -337,10 +337,10 @@ static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
 	unsigned long pg_offset = 0;
 	char *kaddr;
 
-	stream = ZSTD_createDStream(
+	stream = ZSTD_initDStream(
 			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
 	if (!stream) {
-		pr_warn("BTRFS: ZSTD_createDStream failed\n");
+		pr_warn("BTRFS: ZSTD_initDStream failed\n");
 		ret = -EIO;
 		goto finish;
 	}

From 99972fa9a8e7c42b83c428bc3bc1e86a2b7b3bf9 Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Tue, 2 May 2017 13:57:40 -0700
Subject: [PATCH 248/255] [btrfs] Fix typo in pr_warn() message

---
 contrib/linux-kernel/btrfs.diff      | 2 +-
 contrib/linux-kernel/fs/btrfs/zstd.c | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/contrib/linux-kernel/btrfs.diff b/contrib/linux-kernel/btrfs.diff
index 51fc52fad..92a6e2057 100644
--- a/contrib/linux-kernel/btrfs.diff
+++ b/contrib/linux-kernel/btrfs.diff
@@ -294,7 +294,7 @@ index 0000000..010548c
 +	stream = ZSTD_initCStream(params, len, workspace->mem,
 +			workspace->size);
 +	if (!stream) {
-+		pr_warn("BTRFS: ZSTD_initStream failed\n");
++		pr_warn("BTRFS: ZSTD_initCStream failed\n");
 +		ret = -EIO;
 +		goto out;
 +	}
diff --git a/contrib/linux-kernel/fs/btrfs/zstd.c b/contrib/linux-kernel/fs/btrfs/zstd.c
index 010548cea..706fa66ef 100644
--- a/contrib/linux-kernel/fs/btrfs/zstd.c
+++ b/contrib/linux-kernel/fs/btrfs/zstd.c
@@ -95,7 +95,7 @@ static int zstd_compress_pages(struct list_head *ws,
 	stream = ZSTD_initCStream(params, len, workspace->mem,
 			workspace->size);
 	if (!stream) {
-		pr_warn("BTRFS: ZSTD_initStream failed\n");
+		pr_warn("BTRFS: ZSTD_initCStream failed\n");
 		ret = -EIO;
 		goto out;
 	}

From 01a71739b0c38ab0deb00c10d5e84683abead2d9 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 14:39:03 -0700
Subject: [PATCH 249/255] updated DSpeed chart to remove 3D effect (#589)

---
 doc/images/Dspeed4.png | Bin 29425 -> 24692 bytes
 1 file changed, 0 insertions(+), 0 deletions(-)

diff --git a/doc/images/Dspeed4.png b/doc/images/Dspeed4.png
index a0c7f65c25312279b4b25294cbcdb6ecfa51ae4e..b7baef1ff3f7adc356d69bbabf2290bb38a1c994 100644
GIT binary patch
literal 24692
zcmeAS@N?(olHy`uVBq!ia0y~yV2Wg5V7kx2#=yW3BzV1vfq{XsILO_JVcj{ImkbOH
zoCO|{#S9GMLLkhTKL1h>1A_yDr;B4q1>@VhoO5JS=h{CoXLnandD7sZ;K0(fU;)d)
z1Phm^5iUovEnOJ-#T;#}b-S`SIz0Wrz`_!f5+3^@BCyagrtoiaSd$d<>8S<t8&z0}
zCbTG@oFD%-?DA#fnJ;~+maW$EueCG28~Zox>Tf&!?0vtlMZf3S@qAwOKZ}F|4JS{!
zH83zTv2X||To7s$)eiepc%VnpIBd(496u+ROn|V&oc*&65}p2C(}t*ZXmHSHO*=Pd
zrmW?L>Bp^mphh?>kY-d|EiDr-sNewBT&1m$@-^&SA;^4(28PBwmX<Yn1vRc<Ne+P*
zYa1q9jkY`vQ@%@3VAHOHA4Q>-EZENE6qf%~#vP{I&Edo=w&US2)9!I`MDCqhECW+M
zq%3zh?R4$a)6<t1xpwbbdwi0r_oX$Fn=f(e@41k>^GDIaCRW>d`Jt!2RyeY92tYzp
zS484YSMlA_>#;ApwAXp~+x<-0^<<Lwr4J7eThIBnuwBl}{@2C+OLNQb%?w);F_Dc&
zVnW&7((7Ly^4DABZaBy$d&+OFm1%74*Q+mAE}wVmTfeNenQZx;!pzyZ+g^t5<YWH{
zi8Ky@7wU~yrA|ieD#;XEch2hdnk_juH?27(xJYXI{C{7T-(2^&-`=kFA$R-<rfX}r
z-<!2=*Q-^0uFL)B&(quSpvk1}&ySK@nah_3`&p{;%Gp@Vt^Ia0^V}TEt((qHTP^#5
z7ZzRfS;Mqb{yx>O_w2X(m0|VyjPd1p)$ev*T2=pLvAnPP{F<U!HkCzHcVEX%xBK_8
zKYej*{qNiNtz<w!u+-Q5u8FI}?Y!M@FY#Hwnc!#futg*>@6;4cEVjHZd-!hm`+47P
zB=@g5RsZ*Oe0bE?W4GH4txSuaoX}bDl>Mm8njLQ|E;zEME)M_suki7)r56{wFPGSB
z^<;wcrkzn|r=0GOpL>0#ar(M*5BpRhp~R(Pka(!2ZtdBu-V|OblNI4pdnc|uE?;l6
zTX)9%2QQb;KX)&0+s(9}>u$ZCVVHbr^Le}3wRziO-X`S3;xktuV(r8=_pW_ECY^s~
zp23~+`?cB2XV}-*eXBb$L2+yC&)GMo+wZ)Qv-8i5tCerxAK7hHTB-vHyZ{|g1ikVN
zmaBX+@yqA=|83rGx$L(!y0>s%&7m3{){8rMWh@Mi`sbXTmTl919+qMLiM+TzL3DAz
z^SR}5Ql?oUW<U4tTj<=*ch*iXZqJUo^4$9y5)W_ses<dH5+Q4tGyiH_$X9&5^Z7jQ
z_`k2hFMI3noud1ALi^G^Yo+scBz`OV_U7i#b+@wD>=&JUKRFxChcBj25EZ_A-tzgJ
zFK3L;r+8cDY`N$*cb3%eq=y$XFE6{A$LY3^U9Ljm>|ASe-&rP_*2``d&DBd_hj`Or
zfjleQ+=@q?@qMq4>h1}>`{-Jn&T@g(oA1|tzk72M&&CNa_Edh}WEt{${r<YLQ~CA3
zZ@=ube&=C$(Kf8Qf9uvy^DCST_lrt=UYob?=Q9z1fj$XCrK5k=p4Q)Qvv&Kvs+TJk
z_jzTn-5OT5FYWZ&tm-N1khtYov(90k(4huN<Fpj-E#IGc?uyv0<+ftiEk2tM2TGny
zbWe-lEAwR2gDass%lCbr`|^S_|Jqv7$&d1PJZ#%i@bFO1-Zd-2bv&dNuCB}87W3Ee
zo-iZ_v;2xuh)*xx>J%0qW)zg5lO)AGy==Q_^t#=}Kl-3$=mo7to0QV|2~nk6<K`^C
zd3*ZVX|G*HWnhKzi>(g(eQMs9zLoKSmWmoH8zzKa>I=>Vm*Nf!ZZJ88ZT#*277~Ar
zlejn{Ro_}%RfBk~OIIO9ba(v~sCDFPo+|$1nfd;i_x`>sU;aZlC-hES)yt(O>F4IW
zIe#>CW9_XiMU98n{n+<O>vtQ-XRA~`oKWsxl0L6eZSRLe+`75f-fq7?Z{Nq>{3Y%3
zbr!vHwpM?isM|+A{k;C1<ubpyv+DjlmS1k+&a(E#qw`1iKDT}E=`K^~B4v_sLF@W)
z#-~C8n@(Mg&+=|yXgtIfQ}^@f%VW~{KA;r2>&>Rqml_zEZv|aH+AY5PeckunFQ@PS
zllu18#{AH2S8b2?NE%=ARG)k0<)qKg&-?%XbN>IFdG-H(ewo-`v*hykvJh{F6RX1N
zvq0t4Ej0mUx8mpL&enykiMY6J!q=Dn^;SpaU-V8~#8LHA<I<`FYu;H-(}|qa#w$JT
z-tT+gm)$MDZwo5){yt#0_t^jY?)yzyG39qlovy7a@$fv&1&ay?ZI*d8pH7zCul-(X
z71}b{e9uGP%(<o4R@R!={`yjK-uC+vR&KE+hRMg4nD2e*o4L5x%u9dYkEC5+uSH+p
zQ~5b7_5Y9K_RAWX*_XZDc3V$-a=oCkC8%iI99{AFc)$N-b^mkwqh4mSOtb&{(m(U&
zrqq{T*Vos!e?ID1|MPVGrOW>IbGO}0o4w`hwdm#P^J~rCZoMA&@<wvM@BF`S(u21Y
zhHk%Vd%Vy3-Hdhne!VhDIWghZQv07L{jWKNSsZzLaqIQC-QV__UlkVEwCeiuD3=C?
z#$~KY=PsPD|Myw%^!(y;mYLUM%g-J<E5857QIX=FSKGby_nQ2D6~5oAF#FAvV850B
zwdR)H%Dnk}ai5izZ0(neH-BrCe>$mN&XIgOZ+C9l>otcD^2*EA|M~c3>iQbh+tLqT
ze!1+we(DU<?66;Vp4&~YwR^Fk`BJ*w=b2yjzOU8im9^Ruw#+;~?7NI%SD5^UMSO;*
zrsvPj+0@xEH96!*=!sPY&$FZ$nOLfXIwsEFn0)+N*U{htLnG1Kzh1AOzt?TTDdubU
z|Np(eTzA_ICEFhlnqO|;|2J3cKvGa;OPj>WQ|jyU_k28dbK~s%eU;y&76-)t`!qe9
zQF~v1bl3NL)%o9Q|8$*?%?&)RVPF02P0o=ubu1a6y2x40ch;1>@pl_U)iaM;F0%Ev
z{Th-cv^_|9$J5(}$7Lq({~DFZsJQyj+|`*Z90D&qAH2=4ukM<E<I%Q<_J0oBr@W8<
zzU%r@*|Hmo)$`dGmR^rFul=%E{_HdHqvFTq>ubuq4VbR&|9g9X>f*@C7oFz|cN^SK
zs;|4P_e^7M<+GVLYgWqt`_L|X$USb~KhwO}cYD9zyLq|Md%B)4s3yH6egDU?H7Dx-
zf3Htp|9b8AII~w_^)b8e-!HqJtNE<#YQCYrc3$GUozLfe-Mx4HiUZpJ#RD#~Wr=~x
z<}W$|%D&I%Rp&+RtEr62Ub}VE?Yy6Xv-5Ukelue_x7_aQN|8p*Q`g&9?0Iu4?(+h%
z`|?#U7T(+_IIqv<(}^#$uJ1`pZNK_$|If4e>-P5ljN7OiwMD~qLZ|MtcG29rV3z$7
zylduP7yEqkoW<iFk%yPUY8e$*|EgWn3JRq_g=c9;g)286m04Bz_}JAx%O?|@FNH<t
zPOaVd`JDA;!PVdQ|NpBg@48C#%`;!SE>YJ<WyycV7V2%|h}FKm?S9?wTP@#r<lX7&
zj-DaNmE1jX-J)D!H6M?UA`f}Z?@Xxs*d3oD{Bd#L$1RUV!(%3X+7Pj&YPJ7smX<Zw
zBCUiOnOM9uKio*}U#h)+kJ0MtGxc2)m;KUxrXE{#QuXDI$9=2M-tXG!7XRzg^i7`c
zzoyQvoPYjj*0P*9wf(6Q^ON6QzgvEPZtset&u1j;yPdcD=<P#!g|k0=IL!b4gUQkf
zp*P-TMILQgGcC|ckdcYyl)8Yj6R5H_yJ?&EzxLnf`R|KVKh5YDeW-n{%IaZ@@TRt7
z8kf$R-;c>I`RfsKCu+_8q?PS8-Kh$nbj6<baK1g8^L0DV{}1i<DU%;O-f?wjsKnd;
zlmAw4UVF;&ReomM%C)zcoWi#L4u1`5|F1nz|L1u9m1m|$KXDYk)|)5OGrwl)m)Uu{
zR+=S=I<Bg_vcgW|h}Zj{Wq-e3Pk*S%A0VvmcV_>oys3BV|NqteH^*;H*S{me{weoe
zBVOipcmDXOlALort~$5s-OlHmzJGnFU3SFu@t=>A^<AVI4eoC*czEc|jvrqS^4A$0
z6`s8Di}T-YyPofOHY<CRWu9TW&N}heNk`Wn=4k)<?bh{uX7#VPE@GOew<hB_I04QQ
zJQ1$Yzv=(i`2SP?J~@7L$rt|mABSJs|Nm^i`KUwk%65r~r^NMp9m4j{$Y@!>A+#~J
z<f7|M|CSjM>k_8NmU(Xck<qf<UA}h9;jHI{=hECJe~NCi|9$g(mbYt3>1u;(XS*1}
z_a8kG^)Ef=)7LGJwk6-u>V4a1{qDrG%BPD9S6BB%2x~Lt{3+Rbv`9F=@^tjBU#IqQ
zaY~$A6_B3A#mK}G7OEgG`Rdh<8pE^O_rA@&DR0&%xLjgpr{Izq67t+FZUv{d|NVAb
z|Lx}Uc0Z55F^zB5K6Lu$^ZD~%x#vH6xtqWCh4V|{`9EC3w*AxG!>7LT_lEcTey1(Y
z{kd*M^k3Z_H|Afr*1!B?R=s`ElM`F6hDE2wA78Y(@<5kt<;*vy_3ED9U;jqteZ_I>
zO$j%Du%!KIe8Ew@d|uTnE!(*_T}9t$H6Cb~9{%9$vGm899MYidEbzihA#eN975+N2
z1rF-C&41<W`PZ;8TPJUOuav2lD@W#?N8ciQVsdvrowoI7{Kw_RNhv!2j>Y>&>&Oc#
z2M2DOnQ-m$&!ouK88h}--9B|r@NHLt6!(f_^OatmN-kaZ`bHAh6aQCSkw@RiZ&iY{
zL%g&mwCil=_P*7)$`{g*5s7v<p;h*Og)G=X3IRckimR8%F24n7ygF=TZCR7_z5f=p
zuc#_2u*vII;SkWwCce8W3*3cWtzB?J(tPbZO_}>@joJRS-m}-e*|b)`VA54C*XPg{
zB8LeFM<lO;oe-2CrKpgy)#;)oq&3IL#LMIq#@x{l2^5CLFb<B$wE-o3khWigLvzD~
zs|=5nAwlS{K$OWTOj~4bGpGdy%Hj$NDW(lSU@gat)`khAR*wcaBNNLIN@hp{CsKa*
ze?D$v<-QfPuGsgDBBW&D_%ipvgRnWj*6n`h6&_RQTJ`Cq`eoJWF_YT(<?p@R61?2c
zH$1+!wCdH$<(u9g>yw?`XZ>!+ma}HJOEhl3Dw6ek#|+Co^I5{ORkB}RS{k{->h+q<
zmo}xI-lVlYV&kIVtAqzTKCRUYx87(D%cyl?5o;%WoxcB%s_m~Ai(j5GKJQcgZs&8a
z)pd7EuY*T3Wb6NY%-sEUo456w4bGs-J*Z`iX7I8rec7cuZ*}g4`)>1rtkyN4ZpPfY
zUoUTRTs`$lws^y%vPVZcg*RVZz30x3!pE0hTwEO76L<95tD>K!dtgP$EyWE{#hci8
zrLH8;onQCs<(e~TvvaSld^5u^Icqz2bnLpzN2@j_KRYvXuf-`vu)7zSGX0ay>P@bj
z#wo1!B>(r*(yeZrX03eq=jZ3mNzQFNFGFm;J@r@Fwku|N_f1DgF)r}J9W*wPwQSx`
zmmd+278Xid6eM)bzY!I??qk&6pLgzeZZ|J2;Q=+p#VXc3SMm}GI<Vil_06<p+E<?|
zM}kHpv^H0KeB?K^tM+gk@9A&b(M`AGj|BDeuFbi*IlVk9Y|U!$z(eUyKk?1*g07#b
zR&JBot&GJY-2HyD&DNHA8{GPSfSG^E&f@3GJSVHAp3N=YS!YtB2`f0&8y(f>RXm!W
z{C-8?VyoJlm-}|y6+dl!MC)Do{o3+vX<<4RR{8h#<gB|2>M+bzdKP`R=JQ$2c?vRy
zNiJ1SCc0mGIz4{gwdnl4C07F7mu|flwc7vG*O2=A!U_%vz5+Xb@$;|aJi8`En*Vln
zjq2^tuWnDZ)z(})^1WiqmpR4fUM7@YbQMpX&kq}5c>n!={eO|hH*L~+9`!#C%WwL+
zDaj~a$0O?hmBiJjOIOU`2ggtYLt~wYghBGLo;U9we7P>nGx6P{eCcEJufEL7F5UTV
z-BW8O7LJg}2NR6*Ruz5Ly1NZj?JT_=e)ZVX*RxCKm;74r_3XWAIi)-8GP;6c2_;PH
z!gJyK;Z>>e(2++LEgglF&>h95y^x9|V}8Sgt9I4l&@qKk+0oD#O&gHfXEZO2<^?L{
z1&94@YgE0bEs5Nmwp2W>V&QEu{rG)0XJ;C#AI&b0-u!fzb^Ci*x1d(hV28fnt%`G?
z!SvY5r&C}4`~7}>?bkN*J&LtYl;u4SxACri+bvM`a_RJCxAXVg+W!CZIrDDmb>GSA
z{(i@0ihZOkK1{W_k%QXQaG2k|W~uk|WuMPk>w^c(H_!i@b1Q50+Do$KcP8rX|MTgK
z{{K(<FCWYQuekO^R6A_R`r5bIFFV!eop8GP<KyGYTQV<SGQA!%nT=O!N}t`Y7ol3$
z&-dwpdqbe19EA_3J_NMiUHe;Lam0DM-#JykZ{MG%<~L`CTc6C#Z@047gNBOK&d#yi
zT((fsIBiMw`@QC}rB?!Pet&$d*ZY0VbL-1_yWdU&jqcylJ(hO*s^1&Xuq`N57Vv_a
z0FS1{=X`#Ce!c1YrPJfQ`0aiq+)A13oAo<y=hJB>2?rXsoYvcY<=fHObIb2p9({X|
zBYdN2w4U}Gaaa@3m#MaH_lMB+RiU>sm(RU)zV6#*&|v76-|u!WKdrZ0$Mu5MqYmY)
zv-7OW^FT8yVav9Cerle4tmmZNGsU$xi@rX8@%HzxiQDeYI}DiwU9g?$pX{r(G1rg#
z&M;W`TK`u@{`~eeE56(Rdu+c<{?7yUm#bE<I~CW?Cp!x?_O<0^+U%>dL>0B1A|6kB
zAHAa>@muKTr&8x18^c^^&-zO>#rE5c<d^fR-<@<@y6sNU>5|uLx2Fl;_qX|YB<G8k
zl+0;Eo#<_Af^UCb&h`0v+UZiOK>e~W<&WOFipn}QFf^*M$Yn3;QF0ae@IFAWdg)KA
zuRrIk;fOHI+ImzhdP(tlTl3mi!SlVA&#TJX7I!T&eQxON3;PbTNiR9tEndE=^33tB
z+#eqv-pt<obkm_aX#bq$mdb_aim!jYUhlur=J3Yja<kd^|J`rg9KQe8)t9yJtK&h<
z@@(N-$}UHB4@P`iSl4~jJ6YPcs^r_PoSkbn#KT%QW}IItPjp>ex#Q^fJH_WqGm>=7
zq;B8JUO#v5vEY`%-37nCyuA7R&-E)SgEu#9{dz5WebCN773*QT%Q(LLoU`Wo{(oOJ
zn=XCd_kHh|Yuopk=I(mA?B%=N@BQ}w`?`L!Wz@zO895u<u5}11Z<_irS+l)jmBF;^
zjtipP6OZi+)toN+tsBzpQMjPi$f&>Geyh^DyVEDXuKT(=e(CFVyY+U<&e(2z=sLUI
zhen-}r@zzA&zq~a=ffcp?it5)k45bGvY?sIi(RI`Ax@<_cUw$*bB%&S!vQHR@L<3~
zUH$sa>uta4KFvQOb)%`~Wp5p4<U{F&nFpI#Z_ZgA!LL1k{?)0qXHIu<zBk--_3pKt
zo$t;)1h?v99ZqQF^K(Z&eY4vp<?GM4hvul~eLuS7>mSX7HTB`^H+t3V3#tjf|NQqX
z-RaZ6d%>FL`i*w;f82}bEtG||eJ8TCtWo;fwhP+Yn<^-<N$c`dDd?1wh^NB|t)ToB
z+>jI(Ajzn>+9-A<q=(SpFshkpG{87U6N$oT#uzOO7#OKs7%aH&e63r5-;A`gv!;sa
zMr{dde|mcQa?9dpODf*xWp9fqfBpeFUhc3!pM~xFQP160&zbpcCj9#v|KIfN982T1
z5gV1XH(igbUi!GtdR<t}$w{g&FL~?xZogkwUG?wh^UJ$lubZvrKW|Q-<+B+k1rM|<
zH{2}RDqQUht1r?U>o_C%ZNCIqJ?=5SBo>`B(eCd{|Mc~rpPlvoI5}T%&%SS4*DqC{
zSE0lm3YvPpyv*18dQ7pelu1T_)vp(eH!nIn?ezKAQ(<)|AIQA$*wRob)2tAypHC)l
zzPK{u#WCspI}7(3r=9Tt&8J%Z`|<d)T=koYwdQ$uc6@oz%)e}Q{yt0D!Xtv2Z?|6e
zJ3H-lL6JPDnFn&^U!4!9Y<Jl0`Vj1IJC$|u-|zSLi*4Ao>x%C7JCnexpl+s4=Zk;8
z=kqzuJbt$wU2AU^$@)D)4D+%6s!@6U@Av!jvp~auOF)ZwK!bFdf4^S$kIvhfDrJ@v
zv34hD8GzgFHXg~K+v54hdL$>;&I7I00X0`XWc};<nQR8GPcP^({^#2oR(Gg{bFFP6
zfBNgs6TW`A?4KUG<Hw`!&C9uz6OK-91+6(TJD)Yb_S?yQ{Q_4dHazOCxqqmYJA7qK
z*bRNKISvgDvsr%Gq<~gSL|z8XBlB52XfP>xabZis!KRXbKc6puU;qENW*&Rqj)!eG
zi+E2@(|vtpf_><W{l_-(o}Kc#WKrCk7w?bU?$)wuVPItP<*>QtBI(+t@!<YKrEgxJ
zOJ9Aqj5Lh2-Nq3qxFM<gc1!*D^7`pXXV*mBQryOCc0)loZjVKE{D19d$w$p<etdYd
z^=46I;(l0|=L)^}Ji#>SNXMGYpL162nfo*MKuw62Q^*~mm|Z2AaVpilt+?BBRaaNX
zO*MVH?RMVl3rGHB9*nTo-nJuGqA~l|mzT1qeCJx3az{kx@BOMZ^>u*|QZ!$9Uc3o3
zVhftY{WAOhAGM>uD^7g?4fKLra#!zsUe2!WH)lrDmDi`V*PoeI)bV#?jC0Gnhz^r!
z<sEBp7X5wmq6pSD<YQuvlM6ic@0f4A-@58&Gt+}?Vk@4{El(5gx1YZG`@QPrhxzSo
zq7zKkUwm_O^W|3YxEW_JcTK(P-X}AY&+5g3oI^EnYH_o5!|Qv#vv3GR1hev4K3-<J
z_2tt1?^~DeTlyt8LRfl&{@#oFirVaTpgGW!Zw>cr$<I8se|3FtWu)Ol+xh21|HuCQ
zop$=F{9{{2CYEa^jEbxG*y^QB-TeO3gsacDbHA=k>Rt2WWoGxpbw6HaW^aq}fBq4q
z5)=&!t}@lyecXFhw9F2cVkB8w));-6WCb0`TPiHD$?JNmmJcYGuy9OqbU2~qtiKXE
zJrrQYsJOZ$cG)3Fh&YUDW*QB!(L^GkFc2A|v5WJ}Ok;K5*=D++y65h;H8+dy&O0)l
zg+m}?@_`3tvDZ^M1tOYR_kmW-Md$5Q?UgiE1Fhwqd8EJY%i=Gu<NsUjeOJ2Pd;b4F
z&o|e`PJNxd?dIn6<)E>iwOg-6W%k>C^Jr${&H6P-f6oV}vNz8Bwo|6*Mo%-lowFG<
z3bI7exy_`uPov^~?e|oBQ01=d-sf{WcYCaqecd0exz349EVuL(Qnv2rztV6(N_|7p
z(JsH-e{b{aXV0s6)cNH~u>aEYHP4JAcf4E`vz$44OY+Z8PhZ~3Uhg|SzOE9qmbmPi
z{Qn=vK}*@PUU3Ef@7CL;p&PMbf%DJ6#coT3{cTM_YglE!m48hHwNZME&z)e(c>MkM
z`~CI54vFuZz{VqS;m6eTEF2;s2i_iPD(lG-jJV9gXZz*Cme=ccF9WTaSZz{ug=@L`
z{2HU$N5b<x#N#RwbraUUssv4-Tw@CBX?l7awD4`;r>X0gOpmM5yubC*b#MK>Tf{b$
z-Ok<qrIEizA$RZBYmq<i|9NKqa@p*>sFxe}DL5>sU~=2kbzMEnC81Zu;z0v*(4Q|`
zj%J)+b+7LA%Q=E^@AiB?_vKaieyg>c&sn_$)oL#%_}xGLc26_EoyFVj_v<oWTv&K>
z?Rn5BnzniQyE|V#9Ol2y6ui9ofBtdMit0Cav*SL``to&sy>0dXdEfV_%NCtby!m^@
z<LLXpuKm}3+se?mh?^tQ^}XU(<p85b*KV<;!u~dfvnOAP`1-idT5s=5-~6mQb8GiK
zndH4`;;h{5cg;YHuIHXQBD1brf1kx{9s8ss9a}(kny{aRBCp(?um5}IR=?Ys`RdBb
z%+F`d{qO&}w%uyZ`}zM~&cC$x`@Pxs{yZ~Z-e3Rc@yo62YjexI_3h#d4zlj$id;Uo
zEUG<Qrs6^4&C<_;Yo5=q-*@<XZ0(8s;B|Yy-P*cdTrVb~TK?@eL4^Rh#&!R%ueA9Z
z9?ZnTrS{=bxBjvjKki-?`@A-6+ffhyo*yNq7j3?|8=Tq>S`|9mUUZ?#GtJViprz`X
zc~_5~?~yd#bn<cFyN}1^*WaBaZC6uKmSOyP>8@RF<-Zs8RUYV4u*kc!<6T$!eOHFw
z+fAS)ZJU0^zOQ{>ecAH)oXNH3IX5<Z`L=!k-s8m@4h;^4EN4z?`Ngl`Z1mzdl5sk9
zdhE2b`CXQNxAXVcUR%fEpI>oUy6Wn&iXi=GYPG*_-#_Q%ZnvoTaj$ur;;Pk?kF5yV
z=R4C#wSM-$-~0dX{$}TP_*Yi9=a-*irJWb9U!K;#%5^7b>Ez1~hxz^gf42WW8PrgD
zbS>E?Geg;7fen*WSmiG-U(P9R3VA<|>h9Q4TJimEdHUD7|G)3wzmnk>-WyZ@_v>ZQ
z8X((+;*%dIJ5}U-ba`;<ng7v0t0I(?w%Pyt*nczo&nf2cGYfAeb?avRj{d2Z=laY$
z_z1_9<96RRF7uNw-q~mS?Z%dOyIz-R$SZFCxbi3;YmI`#f(cAcVT!w5mvT&rPx$!g
zsOGhuUAd=qxBIxuRi><$7JaC^f2+9qOoK$Hw=o+NUY^=kv*gu5c6p!8X=l9*_iMVf
zC9Rf!8FlmH-kb7YEq^|l9DK*D_jXJCuS?Ts$u;hJ*d~2R-TvpvH=M`+c%Gi|M1Ff@
z^4ks3`FppThZgZLGUW;hY`VqreiO?oy$^Ta*O|LM=qR0Q_kHL2)b8qStIjgB@B3sQ
z8+-QQsrA9~OOjZ$)y^M(5uQ`YaQgJNN2UM%{Co)-b2i(qb4xaH_08xd8$Y}--~aQh
zNOtp4r4=7b5_@hOP5Cczv#aWOZiF-=(^J8Ur}ZmO1*e;;IxKj=v@z+Ie*MqWYo=}d
z<DlcY!7AFPp#SQX&u>Ak{rk&&&2BFFw(q0w8TQrtQ)iq%4jS3sbaCskPiO1iWlg*y
zv9tT)GIzO373;I$;n~`6H`A9c&#`gWIX_{$Vc%(S+1_2p)?U9MSN&$=)OqK{SvW-e
z9ZqP)&0itd7{u)o(D76_shjiF#uFK5)Vt=}xU9)yPHuTICD_k%V@8IJtVDg2`nHHK
z#qF|XFTR!h><GQ1)}tz$v|9dQ*LlO|n(GAZzk2H)d3*Fmc>Mc_n}22BSGb#<3faHM
zY0VY8;%8?pVy#{*Xx?PH{gZva@Os0bsrj*UlMnNnpV{xX|Nr0jn{W4SRQ`9yzpi`p
z`ezfa>b>D*WYQJg(BkZEIk$(Qk%Q%Dhqq30!HvZBs{!}EZQH(7zwTrA*7Ilgb#}h5
z|Mz+R=H+i+^>-fiuC98d=M?s*a?XysV%#&2U6a_fZvVeuIZ3sDcRv2xZvW?DPWT_s
z*^~XOG^^#e%gnESxATp<+7ACY7KXE5Pi5bsQF6ERdaC_R#{b{5kIR;yx%Qx|KX$J2
zvzbSY_&>UDPF_@}lOwgb<m>4~mxQgLLW5B`^65)$Q`G>j#)wr5>duAKF8%Ck_Idg9
zPuDdj?>`@(9KU9tT(nNAfcE_7&wH<PL~MMK=^uT^s3$t_r`Y^trMkb{HnIACHu_qx
zrk;2A=-0(_f6m|2S@ms;i}Sr{7SB(e`*?MIovH6U8_V4}ca+XDhy7Xja>o7Ct>5>!
z?-9~yKhQ8;{N?F?LD_#VTRmN|D@sTqAgpmlzsO=Q!4;n#T)DbWqPFXH`Oo<mJEO}#
zE{W~=@#Oa`(-ZC+!@llVcTWEE`d6>-h0dJ!t+c#vMYfHJK<@pD$Gz4zkvA__?*8>}
zg7KfThu6iN+VK8X@cp2+tX0X)4tAvn-X3C;kmnS5QQbJ>%HDfbuS<6Xg#T7*xZ1ub
z;@HAE&2~QZ7Z08PR#s`;dVIaN^!>*MJ+6}Sz7?x~hQ}_r>AE0=DNlUbn!_Q}Aw6u3
z_J#?eeRV<JkWRsZ6eg#zlU6>ZoZ#Wz#v%@m$fqyVx2izqE4|bdQl<`0&AFVB-qZDb
zPfyp6*9@&OPd_&&@AQ#_XQxHKY^{MWHc@UoSX**$>b!5(_ka4$GD`KjRdU%ERE*wV
zcn7qpYU%X2S$X^ae*5z0^ZDhV1=OIJmn}YHnEBv9_@{);Pp#(MVP|5g(k-~;TK(-;
z1iP5ygD*-UPO=<p3Yq>&Z35NpItjUZJ|25{R6PDo!``H$U0=4Yuhq5vctkjIg_M0=
z%`CIrs9n!yWnWt0*nH`tyZqd#`P*XJC;x^7Fo(d4^v3YE_Fq2^ot~!aegFTz@0agY
zzn{D9R@Q32@Y#mRZo9tUtG*oQE;|)8;bj6E?>JY!&luD@e)(*6z8|=`=Ck>!RqO%y
zGCzB+FVQD<eLN-&+6!<gv0e6B>SyFBt&$&g&*zr=6;>M@3e5oxmZ0>a^|y0BKR<td
z-LK2@mw_flGJkw{7;9Ge?#|B4D=PvsPfSph-6wCH=JU<+oM1F)QfKwg>}O|YuC8Qj
z2XAC)yvO~ce8u;&SXs-&LoMsdzTezeCwcPM#s0b}tSkP0yPdz3w-Yp|v8Z5Q{=-A9
zH#efi8GECh{K+m6x#CrRmQSbTF#SGtOXRfSkv(gV>DI3@sL$ON^SH9=^UnRk`T4J2
zNHG0XDoEZRbJUeXAVc88`v7K-lXl;JdRz+)kDZzncNH`sC8irS<?o&^m%MLEg@3fX
zcYGUca_Uj{&xnmrw@c2}z5ddr44eTNnOJ@WF7S8X^r-UyyL^p7_PLG6<!-Nx-1z=M
zGygfY!|okj(M=lzGS~D^&EK4M_SC&TIa@2xyiMJna7d17aIj|iWs<UX@3&jvO$ohW
zPkDPhKWvn{rf&DKGbixU4f(~fh0%q-zP!x5w8XRWqDkqiD<X{9uh(ur_sukVT^SS7
z7O)qWCy2hiS#~?u+EhF5C%C2l`|bAiwdRG7j+i7J=_q+RH9XDR@<?zi>PQCC2wg@q
zXqtB2Es@DLK6k$P`Q7kU>8;G=OS$#;7{nGFWYr8Slea8N`SpO^e#Wc$UOC%h>f(?l
z$apF$C!QBAeE6@XNpYS)&-{bUyU$e^>T9d*IesDxG0prU^1yw)H#b+DP<=P^dA_*V
z&iY-eZ-a(8cCW7u4`{5Z-MlW?Pd<Ft>WOQ9c^^CS{nyF&U+-VtpO3oz$$7!~=>;$P
z-FC1+CX*Z%WH32}U957c1r2C4Ff@8`a70dh;nu4F$vj<Z3Mry%-LJGminbLk4HH5;
z^R93}B4SkYXn-*?v5Y1XfzgaHgiDgeAAYJbFevbX&H@;$h2e#K#q6V9qM&WunfLZo
z+Dhrf@3YaCUVk_D?6lYKWcDdT%4?1<tp^_Lv&j5wsmu{u{dOyOQzo~V&WU|eb~P1N
zuU0I+w8V4rtL|m0-qV(Vwgld-`~CLi&*$^~U$5Jp2iop!^=wA+r2~!YpBzj(U23rt
zX_f1X&lA3WILyEN_4@sGZ}<QImw7vP`&qXY>vley^=0n+8ui?LKcC(7-(v2z3(JI5
zVA+KQjxS#<?mrhXOBZ!ThaG<;XfY9J$mjBfh0fW&G23z?cfDG*`cm%pyJ6gs7;{on
zdz0mBJ{&CheAaxqa-W3~s3EZOX3^H}O4ytkq((m2%wEnBaq(EM*)5IiSKj)2L$W_1
zPf6X{SF!o?IqT)o`Fl;d!>!-#NX`Pa8^3%yd}gL`b>))7;5zZZEAAiV8DDu{p9k$X
z|J7gn@88r;zuLN$;d&nqF!QI#Kbn@X543$6v{Q#y(n#h0)V+O@#%k4bp|ewb>K_{+
z)u+OR^GvmNldj&FceGo4`Tf7|$}`{G*a#lsdHb3pu$NJL-<j{aF*^*jZ-dr>g+KPK
zSHE|4#VTjcFKZ9<)>c=gt2->nX8g}r`Zj3V-oJK}M2j~*(mdQ>^F&#8o<z@bf#h{z
zkEelVpv<DzeYCLyHx@zdt>6Xm&euTw%N(I<o%<hNh40_xY;Arcp;=^cOmDQ#b%AJ|
z-vZ#4Ci3#3e8t!M|GnP7>8S*t-H!)b?$`Y;&B|+8u|su7$;(T8_s`BU)&6Z$_2mU<
zW(sXSPc`MJa3g5k@mBf$+RNbfvG8NfLpx$EYJYv<yYD~O%GCA1t*X~+H~+<G9X}Vo
z|9<!TeK`*=Mr>0QQ=V&->b16W<B5!YuYMot6u#UcsC;Q^c-&0grvm<>ZWi6(WkR3$
zHi8;<g2)ZK&lA4hNbXNn4%wW3-cLNfrm$V@SjsnvnNjI;OE<N;`CGr;Qu44>d>Oai
z4uxpOx+f<lzHFBNlhA&<d!s_8@l&gq6YP*?PJ@FzH%~<+>sQgjvr4vVQlB>^9jflh
zDTQwwZ=A>Kw=3iPJZ{avh{oz?bK`F8S{d=3>H551)829a*fxRbr_v@+ywARNT)wSu
z{=98zr@xlSfmWu2=Y^tlFX#*3kB-fJ4$H+Npru7s{43=lt+W6yM#a@r?k>9oohZ7<
z+OlTR_X)qCOTCtg2yF7YnX3ic$2F`qmkRv2G=1Ncd!OfhUlRZS*LB%%;vWxhN<Do^
zx!-0IXiK-q`|#A+=J|2E-tYT;X^v&_r7ltJu&Ni_`g<nCKECKK@B8r{_{f!`f)X)v
zR;}P{oW}|pKN4X~`S#|ft$1E=Cn$4*cCAMWoH=~eO*(f9Xuf^<-SYc;Z%2VP9lV_X
z|L6S6&iu9^+Thvoo#$)y-tKtZx3#ugOxH_1wj}TuXjFche*C<*@!4y)UQ%qAnFQM8
zVp6c+|NoV3Pk9-cSZ=92sPDYZ@_y4*QH%F`K3@WjlIgs7v+MP`%ri3#Z+2YCTt0W2
zl1kb3qZ<u>ZM|D|d+FM3x3sjS7Ka!%egE_M{B=Ii3ewB@b)RQ%`F1ONIcQ8SbNk&g
zZ~c8gl75}^ubWi&b#?sJQ;;(8t+2qRTj}pl<qCD&&N^@VJ*Iv2@s7()tlU;_R{s|`
zeuU!|sCeAJ`|@v&K=9zzU%{Spme1#u92E^;l6bf+Rq@5H*Xv%F`26krzW06Y%U7${
z`%RCl%G~wol=kIDcDWg~w)Ox1+<FmqCGpf0&71$~f3(+o2;STG@9X;Ipw)jjL3?f2
z{+j|mh{0ht%N@NO;XS9fxjp!JT;5-OUPaRK$)GWGFVG0?=D+iQo=LydBWZkT`@XMh
zzZ{nTXTYst_)2)O4`>A>c)SzT_k1LF=a_W<96zg<OSXJIXPtf=bh-+7+kg4p((tnA
zyaNr4FR!kzEB$q4x!qJXpBWck?gA}9&5fU9zipv&`?A=wo2uOL-|rOrzx}=Lo=oMF
ziLzz+8;^=@JrAl3zuD#SKTFi#FDn^u^ZAVN&F_od`_IMw1#O>f{Kmx*`Sxr1*Q+8O
zJKepf>8$kC>Hi>dd-Hj_XzSu0hodJ#Th>afm9qI!|9|uU&-4G!vHNwgKTY`Z=UT(-
zufJUO_XiCoZ;mb$k125c2I{cSH@j1Cxa7EO`I6o5_gUBeJRR@%|JVBev)Fj0LU#M@
z=@gij&n>R!Q)wV&S(LJ^`rVzKKd)=o_C63%P8U1@8b?TbT6QaQ`Ie{CqSM|#7JCSq
zxA+1|rZ?}b=ZFz}Cs+65A*eSivN#dEN+M%_!-T8<>;jsv3fusV*L=MmKYwl_Xf5ZH
zPd^Gi9Aq!I%4XRx<MWqY*Z1np_K<t}_~d?#-y8dDb)+AH4vGoBGpl>z`WYE=+aH(R
zNNk_d&*%D~a}%h$u6F<U*Vo&__r3~^ywIi2lzi_BBfHFmc~!4gerdP=qo{rDvT%c8
z=0DJ2YOYbWj7jFDC0~x}*KPb~v^8)SM^s_9;kF&Bm7sEYMoK=YJZ${NJ!3N1tzsNU
zmV5xMhPA$Y``)*0IZ73eGeMPT`u4X;SG4lfkAa3AQnvp~I+A(b_WK%Hp~dkVLB}e9
z232mRe3|iDWV`xj-Tk)H>-(;6Og^6G?Q`V!j;j)jlLVXQ)%|*TBUJk4DZ7%7+ONbO
z>g9Rz$=lgz7oOJLzC^#~A$R1D)BK&;?hZY=^19uDyEdP*TJ5}Z4`f8*MLnZ(<lp>v
zU9}1y{=Tob2aik{{QPm;{@zp3SNU&`>TbXBs4TgzTmQcJ@6TIT{=5JGcm2yp-TLR;
z7AMsk-{w@GGXb;!=<H+AEFGv;3})E^nnt`ix$W*;<yQj5$CJ8mw;9Uo+!8B3^yus4
z`F~QrO-a;Y7gW?<SN!Ru`f`b>*1z9u-W)yCkkjtoZBVmi!Coe(u<F0Dds&$Zv-O_^
z92J}V;IrU@tG1<Q=7ZJ|ZQ4-$VqtsQ;wZzHdscUT>%HEk{`b@JzmIljuiL4nEu<WB
zHcyZ%`QcTL@Qp_wE!p_@rGNdZ-Xzctcz^Io1xDpZ1l^Z_&T)};>~08?*V@bs$r^Q{
z1-m!I?~Gk@l}S+Tky&EP{29ANgbzh;1#MD~JkWJ<U2>nL+U(g||NVOXz2eug%J7YO
zp+3|4b)RKCjn+9V;BS7cY0<``mwV0cmIQCR;vA>O6uPfh-rlZywtb|8{Hy%<V|Uiy
zcqF!>VQSzH*9L~hZCny3v$XejuV3eICcMi)B${RBVLoe}YWdGA_I;lFKIMJ&@9fWK
z&Clnlx;1n!=S(iVP&28v{CQ8{`W<yT?1Hb;jwUVISo?rk-eY#|w#c^^BKWoEh4oy$
z`~7bD{T!pe;rl*K6>-#?me;Xd?eXp#N%yYqzV~(An_8PpiTRJiQr57@E2kN@>%_|?
z?f?7j^r@fVqqW|O8cezxS05hl+E{b%iq-2ilVxYt_wj!WN$7cY#Q*R7yC+XSIqq`v
zPwhXc-$|?Wr5iP#g}ct=C@ws$?{*rr{C;Y$ee&h2Vym~hf9MWe!4a{s#`(;`u8SLf
z<<8FCcGB+I>)fM4yuaUU_TN_H%yP^o!L_4HUG($BH5~aLMN(?|mTD%s=$vx@VD;z2
z;maG3%SG2qz6T9IFYskzj+=LW(%-K)|J1*@9l}3d^}-Z~9<8I3Tb$c?GFR1zMBOwr
z6cTY<`R`iPow}aeg<l_PyG==&^iyqi&ZOAwtBrc6b}s+_sPj<7FU4!uqi%|Mn;n_6
z>X&Yw`7t5E!1obKO7&G6_WAs?Yf3#M+a29vSQU1E+8!V6IR9NQrmE{l7ur345f5r2
z-P<o-vUM6~O!ceis4_kESN4rFjnmV_i+6AMe<pS%E0dvpRwz?gOi}9b645xNB_?cB
zcf{Fsi9CP3%ID4c`$>TpK&x?hA_DE)E`MruueP#N`?)=9QN925PvF%#Yi2dvZe9Is
zsR^V3<*-1LQE|1VS}Q1PfZANE)f7_J&YBKwP%$(vV`*8lY=#J^a0lsFGpk|3)~q-$
zSOa>Nkie!{NkJXZX8eXMCZ}twDm9@EE`ba$hZ9*{o{G@s;(=A19FerNyg7XBj!P_6
z>IDyT-@m%s*ava8s;I%F0XT<<g+oANU`{|9wHcJ07u;ZSqQ`kt)DP{Ye39H@Iv(9(
zx?0;dz|NJ(UUJ}p(YC5rS5|@>nf|t4L&E-UOg_F0w9X=T^I5ahoIWdPz7!SFxa)E4
z%gf7`S;b=}9P5{#?+5DCozh&s<X|)V^3CV%tk2FgUfvYD#1q<cl4SJ~-?VP`yIose
zE}Oj!bc|l^_Pb@7?XqPa>T?R5K=m(Z4omX4!(32#*}%}q#Wh7M<*3Y>-S2j3`_8d2
zl-_&lck-Pbg_&PoT-0>inFBGHp;3urN|xU>(CU_%x!Z20&3$vMNAmKg+pWgw=iZda
zLJo6tsOS7qzGCYoVKtwOx17}$(JP&<fwpo#<B>F461+KSzB;e<Mv=7R|D5;5&DgcV
zL!af_>!XHzilE&pdI75@Y)v}awPyD;{rGz;Z?o~q%y_hXYIME&y|8O{cY;zv14H9C
zt}SL$zZ6Ed@yX7LP5k)i=-hQ8zuS1FuVwC+g}JnhV~SQv?v96TGePSrts`xJKAC*;
z$#=i_8?Z^ejAn<GPS-#^AIK?jOaEL;oMHRn0COg2it5r5&s>EPPiSH1klq;7x@N_{
zeZSw$2KA##Zl+FO`uqKU`{->C7j^4-N$2k=ta>bc|HjVNZ?O5FTM7ZII^RFs{QuwY
z<umF_5A&KYvH$as|7KOBp`)#s%G*~f51Y-{r2;C61r!_<cxM<UyL~$mCpmvfcj;!(
zDFTU!LA9{`G#Ses_U(&&>9*<BMYmq5(Ek^!VJ=H#@iJFmZBV2I-AE(wVnEKXT)@Ee
zvHjBP{}EM;t3qCCfd=mG7N57xe0Zq!@4a*B^J~pOF#tLu>~G!MG(Cy>XKyag|5pM^
zi^fN%DsFJ&m{N80yXm5KlSv1>Sp4jMKKXLNnLqVDpOlFPXc1bkthL$Oz2EO;PLC~%
zJQ-NFzV862FAUnfR`Q^ceVKB<O;M@e)h`=C$CF*&|L64nC6>j{QjQ<Fp8+~(>$3Iz
zpXZjHzbMc8{QUg+;D-7oZ~d>wpT;yhXtK1d2`ZWFCG<k)!x`iAOF+%~oAx_EGon?0
zJ|4deIzsN8{r^9p?Re?+CbbV7ny=1%TD4!@>5ZVf%tTO^<lg)g(Y_wLzu&g+pZh5P
zblsa|d2i6_>tCSW$(s4yVw=JiMs^8BB(t=vF<rLWbW0bLvRjYG?zh{b*Ji%2zW@6Y
zf8B@X5>Og>yY05#+wJ%3w!YsJS=+evdYrXv$py#N^^4Tb8`S>#l9Te{u>8LQ(ERh}
z#oO*xy)HSS*ltqEc9cUPV|l}btA4fD)h;A8O6=^KIBmz#FO%p0QF*)j{l3ft4U9KK
zll0Dm&Q1f(6n^<~*?;+2v)ej<@816#TXlK%y^z(eXO{o`*k3>A-?#1im(E}Y^|O}k
z|NncxKj^H8FtukY;G@;H->b^5deo_Y>BL0k%YD}GW`GvQiEQ7P6uqaS(CX=w;7g!=
zc%W0jN-q1FrxwphDtWtNai15cS6cS_^~U3J-qE>RL%SF@{(LsO+~V7h$Nm20_iM|4
zoz1VCJg@%WPaT807tZph)`i#iT72uT|C0<VtY%phCV{)SbC=KD=C=3WWBY%~XXn{k
zTfg6Z|L?mk*W;>FkFS5TJLC5BeP5P-Sy#SS`|ZZ#a*;PfO*_B+e^<W$v`^gcTi2Im
zT>tfY{rtJBKZf5c-<)=KRqL8#Mmx*>(+XpZ_0CS|%s!@jM#56orlKHCaB+?q6N?oW
zN2IK6jZ#2W;}7@uz4<lCyWZ`3ed*55;>)0tW9!Q%ZaoiBPu%LwhQpWIr1NHgmRc<b
ztvdXz#~%ecRcqJ(f4?_RoCI2acsp;mZfxOE(U;Qqf4GIcJH)N;16~AU=?OYUDd<dK
z*XuKLER8{@s%bjKojKXbd8;rc2ehfL>Omv>rUb$57K`~ngCU#iXVin{)j|El+RwA^
zzbSYFT7sao=SYXIkJ105`gIfM+P?~~?*$zn#?2>K^=kXPTT<KaEUFXaQ+BZX^<r^k
zMo)3c_t-7EO#Wx=Pi+r1{CV&DzUf!Lug$N`zP65I&Bq6aK=aIhN@U}dE#ivLn!cRm
zt>+2a!doV7!5>$7@Xl`a%^LS7dv8t!4Wa1h9KW-n^m^>}YuhX5?h#V>u%F3k+J7OA
zkbs28z2@hlL=)AWu7Q@?6^JO?{(O6MhK#&_^WRU?_n&dwtQ6qN(8YPzaHI7$iM1!y
zV~z)x8ghmG|GUI<a!|`g4t~R3qVqrNx|!|!aa4cVLg)6h-AWxt->&zs`!pGR{$Kaf
z)$4X?ac3K@nwno2t><<abUsE-_#U^N5{awlU-^Hh`25oKbzfIUW}NBIUA8uGdPRgn
z-ru9Ix82U0EkBR-*wor^?JxEDVOLeoRli!fd>Lq4g0*vx#=WA`x{(XsWc|AX>KA;y
zcvL)o4(lV(L3aM2<$u-|&r4sOTq8L>?bMNa<%i!vM~rb_DEwP-<I$SU=e+ps{}jZ@
zu4m!cqmvM}=06WdNPt4#&m-H;S-nnKFUXeEeLLtQf671M?L5gvr9D!2%kS4l&V0N5
zzFqa%`lrf?<#!6*w`uQRI<0<wf78?B&wnc~c*>~#EqCKlv75O&e>F_Kuht{D?pN-o
zCnvWyi2hD?QQ!6_^VFNer}rmK(Q$kFYJ1u(DdCfcHQW{^rL3xZ{ciWKqK|c<zTfT?
zpN~4w_4u&LtBZFh39PUG`}#6y{7EO~C`VL}TkZGV_j?ap=h)6PeSFDh=AQYlnM=PE
z-{IRPsBj_hfJc}+|9p-RCk6T1u89+Fd^&&s=ecsLt@`t3oIZVI?Xel{SFega@3^?~
z*8`EKNqS)|JC7~6QqgBo{#Z=edZX)!*Lk4TmETH}C0@Rob9RgAvx(qi2J?>AJ~N(w
za-NvYuNRAhD@wn|Cd-CjSK&WcsgY+>|IgCxQ_{Hzn-c<!+SitJMIRD85Vp;97T9@}
zpP!{pKXZQnrq{Rq8yvjm{txfxVq{t>)?sM{I(~9f;9}6AUhc{G<h;-`3twh+*PnQN
z;|Kfx)zRUC>*8uY9u+z5dSva&n(p(4mbQ7)->z=UxVY%em5(N={?W#{y~S@fpSRO=
zoA#(I)@EYmx0~tdjB2;`ZF(=Y{_cIX!o4$s#kb2O&x<ZsTzwIo3ZC#==tOQ>ayTP-
zaqoE+jvcWt_A@d~73vUNIKxNI|IE?gwx43#S(CffzlCjksvPxGcf+2TfBj!~6h7V*
zYq)+@-E6bmsBeX{bGNO$zc=cA@;(2*FZ}Ax?%}&TchAgi&yFAWh`4jDr}Oj22@ZcV
zV#@D7J^uXb$=B20=TAM^#LE3C_*&fO+Ml_1{&defGpjIjna{ubCqaia$6HBv_PoB$
zA@D*YL1p#gc7GNxRe|k!Nh)e?lasc-typ3=kFRIqjGA>JCK`FVf8V6rpH^FO+=y#q
zN2ZLh@Z4mPtp9(%pFiZL^IKr@jpU%>9v|0=j_6=RevM~;o;>dmT)ShfMDda&r(Zul
zKDPEri;q1r<AI#N?6D(XcDVjnEdN(y_tfimPx#iIO}izf94<KF(X|ANBPZhT{Og*y
z>D|85%;|M&_nCEG+*;A0_{->*^0V`<@}Of{-|qQ*uF`bVb*N`-ECf%RyX<!t==J;~
z_~!9`YiUL%S=N>{eR6h!8odr{0!6d+Tp7A<mw!wzO*(k$Fu(ntZR<ks&G>Qr18BAJ
zCI->ss!#jNB^D~p3+vX+Q+AtKF-iB-5wXdql4myGNU{sF`B;84b$V**Bbkl*YMYLK
zV)}WB>F3&Ge@v}^JdOXjvoPLHeRW}d%j%5imYy3)jOT>?Z8nzG#M#xK<@$SnecCOl
z#SVf(pZ0GS&-=I}b<X<T??1hMx_+%eXV&xQtMlFW^dC)4=4^lQxTgE+Gi4U@bG@&j
zC5O!>@S?^Hg{A@t7ml9Ni%FV&fA%-;*%!yT<|Gqy+`s=R;Vcd|fyv4a3w|*fzSmN-
zI4-khs&8DM;OvM3BPRFo{~5<#`0Ip8DQm^Dw*0XB_i?SgSzhWf|3A)g`;U4=*)iJW
zwSo@de);!(eLeW-1Kn9t_f6TlEcUI=zB1qZUitNFJ7gvK1ofon2fTT=dur@<b2Y(`
z<d6+@ebLF%kBWC3DH1iDbv2?a^vtK?^5>hhQXhTG`r`YgG$-*w#Qr}uahz*BnLe_V
z=g9uQp64rcA&e<|g+t4nKmJ?R^eFs$_(to-lc$g6FV*O-tBL=c9sd7<o5X9a2~QbU
z|NHT$wtVu--MifCV*cHVjZPNPt^Z}DKYxGO_q(Uo-Ikuru~6GOK5lwNFXzjjOTPU2
z8@u=YIUW7`b5F0Dl363LaOSor&%b*m_zG<ByEf~>>08hf=f3Q2n7F1+z1)$BB}`3V
zaXP5all63Rm-g<k&~L`8z5KJ>MOn|BT$Qvw3v|#Xhk(Kbv&I^~X}4Q*Uo(lTLFSlO
zfzBe@S-ur^7SZg630KXk2D_|*MSjdb@x`Cd$3Z%Fp!2Wv4GNBSi3V5I?@)#dO0mYB
d3$Oq4pK+Fi$ZzJGRSXOa44$rjF6*2UngF4R7%>0<

literal 29425
zcmeAS@N?(olHy`uVBq!ia0y~yV2Wg5V7kx2#=yW3BzV1vfq{XsILO_JVcj{ImkbOH
zoCO|{#S9GMLLkhTKL1h>1A_yDr;B4q1>>8$+%sfCXa4wKt~WPDZTiX7Ne0430vw!d
zte!6G7AZ+MzU$IRixn+3Jb1TM^yleE!l`!~I(E4UbcX*>JiX3_yU2JG*X*eqSQI;5
zm^f8h6lZ!G%~Ua-nSK84{r8fqE*HOk=^Yw=b!EP-|E0TEm;25ATzUIL)w!3KUDxmV
zbn3FJt7|$JI}?XO0|SU?&}OQwt@Rhry}4=W`Kh;7urRU+I52<+1<in0HnYw1=Y5{y
z4ijT&lwsYLcQ<RD&bg0Odd^^VAi_i0VbWB#_U%xu42?0Y9-E4$KDL5sROn^!43m<%
z=LAv>GQUVv;pC~%zSnRaCQK@knFSTxAge)&PJ}k7Xop*_gIjWmV?xT(gAaA#Musy^
zS`+hh2Omtws3Y)%gjez239khl6l9p*zJ2>JLu0Lr0u$5HrAvjnk1AaV-nD{BC9;N3
zU_-=$ZQH_r{raWzPBGS5p@zv_wlw62ly7&jkiyARoxR-x9NQZD;;vr3>Y19lG$bU1
zW%tG{pa|Fy(x7ts(t%5BUvRy-z1=@5I(q4{Wo?<AFY0(+STb?2I5f1rXXIe=bvVG=
zxNe=^&271}SFYN%YZl9C-jG+I^zca_K}DP2M$c72gUPDu>Xj=;UW5iPIav!hFf_I>
zC`Z=t2ypCd=!-l0xKL=#gyR#RDK|9KGWDd~6c4Tv5o8qG?yhp7M3|AqN!wwP=&cJE
zKWK1o*kOC>;_~+#3Ibw`%eW5<Y2NB|aB4XEwuT2}=m!piNuu*2E?(;3HmDN)$j@-s
zouTmpr@<uAT@x-o(BQJ@zI}6+V%Npx=Q$Jv!Wi8)9g?!VCCl0P>{(i7Mn=N(ZyqkQ
z{gfISa+y>jx4BOF7omLM%L3DdOO!bj1OgeCaVtwz?2?UP6x+^jZnlMokwxHyTf@XP
zIa@Tk8;&#e#8vY6eC1GRaA0JWIH{#zw%ti#F2jE78Gh~G!HxsDW8aL6NvB!n9DN%a
z8X6QAmlyf|1s@ZKf<P?eq%|*&&6~&W(D3pg152YCC@afx8pOU3)VZoO!LQ-y+m|I3
z{ERFD8=M;^>R3PW(05Wf@FKLM$u(HefuYfcMdIWs=6-L%6JZTU-`?yBlw)KO;8@R~
z9Qm+UR+oQb!{!}(mo0Nk+8EIh<p<Ki$O6x;CjuH?9^_f5(Z;~U5utXVWML}fQtN|)
z35C@KNsiv2%xuphaq^S%-0CR(123k2Rb1B0q0n$(1yfH-ua^rW%O>H3!s@cPDQ*mm
zEIFbHDyOfVxU{~Bd&7>s51!l+0J&oegK}geAAc`*w?l31-Yr|UaNL*U@jhad{k%`s
z`pIMY|2t~FES8`8|L^_(XWuNEF!j>;xA*o|FI~P|Jw<o<P7ap%hKXw)9Pbcgi*OL%
ze*M}tFIU&rkgzbe9ZOAg#T%C`Q@go2y?<wju;BK-zCOO6KhM|e?f?5W-?!*<|NkHT
zMHgMgQ$uU*N?)vaUHkp6y1(7eB_<{&Gk%MSi=XyXpQ{r8=aKl+9gq7?uhJE9V`zNH
z>anS<{GkrhVy+E4YC{$s5V_#;a&`RQRV8I*r_$|zNB+FfZucbmc3j0n)}3#+-A?)b
z?(Rvmj6+k-PRy6xey6DW&;9>@?>9t$`}XZr8?SWFWVMDr^V=A0_Bbf0GfrAF=f)0=
zS4_Kh#JaCvwR-i<7!wxxHs^M}ljr7I`+C2A^{OU&qnerdor30_|92EVR=NGeOTT1s
z-?nXLmQSYyKe^<sKXq}Rl~-K--_namR&U)JS~BJJ%jNUU-v4Af+AFxhr9tKNB!^4A
zhd4Iu*lTd^T<pB+cb1*UAD=t@<guW;jAHTgbH4koW$xXYeZ6a4uePr4)a`rU=6+gN
zzSp~iE9dvOx0?zdA4`dxd+(~sqBU!L#B`&k*sS;e_v`xpQ{MV}Ra{+NKfNp8Uwxoj
zd2hwjso_t0&F@Xn3|_{wbJ@m?f!Ef@=ie&17MXtXU^Bb#&hs_TjDv!Ll<xn1SMI*5
z?8xW5D<9wH*GH@Q%$Ts}_?pPgDIXsl{S^QIYy7i0vx66(oc)2Nk%MbOimSnk5=(Q&
zzx);P@$%ibiyxo<rRAHke*eE;iR+^`BsAVBJTCjp*7wN1uWR!=`_3(q3y-hesuQ`%
zrS8vT`EI}Umd9tAX1n~)Q2N?#|L34e(ykZ3+wK1>wE1*G+0QU?Yu3~`wcl=@ysm7!
z^ZUJO-=^j7|34DnKf$v2nM(J+FU#$x-v9sa`?Igi{5A^mKMt^;nQxeUOy#^fclwVb
zy;ecOI?uOR{e3HAwd-gj1Jh6L2`NwWJ$R>aZ`g5nK108}{k@(r%afD+*1o;J|GtUa
z{magi@6FENcT*)|mc)zg3|s#gpSPLpv#ZbYnS`<Iw5qjn>y`bjE-gJS>~AyCXG4j~
zn-`1w&6E@TZNE;bjQ@YBnzwvT;W5dRD&Fpw=csrKo2TEM+_%ejwps3u)0^#<bIy`(
z_gnbNoV!#cV87+dn(Cn6|Ned7f4?_6fSqZgxWdV<Kkf_-B}_Vb{>vY~t+txGOxf|=
z#+sj>Qj`|l)_Sq<<HeW8wst=b@}FuIkIR@>|0Y>pIQGQa<Cm6tpRJz%|IhQYuTSgm
zzoS!Uu7B^>YxDg-dn=cDPVdWj=`mB!=l`kjeM*bhKD?B9;C=1;>SuMcQeM88DQER|
z#p1%MJ@0GZ8}~c@dM$nbN86vL`t_0*RAhHv*5}wU^#t#VIpQ2H0S&dAlq5=a&6&wy
zy*>R|NJr4Fwo{UsmjC~JPJMW&_1QKnDbuny5ug9O+x_0`wvt7(p2gyj#asQ|wMrju
zms6itvB-17m!0c=|N1n2{~G_xa+B43z1F?G^fmI_mf31C=LC<aWPf^c5>&`8^PO9^
z>ZASN%l0SN#qORHY@^iRAjhN<S^1!F<y<DKUkf;=<>{=7PwqdOR90r9viFkaTKPW@
z*q3dc74p)~@7%)R>g#dUYdu9u8uzU0|8+#&PEk8-jX`jt-_DZ$mEC(xpRIJydQ-}K
z-Q#%m{onVVL|cWfZ2w&GX5;ZLJstjAAJ6931<O^xG5q=d|G)grdAaxYR4(gWzxUg$
z7u7Nx3KRA-c!vFJyOJ=G!FoHp{*3Z_mFY#g*X;iswm)&CQ<&W(XgSB$9yKegqbstP
zn-pHy8g*07YSq-!3xnIvotW9T>!rEGTwUcRi>|4++)Xd%C&!iFEj@X8R>snIkEhl&
zt8*w!n9AT878WD2Ep)-&y?1-!UY=mBj%QUrwd?P}$NlzsQcF60UUdX!X+J+dKi@6>
z-{1TH@9IQd|30tw+s!B6_*X6tX#T!zmR)VtCat;eylwB*d_H?+y0YDM+skt_eePZe
zo^12{g!;)#M_-;hRKI**j=b^O<PTOlcaL{7GqQXVRycX;eE(`)feWT4R;f>X_@geU
zYVTTbxqg@NE;%dRij%6-XKW4LRd*`Vc**^q%X{aVcwTcBR(pQCwyL-9(u;+!`{y`s
zFTU`^(>?pkg(r_%g#8T8Z_WF=Q}VCcBEO|;V|HGebA7+tud;=~2RxVU+P(X!{r}JQ
zXEWz&f%5uXrA5lAR-$X`gO+Q4HD2+&WWVn73ogFDYd#(opS^e6oX<b6EnN32wV_?U
z?#3JKWuD9L{r-Lb|Gr{w<GnMproqDQzTTOx?n7prFY4FKxi6dYMXO@s)j-v``>r|*
zPrvd~M|Nh^-m0xXV-L#zec}Erx?@*pvs&~yrLw=v=1flUoof}Ec5Y7Qsn^ez%>Q*|
zxzFDEKab_ln%ox+k4fCeyF&e|bnm(CQl+ceW$&IzG4XW2WfFKX-_%Na1)p5y<&{Tf
z=j}Rq$NH<j@2NRQe7;}4^j6L+_g0FK^<6F}-8mCC)x5rN{_ko1{W<@ZY&%%FE-n7|
zt?P59LsEB7%G1W<OCO3}IQn*0g5~1ymE3a<-`3t8wJx~8O3L)k!uuLmQXC#Hx8D6a
z<IJ<OvwfSEUXLj_$oee0=-k#>Q!*z_v$6^f4V@a}zVzgTy2%%A)_bqF{`ceY*(iP8
z<?Ww!-99JH*uQ1(tPIO`zwL92&sm=H{=8!MndR17{Qc&CJwEH}&U@cw-&eSQ0y)y|
zRhih~x3`ztZ(Y2&{FkmbAB(_=_yrlKr|G7(+diMI`ZL^<mxCqxz|Ebp%cps)Ym!~<
z6TRGXv!7y?(<0A{9-SS19hrZ=7Jhqk^JL4ho&9}IFQ?4ytI52yq`gn&CBOIUGWMA=
zvp&2uot0v#oH;YbJVsJ>=4BV{`R6ltS(Oy-_Up}hv^1~zdMfXAwR4IM2VO8mZ_hJr
z_1NULeNl@l(=U1HyAeVEAFqryE&#Q<I20bVHcU?8wHJGTRCc8>qdaR#Vqtdn>X~t;
z(nAg$*DJ^d^;Q}uaBfi3PGMZU^CqXo{UeuFN8Fh=S9Yl&xZNw9prUPWzm9K1Ltos>
z@IR%6CX2%v`9yp{{T>}rg_E01HUz$(R#zM#&NDf|_3vbd{~&$;Sv)rV+5G&R9EU~s
z?b5{EpWhnr=Q&S>^y+%F9447+39=qiI`HV*2A8ffr3MD3ivkKKyWHlieWz-@JzDnO
z8td(ar_Zff|FG!}%dcNmPoF%_F4{d~wLnJ$gJ&2^Q%<pX<ej|YlFjdLcg5Q%?vLJW
z`I~#EQg-9IzOc&Yd$fL@{B%C8R##j>K$LOPniVd$4%NNtzxC?eJ)OMm20J3lGQaOj
z`*~?C|A}|Up6RS#QlZBrd-k{R{);!1_uB5=8FS8*!^N#ZMcZiMw&ja;^0uo_%lq<V
z`u<q;{`Iw;ET?(T1ipIFSME{nKHGDHo93z8910Tz6i#k>lDuI5&TH4MsR^t3NNjYU
zHAlv#;=&(;HyQf_m+fZ_kBOPH&2DetvZro2A=C0V?6CDVINcrpaclg97*UO5R<<{$
zdTg)|a8M{_oV4c5TBhit&(F?&+C2ZS&zIwI@ArH@rx-2%=Eg?nce~%)RlZz0eaZUu
z{#{*NPo@O>O<cWxUzD2P9E%0<udl70{QLd>_-}7+CZBt)_wss7aqpSA*5=ELnDtIQ
zX6?TH`M~B6m+sqs-t_0u!vD$#wH$JO3teuStLxhnCwgF3^bK`~NurNtl$Dg6*!%sS
zw!iJykWcLWrkzqXHXjZ!Kf3~|PESmkR{w72^D}94ug6vAZu)VoS333Ssi{S;RxY1)
zWYzNJ?(cR!my6t()LQf0`u@b1mzU4pG;^AF*qrCWZtFj>Y<W{8wq0CrfmPL2;rA*B
zwPY;IH~BQ&*W)R4m|y>|vhwp;^QX7(|J%0bx$S$&jq0GP`)QkW-UQ?GHo<;YFI6rc
z@iKpPXG7xQhHSaoFM%sptrGG*_U!z8eQq(G38|;2b*dF-Uti}t?d+DAPfa%SUOf6%
zVRP<1-?PMw(@S^lh+WS9^IJlq(yH#;rBwmqJBk$=9P*fYQl35&>sak)|F^{Q^_tB-
z(Qy?ITLo{MR6H;KyL0Bs;N`Pe&hGTM9`<s}V^HhDZO5F?o72ymEl#njDt)<h`Yh9k
znNy0_o&Oqm`|^bg3GZxo{M~u&Wa&fEACKGS7JW}X?;X4+<dm8pZ@#<Jg-;dLtGB#c
zufCJZaZN_j2Ud?wP4bHcqa%WXj2>0Lymw*Z%GljyC+AoePdX|kEq(TL<mNQh^OpXg
z!dFPHc5bHS^II`;rU$JG9xy~3KWR#TX}bQ6&!6`F6{~#aI5s^k?TD6o{p7;FxpDW~
zehGH8FnETk9J1Lk+27`4%giS0_j^81$~Q4Jo%wv%`zsHe&u`tbWya;1)1+hE&DN{?
z&Pw^Vzw2ny%^0^xP|3i^!lZg&)*6S_!@rMRxpwVTGrygN`n-yyqE&(KU+K)azE*)v
ze%I9Ie;1W67d5{=@y(PoY+KS4chL9<$1DcVunS6$601u@UTwRbXZ$;5Y2E68{FiUm
zFRjkywfi!sPw(Z#%$)~IKS+Vc1sYdyPDpW8d9-%z+M>^A&ArRZx5w1~{dzLx<ja3g
zPEJ01d2jW1tL2mWcl{4bO<h_!H*@Ecqc)Bps~i*-F{wlfa_rG7+5h!g^x34MyQdD`
ze6O|jb(NpFT<re3+9I!j`}g<N?tWnxx_oZgEX{eDJFo1j>;sQ5If$@E{E&OJ;<d@W
z)$8|VRXuofVcl)*9(ntFZ^})RkMVrICtH3e@l@@P!}8P2?^PWBQ@E@4%SHF@&%I8u
z9QEJtmY-e~y86kT;`39T+xcdm_1G$Rcfl1)Bi-jyo(n=erolBKrPbmUsH9d7SsA<I
z@3-4$Pjl<-aG0hOnKbY9`ByJK-bn7BdHl+Ly`4{lc78ggeRk#1Zt>ao?PK;<ZCw+&
z`PiH3rup}5HY;Yn+RkUJJH1MNo-%lNOu)2pk#6+18TS(}{-05#@POk*UBoWV6?rkU
z-ksPIv&*W2zwsi=yNZ-<o1H8Fe>ZX0KK=VA=L@^Y-(@+cR!nkLKQl4ZyjE}VCJ`qE
zFD5IFMee`;H@SJX?Bf%dVU~NV;kxqP6I<?hTrURoz#SMEqgf+<<YlM46bFsWF)(rb
z&~ljcRNLMh9N}Pjk4-tfI)7oKXz{Ebn`)jue+DV`6%tl6cure8acMl1{{X~a|L2Yj
zIG8{kZiSPZOgDXjjj`2;DxCZ@b^dIKUmF_Mf`&5OrqwBe{oc^9o=GKg->2eYNJ<sh
z5ZVCluj@nkA3*%@x;#iUGcaxAnvil+D)Lt=INBMQ_Hj)}`FZO6Sx|k&BH(Z!jB%1q
zw6gbp&?o_jAI>;QC;sP7OQ>gWXgN$u9Y&s?@~f&G6gKm?P0Y=!>-g8_3%q~z>6h4*
z`HLHP=dYL9J@0esWHsMYKcn<`rZaek?ReyxEqKB!;r6!Npt!hsS4|yt?p*bqBzk1W
zmaSX8v$L}WW{cf0JDRldz_#ADo%#-wp6=5$ReG?yp-<1m#KgnbxA(?}{$D?gWP7cj
z?AGR$&<Kc&Qwt3ZW%mEX#mF*=NhQ*gYo0<vJ7`$t%h#`wlM`+VidHo;Fa?Szoa{=v
z@^bT3rr6F>@2y+61_cHxPMtb6?At^?P+CY7QaH&Kyd^`MNtxr#?d|8+^lnV8Drm_o
z0u?MAQyHQyTC`$J#2Oo!tg4oF-~PH{-MVc_f3F^p16eEpA6e?((U9AHTUpL;S3d)j
z7}tc9NQsbLDf=0^Z@=v~v~^)<{J=dSrPaRei-Hr=+qZ9n!o!b0`o?i|&N`(AhYD7Y
zO^2kdqvQ-hLw!0AO2ipiob(SI`hKB(0^be21CPpXEBpKhCo(s17TM(F;J$v=tXVfA
zu5@Kw;$#u%0F{?ll>F+Ql@~~NPn$MvQbMa*l8Fc-i-3fN!z9xS&EXtB^d9KsU5~w8
z`n`+~l*k(kKqZTD-j-WIjAGlPr6P8<GB8aPNqAVTa@cQqv)X}2-xj#Gd;_%ve{vg4
znz~=nRAIt&hVI*+A3aWD5pYo0z|@n%YGz`h!^QM#ck{=JIY-|Ha+uY+Ff^V3jqvT9
zaQUGE$A%rY9DxgXITRWiwlk?j-uo3~&E(7yamTKuMHnPFmB~juN;1q!)CDw}XsES?
zlaWQ>gI~i$o%cB_B^#G8bl;vV0xqeQln;1>r8xPz{}oCo+#UbvjyOnVc*8`U`oBAO
zA7wgw_Uxq#7Zl#y$t#@jQi_Q~VFIWT#><zlIAJwI_w8cHfc*hE#%0`ZJ5_Bt8yLE8
zGYhcH0+k0WE)5gcG_W+KwZu1ET>atr1UZnm^SBHqJzb_&>Kb++@=jcAtnS7LolSft
z;1cJ-1_tHGcHN3LhignadFN;KaD#?6PjE~~aaFrgawV5>8T(zarFNjAKo4YNm-=2!
zkd538XLLbj1UHMs$xR9!B?}9fdg4US&9VlkMezg`?Kgr;{;~>RIQq6~!;ZZPPwsGl
z1`f9}C`T^jlke4U0S#cTTIF@>^l9!w?{|%$;wYh!!E+j`;}Y(BoCdZp=IWY)%Dipd
z2C*5{EidE!K<)#LZi8CnK`as{y$(LmWYRkDLUcYeC>=1Gvq+pQa-L|lMlhjpH)N2v
zq2WDKPs&d@CMf|H#`MB!UteDPZsC@O3v3_{F)>ck;coH}|0JAHWngc=4m92=AQ9K_
z^3cOr3u#7BB33w20;<101U5|6k^i`JYdup>+|Ts$b3sG2D?o$OQ#~%9M~Ym54*?Am
zb@&TcT17DF<nf2uWbiU^C?xD=@SOHma9O?Ef_?kqe*OB@lF$FC5#$d6jVTPCVGEb+
z?AK@7wPWwLZDCqkT1z%<x-{LaAQ<GU#thK-nen@cFHE~{D+{Jsbuut<u!J?VzHj8^
z<vs1*aP;lZ7lpc@;<-VZsV8OULJ!$S&`@uJlcO^@D!C`5xc*a4;0I;lPE}h_V<89B
zPFL&_e9zo{TlpX3g5Mkp4Gs>h9-Ek?BxX&W$<Te<xOkBW$V`WatPwxrDvIB|XkyrJ
z{enp;6qKMiDzpxGOk2Ju<XtO6_wBs_OZ`AjW!%mxak41-%JN@T)zwRvE=|3%JG<$T
z`_4e=X^D)nch<d4fBuc<Ab3<-;lXSM<;Z;(cb7jtJKOy9`MPh$H}_U=zf<{qZd&>0
zgIm`}Z})q*|9{=h&FTG>t9R{+TDS9=)J*I0cMXg3rb`D@%IV*_eS7J;b$xShe>Qj$
z1hT#H5SPKE(1`r-_t!37Oq{g3{_pkrsq^N^1#kancmF~1<72&>ik^DSG*0i+iQgBK
zx96jqrmpT(QSC4fXJ_Y4J8nOnB>McPi}?2UcXwa!iTiljqB5xnT<bX;WbxR<<@WYp
z?>vl#`A4>XyI(6pLPJkpTI!wp@6XRo2?v=Xx8=;tn6$0z?X4%JdDFea<~$Y_+y0#6
zcq+KYZxm2C$>kzZlzrso^7(rAe_h*thU2P-=?f{HxqdM_3KmN4Ejo2}p6%^F37h)j
zUOp_dd~UbX?$wK_|2Ax1xA)S;)e$<=vO{CqLHVVjK_684Z`fUYdD5gwf!bL)IVP!T
zXJ?r%d2?o_@zVzfo1g8u{j}|lPPg!^grkoO#kQv>x&?v*>jCG654IJCg<D;HeSMeh
z+q7wu;@4M}&u6#gO_wg(tmC)goffxF7pO}LN^BF?9B4Z>x6P9KVQF{!LHEMKjW6VF
z@93HTh}#3sGY$$_Oe&Gn+-nZCa4u`l&CPYLTJ>DbcUH=|-LZKm&RT$TcZ0(b7LQFj
z{6C(Yob1bA%H49X{oU%PK4*8v=6%>((F^vF!xfN{{vTgnUUr2yT6gcM{atpE^%<zq
zDp;_4&eJs|pm`GqhQ>fvuYF&Z>emK)g9cEq91`J}*5LR3<u{&P-M>M@DBsRp;&uQ2
z{(k<os9t&ddnOUrqyN72uNV5u_Hc@3@R@5I_J3dcFWs{z=HIvc|7JUFn{GdCTI!m8
zNaw@zwY{Hy-MeN`u4t0mzg>RPwq|GdeeJIuzV>JqUHmQ1_g(C{K*yGb&%L$#VkI8+
zAH23U`suakeAx@lxAXVk-LvmO6L-qVNvh9&K04a%D!l3H>hROEOta6_MSgyE)>wMd
zvbxt7-WD-S9peVY1|y4-TELdn(_){kb$-dm^8IEt*}ZPX3W*JdFAMgT?Y>j+{ecYA
zOs+d0Pl#0(1^<7amsZ95v`9E3bIs&hYqQjnkBfw#ome&7ZhBxOm!g0wqb$qC=80=G
zTx~C2_gUV0S5Mq9ZC5uqd>b}=n9I)y%Ge<815kO(z9Ixvq=2*agp`kx;8F=h*a#?`
z{KPO-3)(VdV4S35#|%!wp!$xTNhMNlL69oUEQd)))4|;k5b?pGLFF`a$SM~Q2V|DV
zrXM_D8$g5{$Apy11~2G1h(ZH{r`UXG<5$4p05jtx9sYooLNF19laGu+RU1erM}>mJ
zq^FEpq2PoG5>bh)VFOh|;9%ru@z`YJu+$68VG(d>Q0YDo@+VmPQ1ooTE62H@*kKgP
z$jjpk$S%tE+Ot}FJNM30#f;K+@$-~<cO6{fIhk$l!=<opfot3X?TIt4T)XB~S-JB_
z(#C-5FJHg5?)tmUY~R|ov5!9PSbO*LlK8~`_ZO*ah=qGiN-ZpS8CAmi?d@&#wQJV~
z1qTcNV)0&VQRb6e(k%I4-t_6yJyTOt8=^ff3w#J~Fpd28tGJvcM*Ie7Zg}&qUAMYe
zPM0cZfg+kq<$y<6<AR;MOmW;VZp~<GW6O41zvtVcI#5-c%{WPCed|j3MkbCMX0{Ow
zMtPtzp+fIK$-?JH?l3UEXDKPPzTAB8XOJ<d#naEA90{)0?6?f7o+{gI2Ng3$pxI|;
zl`aJV6Gpf7O=5z#ni-flctjIavR81X3vjFfHH4(4q(IZ2Jc0@*rJN3NvNUN1#K-IJ
z(p;`v9nTs(GYr%`dB-^+WoNplFGq#agEx2L0s{{o>z~IFtjWZo@SvB$bDH_OD_srR
zOgeextrNXKsVkl(;>SB~Yjf9x5=OD@{dq2&pmyU4P`lC6YK!h9CY`+glp8Nim^dOd
z944hE2D}WaV2!vVckjl<A{GIMgbfUy*AfKdlpi!Rbl<LZcs>o3gN}o85Oc6C(_+pI
zJ8Df7?}0jyhcpiy`d)CXH!ND|z@sv6CQoxv9iGS{aZ-w{HJGD9_rRkvP&k5`jPVUB
zr~gY_XzJkHu){Wqartfz1%XJ$No!8D&Fd47TCjI-?5kI=TISy7);<3h<coUHaAe{0
zb%LPj-6KqX<)B7P3j_E4pArfW7B=LaJ@BZEzi}nFzW{0#GV<~Ha&KqozI|BMKB}LA
ziQ|d3!=$O}6|O5A^e}YaZg+eLY9a_2GEQ34!8+$%mG*&0W%;!$WkKz{$qb%hGZwi<
zGwU9B^v$8Y{TL|RS;Z3`Rv$dMb73x%PTqFiMPJw%Sp*8)8z$<M%dAvg1X)s`Vrps%
zTJNyRVLQ0wX%kjBDdpE%%#orH5FM?(bm>x+2+4>*&=Q!AMGT%{B8&aze-<hb+a4Yk
zHtX)~&#QX6!TQ#KhGosRl$_ya6x&|C&}%Lz%;z%c)ND6i_vKV7quBP{JYJ=sh7Svi
z#K|s)2``iCKrPJk{i{LYvVzNClIYbFm*4lWd?{yt{L!NOw(+G!0-)l~VHJaN<Vq<U
z_XoO+V%t9lf(kf+6X6Xi+VPI-wu5H&ueDC$19^BKhe7NMZfkSiMGW1yn<YeVwJ<Po
zw1hWIT=U^r-?ZHt2VP9=o)H4>iYKs0oP5+QPzh?KmX?~@_X_{?XJ!Doxf;}}OZW6u
z6wb)Yo7UFGmiYYJ1lGQ1pfXTVP~jw(=You7yP16WcfIz^1((mxtTXgvvJOdhvqs#>
zD=YwaA_NQ=-8M0a3Cwytmtk@Ey_?{C)^H$z(QQ-Ptb$`spavRy_ibGsy;#t|1(VhR
zk1z*j=goHnK|vcD>RDO2(|T$UHz)uYm?SwSq@*^uOf29su$4Hs<6;&lkAoI)<aVn3
z_2AmD!`AblFt`|&XO%elNpODjZqQ1D-^;FafC}UZpw{2corR$cpj>ib!37miemca|
zlj3UeV_V7H$UAYt!H3U3x*-(u3sg=-C^$??bre{9hjkhIVwu`spur55=!Tbv5{|cD
z>s2`L=$l}I1-JzvAOZ5GFqhP%l?;o+XL<#K*1b3!@Mm<}^yiBHhrQL+)vm%*nA!Py
zs?uYhU%7PYQPj>r?Nb{-P2QG85+L8fx(x577o5DBU-wx$a&OhvlCrW{(qSPXC)DkK
zdV&T=*-R4d?kX+%|M&apdA8MOD*sB(%3inA?b*4xvx9dsia-6>bo6cIgF;Z50&1r9
zr2IS-cVqUycjfyh-~ab*`=*MINk89}@7D$`FOaExGV#;o`F~u>-rky;a|Sw)Y?OXZ
zCURfR&N~&4dxN5)w6w$4OlWIsTXR}f|HNm{+S<L6p^tAjS2{sksgA53o48KBJ%9Gv
z`gr}z%X}yI*S<+M%D$#^F~xQMYmV#L>-SE}xw5$5PV1L+z4vszsXsqIKi$O2opN(i
z>ZOYp6|=9eJG(39Q<Kbmi|*UW8zt=D%vr2B9h8bWeyBT4dOE-M;5(bVI~K;iFMLE_
z_0E0rszbTY;O&K%J3uY?L#^CrUrfEc<L2gc@6^<#FEpmh&74*Y8VkPOclGMknJoeD
z&x2x8p~2w>i^rxzVjE>{RbO-!_pGkoJyY$@-s<fycCBWYt8h4H^V!EZX=$jLnc1va
zrAx9u7#2VCv8?#8z;Z5Vm^9^cl(3F%iS3NOq(V^r&!HgT#wfP0-7qV1+s_}5`=_t3
z|NFY=`P}kTrPpKCZEbCf{{4JDyY;<asIRZ@v&_iInZ;T^S3IASFO?RhS6RsCFR}9!
zV=s733=5O`0gtc;PLJxEO;%odX*c&(_4nQPb%U4tO|}2`vHw%M{U623&HMJ*eU7=F
z$!piu-R=7S1=`rH!6ebfj`dMny+B=soe$fj&wNR+k(&-$kMe1C{9mtQJ(9}rtMC6#
zIn=`GwrK6z+>VZUvrRH5S<cVgsW`QO3Eb#u?BFz*lv;V9l=tfVe_zy%ZCBivxZ*6l
zTEFHYw^8aTk;+#qm!H{ra<cmD<9n;W&pLi(e~IjL<JRe!JFmP(4Ci`m(&^u&S8@Gt
zWbo6H?YnnJe>s0+WAfRRpoxgqXS?n;8>_C!&$++v?i-={TbavKL(hpkgAN)h={QVE
zt^Dv+y2?21%mmZyYbV~<|F7Qsb4A|O51;4%kKvQGQt|t=gy;F(@_BFW><lic3asDf
zcD?X!-S4;0eg*s6nrcqX-1&qRJlrARpwPs$=Hw=u7rPSvX2<`Yb*J|G-DmxmV`G!I
zrkoVAd_JdmPH>ugMQr_2`~8bOXTJMp2Os4veg4Del&bbKPEfvNU=kG3xV0&@`)Ab5
zf5)dB&SQ-Iu&@4qou<CNzg~*`%HzAHdDq_$5MEp2zU=9xs|Tw&dejPzD@Q*$>HBy8
za?7a5d*}TZEZyk$?d^>zfvVkpGn7~7{fco*)ogK?!m=&zZq}~Z|Mo8k6zX({FFm+>
z^WonacdyQWc=E}KEir1Pfo$NYVVunpF*!BZ<R!Em<X{1f%@{0Ppa?E_ITR8mGk8w(
zy|_dl$`_DeoV4aZOH&&pu{JdLGO0wGxlY~(<vS#>cx+-4=8|dxm5U7wOlF)DQf`X)
z{(|uvK_$G8Mg|8Y2sm!2I7}LK0F^_)i}|t;C<f+nn3$V;+sJ)i^3Eyr*0pP4E20bM
z>wp@^)1QiptY5Q+MNtVf$--%Jw`ZP1b@lEmSFd`yy0(Ja+00X>eDV(!V7_tns_3ut
zVFIz4lWm#)oKE%EdCAG-$tW9}k()bp)+{OQf65kRXJ(|_uMm=9^u1@=`P>1tLM>vl
z=^pNML5`&jeL6X}x1HUx7u>kkp3=DBBB+t#)G$%Uj*TNiX~E)fUtiyAJ#mpjV!Ij{
zm;}WVRJ0ErT>knS$BP$J_42l-R$Z8P;({=XK*uHq<;cK3yITIe4RysE7A|!Ba@%W7
zFK4aAOYp)#he@fC4ln&mSaPE8$jv=*F_=Z5ql@8kYhb6z-z{zpN8es+nbfDy(D0P0
zCnZuYVORQehQ;A!M<?G?XlS?#TGc5VUzHA8h&Xqxqz;!>tRn;CYF3Gpo2>SfoMU4Y
z+kRWX^;ZL8<hnS6WriG&?}`i!CJqGymxh;z6jkOp9H?g$+x}agISSNCd!l{7BWzz&
zOn<{^rk=Q+koH-FKWGS#<$SK7gkQsbSs74UP@%!Wf>q)qSNffdt*K1s9(`N2N=s8;
zfBTy95>T76V;O^In8{<m^~@><z9cj>IR=B;zv8Sj^hyLLuL3RdJo@%#MxYp|r8*z9
zq_SI5cbh}QMQzY%AgI9|2x@S%c5D|ch;BIgHm^HKo{2+2z=zRoQ<J24RO&*|;3atV
z<&0L_CEnn?zLH4=+$cPt%(#r*wrOb;i-3c|0VW@DHVX?A-9Mnwz<QpSpuYEn)eOp!
zJ5LqLGA-sXs50de$OnycPU8j@`VBAV*)!?neLp^TH>iE*D3qY0?QwB|?n3c|!s-{!
z9_%2GTxapv6tj5Aq7~d%u3z_#kDveH?ZFlGLNDx@I211EJ4`yN&e&+fT2fe@o4Yn7
zB*Y^%HFe(BLhxW#gDz<L$YoO94^aOi{>DyF14V!fRD~+}m>6|{oS77oAq?`a49L5}
z+)+Y8jAGl{RRT<eLA{R129?v#847+EfO;J<9~W%}wNd9YsYKSjDt><fG)``^aM40g
zl7$s*LLs0baZ{r$peZemZ4BJ^n`Pyro-YOsC_=k-IsyqQr<)Wmv3_TbxbqG)Wdce#
z!U`w5qK>?Lzk*38Pkw3#qy&UDJu^7AY~Su38!KzQ-Cg<47tnaYhnNPH)5S@70-)5_
zuIRM|G<3@`oq_xQVNw04*P9r+Z^yDN1uu7RT*9CXnrd<Jh0H)K0mo*<m0kYz;NF9c
zn8L|V5;I;kYr;Dn2YL9{f||x_K!c}BJta!PptgEy>e9#u^In!t0WAd)a8QV5oU|tA
zsD^wLD9p@COhAL|97`Fv?>kGHNzLtL=)S%A;vyZ8R~n*04SQ8j+eVRu!fJ)XPK!Y)
z&jU25+-cyxdGhUTxsxkw&OQ2;(KbI0ltT7#8%%my&5_Y?8`L$8p7INn7Fdb|6;7UV
z?agM=KJe(<fws0bP?K$<aKbKwBE{{S59{QC`a4{pl)jlkIWn<NF4vq%C+~SPD8DHP
zxPanVLiE;@ji46rvPB9YmpL?o);k+mY%g|Suybdml$2D<+}n3QE)fH_=)bdiY`SB<
z)U6*BRfYyvK~Ce?p>&{Rp?1&1RZkuqY~GZ9Uhd_~my#PFS_NIXbjj$^?{m^Krxl-i
z{`thCZ#7?bfbyNgf(uMNDWXw#mjBLd`t;#2|LIp(S1;YV_39STD%ENF@p)#iOJ;4&
zyKA-c|G(e9Ld%}7TD|(|tn76YcNRalay^s0>?vE!l;hlP>pvZM3?2YxjA!xKRFkOx
z$M^lN*Ls!TZl*s~mjBr?r{>d1qqH*;m2bCRcM;Zoeq%@B;x#clgZym2hD?rl>2clm
z`yFLa+xmUYb8Dm8UnRjNmy7)N{<M4bs4RE6TFu4?o%^qLK<0iMn>Y+&BLvdw^FLkR
z|1Wf2<ul2hzh13=y6Lpu<i-7Vw^Ve}=hv1Q6<!jv`}JaRP-v(s_J+1^nbPH=liWo$
zi-IT4N_hFGOlXaa;7-u`bB6=wjFWWkzu+!^Y?^(|!_~DlBgpj9Le8_#&dvrcq6~_v
zs%R+w_U5MA$%_}YZH;uzFVz~^uD{&O&L?9KJo6T0N{o@^kXpfy{mT-wE#IDvaBy!1
ztxmmI8ac~j>(;F&&&)LTWeSeDGe6zj%xu;#@PKig?&{mBpw_J7)Re+SD_5SJlJ-T5
z+XOlS?AM^8U7%RF-|_eN_vW0}#P|O=n(}n++_^<}3Xh)*-}gy$rb*@`i%#EHQo74G
z%q!lPIRmmjLvkl5WrCAwlbXXM(JdVn7v@#i=siBxJ2`v(-mqt9XQ#hgkiF&Ij>mkJ
zFBY~x37-FJ%9pQSXMWzhcdv8Qg2l1tI>MJdZ3{UB8gO9%jguajwT6QwX20i(%MH6`
z>|L?q#2?GgXN=G8)Q#RI(a0&RHp6|cmrTtIOWC)Vz{@cnn1WI?15+TVFmX7t+-K&b
zIeb2E*ZDD9Nl)^dXLEDU*7EoFt|&eG`R?xSvyaMaC!)5*C#1M4JlORj_WO|{GsUZV
zuccO-->(VovwEeWyr4SarPJrHudk~w=lk0G_V)Jfy36mkT=qM?YL4a^==8ozM1zVp
z)4~4-*zFSB*5vK~TQ=F`rO3nme{b)fdGv#Ld`)4{gFT<mO`dCAeri?d>NEdBcI7t5
z87Cj(+3dJ7*x+)JU!@$lKoaO!#K3)DS)lZ8$d}FY|E~GDbB=WWo{L{1zVH8a%zR(s
zwNy)%ZgG9H+tx4q-@mvQwJUy_-jwUSp27P|XJlF~kAs`y5SSElxMuB{pVuNq1Q%UO
z|NCsgyW*wY*Mlc7d-!Yp(-Q60E4`kdHO=pAo#U(!+-NO#Q^`N?*5u5>Q%@ByT#8T!
zubOB>TQvb%)p0jfMcXOxdalHr`|>htZ(m;KE4{X((*AOhWT=}Wxa45b5lZl#=6Z06
zHn_&*P!Nz|oV4b_k)~<T)^LL>lS-r*>*RG%zC!_v$EGG>?kHGmSd4Q*N~DO-E*SqH
zsCDe8lL74@a72Jw$AJbfxge3w!Q$SaqHVEpfhyF(gozBEqYfZ11R6@2czJm@)%~pk
zEl#`qP4{w9ruIW$P%|fiX(?ki|5--{#%`8<|Np)}z4^SIwsHEoDZk(EzyIaUzTfXA
zAD6540j*p6dF%SVv~#@S=d#=8^{KtI`_LvLI^84Z*T-jum#e>hEt{QP9revCK7Rd_
zDgKjhY)M|SBE@G}=!~Mf?XQ+TzmWIxZO+6;8-<so1Z|z-H)Cd~ENFkn1Fi`vtmdE%
zJmD;_UcZiAsXpDy%F60Ys;#Z<qb-j=9+#iKYnRo{&FTFyrB_2i8yF5x_1+sF9UcAZ
z^qzUyL05i0E57vYmb`1#qh;$(zW>=J(mQ)f;NH1k>nCp0UA=UDcEaqgV}4UO-|uir
z3htBII&a^R+UU4H{x5HRe>GuK@~V59kNtOqbai#L?GfK1{Bhm7l$hpg+ZJq77wZNM
zo(If!-yI{SaI#2p$}0hmE{Edc%`Z&m%>Tb2n`vpg8qd?GPoMpKIz3*`-~R8GJ%8Wk
zPwx~~pH+N#s&W3Fui>66t^bF7-6B8bnlHacdGN27r>|7=*WLT~Yd)WP#L><&Rky8Q
zUc9zZ(e2!&KL2a~;=Zn}xwT3&6OJxB>)VrXcG9}G@FmMr`;WXfS93esH+5sEI^Vw1
z2XWa_FOHZN^e%SfU~xDww|*zn1wqgPf_B!DD=XHo_s`18a```hbG-Y@=#znkg&RXc
zLT038Oj=qW)c^3**6rK9BO_;Onw9yKT`pKzy4<e+{k;?+9p9`jucS`R{jw|b)4%K~
zImDxB`zdyjvft5-g_m}|X3f0&XT#2I>o-SMMM*Cyc_f(m`c>AAq<i{nXXpxx|Ld*1
z7hSwcCZ>3G<-NOGj72=B)oq)zW7%7Sd?kTE&<Hczyu90*3pzXfj=rq_u}AJ;R%Yfz
z{o0q_i-H@Q`$0o*=PVxg99(|(we|Zw!SiZ9d0M{P@i^sZm#Fip7gFow|Nl6iw(-vt
z&EO|{-`B1ekuSYBq3B%awCQ!)vAyeOl?G0}_f_)wmP(r~53etJJ@42V8^>ek?c=@F
zub=pFWXimKdDTxp&Y84^Q@t+dfbFpm{VCU`%X{;r?tS{<+KFooPR(&&zLtEQe{tf5
z?S1>!{aYDY8)=iar+Ah-ivY*Q0}ubVw(k%&k!56YfzGqAO7DH;wdVNEjmgJ1eA#s`
zYsuqY^LqxlrOP;iPiM;S`}cLdy1%SNfrDJt3q{LUEiScJ<-O+l*9OUG8wZ!(?R>fG
z-7_mqUmdyYi<jrtCwb+qu8fm;J%81il)Y1SDs=Dv^+>l}c+DaqO+TF``L`Xu^YfRn
z?&ja4w>G*?{c)C`e@~ljik`ODmeMzCS{H{N{LP^tz{EIdjQ~rhn$iS6hskqq-HI}<
z3XP48-SE;;HZ^K%)>O~{=(CqEE`z33#WwAK9sAzv`V+zXmjgE@_uGd3`}h9;y(`t9
z&zg6uMQxpZ-Sg-cW8wP;UdJDv8r9h6Rk~;6wK-kyYgK2ayp&RZE@52U`1#7$<9+7;
z=d207y~y)^hI?gF$lC2|FZ#rmU9;2v<=+2j)5=B4sfWK7Z?USBXJlzoKVTPmu$xoY
zNg)|DRLwbU-QG(t4?3;ie@W9m_Q1N}_E`xpKc4ij3ragbZ*HM{5O<%vecZn9d*7ez
zRG+7@d`?l<pR@PBtPj7G&r;UAp>EZdq-i4kujAiey?Wt3+gjs)*LE$RbVO>^q>q<_
z^B>>({O(!R%NrlJtn_zZaO%14xfOY_r$ftPlDM{1T&UW4WXj_Q`MPN#imd_;3KN)A
zA{%+Qdz}(WKn^?Ed%yd3X*KKJ=U)AwZC%rJB8{pZyK5LG9%^CaUitj&?CCl;Z(p2K
zWA~%8PvPal-(g?3$WOSpuI!~<MD{t$_cO)y{#~7YBmMP-WAWepMb(yZs_%KcIBorE
zpS+8a+a39A|DQf$F1%alzRDc!)Z_D%C*4RseP!pvxX$<0x|6dsni-fF#T8C+RWxMC
zF*UQ66#m|pd;83aP{rl!?As4l)?SY-pSf14WOm!@b-T}9y=d|`Y*Dd@sBGQ4ImL3p
z!YkJunX)jld#c3WOUY+?{;{0Ve0?lAe^2PF>-UqdHL04dnD8-w|DBxO6Fl$k?cAEY
zR^NV>#;tTS$GHWcgfy+6?G5_)?)+>QZ=tt&^<O)ERxRRT;$VqsFpXs77dY#z5W3((
z_wC^Kws$^@$JYeP)$OSN-Q=ymH^k3Eaes@OxoYq6$41ZA>Pnl;Ea`i+N%P!g#r~zD
z?z1$VWjVXlm+^ET_c2KII;OsiOZ|ym=!)A3JoiMltlu5XxAuSirQ5sC-&y=8SNzls
z<$HEZe9v_rEPe5f=iI%hWTESpUte!omiO|)-ul^*Ti(Z<R|d_&Bs}?_EpgB8ViC(4
z&>AJbLxL?AwOOyFyx4vJ@4AiGTt9@zRW5xYW%zgT`=>=Frlu!*&F^XKE`L8Qc6V9l
zKbC&EqpC|gSyIAoY0bU3<{k6a&X?Q%&Al?W_+0C*ZQkw+zxc-|tvY8}Qnm4a%>QGH
zs^ZGa?0?vAKXGuY_Sr9sgSVw#&KI(8y}ZBs-;Ky_p|@5>8-0(wdm=BpvZ(Ljs|#DB
z&k5fDd)>wQ*Za)6XV2Gao}2XX4aYl)j~xy(K*JuzUoxsySW3QlP3GT!J&yO-y)BuO
z-`trgG1XJ%7w>`o`ah3PDm|Z9z3$Iv`~StCN|*VUJp4WX|DW`qN7U^MA52>8XAwKA
z?PpqImZI+pt9un{g{$;`7F#w?UUM$?_0qRb-GlUv&(EI!cVp!hUN`kUe~muJ)PGvG
ze)r)&7niK6cx9+|)9bIM%-xQV|4Za{iC<q5yiRT--`ymq?Ufhu#b22#@Y|GjPnqIt
zHhYHE*B<LvJkK@zITQqv7~M8G$=J-w+uu-E9N^yCG%aD}o_{KSuV$^hl3{VV_VKY^
z<K=VRYaiN_%YD6bV`K8ygDT<jKTo(%`kM7u{?~=}Cr`e|XWsMwKK<RJb(fpZCC2g3
z(z+tw>{q^I-}>P4UH4Y4*rH?j^v3_iXI(qbI)5#_rTkR7`S7)gH!|yzl4Pg-)7WY$
zq@1<Odym}Fr@?1`tuy$uq%YH;Ua`R;3cP?=<zN1Mk5}6(F2x-@#C}VYfx)QD)5S4l
zHiyE4oei6dcjuiJcs5`6;#ZGb;=U{9wB+n4-n+L`KG*Nf_NRY(`ugs?Y+JTVv}NAz
z#}jowJy|x<+`^Z)W8KV4i&t#1FZ8a}zx{mKI+vg+c^Cg?lrCHCT(1#zed5=zC9_Ra
zk0$f^tM-Mh4}ZVi<l4!7va^j=)m`K)PPytk|MUu-R)LO52d=ICE3If8E3tIN<?8_)
zEV+f%b{Q+}dEQ<zzGLZoU=EA->CB{=*+nniil*kQ=I)Hz^-V-|TkeM}e*NYAHcAZ*
z^-MnEzd-BOBoqXW9DU0ybppKdq;U;sn{ik7A&v@Vfh$Mf-up5w3N-tf0UCwqwYYqm
zf&0ZZ9>>@_atUU$K=bM>aSapK9BA)gyQP(I`cYZ*V`tDx;l>(Pk4>LMpH#6F32ewL
ztmeD>TnN-I6k_rbcT+l3Vx$2YSMpNH03B)YU@wDm<UQ$Pc9tH85cl<QH@`KRytzO1
z`tk*Z=kqi@->4ro+~sh7N3gp-XqsK4gTXV*amG&1E374jyWcU3PPs3u6Jqo4_4o2q
z|Ns3=%=E}9nE77t^meAx>-&%IR=symdug%fCLMm$yWA5QJi|cysSm3!u%CA4!UcuI
z`#Wu;f42QC{j}bG->s=nv~E|sZ>&jopI)-<tINjMUnCnHxF@8rTG^QBonZ=`D_2td
zMeEE*eV5zS)xVakUFuy`UBz8!4O*-i$u%J*mD8<|#SK(?{5pK@*Jgvj*>Zory`4XK
z`u4w-CQA3p9Ua`)@3Q*su_0!|5-yfKLJB88c}=TQ))csUQ9Jg|zsdFcC%!z$RQoD=
zmXN*9*%zUWTXym??F8*V%{xAogGb=P(YJvzdy}dP4jeylS^V6iG9exRnJZ-&;lqER
z?eD8sty;2YkBt$JPM&_wirdkpRTGZBZ4G^%$MHnnVbaw3^5O0=3ac(Ruiv{d?p@sr
zwU;mQrgVxXEC18{u<!TRt?e`9zRa6xt?*zMgXgr@OF|@A8#VOvuK&39t~M|wXR?od
zQjN%=x7qTKJ1?$|UB6jy^?Jt#&p4iFI82(VEHm9TTw&GX@Qb|`wxG2OMZyoZa~Bss
zUe&?%;!&CHqHU(mE{A<Vv-pjBK*_ATzk9LL1D(9}D_2g8=#j7J^t$s>9kSZPGt90k
zMw*jx89Qu=;||c$kk?B>GP)b|^3tm=Ov|{$&m!Qk-~(vX=-wRbHiw3btHBMH22hok
zprZYNaZzQfc*2)eAD-O-4g75gY?!Dcz1VAhkx)WmwO>vQX!2dbpozir8i&E0zG=`U
z)|~g{dcy9!1g)Tau#~}b+VovlWGfo4%)PCxt<8KtP6|9>Eg;7@Y0ZZtUDI~y9C%bV
z-Ek#&S~;PCf%`st!3QNR&;k&zC1Bq?01YVryIGtr&k}Lx9kbPT(ApR!Er&^>7Z12^
zyseYhpLFFVXpzf<`3#=Z>c8FD>A<9ur!Qc#9keo2KtjP`l4(P;_%_ZBJMM1lxFiqC
zM>b44HT?c-GBT%uRwxMdJmLU#kk^5h^=he4Wp!*g`qr_7DHpsD0kmE!VJbuS?X_I$
zb3sNr={igjef8mDg*$Xf$dW~ioNnyA8~6|uN)8A787Jx3f8DtqdBF=yj99|M-KQ6X
zgj+D)oz-~sZR_V}eqc*)avDsUI#+xtGiciyXr(d8B^*7V#o0=|d-F@m%f0>m`+H=q
z%Z~VE2?fW*=zzC@_3WFNxpT|Zl%Hzdw>PsawgC0dp{o~vmtVehE9&Pl^L>g|SIgdR
zy?#nEeU9M*LzF#S;o;$@O|Qo&7e7CDcIBOh?oTxbAAPf7+zA?9by%=~Y0XJ3jqU%<
zcmIC3JN4C-mCF=oWh|AGHqV<fRXhCD9LwUApP!x<J?=I4%FJB3CSs$Ll$6vYS7Y7j
zdk(a!@7huO{@&i8;NZjC*<(K};R26Uyl3^;w8xz9j4Wu7@8+)3)u689;cYK3y30>p
zwMr{;SINpV^X=osbRrZ^Pt%>;*T)yRyDaz9EFaMH{A14U+n?dXlHmOx`ghKn2LAfG
zzFt@U--q_69m;(YMai+zTPr`OMM746a-ErHd%H*G<%_A1sq^Q7?(0jcE=%t1I-2w|
z<Tz-Yoq>r%B&0!Q^@2P9?!Gz5E<a__BBh;QE_t`-x+EtrwzSW_wnp*&`8k%sd~!A!
z=hCC{JX9m+U3j7;*FT%3`-zsfO&55umc<FQe3+wod+&w($F~1|JWi7;xU-}1@VzxF
zSDu`sudOZpY2Uo;%uK`Q#=7Q9Ch7RSuq}CB_V;ijc#hH`0<_FuYNyVvwcU50pPj9~
ze16@pj_|Kvzs~$#RbAaa<>FeIFa2^er%4BSim7|7+jL+NXvU|(A%S&<9#2ljoy;3;
zywWL`m-&9W*k5<0$L(cDNObh<m3uaCHvW0%CjaS5{jcw;@-8j$d=|3oY0&!T;E4;+
zJW_(n=}#;6|M_$}?aRyfe^2AvzI+Ma|7+?CjqCdLKfPz#RBoz_-|i_<^XA^(=#u?9
zpwZDCeBhyT4g~>I#z{J-mFxcfe17_*`h1%O(`R|yExjIF^zo?p=|!&HDQ9LFf<}KQ
zd#sJ$AGdDLC$G&Oar(DF+oiVu(cAy0DA;}3Q?@%3#KE}$wAo$d^rr>>GmTuo_`iDS
z^Yi7rh~u*5F`w3cK4*QtCueQcR<Com-(xIGUQD=CeBRb5`52Go*DJxB^``G>P)C@d
z-Q-v<wsHEDDLgO!K04ZcR%$I`spzhRICB->zt<9%J!K0y2d=L{BcKkGL^n2MmzV16
z#P%<}+|t~CT5q?{m;QI{OYeWWJpZcXyAxaP6kIO?mrx9i8XP?T<1c7@v3XQ0qj%6t
zb*5Qv)T`5i^V6g9j&M~lLuR$TS#KOVc<I0;U2xK80j=~?IUQgB4z$h&l)tBe_JKe)
zR)C%U5436M_4&Jykx7RGL5!1hyqUdWCkq{jXPgAu%wWv~R?QIs+BB4z@KOxQ|Do+L
z>FIj=a!{oK8XWd!_1L7tt8*7Ly8`0ZvwCd$^Y!^Vh;D_1l?<NKmNqVphVmb*XYic1
z|KA<ZLNid22i<^M0-9a|@&AB!OkJP98=Te^8XA^@)+Vz}%L7e}fF`T<GpRt9F@o%3
z5rCbFGh98tblSJ>JjDhFrv<B5dxM6@wr6DJ747xY;+gMY^YQ1ZwQG6f57*`t>WEEV
zwMt7q`oLOlO@~RL9=Y#Y9T-7#-|B1Et_5X{>+h}h<?VT08kG2hrAx?n-I_H#AdMT<
zB4sWLDxB={Tk|rrg=JgrZ8cF*(V*B^-MBxC<Dw4P%L@Lo=)Dp8H)rbf>HR<K@)ZP1
z8UHQq`K8|QFIx4&ojW?byu3ld!H+$QQbonURTgaaO;BS>gR!kgQ>aGaJJ4FsCE^cm
zx4x{c5N|xd{o+yCT)8WUSHC=XK>30LsFrL1t;aObFyU<UVU^f>Dx|9jGz<BVRpO-9
z9?No<1EP#>>thm^fLf*pj2YcF*(_d~#IgspSp>A;lYxn2hpxk<r`t5XDuPx+>fE}1
z{rGlvTa#s3pv7&vjFWV>tE^;a<OjDy*Q~9M-}rNJ`-KqDva=l;4wIfLsf8*&K-v#+
zpqf!^Uv>T&S%DLg4M*QvUM^GwEim29pd7icy@5@^Af(~wTW4PjkjGkl8&tG&1Q+kU
z20C`+m%wF57J&{>%h!d;*SuN(z@u-V({eyF!Z$f4q@*r(jbyO_?H+R95CU4*{X^rx
zp>p|;J58DXyi)+Lr9KeH=(g!iudXfk4u<aA%yJ5|KsyGWXgW-qs;)3yc|td6CsE*I
zDNwk@FsVd7>=IwgyA!&kVPkRiiN_wFK^*}f7LQFvfs1&U^f)%`xXbFY3Y5W|R1O^a
zF2LHotSz|V=-Y=q(rZD>b3chDfLB1eEA%$>#hIF#diwhI9!c70qFM>gnFq`mC+XZ)
z@~UT2hR>-sc5?87+9+Jw4xqgo@5C74bE<NUdY4^6<xyiIi^rxm&|=e_poN9d)5hKi
zCp_F;Yq-?i4&*TQl048Nc9s~>_9ym^XRPrJN8cXo7t{qczW#tFm-$QIW%eG}mU~-8
zu7C56yR$kj34)^4meFm~oy|*@ae!vCoenNr4N5Y7Oe&F<hYBN0SR?Mp-Mw)cw6{`0
znsFKT=8KDRmVg9bez;r-3c74Yw@sVW9ye)#T-Fu1{5(i|9cUx<^W#?q1riFYS(<#r
zLB%9L=)@(4sakIZGGMDX%d8)H>I*n9G&*rlND+;i^Sc#v@YO;N;a-rdnRE}7BrZ7Y
z{FqDkz@u+Y-Np7G_rjv}bWp>^)j9_?z$NsAu!f0iw%F{E6a|G|Y3bG@NgG#`%&r5a
z7mf;z10K`bcZA5+fM((C-L`-aa9Yja85W`JzWcLSLX|<jlNKmi1w51wlq5>Y+}i|-
z*0N($<3J^*Bk1gd48euA^FT|nHT9>0i`69@29u^X9Sq(L$_;WldE2eeeF4=t99;~`
zk&c}#Z$J2e_L_x;sy==Cbl%<eE>IY-2zZDpob<Z-U}q_l4}X++kQJy&-s0Bq^3a8r
zuC_Gg1CPFe&fWqwGaj@uC`ZPv2wJ`#wBri4LG_+cf=YLPQz&Ttu-2Rs(4s63*p{+#
z&?#J|rlx;%`kD_ZgQ^<%-dJ;%8FD4g6Rp4n{vEM|T^Di#Uun-^=)TSEcD5HRS_E2L
z&TgXjF}~rV_WxuD&^9<mmP?=wgZGZFD!+aE_R@X(;vRkcvEuI~Q$Jl@-E~u?w=U8F
z#XD@H%n!8#9@Fx_wC?^0Is|Lq?{|}@$5na$`t@tciWMGymQO`MbH%BTj&w3hZGz5g
zr=Fi@`)toYmb3WUwmm7LQ*O_nZ3{Yi;23B^`Stq!_f#Uz+kT$|T1&?)wWaW}Tjb87
zrDtXuyHC@P*E7FYv3Sa~X{WkGwU;bhs2FJmnrx1#SfpHFwdvS)_SgfEHg01R$AlEo
zmYery*ZliDf4X$u4##sgpM5M}E}8t~R`&X-U0qx^K?e-9+5UR5c+vj%%TM0;^Ye4+
z!6w#CIX8`7zIZWVYxZ@u)1ZZvj&lBUj=tR((Ia1W?(jr!aAb4oJ4_0#_}p|qP<Yi9
zXZPjH{N`%SI$+W6cQp6jo=7phm<+e|b3SiQKR@l%DKE%m_Vbwe=NIectzW&`cyahG
zHt_aNMwUY=4wFQeW$e5XCOh-i*6iss#Y$G?<m8z6r=OkmbdHzZIcS47E*-L@bIwKW
zy&>0IUTTPeh8r3fm=c8(9#-E_dgfF;zv2<+XWqk~&spn7Mh6E^u8a!{n`ZOe=3?<V
zb6#WJ=P|QSCr3w1XRj}61ec8rjSid>QdqTQ?wK#!wk=Gq=7Xc<$0Nc|*K9uLbuVCl
z=?eG!{QOUIJ}=p^BLdv!Enau_Y2k-2X?mpvyr3k=z*NU=5c{H>g{z`owsjZiaIsrk
zGSfa*zgnyAGb17HmByt9&gXq+nVg(+Zp)nqR>=FHl!QKByB4<d=d;;MckjNP^Z0>^
zx8HYl|9Ls{-re1O-EwNpoxRoDBmb;ZH`1NHX9lcM83LMcZoJ<5Zu`Be)iM?Z2XdYo
z)c*RSxc6G|t`jwXe|<fv>8QH}w4*Bj=iIVena^hVoaWuhs1D8r0v$6zCyOxE9hWUX
zv3mVJt@Qb|+xC1sCY^R(`|fwI|1Y-l%ykw&^#0Dy;IOq(s=qFq?#ey<cKdxj&_dB*
zf7`2?YBQ&K#~pyI{bo_pIB@7Y2TN>yn0x<mx#}}E%l?&~RGofeYIt0xpKjcqh?2io
zUtL|DdUlp++Ws|_pP$X-g-lrQyz=`4xNFA%IS@hNk^QfW{YLMercRGl`{n-q@TL5p
zFOMxfEIV_W^t-5YpmK^sL4dXK;eT$a)_IqYZ(;hyd&H;D=X7e2cq+ta8$26K2g%Ay
zgQf%V|2~QDeAK1=<nsJ~UpQ2oN_VXeUh;K;N4d@JvajDdwwS7~%N2V0(yu;ukMokJ
z4IOqxpmum1$A-td#aCVFbU47mCugJa``cUNdPo7Ik)Zn~|J*@arS-P@mo66VsJxu*
z@@$?`(4=Sa+P<ga{&%0)7bWPs<;=tvj|7i*$m|YSqVe><pP5>n@ZYbzoz+|9_PJNK
zo+#|B_Br#WosTd6gfXao>vcF~Z=31$5!7;ju(6>p=5MKQeN(7eV9KX6|D?@SgqFX3
zeffUO={L2u6FZK&sD<vEI^k>Qn|o@TvR^;UE`9Q9>ej!U*M6K-GJf81<d~}4ej(*}
zeS6(Y*Q<BvoCj5XHLREZ)E}-{{j7>bV1w_1l`B2fd}bIdh_+f9KIg~uB^53IPcK{S
zV^t7lm3AQ2Iqpr3YN6IdiQf52pUxHkcAuXWFSPP+wo+r2bILhu_jSoNNh+^?7`rT!
zy;-j>%US*J<G)|CzIDk|*8G3_?Ye5-#2xKwVef6$|CjsqZ`tx+%Xx1LU!UqPb;-mJ
z6uOq26H=ZYIp)gI68`{nZj{a6FPE9E7G3VJ|8bBXv_K5Bs5^3B&CZ$+&GJ(w``bmn
z+w<8Ev~SgCmWij`hli8TOu4tZUhJZZ>+;8Ew%pq-bTZ5{NjG%*32A+`W$*8aTvYMq
zmrY$YOS|Zb^)KOt|2DV(zcx|FR_*+Y_5Sn2&%N{CRMN6i_2a&M=63=OU;Mf8@$cIg
zzH3f<%}py=CM0Y*-*elSi<$G)nl^4ceD$0qD1OWtC#|`2X9ri~1@153zIl0jC%sTB
z{PN{X$G&UIa_{4F@7=nkm7AOU>B(gOQ_lRhDodCC{U2juZhrdk{>W^%^}B?+kC`64
zq>}Nz?}$c75?9`}nu&jRyS$1QmJC)iTDr>qrPUVyl;@|FQac+r%sf6Ln)k=)NVRFZ
zZq)iD9XV<F=<T`959Lc+ylyY_oZQ!y*|fBM-RYt}Nq5y{{M*0uN4<P8Rju~6`M3Sm
zPi}i`l2MlvbT}Z}c*MS6hC@NXwQ+sj*VUhn2>Z{lSD#xlNikwWLZeLen~lsCCM&D{
z|Gu9uwDxx1?z4NYU%s2|*5qdu{$$JPUz4?KotHoUGQ%YHNp5=QoT7;*IMci5d};ib
z;(b3m>%#taxmgQdE_}WEmC)-IC0zx#x&J=@lAkW}>ch;&^JOYx`|LkAoR}}~sZz22
zTmKx{`n04kuR9JuEouDS^!<x^aJ!W2wsqbr4V_EY{MzwPaNA+kO3<M96a51opcCC1
z99FQ(RlhO3xgoJxa^<dfyI!~befE&o{7%BX_$?U|r%azdTX5Yh*7p6q%NK`Q-F@z}
zx7XX}`b&A)sh7S6o~vw?$~@h2v-20<mG9H<?n~6j^h}a6y1TIZse0Hqb>CgvR;e4N
z?tJ=RXuUYE%-JmeoR1H3-Y*EAJ!{WZb+HrKOl3z7{4u)w7JO!?L}-Ibc8C&}Lc)57
z<mAPX*-LF>Hl=jR)PA{mxNMt>>S0Oav>wk*b6(o+b(kz_TXM>e-?yM-Z`k8=hoAqt
zFZnaycaqq=`}Mtf>leIUtR<wJB>jK)f2r8?sqZeZob;SzvhniE1LwB=yJ+CcbX;wj
zUMW|wuto0rz74)JZtYKP*%rLLZ^nd(lJ(CmKxL~r%M3km>xyG#gI>|~t>Lp`VoR@v
zuKW7v>vpld*-1+-x2fy<>Gb%oX_tC?;fR;;(#8I7;%`6gX?VFyKi#Tui`AFEg`K7G
zzkHo-OXg1Ni+dUPJ?sDCb)1)vc)vIQzvbUb*V^MV-@Va4dLOxY&CwF}p#I<U`joe~
zwx(4DEayz#c;x#37^|pn-@}*O=bK};`v1?2>{VZCeV5G<G@2WBXQIcoFBhuj<a53X
zx&ONJ=&Pu@bDo_pnj0<Z>TCZuRmt*Rc6Pt?CA$CI!<^F#IH$|Ww*Qj<n(zB$&P(Tg
zu@yI3(>dU0`!zUdu-5&39Y4EFT-|KPu9wSZPpbW~d;f3i%@=GdmD<&3UCCIqwYvJz
zqaz}V)?K&SU|s7P754qeB~9zOWmjIC{=BI2>V=EZQ<+@}vF4Ijo!u9gyzaQW{%gO}
zOO9#N^7Fmc9Q9I(sybt_>wk3LubQkyd-~Ecqs{)<O`M@RX;bs89@TftqkVi<UJH@|
z4QN<1sYJfB2;ydH6uVFwQnjQntXF#a2{)nky!#u{&&z#|`F|-_`isOnDO>xpoTNV8
zLW|cM&U`+?F-7j&CEdC2F5efp;^MhI_`+HllfX;)41HTNSE{91U0PzlHo5P}zR+M{
z&;C58Rj*ghaTeBme(&6gseb=ou6w&n%=`a~z*!!%Rz2%HQy2X|`)~B^1=gW&D)-ud
zEdKWF()`O8f4@ko1vTOh=t3vh?B|@=Q`uSHYa!rpAgb})Ils@m2d}ukSzKDSBilst
z_u<X^rz|)B+TUVX`eMaoHT!cV^XFY>ePgAyv^x2vVa&{b<-h)4V>#hD$>d?-q?K2U
ze%;A=Idw((hu^!VPxCW=wPn6q*~(ncwa&|>w&pC-HrlqwUeUYO-sAk^xwe}s_fD?t
zySK^kbG=p7LKD>}sn;p@`+PIKWa_e^b8Xf&P3as82`r$!Aaar?A2ByNxUkF-T#>WO
z`i|+WB}b3({9S%H(s*jr{|6HnK0LK#+Vw!a^uHmmejYsUF2#HKh}Zv~vW%i-%1Piz
zna-5Y`>DE;`xU5f49X@fi_{$^iSC_oIT_TeWn>Z1XkhRRW1O&)71B`TaPe<Y(XKLF
zejGZ^6~MqaX$_M?F?8flpkp3`XV{k{zkYD@TEJle1C#Uq_SlBmMcga`AN(JDm#))X
z|L)#|aArQU_tU;zI<hQGCX@Bi+q*%6ukUl1<vQMTVPMo|_1LtAM|-Z*f_Tt$fRvQf
znQrH~zn>iBHTO>Teq^3{$3lYLfAx)vmsE2*?S<8*dz^d_8+<uVa-R9)*w~=xXz6)u
z>`RuKnwm0Za-RJV)u3`ZJMoqK0rke(-`_m5vsZ_Nhj;hI*?xbOT(rXYqqVurJgzTa
zzNpsutuWp=d(U6x+GHVnt+>#sKO8;ySOg@(8dS0)#Qc;5;u_a&cN5pr((-94y)M5`
z>GrG7v*mc!yCp`iTO2<3t?fjQ4Kg>c+&^4$?qdf7(_bc)$QmJm4IT$1_g;G0aqHOh
zC+hrl7x%t&?4Gmdg;%h%`;tl8`aCOz8E><AY|81@_}jS#)caquX3d$NINP7stDl}<
zZ|Bz(+Th=;mzSUaQthBtgXwk$g&Zc8$i!}mx2_2jKnt}Z@5Dt$YT6!s`)MxwdZnFG
zDNnARzP8NI*!D%}-z(h=Ob^8rPI8t1$*4WT8nm2Ua<A5%c15r5+m}~{h5Gq@H+!!r
zPzl<RThGG4vG~A)qi?GpN2hk%C{6AYo~d&A@QtMbTPq(6=eyNaec%qCqbxpmvqnha
z;*A_4Q4K1qFFd-#-)O@c<i38={Wo3RQ~GpIZcfuXAELl@+qfqs(6+YgPU+?6ORCrw
zM<`1c$}ze(sGOeoK(JAO<He)0^z62jCefy{%P!U|dR6yNernY|uX=Ek@|-V=7?@Nd
zSsk8<aXirmoutz%fBN+4&ujZ$3!aEd__<YnV)y<12CrZ5U})6fo{-{d`Rj|V2-9Id
z{<cL=O)jxDx^h1|VZQ%MpxgQ!4z*g19Sojf2T$%)WSYsz6L;s_mxQ#uDMkJVBJZ60
zrTyJ!rDhb9O60{Z^S!*C42#1RIj1Z=n^L$NG?>dOu5ePz!qVJDVJ}1X?aRME<W)8H
z&kdct?|{a8Kh5<Mw_o>3t11vtzvreP%s6R{&lHVj2S!jA|JUwjA6_wrJC~wkD!*Nv
z_N^yRQNRu~J$JN6EL!8hmj$hkOT9T11S%UJo#19@Xy^wW&Agl)bl_1M%jx40;Nu<-
z<bno%KnL3xi6nf{a@Obq^&u2R6I8U9G%mjRP%Pn#)}4=w!KZ(#G4-URE^?7%i2)6{
zc~1xdkJvdhsA#h|F6u1ffN#QZgbnCiWbxSKCj6+D<&%iV-JN?kZ8AE4YX`VLqo4yy
zU!5Xvd6qJC-v;do0FNIk9XM1TF0qoOaUp1{L)IZlP~*-Ev>#UU)|agcpb0__V{_0*
z8I!)lB+(xN7Y`VKMyz};Zd$+g`JB?3wR0D_bF_dK8y`8i_~k*+0Wbwgf>)=-l%6#D
zdE{xm{MC1t^I4cQ9VUsM*l=M5LbLHQc}?wg``y$0=BLI#e<8@E2wFZ=$&k5kKhv%q
zdlxNgx-a|1oM+<R-F<O$KhNu*kl^}F*x`7yp2H;3FB}*5Ie<n$CM0%-EUqiNJy|7u
zVwc5S-o*@_VG@hoX4i@)6z*RCXX5^ydU^X_UDBVJ;QDVegM$QU2dIGREeVdsZ{NyR
zu3l|?x%tf<xsC}g>jZW3`eRPKEI7gHvB^o!VOG2Zqu6%wV>5U2fCfPy##(ecTwwLs
z)Fh{P>-lPjSJ!y1UcD;ReY7T*-<*H`fz<cE|1Vi$v0wiB4AZx=KKyO^U$#gvDxQ4g
z+;D&c6tawMmm@i4Y+uhc+PlbVb+$$i15+8tgp`|t?o|&rA-0DoG=X+`@mR&mfktkX
zZ+`$C>E7T_#-tK?voi2j66l;MnV4Omw&4$j3HP&n<fYE&3Km2=h;M&=4s_np-Q3t$
zpba65KpUD$lKsyMGl9>`2W@VzDW2fZ0xI$wRx_zYt}6<PoWYWnoxOC+mMJXSK8}mm
zf*Ls;EFPPjM094o>TB4%Bep#Ex_tRF@ED!L0dB@gI{G0ijW>YSRODo2fHo~B%w^!d
zzm{85RtmKJ{P4;G&{&+q0dGdPO?$2^edhq$mLrh3KoDf~6VP_|m=lYyCf=Q;2pSBv
zjY{PA$v<Cp+_f>2o7a({@esGcq|l1ucM%Mrz-O2ly+riKoz~M&ZPnxEY~#sS0&V|N
zi7Y#AK51`qVYSL(xfy=1`yJ!=Khdibu`&=`s0iILY+GIy2?~;X;k$I1t+(&)@h+9*
zjQKQAU&U>`p3=cn9^FnHH}oAQrPlW-Uvzd`uO#@)q5RXf)cy%EtX57Ye2s@d1Ecrm
zSntwV(0%*#sZ$bri*8PRWdvGsF@4@&R-rX#c4)LZEMf83q$HZR+v+xCF5%F*w`E67
zefB06R)dZp5Y*Vi;2HMt?9Rp9piS}(9-@}q8+O>HTj{wd1Tm>ZPUPCYd+yt}Z>JtR
z<~GwTcb15_c-m=GvF-fwha(^RPf#tcxA`-BPHF6d;xO^c&FfYNDKdQnZPFAEK3~10
zI^gdUb^D2+1#MQ=)~R=P6c#<3nSLtW?z5!-WL>xQm)grN&3O5e`@_0wrsO-TyJiVE
z9Ef9_q*I;z+VlLcU%#GAi_V+4YnRpJkh3$5-9cNo|9_PKuc)f3`st;A{jJHrUp*?@
zmiD1#nisgzw*f68;kb4!YkSU3rS<!Mt<s6z6>`q%wa(?UH#euBe!YIbUj47j^Pj9*
zy>60W@}1xNe<JqAO`QrkGcZCUU`DHn*df=g-skOpuMrUyJ-NuWn@s?;QD)KQj#(``
zOJ96>(8$bw<~`q}gq=&hY{Bi3Rw0FxT2r>De!qCcU3}N;eIYB4pP6ZV_Vlu4%dT9u
zw7q`xt(ENxcI)lWT~4@yH82V!>@r|*<Omiv>6Dt2kokLVaXX*vsomDOxw&ayw8Xlf
z#)^xA`rRA~52iDCPK*DfxOaWt?F*ML8!!2KPK@u|;|WZWb1tyHlK~sY(GuJ6^3VqN
z4F}%Nw<uin!sGG-=j+KY9h*!d+OC6D1d1x0?8<sl{ARmapq1*4ix&+SwEg;3^*O5k
zQ5$rklf}hj(+`mp)dlyJuDm?dD{aoVBk%66(r4x@{kGq3Fg~wr1dTm6IE1i9OcuR*
z;`xpDt=!_LK&ytQ@Bg#(<|)Vhp(}1%Wn5Y+J@M5yKB&VK6oRJQxW2+)@!8qg?d(jF
zoNw;#4zK&NSpMX<x3^u(8|GV;u8OI6*!pQ9f33#i*P5U~Z-s`2v*1&U?<$|%WO+*N
zyYKbXmrdoeHy=TAIYVO|qx#9DT@(CW&N2NueBoC+%m-~;8$Q&6&O3oA+yh#BrM83#
z+NyL&Si#_VEkO7jBxoBLm?}X_ihMm-!GQ$2=ple{(wc>8b3oMzxMBK9OyT6I*%P?H
z9MGuDLMD|+=*$$@lqb3llct(0LSw6efytTGV^iC#0yf6a#g4xwJIb^QzIgj~YIt0w
zE1#@Y$PDRacR;64ZL0pB_xbR1&E?FWOU}+R{q$77KJtsW80d807^XKr<knSOyv4+E
zr{FN}rsU&%#mgs661pgVaNW9f)4uQfzIRi`#YIe86soqbSi5%W?7Ur`dOIF4MQ%#*
zbYuWu)bM;>^^%1P58he7W{r>Dz8^_DpG@-RD*Eq}f9c8<mFjPACcb<3&PRWt3=;>7
zOM{BGLgNC-gMt<X4;o~O&lo<l-|?{`rtIx4RsDTG7S+73zCZc0zkTd9-DtI=M|qfb
zOB(tnt>5)Z3pCn$cTL%mT_(%y|2*VRy|<_G(^37pz@&{ca&B!odBifq^IFH;2fQo-
z9H3I>fwK$qUx5qqd+WaMzCU-*SJCho#qam3*RP4&8wEO?7jz2!<o6#{>Kp&>-)qc$
z^=0+rACKoxunbP&6L(qYvdqItL&f=&L?_SFHlFY{rxQLZ=BMT;K4mhWqUkJI<kP9~
z(5X%3=kGOj=WpBn{?7N?;?K9r`}<bcrSE@#FT3Je`rJ3~-&fAt>enk}nsa4E;MDgT
ziTvg7?r_dq7`ZtuvRh2oX*Hj$)r}d3$wJ>2WGN{yDFw`Ea0yFvTcyZ!u()-3tH9-p
zi`{cyTv!;kHfpQGv*Z2pWuKmS?k;;fYj6Gkdr{kRGL_wWHtehYopxfPfANzOg1c*f
zZ=1+`Wm|6aY=gw6(wCQ1uPCa&JTud{?C-DA>c79Xnr2-&v8(iTny|W`$)SiT`tkd2
zbct%`oSS3$?Z?OD-4!2`P9z@MZI*k>r25~VN{;%yRbNlt+M1ot(Gj*bYHGH1{ym%O
zA0HOZwXeUoulBbX%i}XMjSp8`G|Z^}`6+dG(bKN4Z*E=|(~pz+<!KcD#;W|?oV~Tb
z&AwRY-La6iC`ibd|5~y*dS}tnURmpFzrMehe-$=`^Yi|KhfWEXwq}PX$CbXi!dZK?
z{>QDom7mp=H$5tyQ?8h{#ru$|r|dD6md@u}s=mHzWQ{Wu6%=TEq@pk}bk1wF)xin}
zyw{h%zgPC{O=R`=cXLg1Z<$1FEPWkT{oz5Q?<|v(Qf4_B)AeFEy}iA?JzZ~$S>Bxt
z|M_;j^ClhZmA-v<cX{speYM*%FE0zozr8KD?D4VQ36o8#zGNu7cNU&Hbt>oUtE-Mr
zCQf#4GJC6WxSfA{`uTaRiH;q@(rmm^B5`Mq_sMSNl{UNa?Ck8*Tkr0z-mVz;;l_lN
zx>r|LUa<cr$n@2aPsT!^g?W*B6xZ3Q6QsW>@(E7RkKf0$XrkRG+vFG){-5q~T8C2p
z|NDFJo}zPGOQmAO%^e#G9y+~WcSrPL#g7k(x3^|bKRd%vxur3-qS7@zutV}IccEug
z`rlt)9d#y4hpi4<d*;?I-(6h|93tY3oogON=||2sYD_yji<Mizx?_!dzZ`2}%ktxg
zyH$>FmVWc)<>iC3TNgMnOuXQmWX_u3s~)p?HJ^UOm&*BewLFGx6$f@7E!VFw18w{)
zeSM90yFgOQelgvsl)Y77KV_ADcyLhR+J~%4MV)r@HDzyaJroOn^)Rtp?Q8wNKR2(f
zjTU!VyxrF*JSTB8!$SLYbFE50J##d8RyA$qm-FpiMhowUt`3XbTlLk6zd~ev++Hb`
z)NOxuf=X-CTRV%>1&*lu&Drqr@$u=8-<XLeO>6O<Wc8=-K>n*MD;*t-?Plv<TN9bA
zAGfEVxI~muP(z97)IHrrM<=a(DXj3sd1d70v>i%p8ZApJ9Dmif@OZ8}mi^_)$;koB
zi=Ur+_{#o{aM}BNdkaoGXZ^dgH{ssB_sSPy5(?M*&Nfrj5f_b+Q#*24RQK<%uctY5
z-aWp!@JHUM4^OZ2?@6h6x=8h8jHgPwV4Q|c@Wn~*Be%%S*FKeUpn*}c(Y1O;g8M#Y
z#a-p^^P;!qa6aPVm%6vYw))$JJu#X`bU3H0l-A5$+%&6HO=gV}lTyGOmM15*&XrES
zswr6TUU;5BSN;8s$;bEWBpsh~UGa*CT-Y`z`HJO>4s}*NNm6|F$Vu}ad+l-Vd9qwe
z`tg|;7C2VOh%4Xx<zp27=|tN3d9qH0-qUnAce5_{pP%>P)OVe{<kXovILZQL-rwK<
z_@r`rPcILL-nk`8Dm@IRLm!=)RNxu({BS#eqQ`st>pynsGbshwu>AYGzWCz}J#W_s
z_Noqj=g!VHZ@#{w?(eU}oc)ucUHN>s9qOL5ZO@0zt?LBB@9(cS@9S1DdD{A3Wx24~
zpXjHTm-{cwE(;dZ@_gnc-^|W$X5-!R`o_eaWp8gOB+RH@m;Q0%|7^7$cRyK0_fK~|
zb*{14tP(Tn%12(l`2BUd&vSb=Un~dZXT=2ti67TY)$yIkAg4I#<W0lldd~VSteS6b
zoDRLS_^G17`sezuudR)4kA4#BdU|d2_CweEWUbxu!(SO!+6TVx>wjtX<h9Mon7y|1
z3=YjwIk(wU;Z^VH?`LlBw#}P=|9`NLUEQA-v1#k-&L7_KZ-D^B5%(wm{{H^=g@eK;
ze`qNwFdg-Dn78IpjCthW>6`+)4hlD$cV6ChGwA#~2OGnA+O3=|)B5D?<%F(Sx-~lc
zWI8W0j$4s<xQ%t=!HxVX8z*1sN$2|LkkMtMP*k^v-zKU>^yEY(#l5w^zdfCFQ`<UM
z=+4bjk0dL_L(c7dtpRa%=X?8SrmU-2C*aY-_ORi3{|E7Tn`+L-6#R;)pUrvC)XZ?h
zv^DHMi`N8BR`UgA;ykw<VvsD6Gv~n%wrjGAUPAVV=H0hODG&cEF`irT=!`0hz(ebQ
zYxvm1{N~wM7O$JifBtmA%}uF}4ihgwu758OcreeDE79fEhRMBFB9l&8K5KBY6SMyJ
z?cH7JR~Oj7d!#(CV6=}q;M`ls+gtzlLG_<`&r^=RS6(+mTB-RE;~Z`=ofBKW|ElAi
z`tRq&lyw!20-XQKzdbnS=l$#S_cO;ozn-7abn{+(iCoRIg2=vtgx<Xcw``Ow=1GTl
zL<;G7zM9~^t>opU4VeszJj^Z%&leSnwEvgeu@_W^h14=#t@|rq{zH4mn?HeqjDkOE
znV!T>eBi?uw(d!)jhT!^=Ytd9E*<%OIB{u3$R<vfd7nS^Zd09dvVPBr#jO6b)Ek7k
zW?Pr9^POpQ)U8iOlF#>PWK6&XyW0{M>weD3U)Q4iuwh5f`+zgwb*}H&f0$)qSGd8f
z$71uD?>{_LC|a@kQK|N!Gr!LrU#e8fv3`@;8dFxb!ry!BV_h9sR>?7z%?dvCe|5~)
zH&a}d0!&y0EdQxT6-l1$HlDrV<F7p)e|7Zsi|<XVzNmC;6Q_}Q#Kmv_EaQ!8w;Ar4
z8~^#NsQ#??`@a0DI}5d1aMo)3?XB9JFXv5>+dKblv0Yl6z5Mj9E1mf+9!BEt<HH37
z8do_xbiNNw*G=i<=x6{V2Ts8W>Z@DCf`bJcV^}`SJ3HV0{=X-FM`Mzwo~kv}o;vl4
zjf;XU)2WkQ{d?WS7zG8uNW+n7-sGhPiJW@tmZ>m-+8YW?N)zlDJJ)=<?jQy=x`AVg
z0%PYIp_mX~PZk#kFjA;x5{i7ezEKBajsT;eh9i?ur0R|pvnGMv)4<W;@QX!d)1`Rk
zNClY50Zl9_o4g7FO;w@x3p9S=^hjB{pKTMwSO*rD1uUE%DN`RT%JPCbM}g_3@Prdy
z^}H#KaFaQOCY;bZ=z4Vu)Hx0;m(&#|PW>l!f(dT25U4TG)V)fx6B0rV983Hil(hev
zPGE(btm@&Qw3<acG*}2690H7j9`hYa%@?j&bH@Ia7R=e8W|$|_|KC49KcDLLZQ(Px
mb|nQSL8kp*u0H+G{3+0M+n*_yjxaDVFnGH9xvX<aXaWH7!=b(a


From 2e63a877f35049c48fc142e3bd5b20bfc6558a02 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 15:40:42 -0700
Subject: [PATCH 250/255] fixed xzstd

--format=xz was missing a break, making the execution continue into lz4 error message
---
 programs/Makefile  | 6 ++----
 programs/fileio.c  | 4 ++++
 programs/zstdcli.c | 4 ++--
 3 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 2ab29e1ef..0c50f50bd 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -140,15 +140,13 @@ $(ZSTDDECOMP_O): CFLAGS += $(ALIGN_LOOP)
 
 zstd : CPPFLAGS += $(ZLIBCPP) $(THREAD_CPP)
 zstd : LDFLAGS += $(ZLIBLD) $(THREAD_LD)
-zstd : LZMA_MSG := $(NO_LZMA_MSG)
+zstd zstd-nogz zstd4 : LZMA_MSG := ""
+zstd zstd-nogz xzstd : LZ4_MSG := ""
 zstd-nogz : ZLIB_MSG := $(NO_ZLIB_MSG)
-zstd-nogz : LZMA_MSG := $(NO_LZMA_MSG)
 xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
-xzstd : LZ4_MSG := $(NO_LZ4_MSG)
 zstd4 : CPPFLAGS += $(ZLIBCPP) $(LZ4CPP)
 zstd4 : LDFLAGS += $(ZLIBLD) $(LZ4LD)
-zstd4 : LZMA_MSG := $(NO_LZMA_MSG)
 zstd zstd-nogz xzstd zstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
 zstd zstd-nogz xzstd zstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
diff --git a/programs/fileio.c b/programs/fileio.c
index 944b11ab4..e188936b2 100644
--- a/programs/fileio.c
+++ b/programs/fileio.c
@@ -617,6 +617,7 @@ static int FIO_compressFilename_internal(cRess_t ress,
     switch (g_compressionType) {
         case FIO_zstdCompression:
             break;
+
         case FIO_gzipCompression:
 #ifdef ZSTD_GZCOMPRESS
             compressedfilesize = FIO_compressGzFrame(&ress, srcFileName, fileSize, compressionLevel, &readsize);
@@ -625,6 +626,7 @@ static int FIO_compressFilename_internal(cRess_t ress,
             EXM_THROW(20, "zstd: %s: file cannot be compressed as gzip (zstd compiled without ZSTD_GZCOMPRESS) -- ignored \n", srcFileName);
 #endif
             goto finish;
+
         case FIO_xzCompression:
         case FIO_lzmaCompression:
 #ifdef ZSTD_LZMACOMPRESS
@@ -633,6 +635,8 @@ static int FIO_compressFilename_internal(cRess_t ress,
             (void)compressionLevel;
             EXM_THROW(20, "zstd: %s: file cannot be compressed as xz/lzma (zstd compiled without ZSTD_LZMACOMPRESS) -- ignored \n", srcFileName);
 #endif
+            goto finish;
+
         case FIO_lz4Compression:
 #ifdef ZSTD_LZ4COMPRESS
             compressedfilesize = FIO_compressLz4Frame(&ress, srcFileName, fileSize, compressionLevel, &readsize);
diff --git a/programs/zstdcli.c b/programs/zstdcli.c
index f6ce2e1a6..32fef9993 100644
--- a/programs/zstdcli.c
+++ b/programs/zstdcli.c
@@ -514,11 +514,11 @@ int main(int argCount, const char* argv[])
                         /* Quiet mode */
                     case 'q': g_displayLevel--; argument++; break;
 
-                        /* keep source file (default); for gzip/xz compatibility */
+                        /* keep source file (default) */
                     case 'k': FIO_setRemoveSrcFile(0); argument++; break;
 
                         /* Checksum */
-                    case 'C': argument++; FIO_setChecksumFlag(2); break;
+                    case 'C': FIO_setChecksumFlag(2); argument++; break;
 
                         /* test compressed file */
                     case 't': operation=zom_test; argument++; break;

From 3791d2105d14fa7bfc5da120325ab5ca045c4130 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 16:38:37 -0700
Subject: [PATCH 251/255] added xzstd4 target

support for all formats, xz/lzma/lz4 included
---
 programs/Makefile | 12 +++++++-----
 1 file changed, 7 insertions(+), 5 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 0c50f50bd..409b976ca 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -140,15 +140,17 @@ $(ZSTDDECOMP_O): CFLAGS += $(ALIGN_LOOP)
 
 zstd : CPPFLAGS += $(ZLIBCPP) $(THREAD_CPP)
 zstd : LDFLAGS += $(ZLIBLD) $(THREAD_LD)
-zstd zstd-nogz zstd4 : LZMA_MSG := ""
-zstd zstd-nogz xzstd : LZ4_MSG := ""
-zstd-nogz : ZLIB_MSG := $(NO_ZLIB_MSG)
+zstd zstd-nogz zstd4 : LZMA_MSG := - xz/lzma support is disabled
+zstd zstd-nogz xzstd : LZ4_MSG := - lz4 support is disabled
+zstd-nogz : ZLIB_MSG := - gzip support is disabled
 xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
 xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
 zstd4 : CPPFLAGS += $(ZLIBCPP) $(LZ4CPP)
 zstd4 : LDFLAGS += $(ZLIBLD) $(LZ4LD)
-zstd zstd-nogz xzstd zstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
-zstd zstd-nogz xzstd zstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
+xzstd4 : CPPFLAGS += $(ZLIBCPP) $(LZMACPP) $(LZ4CPP)
+xzstd4 : LDFLAGS += $(ZLIBLD) $(LZMALD) $(LZ4LD)
+zstd zstd-nogz xzstd zstd4 xzstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
+zstd zstd-nogz xzstd zstd4 xzstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
 	@echo "$(ZLIB_MSG)"
 	@echo "$(LZMA_MSG)"

From f47284fec0563a5e5c1eab148475d44f686e7f3c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 16:55:57 -0700
Subject: [PATCH 252/255] reorganized Makefile for multiple targets

---
 programs/Makefile | 28 ++++++++++++++--------------
 1 file changed, 14 insertions(+), 14 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 409b976ca..204352b4c 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -138,17 +138,17 @@ all: zstd
 
 $(ZSTDDECOMP_O): CFLAGS += $(ALIGN_LOOP)
 
-zstd : CPPFLAGS += $(ZLIBCPP) $(THREAD_CPP)
-zstd : LDFLAGS += $(ZLIBLD) $(THREAD_LD)
+zstd-nogz zstd xzstd zstd4 xzstd4 : CPPFLAGS += $(THREAD_CPP)
+zstd-nogz zstd xzstd zstd4 xzstd4 : LDFLAGS += $(THREAD_LD)
+zstd xzstd zstd4 xzstd4 : CPPFLAGS += $(ZLIBCPP)
+zstd xzstd zstd4 xzstd4 : LDFLAGS += $(ZLIBLD)
+xzstd xzstd4 : CPPFLAGS += $(LZMACPP)
+xzstd xzstd4 : LDFLAGS += $(LZMALD)
+zstd4 xzstd4 : CPPFLAGS += $(LZ4CPP)
+zstd4 xzstd4 : LDFLAGS += $(LZ4LD)
+zstd-nogz : ZLIB_MSG := - gzip support is disabled
 zstd zstd-nogz zstd4 : LZMA_MSG := - xz/lzma support is disabled
 zstd zstd-nogz xzstd : LZ4_MSG := - lz4 support is disabled
-zstd-nogz : ZLIB_MSG := - gzip support is disabled
-xzstd : CPPFLAGS += $(ZLIBCPP) $(LZMACPP)
-xzstd : LDFLAGS += $(ZLIBLD) $(LZMALD)
-zstd4 : CPPFLAGS += $(ZLIBCPP) $(LZ4CPP)
-zstd4 : LDFLAGS += $(ZLIBLD) $(LZ4LD)
-xzstd4 : CPPFLAGS += $(ZLIBCPP) $(LZMACPP) $(LZ4CPP)
-xzstd4 : LDFLAGS += $(ZLIBLD) $(LZMALD) $(LZ4LD)
 zstd zstd-nogz xzstd zstd4 xzstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
 zstd zstd-nogz xzstd zstd4 xzstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
@@ -176,7 +176,7 @@ zstd-nolegacy : clean_decomp_o
 
 zstd-nomt : THREAD_CPP :=
 zstd-nomt : THREAD_LD :=
-zstd-nomt : THREAD_MSG := $(NO_THREAD_MSG)
+zstd-nomt : THREAD_MSG := - multi-threading disabled
 zstd-nomt : zstd
 
 zstd-pgo : MOREFLAGS = -fprofile-generate
@@ -191,18 +191,18 @@ zstd-pgo : clean zstd
 	$(RM) $(ZSTDDECOMP_O)
 	$(MAKE) zstd MOREFLAGS=-fprofile-use
 
-zstd-frugal: $(ZSTD_FILES) zstdcli.c fileio.c
+# minimal target, with only zstd compression and decompression. no bench. no legacy.
+zstd-small: CFLAGS = "-Os -s"
+zstd-frugal zstd-small: $(ZSTD_FILES) zstdcli.c fileio.c
 	$(CC) $(FLAGS) -DZSTD_NOBENCH -DZSTD_NODICT $^ -o zstd$(EXT)
 
-zstd-small:
-	CFLAGS="-Os -s" $(MAKE) zstd-frugal
-
 zstd-decompress: $(ZSTDCOMMON_FILES) $(ZSTDDECOMP_FILES) zstdcli.c fileio.c
 	$(CC) $(FLAGS) -DZSTD_NOBENCH -DZSTD_NODICT -DZSTD_NOCOMPRESS $^ -o $@$(EXT)
 
 zstd-compress: $(ZSTDCOMMON_FILES) $(ZSTDCOMP_FILES) zstdcli.c fileio.c
 	$(CC) $(FLAGS) -DZSTD_NOBENCH -DZSTD_NODICT -DZSTD_NODECOMPRESS $^ -o $@$(EXT)
 
+# zstd is now built with Multi-threading by default
 zstdmt: zstd
 
 generate_res:

From 710497d8ea99f9d6b399e805bd7d86a55083e57c Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Tue, 2 May 2017 17:18:24 -0700
Subject: [PATCH 253/255] updated programs/README.md, to introduce compilation
 variables

make it possible to enable/disable features individually
---
 programs/Makefile  | 22 ++++++++++----------
 programs/README.md | 50 +++++++++++++++++++++++++++++++++++-----------
 2 files changed, 50 insertions(+), 22 deletions(-)

diff --git a/programs/Makefile b/programs/Makefile
index 204352b4c..491b3ed3a 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -138,19 +138,16 @@ all: zstd
 
 $(ZSTDDECOMP_O): CFLAGS += $(ALIGN_LOOP)
 
-zstd-nogz zstd xzstd zstd4 xzstd4 : CPPFLAGS += $(THREAD_CPP)
-zstd-nogz zstd xzstd zstd4 xzstd4 : LDFLAGS += $(THREAD_LD)
-zstd xzstd zstd4 xzstd4 : CPPFLAGS += $(ZLIBCPP)
-zstd xzstd zstd4 xzstd4 : LDFLAGS += $(ZLIBLD)
+zstd xzstd zstd4 xzstd4 : CPPFLAGS += $(THREAD_CPP) $(ZLIBCPP)
+zstd xzstd zstd4 xzstd4 : LDFLAGS += $(THREAD_LD) $(ZLIBLD)
 xzstd xzstd4 : CPPFLAGS += $(LZMACPP)
 xzstd xzstd4 : LDFLAGS += $(LZMALD)
 zstd4 xzstd4 : CPPFLAGS += $(LZ4CPP)
 zstd4 xzstd4 : LDFLAGS += $(LZ4LD)
-zstd-nogz : ZLIB_MSG := - gzip support is disabled
-zstd zstd-nogz zstd4 : LZMA_MSG := - xz/lzma support is disabled
-zstd zstd-nogz xzstd : LZ4_MSG := - lz4 support is disabled
-zstd zstd-nogz xzstd zstd4 xzstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
-zstd zstd-nogz xzstd zstd4 xzstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
+zstd zstd4 : LZMA_MSG := - xz/lzma support is disabled
+zstd xzstd : LZ4_MSG := - lz4 support is disabled
+zstd xzstd zstd4 xzstd4 : CPPFLAGS += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
+zstd xzstd zstd4 xzstd4 : $(ZSTDLIB_FILES) zstdcli.o fileio.o bench.o datagen.o dibio.o
 	@echo "$(THREAD_MSG)"
 	@echo "$(ZLIB_MSG)"
 	@echo "$(LZMA_MSG)"
@@ -170,7 +167,6 @@ ifneq (,$(filter Windows%,$(OS)))
 endif
 	$(CC) -m32 $(FLAGS) $^ $(RES32_FILE) -o $@$(EXT)
 
-
 zstd-nolegacy : clean_decomp_o
 	$(MAKE) zstd ZSTD_LEGACY_SUPPORT=0
 
@@ -179,6 +175,12 @@ zstd-nomt : THREAD_LD :=
 zstd-nomt : THREAD_MSG := - multi-threading disabled
 zstd-nomt : zstd
 
+zstd-nogz : ZLIBCPP :=
+zstd-nogz : ZLIBLD :=
+zstd-nogz : ZLIB_MSG := - gzip support is disabled
+zstd-nogz : zstd
+
+
 zstd-pgo : MOREFLAGS = -fprofile-generate
 zstd-pgo : clean zstd
 	./zstd -b19i1 $(PROFILE_WITH)
diff --git a/programs/README.md b/programs/README.md
index 203fd7b49..d7922a096 100644
--- a/programs/README.md
+++ b/programs/README.md
@@ -11,8 +11,29 @@ There are however other Makefile targets that create different variations of CLI
 - `zstd-decompress` : decompressor-only version of CLI; without dictionary builder, benchmark, and support for decompression of legacy zstd versions
 
 
+#### Compilation variables
+`zstd` tries to detect and use the following features automatically :
+
+- __HAVE_THREAD__ : multithreading is automatically enabled when `pthread` is detected.
+  It's possible to disable multithread support, by either compiling `zstd-nomt` target or using HAVE_THREAD=0 variable.
+  Example : make zstd HAVE_THREAD=0
+  It's also possible to force compilation with multithread support, using HAVE_THREAD=1.
+  In which case, linking stage will fail if `pthread` library cannot be found.
+  This might be useful to prevent silent feature disabling.
+
+- __HAVE_ZLIB__ : `zstd` can compress and decompress files in `.gz` format.
+  This is done through command `--format=gzip`.
+  Alternatively, symlinks named `gzip` or `gunzip` will mimic intended behavior.
+  .gz support is automatically enabled when `zlib` library is detected at build time.
+  It's possible to disable .gz support, by either compiling `zstd-nogz` target or using HAVE_ZLIB=0 variable.
+  Example : make zstd HAVE_ZLIB=0
+  It's also possible to force compilation with zlib support, using HAVE_ZLIB=1.
+  In which case, linking stage will fail if `zlib` library cannot be found.
+  This might be useful to prevent silent feature disabling.
+
+
 #### Aggregation of parameters
-CLI supports aggregation of parameters i.e. `-b1`, `-e18`, and `-i1` can be joined into `-b1e18i1`. 
+CLI supports aggregation of parameters i.e. `-b1`, `-e18`, and `-i1` can be joined into `-b1e18i1`.
 
 
 #### Dictionary builder in Command Line Interface
@@ -23,7 +44,7 @@ which can be loaded before compression and decompression.
 
 Using a dictionary, the compression ratio achievable on small data improves dramatically.
 These compression gains are achieved while simultaneously providing faster compression and decompression speeds.
-Dictionary work if there is some correlation in a family of small data (there is no universal dictionary). 
+Dictionary work if there is some correlation in a family of small data (there is no universal dictionary).
 Hence, deploying one dictionary per type of data will provide the greater benefits.
 Dictionary gains are mostly effective in the first few KB. Then, the compression algorithm
 will rely more and more on previously decoded content to compress the rest of the file.
@@ -35,7 +56,6 @@ Usage of the dictionary builder and created dictionaries with CLI:
 3. Decompress with the dictionary: `zstd --decompress FILE.zst -D dictionaryName`
 
 
-
 #### Benchmark in Command Line Interface
 CLI includes in-memory compression benchmark module for zstd.
 The benchmark is conducted using given filenames. The files are read into memory and joined together.
@@ -48,7 +68,6 @@ One can select compression levels starting from `-b` and ending with `-e`.
 The `-i` parameter selects minimal time used for each of tested levels.
 
 
-
 #### Usage of Command Line Interface
 The full list of options can be obtained with `-h` or `-H` parameter:
 ```
@@ -62,33 +81,40 @@ Arguments :
  -d     : decompression
  -D file: use `file` as Dictionary
  -o file: result stored into `file` (only if 1 input file)
- -f     : overwrite output without prompting
+ -f     : overwrite output without prompting and (de)compress links
 --rm    : remove source file(s) after successful de/compression
  -k     : preserve source file(s) (default)
  -h/-H  : display help/long help and exit
 
 Advanced arguments :
  -V     : display Version number and exit
- -v     : verbose mode; specify multiple times to increase log level (default:2)
+ -v     : verbose mode; specify multiple times to increase verbosity
  -q     : suppress warnings; specify twice to suppress errors too
  -c     : force write to standard output, even if it is the console
- -r     : operate recursively on directories
 --ultra : enable levels beyond 19, up to 22 (requires more memory)
+ -T#    : use # threads for compression (default:1)
+ -B#    : select size of each job (default:0==automatic)
 --no-dictID : don't write dictID into header (dictionary compression)
 --[no-]check : integrity check (default:enabled)
+ -r     : operate recursively on directories
+--format=gzip : compress files to the .gz format
 --test  : test compressed file integrity
---[no-]sparse : sparse mode (default:enabled on file, disabled on stdout)
+--[no-]sparse : sparse mode (default:disabled)
+ -M#    : Set a memory usage limit for decompression
+--      : All arguments after "--" are treated as files
 
 Dictionary builder :
 --train ## : create a dictionary from a training set of files
+--train-cover[=k=#,d=#,steps=#] : use the cover algorithm with optional args
+--train-legacy[=s=#] : use the legacy algorithm with selectivity (default: 9)
  -o file : `file` is dictionary name (default: dictionary)
---maxdict ## : limit dictionary to specified size (default : 112640)
- -s#    : dictionary selectivity level (default: 9)
---dictID ## : force dictionary ID to specified value (default: random)
+--maxdict=# : limit dictionary to specified size (default : 112640)
+--dictID=# : force dictionary ID to specified value (default: random)
 
 Benchmark arguments :
  -b#    : benchmark file(s), using # compression level (default : 1)
  -e#    : test all compression levels from -bX to # (default: 1)
  -i#    : minimum evaluation time in seconds (default : 3s)
  -B#    : cut file into independent blocks of size # (default: no block)
- ```
\ No newline at end of file
+--priority=rt : set process priority to real-time
+```

From cf4f9403fa9aac8f20216095f68b67b12bbdeeca Mon Sep 17 00:00:00 2001
From: Nick Terrell <terrelln@fb.com>
Date: Wed, 3 May 2017 11:07:39 -0700
Subject: [PATCH 254/255] [kernel] Update README with SquashFS patch

Take patch from PR #682 by @iburinoc and update benchmarks.
---
 contrib/linux-kernel/README.md             | 43 ++++++++++++++++++++--
 contrib/linux-kernel/squashfs-benchmark.sh | 39 ++++++++++++++++++++
 2 files changed, 79 insertions(+), 3 deletions(-)
 create mode 100755 contrib/linux-kernel/squashfs-benchmark.sh

diff --git a/contrib/linux-kernel/README.md b/contrib/linux-kernel/README.md
index a62838517..16bc2d48f 100644
--- a/contrib/linux-kernel/README.md
+++ b/contrib/linux-kernel/README.md
@@ -1,6 +1,6 @@
 # Linux Kernel Patch
 
-There are two pieces, the `zstd_compress` and `zstd_decompress` kernel modules, and the BtrFS patch.
+There are three pieces, the `zstd_compress` and `zstd_decompress` kernel modules, the BtrFS patch, and the SquashFS patch.
 The patches are based off of the linux kernel master branch (version 4.10).
 
 ## Zstd Kernel modules
@@ -22,14 +22,15 @@ The patches are based off of the linux kernel master branch (version 4.10).
 
 * The patch is located in `btrfs.diff`.
 * Additionally `fs/btrfs/zstd.c` is provided as a source for convenience.
-* The patch seems to be working, it doesn't crash the kernel, and compresses at speeds and ratios athat are expected.
-  It can still use some more testing for fringe features, like printing options.
+* The patch seems to be working, it doesn't crash the kernel, and compresses at speeds and ratios that are expected.
+  It could still use some more testing for fringe features, like printing options.
 
 ### Benchmarks
 
 Benchmarks run on a Ubuntu 14.04 with 2 cores and 4 GiB of RAM.
 The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor,
 16 GB of ram, and a SSD.
+The kernel running was built from the master branch with the patch (version 4.10).
 
 The compression benchmark is copying 10 copies of the
 unzipped [silesia corpus](http://mattmahoney.net/dc/silesia.html) into a BtrFS
@@ -50,3 +51,39 @@ See `btrfs-benchmark.sh` for details.
 | zstd 9    | 2.92              | 43 MB/s           | 406 MB/s            |
 | zstd 12   | 2.93              | 21 MB/s           | 408 MB/s            |
 | zstd 15   | 3.01              | 11 MB/s           | 354 MB/s            |
+
+
+## SquashFS
+
+* The patch is located in `squashfs.diff`
+* Additionally `fs/squashfs/zstd_wrapper.c` is provided as a source for convenience.
+* The patch has been tested on a 4.10 kernel.
+
+### Benchmarks
+
+Benchmarks run on a Ubuntu 14.04 with 2 cores and 4 GiB of RAM.
+The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor,
+16 GB of ram, and a SSD.
+The kernel running was built from the master branch with the patch (version 4.10).
+
+The compression benchmark is the file tree from the SquashFS archive found in the
+Ubuntu 16.10 desktop image (ubuntu-16.10-desktop-amd64.iso).
+The compression benchmark uses mksquashfs with the default block size (128 KB)
+and various compression algorithms/compression levels.
+`xz` and `zstd` are also benchmarked with 256 KB blocks.
+The decompression benchmark is timing how long it takes to `tar` the file tree
+into `/dev/null`.
+See `squashfs-benchmark.sh` for details.
+
+| Algorithm      | Compression ratio | Compression speed | Decompression speed |
+|----------------|-------------------|-------------------|---------------------|
+| gzip           | 2.92              |   15 MB/s         | 128 MB/s            |
+| lzo            | 2.64              |  9.5 MB/s         | 217 MB/s            |
+| lz4            | 2.12              |   94 MB/s         | 218 MB/s            |
+| xz             | 3.43              |  5.5 MB/s         |  35 MB/s            |
+| xz 256 KB      | 3.53              |  5.4 MB/s         |  40 MB/s            |
+| zstd 1         | 2.71              |   96 MB/s         | 210 MB/s            |
+| zstd 5         | 2.93              |   69 MB/s         | 198 MB/s            |
+| zstd 10        | 3.01              |   41 MB/s         | 225 MB/s            |
+| zstd 15        | 3.13              | 11.4 MB/s         | 224 MB/s            |
+| zstd 16 256 KB | 3.24              |  8.1 MB/s         | 210 MB/s            |
diff --git a/contrib/linux-kernel/squashfs-benchmark.sh b/contrib/linux-kernel/squashfs-benchmark.sh
new file mode 100755
index 000000000..02dfd7325
--- /dev/null
+++ b/contrib/linux-kernel/squashfs-benchmark.sh
@@ -0,0 +1,39 @@
+# !/bin/sh
+set -e
+
+# Benchmarks run on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
+# The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor and
+# 16 GB of RAM and an SSD.
+
+# $BENCHMARK_DIR is generated with the following commands, from the Ubuntu image
+# ubuntu-16.10-desktop-amd64.iso.
+# > mkdir mnt
+# > sudo mount -o loop ubuntu-16.10-desktop-amd64.iso mnt
+# > cp mnt/casper/filesystem.squashfs .
+# > sudo unsquashfs filesystem.squashfs
+
+# $HOME is on a ext4 filesystem
+BENCHMARK_DIR="$HOME/squashfs-root/"
+BENCHMARK_FS="$HOME/filesystem.squashfs"
+
+# Normalize the environment
+sudo rm -f $BENCHMARK_FS 2> /dev/null > /dev/null || true
+sudo umount /mnt/squashfs 2> /dev/null > /dev/null || true
+
+# Run the benchmark
+echo "Compression"
+echo "sudo mksquashfs $BENCHMARK_DIR $BENCHMARK_FS $@"
+time sudo mksquashfs $BENCHMARK_DIR $BENCHMARK_FS $@ 2> /dev/null > /dev/null
+
+echo "Approximate compression ratio"
+printf "%d / %d\n"                                                             \
+  $(sudo du -sx --block-size=1 $BENCHMARK_DIR | cut -f1)                       \
+  $(sudo du -sx --block-size=1 $BENCHMARK_FS  | cut -f1);
+
+# Mount the filesystem
+sudo mount -t squashfs $BENCHMARK_FS /mnt/squashfs
+
+echo "Decompression"
+time sudo tar -c /mnt/squashfs 2> /dev/null | wc -c > /dev/null
+
+sudo umount /mnt/squashfs

From c08e56861e2a3c4e5df5e6a63b580e7661f519c1 Mon Sep 17 00:00:00 2001
From: Yann Collet <cyan@fb.com>
Date: Wed, 3 May 2017 14:32:33 -0700
Subject: [PATCH 255/255] updated dict graphs to 2D mode

---
 NEWS                   |   2 +-
 doc/images/dict-cr.png | Bin 23323 -> 90047 bytes
 doc/images/dict-cs.png | Bin 25052 -> 93837 bytes
 doc/images/dict-ds.png | Bin 27053 -> 89590 bytes
 programs/Makefile      |   8 +++++---
 5 files changed, 6 insertions(+), 4 deletions(-)

diff --git a/NEWS b/NEWS
index 407f3b8ac..7d9c9c94e 100644
--- a/NEWS
+++ b/NEWS
@@ -5,7 +5,7 @@ cli : new : zstdmt symlink hardwired to `zstd -T0`
 cli : new : command --threads=# (#671)
 cli : changed : cover dictionary builder by default, for improved quality, by Nick Terrell
 cli : new : commands --train-cover and --train-legacy, to select dictionary algorithm and parameters
-cli : new : experimental target `zstd4`, with support for lz4 format, by Sean Purcell
+cli : experimental targets `zstd4` and `xzstd4`, with support for lz4 format, by Sean Purcell
 cli : fix : does not output compressed data on console
 cli : fix : ignore symbolic links unless --force specified,
 API : breaking change : ZSTD_createCDict_advanced(), only use compressionParameters as argument
diff --git a/doc/images/dict-cr.png b/doc/images/dict-cr.png
index f555a46c7b99b512966ca81ad8283d7f164ae160..f3a9ce2bdda64c7f370642d596a5cc1fdf50bf54 100644
GIT binary patch
literal 90047
zcmeAS@N?(olHy`uVBq!ia0y~yV4T6gz_gcxje&tda#NKr0|NtNage(c!@6@aFBupZ
zI14-?iy0Wig+Q1weg35&1_lQPPZ!6K3dT2k-(Fr@S$2Kv?@Fu5Gr!pQ&q-kuTBPCG
z5#ZM7ay%q+Wx`Z02}WJkE1OPj(ur4y`f+Fx(|?AbSJE7+(^iNi%yc=pN=08SfGtF%
zhbQHbPnw$X<;j(GZ(hF4TYrA*`}219tLNT-f6M>*oOgEVYp>kPUi<!6-SuCwulIf1
z_snkj?$0;;|9|nXf3Wem-0$4o+wM8!FEGC#{et(-Zr+*)AM1A9*_~Uq94cy&^Pqj6
zNzMP?_w#S;1FQPNR>dry{~*2oTYC80$KvG~iBRod*v!l>@XzRdTCx(VQ18BjeS+To
zSnX=&y^Z%A@)MGo|2Eu=@S9!*;XnAq`-S=0r@LD>K{bpTKvp2yRPOv@^z`$2`+9+W
zpH6A-J}y_C(;okJ<I}kU{gTo99xk#xnpK~^(mrgxvDW@;+5e-~|BU_n>(~1~XClM?
z|M@<@b>IK%{pYsMU%zVo{QXh(zbbWGl7BhH@Be<~jebGp_j&9F``YdQm+$*L_w@?)
zuip;H8@#?(vtYyFj_a-KTK+!WUGs<QI{T%0+kVdb+xzwTH~VAT*Z-5apKTR$;B4;`
zIlqhYTP7da{6uGC@o)LZx5Mju=BG#X-@m^9zoy^5fE%l=?+W+t|Gl{(bIo?~d%JFM
zO)<|l-dFqe_>XfoJum0~uM_?L^LhP^@5~%>KbW66+B?c0;H!3lra2z73-#>A5nj&V
z^tHge;4j-R#^S$xyPXjV_-7mpl6u7pO1FC(Uz=axpYgi<hAcD*CTwV|JHRvTQUFwa
z%>Kr@12Ov#zXN3mkd|iNFU)BhrnEuTKllYovcF`@+MyXlB4>fTLGx0RE7C8(R$R|t
zAa8K}{RV50=Dm&g4kR%DZIIMix)7><M;-IuhMjfocNap_Je%|j_A?2ZykFVCRvh>W
z;(xV%!w2<}!3_ud1UB!?6;So-K$&XY{ls#JeR~@Zvi)Kl4T8}ipn57$U!PwX*Y02Q
zNqG11Y5%K5-b}r#{d(&o!*$VX*8hKazrp_Xzn|a#{*U_kXaDcJ@9P%G?_vMfP#Gep
zcQ4>&_8*7(OY09A)L;9x@8945Cn`kiMAo13sDJnC-%tA}`}(?j{C^lfFPOhz{VDa;
z?cbnjf8Bq+W%*68oT3lP3AK^g=5N6{Yj0!SfiJeOeEB^Ul#leY-!6mZlMDPa_OXMr
zkVF21eV|<VJ$3EfEzn%U$3G)H?&kl~0l(sWp;`S4+qs(#wRJLb2K~0%{%?Q%^|?uI
z9$fC#=f@u!R<8c&xn%v<bI|&0fqB4u!I}4~4x}7ZpSbV(4QQ6%+jx_$qVB_~^kWYh
zlMlB0d^HiB&6}|YYO~xq-kyE`57sPr@%a@$zeJaEQJ0Y%@9AT*-=Us9yt(n>_xhtJ
zKHn^;IPm0f>(mL}S9Y&DC7OR9YCivUwr%_VuYGE)C~wvNe^ycLCzX@4X8d~?l^hTA
z%ag-RxmVu*-=+A|E@xBS58h*LRVTPMHAa}d+yQe&AMcfTg+KqEzv`*wQ@I|&|NldS
z;|A5X9)qKN3#S=YMniqR$IfiR{ri%|zy6#vKX!O>w$8gyc{u|vMJZ>a?TmIGO(XAR
zC4c+|4f7AT?m5)er_Z_n-Hv&OP*TMngS|hv^zz%;eZ+cJZ}-g2*u18D>w9SIUH`}S
z<KHuD`Omv!c=V@*2hA6}^2V{I;=mOq%V|$?)ZQ_Edvm*HBf{t#4fpTPTlUP@X8-@E
z53au6T=trAvcJa3q?<Bp>>_ez)fiUK+zvB4Je|4D-P*P|dH?&TGk(YN`TO)m75`bw
z-jl>N>1d7zukii!-{l4$Pfbt1yQdcFQ=1vQKmM*xUuAf2M_qmTyp4a}Ob#!4%{aML
zB+WTVx6t6zkteU7u0X^>9&?@e>!0(?k9}qm_CK$=R=T>VddBPJ{1Tj3t!3^!v<%Uy
zEPCs@b}cNx&#-;6Hcyu4N&3<Cl=Erh*+)<2e`z@B#&<n^^Qp;`EoweqDZ2xW;qP_K
zHUIne6~F#oboQ!>-ZRZ?y>;{L5;ke3NOwLy_~F>6BVRtaRq->fzs0e74kR@mSiG<C
zV);^ud++1ErOdlGW7qwcMIUF_K3Fy}T<7(6IRnov3!en)ZhW%xsC4+c9ac3(ZeO3k
z?R%_Wzu*4r&%3j%H|tHa$-1VkCvX2KV*l5M#u>dTq5Q{}T}zYLvGvP~O>T9sYIfv;
zWBWnieTMrBqw4Cro|o%vl&Sr6z+i9G@7Gr+r04io{)pz6IAP|0Nn>5_!;aMXf%g1O
z=c``18B4#0M!xm^t()KbfBYqT`rUy)>$c6CVY+j1?P<s5z5Dj_^Unyps8%H%I=_@(
zXWG4PhSM|Zl5SdW?JS1`kK9w<C*s!CEAG#K^7C(IY|P%BF@@#YdF$jqYO$4n{x9Fd
zwD;`x8rum``YkbihC4UzJz1GpmHif)XCJ(~pYp0)+xpY)t##+S!p~V&%bxZA`_NpX
z-Qdc>uCE0~=iD|+*y&d#9s4G@{Mnmo%lZ4D{!P5maDR5ye&fAn#jhV6d2sBP;J!&_
z_ui~7mlH}(Z<LiY;1GGJs(mC`bK3s(cmBrhoOyVi@!Rr~HCxN)FPaE0!#)(`9C#n_
z=h}DmaP9UR??Vc0%HDl{X8HMLeZ>I{mNo3mhhMQSO*_Bi@4JUjXTCnT_T@_l9d~}e
zoWAu^7BENLY`9+@bN<Ee^Y2fseeab0?NWFCTd#LZKlAfTNLAkGIV$1sX5p9U_RZ7U
zxA4o|iG0)<c{sX!-Mw30FSbM6AduVe-g5urKj%)L{%kGevo7M-l^e(RMXugxd$9BB
ztGS7DZGOwi83=50h&x-AtHfvjc$N9|$?a=wpDqiZ9#hqE_^icNXi;_j5ZkNrkY}4`
z6bG-qU;gY$(CgB?#Jc~dO5L7G-d=sqX#2cbhwWY2UO2EmyK>;n*Q94Rn}5t$c|7@>
z;`TKDV%r@XtqhX0Pb%lV=8f6h*#G~De~fbeTjw2(-~W8OUwAF_r|eRV;>UmfdBr`F
zT;0rlj+@y$uCYS;;kSipYmUU|yX))!zE^c1;sjgQflc##dpECpHzS<+{Er(oJ5R2D
zZan?5rOoQf-}esel>YI<|L>EXlb+cxk*+wu|HJL`yNveNf9dG`C~-e>@q7K(1x9jD
zUupB_nOfBOORW}nPu9=Ad0Z+Yi?7~gnnDV@<_5=4D>_fFF8vU!Q+oZ}cb{)piu-!}
zEyIh!wabCMw;Jx-SM6Kf^Ks9o-`cO|IIb%!`rPxVv-eT(uj@0vtxOj^f3uz4r%739
z2CwauIGMiMF9{K6zrUDUUVYc`m{i5Lpy21TPcMG1bFLB^u-Rr4?i=4!|Jd_$-Jv5N
zqVLCFnf#ik^x4(bjOQy%;{86o=@-9V9asJI&0%IW$IdG0gM!}s3~gRlWp$pGt$e=X
zs=D5?^LC#OtT^p?M{3`r1ZdK^#QS6J<f?t?X%$ar{{Gwgz1oYX@9&p{PaUgO&s+RV
zsPrp}pX#1py@GjiI`5ln_YX282z^bs>EV}jGi2`9sMQvKP8G7r1#dq8E#2o#guegU
zotwWrkPM$!`5T<B3~n8`_T7E$%;n3~??+2*&H7sH+qdu2=K8m}`h`1ZUa!kKa<%7~
zy4fGzV`@Jx25fvHc=^V`qAz@=*B76jQIqm&<w<{^-p^0Z?s)X-!_E8<|GeYiLZ*TD
zN37wme-c-VvacPyF#prvsk7cp-6*ryw0N(@zZ*5CzxLdFGx_61_A@Iwy-&=VarWfr
zqYIzBeweoA+YI-|uBYZEKDc&i@oA}_FM0~L^c=kfs$%=!vAwIYKC|EcQ}yxp5_|7!
z78OlSxc2$CpU%$B7CVo<G(IQ!WpUcw&t2!Ah5ot5d@OBh$Y&Y1H{P~!KJ#r4JQ2!H
zdKMj*_f7op?eO_~4?IbU<yp7G&M+xmaQj!bD(3!cY=8dT|M~4!z50*ZiT7^sPL%)R
z?KAJji)xR3wr+JtR&Ks%d3tBn*Y8FD*6weXlvUF|(p)K!B{})FbByoWlg!uMB)0BJ
z*je>_#%*VtTH9{Z!mVGd!o1gQz729a|9Q3_d^2jzubkf>vwmM)eZy_-<jPlXwAXFl
z_w?#1$Jai448N|Ov8(uNsB>KJysLSC*^&)scRdtdfA-A74@U0O4J&8WY@F5H|3#T6
z@9N>n*4EQ^L=~4-82H|)eDv!{7r1JUlb8PR`StUf&!6|lOu8>#5udd)DY-JwaZk~M
zxmi<R|9La>`TVmY{<Yr})@^o+xXLeYz_<9|85y<dcO-gCle75Dm$}W^HEZ?p<*D@_
z-zZNrK6v8cO8?%?YflF*zIX4(mF|86NLhUS8{4br<zIe&-`)8Cte*Ye(sd=v*6;YW
z_H9ahMX2*R?s+lKJ5po!&at{JCu$x(zcQ(v-N)=y#KSY{=E*<eI&R7Eu*LVr#qjQX
zwP{-6w-r`dTlr_qk~+NhPoV$v+wC^VufZk$^=oXOimkdW3+wnL9$);i`<T@In&UUT
z`D_maakrgZ`!Pyp&&|c3vgIo*<?FI?V@n?y*Ii4$b%dXPhK<iL&vO>+R}Wv|-WY$i
zIr{Q#?{#uE$)9Fk<enV=`N-Or7X?oroGl!F$Fj(+%E0HX-Rtl79P%I3<tx}1o6f6!
z_IdLfw)fq}!iOKvK4wvvbk_2N!Cs4qV^3zqe3DwtsJ?BUp;htggc-jgV}8yQUTwZj
z&+q<W=3|NzL{!px<Y%5;DH%S$`Dt%jufdN{elw%zQLA^>9+*4TE_uhZS1+=2e0%Oh
z#BZE>As^JGti9hbKbWmI$$s{=la(ir&hCD?@aLB9*H0fC{+*?he^Pk0OySNai*H0;
zJ9+d{^zrN~TO)I1>(AAcwzKmv%Oow1)XSS3Y-4-%Wij6kj`R1feZ6LM{zlc;q9Qw)
zk5AOy-jsG+uUTSic06vgamx8VP(AvS?bGIv$ZKD&xX-`;t8y#9)z74gg80t!Nzbj-
zE3XL|Z=1H+#y{!P$E+uzIy)m*S3LX1viW_^zlV&>7pJEbooRdaYiq?5Up?ENi2~|w
z?^d5HZ>g%aonHG?{`0G+H>cm3C1F|k=-7v+FQ4{Tsj6=^RXbjEPVOZrcoViX{<_)p
z`1$c!c7=vE7W#(O5z6NG>YbbJ{Nz(OckhYv<jJP#X=iUp-TRq!^hpTsPE*sOGarjK
zP5amr{QUOk4-E@D^-pfySb8M#^o?V`)<|ByZ((b=KKS|J!*2o~Z>=~M{cYvm&u1jl
ztIzYBJxZCo<DA3vbcN$j-fpgY&l|I?QT_gxWp_8fuRQ<mWPa`CNM5<>N1b=2?|of&
zck}&!Z+9P`U-e4ot=P|#=KBi2|1dtE6L@aj&!0P=e1861IQMG$ypMD3Q+EBm+1gw=
zZ!NcHU*Wlc*FWF9?ulaGo@Q@a)L;4aq;>kfU5EE)cslbh7C)URd6^~eXpY^dZ%fR&
z*Uzj!7x}5CQmkOTwr#~Hqh)QK4~_4Izpsn9Q6DCre_wh>3G?~d|KH!=`)yr+{T*+9
z{qcoI!|nfVynFwD{{J`cwB>)EU|fAr`2Hu|-QWLd?=Sv-?f#e9<^FeUIN~Z_F1`EN
z{(IwH_kZpG=kcG^dg%C(+5X${@_zfjCAk}azli_Uz1#m!e*IIie{JP^tG{Re|5~5?
zecAh8>+W{P|NHdr|F6UKFT(!LNqPPG@N@pvcE1<<e>Ub$TjPI5qF=Rr&o@@-n;Spp
zUwvslOF8U3OMOdYzND0HvO#*}`Wp`!AGa>?FMMQDIKl39!ZSXz|2K}?sg->A^!>jF
z+u3}+bLZ<ir>}pt_5S02`+e0vpH9DiGi%#3`7NjIeNOy2E?+$-BXghq{`5o1Tc2~W
z**z{^x8~;ZSFa=2KE7`Jp?J^EXIt<8V+!lJWBK8&>zrqn2X<U5EziC@+xA{UcJ0fV
z>85tqs%>9idLS`h@_B^q`>LGsO(s_5ac`gNeVDP^>TA`#Eq~ZPTq^p%_s65|)&IVJ
z_@;aRqwMbZ@9h8Q-hJ$ExAXTYcl%wxKe^lOsXqO^?*6;zdz&Bpf46`8Z|VOh>-R+4
zg&g*-y!|Pm@_7EwwY&3c{(au9|NoPFS^l5C_jhc6zS+FH{O{!dSKh6j|Le-T@H{!0
zFLJgq8NV)layV66d;HUX#!uGu$M^4;moB^OkH#iDn-kd*Pkz7fj{kM(U3dJSN6$3(
zUROw6ld+e5?{)G0&uaW_{WhKd{M%pF&R%@=yJau_o`1XVTujq<o&5*%Zl2ox^IzNZ
z@`D`W&FMY<);0+$sfM$=s|`OrJyY|l$F@c4^X&Hrzj_xw)vIqfKK<b7^*Ztl)3@mS
znL7P_OpCaie%+0qs(bz=Of$F4_OHt@_kZ$ga(a)y^JLTKr#7bL7gR?Whclc1Zd(7d
z=-by{<)@vezJ8{2TJGBGuJ-25Zhv>4<SSboTYcxu0<+84jb(q`VTo)1C$dlGdDS!1
z{gyW#GJd#mmbvKT4XfwR>>_@C+`M7l-|#nfarS@XUw^xH{|EEy>6ZMR`+p|aPf>k$
z?~m>M&A<2Ae`zm2Z}a`myPM_viob95uPdsMjQ@MXy}bVU{(tMs=Kr++-yiz@%<X&o
zexJ4fcD(G*#GBjyI`9AYp&{@OlkvY7^?AE~<=1^(-Tvq0^Lv}B@9+Pj|9;=EPX9M?
zKi;I5<^SZpU%g`QJmz=a?~`ly%Dwlt*>>-=xypv9_|LO{|9|@Q^Lh8=x3!=Drq6%#
z^#2dPoWFm5i*AswH7<SgX7%~FBd>S<kdvBmeafw9ehHJC4vt5kzF7O%u=Lu;TN~9^
z?0NN;HE)f0@MhEbv#e~?meoDEnxbo%T>Gg**!)^_c(MMu_ogr3-u<_Ww<hyv?$?#o
zKfViGpZjdbuaiHl`<CDT&~{h*{-0;>Zf@UGD!OmapR$jquJ1G3J8ymMkHfpy>z-LY
z?S8<9>HB}Q-aUOfKi^-6e@3|2d%1a4pPs!>o%Ubx#|>`%H8J<+MeXQLn7{AC*Sqci
z&h)>x`)vO2*E`$)ckK7uCH#;V_SgISQ)fx#{a2ti-L$H#%xg#f-g$ZT`n;{}zmEKr
z-;!VVdG_`2M>kLZyyCuN#xE=PzZ~ml*q;0N{9Ji{Ra)wtbgMtA``J$|a;mXysnL(?
zvnkyBr+9DG@36gJlRxj(`&m^YdHvtBSCi-8=yA`F`~LaQ=9`samT%?P^42_C|Nqas
zr%xAt`ts@asrCQ)|1Z9KyY7Sh{k`wq|8Fhjoc}|+zVds}pEkqWJo`7=Y<+S6_wKsy
z?>OaxPR|#qsrp$xBg^0B@0oXRPs^{|`&Rz<!Moe_>i2K@Q+P<1i+}t1KY#w$U6()k
z^XKXFlV{v>dv-P0eg1r7i%&w^!_VD5^hWo&$orVRQlJLrmCvise(p})U;KEEzkU3?
zwdYR!+#Ff{myLO%Th~|7(|01~vpez6yD=+g&sDns?P->!&nx0=O?~RB3QCVGk9ymy
zXPDk&u(N2+OUo-S)}CHJ&uWI<Z<Xo0woa}2Y<6hVy^pV}nd9UC{doQU-}L&T?|1({
zdmsNlXzu=q<90ud?f3rv;s58nyZ$@t>Gqd?eXD;q-}b`~<@Njjr~jXQSKR(bIo}M%
z`kVh_PsiWOj<5gs^KSdUFY|BJrvCgb{pQBrY2R1J*p&I@it6NN1^dTTcRw^tf4lkg
zz1KX|Ve>z)vHW=H^Xm2Yj8*4FoI8K>L$+@5tEv2LcmK_osD2|h(=Ed6#ItKhjoj1y
z=1lu5q<(JJudbQF-&x((h#y~mlJWE`+sV~lb8H`^%V&!kFMr3~6QSSdzgi~y)rqSw
zp1vrqJ9_4}y^M54+0W(M<l^f-ABfxaQ+ZAKzYF~D?|qD}zkQMW&#&e4@7KO`mXG>3
z@0qamKh90+)9W|A*<Jr%{>I+F^MB~Fzcsh}zw_?#x=-q5`~QglKlJO@)u-Fl>P}Z4
z{`B2?|2zJFx9{|@uRHkG{>ZJxn}2V=cX;t{`;CF}&mTRNy8f@uEU4IPj#c%e-nWkL
zB-eHx+~}5LTYdUqa?!V&neV@OuPy$1Wm8_d!Pf-kzB>=|4a7cf72L_b;-km&#1C>V
zwV%=rW6s8Prp8o0tNQxntIlHM&X;e4Yv(DZACSH(bo$1=t;ae1`wZhY=U-bBY&@-h
z{S2GhBI~-^oCmV@Uz~S;|GV0LSM^Kj`!{Mo`2Xv?JAL~8@Sj`vKmV@#|Ha4rTYqQW
z|NZ+~{iZjo<^Mi?d9>!&^SZq6f7tCd+>`d-|2B7beZ|k@ZRukFv+K^kzgzq8|L@kj
z-SIyT{d(|o>il0Pqiy42{vDcszh++L@7vd}bI<?x<>9}m_sgT-+>T#0<w3%|{mYL{
zO_zV4xJTkn&+2J^WKN&&ueG(mH)CG3Vd>Xjs}!$KQf^}}@B1u#K0<GXRMJ_idErrK
zH=F(8RpXSjcIjzO=oC)(+bb6_H|j^G>Go+A-xlQYwNJOaXHog>h<bc&QSkg-fjxC;
zmg!}B&#jFsSEjeg6mETX?PJ0$i=9&0Gf!VWZTYPDnql7c_wU*6{rx8&$^M~SE&fMq
ze8m5APo3@mEibzt^RH<B{MW_zzt@(_F8KH7&(HeD#`AC1zWe`gw)Xsblb<)s_g7c_
zugU#+e1_@2r)O?mmYOGJ{9)f5&$|(F5@v_4zL%^%*P*WF-~Ugl*zWJ##_j7RjC)q5
z>X=&|F`g4O%clC#(Mjn(zI+=kOACI7#MFNMuw}EHL5IlWVg*zFM~MdwDzlD!sAPOH
zqxRd)A9Leo#H63t=9kAi-*Btd{g`!CHf(jhE4TmO`1yRrx4`o=ZLH&DEk1I1^BSi0
z*KVsX7mGZ0^5hJ;-1WV@AH=^%)W<Bf{kiu3uIfk6;=BGl`}DqG&9*;h?tR}~U-JF#
z|7-F$Y<K^O{(WQnU*-LY-_KazEBrC@bN=1^FRT9@+<NTx^=b8YX3YO8egF5pyTSLr
z<!bw#+b{h2oBW@HruCIS&vw@9NZzR~>b?Hzt$BgZy3qIWMUUT1-66Gi&zYy)cfHTw
zw6)(ncWOlM<lys3{lSG5UyfgS^x7x8=wW(}Y<^7jq<)>>GXFYy)WnR=v0W*aFfFbv
zGHT1Ne>}&y`(fV9;)f|d^FF_wFZ1|`<n_&$_`UDUdmuS^e%3t3x?@k~9gTXHRN=FB
zj?MFVg}>i?S|Pc5<#i>!>vbn*A1!kKCv<j&fAZ(w??3;4fB)Xz-*fFZRp<RI_uKc~
z{;%@x_4fZ)epNi!+`fOq|3CNtMZf;_<NS#|um8S}f2{xKF2CNM=jHGJJe0q;_v!EY
z$9?zR_U-&5{r!C1@7>e)H&;GB_47;o@9f?AI`uZk_CCD-{KJ9Dm#^dF>o-5t|Fg0G
zpMQPkfB#-xn}691_kX+p+x+$Z;>u6F=huBzpH^S^nf>1l`FOpA?Y|$?e^f7v|9?gO
z{jTYXRqG#IHaaiS_kHW1S>5-!-{+)1Ff2^UJ`#1!c$wX!)rSwCw=^{i5B@wSohM!7
zvU2v5=+7&Y+u3`PZ1mTf2_9d4GGbr*87aeM=PXw;p5A3zA~|{aO2*R`pKT^v+}n5U
z>hkH!{dg_Ic2<A+QvUU(_g2&M(=9fpZ`9lW>&nWNRVJbCdi?XhZVlM5rvKRj&pCG_
zk7Q1rzSUjP?(47g-;ee0RnGX3|KxN2*UyLceevGE<@byDAD?&U*SssvJ||z9sjtJY
z_^j^N`hQoSF8sv*rhf6xpKG7Zj{ke=U9kOU<K6xLpZ@>)!T9$fcKaRGr}_UZK3y;S
z;M{)Ie}_ID&y@ckUzhdrV{!ZMR`<ikr}sBM&JR6Po%7Ru=D}+fmd)3@ukV?E<jbSg
zWjo!q^YZ3{!p7dJ+kWzzr)!S57uxFYw0#+z{QBFfdpBQwdG$e3{r)V8xV;;19eIBz
z)SSt)V}r{3iPrB6OiL?19(i!_bkx;U*?GlRRhF66eluNnFYeWv>yck|KFo<Xy>{is
z@0k4fl4Dn|&%3r)&(`Mgmj_uLhD8=LVv_gDR6eT6PI^}Kwo`m^w|&}5%VV_?ufya2
zfAX)Z{c-+p`R@3CpZ`Dp^#0JE)Sr)6FE7*A;h#Ev`h63F`nW&Knrc6a|G)Rnd;gE_
z*XLh-u7Cai=Eq0dXD^>_&s1Ib^RdalAbZ}w&!^R2o`3yve(meN`yLe;AKzcU@%zDa
zd%fR3|3A2Ie<wX=_SRdMr7UE8eDwWt#e%B?p6#5GzQ+H|=QHQ#?1=d~Q}}QyTUffP
zntHYL>dW2X`}uBG1kayxn7J)YPKk4I#j&pr88T{V>$c}VJCb>B=EIY=V$bJPseMki
zwdt>^x^><7)Xi6=T+e6B+qK!Y-)?KCrMck_)A_O9R}X*Y`4Z^fb5h*=`uoW8ij^D9
zKCRvVH}Y(4%A0rB=3o4@;ODRP@BVwPd$MM0>yLHyzud3c-}|-H{`2EgeD?drr~f}E
zRv*5YuYY0eS98n#TRYYt{G>L0&ntJCjjxLPY=u|<VV_&Q%qraGyw#yqdD`y&_By}S
z+;l5vUjO;5YDcu$>($4KC&>Ss6dy4Eu#uZedqrB-ld2U*dS5E?^Xtuz`ZUSA=FFSf
zf3K*pofrSQ=4#Bm=S6Hb$=O*SXUTl_uC-16R=RJ-og+tQ@Shj2xVB>U>xV+w=PsTO
z?%uvEJb#`{_Dc0*Pfi=kUp??dF!|*Aom;P@#QZd^pHOxF=^2}DQ-kEns=|L8AFuy=
z>iG2kJ*Vg2t9`tAzH8Bs%JnDDN?Vy!B)?92bh0`5olj+j?&Bv*<JLtyTc393X6@6P
zd(_t3pMPPhX4a*xUw!EO&LbaQ+Z0!y+&sP3?X&hWwd#`_*Z+KIF3}+3v1KL`f0o_n
zS8qAb--x=J7F&1jyw%37J?XY@%~#)^UG;71{B$$Fc{8etEx$?5Ep0hz|LpS}No#w<
z<m{WbrDmkF8Lyl5<hDD{x|**Ao96B9-CWmsPjd6m$nvx#$^K{SOYe#8j;P;!+55}R
z`4jD4FaDfv`&IwXtM%{x-TNfJ^~|qn_g=?~7k*wgO++`$u(&$Bue89jGnME0)|AR^
zd;T3U-uL9qtGmAE1Q+KYJ-SLRX3epi{j=EaN6k&vFEnYtpOCX)M$95R!=GlR*Ux{r
zwf~db*NZiVUyhx-_vz%^qhHSK`(TrvHAC6YC-;c2@3B|fY<26d%2lp=!+Jid_i5ns
z)L8$y5#D=}Lg$wz?@3o&7XPgztSb4(jN)%M?>=Yt_dRyy+%;t`>uCAki_d!Sw^d&I
za!fn1a<caPT{8-^jNFu`O9V6Lt=Ya$s5!cD%d54P>8q#Le*7d{t$RFX`m?XIm;1~8
z(7e8qEkEb{s^#x$l5J;6-DbC0`)%vCql>5gy(lARV6tV!dBx2Vc~PH^OrBht{5&*&
zuHBJuo_mt6eVKPKCjb1J+uDZ7wpG;+E`C@Q@##X;`i;hG!{-<Gy2ssJ@r)<yr17^u
zCs)V(UKF_8-*!grn%my<WcL2(m|kpL)^;!QW$)YHRTp>n2cOr!|Jr2zuOq!5B^N7h
zpKg6Qc>8+0ub;MkDY|lg$EP^{dD(^e(a+Cjw}qQt`})o3_~%n|({p&|N>zvGygv5p
zN>9l=>Gw62*G};BOLSNGC>F|QHFvE(yu7#K+Uti$KF&*A=6}aHG~d3kxc1RE;mhiJ
z%eM2!$r+Yfb_QP-njXD3rtoud&AF9UzoM>Nd(Yny@%78p=R6jBgu>O;YoDI<tvSZt
zzML(;rc3VK>&W+CcgwH8|Jv)$j$gZ$@3OC6w0YX!tLeP!EDB9`iq_jci+gT*eM#7P
zxi{W(EGnZu9e5gMV`>^U`G-&Z$61#je<(LFX<Klf(bB~7QPN7u#7OmXk;kfDeK}Cn
zxAU)ddsWh>1MX_(*-2Gdm3l?LPi<V+zPPgP(-qb2MGvCZZ|%A*+#6<SdhP4H`!f2=
z*jHEmKD}|>dAm@3_xWFs956J<$(}an$=XFv*It{mu-#qfyruJB-tv;a>MtJ~m%Xbw
zztr#j&(||;>aQ8wEh~@9db88idv4v5^LEGhyU)K~cYR8A^8Xn#V!r;Xd7>JAwnKZF
zd%Ax5lI_<yR-1nQ^5V_<?bp}dPhb$tnoyb8Ik{Un`=sR6r;*<KwjOz)dObqV&Tz|~
zpy^+)%$2@gywLwl-8uF1#UbmSUpm~rI4;It*7&;mG~-Qt>e)}8N4<JGcgA0#=IJrX
zJC*z6?rB!-{Nl8Gsr=b$+n1l$#Cadxwyyrj)_%F#S+kC~M`XDbzH<NS&RSglYfoO;
zk?vWge^>sV{V~nrv%B$;FVVlMcxTGjHJ@ZNQI$`;_NCInaF1L6nS-12KlQwwY-9L!
zru6In!a0-o9O*k67d%ft`D^FgDl^ln>XrWfymAuD;wK-BE@FQ=S@HK1N#k!l$~}t4
zd#(5{{j!e#wsZFHt@hvJ(mP*&ey()w-w(D=&!<_d9TQq@y>9E7i)#C?tvG+iI52#<
ze{aOsqE|H^ch@y93~2Yd_FN!Iw=^kI{P1}`lhvX7cK-eB^Tp$iM9k`{0z=E_IK92u
z^;t>3-mp%q%1V0KSu1-vczb%0@v`Y<J=*!tg6G#h?9b{{RbTJVcW>S=8}=D7UpsBP
ze%*Qb;@92j)h6Zjk8ZZlsJfjgU9kN4jeDz0zyG`QWousi*C)#7G@nmsjw{alc6QgE
z;%E22HherFr?9uzmSf*FTNb<QPT}VVpN7t<31JS-kL_nu7QejwSjG8!`};Sn>3=lG
zd9K`^IWzD5OORYVIi0`A@bQ(DHE}&M-hbtGevaE&u2t^-ZRhSy?wjI%=Uoj5UN2MC
zv2^?Ph*w7+%vp3kE+anw*WYLU_vLHWN9x+GpS!2%4)@k=Z+Xv@J?C3HS@`+8qcbL$
zZjBUg_MWrTctvI;yYl)yT@#m|+qI*rIK6ZB{jUv@oFbMkg-5SGGJIWOxYanm@>_$y
zZt>$IoyP9lP2=rsc;5uA{yW3gO8u|<j;idFv*&X1)@=Q8B~tq3)3miomD8T|K3e7L
zcP-8KVaU9gg5<q_&-!0o96b4B;9h3^tNQlpZx{VE|8?aSzrEG|(yUw4;{1M}HhVDd
zu3?;xb<}dT_8T&K6;C_U^&hXbEPCTU?{iPFoy<?s<zc*jw_^Ec=m=Sd++lmfx7_c|
zX)BA3HeVksk9a!!apleFamOkuAAAZ*mR)DHBjW7ScdMW8wGN)T_ek+H!#Fvsq>Vi*
z8<(HE^G|v2jH;She~-M1JhJ}d&EnPmaqKpwRp-6(=KS6EW#!3=;QHV#>y7=d=|4a6
zu63T>IdwV7VmGtH?stxzyWL<fT;9WeINc|Fr>WmsLz!gT8;0KNHqQGwPjPQ)m2kB1
z_3rcM3Mvk0cqEC=el5FhJG-3Ur#G`_)O;=aa+1~fdh<=@_c4YQ$6j5H+Pv=kydyJa
z)s{WCH7&nj9eDMs%re^#du+tF_MH7VOX`!<;<cZJR`0!-E!mtpzh|;}_uI<O^O0X=
zzTKYnd&SGUo%`bUSNyKt-*~Y$;(L6t$*Z2plMU6^{d}YKCeya`SVj6FV=?yAGpe#y
zCYN55+xxk$;(*4!;9b!<#<o(WRbP%2eYn=)UU9Xe?Md^}u--d!66cs!r}9_qIq>D1
z@4VV0XI{$`);_&%^YvIk&s%3cyGzmDy%JTwS8i{wcse26R$|$;3Nz!6t0JZ6{+Je(
zK2NFipJkQl7xTKUU*aBHe!jY7{jW8pHSf(1%-flMr~Fvt=65L-_p+;g7JZ2Ht`R$2
zK21(<qov%uJ983q>OWtJvVO+TKO_0bn&%Guv+R<0$oa_b?OCg8Hp}!-&}*NHM@i4l
zorx<tVDp+|^SoQ$$>$&Ld|}*W+iqHVj&(Y7*!g_l_^%mjdcSl^J~pggc>TzkkDaM=
z=2Xi*pXv8@?yR18-oGo2XMewSqv5;hyz2Jp8|O_v_4$gjp6UDjuddF0G<U1%{m7G|
z(v{Concx3ZZkw=Yh3-Td_L;APXG?4p*U4MwcBkgaQ;YaMi=C#1&tF`9@bHJy`Y3}l
zaldS<*!}yqP7HrPNAP%5QSaB2jKb&ZIt3Sdp4pT1#Y3mKAp6x^&AfT{X5EW=CK<hc
zUy;%I9k0%8w}>|V`nH;RC*wQG_)g(!`=6E<gO!gxc@bXlc<m>n`A5&4{MqO5*!#@p
znaj^hKA4&A^L8D3Pw(UzhDvK6Wdz%wy4VqJTN`XYyO?Kr-upN1b9SURzMuIdrPnG=
zzxLZL<97vX8q;<1xz9(PGuq~Et6XY%Eo)xIJa0L<n0cE&oSZnl;@HjG7GDcY3yYFX
z6C~B!C4z$=Z{4v+_VQ`#(D{G*s+sSZ-)X<seW!S_&3jkNynwYo&xFT4JGOQE&d(1!
z&z{q_vu@vE?EWX3UxMu!V@|=U@beD(3cn>U>nHzStsb85Ykw)y`@O6B{faBMZ&tjD
zmU(u<_}X)x4O!Q;<36wbtZx2W@bjt9(d(}($5n^^UBRbzJ|h3V)%t5sJ6|8&Tlc}_
zbye18i_&8!WfK?g+VgF1<67Q=_aCHc|6S;PxAut9z9;|O^ZS4OJZ+P_-aYqKdV1L6
z@MQkNKWo`}nkz%46QgC=S01kBF#OUvTU{+&pMCw!>oN9+v+FA@nR}+k*zTR|zV2Ss
z+V002qx}EQ+gLyU;mY|(Gb$sG-}XPVxx+eo-LEfMPaXyLhwY8|npL!~%J6H^*J~$x
zzaIa!eA%%l&tF~K@|A6y*#X<B-=}`pn$^?)RpRQ^*RN$h%*mJSkCZ>E{qUJ@UDDzk
z|E|24`}ZIpzl8KM^EQj_m5Gt}m5Y7!_Q`qi=&%3gFH;+JP00M*u8rOsr{CKZRr%mp
zMRG;fhhv@BC32&(+$yeR*Ldlhy!tZFzSdTKXK87LL80lhYugKUTw7i4_sI0#rNdX#
z_Uc`{y}35Ofwy9Rwf@ejd!BDI$o?^L*`t$%%Ov(CZT^>)_5X?V`5mQU=iI9+4opZ9
zOcXtQ@W}U@ci&(8D%Tg|Ge4^`;iNBUB}1gL-O(Az@_Vh$Px$fT&Zmcw;oiDmpA>1$
zGks)Y+9{}>XK%Q-;_2+@>&?k8Dpm9R|IXW4zuv}DG<>p!#7?O_g-?6G6s)d0B78Xg
zzW0}#s~@|UGv9NsdLO;_ho*GU<U2F>J(_v>`1Bo>-{j7o-c|Ui=dJegXAj!{&)THq
z(3x;#YuHCY_1^-k6^~u%N$Y$&v%J3Z*6HG#-gV#nb40F3W?dGxo-9$ktm=GHuIk-A
zS7+@#@^-3}VeK`eWpS2IX3V=WvoqB1Q<kr-#WSDZk=Nfx{w_Dj>DE@ST%A$5+BE&e
zL&4M1XE%n=`z^G$_SSc{BIZi{%KtAPrrMSsxi`79`z2@?KCOOl&0n77=TB_1k6Qca
zmA3o8*!>4@I5h4v6Ivd4%xqm;?I+>M?`tZ*t&1rv{qdyd)ycIVd-UVZhkkuh@MPiV
zR9(|=zBwiT1ocgiEH7}|ySd+X()7K1*L9`xKe}?+__x$@HN!2XeP7>Hcg4-!_v+}^
zd3S$4`nBr3amgKNi*1c-f2Wu9cfL%odVS7c&h)kDbo<Y*zI-~fdign?xN8Ua_-8~-
zSmW-}^D=vnn16-y{Pqp!IaYsuZMi9Y?ak}TPj?>u5_!6~<NCds*2`aA_%&&LxN~gm
z+LMxV3%NI&eU1yhCj8mvim>@H_2r+|9Q+)*{_LNK^WI-yeK~iz`q|Bz(yEeN(7MV!
z{b{8i1l2cQ+&lBT{6?9*RoQ1g#)WcETc);A>hwvu&V%bspQo*lu6LQnJ4t8Vh3>=Q
zanC-v+g0E4=h0twUM}f}Nom5hFP(zw({0WcH&|x3M22fG|0Xs){k)Cz)+>>hS6@AS
zcGrwK!M3)adL*yUvVCfCe@@l0SMCxqUspC;A9|SZ%_Q#NQ{TCEg~@-m{(5t@Fkj*Q
z^0m2Fs%O=-TvYyeYx1o5%b#?<d^@@F?Nm#f-=XvO6hD)fGmtxU?3r2Fj*3q*8fKTS
z%#zt-+xfI}X?dSb_M@zo@~c(F|DAc`eAluwRfj#ku;}ZjCmqjcx|zQIw#a{0sbOW+
z$5(Sh3qP%?JohA3_KtDK>$MZrr)`v}IeKz#eDaUXPeR_jJLYty=PvPI^Y|Wv^aHtD
zM(+(RXG*`G?EI$Is{7(nRrx*FCPyc4nYHVUdDqjGr{xmb?Ug1sG)#BdV>qWLSb3e@
z&TCKde_pxmTs!ZyR9wv3omMt8)YgT?%#Yc4>a5(<$2A2NMZ(+L#E<{>k~REs;z{)B
zJ3Ff^r~k4!ye9ozy5FZ2Ghf?w|MZw|`uJ9K%wEfT7SEU4ebn8Xo_k;V#w~{L0aD-N
zlkW8w?fJjw`<b<;=Rf=~Y4JOe_dYwHec8NR?%c+Ry?^s;6M}dGm6t8MF~h3xmC^S0
zdv(u$%;`KAC%XKZ<%ermdp2AV$o^(1UwMAwou0MTeA!Qqh^DvAS<~Eak{}UNYC3)K
z@_B|omzHJCKV^Kqx~%B2jqr|`g5*NeC&!LgTnnDOv9xw=<Myv?Y0@Wt3-o>GpEq5?
zZs)Oz%A&QMw^u*<u-#{`%$IKr#@p>B40lBIPIjJC_L|XHO7GbO5o>`p#}edX_@|}4
zKVsw;dv3jj)brrUvu!M%Bz-!t(Z>7O?^l0pcS<fU5Hs9*=AeOTg=Ny$o+me*eZQTI
zST`@~*f~$%-jnImehI3l2d=k__;#Y=$bL8f{I9=?pIzU)F!wd@j>bLqM$6v)Z96X^
zr@ujJ_2%g|g*Ium^JVMH>#nBBr&sFjUKY0I)se5;<qVq4f?_^DspPP{a-`#}VOOy8
z-dRzV&#DTttFn$18L6+cFrMrj_cdY0t=h6bv32uwe>X&5uAcVBkN3`W)2~?{X4E7Z
zCKsDNh{!UU#;=}i`eSBj-Pz#dXR<!6of$5-b576GXyfbM%hetW_E$ycFUV`C)_gCX
zY+I95Y$H{AulvzW`|NKge}%oVDSc*n{Kl;GP3w1-?tR`geWTT%4~)soozJ#%TId(n
zBwhP3V~^DOqrK)|gWed=VpV@$rMAcFx61U0bsO*fRJNUyyew{B?Y49L=IfhdWH+j{
z-}&5c@cP?@!&k4IzIr-P`F~thdQVl})hFue$*)YmTM5lSs=U|uHmFprtJ^Vs&+#J<
zI+rdhT3M+dwm$F5@u;t*`=V;+`s+=bw=e6<m90HTKOAQF5$egz60YTA5)KdETe|n_
z8RKnnd*{sIcenZ3DfqnffU*C)s*TCTPZplOVR!ZP%~#Rc^MdEwzI?v=(PEpO-#+^&
z*V%eMO`BKv?Nmkg=Frn}*N>e0uxs7RtGDhkNPn28^lhJ)Pv3m=BHnrWhSf8c%YWS(
zm;K<|Ch)?SZ--V-4Bz-9&G*j}_MT>uTW1bGuDv>I){|2QyVGrEx!bNS+SG4qSoG*f
z?@LX8{rR(OvVV1@%Rd4K%E`5z6NT0F*yhjD|C(hSK6&qz<<pm&Wq&)nIpBB}uaBIe
zTKfFEb=#-S>dD`{{`9->`>*}3zPkRHZBPEkJK=kd?2s#dZ&`Wrq($ZNZxgMOzn(i5
zefYCi-wc`TnbOsAmd`Am-#lUOX?i8w^!;h#+Lasq{N6M^O}#toR`8zM2dl)D<&WOn
zer~$H`s*X5Y<pG(R(JWo4ST;w?01#f`A|#K^O0NGE1x!79+v3acyHhG7vUd2EjuPx
zQGMNF=amhD+tz=n&VO()x8e5$@$Y$i{~MpTcz?I&VM6EGbt;y}ES+UdU;m0?cDJ4t
zZ<=*E{M=1`3HHk+V#Y_Bm#vrjWD^i4v9(y|eABs|-wOEl1nQjMRaJYf_v7(bCvDZg
z^@KkDc_3RyeC>0u^=@&m+-H>TnPwO<Z}KdutfI^5YvOcFk0^WVm9Eb}V#|8^^ZY~k
ze)$R6%y;JB3BEV|<;6(zZP#Dy+qUiLTYdH47ORs^y7sHG`^2oXt4x?0{<@vL=g6yE
zn?pxsLT0DS@|7CI9ji$Gy+r-krto9GU%jn5`eOakYd3zrd>C!Mjep0+xV*2?#cSt2
ze*1prm1i@BjISNu+&*hh-o_^j*H&cpxbK-`-L?Mi{nZP<TiyE3cE_R4?v<@3JHP+z
zqt`B<-%&cvW{+WQ$3wNe*gJ8S+mEeWzU)|BRcSlBkL;p=q_gfj&OUv0^kT<KfBy5k
z=2g8qx!JAmOwf9>y`_8qKKQU|$JZlIQ|~|NY);jA9yEWiP5%tLLc`i~Q`Onp!yhTn
z{c~#a>>V*RkIn@yUT;&B9Xj9C@|Cgqz7YTO+wM8sb-3q$W!pRBtwm?j?JAF1^7q`4
zx)=V`P`UEj*K2;3-7+SY@qa!vFm5n(X@4mybNb=Qi_Mh`2FZJG<k(eQD{|{Sxp9uK
z-KFM}o99VvT{HXiMfKx1lPapCz2lRMeE!<a-rrx5RCVR+nkzz|dy+C9+;Fxj6;<~4
z*}KE`>5Jkv8N=rXw=P@%YwCtQmgbd_t9NXkr2MP~v=DGHZ$*8T|Dlg^O55hmnA6p{
zT>aRSM{`xD86T)wxcbhOVE@hWNyn~zd2q}!{@+@59+x-))z_j|Vrrf}y<L8c**<+=
z?M2DO*N>cW-+Cm?=GTX&=;}qDJfOt}o6mebcl5NP+|`5nTLa%8c{5ug{e#SdV@0dm
zC+}IczUI@LnN@|hTTKdWw+4Ut^!4Uvk=jqz?|859o_Tk<Yk6LYe%H&Vv%~#u-^UkO
zd|Dy-`m;~ci)}vh>~@ygZ9UAa#_w?OVV98dwI?&f=a(kiu$#CmFPmo*Uv%kuMaji)
z-t&u(3UBs5cm8wJ?A5}j>!PbFuFXyNuRdW|KJDkyee<@S`)D(-ziOUu?L2p#^Goi{
z`g2BmnVe1hx$B2F>$P29^YZD6%fZ{rR^5|)Tg{x;@Y`ec_lZAFEbrS@`Kw1;J=-#T
zUg`V7kAl;0O}nXWyK!%}f0gXN;=i6jEQu;i(~VajKKN$$`ETz#m)h~$9eTS^F1~W+
zY5Qky)z24Ch?Y*g7OY<XTE@7~dTadK`L^zNuE=($UvJI}kxndlJ@d+Q(`8}35m%S<
z>8X{^zx#9M60_0|o6FXJowv9)KVeH_)&8><cNTxOGhJ_29kBYlMd|Y>@BFiNrsDQT
z`=6;#+sn^CgGJSN&9Q`ngZ>)>?;kN*HosQeZ(pg{>q<3nTX@}5o(+Mz8++VsH^uk9
z)$j9P{C$PmygO@uNZ7AGSosY!!7kBzU18q6dkK=(-uY)`=1YBgl47%}@h<n@$Nlnk
z50|G#=Ra7-d!<^i>3iIyhf72GET{eT>%F-0`t`Uc$IlqQwB5XO@8_5=Q`~EQ9N|#f
z#K>~ymfh~ZdiH_r>TYu?-e%_67w<8&HBvi%p<#7tU(DZmd;hL0J5t1FT9p=`d_F->
ze127tZ;Y<oX7)Ip!X(opQAG#eB-fq}&n?<)_B!%Bv%j8c@~^(6uh%{tGp>CUI=^_5
z`QiST7q^1i79akd-1R*_>DZ^IDSFG?jk_*(tlqxg!g6b{&%CHT5wF$;pSIZ9&h9fQ
z%Q^c;k0jgmXMF2-R#g2;D0-`X+-j$3&9N&*`wZjYbI_L0%lAE34$t?=vrX^aa77^d
zrtld%(`ogc+tbgTx-svaW^odzfphI^r1HFn%6nt7za5fZ&pX}RGV6%8{~mCJ?de}p
z{6FJZ)sB<q%k|j#^}>?VQ|4Qp|09w=Kl$@Z)$Pa5S^g1}bcpL<YM=4gQ2!ER*2+|$
zdEXxL*Z;V-aFbcLEpxrg$4{sA-+xHTu;HE|V^DZL;&;0K)*q7bdpBp-Z{51?+~%vF
zqmQTi|1R|Vu;$>_yq<RB$HD&A-+#>wU*A77V(oLCM^*o#)>pnQ_o?6i^Stf%JMW%O
zkGr+^$D{7AE9TlSl73M4<Ii*Z{lDL&+waa(u&*yw{rYe1eB~b}H@>UQeSh<NyG?1`
z{RNlrec$(8QqFEYLzc0h?2dHhV{;}KK9#9!-WbUjwOc2@YsF2I%464_JWoi@F8ccD
z+?jbgUAyAvT)A?P{dy34SY_7d(^K#LyI|w~spl=b`@DIxHa?%49(Ue9HaJ`FdU2C*
z@|<+B;L~wWqOLwM6%G!6ZQ3jueK_4__36upgWY>x8qfQ>x~lTm8^;)4Iko$n&zw{D
z=U>0p+~9V@cj5V}XMP|3y}It-n&SGETg&Uj-l{)K7h3mynN^W)@`f{=bNzLnr|a;~
zuQL61;q>x8*}7)WjT=)w%j}u{o<H~Vn(&@E;dYL13s-I5A1Avr?7UWZ-}Naq*-76|
zKaaFg-(0k>;_0c6f38+PyQ01<&L>~~^F;er<4bq-&)ki<RljWh!*dJ&O;w+F!}jZy
zV5hh8A9-!|-QoX}_WPOn{>ojQfBr~>ua}Vd9CzjXhN(3NrE3k(JMJ;n{#mf`X5`U_
zGIh<0o~wCf*ZJ%5);9KUdBAtAd2W_vc<s59KR3@Scr)2HNZal;V;xuelJMpBPyZCn
zef{%o{=7YJwEg$S?W?MM^sM4{XQ<yZ$<yoqiTGVjS+{SVwq^83AN_qx-$vyx$WwSf
zJF=%O>hGS;VDGiYM}nr$*i*cx%H-SH8GnV$ul@dMe0}v%e|dvRn>*VbGje3#bL;A7
zZ=G&Y>t|Z6VxQh%J%7iwGhYijH(seU%f4bft>6CW8+P;LqVrBYPc7%Hbjy2mEbHro
zPX|q^E#3E8*d%8sNcLM~xoy?8-I~2-UiKC3^I@;AzslZ!PW~+K6Wg>idsE+poj7W|
z%<o<IooeATcPdz$lIO+QMjU(c%`=9F|6F&(9htq;sy4n_&Oak(&51TSCmH{<)7dBM
zpWpT8NbmWtmWTgY-mkJXwvbSBw~ct(oLKbz=Ev_(($^RnCVj5jX5)YC+rib#?H)x;
z=RO`W|8sBnrB7u(`TTqKc3#dpzvk}g8$YL?+Z|S~zkX@;-fiX&Y^TlVe<v@X9ajcB
z3!u<{e&w+%S07#Md$)hp#`h;ypPyxXV2<%BYx|!G&(Cas|Ao;wds=grPq3lB!+VEU
znOo;=4V?2U(&zk}*E3&Cmny1|+A3&nDjB}FR`28DeMuGPExYGt-hF*N{jNlQeA1Rz
zXM^+S&YD(gU~yIGv_#yw^}B*U&8%yie@Xb<)?dNTP2NAe*)X5~y=+mEZTPJ3|9RY#
z`;%{5wuYytonQ6c=fSHZuYPVmue0wpV=#MI;<a8|hpLimy=$9=ldE=KUBBdMZcFz;
z#cknNXPgdReyljse7btx{3CNU!~S|GPm8;2IYa9F?0I(Ade?S8K6oVErqE_tpM>r-
zTjTid!1Y_Jm&%_NTy1QdeXTcrtK_<Me;4m=47Rh+YyW+s+H?KA^G$cY6dg1QQ=WD&
zqPO@!??=h#;Aa2R^E#!k|BB_8Xq%fX$LE_nuYG&^H~)RLYhJrs8P<GyqrS{P#%KQC
zCpW|W9!1xbzI=N7bj|7TymRYKi(Xe%pZ1OM(HD=eET~Z3ceFh{zV>bPO1s~Z{pV73
zp9`qZ`zWTL9X;zw>7N&Q3-0ybG2V0JY_W5se_T<=!%WHWGg9|%>?=5WWvPE$k@mb<
zQrG{L+a`$I2+@zLU2E*Xldt2Kx5l6EZ*cnAoyUv5zU+Lh^Gn4orgC2Mtgly=)`{NV
zvr<{rZ}rcWbLQ;7dfxczzDMVdtEc@x^5BH`orrw@qUWo8_nMZTTt025?bYDpZaZ$w
z+gLAtIokMobNZg6o3HINpCJ9<-^Y7j?=9ndw^udKFSf@**RoSM`m(y(^r(F^9_th&
z@0F<9cuTw{?ZsuI{a+hSHt~MFnILj{we5k*#?zj)Nd-?jUthfv^Jm8T=S}lxR6U<;
ze7bU~_PTa`_0q`g>UL|3Hl^j{e-ez>sXXZ$vu^L@!<+le{cL_-JNV#4aJH<Cug%6)
z%hmk%?%en4?Aq7;53kI1T;s=o?V7a3HpX{~?<Mzqd~wg~O+@_bZ<o6tzkFVkep-0_
zpEGX*H|pB#jO#aEDJy3n=MePuc-x8g=L`n%2}K{Ci8}YI&MUl@<x|&XX}|N_3W*&x
zmM=FyGrhRDNb8wQ<+J5KCaM{JpKq)^E!{Wn-16n?pES?34)@t>wYO%k@zt08FR#A5
zx^(-p<!Lc{tv*zl?R<6eb`|qt-kx`Y8zk*s86FDCpEK{qZ?W}_&%OCdO^c2i$sc{O
zDs}xF#rGfbKSh6;a8+4A`P{K5nUw;+`wUDL&%0^;`rHO}yVolxTYsMCzSpwm_mb`Y
zPiH@#Jby=2ZPC-fVEy+&{_<xdI|Gf&_w6(-t@`~?IC#CE{h^hKuO?5HNI!WiuJpO>
z&PAfZ>!-J`kIA+SpBv}*`<}yHhVLEUMYjIYQH?7#J^%astr!0`r(Y9VUHi%A%hc?i
z^)ef>EYC|S>r~6i8F1xjojlwlb@J|~Z;i?N=?^#O$ycs4Jhoch@3gU+-Q&Y6KfhI+
zS68A}eR}cp4)wn9$%RP|X3VJTpZC2l>~wKws_dI7ul;?GDT5328*<;~esr^#QMUif
zxBUCk1<ZG{EB80fe*HA>=brkv4{Q6j`}r4ENcMlarG0*i;hu?>=cAq-tFo9k`Ns$M
z6gi<qDV^5@5+412^QHXvsuOm{EbEU5Up_tm>4R_6Hb2d_-|{N`xqr;wS;5cxzpOkR
z_w`N2>Rtnj&hu4=W_~<y_2t~$b@ycQ=Twy_?|GHJM{r%4nYyXuX?xfHb&y*0!kV~`
zr_SFw&n~xTR%w=GI^R6g<l48Map?zr*JRCY|DJmPFf*IOLf+gcX^nkH(*1v5Qcr$<
z`@WQ2@~Z;d?;7mR#Vaj?_wGINI;Z0Mqd(u4&o|EYnfLkRM!{|C?^K?jSAJpl;#0=g
zt-J5c(7X0A^7bM3s_Mwi;cvP9`R-Y+^zSV-UH;<XmalB<ZZ>?MYrEtBE87=;wZ-Sp
zFtlBDZQn}MWoc`s&$p{yB^bP%eS4Vgt;5W0jQSo`tbFSJXB6d};vOaaxYDJ5eP_~#
z-qrVJmD=v<S=|@2+NQA9cKuGdd8o5xrG0X7$1=7==KK|!zxl#-nVjsrPY-9lcK@|T
z@V5Qe7hBex7PMa0u72IZRPuCj-tT({RHYxxyYy+^D#JZb7OmX*UB~qClN6gv&6%b9
zEbM+uJf6#WJVJ)Y+9pB7$tUQUnWM%$Ly0u~Z0#L;BF+8h6@K%Tt9bRaGR$^X&+23I
zUY&Kf+j`~f*LgE%eO$5rc_6zy^Y&$NG3(^!+>o)qd?T1wE;#z}R*MSne}=xc-k;Xq
z^w;ORK4X@lMcO(){W#0c>ry+}{MXfG@7wilZ)33egS}k)kA0oDnJ=%$T)fz9hwYb7
zulEGz$?q}Fnq%B~cJAUlllgJ&>^)2lk6-079gpx!Ix@@V^OuaRZ<O`Y>|Uw1+g&;7
zKBM$`Z&jrAv#V8lKP-b|&cwui1J9P_F4;bP>lNwOPge*Yzpq`)_SZ=6={)7i#SuR5
zBh!C%t-c(+o!>&gpmtvP+_>1^_YSO-{&25p{`dKX_sWZot_pvg^J=Oy?;D|FyQuWu
z4R2~e8<3haN;VwXG;;^L!S&~gSvHSV-m!LBrkD6x>{}7O_Ve4N>n$qRp7hi|Zh7s<
z$+ewxi|c+ryefU$ea|!FwZFa;y)|8R(sTZwBj>N~UVQ6u#JfMM#NFew-*wKiv3&Mx
zrre&j<{P#)?rDG0`_8!X-t;G(D@B#ful4_0b^Ft+r&ns)4u9TL^x@Ul$lahhc1@wv
z&k{-}*wpf!o^h|}lY(iO^7Wse4hSoMXPvk8ia`4LGsbS~Q+3+b@2K6Z7IvO_p2SZ5
zuZv@Pt9D3KR#j?Od^UTuL@oJC)UlHr=iQU+Jp1TY`H|bN!oQx}s^*sWM#l14<aV_*
zz3t#mz{S6h_9pY5_nu>y^ytcw6|;r2SBgvjJheDK>e;c<c{}$$=)CE@*7DyqW;a9D
zlSyVv+B)BF{%bv>;_2zl>%`aZJGXpY+LhU}^j}5GR9}^RwK7`S?=w%QWV&x{(y>Z2
z!#(=1iq_2TPg6B}e0bx2L)+f3(N&f&vwiCH&wieB$$012TNl!6ujs#4{_Al$B45G$
zfo+KW`hpda*H>?Cb6;&&DY@GE`fca_dlLC?YJR7KHr_90tAEWnnYG2_(58hEN5dbr
zM4M)PtaK>KZM(kt#A(TdJx^Y}oNH6`^;%Y}O#juYSKoX7{^prKSM~Rzr>fhQt}NCv
z|1D!}AC<0F&b|6?G5hi(U;ix6@Ov0@`+L-1&GejehqpHt+tp8fZMNfk#nb2KZgFfj
z`@Hg`MBTmTS1O*?oL4+=b?ePkL(|+}4UGxGCzBpkwTI=$&aD+%&whH=pD&T-=XMsn
z&5Ye^Q;@vJ(8jdl@saEvGhNe8>GZwFmVa?t?DziX>h0%pl3q(Tcb>i+Zfh~k;?|Kh
zFRv$EO!2LKs;d6`dc<AB_}{XRum9Tm>(=_u?b*!t<SXp`lVV<SY}c#*7U>alHmCa9
z*H1?3+tlYx|GK90CiDCoI)4A2F}o$1ooWs=S6^q7-Ff)3+YTwq<2E(FUtGPRU1(_e
z@?qq0>E&|&c+N+CyW91a^|)oyuOmk<MPIk(=Uac|>Pb)j^Sh#6tz2JI{Cvs1sH>+}
zTGV7$Rj16`_%->TknguWVe|J|)mfNN_-_2Ydwo~&*L(gIuYavMD5`Fk7Rp_}Y<<Pq
zms6iFp8mIU<E-}=t>3r*7rQB&A!B*M`N7cuiPxLCXH2syG_<S$_w(mX`@DIYMa}P1
zA9b!}`G3B$QgCuIfBLD@yEcA4dv%%mHgUseK3}hWEeiYeY1)pBa(o-p{69wpFK>6(
z@!wloSW%f*X!z>J)~f0lt9oz$wQJ1-%pdIKdG~j=%zIbE_df;0eb%Qvdz%_N*ZB2K
zA^F0iU%rG+mawo~KZkMM-Cw-Rx>O%-PTPFs$uolr<8?cB-Ru$6H#J?C9u$8*wDjEi
zJy({y*=(GX8#{lG_ao5Q&`gQVbNTahwpUr4T>a~m`uTY)#jgi@3;X-<nZB;7d{$Ms
zrz+`nmBE>q`8PCwZS~y$m5ojM!M}%3_qKiyEqt>0ckYF6DJSaAxx9#6b2aVSQSI|p
zN1s04Zn0g?Kw!Jn&5|QC6Cdn(vvzs-wG-LCd~(ufZ-hU4pOy9g%v;`R&whUR^fhbE
z#Ot$UY@S7ayZNuSCAC)MxzFpH$6qrDuTMWcM{e`HZyx(%vX%Fm?ycG@RXy=~R8h}r
zd)I!p=Gps>ZT`7BqcS-E-ahjOY@h6Wc<#*l-oMjk&(<SZHjh%)SN#wA9Gd;?+ZE%<
zv!?C1aptx$=qw16)6YEbbgfqVeMPF)hQsc)a_qIwJj>&D{5oa+ou|UE=8@(1xcT=#
zU%dXa^qz))-nSLCYeM%`#x0kKn|sgr#PsaG@a5Z=h0Tvi@|`PJbLH`jxY(*BU)!G<
zb&n#$@9#4YFrV-}WN-b$rlqNMuWYB;d=)i5{`=I<BM(-tx5+MAJ<rDS+QAo7%PJ1^
zbeUaTZt!?bb;QOmaS{>7z6fpBugp4VTk~|4WM%adyUKGDr$67$Hs9j>oWg5wW4Asy
zelFj(TA<qO<EzbfuN#j=eX?CHArtrP<<Wy#`jzJtzq2lL)2U9~`)ch<^ZS=hJ0|y>
zH%`}aKU1@8`Mqn>CwME?7w~^Hx_<cV@9ZVMJrQf~S?%1rMs=B3PKf_HnaXcxBd;C#
zFxC7pAHM|4=ETKmmO9DR9ScMK&sy-Sth*MYC+8!q?tkYO$Lc$87W(ylKKbyZ@10pv
z7FTMQo|B3>Q+MQ3r>TL@ynDZ<g<C&L$-TCD9{aqQtYcry{bKf-?kW7_R<+eQZtt>N
z+h47Hyz=as%IUAtYo+T;%pUB0X8UAn_vGicGj_!6wXv))w0LxK`r{hQisY<gS*y=m
zUfX7JZgTYJ!^~_=?Hd;!{!(D1W}jBNpsFza;&F+5**O(0OWPtg_y0Um-S;Fd=WcPt
z>U6>MHp4jCimM$DAFfh9p4At3I^vB`{`@&pH`+ct$!aVX?wmKrCOO;K*2c1;a^?A%
z*RJ+_Df;m3jD@MB`u20``LB7e@K(h4e(0K5o!^&r?{d+bUVomocY5~LAG~tn_NBx2
zY07)|UKC2Nt2j_0;9)j##db!y$=lDrtMiu)Ew-IuJICKwC;4kuwy*Cu6}z-(tMrS^
zanHVm_D^5DK3!$I``VkwBflMAz4GHUwXe}1!}{k$r{DfO<DS*Mx~i&_*ggrH#}{j|
zuJvAh&}*w*8Fh8SYD?God#&E_R_O2QtlHoCda`}j)#c|UdaaUQB^AwNpZ4<wPg3+f
zxpRfnK40t-l$SH$ViXlt-+63hW3=wiD`&p0G+&mMV_#Gd|83H8w*HgTw>O=hUHW<E
z`F#ahdGZC>zpBK(KG=8QNh(j<#nTb``KmhkE7`q!Woljt+pC7nzCO*Wa6{xA)88*I
zuDBd*Tqb6@W7m<Vudb?ppApAf+v|U^y6@Xw#`pX0uzU}==WgoP`(5K#&(#~+#TDN!
z1e<@;d6sq5|KmzUv*VYiPv7`=j(c6jfe9XA6Yg2bZRVU)oV%n{Y;Vu%@adnQG*s3l
z+sZsPwfLkKA9dE2-9rDl+PoPuufH9QRt_^hwC1s4^}(x0&U{qXdA<CIrSi|t{v^Y_
zQRi9Cb;t0#@0+pH>UV?s@v5Wmrr#^x@}9S%|Eh0=e^dXXD}n0IRl|AopY=Rh)+Vt!
z?ylv%pBb-eHq6n!zViw{zr+EZfHi5c{&$xZZB`50JEtlEwCg+O`Al{Hy)%l>e4XkZ
zmtAz}wB@z!-<+RUX4_|N-dD6Xd|k!d<?DVu3HMzan)@uSK56-pa{>A5mb<TgdhbbS
zU&TDfH*v2v*B{^8c&FieG<XF6-gME$(`M|f`Ly=;eW^WJi}w{}`O5g~K96SpuDZ<L
zCV@eq+F-Wl85_%2Pp(Q?+?p5~lbdy9&U&^x68miS{t48#yt3hp@xAcp?=AO#+n8p5
ze)5hPQ9Je=*!+z1%~YGMQy<HG=+WN)?3{=1u@74%^Zw3QUzNUivzl98&i$^`zm6|#
z-GAR}kp3X|<sY;8wq@e&%5Ch=Rnz#hKWQ)j^z`B7N$m4>7S8k4HBC>;;Wzl2m1mnE
zaGgyk_eDbG6=CCb&2Kh8y?Q8c{)~<3EBCI*FWjWpFSmKeH~VSn^NY{Fzxg4<{kq0+
z<Li=<_O9>0F1XzDmUrI9(x2ZirRS%sP1{&3eENsuOOOi~q(8_#`Da{a{3NO3{lzHu
zaQ*u-dB?6DG;RytC@QgM<zeaPJgV2+YOg+;%lrOAgJ-}d=Pw+S+~+y3y!y+7x$MlQ
z{G!*9TKOU8jZ=N%zjUU~DegZS8h(DM+`O$)rx(84c`5k*Ea$b~Lh|2FwA<Kob;<hD
zU-$WEe_i`IeY5|?^z}V2Eia#cX8NxqZ^51amGY9WZw4HD^3`rJ-!boXGpbCl9R)4!
zpSix+ZL?O|ddYd4`T1waq%^BE-3(Y4C(|djr|^-fntj@r>u$Dl<7=Nrv2R}vnGSn+
zRW<ER&#B<YJD<E<d)s}lh1|NT*Uvt=?J)jQbXj`!@#N0@m*3y~t<Ey?<NLTqZQc4^
z!Jn_3e-vD8`u^h017G5H{><An@7@eu!ROB}NzC79V_JH6>+-Khj$TT)O-@TrsyMHl
zHoq%ceEam8KMxt5CovVVKI#+<Z(h!pKc~v%QK<dt;P|aiu6_Nsa9ZhyE9&v{N^PYo
zW~Tf6opIIj<nrmIdrO~pOzwX9^wCqn(?`SSSWVlpv-WEDV^hnO;;ZF&Z3;j2oV=X2
zRdU{~zG~+0+02#yC9nUse_w22eD6)qP5yJ5RhFCQJ*d<xGA)gJR!|daQ+;6Ly6yIR
z9{#tN=&X`X^P6*abLOWjk2YReDR|rX*!y#<_MTn)dT#3WBfVb>Iw}(v&&z(eY?<EA
zV^h=DZU3&b-TdnlwLD$J<h_4CCd~Nz<i*O9o^pm^*{_bg%;u>#VV9Y_+CNA2&YsBY
z(W`$N?%kzZpLKq%Tx|8<yoA@!<FlVtt(ztB**IZe6SIxIeUbYN)9T6UY<kaf40vp+
z-(B2Y_<L!b5AVIWq?_?R^M6I}Kj<OxQ{-vlB<|w}3u+Dqt`GA+8^IT`b<N53GM`RO
z=FXe5>&Sx>!q;zKkD0&sNki|elXH*WRQ|1!_x{Km_B7f2IXmvW@#k@$ck9ael1HKZ
z>*D%$#>w=@ZC<y2hh^M3kNJBdYu46X+y3$Takg!B|E}#3D&A{h_r4xHYZg2^^4{T-
zGanYbnJr_uckh|i%lqbqU+Zz-E4;b>tGazc&<n+)h8Z@WY6=5>zU;lIdfZNVzSQf^
zr$I+Ho6p!;y73MBGjF?6(_`nn`)V&O*Za7(VhLmMvRjh;G5hA6(Vq5q#m`T-zI<@o
zdPV*Cj;g8(-L2(C#%_yK=llw^-MRRe;oe!__|LO_ns;LUeha(gb$`O@ivKq)^bgL~
zEw$9H7P@YCbMvupA?fq%k}GDW$2<?(JkNB)nb$Lo_J4IxdCrmEytl!oA%;Cz`m9u9
z*13<C=OdMS=6#*>NqGI{$&>daKeumx?UO$9^<KH^S;60BUT&Ued$qr$blT2eSHjNB
ziqqX!w6-$N^5xTxlV|@WO`W}S;~np>-!lLIx^rOT{Qcis?bZwV{4FwGzx2qOrSdNi
zzTpo)9kHgWdi8QWH=T9tmk-RDSZert$@aAVS<R=XH-kp-5<PEqy;i6Wx%2SRSEaSj
zbqs5-r4@c_eQcAI-I>b6KDk_H*}I!x5@yZV_vl%)+}df+g-%;Z$oRzYFO$<r&dR(d
z<jq@AWEA%J&KlY7mD!>GXLqGHX0NdipI`I)wm5%S_3F(3ziv4E{dslH>J<`}&(7CN
z-T&|;eBO?~ACn4<*F_ciytTW%|M_06c{6JJ=f=mqRRkS7Q@n4_L-~nwFO^*BSq563
zD6P)7{ZZD($m!dg-0xlK%doURKXtQ>^SL=k&uv&ARrAe7f0{+%qbD~wR#(i+6urA=
zp>OS{1IF@4U#)%EoBr#_>Uqg4=O2A_b=K;`&1Zf7saBbuI~DWh#-E!zrRqz~4xBew
z`|r=6org}&-)?AUdHm6n+lPN<Tvhk?nJ4GBRZ=|eobfr!f}nbxZR}P$KdYa7v;MPX
zmAqX-pXt)XT%KuGulcsP`Q^mM*zPQ~tg?`tJU{!@$31iA8`?gVd_J>h<w|q4?Rosw
zkA)#a%jr4ukGK^+o%y)ZQakxq&c`+3y?gi6omb|cZ&+$7xw^f3soLW!5{qra<Ifvh
zHeUR8>;A?+l|@nSB_Dq&cq;vP@AoHNH@Wv0iRBetQ@O{tM>^-K&PKZxmko9vt2*Cv
z<HqJ&0_$#Qw5hLidoT0()yvt>B#-d%&&Zjw@knsZ)u#nnGcWV|+=<vDcjf0z=H6)=
zBfhTOI&D|a%ERJ^!)<5mFtpluN?rW$;mc_ozk2W4eC3)<O?KX=y=o?++xumz4;gP`
z3uivPOJ?Jh#V2<@dG&PVX8)&?yL(NJe>sy={Wj;od~x+zN3Z;unO^hiy#4Pq`Kq;M
zKY4;z|C#k(`px}fzhhhbZ9jZ?a&5*gnW}*B-Sc<UhwH0nAAdB{?Bii(HU7zklZ@|4
zy=y(OzVgwzNzU<xNjt7}TvdxReKM=&Q_tGha~<auJ`3gVzkV%p&BNM@!8XYTXXafC
zE2!KYSNQs>`u`bf>u*NXp4Iky|3so%uDG-_`to5zKe-=1@un}HMjigWX#I{mb2O*f
z{K)06W8V2)>bLRd^vu2g{@9q7T4p`D#l3EZ)#odxy#0Egc3+Q?v7bF(Dyi5;>b%+I
z^!HcP;*yJec`JM8zKmScz1Y$w!NX=v(~+K!$Im!^%6i9m0Ca}Vc^Cas$-`GS?Q4zn
zo?qLudi~#(pM{RAr}^ryKPMXQU(0>E>f0{0XFXBJ5=_76bP9*x*>$h#T;TF@xtNW`
zUkZY!*S`8Q$5p3%S^MR03FZ&Zx2*j6+4x&}s%`zhPRYlYw|%+xVTSS7M_1Aew-%qV
zJ9i*l=Xc=hn2ldDCb{R`mztcNb;5n4@tVo$_YX6xahrK5@t*mb5b;d%{p#}lr&ksq
z37#lnD7B~J?9t8cz5WkFcz0UW&Xf1C+1e>s9cTIM<mNEL;=di?*+rM;AM&j0y;}YE
z+R>BQXJ0Q-^Y7a!*QZvtc3$0=Q+Afkvo;^OnsV>sSLqei=WLSId*2CH{<ArIF=Suu
zgA?M1n}2)Vk+Lg2SLAn9=JeImtAFyePk-(qw>40H;}z93{=KH3zg+up?7w~W_jfAM
z(?U4^`;~saU|`_Dz-r9HEBN^T_4E)o2gj_<jT<E;4R)m!xjxZ<=XHLsze~!!RqI|^
z{r;^q{dd)l_ZF3Up2qsc>gwgcnS~eg7yq)Wy5apJ<JYm3s`q2EY;(Vz{a$D1ar)o7
z%b%C*E5CKSwCG)uTZx?YZhzgy?{czi<mX<qC||Rspk`(9otL+2|2&^_dvZqE((uo|
z>%Lb1tO&0(F8ldx{@LB%JI~uPo{u^8KI7_TtHsM$KOao@%YOLzpzHP1CqA>({%9`w
zS<n~xOV%&`ypP-cuXmQWpIq_u&`eQY`JDHz6;H1eJUe_o^4o*Q2U%zD|J%s<^6(wE
z?t+6qK1_dfj{oL1)9JTj#FxHK{dws#%hk*0-P?aWcy;HquWfDF^U2QhzaRX5u3+wb
zxm`Pp-Cq~aw@q`}{Ng^>^Sfo$W#4y9pWggzx&Jo}d0#%eN&mynKbvlI{Bzqp>m%Ra
zpZMJ6#{Wy!-}cX$^82OdjpOglt=ji%@r~b`)R$Y9-Zz|g^Rw$|&-b5a{+@09{VQLo
zP2b&v&+_XNW~FRfvUOc}w@!^%b>92)GT#Hfzp41WW=|UXZofRc3G+(Vn`!S`_x|qv
zxswBLw-)Q)*kyI&XUfyXOY`2$GJ77+bpL_-{nrx<-yPn4dV7Aj`tILxCujVfxaarW
zidv?5PcMFsuuYHoKkv}f<YlwWt#|pIpKaxS?9Q=kR}apaH~Y+->eAXb>F3{BU9R%q
zQd5v6QJ<B5+`hPech$2s&;6<b_Sx=uvEAN4ab|+_OUF_+pY=RF>gnIYzr8*`b>HI;
z2IU^M6Yaj6|DXB$`<!*PtE**d?^WMB`S<6fVD_up_h0FKbMrQ1H~*+K?Ot5e;+o>`
zM*T0Ief<+_yLaE?JD(@+xoMyN=DqFy<9^xuvd@c|U#zM5wJ!W;!N)E7U!N5IIJWco
zJ=-&nerxP9Hd+4r-c;+|<$Jayq*w9DmG!;nu%3SRlkn~7w`@OJ?1|j_`y2bRc4HNV
zJ9BO=`cgCPK!)C=UlWzN-+K1Xp0TrL<?Y)wCd+?X`k%M1{=>Dre5<=&oK?=+uOEud
z@(n7h0&Jh3GLe6OX8ZXy1+kwG%-#0*sa@CVos(a`xBTvt|K+6Y)8~8UJKOJ%zhAlB
zbp5;MLhoMueJT6uT>I>wXH3G6<#kMdKX3W>2S0Y@%m0lu;aA%~+xq9tbT_+-+WVPX
zm+$<x>gBUG{^|3?Lj2|TSC(jq|2_LZHl?Yj;FF{P?<L-8iyuG!{k;C)bN&0Z-=Dp|
zH9OKM?bhUf%gf^aRrl!Y?{AwvfBk>%to5ZkWXjvmE`9gj>-6TI|9-!}eDBMTTdUjl
zOuulN|9rgs{KtB|7niXg-+t<O_Osn}|NrmX|HQVNd*2@U&nfQvZY%Hq|E4$p-F)NA
z_KzZ;&U^ark^a9&r}OK7-`4;CbN>IIIbXi~pJ&&2f8U<-|DXT=H(&q%xBUNQKes>F
zulD41m4373zrEk~Z|(l@>v3d#dV21)Cm{K6cWo=~o~}(*zkk2E{HW^xcl<pLN95iJ
zt^NF9fsE~oEoo^crZ%6x&-=FeW!jq!@?JK^|0D1Eyx2W^_Wz{Se9xM_*``;2Ex%N5
z_V3&;y@$)~@4PChd-d(M<X!nm3IFy#`5QQ+vi8%tJ;@a^@;SNpTAxq+TgE<l^ZSWE
z=i0vh%vr&7um1g{@5WWv{}lXs{##;xx%F4u|5w6ypKYG``osEnhUw~u_4hxz_qVb0
zWRqNj@si)7*Kf}ISziCWd^`KqombA!*|~qSc5cz#)#Wp8YU}P{pZ_abc6ZgiCu#Ef
zeE$S0H!s{<Rw>tOV{z}nlP|*I_hiNEO3&ov9^HDc^k2ol_3?jSotFRiQ2ySF^iSIF
zyLR)|Yev1Fm0t9#^P_xWaa{G{pSAvbme17Q{yMz4BKq*z${$m=Z_SVW|LW=7ADiue
zZ`QB>q+VYnX*+**?dN@)pL5G)zO7zTHoqeH@V$j?;=w;JZ%<oRd2zSj`#pc>hwj~!
zd+x!UlP?$lZYdU&sgbQ^oM*C9*7&RYjeGMZ_EayK7xk;=$;%yXmGiz>+Pvca`RTCF
zU-ymAZ`fMamdM8h@O_It^zqaqsp#mZFSlI1_cAm8)r)g_{`qfyKQ8>$SseaF)V%oD
z)bgVr{bMS_W1dIl-z(4kd-3`7GsZvfO|(A2o_Ths`|H~BxXnNAc+Qhs@-R*QUMBDN
z<OS8v_g9xcz7u#~E^5b%{(0w4uKD!vSKmi7_rvVZ-@FUAo^&$uU*k@%>+@GTo?ZHF
zVsWJ1uI?q_r&-jm|NM4#)_I=amoLBJS+#tgo%_DcKOSh^uX;6S=Kf8`?aR+AXwKUC
zFzEM(9rm(i`?9MH-0#VKp8eixX2qE+>pz*?`}UwBiranu?jJ8-7N`9?wQs-nzvc7F
z_q*?_xB2{g{inAJtIO6d?US2hT5s>ZPvLG&rA_{?iZ=_{i>>NY*V(_#@PBRZcK80t
zzrU+5&OW_2?Y;G`;xF#!^|IM)YwsI=t_->yR<onh%6jWl`5Cbbe#RVXH4c&WxBGSN
z*{3gmw!AyrVB>z{=Z{HK@84ZrSt)6J=)GU|r=s57HJ@!)|GcvH>)%_~e;=-2{XXCQ
zeQ0`m*6y#XdDcy=e|FY9nr(g@+w%UlY8CnVbLUOpTkop>b@%)Jy36bBCr3WDJma~4
z)zih_>*{8HyVzv;w)6bK<@Z1CxqSH#f9&&l`>N~Df7o~UNqG6I_d71Br>pO)uD;vL
ze(87ICzBaICd(^ja_)cPKNGm4{Y-c1y6GQScb{96VrBlj;@O&lemU!(XAhmf`?2-0
z_k5}Artjx0G-sYA`sa<|<#lIX-}>{T;_%9kMlY|v4R(LsV>vhQv)b(BZ+iE4UinmZ
zX3tE=e^)H4b|0!e{pa+Co;_!HZcVpx|L^?v{2iH$c#F~x8TPSiGlb=4&9~cnW>ud5
zE191Q&e-1jce>%a{4<m5#cKa|zxn;|-P_;0!#_W?I$YfH$>!vDp4#`mvU1DM@kGiM
zUw-ajbLZp5vp%)InJ+i4OSZCl>wEX`@9q@0?3a(HxBpmhdFQ%*qm$dpueKX2&+s?e
zu`aw)viQk@zXj(WOy+-PQlI+G{`T!sp}pIGKeL{^YwMLSD^ufkT&paY`~L6B;;_n^
zO|{cMoSm6_ea_W;DaEs*pRQl`dhe}n{_jRlF4dXT&-_?5y)wP}(ED%lPk%?Acx)8C
z?fZr1pGTTs&r;*AyzKA)e)cWBe*Ut3Kj$aSeQ&=1@t*&0KHE;JeD<a1+&Qa#-_nl1
znH>4_PWrEp+H;C4^6C?edRDSOW+~GU-aqU58%u2)UbV}m>1nd_FPpCW`!MakWT{P7
z@ul|or<rpPo}Fu({O+aC`B!seci$HD+b{P`uGD1f%_>WYd2HoBKNQ)T@0@w?sQYAd
z=JVP0Mmy3!r^!E!*PF6&d-cad8L_+5FFbEQm7eGK{{6l0yJy7Je*DC8_q)@+e-9?M
z|G05w?tHu2^I@l7H@pA)_E#k9`~Mf;@7K21v2C7b{qo^eN859HKfh%CE4VD5SN^6W
zFYMKAd5J?Zx1Lp$EiZo6xjORWgXWjvG2cF&ttww$z32DQ>((DFYTujBR{!h%F2C&g
z*?D)e>Z|3~o_%?DwG{i=_cbQ>cmI6$<mI!L>HO-=vn@WK{4nR|<LA$Rvdp!yKF{yw
zz4s8PSbE>Me(&bEuMeNSj12y5`DOL<=lACS%=_n?GVS@j()Uk~nwF`R`rXeCkDvQ{
z{@l&`?{2p@$W4hTyjZp;W`lfN9N(wq-yia>t8xG1#l7A7bKl<nw%6_L#^!tZ^>%!k
z={&pk`PI*Qo4&l;z0CiKVfm}?zh+)PeC~10`HZtK4?hgA+&AyA`tRf?@o{g;zyC4(
zUjOBH`MF}Q=R3`oEn7M-{n_$=-fwNESKqJywd?&Ynf=^R0dK$GniEs-OYQnS_iW?G
z@Bgm;^OnCypV4^9Yre;`XK(fX@NG}UVe{$t)N8WSX0tvv%&y9Kxciy)qv+SMuU@SD
z-S@Kg$?fypPamIs*jk%z${RO1ezUE+TFiAL_nPWw>#iAX|GMt&k+plY*ZsYDwf5D#
z+dnhxPF~zs`Y*NMSbW*dh5xVpKFfPc^vGkqBd7a!&eyltt9@?sBG%d7_m9WU`mK81
z{rsx=r@xf0f0w=*+(<U-YrnSlR&2!=>p6DCA6^zZ);!z$)BdEtfQP<B@#~lUeXd3y
zS7n~Pc<832-`%)Msrix*m#hDjxtG2Dzh?fjoC()nesewlGS>L=EX%Ybr}L*(9$fiV
zr}X)m{~Wt6>)o!p{_e({S<`0jSa;X<mfvyzGjq-@KmT%WZ2Z;j-+yR6t=)eo`0n@P
zzOnl+Ew;42+jlM1FUG#neO{=|yxjfiJAC}sKIhE0)1Bk&tuMUp=eno!j-J`D|NDcg
z`d7E>n>J=h@rsyCsV{#iYyW)q<>JX(#n;t5tnyF$B4gUK|Mi#Mmy2&tw#mI#bMf=S
z!!K6;p3yoxt~e^3{r$_2XXZYfvs3<m<ejr~@1LKyFL~4F>aFMBoGY>YT%7)V_qN9x
z|34Yb|MfThS^D?g*R#ZOzy8haeS7=r$7;Q~wy)3IGoF`uX1TigXT`Uys%__Y?adQk
z_xw@%zMqS$-sP<SYf*mf{=Wk|0+QRyw>~Y&IC$h*dahW^%ZHynx;DLfGwI=G`TKHF
z$-ifXZ@0_-9#=Vga`QX;iSu%@c3JJ2yGQu($%E&k{v~O}|4vWK+SH$rUcS}x%Rc42
z(&gWLYtQA_?mSbg@;}Ms)i<B{C)dBL*T4Tg>gn&@cl5%KrhhhlrSsmV@!#JqTYs+m
zn^)lYo>{Lr%x3O=o$BcMbLtlHEGeJAtGvv2^6tNloEM#iK4r!gJmsH$#(4SPV*a(2
zce0Lu`Dix(PG5emY5mceqG#n~a^$Xiw9gd1oBruy@vQ6L?{sHAd_42#kIV}_?{+V%
z7m=U2b=UIRxz7(f))?(LcUh7DNW9VGzkTg|PZj>%{QK@krOX!R{f8F+IaOaIU(dAq
zzWcoT&#!(~zqFH^fAV=*8q3QKTPr@Ud_Q+)@BfQ`PL=<TZ!Qe9(7&|D>IGBQPMz6y
zQIB5*SxD@UjP*Zv=iJBbYT{=)<7=NRHa!=6vA|%?+?B;|o-91P`t|Gc&#oG*yK*io
zExX9*-KBX~E{pexn@zv9(D~1i7vF78?l`Tr|FO~aiTQfB-ptNEySa)}qVnK3fdYd+
z?%!r#|M@KFd*8~rfBQePJbUl(zPzrwJgz?e?Dp%qg})Z?=*>I1by}5a`|^uAbLRYX
zY~OAeRsHnv{-6E^icvl%jvuHfs(LxKa{k?)Kja;&f5q*Nv8nYh@2`J$_HE?bg@?b@
zE{QvvckaxyXMe-XGxcuPSh<^r^S|ZY*3S3yi@~0#eU`KSaLIrC^5$w!^&NfN`u9KQ
z{5n3r;rn&#X>#nD#oV?vHa{OUy*ejfSp3hp_WgF|Z~qq0yj=d9`LYxL+od+WD<9{d
zVZHU($>J~H+kQP`OY5^6;`OEHUAwXCrmb<@JnxU6n3w<8*yaAbdfV@o!{>LueCfFJ
z%+%IDCO38}^VdIKQ~vWu(WdNqqUN^0()Spt&+~t9yozb}_xt-didHSpti4|F<xE*w
z+%LYfS$osZ%3iE_R{q-Vb5+^-oqro=dVkH$JLj;g_3rWY(_26NI(F^J?Cx;+yX@je
zPJaJW@OI(DOQ#*>GN%8FeDmkd#$Ct1yq^5^;K|3&?;hIT-q-vv-1x~$<NGyxR!^3F
z>)pGXqg&oK`)O=px1o5})7Zk@e@@Q#Pq1s;V}I|Wn`wR3`=~7WJ6U{Zdu~3Kcm26<
z_TCG7pPl(I_r2uDOF{d8GaI)XMQ1fE)SkP1Yr)*Wc6+O|Bb!gTe1F)<uP&dn@AZ=x
zD~q38b^N{D{MN<J|1Y-8lYKYs%oR29yXsNTXZz>ATXVK2@7S4BKKVaRzKrHhuRG86
z{=!$|`+vT;&Ay|z|I@l1i);Qox18UgZgBtQm%slme7qNGoByNci$QhDn?3ED0_<w9
z&%8Y6@57Yn<0nh=*X`c>n_2iX4@YZwdV`ey>gDW*Eq{D5GKu;A>Tb`Av~!gYql3@;
zRNPE>p7HLYaZ1L)g4$d6|E!w#+3I!NNz?m#ZERP(`*Y@q^6t;7o2~vB=dZuH>BkqN
zE$@ErbG`Scb8o+x-tzC4{cPqRs9~y%-?R9h`g^}US$36wzEu35<$t&4*WHK4_8rlw
zi#{&7c3k@2oRja<O#i>*_vv1#dt`b3y-x+N5}wE86d4u0EKaLWz5lO-e~oNa#`2jp
zll$kZd+^&E??~7KlAFKhvgtdH<?;M)z1E+zsoG%r^~vOk{BGr8lDp1moj3mc@zSLE
z#&4eg^w?KEWAmeD|0?dd^SN1{|H)G3f1vvD->0AdE&Hy=s;;kp{ok{9SD$^+E8jHv
z*zB2Ean&i8PCH88>)dW{z?3^9(Y7aCZ-&3g3Nz!qZ?2qqIkTug>Ac6Wbywa^+12ke
zf&HBIGV|iBXDMaZU#6zr-M8*>^xS#Q?_;iCye+@>_ssrt$$o!cS?d2iQ(|{>=X%S{
zXU$LF`POziGjHntUHk0*S3Jo$ds8+ybbI)}BcD0Xs9$)$$ZFoY&vk3>Ex%fwZnwYg
zkzV)wpI^=%J-)iH@3mD-`rX!W`J8v(*q=?@pzx;0Dk^K9&XxAVpLYuQ|IR!pb2EGU
z|C{BV+25YEEO-3=Xrljn;lB0RGtUG$?@RD|e);zNUFY@g&$}`={PelHPjlygU(`CC
zd-~*^KTF)s-mZOh^8B8im({I*p1WKyvo-j2^T&tQmreg4t@vj#|G*>8HTRZo`&un_
z&$^ZWdg-q@KPtY8KMZ~ClXY+1;g`?%eE9jq;UD+UUyHXsD>tqGa$A1J+{&ZU2Kxg(
zuZ$JDRIR2vr$_4Byn^q1_V?f1Rj#r7W_DkO|Lz?H-K}T37PA+h>H7ZSgKXuZuXENd
zpLWm3?)$u&lBnlF&t3BUpFd6b^W{okO;y~TBk7-QgJs_&yYJY!f9JV5Uw^Xv;;hKu
zGrw|qk=iMr`07f9{9mED?6$RbAN}6c{L$90YkfG+_Wi#DDKGaPetf9v#?NO#zaQEB
z`gXD4`?n9O*SA^<SH3$t_w%IU`|~94ssEXCI$QtA+kM$PJNqlrmR0|(^sm_y{QCV_
zbK4(x^{k$Fzi)1S>wEWmhX3>DdvBS4{^kDZ*_;Zy#yX~Zff8q}Z`hgMKjr*5cgeww
zzyCh1d*<fdXKy>da>LdupSS2oeUEjo{?4AJH<$U6b@7ax5-GjfSI@3~{QU95`m~R3
zr(f=Sy?WRGo4=pS%&L5M*~ZW8Ud^HH&)Cuq&NH>$@*#HlbpO9Ii%q7dg;#BzJ30Gr
zoZY>1%fFwjnKkp*yzcIJGl_j$=e0lYp7z<}-z%H?dHxB1Sw8VuR-P}Kwb)UvcEWyB
zQ{G3`;<`0<H5b1c)x3Q<OaEr&E%CL#*Dc=rlX>z&w&N@ME=Cq=pI!8Ab${A%;o7I2
zX>4cS#lDT}PdZ=u?cd2?HdX(3I@^7Zt^NPu9mj0%zcVizKfi0Vy|j8(@b7=dmv`-Y
z-g4SKPTt?Xf8G11FO5IH_;+r#zs>vuuQ<P0PyMdDd}nA{)sN@DPr38oO3bs^W3%7x
z-ny61W}Buz{+amvkg5FJv+^@|-aegnfMu7TJ$u{fn;(n+eOdeE-p#GHXG?2$o@lmD
z%e!}a#*d86&pPMv?@ce4-5<Gf@yQp`yUmWz%eepP%igMWdmomSZgQ`@^=fz8x;;NH
zfA_JwH}ibo9NGK7)Bnu^h024s!XMTp?Ops!wrc+iTX){aFRlLG5w?vvfAr+(Gm#f%
z<!q-k7W=>VdiIU|m_wt2-m%!+K%3o{=UtVVKFeb7mk()9_d4IT_}~BPb==YVQhC_h
zxS9!i$Hn7hL)O<kEPA#^`}fz@#r{tYpN}lLVHcD9diSosD?k686RTG9`%(V;z<Zx3
zx9_%*vzuJrFMMA8g8zZtS7NTOEw{ZN8Wk|ta^>FTvF(S=PkoV9yZ(83{<pVpt*oop
z?LK+`-+?WfTf6<|iPd~rqo?wE;gbCLs`89`;<M_CUrbp4d)?yu*1P|nOcj%zmG1x9
zV&1Wrk8}T>ke|=fv;XIpwM*X@FWLHj#XRG(@8^5IeR`-+_v>qkgkAcx%a7OfJ+H4X
z0@bNA)i1oCyX*e-f|r?&U%$NlwoQLtXx((%N5A9V&i<Vy|Nbq1&uNzAH~tp86b+nr
z`OP=pIdlK6Yj!sm?0Ubn?d?Ws@h!8jS-k#Y`RRJz|I<-F3k-~Zt;>>_Z*3+%&+WST
zvTe#U<c^mc?#Z&5e0h5wU+%ZJwx2Gj$(_w!yTAT?2EQEp;qS#y55HU}!;^1+zVo@T
zMHSOM*%PbztCknsZU4+U-~anc_35%Zu6(q3SiZd0#-e)GcIHn@j(@!W?|{OL%iK%0
z8N~4IF<Eb45muEwH*og#eLLs7r@iwun}6=)jMeS7&C4x!M;$huWnOD-ck|`ZlPp)Y
z^Z%6G{9)xj{rcf2GV{KaoG||Vt!&=^=*07JcOTxH7g~4p?XxZA&n<t(e-nODe#Dx~
zR?_we`{eWLQS}+dmw%s$Ec|36eD<vl-?nR&yJSC_mj7lpZsoh6ley&R{DWJ*e70G&
zGvSYst@WIFeVdJI>whdheP);KGn+13<6@aVPj>a2?-LcDmlpPY^6R}9Ym9d9Eo<9c
z{`}?4tc<j(;tb*2)?3qmoj(`(H2jWnxz*n1!Z-f@{+PGcU{1{c-<<d5=h>vrtb6ou
z&b;Q^56`@m4!&)_v3B*|?f=y$7dK|UJ6L-#?vhP?aqN1%3%hRFUb?;Y(Tll{?QdP3
z_wDZP{k8{{-@jUS_9Xk;{&T`_tRFo-zi_4glhge(5BpEqK3i}8Jhn=O{MQ!qI=}Dv
z{>k>eWd8GWziOE5uL!>=zqFgLI(^4Cx9q-aGj2Vc%DwI0)-x`ff7k7(__*Qo>c1D?
zwm!V~r;#&JA^5S3&*9T)=O&8PmY-QPd-A+%G1rZ1s&3T0n)BqN#lN|2&#e#bn{WFz
z-*%7n1L>!SOYeR@GvRS{%XaH~GyC1P+uJ?wn0@QbS%diV>>m%l%+0;F`p*}cuk+8!
zpS9b1zhB+p{=_eqmHzWrrn_zX`D|C7f0p{Zf8ULM|4>VRxA*twn^&t3-TmjD!oyjj
z!MO0ls~=Y@B5iFY@=De0f1jHneJ*F0-Mp8J*A_kek=p!r?)UeVd!`?F-7hM>^5;Cm
z&6kf$$IU&nsxSTd?&GIF&6MZaZe_IR*S`B_J|DaM@8;)&FFv2C`BG5(?&<B>zh?e9
zGw-kdXU-?GpY_--SHDk~cV^YI{yeu=bLL&%H?O!fuKwH}$+s_c>Mcs&zx>lTf8LKd
z=Jg3xhRsV&yw&b||Jw90{n(pxCgmaNVSIDGPg?r<+uSP`gJv&WHe2w?!JEz3XW#t0
zYF=^Jyn>Hg!+W>e?~OWl=Gv8mbIz@3zF28>dF!5-@9sZ;obfB0+JF3^@BPwWGmo>*
zJy#;TxBRnzUfK^ooB0m*jPH{S-uHZ0yK!fYar5%$56@mS_pASP=6&&${^|P*(=vV}
z*qvQn{e8B*!66>m7l~gM_)K6gv%B}@?8$F)uI#=XId8G#$IEv;^(5APUH3fp=`X%N
zX&+7ce{+0W_vEWV%zLl9QCYvPq(nbISZeq0YR<ic>mRqp%ZWcJpPu0N8Qd6(wKcZQ
zo}O9v?DG8QHB6s5pUnMukLB~cv*mm4+g8r}61#l<znjM&mu!3eVs0?|<Hw<opGLiZ
zqg?&C@-w>|hg9AMxwhp8Q-VLUd|j!YFWxWrY5DtEe9!A@CYXJG`1a|;=e(bm%-dsY
zv)ZPA%|AK6{c`85)8n>0JN)wLp{Fg&560TnJpVZ<IDWa^|KHQi@1Hqyc;#24ALmNW
zo?rey!>;&Tv0dX&mQUv_|Nd*e{C#)(`!j2Pe%ySV{q2m>^q|+xCr_}>U3ZqdY?}Bv
zo_`<sc_tsMI(%q%M)LKKubvvY%btCBmHp?e=&QEwwuR@q=JDUFyW_HNU${+Q&1>zx
z|BGM9?X3=dykO4Who1}Ge?2MtdFG*SE??fFpC7GkUZ(G}EHya3CjE2Khns&&fB*bk
z!}Nasftvcg(FbMT%N%jPef46W-}5*9_xnVzf1Wfy&RG4_$Jfn!&MvL{&YqV3Mxo!e
zYR9Lx?swdu&+Xg1JF0B?`wGh&-}&3$*A%aOUYoxE)VFyrY>U4Izpl)ZEB@H4?aTM+
zMdJB`M_0GiysRzQuy<v(U$vF}`>S@9#k=$MBx|34+;Z--?Azy-A8VNYvV5|uT&_0%
zUiGwD=c~ou%~YQ6bAGPzEpgqyr{wP)@2TAW?s<%)^{)Ew?8g=?R%APJSYB`IJhR`=
zs@dgp)@E1Vc_=q)`>CDXk{>@^PP<=oznlM4s+l~m-@f-AuWMe}z0I^UJ-e<TcDs71
z-)rOf`@UY$?rS&uJ@0gK`JQLn#A5k>E_!<6(a&|SzN+_{%c;lko!2{G{|Ma7TfWEr
z-r9Fpi)?<$`pvhjsQt9^@bk-i_8D7LFTcNMfy{fpYB!tr|IQzbu<G62xHm#~wZB=+
z_t@FJ-P7-{sfhCTeSJ$u<8tM#Cl%Ft>wmwf{A#NmSGRfDz4EZxJ5SHPXk1-?{o8EK
z+w&r~f7kGzZT$4EzkGc9uCn%*rnlG3%(P!0Y4mZ$^7LoX(=AWkE(N*huIJtN{`=Eo
z>z}MVnO?Vl_N!}mPsXO)>EHhTqD+19+q+jk-j+Q7&HmsUwl_cIW~uHykvcgy{_~b+
z71F!?mVIBczx>JL+gHE8laGz7Rg6o2WMuy}&);b6@$H}1S^R!;>9DN-{2SJb-hTRc
z(du&Pmzo0O%RkrMUHSRhnwsKw>7O>GeT$O;Rh2XR72bC|{(IGYoBp2fyKFa4<6Ko~
z<-gs&HfzS2z}&PA&&}*#zdZfNZo9ofkMPWoFL%ei{BH3xLGMbul=zd`*0aC276?C&
zec^7L?zaE*j{iq?cFV=dzS(KySo(VNwEaAlKQBt&Ib*W^-qRNwYB$$C(KDXB^K;~y
zGShUnIhEfRoMt=xF!A|e*{9XlBIo-b5PtEU?fQ#Y?p2GcuUBLie0sU~B<tsg`Ml|E
zYxaFz_p*0w`CB;)jq2abk0&u19BbM2{?-CFt1TwBd}V$5G1ar}Kb<!HwEo*gwNHoc
z^=B_}{`~0V@=D8j$9}xnbkTbLy!20Nm%dZJd}sTL>UF;#DA@fjC|kbVS?-3-JB|BM
zuR`z5QIM5;nyEg|Kf#XieSi7tui(l-iYGnqmEGj|dnJE-u_#XKpMS${>&}mD-u{#K
z|7}d<I;LUcd{(+?cI{`q25z(GNoS89cE4`E?A>HJ_LrOa?JaG4mVZCJBm4DP)qFO)
zy;6@Z&DPz0sp3{W=e~avp3c7Y<njFUqrT_oI8SeV*#Az8{po_5U!v;Q_g&G}*L(5v
z^ucc}r!(JAwS+Xt_t*#Sez))Ey2^rsd#eAwKfarza?;V6!e<W7u1>vwKmU{U{<)6x
z-ki9&yzVo5o26TtL~);-S-D|O-It)7&yF0r*!*g0`MW;%IKEl-zb%{dlir&zw*2?(
zQTF;-<~L$C{XB8-N7cJCOV7{zSzx>W_p_^enWvxGZZUuE-c$D<7v<l7ESUf2?d_+B
zK_zj&4dZ+H^>UAzE5Cp0bZh^-_f5?8%iB*qwldF_^SJKcbMO1}{eK%j9_2W5q2XBM
z>3fHFW}6?+`=^k<Pa*cL_vZ`N<&pvR8LoGA!)HFbqbzez*4PHr)Um0p|FO`rXv62X
zf#&C`&dsYTJG1%Gvh;8AC%^QB?%P?zzx?O3Tf+Nl*P7~sGPPVS)8Bt9q=T#PC#1E%
z_uq1^^!$6jVm`T9i|w7tJKWb9Zr%MQ&N#n5;g*WXId_E<tCvNtu|M=JEl&RTVc)a0
zPhK9J`S|Hf>t{8_x4(PXKL0Lr>&cf|chJP3?V*nsW-tC(XOs5f(nn+S(tQbgEN!LB
z1>gOtI98p0#d>G@_rJF)o>*S0Iu<$Kf5Ci*{pLTe{(gQxe#6%%%db_P-;#Z<qkUS{
z)cNziSkB#Tbp6kqiT7eNcUV3L&&WS+Vv|ZJs4mdEE|u3>bJ6JVzb{)9;%vWu@w1uB
z`@U}O^L$zJ&p$eA+>N8M>$BwL?i<_Y3)pAd-Ctj8B5C`6j=ZgUP4+{p#eDC5@}B){
zx_tZAnzJ+iDF0QyseFFow-f&^e?DEw^m*>LcMes*t~g4axtzr-|7Oo}sd?_x#B$bF
zZtk;)wEh(r`+eRA+uz^V*=`=zS^iR8?Xa>uKi|1KtKRRC{Is`SEGI6mP5;lU50`hD
zGk=nKnCEYF@k~?N%j)_qAJ(qSbSzH&da=l=IQ8DYC-W<JCYZ3#k88VTEB_?(&CVYu
zWuK->rSIG7{_6ZQ`J07Rb@lTc_Uo_wdhfQvy8WiMQP=Ob=lk+j$Gy5b@8wIof9Fc_
z*?sat)tlef`~l5ubWOOokTYGvcI(5B<>#3fm(TrouXDd~)}K3bD<A&2wES4<S?lx{
zXB*O3?W@i-?e)I9`SIy?HS?b-6-_k{pISTjZ!fO87b++I#DDJPy|M;X*Z&-}d)NHh
z=lYjU<NLqTKij@ub6$Od`i1wizuUi`S*|M~w>&P@_Tsr!i&rMTpJwZ1DffMDZOtCX
z^0=!fADwO7Zg1ezvS8tspQ%PB@>SO#{zxn~I(YYGj7^oqy7FaxZLfEIURnI;aqEu-
zwi|YSJ8Sj#)fbsxS^8`Letel&^T|;zrsh?JwYoQdne6*7=F_XvjEs-VR7$MP-goXy
zRhr$T^E}TtR~Ca?Ta7>Up4+}I*S&Z1e7*h4+n2v;$*=pqY=3!GTKe<YN2izD&fU8F
z>$;cQ|L;Cg6>;70)pG{!!=JavU*A{%YkB>yH`8{S>|ZRu`u9V-lBIv%hn~0}{l8l5
zO8o!B56W`hzqM+-DSheBs$&Od{(iUneV%@R&HeiSf5qqA_kVmweRA>VJvBe4U;p&!
zul^nHzn{`ypW6HDQThDxpTF44W?SwEwTtQVxvt&!ZuhR^7r*;ITmSFX`h9<{=hy#!
zYX9%C{iS#P-xJ>d@YJZ|-`OKo_o~T$^85cQ-~W(0_xr>8|G(D9*L|LSKjz-={(ry!
zSBn%JWnge%@N{tu5i5^8JLCQT`~Uym-~TgK{jl(vk9;h<_nUle&aZlM=>9+9o`;H8
zg{@DB^WQrpDsCTty{zT;8$<0IU-R;+cisE>{?oq+EW7tf|M_($xm0}P&Fa32^K<S0
zw;D;wp7M?VRk7&wteX~}=X%ez*PFige*FIxF=_jX#Q%P6eS0hJj_Ur3<uBebJbtfi
zZ&|tL{ZV<I>F@8y?R$3S#-rQXxw-qZ7tWt6Rre|n;*}j-zwaGf7k*E^;qz|pRh!-B
zmRru3k?@tB5_<St4BMVR2Iha)?fa`Pu~7D#(&2)tn;$G6Uj6ll_384h>tCOq&@BIL
zy-x7#S|jaqI=A?qHvg@a+xdUubB|*47kR&qtvqXYPc;45l`kJO<o)~JZ*r=%v(>-1
zuk%mMFL|T?ujBv!I=%njtMK@LFZ%y!yau&8_4n6R%K!VM|NqnJ`Tt(d-&ZMhFZ{`y
z!|N^nDZeSV+4nBoRPTiRnSa&g6Eg32?dFO5v*WM&jMlP+Mi$3a_0OK>=YHupzhb%l
z&X;eyzumdACGxZE$F(;t-wW@vEWiJ=a$!x`$yL?=*W8|5CHGr>|EuEZc5|0LytDi7
z<k#;vo;JT<c{Ab1wN1hNKkum5^3Ch_Yp(f{KlA*Vt984fL$?2G7FE{onf~jXZ{K#?
z)m6WCg`dAUQ<!(Xnf+e>9Y2Z=Jv|XS>$<$n*|Wdi)i=FVTrI`EIiXy0-iwvX*MEIk
z`0?DsFpc~)o2;nk84sWBEqLo`Tl?ih*@qOj*Q;x6=372XZ~J?;G}pg4tK6@@J3e=t
z<l3e0Y|fvV;mZHWYW+N`_vxQ(tIw6+fBCXDz1EJ=f5CnC_ddlR&(;;Kt^R+e{o{oy
ze!YEHs^)#L-T!*!$s?Edt(#o=<j!AzgW`^-56ic9yZZB{tJTI^?VD;o=knJxpJhH4
z@B3@}y?s}G*%!I*b7JcItGE94zu)&hcK5FR|L4r^xw-k-+@EvTS4PI9tw^+4Irmw(
zOl?|4^FD4rwY|GO*Qn0}*AL2{|K9&OYyQ_7{g>Yy{`)OzKkXiN_Vne=x4QYS7k@Oq
z|7YF4zl|F+7Cq=XesuD#{TzOB$BuK`a!A&eq=(yYy3F(WYw<JX&66f_t3BTL?DfwN
zd#~%Au-<6AI;w8z!=}|ccU%jfd2iz>7ykSE7SBvOaPGUzF6)mE73-Al#=iKGVDZPr
zuJXGDxOx6-Z|1$<!gmk8RDbv7*={pw@e=u%vNaV}`y=1ET%UdU@0xVb;MIptwg+D~
zR30weP&ubYIey2FirLFq)$d2Wa_^J<IIF$+?Bj&@54gqWF8`@qUt?tO@7d+;)ApVB
zt8SZr@9y8t=5bb2+AIEbmPpvD|D4x9TZ4V^bDK%~t=8MipWOZ*T>L)R+jy_Kqy9<e
z$t~s6=hu9{_xHgQ<J<GD{miIscYi%I_TT!0Ulv_4zH+)EJSO|E>m$?Y%gY~}nKLW0
zV)KvZHT$kzEuNl}oMj#S{D!7~d-(OQ>F?jiR0n@vn>Ne*^TR@$vun4!oIUT$=P$9*
z(UpY;b(Jv!*FVpC{MP3EnbQY<>?^(ZPWZff!55Z2<sVK+pWS`OPG-qV>BUd?mM=Pc
z`M=(xvo*iNe_pe;&$j*l*8bp@38!}$i2Ts_w)AYyxw?3p+WW~>XJ7o@($07L`@|~K
z-Im6OZ%T%&-*fUp@Nwn-_D@wa<{X|pkFPT9N5}H?^=Wq=Tjk%k)ia*|@tA#jSsd@}
z**Sj2A7v}ocYc2Ulf~{kOW1n}zHiktb1NkD=G7E9mOc-U`E*{!*vk03`|iJug@)pp
zZ+5XSTju+3g@0OH!SUARrnh>%=g)kZ*}Hk)47(qT%cT<6+ew^Dzvrtj{w7_C{pZ=%
zxwk7Ho$V}#&3kFboXyO$YqwOs_su2#>EVaZH~;jgyZ89bdG!xxgg@w&E!+9C@7QzM
zWe2ZaSzUhX&$UCP^ZzIx*O}pSKI-hAzm1(Ic#IYPXk~b2?|AY~_TIdH?pfT`aTfEg
z6@Gk__&oTw=}-6SpJ(P<hkbu={?CuEpLV$2+H?8Kh4AXfv2*YFAAhO-ZOzp3qh}@i
zzt}D>FZ*_4^QBp*Won<Dm)-Is<7}(_`JXKFYMJgWeX_@Y@@4Z?Z@usT{BqWHa^s)0
zGjjhqzUh6Qym@>2{eK5cG8y=!rp4VAk1G8B<&2U2y)!4+uXpfYFD=?}#qy=KwBF1)
zFZWK6|8ue0NXhz+?q2H)YU=j2ll}AGtvUPU@0T>ET{SheFDxuO`2F7ZaqmCXUjM{q
zQttUZ*C$T<d$HeUt!>f$%f)t#{s(q5&;CB|Qqztfm$thd|NN@*@bks(Gc_lJ7EeCC
zTs}AQ?8QT%p~K{yVxNnLEcd+pnYrWL)!mXMH(zen-(wYLYWG68SB~fXgUg>U7u;R{
zYTm_PbFS~p__e^Qa_gRbwR7js{E_mr%5BHhi3>~rPpo-%CidBlLjLrB^Y(vToRhuV
zdh7D%^S=IMk*j68r}#cXVEZh=UiGc>uFsK`kFS0dJy-Vry^0@aO16J1m9_VO{&?r#
zM$gUC7VJlEPoKa&-}txo?{DePHCNB!zWglq!_0+zr&{Mr#u&uy{9?Iz|EB!<v}elc
zzrGx-dGpGu_~(_&=AS=)WO+IF_{G#GY47<QXFgkIU+Z_?Ti^Kgm(|9fwa=&T+;=%W
zeeTcCoL_`L{Hr?N^!L5{T%P>vYul%XA3phgO@&>N(cwA$_x69k_wPW;3~p(g{Tcep
zKOW+Fziay1SKrEH*Xz%+iu(SrD5c5fg6#TpuWgK%rTLwoayv0SOm26^X8!xecXt2%
zvhw4WbIi}neeRcc<UjlE_m=nm&nuhe&fFSfusq#v)_%47|Nkuf^xk~#nV&3u^AEg=
zeN%4x^6LKiPyR%|nsq-$%5H}9{L)`L?PKQ0irIgz{ePyjKit-MyS+h+#8th?_Zs9R
z=CMtFIm^E0`pa_lpECb$n)^3j4EmhXXD2i7yxhERmzyj%Wm)S#dgT5)Rcsq~YS{hm
z?OW#w&trR9UB2auo$YirdEWHt`#!Hsy>c-0pVPiSH=d>++xH=DUDj{=Nz*x>eOaSj
z{CDT=`|~#2&3D+pIrjPAi|g;zM;Wy5pP!L!<M?OI<>z1Q{<>CNO|$zq=R?+aL+<nG
zY)|&{RQ)Xc&3w5@(PFRSA;)=F^tL^Eaj^Qh-M*W<-79t{7`^H&dbZ8{tMT{vv#)lZ
zzqWJr;&~q1t*h+b-K{BpcHu1NspZoS`qr4;H@=$YP`>!}%Y!FBvSnKQ-COg=^3U~m
zf6w3j_x;@DpG)l--+SHDEKPo8_t7`M<oy$u$l@1sA2#lJ8D4t6W1gLSY4UU9{HI6R
zi}UIeE}cm|`*qQ`k0#HR&VDpqb}lpididAB{_}RS-|u`D^jps6*SE7f_t+GCdb#}A
z<sTi(|8AZ(|ND{c^3SW?4u4$w{oq=IdGmz(_kI2xmv(fr@!q?iKdr4QUi9_fw=&!J
zn@@e--Zs1PPv>*t4=lg-e%yB<!RFref|^YmOmDi`{hWGjPL$q?GWps)w%aRBpImnS
z-IV|D0EbJ$v8DcZZS?Bw=3QI#e9QAwG4+pbU;eeOOuXv+!iRU3SC+o-wYS-S^YY}l
zdwt(7+?sB+{BL;L|IK@2)eYa@*!6eE)a^Te)P!xWOx&|lHqu6ZZ}q*I{pHh_o1U7z
z{nDYW`A<FX1)gpRzg*#OGrvLo!Cj7LwI|ud`}f^fy));a{2R%d3p(KWFWnjZ`-*>L
z)Li_!a_-5a_UC8Y8?0_UyE1lByX)sd!#caFU)RdE-dTL3xaQ`wEB9ahD|UY-|8~ax
z-xJ@b-qYKC`T1R||7X6N*Qb5h=Ug?vVtKs2IM4Ox8t?zDt|`v?9rpR`rg*g#_nubY
z19vDJzN^3Q`=0*Q?&74S=dI?QjO{quf3@eH;-k7}w+z32__X`x+{mjt%<B^-9F)7W
z=jg+<yD^`>EVx{1v2SkQ{`S>7SNB-E&Ni)o_atsY*%tL%S!wCJ&Yd~)U+nqCouBKz
zmD|PCzn@unU$lR6zR$YvOZxAnPk(NC%6)Qw{N0)B9>4s1F{SM1hv$~_4_p*JVf}P(
zfBsj$hi5IT^ee+|RF@f7mtFt({kQ)9UG-b${ES`q=HK((_6EfZ7rJd(w{44I-L6@3
zcBOnz=2jT){c~XX`>Lgn7s$S}UR|bd=P~^;_j<ln;rj|Ki?2=n`|I!58c;&o_Bch_
z+WK`(zunr$haWC{e_z5rR;-<0?XsoJdL6qPrO#8(bf16ebN&3Yv)14?%%0$fpZuPF
z`CYEacD?HQp5C?Pw&fR_UY+r@{U3Yb<Au0g_hkOs+U_f_Pl&lO;X#(bUVYQri&6f|
zo^PMu&o{XfGUZk5|J%5m@8!iP{`xJuKW{o|GXGxW$7jy>-htNrR8Iqq5Lp*|Te|%4
zwV=n3r?&5Td-&t&_V}kiZXcJf|J?uV?Yv58gZJ+|*U#%r`zOz}txNiSr8uuDD!{gO
zrZ4xU#O#lcg6~^zsyY4tdxBEh3lnbBb5B=uAHTmx>eA)sGdz!9R@=Yp^^=q{`*c>t
zR@v<iv*GVi-)da$<IDH%)0f3Hn?CP;x8uX-GrQf6A1rvc>CqzVnwR~1F5X(*W}kA8
zZ$@mE#Jcl+`R6157tL?@&iu@C&AtE6D*i;jSl-@jVr!yY{rTc&cJ=pt6ONxr;LG`|
z)FWTiyl+eXKjAYnJGkEL_^JAc`}&?;=_b?v>UFojTh{)KrE-?{+{?G7R{p-c=Vf->
zU$dWEz0KtJEvPb|K2LM*ap&kS277juKX_u-z53?&9o6Np_xv`U{{BIAOZee$c9WmS
zKD={z_m$OmPR{jL@K5;aC-?E<p76Ox5B@0n^5Ilmz1sgXzi)%4zAl#4n3P9W-uu(o
zIWhCmUe!Ovigo9%U2fLP3b&B2i!yMxE3Lj{U;IoavgSPB_1ZlamN6Ak0{qdZeU|Ty
zJ?$9vt5SVlf?xIeGso-JJu}(<OKz{`y>BkjPY*x*y}Nexo}0z{cfb2~8JwFhyuVbl
zy)w+A_}8&@#*2Tidwws&PX6b2<M-L&pU-~fn`d61kW_ZElk-8)_Xl5UqbARsW4FtH
z#}xtjH;0ASneP1dF6(!ARrWLU={<J4`1Lf{-)642ipsL=h(G%vlQ(_(p1P`!20!x)
ztNh--x#>P{>b00>FO2KoEja2vdrsZ->CJy;R?hp(DP!B{eos{HefYChQ0vC${OnuD
zeWLzsGMN*1?Ty0PombM9KARcy{o~z#2UIR3RXHax`BfKczggo`yt4Mm<HM$A_UT94
zjn!lLj<7GEZuaw>pYF^Tb}t{FbYCYZzb?D@(9Da*S4%1_JwT(ag7Un}=imD<`S#Q5
zYkP0?D92Zqm3!1>J)Bf)cK=_fU3JBSy!s!X=lDN(!TH5nB>vY=J%7Eub8c0i>^3)+
z;E(^j<>c3%jMc*a^1t5~Ud*pgh&kmX-rG5?YTnM8S9iZ3HQL<2@4Nf^>KE42Z^hh9
z=$q+y$90ALWb?&3+c)h^6aH!}zt6O^=v7M4=~vHl{<{1-cRYFD%_7L+9)<I^XL_pB
z%|C10zP0%0H``hFf6m(f{jcBO>AzW?RbP6aFwg7z$7jNRYo9k8cRvSBgvrdia&gYH
z!VR?#mu;{9eQ2e1{cq;vfSz2w`3JftbJ|tuw9lNK+-~{h+M$mZpFZ|}d-!%`>4len
z1l^m9_g7zBSbam;{O6C#rkaPrk9WQ6vD)`--KQPrmYkcozwG+_&w6XuzB;p`yy}_l
zd#`$v{h#0d*!eo}{+YRd^}lnT`M&?YqUoFZ{8tGj^Ad_TpPT$_rvKd@_n$wE_V-I3
zTvz#1-EIHh#+eUiu<B&%ZB4yczV!`Xf6-p$eU<YIK5c%t``f#Diqf^=<z=DrPoL@8
zzS;Xu{_L4`hfDp$^!xkEf6eyJ?e{TQ{_~6N^4H(qzIsxgK0UK;I`97#?=z0Aoa_G}
z+NQBieD}FG|I8Qj9XoFQ`i0Fq_0{~R&RhNca=vbQ?!M<L`ECXGEN$&}&bciwad1NJ
zs|zw3m*<7r-PxNQRufx3-?sMA<JLcWYPVmRY_4A!b$!Q=UDK=&y}W+7GTnL>|MKaZ
zjce>4R{p5Wbev!DA-4Ur;p8&K__~_zn)A2r?yM}IRqlD;u2{XSF022`{Im9(9)J1s
zXTHP#*)Mn9pMT|7Ld_mWcJtro+-A@Gw*1-g^L5W&?v+oUXD1=QKC;3(zdnKE;JWGt
zMb6cgg)gu6ihp|09;5TB(^$?{zPvE}j?2C?fyW=8*uL-45Bsjwci+vL`OYNp+`Sib
zi^K06nYo?Y{`1AcSKr=!+GFrNAiit5{Id(o?%Byn-ctTC(dYc%oPFtYzrO!2d}6oJ
z{i~wa{T1upOX#mNocV3(_SY-=zP;FJ|L<NZ|GMX2WncaQWvC^YinV^lwmk2Her3P<
z@!U9Wa*W+x8@;{!_D`nH{yukaO!9lf<zII$-Wqx~UytAJ@0B~oQu6*)^Iz0f9A5g)
z^5K`c?{|K*Nb}AAzQ?g{j$GUJ`l>HBj+Q4b*Ixh9dHHhfb>s4H&xIpw8}}Hm{+?F!
z^7-$1m7gyAbC>m<-+%eVd6`Pd-(L%!zOMGU|HZxjGy5|AGd<q<6#==N@>BZnl~&EW
z(m&5q*|OY7x%lj|v-^I|JINj$d^zEL>{W|O+c`Domp;6-+WLM>)?dB*d#paEG(Y@o
zsJ%<>lk4e+tu^6ae@$k4eDY$sFZc3i&6D>}@1OVi=AY72py|Nt>Jz@7v=%*6J(FKg
z&-Te<&R-wcUlu)_Q_w%><?ERzzu&v^@qBI7<{xK_((gS#D=+cT>@klC!+QR<!~XxT
z{QPjRe~zVkZP{)A>$e-PvmbuAy#7_qj|9KZ;m<zKpL_P-oM*etw(h+0Q^or8-`ZX8
zERFAPPG7dwQu*(fcH?;2eyLf%gU`h4RfAT2RWRL)d|!U=?$3Yc;*M$DTu`&+TdD4M
zo?D4|-&Q2Pe_vbsf8FiNUsFGv?!PTBahgMH>HEgF*>USExB6^&ol?~=>8>Gve%-k<
z^Q7Z{g|gKP#-~4eQdT|brR~exv+dH4#!lU?FQE5=@9ffdk-M#K?hCJZCVRE4^xm9v
zpTDj-S(;aVKIM$BZ2b9<dbNDLH<1tTY%VQ-)cSGG^BN|1e}(s6_vGJ)CKvtH`{)-}
zw{`jFi;wq~r!-~FJa_r6|9mMm<Lu%?>(9OA_t8(fQ&^Gl(xvLz+br?L{&UI~%AcJh
zxwl8M;9j)<^z3_k72mt;{+Rag>DRZ1O}Fh^{WChgu;l*fScO<K2|j*n`Mjye*?0Ga
z->a#u@k`%Tr)HnN)Zgy-x_Q0Xf0OL$=lCy}*YJI-VbOm3HxEBdxW4<u?Gv|uzA#$b
zetr45mv*K1L(iJ0$Fc4CH={V??Bk~G_6ELD4X;03*)@M(#!r*{v<;QTYM&l|bw2^x
z*q6P;dGpWN)4S6@y?j~l>(XT_dAs(qx9|SP{8YbQy=>Y%zTBrrmmfF1l=%E{c3j``
z!e5X6=Gc9%ewTOu%T3##=jMY~#GUzmW_REFa<4x1+TSlW)W-VHWm`P^^zOqijhW}m
zr5}6qvEb)_xt>O!gFIaKrPh6Y_T;zF$<Gdzb=EId+q~y`y71@S<!1Z8KD%{)kJPE<
z=O-?HoH@CCy7!N-?0nm<m412YY2QCLcy?`(g@m77so$1oS0+49s{46ykJPcnZABX@
zP4`Ui*FXM!V)G~Q;GbVU{Q|FaTJT@@i}lmm?(IKkzO^fT9yTlTp7-y{r_0a3c@`cg
z<KuUX?}l8=<JtdNic|8|?vLR2wykx)_v7WJlkJBOzW{Z7zt^9uR=qff^XymKJKg->
zY9Bp3e0bh$oqKZ<s=+gpM=ozp|2J{p=WnLzZp9yMU)i2YcY8ML=<Y+`&i-9pQ+!hH
zY4~ryci{Q$e_uY<nf7PjU%XZ4P0arNB{zOs8^3-T{j~7=ri=IgG<p{3&2YYS+<1CP
zpV+zO>8JgD&+$pj-&J@`{4%rsne6Q1cMt16%HFlF+EY|j8I@f9<XPXh70tCqpO4$^
zbASJ~`iI@a4?9xko&7x9^!MVKAN}gTuarL<-}AixGpEkHhVL4eYOXKeyEk}tZS~dO
zm2aD83huMNXm#Co|6TCRS9@{V5A*s2p*IhkwBM*2UoOtLynZ=*_|6YD?+(u1XKMUY
z?&!RUKIa$u`au^m#~#|+-sY{J&d0x{Ti>SdImi5u>z<YDdoS?bD|?;o>i5^<Hmfgx
zZ=<Kd{@c3c@znfxaiAjjC(ASIXLqftjI_^p&E9N$dAC%~-D>XT@9aLMeeEfz?O!?b
z;=E_e{(oaXwsb~w+ktDl^6oOp^z7fdZt+(Ce(q<NB}@05dt!Bdv(vte-I8m!+Hd9e
zPkT_&e71b9jBRP(9;+95mrpzU&liq=ytMMK;oh}pZ_PRRI(mL_|CT3<<txLYidWaX
zJ8=0$-i~|y-RaZ6*ZM=2tN2;Gk9fVh>gnt`J15MuE1kf0x3P`C?B3iTUu>!>ZRhO!
zp#AO}d)p1}!V4di=ZL?`+4An{+1viNWADiR2;VC?;W>x#djIs_^UfY$UoKx8aQElT
zPWNg4eb>GRo&NBu+Rk^G;lE0?@+teL=k9&}E^V9o&2O%k56_!#HE*7v{QJOtw!8n_
zDgE|bc!vLi`*T;W{q@88^4@Zz8*;@jF7A3~SCgHUAr|v?;aY=#=g$25#_o2b^_B(u
z2fL=Zz47^V^?{`m{Mp3gWOYmJ&b>K&K5|cgLVC5>y}a*6ljU-JZGS#F!*%Ixj-Rgb
z^}lD_PjlYCakKlwr{p4|xsU&9d^@vP^78Wb&+CfAYW7^b5@5G?S9;6y+<$A%tABVQ
z{NlSi@8@%0tC#nm6Xxj;PXB*qS8)2(i&rN651eE9ed_$bZ~1+i4jnYR_ghF(FFSBU
z@m+I$@h#%w^LKsDn)&7J>sjVAHs6x1OFMM-a%9x=U48fdW!ybqQz9o(pQT=VenO|+
z>z8jOS3ZAp@3QIpGt2YuubcLp<6HUNr`7MjocZ(S@%x(V7sLL6dy_Rxf8UkJ#_xB3
zmGC=FcJB3cH`SGw=lNg%ESI+K!kMYpjBlsc8=bxX??8!xsj$cu_Vl#44)OKvtN+ZI
zz2^6c*2jwve*4T?Jju}c->N;eoCQWzk+qNC?LOi>x&2}0g}oI|F8{uvt$%q>P4?XR
zHEAbHdQZQJ++DoooQb{hN4qMk-x<qljqQJbTlXsc?`lc)@24x6{+|23zqPJC=ykJE
z)~z$IU(U;@FkTR8bMV@%`&a*5tWM9WegD#G=DGX-4hZmcdK!3$w{7Wucu;=znpnw1
zH9!69*%gOe{r5k5k>;?uI_-MR*|o3cT`t|T+1$9s?xkXV@u#A_`-_cs97~yZ_Vk)>
zvt1waek)vFV6+xg%+|@zZz!+b_y6qk>fh$GW{F?-;J3PXJGpGfoX(>23#?Tq-{Q-#
zx81w<VP1X0GJ!(5gWtZfK6*a$=DW(6Np1fAhri0jJU_IyVxGd@z0bB?n;Clc_nKq+
z_WPCR>30;LfA-_i$AgZQJLd`e-QQQa-g0&M*_!hcXMbL{{P()2>VE#;W6#g2tJ?K`
z*8d~%=Y%Vse6N3!x%Rb<V{O3Q|8)g_w-nacKEJnr^}NelXYP1cUi!Yb{ruip#^x2j
znS~ekC+>6jE_vj-_oI^&7q-5(+PnGj;>%U@tg2pB6gbLP-g@)1id}!nNj6!z+Q$>G
z?Ypv9xi&p>$Cs>o&ldf3S$^_G;*TqQ^7H!Ta`@%<Z7r~k-uwB%*;`K!Ki^XS&BS_f
zx$WQ0^(ynvRMy$gZ@6Dyzx(cQ<DV%{7Oy<()gQiH%x_uk#}_}#V_xsR#aH$H)zy6&
z6{Y7n)cg1UZS=g*9w`4=CL?gml>pnn;?9*{txEzwKMG!-=Ki_U&bG?9>0#Bn8jFA3
z55Ky<e&+IO*WdHkY}4<p{r=@{N|W8i$`@7ThhCrMzyEXUIqCUQv#h`S-j%bdQJe46
z=M%8^mi^x81y7^D->m>m)$Wg9`P}-_uUCIR=Y6Yww(`_0?fNN^XASe)pB<bh$d_M#
zeqm{wp7fjNMZcLZs~E4F{;+C;)vZ&vXRZquH(kA-N6+H<=dXA6)xVngvhq{fdhnqJ
z$NtRwsrzbQ`1$C&`n#%^`fYn(I%Q^c#Z&3$a=V)>Po8@HRKG2}-|EKi@ShcjoWHhK
z{Ji-2Y37~_J;%<O=O63K{=24rpZ|jU`|oc5@bAob?SJe48#g@ueqV0$B;UP{4nMto
z??-XiozTiR%WdA+KK%63daK=c|Mk)*mV>%6%}U!0YyB+t_~;+n>i^E@L1~-SO}jMn
z>!q(Z*QJEr*Df`>|LEU4ql<SxzTCaczH9E>ukQQmzy12x`>?w1_lJWiPg1_rXwQ2-
zv*y{88?&u`%Iuc9y7v4p<)3FP&YyqH`Q~10|DS)x-skGS8qF6wQW<p8#Q*s0llOl;
z`68UEu=n@6w?|m-vQL+Mm2myykF#9Q@BBN^B9PK@_VEJ8x&E?q-RG4bKmF0RDeY)B
zKc88D^WJ9tn38$V`u}`9dEm!v|NBwD&d-_mbe_cxn{(&Bl-!7V{qU(`{)W#NYt`=0
zT(|su-?Q?6A3mPE(ffYRuII=8=iHkkT>s1eK=s7gtL%UOeqZzK+&$|Xd+zp@+_;sM
zx8v^2n?KIXoq4i+zNKA7?Xxd(R!feS|M)N0)6jT#`8kC-QfiOC96I-~@Q<TR&f3>6
zK0iqKQmJ2D`C>!*uJj$}wwjyX&stV#eBZdTEar9A?k}5qSN>l2viM!0ZFSY}>Mv_v
z?$(joU9rF>|9vj6KKt#-v-C^-YW(h3Kl|DD>Dingmn)g-me(rFEP0t&@l|<${XOY@
zeBbmOi{qb`|G$>^ll}ke>6Y3it4+akRXfd}v`?O2xi7&a{U>{ygvk!)9p6?~7uN9o
z+yB4+|Gy&UH_;~He$Td9e=hoYedo-1f!p?c-Y;AKTkn4D_q(&(1)|I9{{Q_h?lV8K
z=AG!hjoN#yW<35ky?gJ@gd@|>Uln`(>BRY+`puhlxb-X-ue<xZ`pm<9?LUL(|6W%A
z%J~1f`tpO~?C<9O{B`F|#~Qx4bMJrr{(tuVpR?27|9icE-=E+6|Ns7K_x$|)E5aZ4
z)qDv$|D^K&>!-Cp&gR#Bej5MpX}sS1?Dzlj@9*97Mt}Xg)Bgirda=i?nEpTP%iix_
z?{C@3xuSXcXWo1N>wmP@?>JZW_vL+yP36DV3qQ;&uP{7iqHh23o&1ce6AGqD?0Edb
z{Qv3Aue$I55MLZSVcX~Uf84op|6c1K*V}RWw{w#JpH~ZNKVCeuOF-Yg;?e%UidD4>
zKMBP?Q~eiIU+Gx)KC0@wf$<Bum6b;J>UF#Ij#NC<i}~xZZ-4);@+p6Vwk>NjEcu)F
z@AUNDe;$8SjsNeMdH?6}>J+m*&+984b_U2@`6D&`UtZnBP1cj7^xmj{RkmyVBlpSr
z?d6#4iWxn-3~TnQ2Y1gqT>N(3-d}C{;irGk|8HOX@Ba5n^Y|;LwSP_JpI(3b-{1H>
zmHqMlzhtay*O!<7KJq*N+v`*2=a*TQ{=VB^){_74zz-&O##yR=pB6qdIraCk{lCXc
zmpp9N&Rc%}^Qo`R2Ti~IRnK=%wy_PitNA^vf130BudXsy>ppJ&Iqzy|{rqRa@|j-}
z-d%I&Teqd);@o+P=7DYBHSQOm{ps_M|K9`teShBn|LGt9???at8!v?SKNNoPz1no!
z*L9WQGP*aauG?7bcy##d?l0{7|9zdl|Hte7|2}~Z=6I98VQ+p5ze(--b-huATN1v^
z*%zGE&UgE^%>N@5RdHX;>l2n`9MHNk%POOd+tlsy`mCF0X70=QlJTmdzt7V8{FSpu
z&E34`pI^1Dd0O4IhgSFJRmfI9Z7!*d^SJ)m@sG=HwfXx@%QNF&KfKGxpZRk3>sjg@
z`JmM<S1gPFPp$oZW^(-5DwX_uo%jE7{<u5y&i>^YB{uN|MK6p0%#&ZcT)(#O=RxzY
zq5J;6u|9S8h<f+E&A<O$PImn<r~3YU|98gUr<-d3cvdeinYew5TnsPw{G8{HAM>t%
zCs`3`n{P0u*<auJaOwV4)o!ng<7)Q2JG%eT)69=$y0`c2+*GwQ!2-10sg3*7!EZH7
z?%iFOe)jj5cm2=Kdc^U*y|(___GNx~q4!VUE`Rio^UM3n_q(({SC+s3F8pTZ51$9m
zU(Vw{wtv;+gXQz~o0e|5Ix#-8zi8&f<ZuDdJm2xUoAVB*A3ImP#anFMp0m3D4}5vV
z^XkCGgs9|AKWAiKdouYU=cU7^{r%kZYR|n{|K|4mnO{%5ocr<g!?#}R^X6McrJs4}
zlO+#X|Md3DnS!#jv;HgJFz)|kEnj!9^jufJ`7EhZ%fr9-eAr`rf9AUWPiyCX{l$6a
z{^3_Yy^r1g_wMPRyr#3MZojV{e3_eftyaABeV}{r;r0KG*-s`<u`YUAXSwHKWx7=U
zpR9WYmY=dLDu2G{pBK7p=WTfj@pBK>T`pJnyLfr=-&D2vl@}`$YF5tuvMD$_{`w~E
zJ<m6Lhw&f&-g9N`(q;a>V)AqD%@eJ!nsak*r#gH2+k5~1Jz2iqICl2NL*GjGetNfK
zam;<wpEuiI*Id{B&p+|}y!clypYL7$Ip^2T^1Y`Y+|K6HlaPPEX7T4Ae^0z>HoiY^
z-Q&4`Rp-n5&zYB4{%G~Cy&snxXRUo6dNx0A!{&>{FE;P%D6f073DmgUk&;$+_gU=T
z-R%4Im$g?|H(#u>*WKg)d)K?2StrELaNhq73fH+)GvDl~GTpxQo`Bu_nFnt!?LR*^
zCBtCmx}Rq+oo)wBNBsF%qAPsHGp#f&?di=zW9#4N)_(hZ`ODnk&r8BTpO1Ssy<wi?
zzSnDPr)R8u8T<IjSI0`z+-F}eR;Fa6o!wn>KeEQa{oWnz>c2OmKKEZKJ7)cQ-t1ZT
zw*F?RJ=4{1e&f&5%D)$-{9n6owLUwi`r%#Wy|pVrV{7|ZF6(*tzq|L+`<Qn3_QgM+
z)ks#oUp(`+ak<RC=QhE++hb3z%aWP0S-ZyW^X_#!D$?%7?Xmm>8dE#PUc9XQc<dSe
ze;eLA{%+6xd2V;{l9OAOzkacK`cKsdujZck{;m3L`sPo5etc@{pB?pm^7{F?$9^vh
zd%qle!Ixk4$K_u7g>tWD@7KTEyJttI(Kq+`^D-WWRVc>Sow58Ox+{3gxs`91@17jF
z-QGaAWQL)IzTe^P?c1FG?PR|{^I4Gk<vIH-f1Z5#@RYgfykqV*Z~foSTlsYV(eLK^
z#^uG2PcHP&{~rGQtNQ=F)t|oh%`<-e?fjW5X=T5b|MRFz+x6e_$#dD=?|1DFzYZF9
zGjiWw|Ng6%xn*s@-O4$8g%^L`o_0^G|8-1pvETRpYtN3}-&#|)U5tNz^~=YP_qV)q
zxB2sSa_idAKVjS6yX_OxK3kjNxb?Tmb<pb2q%VnP5f1#-C%?St514oS&KHxIUsukq
ze*FCL!~SPm)aTgP&6#y=-<9+8<}Ei%zPGXTcj2D1kB#*0=6_i0di`)ku=O_wyPFEU
zr(WN7eqHlw&bRaPzWMw!`ttR-^3QMQqxSvW=lyy0ujr@M>DO;smY1x5=W~7T@zZOz
z6kI-j-$qZuPJWK$mIYQ(e0npAr}XQc@8^E@<?ffaM_KKwtJdB6cP8v|)6WNwGj(h1
zER3xd=lNexGoNnxoo|25pR6bY`5GIGc?Fi+?F|fn8+>n=@iOc1t?Q*V=jWW0JKJ|H
z&ic^P&li86PQQ1N?|0va7ystIe!sBn|BqSGSJPZSPki2=UN=AEokjYZKM&7@pT2$h
z*B$lC_X;d`tUJ3;;uX988=vcQ-|s3uw$38zgYUl9>%Uh1IbA$|`R7;nZq`}#Y+E%s
ze;&X1mc^D|(?6X&_vg*qk9RNqE}6IfbL{0>`_GSN##H~@$2v<o<h$(K4BM^Neztr5
zWXb7T{#tW3@9w<Lw}IdJ{$+ewARC<j?;AT?<_5+K0(O6G=f00TbLVQ|{*2hqkM3}9
zTgUfpUdrdfD+V>!Us}(<ck`q1`TI4Sem-b=CVMpvJkH1ZamUq~?;Xouf0^5F_Styz
zDf8>4n=H?+T=>4cbl=xUQcnwv`|m%zzWwp53aj|{;c938?1{HIyYgY+yyby&cUqpb
zzWC|jO6$vC1MlsXdi;LR&&mF7ebeef<4;VNw>6is|J&}eyZN*A*Y77}EAFP>3*J|3
zQ8{zo)zTW9Z*MkyKXSSFO2Mm_;nlNt|83mJan8W*#@43~trqW}pl`qH{j9o{vLlxx
zOTS#{)z+`A`Z%}q_@8I#b93gOTl1s(m)7RTXNu~}8^6pv&i?qVjoyjrf1X$`j{Es$
zTE73QltSU>|GGaub^mOia&O<h>udVI)tlYFUmPy~Ha_*xQ)Tfp?bDAvxAuukn?C>i
z%I9C!eX#A;Ke7FB)cak3?Za~GFML1vluvu!x%(Q%@AZwpK1+XgV)op%vxP%0-{t53
zn0D|<UVQ=&r<Ea>`SN))TH6j+#I)=;y(3swmv;H`!pMtJ{Pv&s9DMR}(~oZ-&(war
zaI5}^|NT?DZz)f&Ex8euRa3wGs_jp!`=1Z5FZwh0eeBuKZ0hsx{Yn4)(SFwU#oyO|
zdUtDIfqhur*5h-VKF9Uf)Ek#qet!J<rS073t#7%_KUYajX)bf9`SbaM&%fjEiu><e
zu5Gfb{eP|a_?MCw@Agbye!6`B>a(wW&X@A<TTu0@sx4;6x25MRKi7*#cEm2IG@Ziz
zEW(A~>Y`fz<H&_QH*GdQ@4grHIZGlxYk9G@ub*07>G>IUw~ox5|NCy@QTf8PJG<{*
zoE3cdM_HxZi#prryR#~bHrTHG8T9<f^DleT=lRd;JKy8~JYN4&u~TZh?ftC(uUFl^
z^JVY#@7($3{ugG>lIh8>N=d9f{MGi-Wkr9`yp6H^xsQJme$1R7_xC;1UE}gI7r)0o
z`};W4kN5eUXVrPnW|&saTyXfdgs$AajM}h2XSVPEy!}7RW~oU5pI^yci(!lIX`lA$
z;hl?{cTdY-m;L#c_`1r{=ezvO<oC_Y*Y__jF5fbBz46<Zf4<0MUcSBe@7(x8qs!Oh
zOy3_#`TUT3)$I2&ws-c{JioHrMlP*P-lpf;?~fnKC!T+Ix9)zc-TV3fChoE9fAY5J
z^UN6+jl=ILuiG5EzHIBi;1$3Bo~-?3Tf6Azy@IcE!(!6jR#Y!L&L?5(Zf_V>_T=)c
zs!x9o%IwSj{`L7=exLeAv&V;5>T>&?%aEG$^GAl!+k-RL-%tE~XaDo>Z$8{jS6lb|
z^ku2kS+8e4yuEnegs;u|Q>v%`dAaGi^s{rn5`N!NmZ_`T{_g41GgJAu?XUh^xGAk|
zxvzfj_V1S${0&gEdKYIm^UwFDlTX&9#kX7vn>W+^^}T=Rc7A^H#=Q95@zbA=U;q8{
zO#c6K*<t4=E}wZ@E~dIJ@9VpnEz2v#e*Np)Qt<iami%kR%k$q@{d^bv`|i2D7i%h>
zgx{;&{^k8Y_Y^h*={G?S3$x<pCB!qFSHC|m!&p48>d;;5z310Gn{@qq4QQ3WUrf5X
zd-L4w_EE3D`MqCNe`WU1ec|Ub^Qyvbb)B~P-hWQmMEFw5mroB1SJ!-zsf(-KGLw7y
z;p(^h_U)hR`*-)5-Rbua*Z%(ZuIKXU!}AVj%jy1I{L|7|fBp9Qt=#6eXaCE*wrQ?g
zRw-6><9vEuz1;oUs*k;8Dz6`0daTI5cJJAx%S@NOyZm=g{qJe@3AZ*#U5UAV@~6{e
z|NG*RS2uktPs_3quFl)C@A#Ev^X|#*Ja%q<*3Eg=wOhX3du-GGqbRLD^}7At`n7R4
zzkR7)yl%_0U48ezA99ZRRr4luu6jrQl!x7J{Li=Wi^qT7ZT0V()qJb}XZq5PZa!^(
zztpHU>{j0MKmSfXdmw%G=+^f_RX;bLcAx&7_uHB;myN$x)ZO>nxA^_fH=j>$o^aQ8
z`ip0u%J)Ay^XC5X#ak<TS6a`%x6%84#c%nEraQS!?DsFQn^*J2v9xSWR^82n>d6OV
zTYec<8lNiCzJ2?9hok*x=xGoSPL=QW5H<SqYhL~~iTqzbo<|m5zHA(2eQI0Tl>0vq
zmFI;XH~w66{z+=ntJr-%uiP!SJOA=^{r(@{=Dw8OUGsT*q<(qvzS4cqzvY-dY2LSg
zUoB{E_~18_|G(p^<>uGctxnI_mVRSz?ZYbvztkA~3_Y7)UbXzM^*r%y`9Im0wR8EJ
zw3zR;irZxsWnov99`yS|S)6Q%RsE5R5AM8=D|sRJ?S!vg-8_Z(A6Is)OMSA-eE;WH
z3ohSO?t2y|@Ly-$r`5ZC=G)Ea_qkpxZWr@Q=8s<eliwl#HvK(*|NpLU-{S86{`dB~
zPR)C_^ZGH@Ulv<cr>?Uvuc@x{ES-0JdsSVrpMADz&-8fNo^!%EdDnj0emrx3rey!8
zkE#2Le=}ch-j#MIv3hskeQ{6Owc?LII9A^IqJCLsf8@bA&(@#$mtOtfzB*s5`1Q28
zPuE^qdGD!~L7qmlaL-e=qyozphXRJ#E=nC7Dk4)9TsOHaa=Ei8=9ymClx&g0$u5Fj
zQ{223OL#X3HBAlBP*8e&;l{BBUb7vV+g*2_x;p9q&;Os-{QZ-BK7Z}k_qBdkGoNkQ
z_qFe1-*?&Mbvv)mTU}OuN8<RLRJ}zPnLh<g&bImeGIVvk-1_1pH=WnZO$hzhSo!T%
z+*Q-MWpz;|)g@wc)A+*uA5V?j|3k!n@7GT4`t07_+m-hjKl>NG`^oX=tN6~vw7lLY
z74Cm#)%(WES@GwOedUa?{{M2-KaFFT<;{}?`u9l&hd++l`)t8K$;s=#d|0QP|MRoB
zkNM?eqPHtrznZvZ+f^U@d|-9p`fE}zn%(BjNS!aaxY%@B^up>u`_CsYFP2KKp8WV?
z_`N9Gq8G0+`IBsqW$FK%yY~1VIm-+4p62x~FMsy-ado3{nEmII*Nq=P`{nZ6&-drG
zj!6Ai*VW6;Y0a}LE_|9;|LN6(2;=&M{`mQ;?B9L4w!Y$7?efomW(i++&e^+Brnd8}
zV@a0d^gCx>FEz8hD!h97e2c%YPS4+;U~s-ywy;=W=UM5~ow95CX6^a>RBhGa?3{ed
z;@97{@Wn-c3otLPo~}M`&m61Q-&n5-><-_#sB}WAzG=~uV~?IZam;?&5qr+Ce(#3g
z8E5v)+`atM>IlD*_xWP`f7f38`}+QmU-J+AF^uy4QtW<qhn+?7YwdM=FZ!>I*=T&#
zy8Bk(oygTY?7m06`@<T1$*m|a<I}V43l3jAx9^GF=IK$j-zLug`DOC%dfP>}p7pNv
z4@r)H{prcICwJ6MEtAA{o@f62W@}W^?-S?$%q+HT-xZhi_sE)Sax<RCFJD&q`1xG^
zGpc8o&ib2oaYgLHx_iI7*O+(xcm1}{cKv(KA2%a>H>xfA_&nZn?_}lh^=vKQHS>Ab
zoZqMa`)7W9^{K`+pT&C)yYTeNKjB~h>FK(oZ<m)9ec8HQI?r#-@f&fkT>f6^UE6ut
z+b%mREF(VqYt&?Ab2tB(zB}!^Ol_Yjc>k~cloc1Zw>10cx1j5lMX$~*KUQ;9`rV2A
z{fqW4TR!W$R^3g>_^kigrF^^3XO}arKEHmxaCTCqrNBJ*zPmH8E4$0C?XRl*{B1IG
z_-V^4Qj>4H?<?+ndU4+V1P_gfIfo*{)%oM1zpl`AKXaKkdj9W;+xb__uXvTd_usJ>
zaV1;%KSw_8*==rlp?#Os>t|nbeBMR<T-$i9_hquqx@UL0-^H!_`Ia&6R&uHP#_GlQ
zp8h-awqpJP>8C7zYS!89zh3t*;<$DFKa>17zprt>TJH8POQ*c$%Z$^KAI=$yojz>)
ztEutDvtH{phQDqKyt}mOzs9%T2=<2&MaMpUKN|kJ=+`oL-HvTvuf?gA@o#RgZhC*`
zSjF!3-t#Qo*VbLEE#Zs#d*w^8@wMc+vt9@N|8>Rx-K2Q`!2L1b^}mbMME(y>%Y7UD
zpXJ%}$>lNY47dLLxtQ;Gvd+4ym-+F3U#!>tJH6!XU5WEw%GX~xA8){++hw{v&xe_P
z)!dG@t&g5Y?HAww>(VZpIeT8zsYh+!Us~~9ch%e*J6A`%3)^D<OLDh(_0~AQxG%M$
z{l6YRTzM^`f9Kz)yV*^20&_1)+zqTb*?<0P)$iwX&Mh`8{wn>Qvw*42uIt#f-=9xO
z<n*-1oUffA{_30P)mPnrWc=2$+Ft8E_Ll$nWn1%YY5zZq_xS2GNSL0Uyn7d8={47_
z#?#{$MqRXgQsnx2k?qy#*W1%RJ-K#trE-4npVYAGo${7}^DIGfza0+;$IYMh=*rqZ
z?o}0kzFpUjpZ{@=`Co0>ImYuIT`zu8KFvyS-|wL9h4UT!8_s*%t3Ro0d-i<GzGGJp
z`qx*#3U*$%|BhGr$~<0^ZTfqkyop}p_wUbrrNbQ#E&<M!$%49u{ND3RE3?mr&#4pa
z-P;j)<&<Q1*1MzS`cHdZO^(>;Jdc{b-K_F^QGVT5SHGOK8#jl=WS^U|dHv4PiFMaH
zPDg8}>nwVym9Mi%xvccvs%8Em$^3t>J-rw>d(WI*;$JV%FFpBx!HxC5S?1X{{`?ti
z__MAqe7>pWM7ydtnqk3w_jZ0-uqVRr?wd^c%I`{#jK$uT{%e}Jp>x@%%WK^FJI-B=
z*lSvt^`!e-Te1ApE7LaX%k<lAee1d=e12*6hifibdg&9Q#jozs*kxWldHUw}PiEL}
zEvo9uSX=)7>FRLq=Q%s4#;-TsdfC48-26R1*Zw=V_Pf~sEAMOOJNPe{|NqmGy1J`p
zcKuxQ`}5*GbLNTuvYc;Pxv?}|=IVp1SFTrFJ0EYLdn4oMMV>g`of|8<*>X$2pX}8y
z-dDS2cYpNv_3`s}{&mO}UfX#$dh3<7g1f`!Y*l{qJ1F?v&MQyUukW$??Ypk(drtn=
zt0!)rzvc3Jb9(jSnRcH;dEb5gbh&zcEz@U~yuW`Q&5p9H{<hiH{&?`}=NxmFp1-HG
zXX6U7lCx38CU@0Mum9wBW15rnNwoc18lTQKzc;Jg>`l{5!uKCq{C7+L-vi3E&qM8h
zzH6Ly>(kRO-B(Nd*Iu{(>VNX(<D&IXSIo4&e`l86#kvH`zrS2emG-Q@^Cf!rp16Xg
zn#ZeG?!R~akp1tsHS-(h+xsQe{rgqiUA48&Z*^vjZrt@bjQbzGS<k;EJ^N|e{CCUi
zk~hpccE0wY1&8qJr0jy#KMsC;!#iQMG22(+@`Z1M)VE!mvFmhYk<!=5=Ipt1mcCQ0
zu5b;n6Ft21&1$|adHP!yl@^yS`lDJhPwKm)U3S6R)tdQtZ5xWN3U039&+3|+pY!+N
z-w#=9Wp;gXH=K9v*5W@}ZL|Na%-%2iUibscADQ2hM)`No2W9tOT($E2ju&&hW%j;h
zf2G+U-@7-BFW&$A9f`YN?0!Y3m@&oXb=^_i95!!<<*jcQv{%JH{pDgheL`LA*RuGh
z7iaI5FTSv2*RgL`v)A#r6rY^@dZQZqD&f_ZUEzPP$h|#iW$|~e@7b6u+50|iPwUAS
zeZ8Gcs=V&+Q~jT>GuOngx0IUpS$@;sUH%V#3V$$ulzu|S<lS?xyfUZHQ=Zz`o}J6M
z?pM_EYdb7!vX3n)K5F@Vr@ln%Ba<1;Hhft;%lquE9XNL7!mZ?~htI|pY+qOPaYpw!
zHS=}nW=KhuUhem+->SWTj$G{%o#OP4D^io!Px}|@`)-<D#`1G9C1N`_8h=@BD*ie%
zCpPD7+=D09^-EVTH!P0$<@oo*k;%>Xvq8(e)0bFooWEIA|GUVW=R)%Hz3sQ3wZ6Xh
z<k!tMd*2<ktP0z6N7bhO;EfHB_}b@N#?&4u{=D}3`g2w{X53r%a&ox;y&J!deA^fn
zpZx0G#2L4~9DZqdjoGi(vh=HQyXx}zCD$TiZH?9HFJ6uOGQ;xDMY*u5zmJ0doVlpJ
z?$27&b@KC1|835C@<BTK^7g{{2W%MawLks+bMS18Y()O!td84@cS$Z@T~>AS;|t?;
z%Ript-yZdCN!h=qg^}DMvR-Fqea$-{(fhIa^}~R$y%#?E^xv6t^QU(I=dR0_qaMH8
zX(&}(-TC2~%lD<rEI&T^82Wh6t2@t6<)5{?{^wP`<M#z+&pruPi>-Yres!T`SM+7|
zbv9Q{?U$>odbibof%=8>b2iQoE;XLc{`JfbxuoKN{*9&;kFPzM(|t~EQI*N7=*!id
zR~K8>ADpno;apT9|I~D8h4|bvyj`o~z6Pqt7oJ&h|Hi#5;of&wg{`aYQNQKA<eanK
zrOOqI_F0DCv%BnmF6jD=S#x$qRY$SMzke#%_iV@ZS796HWbD6w+Wxmyc*(zGpnU#I
zGSjBi|LpVg@%D?AHuqdTB|3BUIop8s$E;$mpNZZrX8)_nvBrC|vTvpNYqpxtt0jNb
ztazQf|JSl@yN*?ay%syGI{)8J|DRQ-1;5K&Ir#g)&Fi}&><v%XJ<D>m{5`WfYqt3|
zyTYtl=JV`|P2YL{3#-}t=Ub}0{;uuO_YYs&TkF4IzOmoJpMf#5Ql)=?>R+EcHTb$+
z-Lb13U)MicnSD><eQ~@&vBsjzAm_IkF9W^vdfIo$?BuV>K6fF0?%ri=`&WOwvU(@$
z-1TMeHkPKJTB)o5eBQ5pQH%5R7O9q5x`!+m-=g-)eEqSgzem=*O1I0ta=ZIZ>5=ID
zZQFl@|K9liOL+F$Is1Blv&<`Es+;!Z$IMCQ%kzBB?y#%O`t|kT%Z=CW+^EYslYjK)
z^2+32w!fMZ7dQ(_m4E2UzI(&*s`U2lGB2F>N>xXxtIsoz+JE%^zGKrT{41WCZS%eD
z{I8{Z7cR6jH4eZ2_rP7F!+S4Wj@a`gJa~@bPwC8`b$K^~w|>sa`<Q>$t}$EvK|0Tz
z`Gyv+KR>swU3>OMjQzcv(Y!y5PTO{TF)FM3ZU3vOFj?x(l8%jrJEI=0Q<mGm^;?$D
zT=%se|6iSWo0_}yDzn)&efNKhvcJ99cT0HgR>{?i&n3q$@w=0%zjNhQ|JTP7{#M++
zAK{X(bM9ZpvmoorPv_#Vt}oPoZU5?j)mPhD+kb9<$NA;+{TbzV=G$MX`13}x`$cE0
zyUo9Eq5Rk4|6PmNf5WoC=H2{x&-Eodc^AkWT71JXBjT#9L4SPo{ExbOKfGXmK6}#Y
zym#LAdyJnRIljB@&%Ur(qUrqU6T;Jd=0?oTxNG<8>Cs<rnWL^RUngZzS^DV9;mxNW
z>!$ne(dYBeUO%<|+{>PK`Nw`8dAa*o^!*>->=^CMg>6MEi<0cWFDlJmFvs@7wC#HN
z`d`=jpQ~9Ucd_d8v2#<HpMC(fDn$g9gCge5%0Bu!u$XuC_W5%n;{0;zOAD@Cow9$)
z^>ALpx@y_XWy^nFtf`I^|7sPy@BK-sjMz2%OP@#1@7Q14n;u{LbnaqzmuT6YTR#;E
ze?2Y#^I_zxBkbQK<9oM0`VwjVXl;H?_56nU{hf2X?4R2%J$ZgkoXykp|JSbi_SU4!
zAHCfD?u7l%nU8J%Z$EKog~!FG0Y$S`Oq?EEza;x^#a2yA!L`P(wbON0UCw?N*R9<<
zXV*(}_T|e=A79<~WtHGd^X$v-eYRdZ>Ro556qPjH_H4TE{Eohexpl8Uz1WpsY58i6
z{?_}pYrfU*Klpc(zk>RM=b@)+zW)5UIqpdK+PaNj&s|Vfe<l31UqE(m%&#~0*-yix
zEPvVl66JAezj)%A>B7nCWueKjA)goRcolnYU%@$+-tZ`!Yn>NgOc!6dIW6v82HPxe
z(^u}NE5EL{_!}I)cH^ziipndE$KFQIFWvF$>Cu<d^VfUVmHu+6ydZgHP4}xau0MZu
zuI;`GYIwh5(W|Zdo3pOw>4l#&nR{Qy7ry<tXrr;!_ggxz&uwY{`ICED{u!k?{JmEi
z)?7PrHA4H`j6bf^f3Nu8@mj7kGAn&;duVR*-|xL~Z&UAl*AL&~zcc&eDdy{YFD<sp
zF8FkJc3t+buRGQM2H(FUSERju>muXRrFJ#)UxmLOKL7p4rn>Zt>FaBm+|?gEe|PD5
zIIr!WGvA6;uS*tWrM-XlHKyxrsPFT0wpQ_HxgJJb>)5^hbN)n4Az8IUyPw?ZxRrI{
z%8kWQJC`rWKlATN(Ko$YyQ`A3j$Dlv{_3Cm`q%2*KO$@GY`)B0edo%WEbYE|#r_2u
zZ#55XzH<BgoLgTGZoFcb(tp0{=*{D|T)tnqnenCba(dm_{&V*h-Ru3$5~hCP{FOg{
zCYG;kef`{fZpPd_GJnoIoVV$NarHTK@t2nAfs><Ou6bDdg_U`sV_>1#HnsKB?N-k!
z%{rD5pJsVn?%P!TAY=Qkm&GC3?<FsXpWAz)bF%sVmUrL7e82ZCugiWawfMX33GuJ1
z7pKXd3!MvYoBUdQ%XHo^Q~R%r_r3@>uAcaQtA9c%)8EPq=U3jUdzQ8)!pC(R>?{Db
zFUA@67o$G^3M+hmVf)_nHP`Hl`${YS9C`NZO?KTsU8By-Lkl`*8CE4%?tOO6(PFyI
zPPy!&v*Cr+TkL)>41T@u%KD1G*Djb{i_VGv`}JXa`PTTa*H%y6ExNq?+$R4@%Yt|8
zbEC43WrT06%U<wt;{HEh<j-oZhc#2u*ME97|5g39O!xff!XG{#mi!_4X)~)-czf8q
z8%yu+@pwCJ>A8OkWa=ub1B0D&)`itpW`7g-I@|s`YqH~&3yN3N_?Iu69lHC`mlw+E
zXa6+T{yFt0dfM-h)&Bc7_c)gR=y)m>eA)So(t5FV^S-T}cf+*$)P9b0mER`pH{+fg
zwddHUUnhIlzg**g{?z(uQR!xGhcB)F)>!-RPxSTT?)!Dp-#OR#9XKCkA7AHpb@JvX
zUnA;uFU*_!blxdL@7(0A?^yeH{W`sRZpBCLW6NgT%K3Ed>W<Exfkk^aFFPLh;Iv-)
z&EqjG<$5PB*P6OT&%al7i~H>rf4{wZ9m0OHr~QqJeY~~mY}}`{-|Tl^xi1m>_sSVp
zld1z*U$)1|mxjIm_4I=D;<<HM*Lq)P_SAz@cEOjQE9>h1t@!zK^}B03?uFVspE$kv
z{JZ8kyY@;&J6l)B+<Jdhe+FNX@KHXacWyFo+*aP)Y?Yk-$~yblw|y<&f|K=jrN26M
zrRVET`P!#zuPV2nt6Sjz^VqlfbtXEmj}<@Lo3ZDLu~+!zmvbwn*L+)aZ`Mu?fBEFB
zW8ciLs~?IM?*H@Q*RAmR6(`r{KelVEWV&u=|Kj=c{BIFYzn-}<^GC;8^EPAku*Jva
z7X5m+)bz)<faS+x_WWR7oME;l@@L+eibZz6o3c7qPL}STyjy(Fk?!9c^w;j<|JnIV
z#&@sXcYX7Xb;+h*=KL!<rm*@Sd)nVsd9k%`Bkr}YHoSA@ZgAzJlhNX9yFdIoa_+MF
ztJij4J1_UU?+4Y^RZMkme`<bK&Wt#}cBAdZ^-1Xw>d#-!JM-Fo|D{vw1^P^XAGnyk
zb>8pjl)N<6X`5%}Cw+RhAnNh^-}~NI9|^Ti{=NR*guhoNNU#3BcSn0<`Mp(r-?-y{
z97;T2tzVz{@?FgPI*)kY_j-$W|KI)l{?+vP#&5p&mG61HPrv4S=DT@cJMZq6x>#Gr
zX7^g*v|R7khGTCgmOgPWkFWo_cip}JdlUA^e3jl*d`ial*z=^OpZ_j=s?hs(;L;7T
z?Z5Uvjo$b4%e?b--@csmulscH*Q@^hwOz&gjn{vh_9ON0_A@tTEuViN{k<Lk{|D~>
z558ot|G@sf{@(A;^;b`xpErN|)Maz*pFPMrTNk{4RsHqy+UtMMGyYmxZl9FxUVPe`
zeVyUY;{8n@&z3|a`>Z?pdTE|--<^p4mN#zfvORG1vSshpX`9n8{wsQ>Fg<v>sm0^^
zZ>{0`w>E|!-d$c4|Gj84yWG9SargC0lk`gkdaYiaefrd)TC(|FylidEtMt0F{&P#;
zRZhQGynbK(<Kn-eZ}+}D#QnR_U#aNVgyzqGEtu!5uF5WW%e(*4leyvhKT6J*|GUQI
z+typpBWs*LZ2BkdmUFUu-U05qe}8S7dhfQ`KYQ@Xarv^1w~CJFd_ALFrnmLj)xh0b
zUS;<@zqmf(Rtc9r?}labW$Y_0AHDx`?!C?RRl)k~i>8aOjh=1wdh+r3cXm5JT&fH%
zTiLd4^OtLzyVTpye~)Mh=iU_d_2lbD^LhWOI%2=6=kHl{x_0Ho?>`p(j`(^1_r34)
z?7n^ffA8hr_x1m~x82>h{RZcr*Rk)dYC%hFzC7fw|FNw6*?D=v%Uf?)o%pobvi{$;
zzH@u#Nrqp(A^G&fIx(rQSMG{`TpWKeAVZKb`>1V5Uwprrn|^lhTb1j+<#ow6uR2z4
z&C^-M82j#MjLoB$sc%>4m&(1q9K3&H@zq!Qi#9I*^=swJ_1oqh%XpK&KQe#5<Ya&Q
zJHcV!|BKu=eH(cH>hI{UR-e{ynSEQm;5FxupTf`2%U9S}AIq9~aYl@;p|}6<Q(N<R
zHm&<w8({n2>iHSF=lT-nRu`vzdeXZ#{t(~V>o=G+&RJ%xHQ%;<Z`ZNaaqq(SSK1aG
zz1E-fb?thK*ZbBhRlTlSdsw>pSk;-=>yJy=M%4;0{~uTJJ?P)0_}bs+BKF_<Hf{Di
z<+E4T{+Yh#>iHk8wVThMyMIgl!E=`{cg^zOJdfvVVSf5z<D<2!^<Ne4TakY4^lII0
z_bRsj|8*|jfbWXJsq0swelD)qs<`#bCcSOfto|&$`D1PKvDN#&%=)wS-<9V@Zk3iB
zi=SMX94#K5EnD~NYSY)n!Pb?wPrtsl{IobYc>kRvH@DY4+W95^QNKw=UzYoyImJ`<
zulc{?{j>W~AZI+e`}Mi!{oKkgPkuSfU%A-5^qOn>ikW-9e$zBh{_}0s^4gXDvbR2q
z^Dxa;xUy!YY0tHEpM6o6*DtGmaN%U*u}@EqEt0WZy)V?)_v`m#dmaRf|JoT4%Uz_j
z^{USI`&E{IzD+P^KP`CMeZEI-R(M_Y3*oPq<^6KbSAV)HUVAlieSOi{aI4><>38H-
z&#Jw;*5ql}ud4DrpsKbm@4(N`$LE_biYgMTl;5#(>-#UOHuIm@^xgT}o2!=RXSAQ#
zcW$HI&tG#FvYr3Q-R5HGbaatgvEclTQag6)UA-XpRU_Y~dUpB$qN-;#m8A)$*N(o5
zQ;GYkmwx`F<^DfitM6N7^xTiojo|CG+I!7<zuoJC%kgvTzA8zDn_hD@eYVJE#rzw)
zIF8S%+!_7nyYIKtc8y0lV}AYF(suRyLXP$}cfKz(_f&1jKDV*#NN{<aY0;wEGwMOd
z&nNS~`?LLoj)jZMkwYQ9J52+5f5u$TdUgADt<O43yXw``XWM@5ywd6Vd(ZE?@9q9y
zefay4_{XKy#c!UZ*?qrXobh%=yy^BY>yA|{+8nm`YE<y+pW;`iRO|lvvi14WpJ$Tx
zembRHUe8&(zLx2=@CRefFje!w-uccKu13gjU7qo_wB_5PcRiigv#z|oY<qbA{)C(;
zL&NM@SDIq^G_UXY<$dd1@wKkS-`{YWS6^S9p0%vMzW-DGpL+S`d)f03{N=2<y#Duv
zm#4o)z7e*tXuPMnclxqB*1Y?y-fR9AS$lJJ<?q0J-@h)^=YKvEe*NC2^vYcALv!~h
zsF==BPMUcBSk{xTb{2BgX}Qm;-lV?cDaw8-wVF}ge_i}ssmg+N@Bgm0w_7=PzpwuT
z|9=zt_xj%dS$F%o-+|w*clSg;*qbi3`toyG75!_A!`8U1^SHb3gK>P}x0tt*d-qsb
zggu`y|3A+$rnWqWeWs7ig4c`Z$oAi<Rn(t6zj8@`Rf+uE*8R2@R<@eYldIVKwftY-
zcg{D$H`F&+HCEQg>`MP4pIP-kr1;2f|22H;Y}5LtvG;D=`S;a+vD?n?e{!dpsitRc
z*l6|oQ$}a)mz&IWMO6ouud|%Lr+VXj<Fzkm+f<n@vNd}LGSC0PEzXMkhI_^p9cxdX
z|Gj+Hxxn~y^ClaYPphn!=+3w*-F$7XD!cvTtT~$V_9uu$GGsp4w9%47JzuAPd)<$s
zBNZ|38^0>=dGflZ<e8G~*XFDzeQ9}h^AFfH)-u^PUj2K~`rK~T^RNCj&j0RLdgVEI
zX36fDf?TcfvUP28SH4c#{bjQGwz_{!D{n>|K65%)IovtfGAVn3e`QjbZSTh&Ql~qM
z?e<h<KU-uIm7I0#L-kv@tJBxK>%aD*_~pNsGNnalpUb30<m)_-DgK*vSJ}$)dDQCg
zyH{p(Ki8KyD<WlHKB1%UIB%zR-z>W-sq$(6u7%5d-Fa)d;jWqIZ=Rd+XU@jYwM@TR
zzHzScYp_ncCx6d+(Y}?<^QE@B))pN5dT?fReBs;9x~!*Nb64Jrydt&z|4;5^PXcp<
z3;8Ck-!HQ<Kcep0S1Ie`G4HkJo0__selrzcefJ|M2!6BVSvKC2zo)A`f7jGww@#^t
z^V*&`y|$zv<I3uZ`>!pwOTWA6|LS;y+)Folrz)F$KYM1+9_gjitu}5wc2#Kemoq>1
zRXlteb)WlM>@D>T{t5FBEEaxY`{ZuWyNN&a0)yjfvwJW4@$QuAnCH&dzjN=EQ0JVu
z*uO{gOrI^N+X*q2?P*8lofSKqmtT{6q-s0s+WN1Xo(FHRo&V_eEr^%D{QIy-x4gtj
zyZ2w!g_W#Vr%Yb1=HLIUxBu7qdoOOS-{<}Ds{Rb`XV>ls$Vh+eo%EeIG+a)0^_-7i
zY&7KKte5|RrpymVts3tIp4s!&Xy4O+S?`anw!HE(^S)Bm>(vtHTHjAA^)3I`6lif#
z@zXQm@UO~#abJA>x17^SdVTCefzDRp_uVVQvvVIqf-LSC%bxPSsx9|^T>2X-`*F|z
zCr`THEUx<=`c5OPy5+0v+jvkK&+}7uk}|tq(-Qo;?ZH~nwcTGrx&7|#oUERI|J9SX
zxp2eY3rF0wzy40&Hn@Dt^;Z{s?03$wP1CFA442z+Z~w3J@dg4?g1c^JPTJ0Bv2*6)
zLgs4@mamnz+D*Q$erxiarPm|w?XgHMnq~_gJWT*4?5~__-f>w5F1LKKSLM3QIre$W
zEk8b)q3GUoOf^0)>&i6yOViEM-1Z)M{{KcQH`ha{^`Dga_MP@UAiFm*D_EU<J^#5-
zzx?laB>HzooRfUo@f{ko7db1YuX)FxU3J#AvY@m+a{G3vpPie}$?W)4bout3zn$04
zxK>_}Tsya()p;YUx$3sY-cy42cRkaodHd4NO4_gY-?gWAnoTzvKRDBS@_A47#k!l2
z6vL~&VV8a0&iXHndbNwBUKN~u`sJM6C#8SU;aiWnCVjuO^PByDu4PKTU20*smtC)U
z`&jMaoAkSON0t9(?c4Xwm~C#jeogIWH&FQu${{jy54`#paaVcu@8vPS4Z8Pu>(2SR
zIx{A>`i$h2usMHUZ%xmBYW4pQYjBXEZ#vKRTOCmsmikSZzhjoJ`lCYqr&71W=UR5G
z`=ixXy!KaA_2S3Y@9rH7uYFNl{$JkGe|i7kOY7&@egAn}{zCTe|DV3^ef?#je)aX2
z)9Ze2US9ue<@vbD@oV>A`@4?sPE##Y{1f31b%krbAAdE^vG~aOsNXL)nr}U({eI2u
z_2qZFE<g7P;5Yqw)u;5zxp)Jqw8x>$7U5qD&dRF1+S&5!>JI&)tY?p|yxh+BiuI}V
zc6}S~`_A8<Rn*?!9dG$};`<-G%kTg5jjyb_UoBUcVgJ9izU<fO`q#_-{y+Zzb+P&*
z@7K5M9*58Q_u~D(U%T~}f1j6X|8evFnqT?<AKkb9d&9r}(Y)WAzVG||W&Zz<^*_J7
zE8kaiP2!Kf{NIh2<A2ou-}v(7w7T?<eBU_tc=|uM^>^d0;)>OuzQ*s`zv{Aezt8_C
z{Y78zl^Y*_u4DRb())d1R!9Dm>~VA5?D+bK&AOR~%QKQ~rx(0B>zY1UdVN}u^WwZ;
zA9s{*o&N2s+nT?t_rF~2zyJC6Kes+l=dP}K`fj@M{_orCetcp7KXv`?9Z%!`PknFy
z*S-G1?DzX)>i#6}ulaSl{`d0tb*!IfUS9wIl)m-fPWvCa>UE(<9(m_{ed_e~UB&s=
z*Xq&_L!5h{dijgk!_lwiZthzBkz>#NTkf%ef7fQjf4x^}{5~e>{gGo8HRp}D-TxVG
zAfRnL=d|LpYp0~;dG+4g{4(A4-=%tbIe)>o39IX_U1`25*_^-a>qq~(Z(r*F_0|{t
z^0xmldHMX`%jetuy|-I`cK!43|Bn6M{xQ1l@Or!2^Z!5h^WDF+z4mYToVd!Tvftyi
z{@?un!TjC1PbI&Ot^fPrrTxF{^`~Ek*FLaazW!h6d+Wbf^lM(d`G3^E=GT|`|Gw8h
zo+DiIDcr97-27YbbM73pYczkzdB*zqZ|8a2pWMB){rayxi<i|s+w7k%7495!ukypY
z!;)76(<7@-%&R=HJpSy@a09b90j_4-JS($*tvo4s-8qNPkN?-sD~HYJSyi9i_abUF
z|Gf07C#!0WkJSHlulx3I`=PpL@6N~mc)Owh-`x3@`M>9u$IDHhR(h@}{_6(2AOFhl
zK7MZhzg0LsF7{8}ZFRe^JKg>3+25`Fd#n2RZ<c#L>KA?=mME#5f1>k)Uh>}$udbYl
zk-K95xT@o<qiye3f7zWfQet)09h<NJyteXY#Ufw1TlRalDVBZ`Ezfj*YySA^nU#v=
z>wBLbxye26cx`vlYRi1JciH<N)jogw?}h*0%f)-R{@uF&_r~3LwjYQ7t`Gb7ME>Ws
z%kO_oTW|Gu<NH5t)i3Ao|6M%QzwXz~^?nNXKd&pFQ+GZ8->b{-e>_`nReQL7|DQk6
z8Q<!%>}#dJbMCq6cc9w!%Rh}z^VW1<iFM!jRopf0=Ik3c7gaCWAGLGQ*LTfU{N8gu
zF21j{JAB`-M+Q5e<(f%PT5q;~U2VtNew!c9lJ@<Iv_3W0`R?D-GrQew@8$fF|M8Z;
z{@tPV4*wqA&7T_^W&iW@e5=3W_dl2W)&KckfBCNXG4}WJUw(w`-})`}eeLy^yZ`s*
z+id?cGycz&m-~NxuK)gpzy8@neP)}j_jg_dCE$~O4b_idyqoZS-NUtOcP!tN`e*O|
zS@K8Ey|wF@z5d&VTd%vKD<7WQ-!!wyY~i)u$-50N?2(>VW%}vY)AzIQ?7eaR=ZD^t
zR|Vpuv*t$seR3fz{_Sktf3^3&J^a1@=+S-u-^Bm@c-j8nPXD-C?)~4i@6}hm-!1pA
z?8b8Y-#@GWzW;eGzWUeoe@E9_R@Xlio^Sd0=5G7bKj;7d)PL8${%yN`*{?%)-}in@
zH~IhYZoE*%x9)$JUrwuge$4uY`Uf?8#`k>p+RCTh*^|9$=eKQdm#(vYct(2tvxSq*
z^ZYHUEjRDnC};X?GhhAJaD&_=ALYlLCZz(V$rW3VUAq$5{(PeQ`$@u2`!CG9BE4Ea
z{Y{N&zS*B|`9DmT+yAQG_pk1@{9kMP+F!->f7RFRYrX$>ZG7>s^7sFo4y3=^7xC}P
z|8Lv<?SBQ&xA<GV|Gl)|{<qTmKgs>Sc-*e=m%IJv)8Fg2ecoID_PG4l->tjtKm7l@
z|Lyhp`#!x}Z(e_OebxJy>2)8&{kDIrzLKH-o8{gS^#^|sMt}IHb^V9yeKp%Ryqiu<
ztgb(Kc%#++k88H(m-fDw?wcO^_tp9YxBkzwo6D7r(**dxKDsioJlJ+dR(SD~SI3KU
zU(Vk3=}S%4{hRN-r~Y3CYUkVkFyH_3-FcUPJ1>9#|9AfG|K>W|-#q<Zd;9vm(?4FH
ztp6?l@6q4+JO5m-fB1f$UFr99{W)jz|MJEc-dI+@`%Ucnf2mE=UzS^Bh=1eU<LJNO
zJ9~7E?)(04d2eJaCmg?d?ApciJEC6cSj@|k*XsXUH2uR)eF=8CnNjmU-U)d9t$8y0
z#}7X1toB?>uQ`3D>K6OG(j(FJ#t-cOhnD|OdwTzuulhf>>-Ya$oNxbkdi}fh_vhaJ
zocnoy^^dEk_Sb)Zt{Y$bU7PQk_IjH?>lN!(pFX<(K>hdC`%|Cof02HyeczkAUVb$T
z|D4-x|02EiS@C@PzfaEF{|URZ_V2mgvJL(Zd~2BeciQV^uI-fbEKYiFdvTX(K%d;P
zr%(6Pzuh{kvU4-rt>AY%?<>uA7Li*xdvRW|<;Fc$*>6|#_3c`{M}{L__Rg7y5$=DS
zzkYljyrq9`{H-_f|4&@M_xJ6(c6;ZaXa65sZ})el{YPv0+!y}!@A>cjfAyrfJYL{_
z>GyP#HS+&D<9GenUAzBl^8SKfv-<bE|FX9Hf7~<spULt&AKR7wS{DC(;qU#M&fHgc
z%-#KU_xpdjy!C3ICzsbR`@Hge&A%@Xckf?$O#a8_f7ko}9iCht`tw@d_hWxI`9H`l
zVVeF<JX`5_(d)nAcTed*-y8WxrsVC{De_Y3FDl=0A9HH=pDb0dRnSuK?wyj~+wDrP
zIfT_-J!k88xB2(X`+IDk?#kb3&irk?ko}+NY3cEo-rTRhuXO0|m(~9(CjCEi+WP&!
zzo*~-IvZd7YuE1hr5`r@`{!Tx=ZpQ{`}SqOe(tuvlm7QZ|Nl!b<9Gcwo)=&KUH?z4
z{r8XYmLH!R)vNx0_v~8Tw;MbBAFM55y8cf7^`7U)o-Ozu{oZWr(UnWhrtf{SJYFv5
zXY~Ayd!M|n|H2x)FyHISpG7wo?z>s^t(5=Kle4bX6L0gMtL?rj-JSK!=XJi=ll|t$
zigRn9yxVVi?AOHlKi<pbf2zyx@Bhi4^soH>cm8*O_y1ykZ@2gL-1inA&5zYReHX47
z`zP6NUi{~$?|1(9zx09q&;B{}2iJeQR`<&Mop6Qr+=lY57uCk%PY>RU|MV(v@9Zm`
z-?o}t+MYaZ`QCLy^_Km$=i&|WUT_#jT&_8?bzj$8=3RXjujROYUWpRUzxXAf$2EPQ
z=*0NTAEGn&f0}uI?!Vdp|GLks?*1drQ1|We{JOsREdMoU37?-@n!R5;x2$shf!Uu}
z_N>0Kr%>=-HT#ldLhmQ<o*tRKuI}jFSK;NHcgszmKC3Btt}oH8kp0MZrnvO##VX=A
z6Fa6YogZ_~&Q&@zKS%!SGuOXGS+||n-P#`YC)@7FyxsM}pHF}PFFAAm?uXq^)_(i<
z{r64v4^^PH=!?IPVs=ao^9%8Rw`u+y%Ti0hbCFM1sn$(&wXZt=^W5g=Ke^qSS<RO$
zJi9E+zx`ya^Yay(+iNcFT@ZV;YUS(MR@qnO3P0p;J-XiS-<R+IE=0f0efxd0{{!zj
zroF+>{yLwv+A2AH@v{5osj+drJ9m9+&5rHAm3?Do#qH{2SuZntfBa!(wlr^UNcCOp
z;d}ncti`jtcip?DmM&j0?^lnyzkRmxJDsHGrRT1^shJP%6>pz&V2}TY3h~P0XY8iG
z)3?o7c5dI?hkq=a{{*eAdTw#s^4Zl};b+&_{wg;x3wYBe!!d2KWK^x${GBxy?Vg4e
zrUzYDzaM#Qft791hhtYdDr1bN-`@f18G@&Y|33WNvaj4PIqUPgiO$D2_3z65v-jnp
z?tk2qKF_<-bcS8}^5I%jz4CueGt*qmN{x%m4nMZ)TDza4Z1In?t`^VF{aw91k8jtP
z3Fjlu9)olbW2_r1>%XkKa=V&4uj<6bhBdF&-WC6}$n46|f^Q*r?2cVsq^#fWx7M)K
z(&o9oM6by56L-`ku9|M!Se31C`d82U?(XTYUQaAPf2C)o<n2p;UufsAop&tD96I>$
zf~6|GV)=rvc1->6<V${CJ-jn&@@`S<;$z>IhJU|v<8OoAIk$BFz`e6Ri~DdNb2VQW
z7?M1<=4j;g=WS=^H&xAi{K}`&vbeU&!Su+LlUEPF-3kebXuk#D+c$R1-*I}kTW{(6
z`JG?yN!=Fyt5w$a_3FF_AFlP+EuG39`CMOO5}$JV$%}U!i>^FX57#&J?)`DV?(yo4
z+noNcHeYiuYU{B@QAP4QdqEwaH^Mu<vh=;<e=qgk^VigDJ^tr^U2Vckugo&H`?N6d
z`MxtBOUf#fzFu7^X#M@7_?cB3@2sknURBKe%6g4d#otc_$F8kXez%G(PJg4RWl{20
z?R8Qmh{244{2vSUmi-S&et*yQ*ILol&G~sT`!||SaNlS9WaY}mdF$L|Uu5Zgf5Gi$
z?0WQRPi~&@gjxJwy`{bux7EG6*0KAJv*qJ!U#1(syZ7XU<C(?R_en#>iwa({?6KZs
zzsLDRZ12;qwXgH%?vToU+EaZzG+lO%@q;H{SDP;nPk#NO_he-Mz67}y?boNy@S1&o
zN9mtyj^W7`rAMx$#mc3e{dLi<zv9oeTdOyIZSVYD3Q5S*{S)rV-%)&8vfd*5=wj=P
zU(e@U>(swG)BO31mHvExdmcu7SY7&qHMsEX-3c3=yML^ejxPVa=&R_VjcM!Izy0Wq
zoL_NedG*YBbKgUTbS`nOdDnl>v?_d#>4z0@`!<$uj=6Ya-`@JC4wZs^q5qjb&&b}p
zG3vuI{Ta%}yt`JeTzqX;Rl(K|i_<%gtlp<B_ikmj>GC_lzjObBMiKJQ3xAkbHS>4!
z)2-{5uUcj!v(xlK`l}bgb4xdxZuxY?Kej#IVDn1n=M7W+_)L!F=jj|0{=DIe<oT$|
z<PE2HCS~`Ae-#Zs4;|YmC}Hy7Yado+`Qg%E_t>|4?9<m;8vc5zo8J39^ZnK8b$Qq1
zYY&E4NN+QnJz@3yU7wC=+snksm1G@VyzgyjuieI7vQRJf7BSrmoc?b8wHw>z1o?RT
zWnLIpeoeSOC;4s1@^^ctKKmoTJLE?1jhH=Q!N(oiJB#jrw!Q!Pg}|-g-VEO@_8rea
zb5K9eMh077+!ZI_JH7Z|{{L_J_O;K9<LiDMQMU^`*?0e#`iGzA>;E0uY%iSunEznK
z>-j&=r2E-_akek{_3!=vf4_I1s7^oeF8JN*@;#4bpI0BZ<~g@iKBs4!w|+-os*a!S
zPx)WY^)CYBO}{C`|9p6tf8**ob{D?BnS0kzR9oZP4c<`aJG100FEHo!^vg3?Oj!Ee
zZfEsI_MP?-M_yFi@?YPv?sVMR)1liRLyHe9#&-g8?^GsKr+kfIj?DOTNb%b}<+PQ;
zPgh!Y&yf2z(>N^7=Iv6pc~@^SfBq0Pch*VM<E8&ZdD_HoCtNcK^RC<S###2f{J+EX
zKRl|=-`;M=d*w;^#<(xR=GkZ8#@GD+eZT%!=l-9Ym-E*=VE(>$-OJZ^KSqCMiK~1%
zRhWN%=iYCe1x)YjzVG(G|L5%enqRxt|K9bSuf@8f+BxLHorpDU5&xG)^h-^sE8ZHO
zt^Ib*_kXjiU3WivaDIPNp@q{?v#o83dRw-y%X+)^`kkLoqm7s4y{Y>;E1Lab%%>++
zYtG8-t15-%wDLw9tCoB6_oP4nt4!J9{b9w$_2O$cTK)YL+<Y$dtl;`E_(*NxUr<TO
zq1`s0_sN$A|Jb}kXRVXJHRhkK`1Iq=*DHTtZ+0)XNZToOI`@wH2LA_d3z^RU{j-0!
z{_Y*t>+afL`}lR8VV*3n@mfpyIeVmR^u9iOB<NrJZRNEHm(}-f%!zxhFTpd*;b=$9
z(~hgb_FZ4)9;(KhznYgO|962@;k&}E|9`#JO}|%bvhJP6w&UPZ{@xDtg4gHoN7w)R
zzV2hJf8We=rf$mDCHm&53ay@NSXug{Shn)?<4pNvfw{LNtzZ9PU3{_4blc4*7Z0zD
z{P{4VN`BMv^~H5xuYKwMaP7!W@m~SW-#2dm_cCxjU&`7){8Q77Pu%4;oVWKI=NsW4
zm*yN;YybaO@xH>p?)Lv5zRtW8^>+@Nm0WVbU)!Irx}~yo0_D~jT6*7g{#Fymzwy_x
zqHo6R7gw^z_MVS7kUDTIH(>GEE0b26id~er&)zL=Iz?)I(f7u_<2#?8Ub*q!$7>J1
ztg(3gP2l3LCuhEz+y@WB#_ti1_&djDR@_>{7v~EfefnM-x3|9IYE`|@mDe?|f}MHu
zTE9QJ+g*Dlbah(muc&PP@BXoGyJr7enS1`TIL|V%oS?oP%ok^bFApzael~r}^sLMI
z@wSVsHpp!JJy$9#>uq(_x4VV<+wHb~DvnDxSyxw;wss#l#~1u$$@}@!*z|0F(y}P#
z-uHS_e($*R^IwO1{d@V+Z$cNNl+#SZ!{0f6&FO!peZ{|5?#a_HK7BEJr2_t639kOa
z+I-XZcFwb>w*%(hh)Ql-r8w_(P;S=U?wY;lrUXaF@!4C+|ERvZIsWV2{te-!Rqt8X
ze^V?w*K_i%^O>xBKNkMlG5roWdgs|Q*8jWn>9c>Y+%Cyr<FYQx6N}^HEB{uV`TAme
z9)Ef$dwSmAj?M93dq4U@29wW4UVCF`dUbK4?XRZH<k<%|o_Rlcw|Hf7fc?iS=d1qq
zUbIcUdi#cX^tm6G?p+Aj|6RY1HJQKk&DJ>|mr8z(=~{U<_5aEDHS-VLe#jCw|9{c3
z?SKC4{%=`Vo>ArSIQq}$JzpPR&9~oj?Aocb5@(;h>y(cF68`Sro7Kl^!M)V`dp^Fo
zKj+6E*5;E}9Sd?JVk`GP?OE=wdt%MC=<1m}+ArI^<IFqus^<Ul-O7da-)2`&-G2Yg
z%KfF!8`iGQtSy@U%>Vwm@0@$C`Xzk*slUDJsYCMlr`P81fAwmAfBawh2j7@4etZ7)
zi_AAKVbg`v9_sG0+~51k{W$aSWSvL5MYga1_>+5CvyNQhr$x@{QOo5wmL^wNOuN<j
z{pgj|Tg!Oo8ty$;6#weT&vb)VUm6QOeKQYNe{c77;^Nemb1UL~_C_WBJ)-lM|K{fF
z%Kv62x&LN~+b{g$`TCD@GJLn(+p}?g{mw;(wrOw92VRJnTWNbmEk9Q7&8E5|Tkq|t
zdVEdVI(S`%4}a44n-YHetdcimf7=ok$7fT2a7xMLq_aiBAH&`I+LrIxw=z6EHstyq
z!>`$^KQEsackSrrXIIaASEhHTzl}90&A7Ec>d{K|?dvT{pIm#@4j#VREBEodi1jV?
z55ML**w^<ycga@z`qOfIm|Wh!Kanq=?RmCYzV7#`&C4s)E#CX@Hx0Ze=W6;itg!Uh
zTW<F}UXyvdLhE<DI<b7e?aIwpY*Nne*V~^Uqq1$Hj7RZ>h*;BO!K>NVw8=faa&YsN
zuBY!<+4bGoFWN<&kNL;5?00#Z<?rc>`}dxb?!I~>n$P8UvhSQbdmmh#{%ifmto1LW
z^7nk&zVEU5eNLOF$4iz@6}Dw87TmXSr%c7m&;GHw^>!z&>$m&uli9rXWb<V8>-FMy
zuK!--zU0}xRmyI`b4x7?kKPXUEw+%anD^|+<m5IPL#gRCJ68rq*L-0$J}bKIm_eB3
z)~6Rjv)72}v`=5Y@7ikp{5v=2I@YYbw(s)xS9>3QDdn@0zdzmTV%(FAD<`|(c7qlf
z&A+p2#j%(*+l<$A{|c|@PJ4R$j`Vkyd7qM3eVcZ^KWd};gXhy{m2TYo@kDpQW&g8Q
zrpa5}R~Ijf@2_2U?HAYTxnI5iu6b!F{?sw;L%{3g+@~w!V=Zm(?vE*T|F~FxMs)AK
zPP5ot2ETdtjxG54<PGP2_I**smPOS<>%+Egz87_V;U2jiSr1lkW_x~l@5}AW;^*)D
z`YL^X<l)mz;?k$@iocIrGx7Yrg0<$$j)7MFK98TjsP^98nb#k)tou7-%e@<Wr&#~`
zvm#P)&iv|$_de9V(G5$k>E0jpU73B;o5z3HzunZ{BX#rJq}e+zO_}|k*S^$LyXEqA
z+n2&uZ*1Nvb7EGl+>P}0?;cAQ%h>*Es_fc$E3YGP^{ppoKK?o&*!?Nt`jv>w>2@1y
z=h&M*nV$9P>JInHzvqOm2Dcku*AL%v?cUezar31nMoo`;eeK5NTb)@)-qja96MoCN
ze*Y}d>s61JXS_D9i`-uuClX)w@6`TBeczUUyVdXc`fcfx@OYDJ{(bT}zJ7DQzElrq
z-nCr(<8A3J{Dt4$->q_cC$(+*zmqe?d*Axs`_2)+ZtKgn*DA8^%q}fhm$hc?j?dyf
zvx9iD1fsL={L-EMRwqfmx+>z+qP-_qA5>50-??b()N8kbFYbMr9RH5DZ`bPI(=XeX
zPFCOkzUQT?`R}Og+GAOF=381NU#R-~y(v6?&1v8LHWpj8->v-jEk9>|(dwUT&EtMX
z?-yJDN8h^s>HImxuHQZFwq8+N?!P5&|JI@}O8IO5UiIt!d+^$u@VK{GZl!De`)jZ6
za4)@fP(1RR=v&8ok{>23Ur)dD{c6PiztP$J>8D<1uR9jE_GDvl`H{K%6HG2#SXPw8
zE_1YM?RD?9KefvCnO?XtZ&A(fSMJHOE#)UCPv5@p(VEV;itJ@}m8DnCI6i*$C3^L`
ze=i-EfA?rl-+INr{=36jRsVIzql!!4`TB0G`tj`R^~(}}V<vAte?|6bywCqRN9U=P
zXa3Jvoxjfi%U`qg_ila*W<RxX;&ypc({IY*>Arh2{+_5`vipej{#lmov*uV8{(3sU
z=}Uqo^Av6WH#S?(K0Wes>ha6qT>?tByFb{a?u@rJwy!^^F+;lP{e@#ydJnJ6ZnoKX
z@!0B_FJ398z1;5~cXoB__U(0+1;6?&e&{`)9(^=8{axG~|2&`h-d3+KFP6WuKFqJb
z)b>S3?TXbam&e#1S#$lA|9Z>SGKQ;v*C)(-{>FLl#$TPApX<*1w&ThCz00QAO<uix
z<E>YnXRmg>=so)CcK<FZfxAyu<?p#P&G;JgrU$O+ldbPZ%-K`-YTY}@bNe2hTKwJh
z;=FSV4-XW5X%D|&ll6MOp<TMbW~<{BpS~Yb-?v5l+Ty>rzx`ot4&3}gT0D0}q-<sK
zYvJ3+qiT;_6^Nd1`lsO2u}>AZx%b6Xzh;d5Ql)z>>))H(k-ZnM`k#$)S<D`y+<va&
z+vRN8oSyQh<=eJay*Sx)`Tqf%J<~4d-?e*kEF<Dk&((wSM=xKFbD#I=vj4kP?=;+Q
z&+P5Dc^ZH0z0StH4`w{p5#%-e`s>T7wST^?i1)L9u_*2CjeQwX!SCOEi#Ymg?b;%X
z=i%R#3V%zS|2t{A^YXG|S!*||@4XxU`p8uiyHDGv7gnF@d>bjdac9T#KdiyZ8<hkN
zH(FZQW;_exzhCj{jp^@2*=y}8=DnQgoXz`1^ZpF0)0N*(dhfY$Ud(tpyY=OWzh~6r
z?M=UaQ*XZ>9=A4Qeb(#g><`y=US7}l#ZmdbMBml8qE~0)z5matG?AaX`t!qAnQ!VY
z3e3KqpYyi+W%)FV``+K(-pD=u+Nig4=4;*c{#({dZ7?nReIopFgse>VGyXT(pHIcT
zxgT-v=Q9PXtqZ*Ko_!6PEobpts#)*vGxr<&z6#84ekFA|c;1gctjPz}I!v0bnRZ`$
z$J#Ak+I>lRRc(*@xwtEp54wA!XV;l6m=>Y?QM`I1e|YkanZNCx-2MJ!W%T0y(j>7`
z(<fO^)%^C`K8g3=|C>4TTuFb?6YX<WCszG$to-&b`n&B)!T2NVm;Vi~jxGFZ5|{b3
z>#M--D-(XlJyk3F|6=9pozJ%O?Ru3jpLETo_TAyCt;W|rA3ac6cV>$5yx%W=hiQke
z`QQEX-`&Zd=j!fqfBnQ}9cWx)mT0Hc@-VsB<XYkUi$4DMSJZva)Vmhlx1;vL%<%C4
z(uQU0r{DX(=BHhyy|(?Fn)}6;kG=&i-+t?wl>h#nwigbq4SR0Ay3Y33)f4w$t-rU!
zL%w?bv(=%OYhI=IeRKW(-sbN)(UsQze4t&NzIngqE*78Ty{`ClX`9WQz3Ka3>1T%R
zyFNMk?cO=R-&yXEFR?3HWcx~c`8&-O@&2C|ORP1$aHDqWX8nqPO^z=X&$z>yzWLRP
z@bouqE6nFreez!Yx993^_2O4qYtHVe`M#7-C;z><(z)7SayM3khAHl!ezIb<<)`WE
z<MaO(y=#x@-&h@}z5d*;oh!~+S$fCKEiDe5`!&0+RN>b0Uvsth$^CnG+Vb6PnJ=~{
zX1-Qme{N5;8C&f3A6K_6kEuTUGpj4>RPD;7?|hr|<t)FYyqk9wvR<LKKI_!lM=Pyo
zHEuUeuAX$6+a%97j<069r+MRqRO3fCH<%_@TX@Lr_x77I|AkF;Q2v^Ia|*w&KUeoG
z>#U>Y-?e)slfIvitKI)p>UZ5K$>0A@KD{7)d-ojE9luUSew`3*|M^$%`k%L*`Hg$x
zulfI9x3fO0=v<BN^Z48QH{W!BK6&%2{67J;+sd~p*xtUrqt5c{_8%8_gw<u8%ZNQM
zEqYhGI(?$_@45%llXr*JS(@~IwGq8LIphAj&Koi%rFF^GD^`P+BZ?%HF}uDpom?(p
zDrdPh>2Fci%2L^nzb?oft*Bhn{B81O{r7LOp5E)RxIg`U;=cc){og0uzZIze_geL`
z=}F&%>_2{4p>4nO*DB?*sq^nljF<hP^l$py`X~DLKhOUCW?uT6>e+QaL-n&)|Gd_9
zb?SV>>I!4M^Iu+kPM-VSEcyQW=lOAazW(X6x%}SlV({$htk~YY%fsaQU;kk>mR4L5
zz&vNqJibY*^S)i;@87<9tLXh-fos-(E&8<RxBja7)eGOx{9Y<@{`(#I#mf9OrJMKL
zhW}e!ynb6<<;FUT?}@SNt0#%if3)5Gqh?*2Rd|i=-_Lu^-p`XRulss;{+^h>#$me;
z{R;nTu6_LXtmiwb)<5lg<elEIeBa8gYEk)qXW}9km1ZxHv3mTe=yUDj^11sH6tWcN
zA3piir9|)VldIFhx!3&&jo;#Kvvuc{uDQy~+wbhkc>A{NbC2F!@2#(%xKy4CKDSwQ
zyWT3n)2Bt(cE9!2>0fS__2ims#k5~1qlMRYe^~R<e7o8!;fIkgB0p{a^|kZYOI7zX
zO564PdjB*({`mUJt<M`@y`6Zr_*2fQ)0Ilb`=9;^n|E{ltaIV)e)}xz<SUE!d}CkR
zeeD8h?{9*p$io~J_Gz0lElpmnnJwP=e3J0m^D=cs&y;4JQ%~P{z5UI@(xY4dm336-
z?TbHuJ|-sfsmqpMrw^Xr6O;XK$BD+GikPQYf+kO&UH9s$;Nrmizj0r(&dw{icG|bT
z_)*r|=yNx}?LXQdHh;x_)1)v{{xh>a|6M7V|8;f!>P63sUmoxOZg)QWSytGdt&e)n
zer<kp^6yOX-jBQLE#{xJcGj&Fx4Zs{`<T*=-jnMsvWqvnM^y^`uW>F|3tnQfI{((Z
z>pOnke^+?^mFu}hb?5ijhQ++r{%^{+zc&BkqV?~(U&g=vtoixt<H)r?_l3>!zH|DQ
z{?|I~t9|EI{@E(8eeSV`vi`R>GY&eR-F4&V*NEw>*VU@^@0;_lGkkwSnD2uy>FC0Y
ztG8F*i256R**s<Kotot7pMG7P`r2+ye$89I1?johMbmR1c}1_YuY3BIIh?nqbnVo7
z-M`<2te;Q&`RmB9r)G5@{T4jGFTejP->TTFr$e)2RLbUc$nWFd`s<8(`*pitrv+at
z?%O6;d(h_SifLy{oOzb0sqYf}nzg36DC4yBcK7F}PtUyHwfTSdx1FW;uI=5YUU0fU
z-gJ81pY*eH@4pKFFOu_q`HyYidJCDh|M{`jL_6>6&t_-tZF=hGtd=W3*C`J03*n!p
z9KUwzvy0+9&SBZ9A?|BS&2_@R_#QA_HvP^j{jJxeSF=C=cX8v9-zgt2{d%);LjEh=
zGN$Quf1<6cZeM+K{`^JFy|q8<>}*=EK2It7<?{MT@5{(Osh$3>i@u&-*t~ri|DM#V
z%l};z?@?ji9d=B#efexv_vO=OZ8QytTW@I^X3KwObGWV1*{_{hdW!${-rJ}CVUzto
z{nz!s=lzL(KKK0j151Ci=YBo=wejki$%~e`)$cv_>dWcL(yzlmhs^o+RJ`YKPG9Ca
zQFGHL#S83yo-<;*defQj-V7<j{?$8eT}*nv=77eG66PPsE@j%=|Kg_ga>K3n!p~k@
z$$Igm<ZAZFbGduvOx|YR|8zuu^NhE4FN*&)6&j=@f08<pAA31n@6z!|1%A_=$1+}T
zUKUngy-GZtfA7~bGiuhuM)MjM?`Ao__ItmrgU#2oc28csx~Lw$-?Sz+>-1fz>(wIj
z_b1%wS#+$3$F{5AETs1DCtC*4UV&2kUvF6R*UDLzemj`oZ@GNlw@bSVA*0Cd>IU!o
z?-^J1y_@e{K5=W++v7g(wF37_ZP@y0`;jljXLr<gu08$Oy8hq<jaO<<*EFv&t4zqN
zzxukZplsQmIXn0H1u;L5d)jsF>#fuGHm}QrE+NaaWPC5b<(|Iwy3+R=mPI=km0s9-
zDX2OAq3zEj)5Y)ZPX^6-O>1g@>?S(9d$Kxs)!w;{YW{h?>+(a^*;!QXz2^Gr+sbWm
zmA0_)y_YO~?|M#7j^9<kY~IYGUuxH5bnjf0jj%Obz3&+R)%3k<I<MTl{^ZNN{RslU
z6rRnTZ6cnV_0HkKt)7#yR}XCM2i2xqpRV|MV0+uW7#Ht1o3`JWH48eiFhl*pT*mx2
zw!yllmC3K4*cIHfFL-wB`;pbNih94U)(vC7e`iNsa`vK{>HzKf&;RWuW@T*gWIt(n
zM(XF<)Bj$)4L^57%E~e@KfCCv$+B~k7XR;l^MB##y1VM2(Zdp^d(w-(vsb<sd_Bka
z@yyqb!LiBbx5p$`nS}3mD!D2=yIJq|+N_MI>z`kQ8%&sGy~SB-arpA`YfleeEehUT
zc4W8xm$_FZ-rt%2cU89j^Ys?lumCAxx+8l}{+_*S&6U_J^?vvHQ5)-aiay$(TFSTg
z_Wi%U>uSS`Pt6656I@#2RJmc};j4Zn#-BE?uPeP?a5cSDpt!I0<89_6(fj8}ffkQI
zmbWs#=g+z)e=OMl?rzsB{AFA9^waG=f@TAZpLQKtyZe0B4E^=ns;%k|I%I`3I2Kzz
z?z|h&zV_Fnxqsf2d*Aze^Zd=EO3RJLR}QXyb@g2ZB#GHJ-jn}uPw^A@xB}Da)3f6b
zy>zX9qTk;iW1nGD`eh4Sl=#|(*8e4WII~k{?2)=?b>fx6BR&)HtKq@xtbXiVab8tD
z=zZMDx2uos(&#UP<^`F#4)2BD^KaSfd}@1G@89q_TScw*n_6C+RXI`W_v6IC+1XqF
zpL{s;&d+cI_p_&^&p&*YbEbE-=<{VyzcyWs5MN#GwWj{+?m4#MbGAa0!HyE9z4kk*
z_3qkF|7EkZEc4hZxBN=MzP+DMG}=uL=il_@%U{p}=%|1m2f1?+IqUL%UHG{|{OgVG
znrl}YbhZ?)-H{dc^;}4F?EUtyP$Mm@8n6Ck43B%?wYiKld|#3KcXg?3rQ!!)SHG-z
zeQjOlYg4=WgB}fLO5Zlkonu)lZyDfczc;4f>WR}6UkhLDIF}XccUE=HHro$d%2pm<
z2VHx6>91k-`m33h?py8WR9?Js^U2rA)1$uz=J!9_ykF|WPW$G}i4|r_`qw4)9#-?e
zXTGuPYuP%h3%mASD2>#2uUQg)eXrH|Ti}t&Z=5k!jo#ngv!_?B$+{Q4==*F-x#Wv>
zPuAQ^UmY=b-?@hDy>(xMgXjHtwLT$h#^I>f$1colKKAsZ-@IM^wMRba)joN(_N3|h
zeSfsx%?Yh7hD_60ST!!cCm($O_nGR~m;N5N1C7K_-?h=oVp>h|-|tNe7d~4R?zblI
zCu{LZo7pSo&MxP;G3(=#m)ZIktp0pC(U|dd;^wqI(B>+TaWyOb6YjZwUiYeY*|%GN
zpI2`ZUom}FU2@^4Un_Uta_6&ov~uhDpWMsZj!EdP&60lnQX%W?+m-Ag%6_&xWmdGu
z9a(p*plVI`Rnu+zpyi#vZKHR&=leyk!V0&(Y1|_tC$~d#_4f5vl@n5Hk3E^|YIl9&
z_CG(lkNI9&Qh2o3;d9=xi1%ksM+>hMT%GA>Q@Qog(!Z}=ljH9<e?DstokVr@TTp&-
zPw|=R{}R!!W3NeVl={}{x7PS-`TeyAZ#%<A)Bj}K9(e^i6lcSFm#6dOKlW_2^m!cm
zj_txni^VmTrq|~C*8Xu_=x%FenY{O#)9&k_S+w6Qas9$GzW0Cc+p%l)6SY?_?UuJm
z-QjwFa<};J6|2L}uDv1mMODB2Uz28Lv8B05<>y87ij2dO<BK=`Dmt={)AZSuE9drQ
zfp%yuKUM=Pnr$2J>0VCeHTm|>@c84ut}*i>Y)z+23GTB^TbGx0AyU~c>gta9CtuqB
zH%)Etln66)tDG&OfAzxOnf9O4&()=u6u&LiO`B#L7M1P(clrKb?|<~Yx2XN~IllPU
zkK^|Hvi9!W{*bfgU-5kF+IOGl-=E*P{bB##i_!nSEVr-y)hPd?@v^)9uZy2!zbJh_
z8~ES*&z}9uwtb(u_5Hth@6BTBW>(a{cD*yBChJVJa@ySe2_7~QJT{vPU#~S?c7AKB
zd`a)}{C5W}tJM7dZ~dpe|IVuG&%S{d<{S7oSRbx-o+DM1owRf6zpwlL&pBB)<Em+K
z*1O-g_Pwh8!s<MEmUM9PRiAygWd2-yW&UE~GoknMF06SJZL#Ow?sm5GO}`JY+ZFus
zu7Ca9U;fVncKH*3e{HjG48QmD+-2+d%G7$bd*9}_q_cmR_kGXvFBAJ~o_y)O|D!kk
z(r(sAQFneHzu|T-Rq2oJ#(&Wpep_EMzI;{UUB>xW@_!|JW{YQ+DK9Yem03}?sQJlB
z>FE6}=VrwH-f{oYl}XXp*$<t3t$05hQdDlAcVJKOiKj0f#s=Tp_5J*w@-^lBPx~Id
z>h0fhZcCiWGWLzXb9mI_OWytDKBgviVAj)zF?SE-*p;4@zWrLL?A#Sg@w!(lw)P#n
zsWd11*Hc&my~X+E--mZQ%l>a!cYn9%l=!pZn^#R;eQrnX!xL*8j|E@f*SmVM{eQ7Y
zb`251=zN=<I~8Als(5KxY5B_C`}~^n{wu4p*V<U6uUhzSk}+(tgSUFY+kZRC{%_g-
zz277E*VS-k_Cv2{R?prORl524lh@(9AKf^<IR4-c!wIb`&-Ti%;$Qz%!p!{kF5B+j
zyKkJIA74K`YkHN%{o2sq6^9P<dzEh92i*c7Gnb*<{k`V9dEVd8Uy=LTy8fF-cyF<*
z?XyKT9rN3x<g>N?|Gom%YhkmC71(C2E)-sS`sSTk9R4wL3e)d!AMgI>cz^lYuL`H6
zn~SI2S@j*7Knh;6RMl7fKk#uw)%}oc|I%mMlWL3EY*(y~RGee?J$8Pb>9tv>8`pfZ
z{4aLX`Q^i_y&7d5v&`~0FFyN9_-nKF{#~8hv%-JR-+SfEyccVH&!2<L?{BbTd?)yx
z_d?8;W!ra3Wp7_#{9)IV6Hi@DudSMUXU)X&(*57oFZ);=Z(w?POHy`0ul1Z8x3t<W
z-`^o)<Ly_IARjlg@bsbAul7BOYTvze{Xb}}@j>q6KLc^gg;)PF$MgP-x$@RK_t~rE
zZ2OG!JC`57caEhprZ@cF=lqGWMq93#Z|u5zU{%`u&WbCq-IdwTnJ4v&?tgS)`u6R$
zE+$t`=HG#=Lf<Mp<GcI&nbGg3uFU3tW<LM(nTsogmxs&wKYsRMtz`FSn-68S-&rp!
zeT1Dka!#)3)tcAkdX-zX_sdxPb(g7`{`vG<XpO%9Dd(OOw#M(bd@~T+tABU1WvQvc
zo;y9SP1jwYF>B+Be;nuI4YZl1U(T}J`m5uv&DLYr9>f-WI(FsBGn=BF->zNWcMRHy
z`QT>5_|EcrpwC_F^&7v>x7%P?YI-h1erHw3>dZSgt3Ycd&&L}S8;b~r-I-Bkp3rkl
zg7<XI)8%HiMHOos?Vd^pr~Cf5t^A&J7goH*ofm#F*EspT>$C6YvTSUz4|hG+mpG!E
z5m$K4szCH~=Vo!6ew&DMvsSFD-m2!Fr{ni7ZbLkzSovTz|G=wrNlW&WPnNOlFAeC8
z*}mt}Dbcs_TlDV)`n*lOwpd?6s`NtO<7ku522}ySu1@%UW@gsi*|ks7<LXU+b!S~&
zo0Vk-sV5RjnYQ1Pf8|oO_TBn>-E-Uh|2|o{b$#j1U#C`9bG^ELd5_`O=lc@E^7Ce0
zu}EmGx-v<6^?aF9(`#vQ^KLBl3vrK~Yg+gzBb_%7-T-PSXDdy9FJ=L1n$})<P<iF%
z;aR`3R{UHMo_?>c=)u;jwTrg)@2SlGR`Z3md7)bJ(FJpEL?yR}U607MOp@DU^DN_R
z_`afVv#U(rK9~9VP2t%7>yTP!-Q0$9KC8#e@7RC)UU$g)?^$X8_1~qWrv0AzvGyZt
z+?(ffzO`=7d+i=?kh5xb`D7)v<U+G89|hO1-<$Tv?P}Av$(NPi$87y@?DAr<n4i&*
zS>WF+dUFq4{HvsYX|dtYSN|Gkf1hsk$KCL6#4qsl^}oljtX3b7D4B2Zu;PyVouAxp
zLChNMA2iAYq{2%1&m3O8$71W#ud;=o7Ui$n@hV?-{%^LYuQzV5z6o7?wOIJWJ`JhI
zir?mC-uZppYQ=NA6Q|!~uH18n>tgJsDB-sk_k6sgZECp(wCE@^BtmX(_R-gY%5opC
zb!QztH!;{hFE(dw>5pH_=iS+ru^yTaca$)F{`Z0JrLFSzSHZHSTR%N1`js9xe^#e<
zzf`u;p3hf1CeOFr^|`*gr;Wp9c0=(Dsmj`~Cpy>0c7NR9l9aw~$F-{mZCzhiUkum3
z69;O|yb+F=%TRuFkNv96&*naoRb6B%_VCJfzdND5f4VlSElLzyz0vYT+?7b})D@pw
zU}pimUnAQ7547X9L1OaRT$b~b>QBhUU0ktQFYLS0#@dg!HqWs=y>Rulh_^0#Y`*%Q
zg_lf?_vEis_gAdH!ft;3$)3%pPW!$O{uIie_MzndE35s*Yfk&#{mFgo7?-1kywpm@
z==`_)KCId<mHc|q-ZS|Jr!Jq9FXea7_LBU%O3UZ3;l=)9;SYY9vgek6KRYpO{daN8
zTRX$<T$vG`t+Pn6Y@UYy+4QaT*{{BKe|WAh;krmk@E+^)V{4{6hu@2^@0fpe)}7ji
zoceDY*VeA_JvV1pzs!pFoVRaW0`+b0wW$}p{P#ibW8TAx2WP&1yRl|v?%5r)yytwr
z+EBdDv?{7N{<8l2n&JSzCGUTpPmoD+c0Fnqd9>=~()?FzLaozhUv~cQ6+d@lRq=Pn
zytOgOrVpMx{080GW5f84>pk~-&0@jxYrp&39<ljW`t8iyeAz4NuMFceAKX#j=*@p3
zD0!XVy+0S%Cny+RX=yw@%W$V*Rnp#P-<Q2O(_Qss*6sL^V$P59Yp<pG7eAjZ|Mk`%
zNKUa~e9!&9AKWdy60V${|M}6J>oM{>US-Q?WqrAxy~gi8*Yi2g_a!Vl+4#w9Lb*k0
za)7MO#+YQ=Uuk*#7eNOSR9oGyy?K4tPiTW&X6}JK_E%)@D!cF5r##2*o&I|Rn`bYs
zG<_&K_G)hG{A;frug|-jKmXBDeF^p~1M!E}6L!qb?%8ISefj>pS4VF;=i3^q?cdT@
z74zxMEr=7JaemQTc&$1+D?Kj%@yhJ;uhM$fMg2M>({Gn-QgrpOX?c9sS@pO-O*7Mq
zH!}CGl(g=ViId-BmHqX^%FX`OFSdvISC=lkC3@|0#nQWXAVyX(?KSSn-&_5n*}XQ|
z(&Wgqgy&Z-N5t;^lC*Gh`-*>#A3xlR`WgMGJKn&ZH;j3=VbZiYJNJDHWp<w%vo7PV
zoRZY^IXmY)b1(dDVs|MYx?6Fc!~33N*YXeEi$AvDZ^!A&lcOw)b}B`c9$7Ortgf}d
zKlXg>L4z;1f;QjU5SM*bsypjs?Sn5-;$MB&+Uz>^OD*nF%&N0?*7w2HorC{_X}^=R
zX2~Btvw=;jIDFRWwci%6tKF0SwKHSQ*6D?%1!tv$tKV@SJ0@y&?8&S>aj&jDInldP
zc)IfU#{9E&UnPQHH>E!;H*E_}-dnLU>~0^Vwm0xU@OyE&U-FmWWV`IAYcF!oTVDJ0
zOGI{_kN&j1a+}hBZ&I@_{FZr7;{IZN3AS^+XP-?k+M6L0a&E?~!ih85t4zNId#~%e
zv2=dTuZL0d_paD{%H9CBns58uhVRF9zw=8?le_Ta#CyFfrq}z+zrB;mewr53YutBX
zuf_gd?(qh9BV4Dq-P}|4NO@k|wOiXaN{4D++P=%O{nnLB-u+*{W$v~42rX$UPH|RT
ze_*I5b^G$}0NYZ_<iOs0%5wkrTwhnYru*H&KOENWe?OGW-Jg&XVREcM<a}H1zOL|E
zn-w=#M^zs@*<A5u@x;}B`)qsW-kf(0T7x~9COqT&@vXm)Tfe^c`?T$r^~SfoWpC`-
z6Z867-;R^pk8l0``44NdFz>#?$_q=6{Yjk=mlv^Re?*+$o1D^uE48QMFD;J#x;Fhd
zq$r%Beqis#--maz-@W+PxY}o~?US<~1-q{uy>{Wmed%?3UaWm{B3@4Z=a>2aqf>OR
zoLCS!`)pY6(<6C1KF)FV^=m0sGd#U7YfU%*s`hY;YpS}lR#q3hzYZ!(zH!FbH!l92
z{OQT|JMs6zeXc#$TNW>OMg5Sk{hZTr&lb$dIJ?KA_n(bU*1G3)tcwE=o6PJsW4e7~
zSH#`mq`#~0J$>`?-^q{H^4Em*THZr%MSncE^J|>r^G)nOpQtZ?&hdKwtale@%~^53
zM#;{^=GudE@dle0L>zHBqa}3vgGX_G*ZDtUC1G3VYSu4l4qw0Q=aV;}GtTT9Yniss
zYbfuk`egSxFQ@N#b;ph0A@(uhTc55!svW=c-N~De))=0iwej~mJGsANGY=o=dTMI5
zW|rlVSu4Wl7(dBB`tIc47hB6ON=4LuFJH3093G?(<`%VFUEMhQJO7=fyL*3SZ`||x
zSxs@FY4@z^HGY0as{b`jypr&a;nU5C-aT<Pt7nx~-~25VciFnzZmwhAS-A&27fWw0
zz5`9~1tm=PjIZppKhyoGC_~!+{VKll*Ne6rJIYO~d0g~q!N0{7TkE&1`<y?qw4z-$
zw}<WP4#7RY)<zevu-RFaU37N!^!UQ6moJ@`U#s0}_V{Yu71-G5E0(I`U*=ivs=snR
zZtw22x7Y5-onv_VLNVX|JNK`U<TZZtYpP#`7lT$w7foZEy>hlql<9)f>NOU&zfMFN
zFTWn6otJfDH-GWOS(~MTk-JXzCn6VYti1S}{oU56ZzXyh*Y`#=hsSR@H}8x2w(0Y-
ze%YOiH<%TDC1>qUEAvZ@e6y>HECbg6P4_RheU|jM=;+JYmbboT+_AI12QEbpfEvxm
z_vEMf?SHw`Z1LBs@Q-uc_1GU>OxHO-=h&71|G%AMj@Y(E>vpt5(Ycw5Jx}HoyK$-T
zb~K21EEGwas^rl)$>m^>3s=aLMP95djtLTn@|{u`PDU<zF=6qOISc=NezVX2{`WP%
zYj>B=FK+X!4lP~3_1@Qg*|oo4+f~o!dmgv7_?kj`ZKLPLjfb=6?J(WTJ#n&S;n7Hs
zq7yHt+8FqpxiK?&W8w4~Q{Gz~sq1^H|FFiFCERRGWxvyClP-~8{BNWG*PDxvS+?J(
zI+pP4NYRnC4-G%YxL<qn;Apnby0!WSe9I;jYHv5R5nnQ$-`!_DUtd~pj4$`*b?4#=
z_z!LJKgNEs`sKzq2R1P;e<ypQ*zMSF+pP1QUp~&6Zn*i#(`^P>pNf2ozFz5wu45^G
z_eNQNXVI6}+&u?m@*i7y*i@^y^{5$s?z*VF@r-cz`!j1gL+#sxO}+Pl%sb5|bA<28
zXa8rC)~ieBO@03Jyo~QBVfAVG`Fmt+XV`XZJo8j_TaxU%)P2jjdy>R+<}trkdZL!s
z6Q?T|vv03<d(7TjPa?eK45$4O-E>FadIQKz^>chrc6M-n{WE!IVOG!DhdVpd{R^``
zt(d)fV*7O?zj;-aRhG|wym8#Oo|}ia$m1BF*O?i!3~ddH@~<qn`1G3R>y_xL(jP~s
z$wq(zasD^HihGxh?^j&@sr~xMy#F?AuOH0&f570gR5bhf8}~X7W=0knwe5b--NPI^
zp;A`mo^`<2YZs-X7rP&OV%Z*bt@rEfFIU8)K}MyrKYMpzj(<b+b9uw_#b=lwKeId=
zv2ISx>=;ASt?O-GZw)`UK<)lM+xf*0uGqci?%`d%eWOL?v9-Hq*tIXacB9#^|JtsN
zr3J}*Hrmu)ZBFi7?0aTbosL-VjYrdEBg!6Z*~naJcjCtfX`j`#8<v%q8=c=#`tM`S
zG@D0V(c=E+V_vUYm=t;5;^(o*^D}1NG|ztUn%gIKj?>YZ={~iSpI%s{x_#Yt`K@c3
z!}rG6RK3nRIyrsL=OFjHF?nZ?ith&n?DBuIC+7d}c|9@ua`5@jKA*JbSyttXE^q()
z@!HpO6M_q0-&Efimb3m!O8oVSHalK(`-o~CTdq-PGUJ9;_Wj$+JN2|gI}c9P_sd%&
zu6+E;%Y&Pj>1~W@wyM4wb@ZYBHn0t6WHbK$>3V5vRBT&u>{-%}m7n>)KB>qPI-cBV
z?VO_`v&-8@SM|d*RrS}8s<NL|RCisKIlGRV$E9`BS3ZO5&C=E$dB4_d{h_<&+qB8G
z#^=7S4xRjY?b2xxd{U)VJD*h*B!4Y}_(lCc)F!Uty%u)o?XP{^TipD0mHP5D*}WU>
zs<#<bWt<dUZD;xI@@doS-H$I8pT6~rDVTfGS2K_JWU0gNXPVZ25<1P=m7c%hOsxB>
zBM;Q<OQo|9dvTwydzn3Fue;;U&HjzkOF)^hj?4POub<vJ^>s(T>YTT*O=mlAUA6PW
zo~!qs-PHbivpHg4MYlKa>aC);_Lc9m`us)m@aZ`>wr+j)@65;J^7iv=`|W<cQ1&}g
z>S<Q&kvrq-DpmV$H<H^Q_gSwCjoOgP4o#=Rh3tKn&t^1AU$Y9|z9Gi%n(;K{Hv5My
z!fqAUwIw>^CMqOV9DNoSGfCO3i|^%=ZrwVN+d!HhEZ@%@{5&gc^7H)jKOY>cj6D&-
zCwCf@029ojFP3v3xwLp?)vKfmi*8*=20P6+XN&cN%9)`R`^sIP6+C(QaLc26KkJ|T
z7Q6XWuY6}<j6RFWmd33|GLq&-+-_T)rhjki8`o|(Te;5>QLpn87q2M1{%G5Vwl5qU
zv9b3BmrUj;_%AX4<DI8V)E=*Te^uyw#l`Eg8P9j7OK!iZ&b#aS^ZmQN$TS}Bd@m`b
zvs0I+?{DwNt8a{3zgvWE&W*eNT&CuH)bS|8E#Fps6wIIKc%n7LaqUU*<Hf@11+N)|
zCa+Hud4ES$@7m|!J9Ap^#qckaJKsAi;@C>{V^_8$ZLwtcOZrwe?Ot4k?(dX4msRrm
zn?G3IuCvrmel<0|*ka|$9j{idysrQ2=kM_ElVwiZo}Ur*u2`G>cK_2oaX$ZJ+>hDz
zRusKeZfjTHe(cKAik_^qtJ`cWC9g+)%Q%{_a{A<X^P=>Z&8zMCm~rLmj9oJ6D@>2C
zHeWaAS#-+OlzC?}IL`6L^zDeruE;MnJQ>)3d_|^Yw{PXob!TJr{rExib!zP4(|2sW
z(s6L}{Hp4X(^nUtjM%sL!;D{{+oFxb*O#q3zcqx{cy(yq*~#;(9-lJ5etNOL_Bxy5
zTJOnwwa&-X2fhBjtA3^Nxn#l57S%g{OgS%SdT!>CYsO;9Y#S}(_HNv|%6z$=d#`D=
zp?i;narkbh@EulrYoD$-9$wo$S>n%5sp}nfkFTWLCsh=EoE33)v-s9kjGOfhx9vNy
z<i?I)IUO^s%nQZU!uHy1IaYM!#N{`cw%Nsx!~C~&KDRn@^i1sL;)72cc7|<ywOX!s
z&NMs2WScboFS9;xzISNTy0ZOt*Edd&TX}xR)zzhMR-TloJ?pRg>&|SOV?C3NMc=y`
zUp;?o+4J~wxrNaZdp{eRO!Ge9HL-iASxvY0G`YO1!Tx=v25Wu^zPWR9ZEAJc9h=gE
zvsbqoY_0e)RePG;I-8_3k-;B-F&S$;T4#2;^;QJm&g~h6E*!`0ZZ2N#%Xjw7SH2TA
z$*-@TF8q7#=*hL6JM*$SXEt{>XLbsv%Ue8Kxqfr@`cr3P^yFk#|2=a2(Ye@XlF{q;
z6&ao1@#@TSi{P!RzVA5lyefT8&{zAPC;fM|zuH*JY2AA2q|M{F{!=GylE1#&Y-(GY
z^`vv<YKh9H>3a6hJ1-i4JtweyTFmRDa})c|TXqV+zdFZ!slVU4)mf9=d-oh=|9<WD
zM62Ibe?li$erF1vJ>hzr=wiL)*Uo(X&|z9yRe9xU<mGUgytPZ`S@_l_9lN$^eqoW2
zvf2BW!sg57N7-1IR|lSt$-8=c`KPBh{o_BbQa}D=?WV)kcTQ!$x2*d8;Hvty?$^7j
z_Q=(FUG;w(xH_zVbCHp`pYO3ZOJ%;B7C*is5q()*Z`ty+nCA_}!S81Yh3E4Zo4#6`
z&j0AiO!aV{^;dWOFuNyr&V9CF<<lA0qaJ-x*gk!u%pUV!D(7SLEY;GdZhgO7Tw-?W
z<euE=5{BmDS$yJairy}q|LE{ZtB+Tt)-F6fqo!}=%*|=PciL?UuFAS8zBg*muO}-6
zCqIAl#!+W~xPR?8lX;7`Z<i`c{-V2i-d3?~zP3A;AFa6j@9De~SA(;UR#*OcnY`Yz
zYQA#TwyW142l>Z8zkOTA_t>?AtK)e3Rm)r7?7JUw|E%4drROZJYfPS1Y9pg#_;}TM
zo5#0q@7r2_F3|XRxxRtk7PCTw3VpZNPET*H&pI;KIrhwstS66(`6`P}e$QIB@YUve
zeYfcAsq!Y@)@__~<+i%%rw@;kwl4p*M*4AZ|F%~T8(#LhCp^y!t}p#${_^S4^|RJI
z{UtnKdcM?`;NOSsQtn3BfBkXNGyl!MXa52ptEJ7E)$>yEdR<mbc$LM<>CuHIuhvZ5
z{z&l7&eQu|tzGIL_o%wJc<z@I|Bn5NQvbfA!*IvC`w{cMhVitmj8EPDzF2p+_S-id
z+&-}zj0$Zl^w&uho4)#z=kWE~)kya54quBdORp}M?d*P8ZCdzu&b*@7WdFy7Coiuq
z&wX|D>q>Ux?d$XkllK&MKYtUZpOs<w`epCtxW}5dF>9}9U;O_4{@%myQ~y^<6?~UH
z@4L=)&y3GcRn@;<`<Qj?!G*b{zh51_`f_c0|B<S~PuX*3MJd0(Dtvy&x~o$6ZtRm&
z-(hH%oSpR{bL;Z0S30-a?0FMtxwY&FYunLnInpuf?k#+h^m6U%x%&2nr3FIf+t-E3
ztUqb!e}DDY4_BnZ^VV&?c4F=8Z27_+uP#SlUvBridG+MUc3(d{QL{VRzWkZOmvgH=
z&z-m<;_DX=xt(*499?Cv`qFZq<?H7&HdOry&0qgy?UdEOyVCovMIYVle(WUk{7bvd
z_E_z;eX61tX8G*Lsgt*s?O2*x_vlz@?8)ZKkH21<@b^JT?YAxMGDTlIPkP&juHS0B
z#2}eJZ2s1s*bwg1Qq9KO*Uu=m{kuj`J#WqSzT;OSk7rwk$N2EY`OM$yYd9-w-O_7W
zeSSXt%jQWeo;G7++&PbXJH78j@V7^t-We$zzI=Kzf8{q}_4B3qm!juiO80+m`G3oT
z^U0<2g^KqV=NH9KivF6Vb?@@&?aM9We2>lE@MdyMRYlB6#^Xo6B)k&#*4r3n`KTi6
zi`VKIRq1N+c~w;hCoaDyDXO0TQhQqMl^enH=V+dpbuaRX<m}V8zjCoHVz$-T+qAdp
z_oD6TN#A^V=9w3i7Ht+cl&LKG`pxuuy1wPj?MJ=O-q~^0dh1@xN4m91-@JHoU-do>
z>z_7zk7d=)FJ612UhmY~@#xnyyUJHjUq8$!wcD{Lc=f%<k0YMT*zeh*X>0oWi<w{T
zF-!THXj>_H^`tX1JN*;2uTK2F(teYbd|{dQ!ycQwpOMbm>)4wQ`|{+^v4}Y{Z*@*-
z{KhM%g^llb=YLHoi+v7iHtB^3b_<+l-MV4T_9T<i#+%2bW|$jTR($TV^q(7N_w|Z^
z_4?x{=N+r6o_YSGu5Z%1_PEa5(mIw?(|PCps>+$UI(&NZn~62gqqASGeR=iu)s*#f
z*89bmcGrEqbEEA49e3NR??to!hTC_Qzl&+#Y5R75&CY92R;_)_us-5hX#V`>4{J@s
z&TM_KcB%TjRXgi`@5n2;w`$+f(CMbv6VFD@^gp`N{Mzl)mA~F>uj}qna`L>oTtoV_
z_nM;UO1(=rKSga7W7}_P-_Puqbv2~V=69&St?yo&tfZ5#j|RtNN&Phz_g_;KwN=b*
z{jNHL9pA1rXLtI(eEK|R!?ZY^ziPGT{N}#4*VtS8#d3A4?3X{n+5aP|-z_YTsjun}
z?!B|K>Zfh(HRH1N!i(LX6&-jk^()4DmsptPhdJ%%t6m*_y6EzeCmpNvD-C>YciL{6
zS6FoQ@!XA^o9jQl={&#7w)o#KrsRumlcLUQh5PaeAO8NMXpZZ<Ju9O=8HWW|H|%En
zdD8G$_Eh(?yY@bLwRZOD%iWK)&9fzU_Z`WaBl9b5-o~v*jFzo`E#$vnd~f#B{;KB<
zp*GoBAE#b_rD~s@RDCsly`|yjN!#!Loc-nNj%{=M?RvK+KYD4axA95uqPe^0&HEMe
zH>Cdg692kK$F9VRN1T1Cs$ThN?d<Iq-<q03eIFgm`jWBc<y+Tz5ywt$3}4&5Td#QQ
z%*Ca;6{e30dcSTx|4Y|M+R<kd(}rm$w}%yfy=MN?>Ugu0``MU$`{L)bANL0LuX~gg
zZL?w8%8k=@{{0wSwe^?W^<PugM_q4F%kE6Kx0tFfekWr6wV1t@_bk4?i28BTcmC@)
zM=N90w|_l<^S{lyov*)dbe_E|PN(w9mLo?$ob;@jz2n=8%|`2ApN)~*_wCHrfXR#F
zbZwF=vyN)3r>ib+zs)~?&XH=vKUY%T<<t~q>1P!M@#ohzD!w#b!<)0rEmoWT^wCtG
z+{vN)cHX=B<k*)jedlLw{CY*=@!H$oYnFzyPrq?TF6&L}^(V6)M@L-S-WlthweQ!}
z^?dh#UEA)KktMb#zvi*D`x{oL->c3ipRw9;N33t2)&G6d_CEXYX0}xF?~^C*C7gTm
z1GGIf|HsGv`ZFh<{aIi8Hv8~%yYD*-Yrh5mKP>;R;D~#n`+K=(x327-rfIuX{_hL-
z*IO4Jd=>RcV(sf<zK{HMADTageT)(RyW(;0$(@NZ*1w+>_9pE7e1qF&*|*HA-@31w
zKGjLKz4K&t@bqSOapSbPq1wx)#q8a<@6k<ezG<~#CtmGqS6?m~E^A!8&eCRQMS)@R
zukhTXWqV!IE*`siLQ3xRtc{0bE_B_DW7+y7bxmGh`Py&Zy{|V-+c~4=w~Bgl#gnLO
zQHBwpg45?5ztjD6+aEJ2J&p6V?~2>M@B6;@b@%C``gI>4=9TZhUGVpHeEr>d!diPk
zuFk$^dA{=8LpJjr2MgX;->?30bN=6(rqdsM?63dx<A1(<?U##(ljVQkcv!OB`j55u
zyVLgnKil)`R~+PSGoJI1=kVqE|GqTNlbF?C_hoVNnY%mB*S>pbb$#c#58eBJbRWKX
zzV6%C$$u{P*M0f$vA@3NtaJU>)$z4Ep4+~+ob%k~dE{rg&ohp{d8GM3qW-gaeesjM
zpXa`p`S<Vr|GFQK#P?fFJ6|+yGf(-h%X8bT@Bcja`nl<x=eF-Fefw<Xzinveoxb-?
zYWw|PYwt&$e?G%<<F{`g;=b>?Ua-t~?n$x5?+W{??|j(UUz@W7bcX4j$8z6qTz#FJ
zUwwN=eEqNG^;R)o7KzJd?_3}JyXfBMdF6LcKj#uZ?QZi(@Nwa#&ragIE>!8Bi(>A5
zV77hd*$>+LKWRJ5RbN^*&tB%Y<oSwYOV%e}-_DlCvhwB8EhpzYCx5>nv-i#$)28-!
zS2|WIn)~@3`{px$m(=9t`=&N;JtMhR%699MuSq+9T$!}^V$bVY*Tp5c`GOpnv(1c;
zC$D5Yz00)n$C}B>x;!>tpV$Wb+de*Ht7dC+M)F4ws42WY-n-weuIj^_*D@cUq}_S6
zv`xbKveB3LABV)-)NNmSK4yK)SH9zLMbMvf<@=2H{C%4*|L>Fj|DqkoOxGFC`(pR=
zq(5K%pX2p5|I)bn|34ME_xs-WeGfy|S6!{R`17#+pTn`@l75$BME-rR|6g8lefK@n
zIGLFJ$4}?)*02A0`Z)K&@O_`AKD>SZ-?xg!#_vz{>nnGhN!2sH^Hi@~vR?b&{Qp1a
zKfM3{?|pWg&3^U2F83cl<{2%w|6=`*!}4;K71z#q&aV8lBVkGGhbD0u@TTlGP%@IQ
zd-uF9@5k5p|6e!$|9$`ezmF0-4_tV>dH&xwAH?fFiYq@q$Y1xNV$T~!bIUK!%zxB;
zZT==a|HqLk{`VEft=E0uwYB}7aJ9o3xkAO~hu+`2DX+iG{qe_5^=oS%w!D)m$*(vp
z-DW)h=b6Lh`+whk*qdMTxZsT8@t)f(?Y5OCoaHt>`+s}?-`gKv`qx)gJYbgJanI{o
z+tZEFIkxo`Yi{1Z_t{<dbM&!UYriIy$SK=BUbQl&$nr<j`mGZSUaVWko!9-o>dkub
z^D`w+7pI*)y1G2}LB^S@*5)6N7=^8$Ht*G!lZI{WYxNDpKHS-G<b<rxnv;s>cO5?Z
zA*twNDF3u+vyNoHnRT#tb@=01Yi7Sb*!wlZc-!<lQPXGNi_oj{()Z`9I(uVQ#n%sU
zKMslW#sB|xoxLvjnR(vZW9IulRwRDd?iH6<VE7=kQ(b7s^}X*(+q+|)C>{Ph|Nozd
zrt2%ue)w$v|MND9zoP3aj&9^PjjP?T%)~DxW<_50?c03%)i+OHJI`DhvtV8A+w6WJ
zzYQ@uaX(Lm^ZoxC|KBv`b=38!?~{)ke(Z9&*KYS^;m4~z)lB`S+k58C>5%`>z}|D5
zrQP-+OYc0>y`XH|^!O<6KAWVo#}jAUe);k8;K$8oa;w|z|2#~-y~djTea-84+*_~h
zJF)m&a^Yd=dj)$6p0Ki=+j*{Z-9tC?U4mOK-uu{B&NKi2pXcR?*P`~7zq!8q-dDBx
z_G{yk<h19_PCK)!_oH0)(G#2V=4<XXwUzpvo)f=!&a1hRl{Z%(%lh_eZtL@9lFv7u
zY)xL{e@0GjzRX^WJ%`_?zfp;7=;_q-%TbYebig~WUwvLoa`q2R?|&le!-M1d18qu^
z<o53?dZ23l`q-7L>gHPuUhfL>Uo-7S-I0iECw}ry3D=rqv1f-$`}S=c`rq&QdnEs+
z`Tn10%VT4XJvt{V&VFxN6{sLP!ejB`Lj6nc_@GVSGIj)fn8y38roY(NMkMCvsc<>v
z`-fJQex1JKi0ZLRpi=l^cX-{ib5D+B=EUx`m^1C<YSVkqX6<gznCpDzcH{Q_f8Vx)
z66#}Z*A4S5?Z2K}`#Y&Oy!DNyxWqjEntw;M&*z@~`Rc^?&wozVt-bMhOPl$!X_ncm
z{=_V=G2ByCeQnmx(%QMoeD`PF`toU+#mV&>t3IBoHjK%xNdB&D_<NaK+)<<L>95LT
z6FxPlc2AVPe4sI@B46*?EatP5)7PIWw5vEab$y<G-KzDb*M0ov?3j^#>hUS5(&E~0
zLG$C}W;~1fQeg18XYI%4{=%l~Pfja7f6M!3*7ZHlUaXxc@cHIR(RBr_AKz|U)B9xZ
z?%8+Wq$OAU`FNbW_g{;!pM<~N_I+R1mOoTkYxiJJYRl8-%*q1gd$=B&7uX3uT03{=
zv5yNYpBc}$d=;JTac=g#FU!7K-Q9j~&93&T)2m;wKQD?nuK(wdKF@QD<Ce$HuZns-
zX?1?#vTv>1kN?>7>eKZ7e|~tipFe%$uy5G&E44RXe?GqN=J^>>$JShwIqzG$wsHBq
zT|47y-)8dZ|6V11aPIC^{(6O1n?olDf1DLQFMG=LorSUbG1(P)H^Y7Ue$BEL)_3<=
zXIXchbs1mFgc*jtJ(q=x7tfRVm2j;$HsGyeZJ(Unvbw2n|Jwb&vi0elnAuW$%wH9)
znZ4Vpu=sa(c-`8=&C2W6SJinRJy-wl^ZM)R=3n<kJz#0s`s{NU&-=Zf%Vrn5eL8pd
z=ehEI53|B|-}<oY`rf?1J6TNa{C6H;)ia3sx+;9C)ytg<`@SsImo<&KaB0QgtMPxY
ze%P|yHuukjpUUz-PkfNx|55s}r*UP?#K!YNdp<t2Q!jaQNPORi4;R|)N^I<^Y(Gux
zm$~<8+V&-TPOm(^$9v1<E4FJ&KixSTW&b+zyj7jrA#FvyoZ{Sb`wAXbzK*`XYu|<f
z#oebu*BQxK=XammdQGn3YI449eFeAPeEXk&lI?2W+`p7QH)3!0cD}f;rsaNDZ(YB4
z()e6l(z^R~x_h_&t$6;jSZ_wfx{H;O)5EhLWL#B0e<S(yP19}f*KzkG^z*z+NVW-U
z-*w^3RQGp_)^7cETYCP+D#K6Bn_|MhrA*s8XSQK!UQ)1BwWagAs@iM4A6L4so+q_2
zU;g9m%{L@uc5Sv-Uy${}aIbo%y~Vme(RUt+G2d5ulq>gU_WeK4DuNzg?Y3RjHiy5_
z@}>O?M}DavViNLB#eoNwZw$-Z!+U%>YsKvL^EInt-z14k|2Q^jd;G7Z@wdLdHQQJF
z?aFey(jB0qo8xqTE;_t<-q$s;xz7s9ILjtolMC~Em$-J~{a0bzrSuE*t1fmQJAXK8
zPS@F+;&$PWn9J|UUA|$zFZRUks^Dq;vBxsDRsK70^v{|8h@Khu?i}eUPCFKw&;R94
z(0tp6iPw7F3!dwJP5L!2?eeZG;qP~8&8z%&PQvfi%0gjdKi}TTuYC;iPHs)}{}dKG
zukNqn{sU_7n;uA7hvf6Wezta3_m_rCi&vK#Sgze=YAd7jxhMSU&+i#qrMCC^uiKY(
z;A&|6&TFgNWY(41?#MU(D6RJX>}_GbWzR)9j<FtEe|S=~`*HJWKXhkDo4(q!^~iIR
znj7caukDFtJ9j(%oa=N$%ljW5Ju2C@d2Viu{(RA=*XKS=n7;4J(&OPeFMb}o>K*rK
z(#P4U<~vXNhP60<m+8*G8R;<j_#wj&qHk~CeOLBad(rj%|GqxX|GtN7vUz)Qz0G<d
z!?=eV+cVFV^IKk<R(K~yqH^jn^Yt|`Md#lvomczucKmVK@;e1@HXiS*F1<YaUdX9m
zZ(Z(fdUDM0*J<|rxgT#d-ju#Sd*+Vnr&iDH>aV;kUiUgezfS$ct{oCP3#%SwbxK<M
zuU~fU;L&ACUteCln!Gg5u(GN;W!}drak_E5amL?veBEocW0utNW2TLz@dq_-JSh(3
zD{qLK6PNVsO?+jM(ELY-gBQ2Yx2U{!;(PMV)1_T6g~f~2c9zy&+r$_5wdmu@_T#<z
z^@;zc&HDAEc+zpZ4~_giakiW`er|tqd*l_m`=89U{!z1Z#$>6@I~M#sUjOI#0rQRu
zYqhhc7V~e`9O#{PKKM`8CaKD2FMjSaQ2!FX=aJ~4*#3JnCm20*Ij=3#v;X+XTO9B1
z6fV4Zr17=fr!JkdKiAs&$QgdF3_bQ-MMgSaT}-~&S?19l@#|-|KfEEnuXXuHt=90V
zfA;dn?|5)5dU{NVWnI>p!nrSAq@SOYeEyZ~x4m}tFQymI>0fUVbKPx?D!)(P4%?@v
zH?9j`F77{fqs-@d{__gIu_|w0wmkmRruw7C?(f$=`m(|P-Y&cBf}@@0Govc+a`*Ut
z<yw`0_2`!j8v(<bBt0ENi%)B2FIO*Pn-}AA&%+{Qa<Jj&DE~dj&Uwc8`0Mt2ubWZ2
z*J{tknBtnGBP+vCKbM%k=ZR|j^?l#A9$s$ub>-K(RnLog?lnLETcPLnp@Q3Mug$)=
zGoBs$^$XV-A3tba{-kC$4{yEuq4uwPo-)Vn{1!U<-pz!m?tK^g@BKO3rM`7z!3)2*
ztDp6S6Rve0{jui6on2M;-W{%)nk0K>M*jY%a#5deRF)o;dv^cQft7Cif8Tj-_c%Ig
zPnT!0*u8y`&qXKvKBUj`;fI)F{{4@~C;HcYn#}(1fYARb%WYEs>@w@OuTROeH#xV^
zyy9BV%9D3re|Fz%`!T8N`UK0uqSg1dKHT_Z-Gr;QwW~T`X4@89=+2uF*K2vtv^!N#
zO+Q<%JC4s-h<UsJqYqai*e@UX^58}Fv^}S8eif5+kq(V-E&g1U@FHr)-<alokDgUk
zPpn?BPFCmf8DaBtGm|p-4#i0Cec?NAhOtmFZ_(A4lV?}Gu88Bk^L^iUS%0nl|9|hd
z|HpfJY5BdNhc3tS*Zo<0*m&N@o{wvF@6CGHFEIZ@i+ax<@7PyCkE7H6FsiC+{&Q<R
zuU2)e%HrTBt(NsiK1FiWD>q-=x@lWh(WYsJHN`gTD=KF9gnP}obM><s?`z-3+L!)3
z)Tp0wvbE*BQblw-w}@@W&*tEquE*Oy#<-tjxP4x3Q(aZT<6Ng}Kc1QIw{(AF^)I${
z?vcmmYj<9ny3XWZp{lrBUwrXj8UFdDA9IcBEDx+Xd35)-BOMQeKCj*T*QWl(bD6y}
zDytr4i5Ay(c89)=EB=0Z>qU2;{QTm*7WYik&RSG2Z`-x&jpLkKPgZ#9RBwBvnRm``
z+wpbWJ<ZW_jLuoi(qC(`6Th8|I`+-$jA`KOm)gheDzaZ5e0%kAif!_bYSUjK-e*j=
z8I-J3er?NRr~Xsj?qlcS;(4FvH10q5@89?R{5ExU2knawMMu2&d8fsG)06pu4{K}c
zHmB;=e17%s`~Lq2?1h`2>iFr@G%6U@H9uoI-2VH4MD2s5s;nb1EW!NlvW9H!(rVN5
zQwp1&%rAX-|N5iD$@^H3N5{^2acKvG?W@3kDf=7sAG_mi{&BNi`+29ed&7SdUip9D
zE%q#ZQgi*>#>9$ihg;{=Yb|^C@bA0w{U43xzse~ech&zA`FQ@bhw)kujAifLJ2flj
z`UKN&4W%DWGp~1h`Ea#bY1O_>XXTfEvgFBMx{+PtZ`9tkKPwIh-#-00UF7|pr@w@a
z%l1CGUG#Qg`Ppa1dy6N}pOL*ruI}iWXwwb5jy<t9w(LB4c2~q|^BXe7ZbibyY;nJ5
z&gD-!p3bq~P&Lx&*P8S>b8?f#o%e5vS+n^`MDzN27L}dBhu2)M(3!R?;@96-o5PP)
z+H?y0UtRO~u5^;m+`3l2$Ja}L^3Fdm`s3`>UDIqkEG-L#o~xwD|1A1>OH*AbFX7V;
zi=Vj*#q^Fvo9pf^j*yOd)^N3(=l-ch?3>@b{1`I7^q$z`c<~2QePfqf-4lB}JG?09
z{j3=4S!*V5HoK?x<n_+d+LNXH7W-`SsuE<ZkI$7#-dg&9<!=3&Z-<lDw#_sB#&otO
zd(C|5&BE^IAD{M-=dXTbSoP#{dh5D(Z(W~#Jd__<6kWQ(a?Yx+62ke3k>__D%}uoR
z?bcovp51r+Q^j5Tg4ai)ijIDJ70dps=k0Wf{JqJqxq1GJxMgqD+i=aO+~NH52XgLr
z_GPTvDfVIIj9tGhZ7eI+zRK1uHnrV<_T%@ehTZ3UWnQhb-^sr6e4Ob#<NaAN`W3I1
zSFBuF9h3d#&Xv<QmtXlQ_c-qQ{Y%Z6d;f0kE9bxaKPvm-ROfq-p8mO#)AjP{F0;bT
z>-_T9K6@ale7xvvadOG4&aGFvL*Ex}`!aR6=Jy$2K4tU88R{Fn=KmRM<8l(zE<cjX
zW54#<$?4Y*Mg4tnvNU$9`=cW>4~NDl|2`3(y^fE6S?A={8^ek}JUM;4`~6zQ>Z?C3
zXV2Ohx3<!IzG-sFv76z0P4^UjdiHAa_3pQ?bBce=_*}j5Pw=jJk3UO99e-1J=<pMj
zxUU6Kd#<Ffk>d&Wo>MHed|BvTi+QuIT@IJ~X?ADMdcOO!b>sb>t=)Rd_<F0`o>vDq
zr>!Y(i`)A%&c@at{lQTo^|E;~#aTCgF*yfG-x8V6`yh%roW1XAP3yaT;rpd+jhd&&
zB!8SUb)$`yP_TFJ*DC_mlW$+@e)v>4*_6FFtoP*iteeHF+@H>T9jWh@H|Otxr>8D2
zS4)2VYmMaN-iL|jjt5_Uvh>)lS(g{xt1X;=r~BT&gT?oY^p9Sh{rc*R*Tr?mu57*1
zH1qY-+}F#$RLWRxKK5j)x85@z8woqZub-}-TG|)7xAdcE_V=iwzKwe?S>KjpfB5!g
z%=J$Hp2&iy;r_L?je$HT+qe{xo+Nz=n|jz^rbs+-?Q`>wbC&LV_TbxrVsF3L<ZD;L
z_FCLI<=+#rR?23YMdi1X7L|J?{>JI1UtIhwA-Guke$4$#>AK0!Qu@S-?c(|*YLc_H
zufCGgd0lkG@9nR>@8a$F-c8-RX_{ea@m?vLX?sshzJBW9w`9xp;+O5OPb~CTo)`1G
z<Ke@TYd6-se)hxU^{co1>W{<tmd&e(_RiJLJ1c&8ciJ<l?%mVAvbrfAQAy1cmi}fE
z`rhEntlG2Dc0aFVzpKeQwszmT<x9htZ=W9X`{CY$g6Ac8isx+=ytDK5%azO3t|$3h
zNKVe*bZUL&tKwxF|I7-XV|UVU+y0$adw*>E^(LF&c5m-w_cwQrJbmTQS=E2owAkiY
z@wNJ-SFfY)WbY{!zAdtR*)cg|+m5yAI&AGXWY*ui5p{KT@btyUX6=pPj+?yL?4#6e
z@tA#k&t5(AaplU5wJ#q_W%nGD+Gu-Z?M?4HTi5CvL>jESr`Gkcs6+PJp*4>;hOG}x
z{byUeB}`}8dgFsTcjnb{FAn>9W}0`**G|dX&i!%0`Rm;JX04GAdBgK7_0FkS_fJt9
zXWZNR?Tcvm^6h!@1$hsC#jLmbyVCW2VMUBw@zJ%f?`}U8oF7~F_1g1SPv0N6?v`77
z!!*i#dbht$p~)2?W%1Q<a#p^4J2xM>6dm5aeBIYarzYE9->vpzXWipD+Sf~08-`Eb
zy!Pcv!R*)EKDr(rn|y^%yRIx$JbC(`t&Qcktje$FG7GcLmOkUL{B}8g|B;T({5Hi|
zMcMJcBiG+K^Yqcv>vfNcjL+Yw`WifE<*eE#JM=#8+_zkOx&K?=yjcC?G4)ZGcfSul
zuFtN2{_p8qb1J;@b65F4O_^8tHqqDLcD}gnz8zM3HvZ}g<+YUgdF^O$eD;%-r*EE|
zE4_O9{K{k3X7)y2Zr-`BOLe|PvvPgwns--UZQk~p>9Lc7huG?~uN5jEeJYM9iZVX%
z#KOMvNJRJMRWkd+=f@;RmiAtG`sGWf^ksitxjD1<&PmtX{_1VB|K2@UPJ8+u%bMig
zb2EMF+kNv_y-ky=>kFyLo0q*tDtle~orrZZpVveSTkF2K%U)yqZ;j+>!~55^e|cB_
zZPlJrC+}F89=rBMG(GKFPi(j4yxCQyox#S-^VYf9#;vX?c>U_>qqkFU%(*eI$k_bc
zy<^wDJo+MdxVcz(ao#$&xFRFB=C`{JXe?8RJkxgV$VpR!yn@N`ub+JC`TDKYu42~L
zBT*ZFJxO1qW|)+>PTp^Av#)IQtKe*X!^#IzGrq2r{1Ci8ZE{@fuaz^ROw&XEEcm>$
zKmOd=t#ie`?i649`24T9$9IyeRi<tH`sLc!D?J~NsUQ1n|J!=`I^H=q&rMI~vrm5g
z;K)kx!^tOO6>s0a?L5Es;F029zmrymb4*@82%TSf?A+<nl=EL%*#e_t8+tcY9?Lp<
z<@M&gp6&XEQF&K|PD{kS3ch}L^5nfnZl`q(OA|2XtT*?8=BzW1{kjsqZq}DqM_&Cp
z`u+9y+vOMK>*Q-*ZM;!7KdQezNz&TfFxmEV@5ehalQ)+BO7+p3E)hJr@TgnT!>)%f
zBd<T5voh{mKz`kXdylVQFTM6Pb#Cd3VqdxGJF7}xUR`}MPVzSQ{(T2DPA!V)I{H9z
z_lhr(=G*$tN#yJJ=hqk8OtZMPWlip($+I_FZJeXXcKpWI)0d;S&$lVGnNjie)11`U
zx%YP2Ri0b7_sGLl*_D;Ezf7I}=S_5S>91AU4{iJIO!N0Wrkls@jY>|vy;^nN#{T`a
zYhG&m%`^R)boIUK{px>ec|GT6{Cu|VsA<TZT^4p{tN2e>9Xn}$FJ%3mQ|E1xuj{mZ
zuQ>7|w$SoN&(oEKvA=F@ZtZ?}U3>;h_8i|xpIP0^-g1?C^JG^465X}yd~>k((r=-c
z4^{uI-m&*mc;2~{rbVx-s!#gH_~?trR~GCDwK0`Eym|etTiZXKojbWI+fv@g@91VV
zcAe`}Wgca%JRS8&QaxSE&-YmHtTjv39zXFpy7FX&*W|5NQs&4!iqkE8oGZ6~&gDzZ
zPao^B$7cI+udk}QasB7baG&_+J}=)+{(Cij?YhgejI;Ud#5cQFZLP{$r(LOAv;KE_
z{odjj=c8*MKUJCbaSgYR*{MX6^D*-z?nUVB+!)s*6TF=L{H$F^+!F6BJo;r?mfiHr
zvqOLH+;%HG#?H?0w>q19-J@ew)f275b5}3(n{OPH&!b<hp4W4Ij_<oaYdXWv*t}kM
zcGgb2okc?4as2D&$gOXmAN2LB;nN=meaDjzov;0~`Ti8Sd9@#ph35B~uADggo<-#m
z+r6gMla?<${N>0_vm#x~&d%4H-R4vryLRNmnR7qaMc;qaP`Nn0Xs%*fY`@<*i8pr+
z=FYqm#+!4UHLYuoX?yM=i3u^uAEsUGm)^7I;MvG0YvWFCT<6|=bx(WmlO3n;G0F>u
z&HF5rpJ=vf&l9QBYvpv!D=QwqnQiqtVWs%>@Vyn^W-Sh1zP_sX^)JmBzjc8=^;y@d
zbE<9sUAf$BTYUe^P3e6*qHN~utSY^!{`Jbr%FXL{&1+x2QgwX=e{gi|tL(K?t7EDx
zpH&s^F<udQJ=)uDV`-Abog*KPiB9kLe|`4l!`WMQ>lx^zt?vzb?r0ceQ{9}ZxBk_G
z%E{})ll4DEO>RE^AS^p^>gL?I{>86~&t5B%eRc52>y4>?{c--)D)H;KPP;cNZf~6L
zw?)fVUJj4FI@!PQ$@29dGkxb*pN`9^{<BiuZGGhB+tK{zXML2ZEn5EN(~~PZXP!Qq
zyw3S8mu(Hdp1a5!g|l^4Rnp7V%XBM!9#n1)tNpgA|M<drF|vjgh$V!(&KxZJ+n&7k
z;M;9)T~D1=l#AeQp3knle4X>1f8Ts`w_b_7y!z_tv%6-@(X>Chblb@%7WZXhk6k$#
zEfMo|W%Fu3|5)!euhxdf=<Yk}dFJQJlNLKWm!JFj>&a5P*UMdN-<^)@i?4l``E8-!
zylHoiTz$Fr>z6C9AG0sBtNm6`_iFRJ!lH-SCk1aGTYP>iXo0F-_3mX+!Ry1F=Pi@d
zsXh@r|K6-xqw{rFHmmKgs=oen=Hkfs1d$YF!`f?Ei`S&~gnf1pIxR7;R@-k~+&r1W
ztyiK=Uw><wo)+sfFHR<YXXNTaZ~gYDS+z&M7Oa@4K5e7So{C>rwkMU$*c!TR*K+?y
zYbAKHuReS5>fx?;w@%Nx6El5=%$}+}rKX=IF}Gd)sqS8z-Mjj#{LZ?9{>|dM?N6Sr
z>-_%c*6yX{|3At#+gw*zcYa@I>KvKhpv6w}<koS=o_!l?`QV-Ky<Jt;r_H%?L;U{b
z8_s#>0;X?0wO(fD%elH?#f9m!A79U(80qpx>Bxs9O|^Fqr-twRHZA>KP4ON>P}}!W
z*4fSG5vQ+2oWAq#hvwd>+NZaU|C)0C=T!HzaaESjLiy)`R6$$FQB_-Q<FbsV*}M0z
zyCq{gXWrbPuU`viZm!R|!TosU<M!ancgfu4yw{$+cpdd(;m!6tr9$d{>z0P)M8{WO
ziJW=Zcb}z9<&P&j<X&HSvP4d<;%Vq!n?1k8)UPM_SH7Ig9=CJm^-9zD{Y`}pN$nGa
z)${I1<<0lq_pQ9G;_JG_pN_<OuWb(Z;hh&9^=zfE_~-qCe!2Q#msjim*u;FAZ%$2l
z!~FPv-5F=*r|x~u8lLYbt33Vop*7!kJXpECJ+8LsLdK^vUv1~?IzAz0;~Zu+z3tCl
zhZ}InW(lACWffyrp<h;T-v4FMy6jc8R~|p@SZMAx{qKpZTaq@M@?Z1qoTcRQHVfTK
zN%izj@N(uOHyi)Ve0|jC+~<ak_WxgfkPM#w`c-zE>634zd2coI{9iwj44?Ps%gOgg
zxAq@@V0HDOaoM?FOp7nHP0eXOQa$U)Q|k@SgO%OanilWfk$o)K`;OEOD+3<6?W+Wv
zlYRHv9?@>!^Xj0%)?**G^c;PXy6?zoJ{@a=diGc6=bZZUllAocn?0-V#q7QF=cnl6
z^)`E=3V7yO?foN~Tsq%$!Yy_mzKz!&MIK(>7EyOB=|kt)j~|{q+S+qnT%v1|X!v}m
zWcFqE9Bp-8AG_)96Q5nW?e)5fb@St{z3ravoFl*S)$><xmoD%BDDmdb&C|0gzJAi$
z_XK47hD!E7Guvj`dmsDxS^fI_YSW@CPp*iC>+IdT%FOZ``{7mL+UIR{cAo8=%Xs~<
z`L)w8&x(fY%m4kw#5{ww>*|W@YNr0Ze`6X<KZeC+7hO8Nas5uYytO<1vQ8SaueR7~
z^6F;$tV-`_!{XXkb0?c_e6`#n*!1_AhbLnHY+`2L%N%@u|H@gfSIjwMJZ=5<W$gKX
z|1>3@G@foR#CP}L=V?2nYF@pGe%^8V_;#Jjt#+Z4XU~b5URwL<z=`OZg8Zznueo^`
z9@%6hXWfjEo1qr2AHUXSkIcq1#@pr<ANe5azt(hP41d&zBPaIWjLv<QbtU-lldjXz
zq2b?8GB!4MrsweLJboe&zBxS0s7-%)*7Ta2jl#+7+baM4yyN40Y|Z+jGtpaZ<SKu?
z(QadZuI9#HZ2IZRgS{t@M~Cw-3-!_aI!C#_Z+rW%H%s>womnY;ee2BI;`3%$8GJo=
ztF+N^!3nml3!Ms!_f#c)JrZ>-_<r}*tFGPQ^J}lDq|M0|K3u(6@A$5r#z)V7)U92u
zH+|l*s^8Ztx9a)J^mpE_Zk5}&y-p%>Q7U^~mGy<Hf2wIV&wsuzj^VvmA-&gqy<G0q
z^m&C>FFD(qUJrhJWouH^7n4uX_bP+4x8%=#_%V3>uQSGFyjdT=E#0>7fQm+>j&zrz
z-y9k5Gdr@v&RngH4JewtJ=f>{w4G{MmfDY-E$aHc-$xbkMXZ}FWp23hW$)YVEA97O
zN%1)wd8B&d-&fy_iZ9NoDN8u_c>ejFJ(gW7pRd33<=8uibIXtUp0O~Mw7wr#VY*Ix
zZ|Tn>?LN1;F|~8=AHH~g<EhjCj#d3i^_f?db?3ki$=6p`ue2yVWA*VDQ?j#zZf9rb
zYuS*!rCW|%$(}P~>zBm|&)0nuT5ngm)otEasoi3wk^Vk0@%^{$uFcivzax=<=h4$U
zJr@(I(nIIZ3abhD6_#(f=e1YP?27%ra?|EY?c7-}c|G~<RiX1g7R<B%=97O$D*H{0
zjrr?}V#BYU(vOY9*0arbySwk#m2f@FQs3U4aWVSq{B4q}yO)|TV=pW!K6^}e-si7d
z(;s~kKfGSwK&4Cdm9Y3~yRS#C>|M$3?=7QOxqiLHub$2Kmqk4d+xL3oe!D`$>WR_U
z({*2$&a<g~b<tA0aOaOBa~HeCR|Z#Qz54RX_`JpMrFD97m3wQl()>3+XfIdzuK)OO
zPw16ZA8ovClD{Th4L<*T<)5y_r!Aj+o3%Lq>t^>?Z*NAqe_C-`bbEZ(!8Nb1o)k8p
z|0z`4yzucGZnr$%{5dwix7Iujt^F3F-yTz&v|G=hOXbx;!HL}ug*Rs=o%FvGk?&um
zQ+iI4yFIH&D{WqBb-M23uvj1d{p(COzES7r*=u{`?8i>Q<j$4so9FF%vg+t+<9U}(
zAI#RRz1HzCLo$5LwJg4RuI#IG7UmZo`BD_U@2KGA?IlUNeKX?nPH(qJswy>QpMNOp
zY>d78`(pi_!Btt;J_euP|HR7O$KG9^eZAlLUBcfjj;wio@uXz)T<e|Jj%3G`ep>b?
zq(92|_;u5X*7J9ne|RGG`fY328M_J}nY^g8D^;)UIgrBqSj3RWd(H9Y*N?88JgV+y
zpO>}iozBl+Z&cMwb>p(09b0>E_J$btnCpx3&#trCX{lX$?cjqI&?eZW)4|Kdk3Z*m
zT~%qyE<StlcK=_OC*4cF`}*VR>*@0?f3Nq8|N3P?TI~G27du`be6VERtgoxu<8{AY
zS#>Y&SJ?TktvixR|HT#mewt&rckkKN%k94ZczgBJPPSL)JY&`@U4P>Zw-1+OSo;<+
zhG)F{WcE}ZowL|ae|}X~N33`MWZT}a-;Cxzj-GWShJWvo*SC!P<IcIi*8Q3A?3;M-
zdO!X6_dcb+=Ec>0UAcPi(?f=S@sH=#iM+pa^LWk0_xC36{QcbS(awd3tA0IsK5x0*
z?-LvIbZd)xV%sad^L4M!lGwOxp3Tp7&T?`-t6vLTR}atW%YP}fI(vzFsiiLeGQI0_
zZ$0T)t$6&6@0?np<!xIxgg!m-J63!~Zp+EDtXEkhR@W52x_6-C>!TlAPHkM)7t<Tp
zXZJk(OwGFW#&3G>MI}9WcI9b9@|7cBR-bw$x8{{_Fu&Q-^Sge1x%M%0YVz5gPqN-9
z9*<ggKgvJf_V1$jxdM07zootVCwt}b^#0s$C9;v{kNfG(m~({BE5ClvdGREj;<V+y
zSD&b+b8QaW`)dww+Pr%=<en6*RZZjFSGqOHa(~g9lfG*Ui<WJO{XeTncFLhRUO&F(
z>6OQ>9WW~EyEkj6-N!JVWtQP`_jY}L3RyfD{$8ix`N^594sNWQws}sf#ow3y>vJys
zf1++Lx$pDb_dPOSxoq0HCO^MbWmsFa)z_l*?9Wi=yIWJ{+yKqnJ@n15y8I!%{#*L%
ztrw2}J9)P9+S~4OyMJraZC@Acy8QOnT(6&k_iX+4{@p(JKWJ6Yk5l3MjAUxRTzoud
z-oG2k{j&G|JTvb<&dYw=<bK?*z%9k@|4z8u747)gn{RXH=ecsZ-!)%X$IC{X25mwq
zy>F%bHS+X~<cDtaj~q{Ve$I6E<5+pQ$;oz2?FEmzmfK}ZE<SyH#kWGWim11S%b(48
z5~g$A=j<+vsN}tWPZ*lqJ`%e4+P@0J9g^X>tNGe0bynw;-ak|po3Oyr;G|^w;jlIL
zq@oOKo~?~oXKKTC?{c`zKC5KQXB9j$ljrZ8QKyo(Bl!NJ)ZTeBiwiCP{f*B&*>@nX
za_VQZ>)!U&x9)F^7GA#6aBI(IGj%`Pnlp8#a@|kYz1sh=H@`>SscOkRo2MC*lXZ8l
zYwbQA-e2E4#j}21^u4UELkj~L800lPT^vL99)GoY`6J8E|G(w`FROTNec$rI&J&5C
zwK?senTKtX>4kUVe_fh>?R;@}@aKnD{xUm%-g&+@Z;!x=|Fif1oLwmUWAog%Ij@he
zSk9im*0{etz9-24O-*4@(&tm2b!&G%4}EXA&^K6r+MYG4dgc1}=I!+RHKE(`^qzAI
z+hww6=640pe=WFNePd<S^Oq}glRw#-6<5m?Hcr%FeBYEcXHHxU`>fY@ZPGi!?>}nn
zG`=5U&)z&ctT=1k+G8tkn|=GS>fO}*zbUO{Ps?}xQ#~HD_xLNRqpSVpc-M3{r{=`w
zT{AlxIsejO@4RE7(@m3Y%ypBm&yT5`|EqqzNzO0tKZoYJ&5>J~|MkpFN%ilbwPpoZ
zSI3opNcl6dzb2*POtPG@%_G5n3DAln`HgJpK?c{t*R)&9?>qj`YR8Ta-<SRt4_h8?
z?5}<E!FvB^>%*n%isybUe%4pM=kc$KsH*fwhUpJ?c0RnSuKxPdL4)GGRaugglRt&s
zeE3_gZpOvF3x@8eC3K2+zI@v8bXM=za}&D#YmZG;4xhibLp!f_a(Uk#o45_L*6SN+
zp4rj0$?=oXxrYy;?pl0UlkTJY^P9h)cGzR9$;x5X+fAl+vw7FF&e`(4vPN=um|=}v
z`lEugPkmml%zX95*7nbuiQi4GY&fOv|N7-YZS&IN$F~+gD}EmT(konQUCmSN^~YB|
z&b7F%#pao#YawE=|C5GlUd(l_e$x$Nxxwq7>{PR{T~~2byDzo+#aw^G$5+B_o=b$+
zYO@#T^`7+SIbHj8#*E8dleyJD-)Xko`1f<g-0tI9y1#?gTSlCob9L24XYaV)r)%^L
z_>QOF5lXx3rpuEXb$0VIIi1I6R?EpflUload!F5-@^@#}E|=4JeQi#2xO+{}#_9Y2
zJUx8e?%T$PcHeiN|1jsdP5O`b|Np&zSo7TaK4`@okNKX5yvJ>e>g~R+^yk&DdC2Yl
z@B9A$e;*1>-*M!`<Lx>9-*-IjleYWV>Cdx$@7vt=bi2<p4};b_J^Wtx{`;}>f-7qO
zJeHS#SNp!2|9suI&Br6f_dH;2|9$`ezvRE5g{2>6UEh;t@p<NXn>%mP%%$H|p08dv
z|IhrNXVTk1YcvnD+kI$!7=8cOwH?Pmt2YkEzAKtus2!X9ZgqeAjNj|a&t^RhUtcGk
z{~k1X{CHR8)53qB=hx>Pyl4CCV!zz??{eRF9RDTJZ~yPdL(r184^PzXD<9O`sn*@T
zeb3D1W2e7N+=nJ{p8VR^(eAeWm%HP>EP4o98T4WG{$HzKr`CS#j*oe--T(0J`?~KB
ze_h}IZ&%)g<Ny20_ar|ke3-j&ai3Mzj{AS#sptN!DU<cDx-|Ki)Gz+J56y?||2?+n
zoB!vD`tjqhL2G1x?D%9Ekv$i5;R^e_Y?=Pr8_IIweZ9{UYW;p%{Ma+Is&CT<PzXKV
zc;$J=eAR;wEsqp`DBHgK?uYC3f3H6-?tK1y_x-=`9>%_}y8fX>-6qlE^2~EArCUJD
z!w%p7d-pysfBlcc?cMQz9vzDQdF^vIo1Oa?x%{tu-g{oXeW>&5)6p-FPM(aAlL-4P
zTJ^-X*3{(LtGTl)k{*4z@wIdLk{m6znGqZBExh)zdgGhqnA*4Ab7yB?*=~@v&hqyO
z*44j`^hDdPn0w_|`#Skw7ut_)k2_cQZF9f4l->2pUzg|G6*yk3sBV*Y`7vil-OuUu
zl@H8c+W%T?FJ<AG_=Z!Sqj+M~so;4=|DILPzI`X{FSB=V<eu6?oD+oE=F8iBUFk3T
z?}`7vl#2Vm@0rJi{1BKi`PA#U@4GhYSAXaK|AGH8XU9(d>KljKv|}D}JwE!5H^1Vr
zV1Iu<uUz)qy)v(#B)vS&7JYB&yvdiI+yDRh@ky$*-?=#vpyIWE!uk3C|D69XW1szT
z|J7&BU;XQUU4Hy)XGi?!S=VKL?pd_s=h=Ka(89${Pk+RJ{`6zcW0~g>_HF*vw=Q4%
zWm>5IA;PlqQ)>rk8vXI(lSlu77B_!bEdMuS$>GB>$7j5`Q^@qc+5Sg!;P(c0n}i2z
z*Mk=0JwBS8HTPSg-T9TEc*(U}{^EJfeDjzk%jYdVU;pp(?DG@N_kHZutF5W411)o%
zKR<lusZh3g^JV@AT8oF*89p*zZ=(0B#_*Yv_)d>Q(MN6e*|C3>nQeH_*3eI1zdg*>
z)Nqew+}?XtMOi-k<ct4)Q7GGXZ)=qL`O>xV2UTteT|SUjB&#t`=FvRW{l{k>Dz@9W
z({5|0;O1vX9$c$=_wo6h$<Ajy|6Q+pd%Z3C?yIoJMHY>Jzvch`R&nUVcC)(EPny&G
z9QGV~a3jBH^6Z}dHv=E<Eqj|C|NB;j;G^xIcjcd{`p_(IGf&~+=bwi_0rPQ*TmC0d
z7Jb~>F_~w5(2TF3#bkfh%JJH+FWb7hS3OtHYt7<W{l4eKCr1|-?lG0Wyyk4@)%b6l
zrpulyp7*(DzvAare9343O#9QSUz51!0(g0~f6|;EH;jGu8mc>+{QtH7zty{~zjgb&
zZP)YMv^J1;{&wMbz`E)~`JdPHPPS2x+_I<jsJ6duf4ptK`TXM_a*g*NJW>4oxc$G6
z6^*A$L2JA3mg;;dt+QKRbM--SSNN%ntu=j%zW=Cjee&^XF-z=w%Sq?`f5(H?dFjXf
zIaIV*`ff%`rR&kvQhjG1Pubs_e%~go<jBn1+&;zYPp;l~RB*N3^Bcw+Pt89S+dk)v
z@wRo_+m6rJpUL|=++dREjWf^8uADZW&fd4PLu&GA#e4l%P1E9^cc1i)=`lU<nQflw
zb&tKR(e^8C?eE0JM4WEbuX*^f<#2wVggReb<p(p4m_F9W=DB`MdrUv>eP5e@<VfYz
z=Btn0&gb8M_g+<h=dVu(b@MAve{JoSPxIS#Cj7k4@4}`BZx!lhKRuGXeqzB3KcBr@
zuO%~1tJz^1Zhw7s`+4?Hf3E#+mj9FR<}~ZGZ`=3(Eod{IlUQ-S`kryp`}+UCkB7I!
zSp?1B_*wf|@{8od`FCPWZX7;U>i@%FUbth1shsq8sWWxgc24+MCYFD`^3qcK{SqH4
zLiTOGa(lDg@-^S*1<TF<^-G4e{O*}2(K$b5Htx5%$K>~T<AXzoR$JY>c67&%4>Pvb
zHF~~XHsf!he9zSh)y<P_ES^>P*v6f<sJwFZwCL$Q;<ry%ont(GXGhi~_V(zaBUh}m
zUxyp;onkgCTX6V@Y+HU}<bAWUWqYsgW?Z|=bf@mxh`fkzUT;rYK4YIXnc>*&q&X4i
zs_%W4+n7?ve9U6vPcx?Y*LO?)yyLXLk@?P0T|X_UptAaD<@xG+KgwiYJADW3&3KS2
zTb(-pNYC3`|DTcD)zs3X=U3?&tgrjJ`uKTWz0#H5z4_6$pml+Ezb^Lot<U)}O>916
zflf@p#bx&@F3*b!Kc9T!cI>Oq5<3hw*MoL_lwW;2@lH>r%#Hg0(^{jx<-gpVxBgx+
zSM6)drFyk??gy98Q(pP_=gnWc)%4b_ue!RrZTp_5x{uR4{^Sat&x~t*cl^^2<7Mg3
z-o+k0vr_tXwC#$ouc~eNep%XI*K~_dDz@Bdm%XzsCOzv~daH=1*k$XQ;AH+oj=$#F
zy}nsJ+v0l1x#ShLldgAPjk<oh`^S{5J+e(7A6A*x-~PNL;PvcJyY$~BUj2B`T;1i~
zZ~Ip(79aatb7iqyXy)BLc4Fr|_q3Ku`-yB)H@SE2VXmv5(i`!7)1pg{j79Ctf4nQ-
zZ@q8QL-UMl0bjplBtELh$@;reJ<WDTeTB7}b@?}g_4l4L<;y4DoL)0ojxTNguQ^Wp
zuRjm5bKfzcSn%dE%c7a5W72AN_ijJ=!#P-P{qDPO^H#II|9J0j!u&0FHup^Sp0m}`
z@bBA)YvygQU(a{WM>l!HoaD3f)`iN{^<F)_*7mx%#B8k<F0-%iVh)~vIP31dN57`s
zi@G`?{B-G6soFKKA4){8zgP7wJ2CQp{+s(d-)#5yKF>KZTz}8p!|b0k_w*jve$pl}
zHP_E3J-%XhbH4V+pGTJJ*S_4SYjtnmjBLy0;<r!l>R-L1{&~{9&!Oj|&BOQqx_Vq#
zOua<UV$Pp+g}vE4;0-aL%^y+~x6kj-4V?e?V9nO&oHMHWXWu&Ie0WyH(Ie62nKh1w
z`F{$VKigTbu6S<tADNe+lBddUy;<e#DOK5XUwvi&JIAWyIY;*6P#*EW^*^WAOMXw>
zpWk1(=ck3_??0Ee@6h$J-P-eX*>b;non*tE*S?6pfBAHI_-v_Hvo;=IyS*<yKEb1k
zsnEjgVsqxy>xYhh`0%p%>z|08T|dqCty?`^-LJks@Q&%M{LO8?G56Lz(Esv$M!x0Q
zhhgVH&4!Qqr+zxjTVIh>^We<(IX{|r319w^Ci4E{=WDF<0}GfQYoD#z`VF*wWuDt_
ziKRP|?Bd=S)-SX_Uetee@#9Aaua{d2-UBT)o3Fg*@1b8mr3~iB|1ekDYgu!4rs=1*
zR(3a@IZc?g>tCFFq22dKtB=*Zohht+|J9@0ReQdgr0!XIoc+t6RC}wwPJJGM&uiDj
zsLRjWT))$=TK-A#s|E9vV*+k8gI13|e(n>~@;%!|FTzg#(?%ij%iY_bozA=})Vw@Z
zXW8~;?C;OAzyG+bp!8+2Usic+Ld+8GOU=rs_Lyy7w|#ol=PRnyBZ~XJMy=jqd-bvQ
zvSas(ve%i}ZmfDFe7K@I)&5xirMigOwFh=)&atpq`0;(*M=_>j{POkk5AyFN?5*27
zYjd$!Oo8DaXSq)k9!8$8y7prlyQyEA`QDel<$I4Bo6eq>8QdTLspI?Z<6j=UHHb6)
zU?zV*ugFf^C+^^fX+C!G7q2{isB)_PvJG2*^_|CUuVdd=J?@O2XL~W}!JVpO_uD`0
zWS!6d@iddT^**L^<~xGY>wkaPnsV=!Q}eXa;+i@~#p@@{nO|GI-F*Lfh@AXKM;rGa
zK3)2DA4;D#SA4zn>t}xAo6i3Eayebx{Z+GO+?%yi&L+8dkMZX1cfL&ZUOQ{=k=1cB
z^MB31`LpiFjkhZn_j#SOTGy+Yb7;-utuX<Qt}M@b^}OQunTPM%5C8g^cK+naAHB2h
z8~kPK%YN)KL%p)lM*c#P%%5wqYp?Uitv?nWTN)oB+~1wQeF1y2nL6V&Z+nZlB~^bf
z&XYOAf9G}F=W9airCxpBU2gNCa(2&t)kjBeJ@&P2+bO@MyRNR!ZJzr3xcY*9E040a
zZr`)&Y^?gOy*A6Ej+YCZpO|j{`{v`;$?LPX&wKpUVtJAM>ZZewPk%OD+nW0KNRRFN
zoy&gxNiHjjS-oe?Q>)E<^Q_WOZcqF7ajt#S(OK&gj-6V#`xeKJtqbJR*2g$JjanV2
zyYJcw!)n29!R<Ob*Y29J`ONC&=TDyf<T5FHwfey|Tle{<?Y-V#wLVN=uV8P6Kz4%o
zjsvVd<$tH~-gv!VY|atKIGtk6z310g9cQ*TwY_&GdB*3+>EhxacAbl>|FCkq#`ATP
zXI5AGZSBk7e_pWe=0j1d^-15V3m@*d6lMQkSI2bkj(L;MTweTjPDt%)wy^7q&qX~G
z-8{|qh}Lu&?{{30cfZG%tFIQkJ>lRT1H(Nt?4lb^Zq=JM@5XJl+H?MS$G%*elRvL+
z)wDgTaiEiDCO_x<V0jbNkYui`esjda>Ad0BIVtn*-6)-~_;|FpPWH8{kDf|RR)2PD
z&12!!mDy}EIp@V^Osz4sX#Xzu+HvvfjWcX*BYr<xeXQB5Z$|AVwPovLJ{|?1x1(9l
z{-etHe^={#^|@2rpH!YOeX?^+`@z8F=RYSM`*LDlWbo`#!_p^789Or{J?V@-uC8AA
z=vj0MN7dOJhrL&KBz<GtzFwwUB`*8S<mYc*1?ThjZoWGE^ug74TT*Kw6G2b*GXGh)
z`v0yY{?$vr&IvkiJ@fg`zS3(lI_Kk$bz1x9UYp~pTX~ax-!$7JUxH07e>^dbKe%Is
z$W@EkSE8PMn3SzEZ*$M<gNH>=&#-*3(s;Z5oGSv|53lw;Sh!m(Eq3ou=;1k=nTzZG
zz5c0edaUYv_`3y`rIw&=k0wW=j;##k*Dw5ZWrBQ5>iMs%#}4wGsIX@)7N|Y*HR0T$
z;>Bvy3SV^^ny!_|J=Zun;_X|X>W9(OY@cUE)r#eSj#%-VXFb9GdTDEM-M`g#rpGEO
zin4uT`?3SF<4m8NJh|iAruL89K*xl{#V349FnY(CYxDGK)q-bLg;f&4#@oy-ckDW{
zcBvcByuVj&JMSqvv09ENI6Ef2Z^_d<u;~{;rhiSp$9(!Td&E3rqjgoqUyF*D&DebA
zs@gig{CLYBYgFyj&&@R5w%&M+`o4V!R5ZmocdE|WY+?E8Y^=khwGug5cBPhUzeZoS
zzFzuZ?b3S@{KqSJ%HF+6^{x2`nwBbfb+hr_&*fh~>z7})R4reARMflw*vwZe)sI_A
zgzepxyXSbzv44`*&OJ68zp|=1N_Sq3nX@e7ndJIa?)Oe_d_S@0F#F_~<h@lz`CF&Q
z6eO8+&Qwq9@0$7g;mY@!M=mdyv-#W;ycs<GwxN>!*`Gfle$OPWb<Z0o6g>I)Ip1&Z
zr-KF-pTbYPx>tAe@UDngLe1&x!gq_`e-+rTZn<uC(z&?!gq%rChDV?M>bkt;+JPs6
z%fA*_T-!8%qwNC~x17AS&pNG}>pp#W@M%t{<&#%e)s9Df>e%??`krfU2aC49Ik1U&
zbJ>CU^Z)+)v-QijW5wQn*ADFL+*nX-`syicis|O*m~}tn_SkOPzR`5AMe&gjo$K`t
zCTJ8ihjd1oZ_6|@*~Vsmwkm0DMC~Wzu*njJ=3DNZc{po(NoVL@)0%IS)z`5ff3+uS
zx_aMnp?Jm9e?fDpK5rfVosoF|^f~`qv#PWuE7{BIR?pu$O>AG)t5?}`q8>l#3cdeG
zCCz55Th*cF$!uXCW5p#-m`z);J#h6()2}nbb0){>7DrF}71v{So%ej*-W!qEuEN#@
zeSLN{*gq%u|3sU@>7Ugzyfbe$20!KV`TOU}eA9ZnV&zZIkMENB8B+i2#Mb4ru5=!p
z+4Z(@+qbQ4b@pLjcl!NGyBiVz`bp{B0^#WY3zs%uQaAi4^W?*t=M$pJ10PitoUvQ|
z=EGi#xYdQ{S|@*<#}*U&b*1{YzP9?;9zAy~Y%QdG_8dz#eD&$e)_a%3@5O!nW~o{8
zF8|#7hbI-^eXRPiXuWm8qo+S>&g}5pvTXaj%41vec>6!zNPc80*Bv;0`Mh1{<!iH|
zN-J+J&N{LA-mKMXwOK;u=j`OHO+QMV-Z)P#Z?&GDd9@nbzSp8WM@?oGd*5mN06Sk|
zW!0-|PhLHL@NM#H{}`R$QP<OX>mG%I7U~oU&j;<ZSYLZ`?bcsWm#y_b_pE(?_5Jqn
zSGMzxL`=6RT$`%r@1tLrb)lFiQ%-rt@tF~iRvNF1`Plr;QvI>j@mceB9ap^`^(f)V
zwGYQmZgyXt|LMwO?Y?XGBK_lvj=c5s-OOM4X-)p?x68NZKl@f9XIWZQS@HN(aD45j
zHE(wvV6f_tXjCdJO5Q6``RYn@y070+w~q_0pTF8XZKJW4+q|eW-@>b>gY)?dLE9H1
zlFl)EgXfQY<{DO96EZ)R9jf0~KFw~U@18Z%&vguIzWMJtrW?n-`gs0)v2Y*$?^hOm
z-|@AwCwRtjefR#lRqm^oh24MD@lxCTW6#5h-47#ozg}NaG+B9Gm0`uBPQ%-?EcQKm
zvU2;n@WuW%h972qH~28`s@#*Litns@E30;XI`O$p@B7kk8^b?!fO7Qg^<JxgAL-pZ
zZ)11UbaRU<2GuXzKU|nQ$9K;amF<saZm&we`&C81y7~0Q<@a`cdZMOh{#*F)#N~ec
z^VH_ekjc9C_0yTJ501SO-n?wz)95*3*DjqqT9jLCdNTUU?)mmR&DS3H@|pif>hwul
zvCFFsuXjJb8oYVkcD4AJ^>T6%_tvOhx4ZgWraEMA?WFAaV$0&rbv~Ut_w~EAp)v2J
zUMjYkuiNpbN@ty8O>N`JCg07RGi2Ilo?dPB>fWlj-n}QPWwIj9MJwi>i8`PED!9Md
zt~7UM@cG9I#}DjLjbCTFvvl3pC)e$QO@D(YgKq7<_Lh0wR)g#xYtnU=w?;<)c_w=!
z?SIrAv1!4Z=WU#Gr0Tr9r7r(6KmYs>dm=BZAD=O6+O0VgV+wrvcGkX8RI}f?(mX7`
zF2L^jZR6{gZb`o?y0mzETFmviUvKR`TIw4a9iO0MbtcB>@D>@jH@<vvJn_6bme-D+
zxcc(xi@8%v4K0gnzd1~<U86cp=G9c@aG&|vjGN^*nwM66ydt#vd{xq`r$OG6v+qV-
zy}HZBCPt^aySLT3JkmcV@7mEx*Sn+dh?Qks&);0Ho5y|H_H@;wccs@3p1CZ&T77!9
z?#4Bd;oZ}-ee|Zq*=)@!`upj~m!glIS7mCWo~E7MaWpgW)8*=(1WW0?miMBwu3C8W
z#jW|~n0z*F=3?K|QJ<MEE8o_T7N~Z9-gNZIBijzC#lp(RPVAI?T)gk2heb*F##R1#
z$37jXvW+s`5VKsS>W1;&y$6l*z6z|aDonq!D|^E9Y#-lq)0NZa?R}f=n^$z?K|-YR
zcD_8Gb)josJ$<OXy>)KX*WY*dPuthNas9i+)$?MqJ6E2ZRa(>g^tQY{|NPRzossgL
z*5$!f)hD;kuf1?<cad;-yk)2K?b|Z<UxgZ$R=s{Ad0F4E*kJ3mqe1#@d~>2-9WXQn
zl~Z>PpLm$@nDv>#*AK$HYxs=IH$JOK&N_C}IcDw77@G*tsvH~8$rJZvN+LIxzn%Vh
z<-y6`XK&1^D*XDa;_<w=n6;H}W7DIi$A3L{H2C$*s#o6>-n~4kz5m&#WzU}P(X`z<
zZLZMQcihK~%m04ZGA&N$cjv?4e0f__%U36Z^}~Da>{vcMxN__Cs)Fb0%a@8zUcSDn
z(8hG_^7S^KeDA!O{rT#{$&aPJTzRs>f9*z_(nn8@y^5B}npN}p%gNiXm@a2MTCl64
z{lVt6n8K>t-1)M5mNFiGuxj;A8QZTtC%<PE|32WoZsU$@b@MdeV4K&Wi{;kGt(zhB
zI_rU?dU;>mTwAl3Z)esd@w|0>@$#wRtLPb@S0v6{eL2|tn)?4E*NiXk{B`fosn+m~
zyY8LQHvf9;r1`b{#qP})!~5fux2fg*Khk^k;nU8ga%+}Ow0`>b@}n#BPMTf=Eii&K
zjncx`&WI}ddhAzMy1qrkw@Ag+zvcW)f3MLu&^%!=d)uQYX))}9rw@J$YM!plcK=4*
zO=sS%Pb5!Yz0KTza(0*dBf0lQdb(MB*P@-D9u8jbZ(C~lttCC?_sXq(&zG^~^N0&a
zr>@=_ZfpAcfWP<Ny}|nB(zRJxZ)$8ylb?t4?#%XDx97+c(27dAmU(qIC;wdM`2Nq6
zXKyt3+J1O-^o3%Yeb!gDbg%Vd>&=qCCP>~6mg#TImTX?=zuI!^D$jq*EVk~QA!m7A
z;{N4^;OVcewAjwe9lL3sTz&293ik6mKAl*tx?g;~zQIn3B;D2|-T6|<TTT7%%$hfA
zWATZDdsXv%{dJSm8<)?Mm^W=!&+52;GV`N;n4Xs_)jhd=SsZ_!um9N_|DHT}B{Y3?
z`20Ip!tczgs_GU@w@>=|sOanMSFd}f$?;^L6`w!LzRQ1E)%CUMYbAG|m$Q}=p5A@^
zNLF6|k*hD?zLweX&D$qtZronuCl9Z_zN(`B_>^(G@%5m|hQF-tTkY5=XNNe$?fB1c
z7jAd&nr3QH-O-%t(|0mD)&1V`wurh%ueo_X>D<t3P14OT&XU|-^!&i%XFW%*Mk;Uj
zTeDIfw0!HfGk<unez?AS@1N!`=N6<NTYIPUz~g7Tgu~N&?^qd{Ee&7ZZohQ<y;m=#
zR?GEn6^_oYueo*SXU4b9|0YMBzr|nmckS_6k4yY7Z||%3%Afz`$c*ESaj%bF*{oK-
zu3YR-&(-w&SI>&Hr&-uOP<PV<AI`SssAztr!5O<3TYHW^`*G!>dGVLm+&!$dX624a
zy65IZJ-u<guBu||vqxXQ9a{W3>|@xxnBPxxOp{7=A5C?S%P!)(WSyK9yY*S&Gb!!k
z`*wzH^sTBWimrN|CSRHLebM&$wl7{5-i+sW-#6o@X6X6C9c49Jk964Hdvf;T@^kYN
zX6)SeP3?YI{`)tnZ{}$B-I*4iulu=Y?d!EK58AFfqP727!PDh&K6Y_F^X5qzs=4#0
z_3oIpN9=gi)s%U2V*HCh%e>lOZuUIJ@$`nu-w@r(Bf+(6Z}!izC^W1J{G67*b>`}m
zaj!0)4xVlL`&rbA<gILK{XZ1eek(OIUeh^IdUsn_YVBmXyjLgp`kp<%Z}yk1@#jpw
zMLg+B&%d7RyDod7p4#&#Ys&ZTJQh<gr(f|*Zu9ZXy-UmeUL8-fE)Sg_^Rx45)WMBi
zJH@hp9652>X4;Xc!lzf~&6Hk#?8Yp+LPHx1bHi&X>!v@iI=NT%zTB%1vu5m!`TFC?
zlb4&P&-k+@m1lj?nayeYzwTeglc3CU=S1+FuWP<0wV(O=t^NI<BRy+V<Fm6qCal|^
zwJA-$`oPrn_v(H`osK&;b+YlM<+a*s_0sQuU9_;@*z<OF#IfM2>@NX}**`}d5HbhN
zV@nmjI=OL`r`^{x{%?Qn62C21|LU%}?cSpQLgsldqq7^<FS~YfW87WI$au|f<^J~7
z&kL{ZC@NaJb(-zNt8qz{I+E%6J4H|5`Pq3j!f!5f{wW)=uX5Z{)mLZDT4SAD+xYW{
zx}D;-AE~e-FH_mS?PXqmd*`b?h4*8pv4Q$38$j*((|m94HJbmaX9{%LxNmmcHU<U;
N22WQ%mvv4FO#o!PM-Tu2

literal 23323
zcmeAS@N?(olHy`uVBq!ia0y~yU<_nnU|P(<#=yX^<cQ5#1_lPk;vjb?hIQv;UNSH+
za29w(7Beu23xP0W`us~l3=9qoo-U3d6^w7^a?TMsdh`GM*mbFvPonx*p9pZuDRfjQ
zE?S|{wO!(<dDr^31ww)MD_neg!oR#1T<qejAo$Va!+|5rq9XbMj=fzPClse|XwW`h
z^hWQ*rvE=hujIVXIq!2m@2pSw_w{!3@4j5QZe880=&SozE?>3F`uXkr{d4C|o@^W-
z;nBe2(ZCX<6c8C{X`Oy?k?T}V*`r5P9GFxbm;#x;ehoW6&-SaDy(d`NB!P%M6&t-K
z&Q_5vpUl8Hfq_#+!9mcMp?x>V7zIhjt_&lmJN_WOoE!lz!UrDe2`MlNdAKzw&FT^O
z4$|Vl#3XW&rC>)l$l6JQ3p&)4kNgE$H=%*S)r3*zof4yvLSqVx#-fuPh4v%DiYxvb
z^i6h`y}zgH>gu|w=4Vml?y|KenU`F4mA%!nt^PKJjaRCrtvQ#q_TSIvsW&&J8kM{V
zu>5ktIoH_!^|wj$XKHcm?b!GATJ)#$_5Xs)-rNXm&e)uG_Q{sZev=;_Zuid9vwmyJ
zkZQPS&z_inpXdMA;C^*=wY#A2M!ggIt_hrz+QVGDy}eTpwQznqsXkxB=IiV0)AR1`
z@=Q!zm~&%;W7xVF&FJlUQ#FH^d8DQ;om2U2CZ|DB_%hBXPoJJ_WS3j9r`@jhSIVz1
z`|R$Q->+5wez$zSNzRP`xtb4-UnR2*ejXKC`S<&Ut`|o-g%>kbT?uqQxxVh}>a5<}
z>+52Ts=wv@yuSaR>TI*zRkn$8GtHQ`->b^L^=X^s<J{ZZR`M~NYAE9|EaiUk+)efC
zj)1NgmzH{`zPq!t>zb$fT$Sl@Rhhg+FJ{V>-zhA*k=TCn+uPgOZ_-&n>88O!!&M}C
z0Y|Tt=_EmAw-s+I{?9VY)%wxRD-k@)zJ6cP@9_0;x<7yZytK18{bv3Dzf0Zw<u;zY
z`u+R;`uJ<><JYS>MQzDg*!TC(=kr&eaO~rku?VR8`byMR%=W?d`*qPvwKX&Xgk#<1
zDwjNY^2Fuxi{9_|s{OmVyHjs$NIVsH<I6#I`4ya-x8>emmHhkLTkV3!NzIqnJv%#l
zb#dL-tKnVzbt!Yq9!7jA+4tv@_fxOOb7ZYbCg{cP^7#Mn?^VN%KOb9PIy=kM+xJeQ
z#?si`Wv|$|^eS^c%o6*V==7mOxi3JtapTViyF06*HmCL0d^{@NB!Ay5_tpw4yFVWe
z$G$#zmTkMm`ZMPF_jLaMeP4fdr?;0^$lXPD>^u?+W>|mz_wV=nsdHz@Tz%MUey_u?
zuk6*8mA7sb?)vevxc#YdiPEmZ$8JBr-OdmFJFnmn=Q^gDYd#q&|Czr3kL$Iy(a&dz
z94fx(Dt@(Kaa{FV(}S#>fxkW+=D*q^b}YJdhGp?Gp|6|I+eLq!Vwe^k7PhSX^p}^H
zuL>NQ8XhOP*Wk;!%*)GG?%}t5BA{BJzyHrBsnb_~->>=X`|{r2-FFHO^D-?gVapW{
zQ+DY2YGHWEp=7Sou7Zb7m0vEpv&tkpAMcY*y|bgRsr#zry~^jZm7h+kPtAVW)9yPx
zzHTRvq>+l$T(4W<ah0x9C562sd<CU_t_Vlie7zFfBr0=`;o-hVUD{b!HX8db%GE#f
zF_~X*&59K(CSKkD|8KsjU;V$I&)vTt++Fo@>GVbSHyW0{y7J=t{J(F~uezAT{#m5X
zbJFdF%N5NUzrqhu_q)aQr&+(>6KtCEWtjrQ?{~Y`&+2h{|7P=fJK-}w7PA+=-Fkgj
z+V4BX=U2wbsBP@C|5u^fA>jDsKwQm7*Q?csT-%n0y@*^io&BQgd2w;C_xJX$=IsBh
zGFjcf?^*9s`xD9c_Ecuoh%ajDY`dMm|8Av6iM05$NvhsUYJY!glG9hak+7Ig<9BTN
z-K9q)Z5Imr+XP;4KE}^{s^y;k4Vyn74queh|K>Z(#Pg%o>ouEGE-Y}&T6(xkR6FHZ
zkL1OT)^n7nZn?FrV!qldPklzG^Y3RQ_XVaNwfJd%zh?0(#ziHkG?yPSJ{VkM^X$h*
z7wH3Bf(Fk0ds9zOdv%=q(5{4oOk1rO@3GeX5ir=+uUh${^ANYA#q&AEi|lvg*_&uh
zJZ&%hCuS3GO2`UV5vB=Q72j^APgPjpc(3O3*{fBX1VYX{do2F%vcJ8kiObysbDtlq
z3R#oA=h>`mmgMyue}8=qUeqmje)al&tL_}T|My+_t3yZYVvhXiOTL&~`t9C^c=k8_
zZ&ed#EC^j4c1o{9<xbFcMfNv`3s_FIF6_I}uxasgp6CnG*BBR7UvOmC{Qa=#k&=79
z6yu@(c_LK@&&3JXH6$$GtUk{xs`eeo|D5(#Gk)%Wx9jyHTR)Cl^8Y@t9~H1?Diyux
za^~XYqy1BhIoPy4w)p;-INLbgZ%gk%;REt@CR;n^RlQo7wL(*FdBsPyA4gAHXM9{3
z{pZD-&ShGQ;_LrzeYJ9-;GaLw?boX<*p>KTy8K>ymY9@0#=Tt28<co+8U+*=d@nq$
zyWNFVq%dMRm!Zo6i-bJ|2N>B;goek8?tM{e^@V9`LbA>o-2-_yo~kW)@$*5GyTi?7
zX1x;KH!pf$H{48Y(T(1ArJz&rz07@IRo%W`ai6Qg5&!Q0{~K>QZ3TM;KZnHqzS7T+
zZ;I&K2^Mo~3w9`#dy#v{tVO==hoignZ<C|vXE@rO*C<i?b=lwEb@h?lHJZCFr!w!g
zVKJ%cvE9Y0qwcs~=%D3+_deZ;EV>!zDt7d8{BZHtHOshoyqEFZ#-Mbon3%lE$4OWA
zCdK^8V@y6$AbFQ5rj*5J&6d2ow{$(Pq&;t4tN%^D{!ie)FU##$Dso?MR-U+WN$+&_
zN4{5u-xTgn_Px$rb@4^zbybz5c^dJ5E+{2TI$vUN^!%3Cy0iKv?`&fHWeXBtA6xNQ
zs5a|k;{+A1sFXQLlQj0;dwz}i%I^;^W8P1H#m~@por%-@g6@va^?u8%KO~fWJSzVB
zMb`XX;ccpkFG7{}|NVB`zxQ<FA!cnsgS;O3nUnqPBKhooJjgn}eA2dCjfU};V*PJj
zK9G6$T}ij0`orrkX9^X<#1Et%Z;=bjcGz-I%=ULlYsqKt>346QGA~hDRb9=%=XgM3
z^7RGPvc1ygeia>J&gtvTA2LebTKTr9&$-HW>%NSOi;w<DTh#E^uh8QCp3f|k4FoQ^
zc8jf4wT{@<e9z`s*j)RRl}mcloz-5Sw3HD%KkwGDX2CEg2M<AodkItDMNcq3xqe&D
zpOTmtE>~^}yPoG@{vOAymM&1D++99r-{F&IRr||*)E;e2Vo;3qzjaoumS>v#)n|U<
zYcvkXx3L<0Y>UkEX-JS1KPEd@aq5<HkH2ht`?aO$!M5ZzMGotQlON8Qa``aFjsIUR
z`>*D-$(haP_#l0j=b}GO=4xDmM<*$=#GH81TgAIeynCrf=dnc_YS<5I-q2EF{=dar
zwp!~*_U<hT$Ci11iT$sTP`hFtgVz+hdv<FSUEc@af6^dtboX+Xt=iNr=aO?*s4w4}
zcl$+alkqFA&0qW&OTFdw_2Q~KrptYFd@y}Q&9d*Uel8E|dSxtw3Xkkis&eYgdwpch
zmN>md*QYKje7)la*TGE^w%xs@)ie1b4)9I4G)wq7Ax@!xUfe22{Z6Nw8x{7ibM!xx
zn4vhY<5lsJNn*!u1o-dD`DpibiAqd``FGoUJIp>EzFTbdg46Nu-P7p;KPoksuQXXG
z9N5s@@k0H7f+hQ%V4Wm)eqqMFK1Y(xB)d-=N;Wlg^5609Z(yICz__QlM$rF!<%34{
zD|J2GNwO)+m|0%ltA0PV-~OM)t>hzb8~W}4?J#29`#7Y{V9VbfOGUl&1U78Ax3kA{
z`N6ky-tYUpZWhbMLVuf&EssR31=;i&7$?W>cq*zmb<3*;i~l(*mRl@yU;NdVui*8@
zb>ZxPI&8n)NWS_`>+<g}%jexVQtspRP@=_UF6-2U_xlw-6i-vXdwZd@@KuM6azfib
zFAQ(J>Ct1anBdu6?8G6g;%B($!y)dg6{0NS&Hr{tvzO~U-2G10Va2f?$>3bxC3g9{
z>^DZpd50Y9mtS9{B60YN@#`58Ql?o`vd<suj*XD-iZlCkn4c%cXUCl#Z-w^8@Q5F%
zZCSl;y0)V2yZ`miW~N{17f^dTfv;R$@xiwU*&xr={hi-mey{3E-`-~ra`z1Nx(oTc
z-<n<BeQb%)yJ<}lP5NnX?lK)S`C7Lo^w`?f5jPv<weM&=P`z>Pytkz9QqHv<Nz*F7
zyttUvCL#WFRp{y~x*bst7av?mKI}a6tAyZ!$BEJ}UOI|gu(-J3>)sz0Z2S)!430#r
z^xDkvp86q{U3R^F>7IXAvc(?WbKG%<sp{tbA4m1C7_i1ze&I80xoBF{E-Lq({a`<@
z)%}X+S6>zuE_$QC=R=d!xdZ&|@AfM5R!x1e^7YXd9fylFzTCPv`_PZ&d@nK`bLQFy
ztX$%1*ZIaT-S*|@rq#uwO?tDZ`_FZ^dG^BhUd7|yPbp7kGJh!8lCVhk->2#OL&_KY
z{r7!;|LtiXe3)$RGup4HaxyHFP@l+K`tbSEKaO6Lg(dBS{SRE=-q;+nBjj|`JrTJh
zJcf7D=hxcE_OW$+UGSpznB5I!Gv*zk1>5h=<7(X^A=RL<c)OUtielG|<<qra7RS{8
z{kp2W-Fn#u9}dR7woBRzjxD=>{Gsv8*mGOX<?2*Btru}(V!Zk~U~c9YvmJ|$_ZvBJ
z2z~rI%S?2)?=|65OO6-bt<x!;DO|fO$vUigLGRHb=etfV!km_;dQS#_=$kvo>u6iZ
z4^^%53Ev)W%VX)vaLBsq>%tslBG$}O<LS_yp`kvlCQ{j?i^b!B7n4Y!_Uc}@$qbx7
zS{Yog=$i(*TYrf<RFS;0^vt~W$qbxF6a{YG{AppcruUeUgwF|!>l{(h5>kFlVuA}g
zqCz4&eU8RzowE)VTKd#ZNP)4K<;A(#$tUM{G_W{%G$=_O@=BlR*}!r}a6!kcQQ^@r
z8BGwQxq-BzU`4*3_A?izYK}iY9`^?Y1v$y6Ob}#hZEd}@qwsOhoYQYrL;}sVdRCh@
zhOQ3t%*<R_^5Vk6Yn2}yggjau{{Ff-b>o|PwxU5kud|u#|9+Y5;BZm-M*jZ4OB|co
z_HCPfY+{2ZlSp8&iu0WQvisj}rpq6cXEiy}tJvbYyrXTyC10`1x3{)t{h7Sie{#so
z>Aox$*7?D?KTm}1cz?h4``nPQuuHYy1NUB-az;48-{kX|wf2vv=|(Tvu_I#VyOR5B
z*ZYYr=ws1XRLUZ;?eNQe?Q4%k-h+;Z?N?fmet+YfmdEpRL{tJ?8<e7sHbob5T&V45
zZo8-=py(i&YV6_B@UGg)=8h+mNZ>Zca;96g$K!Urf7c`7&7^Q(p2lrQUZ#@!*$Rm)
zoJUk01be&H=2#be7yS3_Zh8F4^XK{1S*Fcm2?CAkF@{~3ob=I#>F)Oh*G*2RPhxPr
zqT=iQdC~8@%%c}`;sq9T{8}WnDV^o+_ct4#&un&VP?GAYS`(`IV&8QxX?~@~EEbJL
zR|{GmbKm`5aK+errX-Wd#WMxp&PIOOY=3)8=3+U8N79EgI5;D`8kDj!k6t~N^LAhI
zPa*j^G15&oZ7f+r3p%c)2<@1$X_JwrmR8XEcN!WR3mVwgwM8z-5n9lZHo1=NoUF+A
z+VAh~zLH#4(G~Lg+S*{H?YXzjZf?n(oWP-cFIw?q!OI&HCQlZY7X2F+7`QO*#Pv0i
zn=@q04|z5yNj<3IZ~D#mvF1^yddjOSD}&<V)@7|uJw2`HsA%{JPxZM|HhdG)kJIV5
z{WjywY;*lt?^Z1Cn<SmTXXCAk4_{thetNI^eebf1(#&i;6Mnzj?O)$pSNHSj^iL0(
z`A@yNy87wT>2X3g4hzIFiCkp3Ry*O&ck#Fi$9c8iA|)-0mdvU7baGSnbv@9q#?%*I
z-`ot|Rq|43JKOxKSDIIU*F0!spOUff=d;;fJ@WN`3U|I-Hha<W+<SW>rOa|P9v|!N
zK9;yR`FP*eea+e~Kfhj&pAH&js?D>#k;VSe`vGTw3v<}fTeZittsm^WC1>~VN3v?f
z^w_eQPoBN2RF&Aae%C9l$Q=cVPJ(-%PK#c(^L_I1zNt4ir-#3unPoR4!}{x$;IHA=
z{bhFN+%#(BsQ+@&-Kg?Y%Jq^S9&yI5jD}a%9Pg@gN)vd5^KAZoVGb12iC8e{=r@tO
zeZ9ShBh=~=vV_}sB!y(18aj+7FmQaxozIxT{_E^)fjJ9w<9C6Ys4VAr&F?5=Ut2Q~
zG}bn+=98!8$0Nc^%irIdm(8EN`n=8Oo+_uSGt=iqKDOw1eP?I!)5-pJ6GK;raqc_b
zR`vDOQMZrQoF6I|ZQI_sVCVadUoS5Am*4sS-|wgMs^3lY*4ydQdAsuYT=nE*J)OR<
ze#t&w=sitmV(IH^C;McrpUlc$H}SH+{obfsZoN_~=jq+4*PZwF_V(%7>-UE7+5h>F
zmHD%kC5dx`x|H{kMeko2I=Wo^&2#9-a_OqO&PRln9&BdkzP5AUuUD%-ozh;vLv_92
z_4V=gmd|D+v#hJ=7Snw)(Oqt$X7I8Q@Ai3`YIE<^{m%W$dGT1w#oX<8mmS$2l~kwL
zD8VEn+{>7BIQ;J`z8&u!>%Xb9<X&47ndK>Xr~HeWeANp@)wasYN~4?`8(Kok4soix
zd`~ud_3QQe>HGh_%`ZBk*nWbMU1q_zL|cuj#T-9u-fTD=;{W~I?fmKI?SA{T@yoCK
z_EDa5hhT#LmENxY#}_`k@QX}VZf$LC-1mFMjvWyj+KP{K2wwc?-yzc?VEaDv^0K8N
z!4WIgyNVnC?qsUk!x3@qhyzn6#|HIT9ewA&-Td;**G6;Iy2QV~zG`uItTf&~*SdU_
zoTke~$@r)!sksM_H_q_6bb8SiUG4C7A+vu77Rjyt{`$OS@v{}ae*$(cb?%o)e0^;#
zleNSq_XU-opWU>sd~#;Z-!+fEmle&vQ=Yqe`y^Gr);RU5ImYSdLTvMQ+!rv>(Qm3a
zsM>x&>CAllc)7YCiIS#SQ@*^o>h3FWxBk6s(GNlQ({;90tB!s-J-t>v-*>(mYwm5&
zy>7m#{|>!p`DXX`$^E7G7q)xu{w6!+gI??=k9%`1ovYsbH(t5sdc@MhmK)Bz`W>ph
zL6citH*o&tdo|IV<*&_HFRcpA+P-)d56{2s`)a$Bk~U~)rnbr(?){^?l$lrcT;!IF
ziMui-%Igh&^fwfLlijOsZ(pk^yDjNO(w`q6vvPv2^W|+ma!Gy1Ppdtj&si5epIh#=
z`7hhaWv9ZltjZrdoxHipsi^FI$bD^9cdgkjEt|eNPJDOx-t-TyY7>g;fA|!6UH9~R
z`p))c(JRl?&+9hretKT1n?d?Tu*;=2)2m*8`x3BtVzqhM`_1tx_nVU!8-J?3ey+&!
z=ZSfr+E<@DdE#fqBwLn(XhWvzMb#BQKJE8?SG_Ce=qY9&y@R!F9_G2Xu9R;4bNT#!
zrJcRAPA=;@;q+^-^55Oju4;Wz--K3n+$rX7TysA{MLkVQ!D!`{-FF*of0w%+v){Ns
zF7C<ZXNTRjKHomM?w#rN8EKn8{t4L^Tc@Qz^;DOwJ;Ti{s%xGv>-e?d*;a2J^P}%K
zzn{5DbY1Np>nZ1U{yM*@@M3t-#l!>`hh(uM&OD0qPBI<Y>^M1PWzFXOMdht;ZiER*
z)~%=vZpiQ9=~NU6oF8g(?2o}Y_Um`wzpLJs8~gpS*w3%E`ltF|hj$-v&7X7E@T8Ba
z>W=rjmG=5`Wi0DZx8rv;F`VD?&Ud=^oIa<N+t)nx&riK>|HtiGZpRv?j9Z$ru3u8;
z-Kzb*v{2EsOX*c}*L6KZpN&Ur&o5gW?p`%NUZ?AeowL}f?Kvs$FSnQa37#!lnsQs!
zZ|RSl+d_B0U-f-v*TZScm;QeDo@+@*+QvGA+dcOCzuPrx+};*ee1CI9`b<01yWf3;
z{r}d8T)Z;#>Q9bc?^i1Rc`R)Fq?iA@jkC#C<+pym-|zPQTHKMgW8S8>Ld%2h<lOf9
zKKJzWpv?6*y}Sj_DpbA|N@lDy%Mbn>^d#rDRND8wNzeKG6e=^9*m*h&o(*t)5ng`7
z;NQ&L=$HG_R|I}CapMSZ=}qXF@3}4Z(T{0Y?@Z2(KKyFm`+Hv}ztOpS>R$R;wM<tY
zSCihWEYo)^S>j^b$x$x<(=z4uHFLWt4gWvSAKP|6|I2e~L+*^)<-hYJvf4H;?pVgT
zqpUNxqA+G#?$Y1$mbsnCF?MQD%97Yz*7@-jpN;I@^Zn~iZ(Cb%|M=gRPd(ljuYPhZ
zKVyg5pV_i<azWd6&Um-Gezk_`X^lmi554AC+}0~hdcErX*XFg{VfoWP?diL;D7o}@
z)4$xu-?=pwFs@4JTCwodnQh*4ybN<TnNBS-)a6WRW^moocjcqf=0%H?HXf|qe)5`C
z7&pIqV~^m1j%$ot%Q_7|zx)1u-|dua*;Os=lN^q52DoH*-cg%=LoGTxQr4!2WfN$&
zQK{<h2Lb6j<+F2qH%iTz!&2kipft-V^u`mR+bP*xp$C?zJg{aG3G5GLnl52$E&Z<c
zcy^n&xA)o&SC#A3lo{^}E$C2NDYe}D&G+5?bGF@5_~v<`*qk%Mu|a9pf>}95ow=J#
z8H?U2F}~&qaCsau(^qe!@3vzH&t?d1nC7r<>$K%33w9il_`fE8|GxLfMRGTp`d&Sn
z<EikP<%V!+NaJPIV@y@{_BKb<qGdaFdNMUCI|$y5UYdP<UFi9LTN0g)sYNrFAKl=f
zBH*m>MQK&~mfXVohW|2~*BZX<iT704z~ZF4=vU>eg1dj;?Yo`!`q|mpljBT|+D}vQ
zJ<M{CW6HGYoOKC@B|hAVyW==xtw5CE)|0B+E?(o4wNlBw>^tjC*Ah*?S$&+7gfj$Y
za=5xH^f1ngG;=OHKd*IC_IKIk-+uo{zmR)2KW0{|n82A}vlaIhwkXYdE5$pt<JL1F
zadGk0+|ACsH~0Be)CqO?E0`#CsXG4nT>V}+)HV9CdBi(K#{GgEdpg+es-6pL-qe}B
zP2%I8hYA82f=hqTo9C7zeEo|+!a9`zSA`8qt74OEDmCrx_pdr)cW2RByEP)ST$toI
zS%O@?zBb5__`hVWT(s8Yi4FdoEM6|TMaG${{nvBMa%IvKGSFM}^y$-Aa$l~kjb43Q
zIC#tQYbUpQ_qg7xi!aHUy;fCK^;Pb&y5~`^j~!<AT)@ZD)A?dk>gkk6M>;nZJ@rcU
zTkO{R<jv;u(~QqqEarPwX+1@6qq*P8WtU?9{&V>sa{A~Om4rzRf`WIqWKO<Q`F!rB
zmBH#i56k~s@GiOb>(%hoQ&Tiou@`^2=stUk<t*{oM;cs<rDv_?%{MWPDoAr<+NzM?
z;<DU-zMgg2n+fs%e_g+{EjK##*bKwulz)GIetI@L-^<EHL~o;Ro?7l&*V9iFRT4NE
zm6dj-ot4VGx2H11A@JLsJ25YBZ(o0Ao^5p5+gqt6HCNQkCvS@?QoZ0Kv_h3pS?Sh>
zL}yKH?bV9YW^}Arv7*Dz<m#nkS?!Kfate$OE?%*sV_Vp2+d9R@2Z9El`j#^D+XU>L
zT>I+E%1zbZ^IS8(zPh@p<Ymy-y~WS{lAjoy42+0)@jJZS!Qu9n%;es+KMsDj4o~jw
zket}y$mCYFsF|IATK>MDZgF)#Q)imx&bqQX+`m(6nx$gGvU?#PK3De#xb1qsENj-!
z2@SF=JslcyT~%MNhM)fVe7?Sfd}~J8yE~Bv&i2X2cueE6*!ylpuarNLcsQWhciXjn
zZWSt=DQyjcf>)Pq%fBD@Vfo=ns@_YYx97R3Pc6Au_v^~$_XV8~5B;{hk+OQe<s~zr
z3oJcdE6$0`kGRJoC~I4_#n`IgcESCNn>RnTtBua#jd4zFWb!`H(V-W=FXrybD~sLv
zRW&5!Yah0XKUvVsH_5S?ja6vgWz}!LWo^xFN}V`%$cc4UgP`EiqIt{bRe2TMw{eP#
zo5v$-6>`q<xs2&a5tAmfokz@WN^L1S^r@v8q*6%zj(I<~*yiVJqqcJC*zTFOZOfJ`
zT;K1iMKj+{h}dvI*g$E~f|gX@x3{)(>llCvk&phfb9i%_6AwB$ADGd>Hgm>h)nhz+
z=3ifRD<ylvZJyI&a!eu@RZ91ky^Sipz3P7Te2q5WZE6S4-Bn58W$enBvue{x)oa@x
zEn}BHV#inHHo0Lci^d|ot7((H*UbOhnaH-E-*m@<G!f1S{{|(g;8uu(n`g#*Dj2Y6
zEUI38No{(>ZLZ5N_pv{VN^#Tyb^Jo+fD5gtD&Gq^LLQwCFI=yvO_xaC`eXCL@147E
zOk(}ALh_8jjnIwWwi0)J^2(kzsV`48ZV7YAE$YnOa<$vx-;RYQvvchOo*#=X`Q^L2
zQENu~p$9ibfByU_7qm>>Qv+n4#ffcVQ`h%yd3E+>=1s-ZTPrs|yR<rd{e-Ev<d5>s
z?Z}#LaeIGU+^YH8sumtGQJE0Sv`{GU?<+p(V<MT^W%@kx=CbS&;%Mz)yQ%su>f%d}
zbm8kIQ|4DrV&GtjbIC2~v@UtE;GNy4V&SVXxf`yYm&u&{mxW1pQAy|J%MQ7ZX2~&~
znaZ+?gCz)Dc4UVpKM~`+;h|8V#AUvD$r6{nrNaDAJ`^ulTenX3mK)PO4i+z$t+QW#
z7eBr*D`WL`wo@T056YR2xr%K64eEMDZO_x?l{P!$@pG$p&+YwOTwFDOpHzO()Y1~V
zHEZIsgOevX+~SlFzL<J?+Q}uJlNZ_QMAU(nBs`rSuXlE~xqr0d3!&xgYkgxbJ2&i{
z)L_o!<|4A*s}3}`@OSn8pJ(%zWM5zR>Ff3Q)#eS4LQf?h@B5nO+qLqA&~lD5$wjkw
zROtv!p6GCkLqag{i_^nH{St;we70W#Qr~PmE~hPD`(>g|+@2ddKAP=3^6R0Z*^c*S
zH?#Hx8ahKti&@jBFZb(@ER-#KdrS57bp7divAbSqD9^uj_Q;v)*=D&tPiC(3$;jSy
z!YE$o13##E*;`%y^78V2pSf0{zB6P>uLK$;9%5;n&?jSgDI)V?@U4Bdy9>VEl?a+D
zc&B{B)`v5h(!9^z@mTN<l>N`_c(?2IlbPxBCZ3$EzWV$!-`S^R%kL=4T9>WaJ+->{
z!0&s$-*b8;x0@@^j!9a+*6feL%yrt&+?mukp3FMIQn@B>Z`8iO-=Z_Gubcbj{rz~|
ziuo3Wi*jykICw>~W<LL&@1d*1R{p-n&COlA_sS`?=-T*?CI(kndcL?QE_hLz<av39
zVKU2m`}PHPUoJQoeZO0Ndhhppvp1S9zPZY`Lw%lJUbA=3<h3_f`OllqvPa0^l5p+g
zUh^fJHU+u$%dKS*Q9mBM%`kd@-d!tDdq2E-jW_#riR7*y4?pZ~xRtWHl(&(seOklB
zc^Xv-yUX8)O}0C?drH}x8w(FuJ#KQjW%;}BDwD+Kuh|<;hV3_6607pS?SO~>mi+ts
zf&v2-|Nl5{|D;=gU%=k;<@amDm-)_KcFbdU>FZ}@d8;3Pm=?extd_Fj%Bk~AS(Dd>
znR7|WdqIoeu=jcOZ?|55^7*`de^bkje~-lXb6lxdQS5e`?Yr#b`4KPPmq#z|ZIf0>
zkYrR=>N1*N_v@um&5r`rWjlC9_!SOXBu;4Z)!SI7!QCeL$L@;260<{_TKXFTr=C7}
zGEiJc@74m=9Y=O3pKg<z>${C@?c5DE50w)_T$(%lcfa3uX5Zo3?FX+ZY!jWPIfq4K
z5$CJB;0Bkl!gD>L4Sfu*CVo?IJ^?kYWbX8+F=lfHxFoOg+x@=d+wULCeYYJ;cor_i
z!Nb_KVzCye^w@N@amH*F0ShLPi+e-6o_d2@56`lqH(s!}x3@3ooy4ldIGdv-&Ly|F
z^XqEs9D(ZDdMvlRn6|14WPuwqC&TvaTe@S1Mdoase;Z%<a(D_GJ328feVY2pu!mEa
zwM6~ihwj~<Hi<fEF9H>Xw_ZKfTdC$-=6b8PXye&yM-wks7AqZVE6iX&zvjfZxf2(P
z1kR3mq;PxI{$J{|OHN(iW_B+7&F}KQpHd03J={|}ZaopYe9dZ0mYf%pq>6x)V5@ge
z_5F`GtoGl(?H_Gi!TKRYCBU6&p+MkUq1zvf%x*;;7dv~{Q{gbEEV`w7?2K&Mhd+NF
zq@2kR7ZqI@>2_<@!_^JTl^d-DIM#GrQeEe~+M{5FZ;Y@=^KOp=5{(XB8nH>qZx=_o
znH8>0v)DhuK?>CTc`3Af`O+7=cjZWkdGa$p^J4nQDIpxV$LOZ+gUs(UIY1fNI_<$<
znT*x*v)i{#bjV`q>3A_kGx*8W@VL(EXS?6+^4?YcUaq`8w*1DEv`g1^T{G)fXRH@A
zP+G*y&NpRS?(J(DH`hdNPWkxgXlC^E%*nGoqq9x;-6l9Fa7YMVJU7>x``?_z=jY}&
z$!W#S?lG^Q#aGhlD|~nId}xUVwsFO6P5U1Ym~U>&ojs@MlxE)U*COrHH%^^4E$ZVN
z|65VZS3NtZ@}Qb&=gSQOlYR2{d~7Rub0e_o`@7sPA`-z{9_CIfxSzTD;;QsCl?UET
znJ+u*Knt6uFOMy|nR<*n_wwHN+t!MF`1Hf-vFIrt&jUqFnSvLu$JfWsGRahGX5%&L
zJN}-Zf8)!uvq6QQqM@^pfy;p%*87u=az$=PXylPJa*;C2$vENjKYj7ta-P&5f3M1#
z-F)?b*7DXw^@Kg@R=KxKPM$qGb)j>6Tie=Vx7+VQ?fSN5j2jn(2^(lFk~YtqVp;s`
zL<1x9rA=#2_Ah~?=KfOO*&YXa8v+IA8YZ`egoK>fka+mcInfmsdn@iuo5~cCmD;?v
zF-t|qM}tE`II!dSnVH6*#b%c_r=NE?eEGa)>+5&r;O4{KjEEfvgbdUceSLLxvb%h(
z$?N=k-sQfKytV6f@6X8&yFf-rNIbb&@pj+hIcAWo8J4Q@e`3Q?P|N73jL@vS$)Ey`
zb78SMXM|IO(yS$mHmGpa*S)V@Bw==Q7K?TH<OWj~jYWm4y53dG81$$y3axN!P>SL`
zK2IN%Uv9o?niZ&$V9VH*;Uk(gUE=+U^XJd^-+aA(z1huI`bAsXz;km}5wE~K(#*+g
z`HtLCX*?jfpu=s|6>!18T)uUKgUSOZg)d56;NIt6#VhaoZ*D#r=5t1sJMNOo>E_?7
zIa;QsH?#4sQb<YEz5?nC^wg*AR+@BmZ|=6LoeS#k1k74<<Ieku2d1r!zA{_HMvXsY
zQ_lJL7Eo>8xpi%?wE48ACZ_oA+Q`V6BBG+4IbS~=4hh+3R%DpZcZGHC+CwJ!*J7%^
zzM8uBa{I463xxw`$0Xg7dX+u7b$g4$3YRNp(<O3Gc=zkw&ONKP?q=H2&+PpU8ZK8}
zrrmlX^!sjDPxT{5bu%7QmiL!ZJO4N-d{D|-?A;T}RIz&H{N`s_&1>tPdE9=ZE|4L(
z_2k(lYrn<&=r~${x-Ou8O16c*%`__u7AEyYW;<tYF|`mE@)n9?Y7`3Gapc9#n+5N!
z)l$5?y)&~b*4s|AQDC{Gv`E0{%cfbT*=oMC&3vu3K#fLKN5AO5df&`$&idwdOn8EW
z43nE{$<0lvpT1o7KmF)v_tH(9g64j@k=#GkF!|UK%i6n(UkY8HyD*y1tgv+R{6dup
znoP%BN{)7k79E!@Uvc!|^|<P_zwYcPT>L;kwo$LJ>cl7Ag)bkTifQ&dFr&k7o=qgE
zg=2odX7iJ$Pc@@*Z*TMEHl2OP=hm!gY6pBg514}rlwV(8r(Rs-YLs<l#fpYyt6Tic
zg}L|s{qsfj)~t152WmVI*t7I>tccUNx7eLO60|V!|KIPImUs%kytK62B>&!>h|G(t
z4{x^rYggIAbQ@G-tloI+NRP(>0Z{iR@i1HJx#WJ^Wk;BqcIDnSyXx)o{>zWY{pLw}
zRdZ)t{8oJ7UG?8zUu*Z*oK%bc8}odN?j4Yu&ds$JJ*wPq6Xa+4RAlQK&hrOrJ{)9!
zdQyG<l)AsaJiEnonf#;de+wVxsguvzaPry#a~ZJ<Sxh_C*5u#Vu<#U{(yHsNhkE7B
za%M#R>09dW$Y0R;(IJV)^ua^LI=R(bPhMNFU3%L2I#5Nd8@(+=#USqH%HZW1qBcsr
z3l}X?k`mv-`&MXi%r>2Q+Yeq_uvK`P`VN+!j*Rc`?uss~{QT^sBfG4~(pJf8mM`a;
zBp_o49l5QkTzZVkN>LFJ8tgI!4L<YjVmI_g{$k}8JFzA6a>|1PjhEKN?mi%R<df>3
zpL@S^elWW!wWIA26YIPNK|$7~8<UT7r9D^onXzC&;=#WY6rG<O;@0O8aoP30ah0D~
z8_O%712a03V!lj^&YSr5_V(4wg%gWZ)zz1uWBaAaJUb?7cFxye*~?-=9#b0(1+S_f
zlM4L9s+%!g;_>dEKY#Aio9Dajmy}AcG9y1rPxp%U;;88^_a~+v236)!*99^RIClsv
z=-B0OF%Vo_tor$BGE0*~gOb#8v8~>B7CN(+eh-|Jvah3UZN%d4!i+nbM;(|{CRj3w
z1d3lX+j-<xn6%ufN3b$x#bU19qRy>rcWAF!u;9S;?K7<eiYK!$xi={7+U^A|U`-3c
zdAMDe3|TZ52`YeXl)8NF$5a+3PlYQ=QDI@r=Iu#o_Rg8TcD8xGU)8~!KA$$j8Hxc>
zam(gC%~mttU34(n?CasaO^KBmpiapRx9CD=r%lHhU%6|fEq=)UcFqoS1IhObrbbR@
z=XW@tcH-U5%^^jw7Qu3ztql+6ZYzvS-g-p0LiKZfr<3X;NDF(*)&JuBx+;tU9K9V`
z(<QnuZq&GYzH!^Hon;x)oFVE0T%eZ1yt%sH_uWo<4O-qJygTPX)ZUw)r8#FP3uFkE
z?mAMpfAR6KXw3!B^xU4Ms5c(y(ujTZ#l&Owj%Do(#j1_3SeP`yCCJvQ<|pPt8+sci
zhO7NvdZD1x@Ly+Xa$UJ`=IZz;-nR;ky95nx39ntVW=*2+vN*v<CB}x#@1M6G-?G)s
zIFW@j!u!CCjy`E~zpn1??1mkGzuiv#|M&ZP!F;2nx3{*ws+<L?8_sOGnsU}yU+9D#
zW3p10`)1k7ClfC%_n)7&^wpJ>!CT*}?YBtZ@>g%ct+41eDTA===Cx|Kg+D7b-V!iS
zTV!EbHRrf&c}(sbkDn5=W0L;9@#iuAQM=-xT6A!piA@8`C5HnmI+h)@yRP$6Xm`@e
z;w8Q@uVW(89GKcTBt$PRTBP*zef@v!v$ISme|vk|`}4E2yfY)G_WFW)|AIM^SsM<9
zu}=B#aloCWr&B{N+pPGRPv!T!<*DD_-EE5e>DbJ6a_RIqtzIcpqp*}a-`_no%s%E9
z(cJ^iZd=7d4?24&yakN{{rLF!ste1J;>X8&Ki$e+fAY)A%c}bN{%*ZescRG@g1;0W
zh|vA_=iYA?=h-=5i|1b6Rv>J!?S`D~#XEOmt}^G|-L*BQ=%nhUjmhpmpG@|5a*WWQ
zcYJmCU%drpH>J9c9d?THJrLo4rPpb7*xHcwS90SgJOVqx)FZbgl~b>AOJ_!A=E^k@
z8=ZEQy_Jfonm8$Qx`cn{p@_Bfn|-(anyH+t%&5+&tORO_9PB>%>)YGa*Bt+SIL!a)
z(`o(F+j4KG9O)1|_n9>-djGD&@84N3xSf){K#G%FxB}FjOrD>=_v<tVpHc_@FUw}<
zO^VxF^>W35np>cPHakIzgIh=oq|Ek${r{imo4Ct<e|y`sF<|oPS${&5Z>he!u(0`6
z>F<-<BBFCPnO-ZaQ)i3@^)_Q8bk_MFXR4lCzs(+!A8&s>^?9;GEGXi3Nj!R<3>Lk5
zzSQrw#{q4|t_-1|g3gWKgv-5dZn$t?EP8Un^E{yqZ49m^j-i>;Z@kyv=`5IoG=Lhr
zYR#H8J|7IG9_y9%c64l9KYvpG<h6P$Bwd-V2`}h47NU6fyM)3YFD8`<6Bt~tG#&@H
zG2la|y&)^>O51tg?e^Wq_AV>2(c?g?!wc7t-S1~q9_QHu3RkB$lUemMCp|s*H<abj
zDdXGu-*~rzTJ?v+VpO)>S^oZM)4xLJ%&ANTtNmEE<=hpDT^P8$N5{tEHvfOlr5%r$
zj<2@PDZc-A-<4A*MYpMOYi|>Aos{D@t>?F`K*qf_JAXBPonTVnc|-VY!PHw%gxK$f
z*_@btP^K}byL0EH8&iW<R4sZ@`^a*+*^VPyuCC+myw*0oVdM4YACii9e0nsmt&hL|
zoyjZu@102*(wtXR1b)n00T~{OmAe(SxzVVN<&U4j1*KhOZ==3`01ay2diCAA_1nY-
z>qdvJ6~)tTyl2W<yw;4Tdxv@Xu}KY;OpU^UyN*1Q<}7+r>~;C@)Sb8d6#|sJrd!zZ
zUQ%24Qt?2Hr-B_QC017MOpr~;%ljqHkTLxRoB3t8=!-Rf>~w_ocNX(=E}8BS<?`jC
zyZlss`#%96jJC7O*BGo--2iIsWae_6nZvTl>A;STy3c3Ly&P_D%U%8Mt6%!coFZf6
zOzk|48ygav7w`quzJB%Y?ru<%A&ckB1!w-!SfQ}U$jHS}#YII~M--WUii(S`Hr=&0
zdV87gVGp4VGaCX0*REJGL4AHr5F5XoPQ{~Nn^I3-I^?$d$ca1e^U~CEV|SITwE6er
z@u#EW@f<CDhs-iADC~T<>-D64@?1&gg^ye+UoM@V^8DP~RrjK{<!FY-6t>POx#W4V
zYK~p)t~=H5_g;Kom3*LqvFLv7_m}IvZ01)y;+$z!x+)=q{h;pt7mRll7`-_qL@!Dj
zr=2*~EB&;ITW^BrWVNNNoUxC7L?}iHoSU7$FLLj$s#{w!KOJP3Uvclr+U@tG{vS9o
zFMVF6+cKY-O6l`!x6LWLm8m7qbK1e6`r8}L*j*)o$Mf&)iR>-ymo{G)RR<ah`S!O}
zJZ?hz{Ms<LJ{e8*`8Au~+}i4W=hNykf&CL2T0sTfJ)@tGy7f<0KA$^%%k|)BzZX{@
z-gO6+)in`Wt^0lKmc2IL|Fd^X)>W-8@pnH!!>yp@0w(8jnaj@2vyI;CpY`U(#)~Hp
zoYvdzvkp4zAL3GI^X`|`*DJwyH+3C*I7h<IL9VLEFs|-m^A1NQF(Cu9(tn_hL<Y}H
zOI}>ql6c_g?bYG>*9&)TnY%?y^08g*pA`;oK7an4J<<6sUm=%9(Sa=1JsJG=b|0Iz
zi5`D<W25q`D&@aTtlU=;H|{-CQEB=3;|#|gA8$=PzHir)=VxZ$R(YV#<mOWH@zGJE
z>}xupdEG0k!_WIaJ-tF#BCA2;p<J!K&2Qnym$bvzP5Jx%{(iRhi0Fr9$xg4@r1K`2
zW?wt;`~Cj)$F}?1d~|tvcX#>L$A;f*%iqO-%Hu1=ksoc%Vk#cC&imYLJMF&b0W~JK
zJ3miOR`=dt_jgJ`&h2f!Q{|HrW~@2zea{}7tJ<45eO7HtJ6!9Z_87DW<mzsl*K0Pf
zQoXt@iBpP2exd(-yQ2Spzn`}Ken)wFOi`zUgrSLX+L;+y$CI|n?>!xzx6^g$!E@i<
z-aftcdYpE<d|idf+UtK7u@^M6=%@yy3m)}(_vz{B(2wr@a<R<JkIq><<}tk)lAP|K
zbm6zlhszPVVQw~mzg%vLEPno`$|kz>ebMD*zFDP5|NQ*?^lEtg)I*1yOm8k({pyVI
z`6-Eq+g2_OF8Dw3T_d~Pgxh($eSOuO0tELwTmJc}I_C|q1?QByc2CON|F_Ka_p6o$
zPc<K=*xIjGvo7u}jt|)OcUKUDwu*ss|HlAZ?fGZIzBn1GG|yIku+LcmwBDfd$wc=l
z>WmLv4!qePSKW2~FrT&0*RYFhcE8^kOWM`!@Oo})KXt}`j{`|eZpT~<pOqb8WDohB
zeQnLmSqx4!-D0{rZcp;8Vv=-}j!Qdzd_Mj8l%yXlk7v#BIkf96Xv<S5Q)kXmyEXr1
z43k_+{s=Qw{{4D=^`^v?A&VF`x*d?vaf<yMJoAG*XN1#&bG8>No*vmGws(taoK*DV
zt=@0iPb#ZBciiYTzqi8W&BJ#2u;i&9bMEe|-3{6#C)=0HvPPqTZO0Rdbr)^@pW8h*
z6Z@|Gf^*HTXOP5J&Xg$}xW@d*k)R1pWu1S2O}nuB{k~{j<wLgubkq-h<~F#~bWfw|
z)GyvSGeX;MELz_AbzaADmCLj9_pRKvai2)?;vaoR{E|j4p~@^@x9|VEHtN{5z18KW
z?|!~qKHu$l9B3oc)N|Q&j#<(=-W8lnd|jHa3Ag_4n<o`hZoByH_O#6@CxuckeLim=
ze|Sr`-YyTl{eOx?*M|qVu-T<Pl+ItV<D#HpZQU~;Q?^z7d18@|tKNM)?)|+Zys>1r
z^7ct#Zf)Fh9X<2k-P*loWuVKP{@#w~E8XRF@4LB#v+MuNjo27y<#Nw%!pjYN1G#Tr
zT2;Nw|MX|pDGq*55`|x73hmh1e{imY&GZ|#rDe%`Z&W>>TYhSf2Y*q-VYW@Re|KfE
zB_CCHGn01tClz`-_$%u_)=LQvw)&r*|9dg<M4!ipN%!YXnfWtbN>V%S?!xso_un_2
znRDT(j`aR`g{9JG|5fnF-|^4e|I23jW<#x5mJN1tin+EIOC;x=tT8;+A<9-)dVj9Y
zmuA07H+NNi&8mDqw>;&+y7?))SKRkcH*1PkofX!-@+a$~o#`f9pY6LLq5t!!+~jrd
zrIlYtYcrW0nW7hV=DIawSB6a3t=jh2eB$@cA6&gQ`r6v5oZ)eb?4fTandvdTdTw;>
z=(bNMdgYf+wCBo*)%bLy0yH<0vS-H;z4lbqQ>)h&tJ^Aa$JfW+%DE*Wc;N%fj`vR|
zevIbIsCZ>_S#@cLRY!Gcr)+yluCZwJ{a=soPV8KGeREp&Hb0;5w$V=xm&SFyxcBSZ
zE1};DD=W5&zWeRH|KHXJ#y$_1pV;yI+KD2aZ+3@6Uf<N#b~QOvcXd_ht4`;-UEgiv
zCV$A%u9{b@%%90OyWvu8|Men?`FczX#R8XmzbR+*JsP&_{mWf3e`e=rR?d828<)tv
zqmyOw{+oN=T5VB!byfA7^Wu_QvsN5zxmvrv;|@!J(9S}IGw-SwZQWIuarosX#<|@&
z?EzgY!lzr@p4$Amy4G9c?)QYdNprGpXV1BAvBBTld#dZQ%k5q+!G)d1v4R_)dmjzc
ziJ$fRh<(y#jz8t+_Ob8lTC0(e;c{iQ_nY>p&so}czZZPB`+FfQ)7c~M_ZN_V9V@m@
zeP_*jh5zkTGnN>at=>J`<8B%Kes}cRhF$MxD^GT}e_LB6q8}&pfxGd*uFt=2&YyAC
z&t&o2_AZa3*VNtTi0|4ue@^XpXYHlDA3?J)dv_iAxFE&o-s-hSKkuK^|L%8vkbTkn
z>eVM!TOShI_WqV;_V&*&y%SgFOP`k15WM=%TI-P5_q(gt?lu?kKAjuAB-MC5|H921
zEw63)xm(E2W{H~Uu^*icfr3Y0JDBC%Sa5Icl~tkIU(-(bh?<E`w+J>nYTfU<?U*+6
zW6uVbZvqBNiv-TE3|@ZfcK&|d=<Ru-mXCAii^tb&<dLy3c)MmJWQ2^V#dq7Xy^kuG
zgg6*L1L@Wcc0V34TYkS&%(`Ckp!Yd7-&rd4e_zK>-LN(PzMbxhrZ@YRvq~7NG71^^
z9q8x)&2)k{zNUFb+}N5O{xxVjr?48wJ?BY$(2?uMx;>JU91d_w2wtrE`ik@4oP|c8
z0ytRqd_G=sLC-Mm>}>f;<)xrTE2J~9U&ugd(Z<&3{dIfyd^)8a6cC{BEB498%&gzB
z`}q#HfhHE$=GK0&5aO_AOjg=e@-k?qP35Ksyfa^4TRZvh_xth3`eda`Kl(Nv^L~8c
z_nBv(nI}(eeOC?MrhQPcVf%e4PTlBjQ~v$^eY$~>c}f2LeOWqR{{4PG{n4W&<)5#8
z{?vUJyi-0!GO6F*zI$)lDSsh_##_P$*Mvb`p*f}3A_Kjjou9A&{Z4WJtfl)Own;Dg
z=y>nKJL_Xvn)4jjWlrm5S;ZkCd~ub|_nfcq?nd9*maFYOO{ep&=#KZdYLBZ(9c$EF
z(6~BDtb^qd$fprG^JhobrYzXACq_X})~ckV`jf(&hTm~PL5pI_c}xu^FmSeXHwX&W
zemp9k`t;OPql^m*nmRfmi$MJ&?v^i4Cj0a01nzp@xHd|xhs8$NKxvV?Oks;o%#MI#
z{qp)%wHoi{%G*|Lk*R*OabE96RmCs`5mC{VrW;D`=dLup<;nC?F~P-Ucgaho?RU#&
zzp8vR&Hs-1{Vkc7zeLP=8ng8`-*wr|?|D=lm>#MnxVV@e+OubmLx1C?+Uurg{e=`5
zeGjbYc;(alZKZt4p_|_qT-7=4%v7rGAn1E&!n<lAhdaJZiXh$vh7TS4FI@`Ko)<i8
zfyCBJN3t0hq_%+00=VPKq%y&c>8g17vX3risl1@Mow$2@GJ|(!Xmd_zsAPK6dCXwx
zZ#m|cc+UnFA)y5wRv#|ZmLGVa#yO!uovGxx@{AYzs<X6xT$sSaueO29f4}>F{LRiQ
z@{2thST^}6Tmg3^O6TwA^*^b9H*VI`Wrr^Ro_S!}+UO^@^Y?$<+?lyq_xAOC4c8F;
zdD|1e#omr`6ZF09D$&w2+dO;Sv`4H9byiMOyxl*KXKu%<^!h`k-*^9hw`FVMk$b%>
zx9Kh87j4Yx_FR!*%_XfRxb<Xh|JKsl#cX|9k3kNM=V)<q+3L;n;-;LvXV^!xo3qyF
z-0^2hR1l~D4ThNQd|$WSlt-NXv<Fih2TPR8#u`rWsP&?pO;^1SCrJr$aD%!$;EC(D
zr;8FSJrzX3y`A?fL+me4V&J?o)nS24$nGN*@2l(T>SAv$`C2hM$5)#p&5vmsXaK*$
zQ})QhxV=?P;#X6RAPcH8C$F8k#(7>hOO8r{i_6D*KmY%EZf}%)jOXjR%7z1PKB-QR
zQF527Oo`fgq1InJF3pcgWkL&R6@c~g`xTFQzxMqE<+85s?x#DS&jXFwhgg-qTJmqw
zjlk7+A$@A0w^6B+7B(kjdwO<OIcwA<NO&AjY5cc$_v|x$l}jC9rAF0@g<0!8*R5DF
z;pAlX(|amEUs3|iUfl}ox%%na9+4>Z$yG`Pw{H|b?Rm`qb;`8PGoZv>F~R*!^)qfR
zt|?o0m%TO0GQC^A*kb0)qbyw9QK#;|+Y!Tcd)tN`BHw1`xwzal(23sW<68du+S%Ol
zwU0I|+q7bZ$KKob-s>6O{T>x+$p6VB;Y){N(XR>rL<0KvT$-t)tJGzla&C@gFc&xX
z(+AD`W@+{@599V$NuJh^mAqK%FCO`fo2lgf->ZC=lom;Fx8AnRyJK<kEbn<~k5i{k
zh4}9*e0;3wAx~fZuhkoG=keYxufMjSP_Xvr)9I<#)<ha*UD434>Rq;~_1$jGNoS7t
z9(Z~D>*R~}_7mUjmY$<?TvGHRXh*$nuGQln<CGT{7DnntJ@fPbZd<(OaE02g_y5+F
zCM#K`pOcwsQMd@y$16I>D*j{lm9{mP`S}<A&g0P7ywa`VUA3vqzQ0K>F4Og5SBYIq
zmJ#TFYyaoN;f%&Y?u=dUqq^qlG)v#AJ+9SgmU}DZ!x@`U362Z3+m}!4?RfF(>T1^R
z*Y!UhvRA&@czo4VIbrX=zrId(>y--a-u{#OPWcz7+#UY+)6OMsl|4PZuJj;hqVB%Z
zr)Elvj?0$Md7%H|;LClV-z{Eny{zoi_g9av7k|>Qevw@prmPh8dUJG%!rk(2t<z4y
zFZV@9WLEnw>!@0>8??wdPhr9DcZ_0_m-sZit3Gw2rW7=CQfhIxoGXJV;7({ZXaRrk
zIdk?Pm&YNkmurvn*u1yvV(z-QRmtJ|-mn`rl>)9;mPTD$7rT1i-;?*2bI)OL*?L#q
zpN-G#d%~QMiEo1U@BMOj{{&%=l}(>BtGZS!PI|G=I)SC)^8!8HCwFwZG8!(nZORb2
zxc6$_<zg@An?aEoLLW34yE2v}z1a7AOX(#Yp$!cVD?mdm6-M^Q?R7KOnoMM=@le>J
zlr{M`Uv&MShwk!b^0Qo+R0O;PkA719bMwOQE8EQabvEBR@Xd<}wDxYHP~h8ri^cxv
zE!em%FJ}9(^4@l~i42?_Ep9Hk#rM0ryIH&c?7T34x+dq3*$x`uJpC!Cu5RD@>?3N?
zwY-y#O>}7EV2N}2y4w2ByM2rI<!&-{emi-&BIA8w(5!0h_uAWw8&w22m>NNoyGgm(
z?R>IVexxfziE=wKDJltAK&s<w0<pq6TAWK<6m*rk*d-ocESy<WBXjrrlvi^*JsVhf
z1W%Yw=|8n>&z_ihRj)LEKGm<+^tb=J<>VUSXROmDyqi8;^Zk<=v`1L#*`~{C(XnUJ
zMK~uo@GvIZUi|s_`RecI9*drwI(6zR{bw<mKUc*jNyo{gPhOk3QYX!eiBTnCjry-M
z#^+CbJT9;Q{cd@@o59qnQ&*}w_DY+J?dM+MyDe?WrwSn<4grvPpiavNlO;YZJC3NT
zs-7x6E^AxIXLj>ddf%2_mOowxX1q%Ea>xa(OuV|DcS_mBhWnt!C_bVh!tOgtFQ1?6
z{_CNlM3#nz#)qwIXRb1z*Ur-9b-+q+>(ScwxdJt8LJExu!W;Zt{>I1_+`q`Z^`Tv@
zeesf9l>}kNt`&{9igvxPi`Pt8u;WY<i^l=S2BlXGfwO&WfBSvkYxZSRu}}A*LvQBH
zNas}nH9~5B79CtW-3oMg$g{Jv)pzdPS@hu`ySJZT-#yV8=fNqwaOv+n|EY53zru?S
ztv_}n*+BQJEn~9MuOq_#F7w+vgX(`io&Jjdk!9i`mdr~_I^QQ&m|l3fFW6yk(CNBe
z|Eo)9Z4jUJw~AvH>oJ!v=d9oJNJ(G+WO28A$A`MOtfx^80&d@I|CU%Lev#nH;CO8(
z>}saAXr_VL?dK7@%hv7+?%I1k=X%Tc&zEbzpX<`hc5hI6)hK<poPR>ijFxx1`L$IW
z)B;^5hiKjXuF_DmV>VdmfLfr7aERXB?<@s1ySU#~|G#|x!H?zsuhl!!0$pOWLU+Hf
zSiyDNK9=F9N!PpG{@Q8}(j=?rWdv9xuGPL)pY&|6!6uE_o8SLie{<d6-`uQM{(lt-
z;l3$cdPV1MIXjQH*~@*=L4k~Bla-`a#=PCPc;3r>w=dti`FqRqbxk>$FI=xI+up*q
zQ*l|4*`3mooA=d<K52+%_{=r~^(b`W56REl)530R{9``D-SYp}18?Z?tnGLeUJfeA
zPF}9vzI@%Gl*|_{Q{L^aJv;l|?%Gl@wQgtCMP|F-_udjYvF~|5Pw?%KRNah=F;+5{
z`XA3<xVo~MOGZj?>)qP?!UFk&^30qQ8uo+o+sl2wS0B76CBz}s=+M2Qu7cy<u1@O-
z;A4aim^2>fT2XfY=Oc^DzHL7zGH_aOviP}d{e5poVX~%%#)G}@&)s@v#yO#(5Hu6I
z>;19Y?8YjLLLQ)D#CP}hMt@j#{@U8;)#kNomisr}ExF&jFvU&9fk_iIzmS@m`sw=q
zf1&$+z0$t9F}WRd_{@Pu=BJmu^?g^*c(ljW)z#^{ZEI9|kdOjnGHCuSHFYUyxX<g1
z!mPWyN++MU{~t52`km#<@b&Y0q)boEIC!pS%kRFK<!25UPhjAj;IItTBzNr=J2^?!
z`^hQo^;44jEZwFqEPj3tbSBSC)9h(IGL}K0^#faSO78bQN=Z|3VA`sZ@Z{vT;%8?j
z&Y2_gQoi!g4&yJculqm9b58MPwfQZ~#06U9?Gu=42U4t>utc3}yOgk}fLVIR^>uT9
zMFj;t>RI=7TU~|G-S1J#Pa0JmnA$ic1Oq!#)-)XQlignWI!rn3ajknri7YedP@5mE
z4T9xzr)OztX=P2(G%xr6_G_~nlN-nb4NpP7-kf%J$(Ai!*tmMyl|JnIDwQGO$fP15
z02=mJ;+(#B&z?O}VtZ_b8&CJIN_;3Tq|nF!S^+YnwcYyv)9LYH&c@~MVpJE%9ADGc
z8t>7-!sK$`#F0x2+vT)Cy#&w6YAcue&6s+8lX{1i*sbKB!eB?SOmy%|;Z0ZNy0$s}
zyw%kA?ecXKK0ZEvdQ<9YmU4rwSy#Q<_~rGM&nfbn`|0UH&|yyx+?l$?^~2I6g#%+f
zdb*RGIBkR3Ku1M!Xff(8a=TNhu3}TcQV(iqs|c_$xv5P%#L$(h!YHJ`XwC%QyQd6d
z_p@j$l5;ea1cl5F!37<=0uyCG><SeJ!LJ-$CqbuD9q46nz0%9|7|d2?>{{U-;Nu25
zp(>9>V^Lm+ggb~W#~I*a+mvJkazcT!gJ9|6Llz+R2ag7&SArswCo*tOXpm;?S|KfZ
z49s>1EgoMmqX%?~)g6uim%A$r`ao<Op#>dPEJstoo^)$adgazy2xd=YaJ{0ep$2yL
zs24_KVKgBPv%H|#t*xs&ReSxOpnKKt_c~0e`Tp+ir?=bhpSrd-T6o&=lAZVK|JUyP
zb}M`7o;@*hudkNn?Cp7DGSz?6=YsmT99P!gO+0Av>hI?BA7UmP{9kvpIO?|0yIWhm
z&GPT*+}@sVp7$%Ve9vRc^Z)<Ubv)nFDYPzXtJk|7kNGUWUI~6$|L=KyNDxPKYU)yx
zygL?ED_#~&pEBjdudlCJe=6;`DQH_chu7RXd$RwWH<EMNm==m%H2IJ+%}ya8B0@vi
zy>E(L?Jt+Ll|LS~vnqW*ZvW3vYWh1~bL&ZSFP}Yk>&fIdHh1#-7+kN&ct3k0%)~2g
zHs#^r_VCSYdjtNY8tu3_@y(ySvTJJdQ=UJpD`wGHv^Ayk<Cf_By`gUXa=M_U#xsr6
zR~hbT=C_OZ_r3mq_$-r5p|g_7QS0~pT2=Guq<T<Dh|1cit&{HUtv-Fe{@>>n)hj>m
zezWOx%C|Q+KRs-hKLx6NuE!MjzNodh4yv2ymfs6}ZuM%#;wO{5^#Y&QzgoFG<?E}f
zm$qhyJIc+qDh+ymeCPeD*Ser8`_}yxfyytht({#|TsmvTLc7~P-sab9x62fD#1tH4
z4LrTfceWbnl$JmLzVDw7ny9GQaen{ryYHX8SlmDDvcG-o$3x#YpSO#y`?h)hNoIZ<
z1^YiAnx&%md^{$7)i6A^bn2Fji%PTJ&(7bcnZN&U*&VAMwL7~Ttr$PA-}lSw)%ErI
z$7PCpOfoJkh%#Dou`I!!>CV^Z^XudG{dmM}+Hz^Bx47m1KcAN_SfH?OZtkruD<}GE
z<!VJrf4$^ZBHfcae|lWi$~$$x-xi(HTz=xhLg&>}<?lpq%UO9Vd8;hrZzsXEsjZI=
z#ct1=`{%Lz{|Q}PT$T@8gs-r2Y;?(g^lJ6`zGpUde=2@{x$J*cLRPP+r*QALTiKf`
zJ|^vay>7RPxp{c+V#WQSI{l9VgVl@TzklD?hX-bCI6X}__|V?W%W9xClQQLZ3ST*a
zmSH{xjS9BQRe3z!oph8-^}&Ysdp@6=tQ)=U1Zb71fBmn?yD|#%_Orz_%vf`<-`CHt
z&*<~we!C!hm-xD$OF;u}T6{9$>ta?O;ShYVwd`%w(|zXI*L>Lc<<>+@ojTRE{~*8Q
z5oX5HY4hjL-@q5@bbSBscf0-nR?ICtCOK*Pbn&&^?vt|0UQ}?LF27%^o<6s9+LpY#
zQJ@aSif|s|BbzTr%FRU$zTa;)_y77h!!X&+R4^8_813KB=dax3Zp&Qp@5+$P-WIpF
zYE^hkw`k(wHeRFjb26okP74gYZOY%pT>X65h5gV(ce#~%3MP49{65CA`@FkTeBSnI
zm1mWFmDTn;McpR3w?bSUZ4}fVAM2gW$jtU41++_A^~#H>i?08CZvQ{>>$DQ44$eyl
z!oD>8k>ay{V-RZh<;(8!_j<Rt<qF4qc;V|@v!$bn@e!ZZiv?1yjRzX7t9m4aZQpLW
zyeRWSb5nzy=8j{l55HinHvh1g^&4oU`c<Q%6jR0byXD%3{l4q>A5N3$KB;$C?1Hnd
zo?e*KoHKrN{a1m~kMGjn9b5gc9Nv81Zgt&_Kz|PT`ac_g36^im&8@#+_xCpM#+EM&
z9Ge%3%lq6bzh4{bAEdwj=dai6Lp{H+uJ2~OE}Z!C(o!q0+C|e}mKe{qE<BjY=xTGW
zRc>mq!`ALTIW4BDf&z2FvUhh@>P6iBeMM<e*{=`rpb6H{f?C0SKc7ioeQo)2$>b>-
zujZ+^h~(KH<I5I)bXC#iw(bk7VlI|ftcSHbo9x~-F!QaLrgK$(Q^@U*J)d5h&GM2i
z%$}byJtJ76=@O$Xr_Y;(%cZ^?n787glv_Usqn;g8mE;RYtE2oMBeI&eM7<GcU%;Aw
ze*2OCcP}lv-nf93?Y4yT(GQGm+yy?%)FTp{bD8e^{QK>;|5vy3w%=oB+Sl*<^6IMh
z1!vbv1G}D&PCcy2GmeB@DCH2prkitTN1*F+ErAT~2mOT?cD01u4tcY)<Y$TW(Yp1y
zN7kNgWUf1M;rE^wi@HN<6W;uvQ+%$|wp3yNX7yRmvRW(teYxzvO8kY5XjQ9q*_(j8
zy~g*xm>o+peAagF(2-8zt0^3J>Z6%hgp)f8jw&viG2!*a#qGZWo%luehJ0x%S#K)*
z^isC3q0S_)13R=^ZfeG@lv#gyR$j2$Ee;#qHKuLb8w#^|7B6^rNI+vz=DMfn=31{d
ze$Z6T#<NS=LEw_4g3XJ$^D3XsyeP^nkRR>z|KH!KD<cvc<Rn}~7IB6P`h0Ac{BdJm
zUCz%7&6nO~zu6bEKl!d26N@wZmp_L0W@@~6yv2ImWvh1HJvTCU`OeHxUZK9mqtTl`
zT+Z2Nt8CoGn4F(HTdn7J?w-KLC!-O(+%I(Vj~5dUO^p_uDRb}$AKRC?k7vHjFv-2W
zE!1{CXfd{d*|vg*PFtB2WS<wE-n_0{F|kKHwc&T4s&AA7XhBnzO@Z`W?*(^q9ArKn
z;1|Dh?c3Yi?$aBNde7GYt#k^vt-7M<!Y>>YA=)Tcyoe$HL92LNKrZ9tpc!+I_cMek
z*nB#n{3<}d3=%>X33KGV|9)sL`uTLax|86F+J#~lcU@UBZ_dT}R{DQq>yvCmUVEzh
z%uoQG;~>@VB6CDI`^}e2vUB6=U;X*8^6{7D_uAiYEUfYgIiCDhF0J_g*Y)))?PClg
zj{gE3clk9y`04udli&Jxh`D^}Q10vabVx!*FJ{N_jd_dpcK>VnJ42wcBPoOV%*G`g
zN^K8(p8t`PUN7YSFVW}Yve|h;I>v{JjIOA&u)H?hxJ4&!?xCYcZ-sARUNghtfQr(z
zf|n1Dp4+ueGgj|!=BnO=Rwf&^o>cjY2aUTt8vmaG?LOJnyEy&)yhi;sFPV~Jgn6Ul
zO-{&9HhWRHYp0P%f1$EZ+Y7cgTTbfQ@4cTZU-$7NyI~>Qj@MP69F8AOb&;EK*8RY?
z%Wm8MeBD_0<A_q}l#?f=n7Hn(Xuk0vOm4~1B?3o$?(+!h$L_J}vE^4|Gn}#@_rodC
zuZ^s4X3Q*~#`&{)t8ixFK2YW~i@I*sRQP&h^6^s}5)WU=-M&Hp1mo#D0;}R{9rX&O
zPCXM*oNKGcvAyDryG>QoN2fiHziixi+_B^C5sNT~!k9NR65s4h+JAhW_U-$MH5(Pb
z9Y4JD{#u(A(szGf$$Y%DxcmBX3;T<&i`s5HPTK!^%ZmORRu_Noxz+jQg#A@B(e=H@
zZV6{szbVgM|L@2K7PYemIfBa$bS^cxYIfR-DO084cA;Tf@7L3bTyHwtR&I+76Y>yd
z<k9YxFkEylJK=IlT-4^J9m_=Zjnx|q1P*MNw2xa~Ms=N*>fN7OVt2sD4Nu_=a0zxh
z#tiBsF6d%#-O|On9mG~hWfHkKW#UH$P+xF`l7rydq=UL3w#Q5cSCiBf8}O;ft2hE&
zR!0<cgZh6#Y7T<Fl9K!ipi_*sm_#lPQ7Z&$-~V}Zv^&^t20LhM!Qlqyld!O`I*Bq4
l9q^&dSK1t0?9>0(-wZr+Jakp`F9rq%22WQ%mvv4FO#sHx!vO#Q

diff --git a/doc/images/dict-cs.png b/doc/images/dict-cs.png
index ccc02b0d17134efca5b4df2e932e901b474eaea2..55e5ef518fed8b9c598a79ec614c8064be8edd7c 100644
GIT binary patch
literal 93837
zcmeAS@N?(olHy`uVBq!ia0y~yV4T6gz_gEpje&t-z8c441_lPk;vjb?hIQv;UNSH+
za29w(7Beu23xP0W`us~l3=9qoo-U3d6^w8GI&Mq$EK<oxfAUbuLLvQ*+t&u|=MNWL
z3pDoI(Q&4X@lW&V%Lcm-RDbB`Ib-r$S|Bt~Fm(5;cRNJa{JXjT&-MDh*Z=>0Iz9g1
z`T6H8r7fWFN2T<S{q=VG)8}tLd--L~0|?yM`2T%;%m1JA|7+S*m=!?bho`)MzSsZ%
ze)jis{c?+An;T)Un|F@*nWII1aQ&~PE%axsfB(+nJli=i)H5rHGY~&*xfG^leg1<z
z3H$c#eryAE$c`HaDi6l!Jf8y5aE@)?zQ)f@KYzXJ`wVeY&VwZ8=d8sW=LB0pwfy+S
zc8>em>)qDpV5W{bgzewc*Voot{s+ZV;-A;?|9>ryulxDb|KRPPPj8nWO6ZIDx!Y`B
z__;UvV*fY)nq&BNv)%9Wzs}TOeQ)!>-~O}C>pws5|JR+f|Nr)StM~tY&-(ZCeg3ui
z|Egu1(*G&$|NHLa9r+Kpx9|U~c*OqW`Tz0%zsBb;u3NwU{$JMO+q1>J$|64IE;K**
z_oJ?T#p37OFZF(Zw5?yTKlI<Pj9<yqX3l^6-)Fsk&9d)4{p>&fiJzPr|IvOA=ef`S
zf4KjwHGF>le*CJ>-|z4D{&BND{`{9;hthxj5na0XZ|PU}t(6O1RzLr~|DOEAqxJvg
zefQ^n+r2-b?!Ebo{N4L5|Ai)zgzb%=>)AKoKJyTk@b29@P<e3A)_uu#&_r`1_raco
zve}k@ZXSTZXi!?+ey#jWIx__B2Bqda<92(fj*4vN=d7Qv{p$OPWJ}Y{+-Dyk>eHF?
zL1x~Ix^Fn2cMcf70VVg{XJ!6Dbv#%LGBf(M^)pyXy~}ovJ8k>S!!R9twl;ols?4rE
zUIWc+8*U${Jov_}_y<hKc95C*Yv0d+d94iO@VjYz^-vuju7R?{+OM*oAs)MVAdmSu
z>u6v=<9ReNMrz8a*pu+@*Y*APObXI1;MxA>fh^|Fe?L|n{PXFwzPWA8O#X6cJ}NNV
zaQi?_y-l3K<p;hj>3^TVvUxi5XW5HC+r@pv_jEppd<@HFpnO(Y|K#%fp5xqZ2ffph
zW<4rnM&!!#n;GBt+7#}O$a(Ow$+J*3FZlTL)Z|unNH+er)9k_b`hCKC+;bj(Y<fA}
zyX&NBqfc<RJ*?XO(7&~D_5J#-b?RTdpU1CB+E*F1q^)@mRQox$e}-lk^t){?{@FX<
za_@BC{D&Xo4eo02Dy6+(+mToF2v&O3_wcTXQ<!(=y?xGFiDRFC=+7`y$(#6Wa(3+T
zF9@@KNWZxMzOVT6zq{h>i-Y5juC)Ef-4<Bfc23y;pV`CP;rvHrVfFQo$N2}|*XP~Z
z|FrJ?;q`U@Gk-1?JpQ@jV2Pv6#@<I6GIRbsfCbR~^K5_S{nq98TQ@&#pK{P*|34K6
z&p3UWBUWx)6QA%ZpZDB#m{R#P=DOXn8PBZu)&I|I`m-ThKF;7?RPLeD&jp{4F3Nme
zxcXog+_`o8d4KepZ7kk+zglYN{ZB6nO!j<w&@RqX%yq<qH~93y`<s84Tl~3ldF5&T
zdEjDs4(}g3=?}lTjYDNb&fkB3&U)E<yT2;(aR#v+hP_3*6!SiPnp#%1$o4s`*#3UE
z;eL`u{qw(dkEM%)OE=zrt=@iH+=nI8&fj9sLtBySyKZ*Zf3y1ubN>1J4*#E(y*b*z
z?YA!9Sv*gC`@c`D&Nq5_+D#6wT%2iVRr9DA*1oB`&HE*PUBy4Wa=BjqxO?VTSMTiG
zt}o%+X?lqLFzeBaX4kh)jeq|F-d6izDg9wKSLsyt-`j7!FD|}#!F+xA2Gg_M_Inac
zye~Q&3SGPN+DEpdTZ&GIFUfp&1eR#en_t*Jzb-!U`mV`V>q=Ly^q*(9<I;-yii0jU
zdOOtI7O%Y3$Gu+cOlAo8|5tx9&O=&;Khp0v+`sf@VZHrF$Nd|%bLQSJIbmIXMtI-j
zdFMYrWEI}{jKz9R@8ZLy^F!^$Im`Ce?%oNlF2Oo)-F>fK_wQI*{=-}T&COd@$6lTx
z?7QRK;o2YZWtQDM25najbxdswdRLwdH(W1y@zPnTvj-swwSF7#nfuQBr+zE=YAxM+
zKh(;u_G5tTrIU+i$7J>YZ+h7{%gEvEI)k`>FCIOeKRx2(+wk`AV*j_0_?n-~T&Mrn
z?VQc;7qfQ!?E86mZ_$gdQ$O3q87L}!%1lgJo_t62)n##yHT-e?^KIkrH$%dx{=M{v
z-7hWw#GTty+WGg~qvpxWFJ`y?$=dz%Rlj&oqozcTg3sE=mO5YUf^S!rq_v4ZK78@;
z6{~kYW!=lqL1Nzi7TdbI|9{xn7N1Tpx_LabKmGTvPv3NE<@9Hmo$D6No^Z!`#o7sR
z`IfmAn=^tAtLFJ9RTfk&vWF%#`Bdh*_n&Nb-`{^VKk@e;zefuHvck8_pS%9~<NuTF
zUH)(Amj3M|o4xJuzLe|_RWn6<cTDuNogsI&-5O><BJ=#8e;1!E?oNEq^!)qwY~y9T
z&mMRD{yu%0+K(UlGdSk+hO|qS-rM-gW!AnFi$7ORUyZhw?`nGv&7<;}%%9CyeU6>;
zdo}CPy8p9Yr{~Jn9X&hC=EnZZC#$b*{@E|y<963)PE?=FI=xk8<uUcg@BcdTDRT1R
z7edcJl&le3_xQ<kNYm%fTC)rL!*@DAPugExd;H3Wq_0ox9{zdO`ufkbn*WP3^Oi0T
zHfEQ%?{hoP|6kdNZPAlQ61(ngjm`0R{QuAS|2CJt)IAIB|E6F6^Yml8A11==#dmi8
zEU5bP^ZfVkS=aNAsmFi(?4re2_tfU~_ci}+&V2u^`nvu5-)rt~{`Ka&PW|@#yZ=@0
zPyajbYWn{4pS%Cw`+EMj?d$Jr?0(yxzW?_7I{WXh@Av%S`}x-6{lD7T=Z#*!72bY4
zR{eYa|8M!ecazG!l%DZhJzMdxIji&b=Zb?{IwjbbTkhmmJ@@ii`LpZyP4*agZ5F<)
z`tGUy51Z<`+s*gw?#C&b|9Kt%PT$Syhws;g>7V$Q|E|?ua)0}OiM`+dPTQS+f8*mb
z3q9iv&u+HzH)!Yock2J&yq%Blet3J^_|DApwV&Dc&;9)8`T75U{{G+j|6l(9b^HGM
z{n%dfyZzhS)A_ESLhr=v*&h5qF8}Yozwds2e{cR+?@oRB{S|V1_a9$><>#4}hw}Oo
zy}NFF%t><8yYerxJN)nc|9|gK*5kjg^X|usb<ftndU!|mqa`G*+h;THzCZ1mwVC+!
z6=h$4i}zYR$-ZJ9bA0~azdhFlXLDa|mjCxY;nsvCe*byRyVK?Ohl}?w`q|&t|99Tm
z^Esarzdz=`e(TxQTjkJ-W&Xy-yYGWOKl&HTW&XL~?CIk3M<(#Ey32BZ|19Cl<?>q>
zRJ?kz(CUfz-;ePIo-$4nc4|8%R{8I*y5QMAbN!ANXT8^iKa!D~b@TJOUG?W@#Z~OR
zwfWJmI;i0}316cdo6S`7eRTJ`{;hW5|C@GlxxBp3+Sk8Uy=-0ncF%9sX9qvCJkNZ0
zxc;C|;wL$+xR-~PZalbULi)3Z;WD;wyf2%J$Da3>yL;tSVu|1P=&LXJAQi!lhWlMt
z-ydIfOgzN@&#Cv})m3pn?0z|!S{`AafA)D}_~);+znWgEJxXXh5qmD7@|E3=W0LCi
zPiNe}C7WJ%-#o_e`lRh@m3(h)t?xs_)$GE4{=dH)-`}5c#AHM1!(SiTUQ79BmltLq
z?d`m~G<`{Y))tc=EAO8D|Dow(j{33h8;;n0-t;43{*$y)-s`tweX`w3b|~!o{aSRL
zX~i6y9iQ6GwIOl#KSuh)`~CIuzrHiei`)+Q^zHJ4u-YqMA|84fryoz>xAUxOUFyHA
zYhAxT)U$8i<-=yBcdgfI-mWJ$j}mNFM{2+GS}#`eWyW_SVf*(>*PXxea`vw)pJYIl
z_>bc^8|t55n0(ge&yz{d*VLuYTE4q;|7+pLi96m+t(o_)*Go5U-U5rQt7mL4teSLw
z^1RPAKlCMz)@j6S_<7Suu9y9B=w$OtkJIGpp2inm^s6t~vb*|W<<pvj1$=RK8@FyQ
z`vfY|?Z2`8`Th0%pI7(mxBR?N@=o*X!r3*SuDNWt(yl8ySy;6z`ut0as$1W-t8LuZ
zS)TrDy1vBWGT%eeZnI<Vlon>Sbq9Oj**Ehu`|la|W4<5!ex~5v$@_Afn`_<*vak31
zzUR{1Tc8qHKA-vX{q^^I?p%4#_GR|OSr#kKEmpUi;s5zjMOk}%ZPldbi|b3CJ=k^5
zf3ZH#|Cz~l=O43P?zK|8lbCJYcdz+Fl|<zi8-uNVll|j&T;2I;soC$A$1@AJ1kay&
z_G8=qqbuhYn-!RSIDY%UyZbqxcb5L2EzZ7p@m$0B>$kI|U!Ammw!FDYCI4^F;_Tcn
z#`|Awyxd;??2PFDii0T@&c}Dmu)fCg?Wwh2?EaVh>)E2`@356!zRmjORA>9o&#ora
zbY?bvIx^Y3z0H1xv;E`fk2Q07=kWeHYqsIH`ThUXp6`#ZG_bmLbG5wJ+Py0ur=O9w
z_1_`+x!r%wy~68PzV`d^&zM#5%KEx_)kdrOtbTEyNg_%~8GbS`vS)*Z{ofp{T9dYR
z$BXc~TB)-~&&JIEkY-wzqwcuxi|FM?lfFL;e}AhJ)DHc(P5MRs`hRQR{qy~8e&0MU
zv#`q9u6EY@8G0VOyB{y+R6B0!S6>uWXrTV*)r`rrZt%o>=lNc7uw>!c9>?ay9pU}$
z{dK?29y|XtZN=e}>#HuCd^&IWV`^Cbc}MHdQ@`Jo*?Z=NoI0onUQx^ZH$U@v*4bD0
z-~ai(%D?8zj)aQ&&&oIce741Jt>wn3^F{NYy=b;6nVkK0^~QM@U+<p%zv7_F3+FjD
z?#`BbMCaFBT-I(e?Z{cx?=wI5K4||O_v@1V;d%CZH=FC8k<GYuyZm*<(n9-P*H(ZV
zsui`&|8&3ZKihXXGi%c0ri;&;yWQ7`$7WmQ#r|3CeA(1?ms%M2v*vzz_r=$C-msDS
z$+z5Z{<FhBOXeTvR!fpUlqWEGSH$9#hu@dHJb!t`|J9!t-#+`oI_BuJa{15d+b@;n
zf9Jn`-sAGu*!9nTf{T_t+Zg}X#r^zlUT^>B_m}ta>wVtU$!=fv_~!4ex9k7dpDEw}
zWAfvsv=?jT;(F)J|E9fSe_Yy&rT6|kW^Lx#X0S0zs&tQZ$^)*i{%fmC|D5~tZu6}D
zk8fT7eAjqRM1RExZNI(M<ud+%&X%ru4sI}gWefZNPvdWNmdNEbe;)qXoztUUH}Bom
z!V;6t_2;gX${YI3@0;vzulMK5vTctJ#n1g#B6B`(UtPa=5BI^$W9&ySN=U4;{UjY3
zf42Lw^2WG;*!W%Ay8I?p&nkATdT(J<vcB_G?SIMh=}#M1|AsWu_J8Mn^Doc*{>Q8P
z=U+R!<Nw++nY(XpTF<S$GV8c$+1|&N-ntro^N+miY_HgR=IyU1PlPL*9%Ts4zFcUr
z=cmEG<J@kO7hHb!>_{!6ull8T2355RZ_}SwfB11%x$yJJ`Lc00z8^AOb@+?_-Q_>$
z-L2Vja<_i&=c?7RHqt-bZ#C@y|9R#tar@ujH(xrtZ*KYi58C#9`OkiIt`+{ir{M2<
zo1cEu?`73I{PH^LbLafI-@3l`if?~)+3G9*|J^4{6j~;qpKxWtu4Of^=I<2ouX?$7
z{~Weevo~LIojh48{`FCl-p<M|@9biib6;OxY1pGzXlI$W;_+3r_j=}^zpod){#AHB
z@1H=k4Zn7GHNVr!_tE{Y_Q%?D?fECa@AJRy3chS#S^O|PFYm{@%A=RhRexGjG4E=P
z%$4-^s+Iot=iEQ<+U?CB^XPc}!82-_ZP{^iW?i0h?Coo-^IR{#EXa&oBbK9gujbIh
zh5L#us!QJY{fxdZlUqFVq42)+OXlLdvU0Dq+kdfS3ax+j@Vuq;kHxtM?q9unKi;%_
zn!k_jznWcYd2#DSzsUyW+uQo>bCU8<ZvT;R-@a7dRPILk(bE0rkF7s<ef#srYIbo3
zx@D2f$z1NjQ_6d~_ia5{T=4zP<MQig^3T7~ea`I{Zz2Edo#o?x^IPd@+ZI`VH?X#N
ze)?y|mz?!c*^3t&`ulG^CaHe@;^%pD-*0ZbpU1p<fA-n8|NdQCV<0oXo_(Hzsr;-f
zw=PE&e(x-sC%XOejQLja$w}q2iz}lS`)3y(T%DYk{e|zkZM7Ni{+e$uWBybeRA`b?
zH7hA9`kKI>XIJ~|;ryCU>s}gLR=%=(DCAtTf!}w>x|cU^g+F>HSo=M2_8gni`30Sd
zb~n<quKbwv*+J^YXLWV^3bPHj8}{4B#uvuE-`~Au@?`U_uU>NX0c$O{zPMUhXj`9k
zCF8bs-r26p#v04K-}PmkUFo|1-sg<n^M8b1@&EthOzX<h*!T1HU%sFhZ_wo^?wK=#
zyJT-^g-p!P#e1#xT--8Wy;MG?<ZS2c`Fj@~d?~EQ{z$#7_PVm%)_GHJxZi&<OW6GW
z-bdYR>ip__tNh>khLryN@|gc$aqfZp&2?Gz)7M$pdCZ;@zjo(~N#(w>^807R)o*?F
zbGGpEXFI0vNq^83Y`*i`%lC07t^20C$y*-rf2+km{V?}k%gW<hcI=aWf9kON<eGWQ
z^=FuUneajHN=?$vUEHr*{r%Rry^dLv|LNVuoprJIkFMVL=kDgeHr74+{i}cfyIA6z
zvu{u7<$S(*;p^ND<}~}CTYSw@c1dNM?dzG}uKcf%o>5;HUjOg!cUAvOmhlDO-Yoa)
zZJTetE8Vbu%Vl}}`qu>?zjUU}n`>tEx#Eef`Nn;Bz2`(7-||v&U-q*HPkR5DIL5p_
z@{GOqmiDr4{^jn;CFhpM85kO#?_QFY5imFX=*JJL=V$($ySM)PpKERT^06ja2m5~B
zo^Bx@^)JEi$N4!cr@ziGEBZL+vT32ga@)?@pyiqV#eY`IZGU!uf5oJ-JG1(B$A4D;
z_xr|yKc8RQfA0Hi@^4?|rgNFi51VB_`|IoOvt4arRa5<8rDamb{zKQwWc=;(pI^Ml
zW_wx7%z9SkF8}La^8D8DpUqk(mAglFHT%(v9f><CcY$jDw!YhU+-!0U=4TYhy3dd4
zk9^#@?(viG<y&Qs8>i1$8~??|xNn-=tDFBqduHFLy>iC?Ug4(~g$G~qU;o;-c<!%f
zLYL3qJiFW7V0rbnJn{Rnuivk)xHgyX_f+0D-|pA^`ZmAv_}b{BYp=44_o&bBTYQ<j
z|FQ483u^BzeqK3mGwbTkSC?(0%pbq_l(}#3vsLUzvx4nEUt9lZrT@K{^CIPYAK%G*
z_D(Y9EdT$CgGYR>^cHOP{B*5zvAFx>$u@iZcU<diw*1mrXzX`yd3u>lZ{1z)_1ENL
zOx}9x@V~S9xR&qzDzoaXZn?h>uRi!g=<=@g3+hre#~&6g`|now`_|9p%ik|bH<A6!
zQhcj8{oVb`m$%lp{kZ!)|9?;Q^S|l$K7KjT{3mJa%jwJg4liC7{?Ety-JZQ?-zWXL
zQk+(oUSG3%_vJ53{De#VH%9%w?7S{7slryFw%}E|o$afKM;$AZ_E=Uq{JJuC-9xom
zg7fS?K4vxMK3N=9lU`R)dvl+JoO=A%MTXf~<>KYyC#J{P6rS_9mERM&<JcG9y<2U)
zZGTLi9NAZ~$jZl7{(GDDy7%Ygm-yQJJ=?ihko|G_kEaKpRqXz!^RMf9<oW%}f9*cM
z|MvcUyY212zRb6)-t+7CVz$ca|5*>u95P*HzU<wbq_5!{-m8}_|4}HrTUpO?U7+oY
z3u^vvN_whU?_RxAQE+fyeb%$>Z2J!tguBn*_x~|#b4z${Mws}s;OyL_=^3#VRyB*`
zc4+IKJu>g~`t?75yqvoFa{K#zCo_fKpVOW-*W9N5{{EleF0DHM`_$sab8Ei_&%bpp
z^DOtdx?dN{?rr>aWaY~}k6%vq_kAvV*?-Tan5$oA&N^qkY`%r*-10N!TmS$2yu5w$
zbQ_Jl`r_4cD=)8R|N40T)+cWlbAO+D`26jkdVOZ5-xs`=S+4ItA+PA9ef6_BPtM--
zE}l7Y&wInt;QhO=UpX6d|A)N3gi22EaodtldoHecI7vM(PR3UDP1NzVzJK17*caM#
zUKSVs;<-25czLnD?IPjTAK7H3eu{3}_PFAi?Cw0fzHOC-Rj$v4=h>O6m+sk--Ff)=
zh0f+IgIUk4!?>@1^jds>RoPR2-RH6Y_n!V6y?$Tu@#1@D>>ppBzPx&6tMKK6&k7Ap
z3#*=}9PfTVwOUtZU+KjY&6XvO%O77`dd|Q5b&dGzrT2;tmFmTv_2$)oH}B!C`+I-B
zX#N}*`?}&)m~p|u7td{W#+B5}yk2;IzG3Y5MS+v;;|vs&GA7TMvFvkSbbdhbqbo-)
z_s3@j1-H-NdHGZ`_pg*~KVKR1%ddO>xqb0|&R5?17wH|oR(|G6%<<287gw);H*J>x
zE9<jadBy9`6ilyl{~Ub(>~(vKzrWu7iM_sjXWv)8>+Sr@wsnPn&wqRB^4F>Ma{Cro
zo2ma>`)6lzpXK*A$Mf5(XZox6?@RvrLDt=P=eqk{@josxf9omuv2U?q*4vj-^?UXo
z{rlCt{#=0h{`b;;_YD2~&oACCbBR53mhk2Jii0h09!fcsK6{X}V%y{N|0|=fp5-sg
zu{-xhJLj$5xw)SL`FE+G<Ei;{CG6I>5*h#Blk2~(`Q@j#_wY>1<juk7-DN*rHr@Z|
zO0(bbhj&y9vur+fYS$O9t~k0hzwh~;^zYUk4^Q>){&e}km)90Q)Bk*o`+4=P$<NUG
z&&_=N@yRB(^UFSc{IF6r{;2t<+u`4N-Pi9s9A0vF_hU=-tu<dn4!;n#wzjLY%}D%R
zcz%Mq#<Q8lLFVy1k7sVQd-(gzzO0fBr4K)4zWdn3xsoG#NB82|vZ&3klJ6avYPNaS
zb!qd9cf)M_{P!+%e^*y?u;9nL$x^a$^PinP;u}+0&|9N@uIEaWdRe{I3cKn@%@?=H
zi!U*rzRvV*{L3?OU%hny$$WJyyneK1LRr!m%O8^QKg;KRsF|=W&?epP^YV0)%lG$K
z+$j8>SO0Fp<=U&a>%;Hvzgix1-8ygYj@Pp3W%8ygu2m-OTkzX`wOEdSR!Kz%|2n_V
zHrlZkr5@KSAI-bDG3xuJ<f6^b*X)0EI_LAx$=3biJ&TwgKbf3;LHtQ{;_Hf+lU5&I
zS1QXNz5cyR)E*hL_40g=9v^h9Z3=e3{Aa42sho#>@gMCQpVQ|*c@^LvRZ}Fhg!hu_
zGG0HsuUBVU8PCd(|NQI&%h9#Jd***z{jdCa{jvGGzuDT>7krwRo%A~BGP8bo^D6_Z
ztqS{g9<ki=J?H=3U46@)d6(V$9Bu#e+~e;vYpPzzhqPy<J$xE|f_ri8Rr}H^pMO(-
zuD$tF-Tw2Jia+)IYSTLzzA=dNUYD|2XFK__`JQHPy|#xLhb@1ZEi*H<u=>}TX42n$
zx7#mX>U&$so=@Mle!KeHzy8;wGZBSpJN4h5sgxG}tbWdLa=h%lQ2Twe#SgDI@}d3n
z@%eABuKDrl<ig9$>(khH=FfQ7|EgU7d)vGDRmBhIK09h4Wyq5rcU|~-%-KiH7hm6=
zV^^hGUhttSK68<|@rw&)ez{qnU$ic7{PCbG*njPN=le4IXKuds$E&+}=E28uy%)ds
zTq&3kcW=h5e-r*4u0Pn4;v=*1;KSb!W@n#Wvp(zW%gcAJ*8G}x`1ZbapKI8De(fti
z`ciUkRluEp?-t7SEvt>a|8v>0($3;9`_kwC&)Z*l_T`Njd-n>vTcX?EiPnGb`F?8u
ztnHs?ubsDV_2PNA&d-@&_ijP?d9LZkJFk9rzx?O!&VSYy&s#qKJkxUPEA5=OYhGWs
z;ahc5(Qbz1&n3(F%0FNIni>0jrp@2<!gJa6X-_T}zpSpSPTO<&?T;Vf#svk>!^`_u
zR{s${qjTg!jFjqpiMfig-21KXPG4qO8y54Ww*SeO@EiM%te>}!`TQLDy5)}x&2ODM
zYTc6_`Z}(&{+eO-_4hYFfBx=Q@N(zp?QQ2|cYUk=@%!D*!|!eX=YRZDe7%_cm3H0H
zi}8syH{aS+)V{4xs?qNAkDv8q^Y<qi>HK@k_Wa_jUMG1`t*z>C^uyh3*K4m_O_TpB
z`|7G)dGq<KmFIsxEUNn&Z=m@6LP0GL-?PVC_`h?N^}pENf2)Q;>Z^jD?JR#g|L?)k
zg;~Ox#>aJLUA4W^^iHd-M!^2}`ac(U1wTrE?o}OndAsT7y4AOyJo)(Pag#+xo`Fnm
zlKdU(y1id{z8##c%Kzxz%=wY~Tkqes>Av&#<FnJj|8@P&UzeYL=g!r?hg@%OeYQ)i
zPA;nWi=q4~|NnaV_x%>9-=8SPe%D)e-MjT-HBaSCUOt^MTW0^R!|BiL|8XA^=#5=a
zXcl((^Q)(a1ndLnf2ex+V9iC-`8OUe=6*JL@~jzlJ09)Y*L61VGV}czQJ-qU3co*C
z?7g=7e1yMklf@0wf6vN3p1ObQ%G`bVJ3`m)>|0!}U$gk$j+_6D|AnsqQGDgy&A-;h
zv&Fy1Ry6-O_N}C5e!+jf`Iqf}o^mcXuKj)MXYljoyzBm)Exohv{E?Rr<I>9ZJvvkR
zT%o^C+qdeYO4+T$)1!``tUk6%F0Z`eYIR!HtF!LXa@Tj-IetyB^E>|VOA!C3M``;m
zx4f@g{p04J_`l*lJh@(%Yr>|_u+iUNB~YGS^3k-kYLC%;HQQU|ruMfii=VB2UG{(7
z`MQf2m#Ou+-?7;r^}5RMxOV;TOWL!pMt+?9diR<t6Z5^hZ>>xJb645w)`z4O`~QU2
z*VxE@Ud?*ccE7Fc=l0V-*Zz4|GXK-#$gt0uLB-4D?@QfDFZ?!RvsHO~%<~-&-psUK
zx!mn?-K>>|*`Gh0|3@$WE_eF6-Dl-qUA#PFy_m@5rTlr{Om_cV`F79q&T7B&w?5ix
z&$8QJb+E*6<3hcq2cInNJ?0+U|C0azDZ~D-b^G_N>~1c3DE!#!*+cJn#-HDnhTo~~
zT5oXgTlYs>Z<!_D?~m;03+6t5edoW26-RpC^3FHj`D1QhVf?}H-!9jq3`?#*d9=^J
z;?{>G8~>t@#&fHxt^Dp9F8_R_!g&89|M}n4=d0I-rypOx<?P-^#p?UMbtG<CJAJvI
zFi*em^8a7X&3x;*wpuN}{?qw+Q{}I3KJ+#AN`~?F<WjlsS#sZbDi;YKK4TIt6Y_lF
zLH5rF-@hyP*_2sqK6{V%mk${)5=vw*e`f!^#cYpE+hye${#iTvepX)1Nc`?I=Wy})
zx|;3J*?%j~va{?7>QAs+`OvCwTkW1Le|}^v-&cL+-meerbKhP5c<%BZx%h+gME{>T
z{B=!V_^<LmFVFJVpZ~e~`OMFgzrU<D+uv1PF6*EBJ?E}o-+tRi2{tvxeshn>Ry@5t
zd5@{=`Ka##^<tMVM;^7c-}U6|(ZlNRs*eA87Q1ks$z69D6XRWy?TZ8R^LNa#e0}cU
zk9{=<eKyOaJ;-{oXGY=2k8G8}`Tnnu9{i>@zi!sEmuKF|U7X1sy*}Qc{rkMyIsMs7
z%H=JO99Q=9T@(K4L(SRMTiM0u*8Qn^uw3oum-f>SMc=2H+1qY+)34il{mk60>0R~H
z>c3qUpKrZ3$*O#w<-hbFyQlxilH)z|_vP=%f{SN&lwS7d{`vG^#gDSRj}|}VoqkxK
z@73%Z7ps3=UBAKB_}#vDGvZ`-`(HS|=f#(XFDAcOgR7suFtxS4KPTg8)pq+icWON9
zTc_*Kn7fgES4{G8IfcDHtlph2t2M8FZfaa=TlguoUaEHTdW)|Q())kbyt`O){>bAe
zHNRSxb55@+&MNrzI52y^gq!j{*8BUu1kL`s^7hr2_m1v!KfeB3uK)3m=WD*cS^M%w
z`kDHz$9G$uzgl~!a^AY`tB)4)F7FF|f3Gt<D(3O2`Bm9xc$Swx?)~%R`n!L&-agjv
zRhAdGe#qMJUV2^ezVi#Lj~YL3f4y_dj=O(C=YNTs8^1TfB(}5Agzcna?1r63{tB!-
zE&P1TzjJ?n%|2GcRa0a-$8v(YM6ds+m%P&#i|^TN|Kr+<wG-~kNYxaX#@ye%Gh^~^
zmG{oldWGLP)$?P2%sF|oIqBc-$Jga*zCR9qy(jr=XZWnuv+UMqWQ3oXpZ@>U!}!Ye
zSzm%LS04W&ynNZ`zVdw;FaG>I{dnW_XNT06`@d`Xe$dhO*7cZ@q7%PGW4_KfFU&i)
z+V@<}t|y%@C$In2R$sO&eaqbUNxSCd``Os-(0(KN>(cpK>*EYQFO&?on0@s2zfd{;
zdGpnck7PZx@_Xkq&%D$$=F^e0j~Dr$Rj;`obp9fD+4|j&+TC<(j+bc1-Cy_cS?wY7
z>37=er+)sh+y9e{&D>p5OD11_DZF1ftoha4?#e|kEi8Q>RfcUn|08|>>Y8tNGneO;
zy59?ZJ9EG7qi-d1EQ6KfuijameewC_+OG$ew{?e~b9NX0vhe-PKM&`ee7W?W=#|5^
zmz~!<oA)E5;NXX!555F=&vPz5U-xI{iSikCwN~Qi?_K;}V_17Z{nn4-EBPm%tu~c)
z|M!q}^0N7vHqSrqUSYGVpi15UjnNP7S{utP;E|}b_utO#UNLk2uc>YSZt`qjJo){H
ztG{R47nauBKL7mSx1RR@Re9^4U+T91YT3Vh>%*d1!mn$?|NIDRe>?vp|MmVAwKqhU
ze~YZSmK~bE?(x-}Qi)y*jk?tTWoJHz?yvr|{QaE!mB%m7mizNJ$2jl4)-m5NYtEXh
z@7tBU=bh#62S3CA1{GhKTz*ID*0n8RG9t70e|nd7`Tpl!=X=iP*q?0|_hEZ4*OS=(
z)|f-QgmaGFk0&eFZh8CCV%|6P^0Gf~{IAy@e(HRCYoBrV{X3Dz-xvIPSyuD?{?U)m
z7Rz1XpKf_}cK74<SaJ5RzB2mz|A^Mxe0e1O@$YI&!<uXH@qd3jx!hkb`upeOnSa&I
zUl;#d^ZrlCTmJTZ`Mhh3U;bYGcvAWQcQY;8zs>vm!}{oTiQe5EKWFo|Ul-rT_g!*M
z-S^ANrJIkweQ6;VRTuO9s`^&R&wDRT-(Prc=HIJ#i$mYny>r&TzwlpG$^U|W@t!te
z(_`xID?;m!ePl0QxKBjS!#v$gK7al?Q~h_lZq)2uP_?J?r4?WM^5)C(cFQX_znj``
z8k1a|{>N*5#g7HQ&C{0cijbA(X^(#ylwEf$HoW=SiDt{Q@ju_c`dwaa_0Rp=_u{VR
zpHFr!ypi|R#yW29zKPHG{guD}@x#HFzZdRvUukXgsq<C9-p_qskFnlmpDw2@=e}M%
z=l|yF3r<xxYK|9&Wxcz+Yqi~%s*7f2>-#DT9Ao}~CO7o9t@!z3*R&eB(u|5CnH>Gt
z9oNj(i_NLIF0{YM$X))#bH20d-}%bVwaU+W>+d(YV&3XoSJd+NT3Xz&@mv4o)rRcY
z_m!Ldv)=m8T~@hwdEB|rk@a6@Uas35H`Bhh==&w@71wGDg~RLiF8hD?xBvd#XDpxj
z&)N0k^URu>s`9<1YY)D@UL0Px_vH_88@_jc@y9o}cV*N>9q0a<?=#2w^1tfT|7S0E
z&8`15cX>a5+`YYrR~}y1y}0<u+UxGU-#+f|Uc=p^9h^1!c;+eo!=JY-vou`tc<OA{
z!{s)mpJczuE`IqlHam{z=b4QAtB#4E*}3cgsxsr+|6a9Olb#<qlBQNRuQ0sMIP*(W
z8q49QF`1cBptjB|Q{#k^&X-}uUtU%F*JpoO@?I+bys-QCt3Rv$=<K(S{~CMt&`0*m
zi+>(D+nH#yHs8*4xoP;ETU>Wtef^D_`Erx9f}Q!lPFnxxnO{%(udkf1wmwSpy(cmM
z--hba+D|VxTivy{oqO`LyK{T@^YH(yix~|~9QY2G`<QQRzhv&7U-#)nS(HuuhTm&n
zt(|LF`@LgX<;O3l9+&>ls13Rv&VS<etRt^Blp5E$Cf9whJLbFAvf!Tb&gajU=I*O~
zwWs7^?Uh^V`#!lZzIXoCo~j)gRduh+{$<Qr|6{+^{WEjzzh1dwD}JBvw`KXicb31m
z*l(RGX1+K6>{nxJOTJYz8`~c)KFKaF;y*8Lf4ar<?fcRn6c+sYIAJ|_nM+-J%>+L?
z!>?yfxa-~ljYJ&@Xa>*Xo{9YU#^Q5v<}3w%J<Hyx$32t3Uo?)<=diCXm-D~xEO&1C
z*Qzqzd2`ja%IvEy`yW>r8-G;Wzj$YR^ZfGHHc?h~F+Xae?pw<D*;m%rO{@R*^Ua^B
z^5P}G-gQP_Hny%in!o<n+dm~MpF8)zmk~cx$RBrSbEJ9k&&i)xyxp<x{iF1~zh-7M
z|6JktJ!9^3v-##fzpUL-GvD!ZxbdN#%|AC}CzUttS^53t%(LY_%)!FuWjT4@e}1r6
zy50G)N6zSm@8Z{U>RPKVsULrN`G)PI!0dgNwTUIN+qYG#_?<P(KI&>*-8Osg?bF7l
zmzV4N?B%b&Ubwbe)vteF^6{**OPAlN*(oLe#!4@$&Thw};L|%lt^O<bZ{Ee?&ud~|
zr~hC3e*V8_=56J7On<(bR~vup*`wEU)N1^$zdN&j|KgW7YbO8R`uW_4?Q-I*b{6k1
z%f#B0{4!bPI{k9x_ub+1>tEYGKdoMNe4hLCUDgK+*80|!-qDn*P5k|3j%jhCO}{wL
zB+qq)pVpn-@%r-SRa@O;-t0Sh*O|Yv#Q0gR{M|LBa(~~=n7AwMY^jg%oSLFKE2*0M
znW4egwQGN^c>F@4Zc*gJyRFYwiTPfiyqj5Wm1_RF<XI1%Ox}H4uTQ`I-MqW|Z(p8u
zviz;+f3N@1=ighazuSEK|GCer>c7r;c22G$W1G#3dEqkhPbMDMZu_Nre&)Pq!l!>m
z$*+68vh>{MM_0aFD4)9C!nXRE)-vPsGBzRmo#MW8u1m9f99%B<U)ktv@xq!Xj)s?y
zT>I>PnEm$lM?v}ZpI&5C_eBYu*M833R{UX4#f_*tSIYXYJb9<U-*wmf{K?OkR<a*n
z%hw<E{B3xB+iuH`rM~ZPu7AG#+O8{4CdBXiRPK9c?{0nj*nm5`>Q(;NOtV?Oxw_7J
zVe>cj{JU?wjW?FAEbX7V?W^s4{Ts7F`K9Xa&6|I#YyPZxSAWUw-{oKYu5GsMUF{c_
zr3~+`^3PsW{dI=BzQ4U~qRHwV?~ks(|CsgiB9Y0~S!W~{&8y&hTl4MJyhqw^W>(F7
zANS|orLR-l?JVB!dVFj0j`{KT_Fl2C{{N+_tiJTtyx9@=$~(;1%g^uo_cv?)%E^cK
zt=^F@Dw|tjI8S}&kC}dZZDm)p7w?)TalK~8{iM3I8JT)-e#$O?7xQ!ROY6@j-`<4(
z$VfZ?PO<Icwzzp#z6LgaHt8=ff6e%DwBXa9mDU&6oa^f^`!=(9(Zl?;7AyQ#xA8x_
zyvJhR-G|}*%WI4NE;eQt_dUM$qPSh0feV*o@0DLlJ9vcdH|57${QUB8IUoOR@!aPo
zRV>zhWv|rT=f~~7F-JD;XH{Lv+}FqDmo#2n?SB7zcyRm0&a=%`EX6O@J(~TYJKok@
zH%%_DynX6F+4^T64qyGVPPJ@*`oAlgm(7<~+kSShe>(r~q~}|fKfY4+PmAB&_F<gu
z+q*|!Ui~h>UOw-`%FDaXKUuVR?#7)Di(h;&|75+tYkA+Y!1o2aEw<M26&lEWpJh0I
zU&)VzzF$50M~_bb8EpUC<@&7`>2+6?x6V1vz3i;4yUKg-2f?2|yxNgbusY)Ym9X~d
zetd^lAN=C!BRoZYUd@-a5BZ;6IR7JT&3eoIU$d$Xe#k1gr&=4t{eH3e|1TFVvlfT_
ztA2XC=Sg_ouW*CUzs~H*p82xlWxC&W4`IJOpZ)8qetez&*|Fxg^*k%fKdbKVmD(+S
zZ%%CA{zLCB7TVYvZ>&1L<Av~P*wB9RzFTjm?z+6Spz6Wl(m6Km@8<pewcEDyrS-9w
z>ill*(n|zqYvku=RqPV|w8SjAt~`)m|6Nq^%j5QspPYNldU#G#MUwdy1*tvVYj?bO
znYQLS-(BZe@XCTWevbR*`FDHYYmeWXExUdF<BYU-at}WnF8=xK$JOUCHvRK1K0LCP
zclq{RdrBvFe@mA)zO?;u=)PHZ=k<lxoxip#w5R#mzE{it->j>Ze%`ZgukiE8uix(6
z_1C@QWo>Dj@Fywij*Hdj;Q6zz99sLqt?u`w_H|oL)+c?R@!g+)PQ|y<|La~`PAo62
z-`ctR=Ur!?*M7aV_Eq1#*FN5N_%Z9{Ct7AUTW{*@^nbOQdrSUPf7|qH@7^5GpJmB@
z|J5_0YQ8^b!tbRQf9cx(_}x{*vzzzbJ#YK)&GdP@_icF<eB1KvoVz>iw#+SGWB1Xk
zICOUHoBU7bi;Vxp{S80={HERFO#kCmHzrH@+`WJN*$*{!{;u2okNM4}&#>E?{=F-$
z^vjd{-l$^Zyx!kFdh?z=`Eu9TO8(EQysTgAOtQ8(T5X;8)b8xo>Fs)3pGEENimyAk
zWMy~Om6$BMhr8X*^DjO*@%)dlJwG0)8`|%jb?@EfJr-3~9{XRpPLA?>E_;9V@AvcU
zf3JA?-0tk-ipAirz;x$bSBlOwmaJ4g7uY;Gzc*?}U-aY(xxKUJ*KL(u|BvT?+@JY7
zm;c?m{PCNXV|7;I+uhf&%|6b0_<8eb8OtTFty>;v-u<HfeED(K;z#FS{_0(!KWmZP
zuXUv|Yv=uVvLoR~O~J<#x0}6f(_g8V3tycc=W1J3;=88aKz@(qk0)6+Cyze6cq07A
zCvLT8q0TWEj=Nsv3A=u}HTt^Y{na=AroVquReoph^7-?Yy^g(ov}S$M_nF`Q`M+NM
z8~oX`HY-gocZc1dhs*3@uHT+taV`GieV_Zk*CoZ=zpS&ho~`EFpS{9`)m84V3``3H
z{+yaWU()8!!{znQY~CG{&asdEZ5{UhxrfZzCwWIE>;J7{^Uiv8(9+rV&zJIh8|yx=
zyXbSyR&8C?7oMu`(O*NkkL{jyzxYc{+x)77OJ*Jn-*~#p!@~BYZNQ^B@9NXze$U(Y
z&iZ+D$meAy>U>tR?XN9QrrX}pPXBeMuxfGeY{T4F@2<}Hb#=~_H2=E2@gMzl`~TJU
zr~m!hRCV%k{qsM2e}<pGA9MWMrI_O@zyAw9ecUf2@r&$d_Tr$^>UFi!nR$=i|FYEH
z`c3_Mv1t40ox85bZv1B!zx8*A^wBTc_4n-yZAy%<J&%mv)%ol3?tTe3<H!4^%RNks
z-}<fnarpcn6$b_UQX)R?$PluZo>x_}WkP-H!=go{R(0){kMC7mmF|{w{(50?NpELy
z+Is8Xk9WVezfqmyw&_~u?|T<7tZpwp^sxEjC->&;yItnVPnVm!%bm%LlfQFh_v6Lw
zYFq8Q>hEoSKO^e7?Eh)s-&-1+iLYWm%v$*F{vHdBytx)Pmj8ZrUjEJEeUEqDD|~%4
z_Wcc?n8g;hM-JBfIw!k&>v37N<<Fl)>)*??FRuT7h5OOhS;n)UFAO~F{Pj3@8egKy
zoS$9S=a|jlx05sdckIQL#8+q4-$#8)PdAP4Uts04|AXDx?`xiY<@|Knt$n`fEbTXz
z!RdKFRvHV>mto&6FWa~8=Qq>*eOCH$=Z}4JpTFntmbKjOmu>QrzTEwu{_Aq~y!%;o
z=M9tX>h04_v}3<#*8ezHUT3?zf5+d4Uk;qUy1>eW`O)J4uP$oW6@KTP9;2%<Z`WPf
zsB+Wgf7491cSWnet9)ozTyOisDA?Zg`+?KpE6#th`&T~k=#mu=&s|~82#>k`#YlbY
z$(IM0%az<}KYnpdfd1afC$9>=WyJ9;_MPK@Zq@U(ANC%*UiI<H$?}Y_>xBlU#xH}i
z{dgAN{+XGurE~7LwOKV2-1zHCYf5VKZS=m*saLDF&wl@SU*~W0dwG*?NB*uXD60E&
z&c6E6a{m5#!QK3y4i;RNKX=hv?uetQWzO3gzj-HjbNBf1e0?i7bEg0NnX7lo-}(4w
z=4^kyKJ^>lz1F?=+WqL!$;|lkx6ju95$D;=cILyizufVEe#LF=XzSzubTaWr-%GV+
z>z(h<i7LMMbBDO>741rsl8P1UWnLZDkH30#U(>VWtILb4%*11}k8Tlue6~IB*K#|{
z+(+LYC*IHgHR<`DN7wo9&Hesf+g?`w2>bd!@6NN^zh3^lef7_kD`%hQzq;K1=a=o%
z>L1NHeEE;4`R|jr`<ui6URhT5X=S>b-O8`-xlb>OpR4}lGY{5I-&g-B<Asg5-Hq}^
z-1Vg|60)EFxgw`OW1j<8o3ZKiA6FOq>#6XS&5N_Bo&3FhS>drg=M8F~XP*01Rd?Tf
z&m8{c`PEmWq-A?6t6n)OKc8MNdUyHXySHoa=<nJmU0+?WdAXeRe!0u%*?%TJTa)!{
z^}(0bNAF90Jo3f=y^Ke)nQs7Z*;~>7HGSuQoxQsJ{guxzgWgM4{Ci^gOXZ#2+2zv~
z-?!aezrG~af6pb8>*a^ot>4*Y)qKA9%2Ddyxx#~UZazP^ZvWlfu#X0%g~`Wlr^oGm
zFP*n^ZuyLzalKUsUsnF<KM}LQ@KL28ZyE2^g>`zOa_Y;LR$iNJKcoNi8F%wQ`#sev
z;n9V!-Y$M$z4Gwfw9^0YE`Rh|{a<@W^}LGkt)k*@_XyY9KmKxQ&7Zg4w#)yX44?IE
zk^j4zYx!=A<91jo+wgs=Df{>S>35ya^PZW1Grm#!d-uJ<?6aKPmi=5^@o%PDeBsN+
z_PgdW&&t<YZap@2|MM@OOYZFJ`})rM!LI!4KYy>=v0&#flT{bX*Ui6WyyX3E)9ZWX
z^=GJc8hgl`QCE-p*t_FL)Ysf~kGEVb|Frqqt|J#8$FQ@16t12YXR>-$-NALAOZrz^
z{CfBG)!)i9)#AS;f9-p>e1Fty>%Mcw52Sy-3<@@1oPE}H`=|9^g2m5j*Of1yzc)R;
z{P^e7KfliY^TmC-ap}Xjo%JP_Z}%I^|Gj%!_Qj*K2M-tgGP_=wE%f}%uer5vt>cXE
zdY?ZRK4<5ji+hCp=i1eZ&)Mm?JpDn%(}R`&PtLsfH?H?`xBRR7l{@B$wwoKzIR9kw
z<vU&Xi$6ZDce(bAXNr5pRfSuX2WLuOtNCuOykdS;z?$<%Dl&d7K6vnD^wZko?<Vee
zerA^Bv(x3fKJ@L|b5O>%X~#2R^Z7RENAGIe@B8}i;GM-Ub7Qa1dM|g;M>e;j&}Q|F
zcwLQqKWESXH}CQ;(et}6Z(W}JE4^-4MRC~qrR}%;wm)9}f9l_}aW5Z!u`RR7-C%mQ
zUhUf9Hwt>SA36^|cfMTt%5rV|(LWdc>c7~mJ$&@C`mD;bTQAN$p7{OFxAl+qiSMsl
z>;HDD^Kt1TTjOoF_C^1$IJhOlEQH(WaE7UQ&9fiJzP0<`v-`TPb#d_g&ri4fIViKQ
z`rDuCS5JTKE-v~wXYsXpM=akKepgr<r=9m}^7E4O)}J5Wj`^{8Q(u`?&G}am+h1fH
z?)+$T^62@JSC=<`y1eS+nV%OgvILih&C{;0(YBAPuRUuxpYOg^ZS&;#pD%Y!{}=vm
z<@Cc9`-|c}el1Qpwntr0LU*sljp858t0U}dpA>vM#2#-MURQq2{oT5U;pJiF=~A@`
zKhDp4C%OKfZE*ap7gm1rK35!6dFggC`GUu~lWVrFd;DXaU$%AM^7JKX+v*-xq{-;o
zUfKM2wS@V`-z#R$w<*jPT76#1*3M$<UF}~_cD!2~Zs0z@`rF6Z^{>|1$XnN(xploT
z#CG-PXSXNs$d)b7{q%BfRrVR~<@feU|9rdp^`9Ltj%L+tcpdyX`sZ)UGv{lq{O;`v
zm0M>k`~J(r`EzeB|605J+S^AJx0U&h9X5Y_CG(PU>Afd>^`H7C`~N+&xbo>1f0;Su
zX7)3zdL{RKQaIl;dHt7%bLWcN|2;XoyD#j{*E5xS5=4|lc6$`@?oyQPm#Y1<L-IB6
zSFd}8&+l^QhgBC`+@ikG#=`buyzITHZtHKF-&(iTyvFWwb9b2Ti_0~~S3dXo-}~p=
z(s?$8C4R?uBvj9;SDhDU`DW&$D@W2!{8X^B`uP5>x%j_(pP%<V(+jioU;NuV{ruUz
zLgnk<875m<2lMN<&72(}*V7la{zXA&@s*1AZ}|6_%KHC3^EFaYw?}QG&5Y`utF7JI
zz2_+B>;F^xv2LcJZQY~1WtA6qr(bZN4<7FC7xxhtdj8<aEQ9T8g|C8lKf0y=%v*1s
z#q;I!`0we&B>%cpDs%R{#a(xsjnC85Uj2Nq{@r}3*!$m4$<Lja6u0+|p#8+WPw$^p
zeR~ty)13D1&*bOL?|*%5e>vN~Xolo7-<tA&#`|~e+%0q8!Zx;AecS9W8@Bfui~H|>
zbZhdB$jrjti?c7^OW*h_{i4o!5&L!3I~P|K#VoE$esxYS?0(|!J6oSWYWn=|qHpfA
zlJm#8)5J`a-#J=L_p{siZh83Yqw5#_T)pqv`ga%p248Ov^J|~J{)6b*FJEQ;6<D6E
zUDiKs-S3vk+t>XrvzNM2w`<))H9z0yvi|e`i1NPW`f01q8@JDSm-hcPs?VEEigwKI
zUjBIgo|<;+|9<wB|4yp!Uv<&n_xb7@#j9A4e$zVNv-17UFFO|0-F23|zVF!!yXHSO
zbKgJ82!37NGI{y6dsm7IN+$2_wEMX<J?EES-c=*1s(T9hIqyL`20Jbrq+gYpZYBF>
zR@}v>7w&AnzHhg@d-2PcldG<$`8|)TmES0pe_`Roc*VDS{B0(8Z~J<&WZsRvR(Y~@
z-{#GFa`)o-JB6^b0JJOp&hIw1FDaT8x^7vyiR|Y;JT*(#|6cPf_UF|fle@nznz+88
zD(Z9fkLr0pUioF!ZtuICob_aL+w<w{pAT;5pD$JWsz}ai)&l<8?@#%kzfisZ@XAcj
z`#UR4^-cHesBX!w&zjp^`E2ipgX>D?%(6TCxar~NgD;maJAS2Qe){jGi+l7H-#JPx
zdnWwOYx1r*W50dYZx<e%DSIa8^VM{}>2@ZLhI=goV*l|(-#3ge?)+T%KjX@8JK5LH
zx9j3&J+ZK|Td{AJ;orOE$3Cv_`?vbm`6p-ozuGhPzwzF%f9GxP@BVjJ=RCvW=%X|5
z+sNu!yqEC%EBb$ra{Zn^tLw7fvHYCu-n<_)i8QI6^=rdRMZT`zea}{GU7r2t<G$+p
zy1!>j+8<mw^Yc^1;-^<v8-9G16K`;LO|Nanv5OBMiL=k`JA84a{o!x#AANbV@1pAY
zO#h-ix4dr8>sxOBGu;1sZCQQ!yWO+8yWQ^WweE9Ye`Mvy6Y8Iwix)w*5*EuYzxDa{
z=e$38_xFqcPk*2J-=MCrY+qNQ<3{`W^Vauy|660fw$A45;hpmS70VwNn7n$Q@cmuI
zIZs{r%|{J>9XZ$6AI~3k<6nWbZ0!bH+2v+`--*l<Gp|;yFRT07G?O{Kd0ltx0z<pf
zja5I6SWYN=<oo4q_R+_SJl9<Ra^mHWiaXx1e(l$nR~i>i5PSDy^{-Qx=iI23z8oIA
zMlMc9WPQoQB2YvBr~Uq$+M8z^v(LI*dHhvDc=o<zyB(`d?;FbBxjO6p4E}dnXUlWy
zFW;Ya#p?YG`Rf{SKYup;yukL<;@`>DkEJV{YAX(%wfI-wKQCbaIpNu&CGRt?Hof)i
z<>UW&Fg^X-(~GME=gjLo`_e*Y-^BEL%d5}bI`w(AxKCTm+{p5kp`WkplJoujdsE4)
z3$bbY9(`ThdiL=GJI7r|R$exlKkKrM?vh69xV?p0;l(c&hqlLh-}&>#clV`>+x~mW
z%ks~uoxHmAenEKMyl?9BmY2q6?|Xbr<=)j<?|*#%@ICHV-(LIg1?CcUOJ~=7u~pwG
zxBf@?-!B>a=k>la*jtn_>-b$!dy|vV%l}1Qk&pX2_jB4jxt}KM^A}r%+`d~Idfc?@
ztFQf?Rpqavtba}wH~;<r6|3`(Y^%zh#~fn<di?d;)}H+HZROi{rmz3>c0OP8W0to~
z>AQ)us(#PfJ#&BkM^)cD>Ce_@txGHY|Kd!;%EyO074u#lTJ5Vlug$!p`Qx+2Z0gr5
z_XMlw&nf&g=iB|6zrS}Kx4pd7k9+p-wST@{+H53$zkK1ri(AbM?L2Nv*~s?q37m6t
zE%*HMPbPmZ*;{IIaL&Hlb9dH%HlHrRfA#5xt!o4M)5^|&@7Z8#QTz4a>B=W*pG)r<
z+Qz&Le(j(3y~eP|tdKA7Tj>7IW8wExr_}xVfANzsZ~EkO)e(A6FY{mgwXedYq~e5e
z@gL(k-@Eo%)_tCwKCLpi`#JZeE%~p~<nDKI-*<mspl!RZbnV=l@9!+E_BK6w7QJ3h
zPs%Fp>xbG8XMO9lO8yjC{4FZ|(c^!&=SYn~OrOlXo4>#3zr21s#^SmA^jTI<mLEU-
z;o=8%f8V`7uaqq>y?p+%ZK1)xt2aMt=UNym%$0f6oVH{c-_@x35w?XUKOZzb`nG<@
zk9f;H8*FXuOXp|&ihDb=@c!m(Ydfj($V|IG;yx`d!k0OwSIk@Y^}vUpXYPGk_i^d=
zx<6;X=InYl?`Yb#ysO7^s%9NqSGnv<Zm*?9<?C71V)m~$-+KJy*SdEXrDD>aUjB9N
zF6;AmCx0L2-)*n=VoUgY1^E!~b^TH?KX;|QlfPMCYHoV|;`wRm+ZP|Z)^WRkcHN$t
zCqYY(zUSXdxm&&bX|8Tw`^(bOU3z&wIdS&EKmMJWwWs>!W4k{^5_MTu*KJ65UA}*J
ziNC4G;p>)qGcMP@JM-`M+#go_-+#nkpReM2R()CD>|0N2t2}H@hR4`cT`Ilz_1*j%
zu`g%Oz7_h;?$4)p$!^z|#mVK=e%}4_;)Snwrv5X&vnT)4vol<??$0{%P`Y|w)NkSK
zaq%@59_ITN|GMCxlY9Nva`T+K_KWt<U-^B)bH97-W-;&E`}TjFX@Be6<=IQy-p@%3
zJ?z_KzpwKDxyLgt`}Y5Sv>>X;-F}WusZ71H{gSEmY{tR)`<|uco?Fy={crT;jsJwt
zKJb^lehXBY@)pia?=@LE{q^LSvuhHL+c?_IOR&oVO-p7UEv*%uy?7b>K10);7CUEz
z&ztvXfmQ#^gW7qa+4;wxJ$zJ}rdxA;@^{(Y@AwW%x?fK>U;Z<8j@|BC#&)I0i)}xD
z*%SWfV)ehi*@xNdzx`SLyy*YDnbuEs-2Za={i^H#|GbR<>b`$h_>Y^)G4rq3O4mJm
zsD7ON>QhI%nCIIceb+CQ+dA`mPe$6@_o8oRzP!Cx`1RewU*~LMzCSw5zMfCt_j!^B
zv;2Q$qv>4}EMoekgyZf><j=qMYW2EnHIL3Mp8NS{^Owo5YeZ+;W^ax!*|NI&X#ex6
zum7I<TkZD8(qhGZ(OrkV7UyT}o_ASZHaF|hP3H6Z{9Wb$o-N=1d`sTZ&+kg!zMSz-
zw7%wZ&9Qv(mx^^){nP(x|I1jG_v?AA(eax<zb<M1xJ_O@r|$XuT~E$$xx4-OXV&P+
z^DJMjy!c@?>(P?8drepA|68PY_{Hxn_wPKoa&+;$sN-|n-_Mfxmh*9rXm0W4?6?c=
z>yLA*u`F(zl_kKd_fb3j)zgDDXWrbX`Fr)&WDE5u+ZXA5`A_omL}#x&*8V>7kwR=u
zXQAwJv3cu@{~kUY_i&xx_uDUbJ@*sd_g=Am<;<%at=>dEl3gD@p)br=zqF?0(Omm^
z`_t>+FPg7f)A!sz$3D3H=yrSCq95;X9^dycOzxI;N&nQeZ#iov+-_G@zA`!Z!J;tD
zfBo+*)9trDo4norXZras>c_vXDL8r8wb!iJI_!Dj`e%j0yZy61K3HbI=hl%5d3_1-
zP7micj=9fxymQ4rv)=BWZ}<7-?s>E1N?sZ4>pL6y(0Fd-o+633{sg;sQ=^W5T5x!B
z&9RTOm>0jckV_X|UC&w__Q#mN+;scbizgqRnm=ov>~{Noa|*UR`d0F1o&D!a>-%Ru
zJYu`~aryK0f1Vv$`SN#J?x&B>T`n&#eV8tnS9NG_)vev#msdaUYX11);0xj9e$smB
z&n}-Y53j#+Uds2!`gz~hJ*vDv^Y~%)Jm2FxAD{Vs?^nxfi^|_e9E~d{JwE)@CeENI
z_{z_m6O-NU?)X_Tr?2u##hJsGXRc+RyK}?W&X?&v;&){4?Tg+rng6;};SZVe$GbO|
z$E~&9@#5Cx2)R3z>;9zeZ%Vs(PDXxCIj8%2we}z1mS6j`=Ip*LA4Kb`o*X&MUjFaH
z&o4iF?Dx%odj0s^%h7XYS=98+;eQl;*)Vp;oSFA;zJCAhOvSlye*Ly*r<*TcJoLh9
z8TY4MhW7pw=A~VmRj>MPrt!HyGR9Z`i+z7TQ+D^{>Qi@Tnt3Su{i`@=u!V#Dwuax?
zgD0D{{r2unThey?Wcc2UN8YwSyMp=azRfuQT<+|59~-}O%l#*)ecZGE)~WT=qkbQq
z(5C+9yj|Lo{Nt<d*hX#dD!efF_WY=#8=rqD%(r{^Q=$I*pRV}%$IhS0pa1h=(U;7+
zd-hhP5_;*+_lMX2c=CQh<jaj+zw=g}&J2&aul{T0QPXojPX_1r+C97?o&Q9Af7$o<
zkx92I)h*|0w}dy>-Y=N@`R#_^-FG$RVt!Yz+qLte?Z5j<-j`aRSf0&n^FCb3IBWOs
z>-Yb^|NnRY@u0fczb9&<@6X@o`{Uc+zp7#<x<6HCmDx+^%{}t!;kv%v-#<TmB)t0n
z&-3;FF311-H2vwLvu63v9)`!f{{QLv{y#6z@2{EtkvIR={+ipz=kI^}So&GYzTF?z
z8r+++&pz*y`NQw}-xojqerEH%d*Mm{rkZWNT^#@C=lQ?8<$dBmW?g%d@$gIayDP=d
z{z(7)oBeHGWs0_6|CM`{|K81yTW$QjS}&@!u6iST>E<SrDw9=?Tc23|n)&_a{{O!Y
zeGz#rdv2you7UgA+Id&M{*C+*{pa7`<Mn@zC#%1ExpUI{N9%6-|2`^gzb8Q_WV6D#
z1drsO!sWX}<=>U<vDx>(`a=<?-7C&l_q%tR|N3peM0EPDo6lU^tB<bN&(Yt1?_kXz
zj#8O=yPxf=>R$i+`}4E->t+AH6@8qpqklEy>&)|y{T>!CI$T<_{@&{(s}u4($JfuR
zwy>yFjyG6dt@_>h>x$~iy4#1(&bEK?$G-k-(!ROx8NTipuYa@reM)+oi*<5UROOZ(
z6-Qp3b(M~Lzo2T~=H!3(AOAdi>Tgl|zU1Q0=-D>yb}Q!DTI`sa9_IIIp7BQOC1U%k
zpT7Uq`~O@0f>S5|KYV3e|NnVxp6$N>vkT`J$f}n=o1g#Voo3tSb^Kq}JUiOn?Y5@w
zclBIRn}56NFW3M6|M$%O{b%0(J|A=TZqWIOyR+?2KY7>p`+K{%54UNq-<oT^vrd25
z=kWRy+gE|J=V#P^I=TCr;o5&Y*IVWMzq0h$;_KlXpP!Wr-<t6|ZqHl6?R@5cD^}b)
zugSOSe$)H-SDx0(A`7$PkM4UPUiD}5@BN!L&t3k%=BR;Op@I7D^O^hp+Z@r3t<j$6
zzBj!y_;lv~xj!rK&s%A2w!N$Hpv?JAyPx;HpBdl#ThI3R+&lh$%HiL23~G*_EUx<_
z@A~fNTkAtLWoJFBGj=>VyLG?qqX(~o!vDNEpD(ulxB0SbR<{-yzy2XR%l@@>-M#ti
zpC5aDZ{>TNm1ix3Z`Xd|vU=OU{k`MmnByzY|Fc=2bUy!lU;f$9KhZy*f8KrgN&V`d
z&;IJvJe~J9CrM(zg~qwRM>be~pZ|F=@ACY|UoQLY`}^#`KJItM7JuI@KfdSkDnDr-
z+vUH{{Vreoc=pH1@qaGVlyme8JI`7ty?(w7XfK=8$>xV2Hs}lZtvk2e|MTah*v0v8
zcHOYqyTHmmwxTdVM%F*z&YzygZ!gb#b~JYWNA10j9yY(T547DZyt-V5&!2s{eU0De
zk7mo+@{c}zDfQp0oqOBz$Jb(x#(!M%>+P>M6}I!PzAU@(uWxxA@2c{98~;95+xPgo
zwyn_b>T87-HOl=z4dQAae%WeP_=>N;W|39M`#s5f3mv~7Tzb4KeEIck)6ZSO+^;yV
zTD`Y0KKp$7_IHu<r<%<>Eq-RzN>!hpZS70^F4vS;@5}Ctw|u$O{z-BBv$M-Gd;I2_
zfBmMu+|%ZKXl~Zz?e}D4a^$YB;5*x?Hvier45`Jz&wcm)4c0eb{x|Egzwyr(S1S@f
z%dWORyuM=I*FQdg@BV!IzT%!E@3MRK>rP&+`oE*|&%w%D^P|pt%I}S8pS}0T?CZ_(
zcBZci&K=mEFaG(^i%0KcY<_RklbV0+quHv%>t^oX{r<`F@2B$T$r<~vulZ2)YeD7N
z(m$8Dmq|;CnZ)=^-(z39@q^{tgLk>^?=RSpEqi{Kwd>?rR(3lj9!=WbZ(nmgBkxgu
zeA<cK`&O+j(O$Q=HvDhl$-C<<zlTr1eBeXp=aUPYHy>kPe0t`;g4OrVb~o34X~`;*
z*!NgFHv9JFkH-6}9;g4=vf=%fS2uTEGrModtM}r(EAOMs!_QTYf81_nIL|C5`$LJ%
zC%3}1%V(<}EG{i5x*>H(blsO73C}Dh`};Y!H-Frfy+cOMQeXD0@1G~${nH+vxfp*>
zqp$v)|Jur*y??%$7Tf&!(6m#ie69X!!5%+bjlB9T75fshuOz-+_voFVZ2kT0=lyMZ
zcJp6+y~<yvKda!?hSK=X@V&DyZ{B&v%zn>|vLutWv;SRt%^I9-FSl%(a=ZDb-{NPd
z_VI7~_Wi^6+N1A2Ri82E-sODZ&y_2Rb7da=ysT_mx}yBG@M{14vv%!!xc=On%XRxi
zmwywD`Fi-^-Mv?g&1cn}yHca(Z~xx<`I%o@<?Y`dC0yUt4n5T7pJZLd!HjQbrX&X6
z7JtD1T-a7V_xhuSo_A(FvD{I;?f<*oAJ5#I``Whlop{dPd9P}$duM+-xxee(<$v$q
z+PxFMyC?ej%J)^TE>>;65>{tg@zh`UxmU8=<DT+=FN%KMD}Tm5{ZFWUe!%%7>wn$8
z{PCRs=0gP^*FIbRZ1S(E`+r~fv})`9SatFBpS$*NO*%h0rhcpJ^{=si)=W=-B{|QL
z_tFc=H`V2_Z)cX3=iBVR!}If1-p4OBQY+Mbt19{8{wntGDZEzq_5Z9*&vK)V-aV1}
zGU%}5Rt3Eq?fuINkF9+x*BM?OUATJQpW5x;KCO9Xew_dD>&v&E#rOX9n|ZPFc$T)_
z=3jLt2Sx8!-CAj!|LJdxw(l$3>GJRX#Qxv=r}p~(qkqo4N#80hbHqR9=j_@4p7cFG
zdNTO<NAp##>C-H3eC>;tzH6O+&-7>4X`Y%5?-z^p9h>{&iqzF*+kUTnyW#oEy^p?J
zNk8{4eb&E<sQXcWGj8pEET=Ca9%mYPb(vq@3U9M-so{p}PqV#DTU)$2JfrS=7IbM2
zw=D0z_ghx2d_C1}{haiw&6iHceu=$0>-7wKi=R*KM%z@{#(mv>udZsJWl7c+TY2}x
z&WrVy8#~MXcmK4zd-qP`ee*Lzv+su5WS=bl!vAcB;{J*Ee;%oj$b0&-3TalLna^&g
z#5Og<`Beh?`vmXrkCI<y`tH)Nl`~CCYt!$2pEWC^aP8st*S{Y&S4gbu-*<k;@&6q<
zY|N%tS;{uYu4%8@^Jiseu=wN3r>_nc@Yz*<ex;q4wc9=GQ^n_r>_^Y~`<v`3smc2I
z<bm*Km9j%$GiyJu{&DJc+{d%?K2^^D5G!2X|L(N^^?%<=&YaioS94!q{q1%Bub0oc
zmu<7I=l^&0uI>GI|7=Q5h8xzu>a^~kxBTboxQmv1PL|uey<)Pz`|{@BW&E3)gD?LL
zT70qJ+{#c^zb>mPEW2z^-G<UC^Xs<3{<<+2mYXJ76@Mt&3tr`8|M@t#S`*I~&pd$~
zy^q?*9rzbte{#87ZH1iO$F6MuBzO6rTz8wV@kD)1xPD}EzyJEHvEefO^KTlT*8v@X
z<hNI5*3_6ge-B-56MtMesXJQTZ>_DY`{cv^)#>$rpWiQ?H`U&_=+4^oRlfB_e>3O(
z{F-6%dh_SS|KI$nD0=qC`uFSS{O{{*9$LLi|Nf_@;M3cFHPDFs<Lcx81J*2ldHRfH
zxSuqS_!|r14C`g3%=4afK76wKx^GC8<rVjP7Qbf*KWV;r$$ZuF{3O$w4L|4Ai*C2y
zHE;hZd3_0H<x5AFE?_$-v#a{s>-XPWwcGC={&OWGT0FN%X70+`>3vtrZ`|rzY_46H
zHMjlrL(WSFR{HmGe=3_Vss4QC$8+*`S3h6ne%{yKlE?gStoItZH&J^mW0xP?YJclx
z|2kV)_ur!Xtv{-ltEJbyN;1woZ2j<;kN>CjKQ0%4<61s_*G~cdv;OmpOXuDfwg2~L
z(((K0uhQ?``c`&l){(o5OIPpMx@Sj%&CfMSRkbfa9F+Mgscx?Q@zt9>XOA!U-|+ZF
z#?h6Jt@y6TeP1}${_wkt_l^|Ji0c>UNj_1zvA{Cd=gz#{j~<u5zTKa{KO%nCIbr{}
z`}>NIe<_jA|DkMb-!r59+1b?xuLxZ(nOE^?=5?vh(c*gS>So53$4}1v_8@G>r_Z1b
zO@EK9>^wX1GiY(pbN=(!YaeI#@7QW`cIW0>bNp}r6?z>1^|G)2zne9?wC#Njtj<re
zaewztz~1!7%E|X<_36)Bw!H4y+T8l2D2cZ{m4~)3f4olh8neH3_1bsW?p>)YGu#_D
zclP>ca#a@(edq*j6u85>etq4a-nBQ6KJ$$~|I)&$-1ASxK@FEXZ2Sx4&RkTvb$;GU
z)5SlZ-ErUhd}ZrnLFe+ApNmf}ocU4f`t$$k@6XjOi{1QrL3sK5ZFeWDzbUKk%RPFo
zp}Dssh10vO;J_1wg#~T`P8xD7oelPkjP3%5Y7P|~5Mfc$u;`ko&{2@U;`mM?`S=Z$
z-0jwRv-6HSFMlg{wmP(S|F3oBZ+};=x|g`Sx;}P$Na@;A-t4=fzkdeZY<`>arv1;m
zOB&++mo4v!iq}8C`thCYK3o4Sdo6>FH~+jcdAYL{k3Rcvy&VaCcQ)><=DsiY>&d+p
zHSY||*X}USs(+UEw!Gi%K7Wb+JW+q{cXQ`$eZD)ac>02yJI)0B{<GuDj!vW6_LrU4
z=Ik?mcI0`^)h`QTuFvgW_dK@H*0@ei(pc@($CuwPys5BSzHR=zd-n>S%g@ks$w~fx
z_B-pX$yKjUd{=#Zw0zypE5-Bo)qdLHUHxO*y9Bu>`%TKvd7rC2`>1o9>GbJ*htF58
zJ?VSr^P9|PAAbCqeBFOa^QWpAcdq;@{^ZNQ@B5>B9eZrc9BKr<yS=&p`;STa&D-Z6
zulsfUfvNGb<-bGUZobfzH9xy(_3q<`@9&D-ur>7T^SHMQP0e3_+u>jQXR`PC^TJP>
zABL54&%eCyrvF=sijQvGtL`q}d2UX9g43}#Nt`Pdm-fF`{rJR3S0?_I-Q?-L?QP!k
zrB<DN++4Fd(#CjpU6ze@iF;Ifrp5P6x#=}EaSx+sf39Bk=F1J?eXn0mZ!RwTG4uJ|
zM=z%rJbUZc*XF(6th{Kgy;=UTr8PDANB;fGS^3-U)i;ytUtj$zn&AFl<^`Ya?$>W-
z$o;+Y;nS~#xQd<67JqcVe)`1r<*&b~?zgg8JM&`H^^fapb|n0%d^qXi?4#G`t-C$_
z&%Kv(qV^SUNr-!U@Z*WQzZ*Rj^q*Na%rlrTb?S`kMg6(wPMI%1H)q{h-gf`Ey_ceI
zuX?)f=se^1^CiFR-F;NJ_I&cSI}_iST0d#FG>V-qyYBTjx9W43H^0qUmt8&k^{<UT
z&v=yS%b(So@w;U2^z!dBD;Iy>`+Z~S{fj-%uKbnV+AlZfexSuK)5_xJP0voPe|GW7
znTNji?~fI8o_!%}bn%6w^)k7-XS?6u+H>ZG)x49kokwTK1l+ZDiF!Ues$%!zx%CON
zOil>RaQJ=c`=X5C_|!vhWq;pJKEH>1Uis4Rb9ecv{d~5|?6cIIot65=j~1VurM|1$
z)b0Ll;at<r#<A)1ey%KDR+kjN&)@c^`J<e(Z~sP@zWY3-W>a<LE$OZQZ~cB>`~KaI
z=QnR}p8EQ{&iy;9j<H^S_TBd7jxQ?{jpp8eG<o9WnZ_Rv&Y3rRp8eN*GxyC~oEI{C
z=c)G7+V_s76l4|aoqakxV_#))-D{gPAALK?=YN=u*^gd0_J!?}Q%!o>w%_X}?<_I8
z|8mW(f1O`af@fbYEw1TZS^R8`@b6E1zfOO%a+7lG?<=+MD}KCuSoGu2>gHD!QLk<G
z*{+;?bnOR?dwb7D{#gF(?9P^NhktB;wKp<)=CkyB>344Loc_M@?d?^!*FS6hk-f1v
z_Ivti9VwIjzt=r2?0scvz9+^&KQ2n(IbTgh2mdpNT{RnauHE(bmG1jHN5w<F$JN~5
z`T9liGV3pM_U`)o>T2wwv$5ZHr$4`YS*OF?Tdm?>qvz$uFHAq41)Ue3&(pK~^UG-O
z`j;hjX_qfAth^X?{P4HWti=hhe(ZX0^=ql|_bv9DUrfmJ|7<bu*vrScb?4>h^Yqj|
z%RKv7?bPGT<#Yed`aI)|X>s_xovZDifAN2RW&Y~=SM$!5+rD>izW95mhyUyMsxiMW
z<^MENUjBLYy`FC~Z+f&Je^{PxbN2Bv_x-JNgU|1Lnd$iTOYYl@c$@1_Dz~LQy1o2e
z?ZdF|$In})ZON0<omp*f&}MMx1KY!<vrEk^ZhhH0t@2Cc^7y$k`_<=IetGsw?ngnE
zMS4l!{kav1Kh`bx=U-m_?VU({c16sFomVW+9zA@0kJPN0cJ6+%`?fy2>X<$?Uw7-=
z&G$aXema%+GwS`W_n)q;*;%Ys*Q))#>-MhOr@EWJy?U6HW>R$_{`a>>w@<e>fBxxd
z|9O+i?nkE&zP7G6*;Db@`}FKvf1XvSwdecHJuE%Pcz6FhQM>i;p3Xj9v+rK({5f{U
z&kj27vda+HtM&U;*E;*&IrsO;aXX&!`^>J^lw01eCpwosYE}EmRh4J5b8^qy*M58^
z8n^DbnK-|^+^H9d6<_b@7W1x4i<x!z_nU(HoAXvbdwNk_`#ksCOU^eFs$Wd-=l?j@
z-?zPHbN>3jXHULeICJj(&+&_A{uIc6fB)3_iaT2V#r(EM*q<)GsMssd|MW5Ub^Tdy
z<W3z=c6)U%|GBE3<?_82JIwpd_D=4fCtK<IT0D2Eq4>G#Q$F+TcYJ!Fu)i+p%f9+w
z6+de9Y6{-_T`bo7cR(U3&}rJmS>AJn*T$dxY`$u8rvI<CmnG*tyJI>h{5;?C>4(4C
z-2CQp{rs&sW4R{V&BZ_F$*!yZ9#Q!5)9kB%pS<C_zy3_#`neA?Ca{I?ymqHrTR#8X
zoXat<&MiMbapu=RnO|Dx%YEyfR=)ZdT6Z+H{Qi9P8>ROrPP?P!&p(Uz?95w*7w$%<
z-&Vd}JZtiC)!C2xe!MF@*e>^Z@@wmd&9TR?*Jkb9H(BP%#P@RIXJ!`ry?Oe5p5^-)
zCB?s<RlUFR{LRbW`qFoQ4@6vZYhJdj|6MEhqbJYLe7jKaE4%PrLI0D?$(O&|zHMLo
zHTF>Xytd2lA8x&O^{;XGJ=xjaYV1EBb1$EM-1O3<m&UdiXI(y=QG4t5tylNf&Q{E~
z+xK}#s9jWj-M!FxVs9d^KeN8PdETV`&pzLl4!NywZ#rMzuU7xQ@zclr_Wb&DkC!vO
zJoqe4U;f{%<hb<1FQu=hEq}h$)V+JYUia(2mz`gqSrb0*>b*1bK3_h4d3N;Khvoe@
zAFJQ{-8fUc^XH`nFXBG#Ht@51;e6)Syq)_uf6S5H_afRjYP0<uohRP?!RLRU|8p&`
z_|bV!`@QN<zrLRvn|jCBXx^SD2_-)ZV%MiVc#`^|%;&D{k4vkopF4k^Y5e)&oHq;F
zHwViu@z>|Kt@W$vJ^qZ<e(%Lu)vx|#f37{g_wUDxSBu$gZ$#PMKI7wG(yqpSHvjz{
zVgC6s=R?iE?Rj=J*#ExuquDW4mZe6kqwd-5dp3FV<(R7PHfbMA=2tz<K4<&%?eWjA
znxDB{cD{A-OT+eRdxIid5%Y_zAAhBMzQlg@<GQT6n+es{#Uf?*Qo_ZmGoG2v-}SrV
zXId`b{+tbaPd=XIf4An>98vS1`z{-Pd8B*u+;;t%@2jKciG}1p{kW;>`=sm6Hvi9D
zZoU}i-nPB^PV%RlTc;jBo*e&5rq-tB;D^<h{~dpl`ew%GMZ4W!+5Jdack=U0!_N<&
z|EmbIn-dujcVFV|EaTdnS7Y99<G*gpm-c;?AKU%Pf7h-Q)XjVH{N|@)>GON+BrPS*
zFO9ml=iB;sW;<uv|Bv5dQV_T3=Q`eVtURH|-P_l$Y<`szWNqxuz5ZD($1Lu*=HmRu
z)mcUd_jzCc^!9D!yE`*&``FH2&wu#k<-*@f!_&oNFD>Jr-y_v_`sS%4*Y909cgMOm
ztxPTQuXxZt``3T|UHZN5*7or4<+h)TCYbMyT4q?<C-dga$&X*YpLz2*@8Ok#s;{5x
zYR`w}&b#CC{pO>W+9uYsq;{>Jb5E|k_2b&C&ri<Gww1fJ{p$Sxe9PENb$7JBeQWhE
zPHye*7Y{#V)$I9W5Ow{eMeJj>vT4_LUU}<zw<`Oj`{MIf_g?xhvy9x_WO;V}jN^O1
zuk)EvyW`%~uV376pLTz4s9yJVPP)16jnYlkl~L)trk$5tzSBJWUOMNmb7AvUt?Wwu
zepUXm_P#rFU1o7#&5w1<^RKQqdbrMZZ~p3YYyREIn(wQ3qqIcs`^2m4scCcTex=Lz
z7r&J;Zu)#Kjb-uY8;Yy>Po1&)drJP^%~NLe{~BMOF1h<`oo-{Tr0M@R*2&`jCNWvY
zSAIP>b7XUQO1RwSXLl;@rawD;`N{41yPhvKOaAn1&8LS&DgJk#et$W?)_=zL_{>iQ
zQ#-HKJo}MTl-B;d^=*Fqrn%dXzgcTDe~;u3^XPl!kE(C&`v2wUpNF;VCx6{r@ILjK
z_4P`-pI@@<=G}b!eS`7lZR$U-d|6lcamh9I$B%ifcHBH|wm;ne|C`k2=-<|pqvU;#
z#cuzUc3#JB#^s;F#s7bErEiZq7W?AIk8}10nMyl2g!|-TWDhScy}Nhjr|8{>ZgWq5
zxu@!#(eH&fimwR2HL<RW`;kz*C4n#gy3LN4rjzArl>7G1Tstpg{dvdfGi_uqo#mWA
z{X9o_jFGYZ_jgYh@16O1_4)rd-k<-z;nZ)xa0$KTpVgl|HJ)r&Jpc8Lsg<jDmAhX5
zyl%(7=s%acv*-N2e0yuSd-a)_<)?UJ&KJ8^RmCXpHQaUCblu+Qt+HRf*uMV5e7TAL
zkVW;L?lW@tXGqp;c;0px)GB}WAie*+<mP?HjE%pwOs`jdcfUHky2@VvzSrZ-ochn#
zuYI!HFJt%jie7E~$r8I-zPzdSmVWboRD7Hp{$0lI=K1F}_ix)C{u$G27hcSNcJ|%P
zSBmZbMNN7BeqXlLl7k=Y!iz88x3$-su_pZUmW1bTZvF0iHs{^b!n^rbKf1lHF0qSB
zkM_Q6x$o-V%ul^0H;NBGtbX^CU2TcD@nfDxy7O)Cu{O;#texC_&Utq2=ap|CG@I=1
zKPH}Ub2j(to^RXoi$41Of0KIXyX;Se_-`LCK6vtYZq)PO=O5<mI==sQzSH@o4==6$
zseb*}(waT1_ee(ne5U`@c=hv}Gk>ps>A3#IUU&V;ak3@rPHrzRt^akcu4)4N_40+L
z$Jr~tL|fDrr+t5QZbhcR{JlF8e(Wi@_;o_R`irCTOHQ{IABrtrcHZaayQ{_X<&G^s
zH|I;-%f(M~&UPQ0d@Iwwub=JX$JWnT|NbxwU&>BBBe2VA#${&zGpD~_+x09%uQYD;
z--pZ0WBB6i?tu2R+m_ybU;Hg>+w+_A*ZeKn+gq{s=Z}~3t7<+zco;Wtx#8Dh+1<wZ
z_jF@kzbu~h`d83A@mW*tZtkryvD|UWeR27+*H4NnnlFAnB;PGQ@5)?r`#qA=Kkez=
zeDAjW`&VCL!+wT7TR2D7pt3aJ?){0fYnPWDU)etY=gr&3o1e|PyKmi7xvsPWPp&$C
z-Shs<&o|R~kNv*#`+V)Y%=Nb4w&#`a_{{G!Sufi&J676i=ZEO!d!xT*?dQKX^UZ<f
zebdDI#6Pjf#@XI^^zz`^ohP5U^3U2HI(zq}voozP&-R{OSz~Zq=f=;;k1OwOe|F1y
zyU)K_HR-$j%+^19!<}CCI`;gZGbQ`7t<&V>=WNcX{$2Ux>)e-CyQ)7PdU@FY&MEt2
z*R8J_R9`u`=S|q<&AVTJ*|V}Z<xFl)ZD{*x&$M&4n*G)9t;=(#ue^B2evZ_mTkq$6
zwBX;le^1WhnFdkUUxxpDcFx{Fu{BZprDLi7lerT9=emwxd~3_5wfOmDZneqRpImzU
z<V@y0Kba@3+WU51NwZZEUjN%a<}81@_>|K+GVwd+eDS;fu4nd+Qy(r!ec$q9+ZWw^
z>E~<GcTGF^v#0;;?C&@JJkP4XAN|()qW_&sv)|uJKkREFKY!orP`enLx88U6Sluwa
ze`j-f|GCe$Vs|BHU9P>q@x8ph?v0uAn%nvJ?vF`RyWK7p;_jd8f4#PTb3)N`c?stx
zzxLU|-&r4RwW!k1j4Nw>cJk1(!VS+qw057n{AXVLI@_$xUp7=$7YNMfSvQfdx~%5x
z>5nGI-1%2o+yDJlkv{KQjYaXx-s-5|^H#^boqgxp^YgOHwp&I$FMMbJ``qUeIrjA@
zKd&p88vk?M({0a8*S|Y2s%OiamjC;g+~oN`&lrTSd;aLboa47`{FXi6-v2MaL|$#b
zY5Awk=X>_e-}nB?u9_WtH!oH9=U#R8tk0dSy5BFp*Cp^I@T@Y9Sl{;cB#&Kbe3$vH
zYY!Vgo{haYYxClr6+d27&A7Sp_mblWukFs$k7H|l|M%tMo!PI?e$A<Qt~UK%PUOF9
zPiDQgJ~8X)^87iazvi6DurZU)-=n*J$F-~4_q!g?-|^{Dg3-R_XNS($b#w2xIzRFL
z?2VU-`k(DCbC-$v_}ThpoSwwKtyg|5*k$`8p^qnj@vhpHsUIgte|`AtOV5X@8*^ez
zstn5CpMSR5VcwI%XS15G`{!3Jx3%zSet7lfLjLEX`@XMEtXWxHaQxZ3w||%qCrB25
z&PtT~yXV4{@V#$T=X~$lZ~3#}on(l=e%!j}rFl<Z`@G7w**kx~rSa_7)h*K>&z121
zowo1q>d3jv4`*0b-7v1y`)PIgUT9sFeR%Etx5cIHYxn+(`XXCckQV;Ow9@iM@#OQ`
zQnKIPoV#$i)NZe(WAS0@)iWm>@2{L=S#7bm>PDpXqKk@a|E{*On>p`tWmWO&NNqo{
zZR(%jY@f|<|M%|ldF59B4{W*M{PE!x$G=Z>a`wHh<eYWKbViT$r}fWTJ{R4;XTMeV
z{8HI3*@dsyeX^VVyLEo~YrCpFMK6n=WcIF|ef8(Lbw$SW@5xB{#MSD&>J?k{ee;%k
zU%ig!J`DaGUA+G3{9XTp_U*Tin_*q{_T0lK>;Aq@_Y08w7Gss$`miYD(~b{YyyGJ0
zALp?#aj(}sWx8xzeqH^=J<G1uew%%>d?IhU`>Uzue_m|~zdPer?6ba%IGdY_mwz9!
zw0-`E*_mhEnaP*aXM|gbZ)~~tx$@A*rDn!ommc0d>%H8}i=V%){=38N-vgVy^V=@R
zcYp4)Z8x*5Ezyq&;QJPP=;Nir-j#d9ey&{m&9C3GxV}Qh-{9xfhq<!bKeb0!hTjR>
z_w(vH(d#q8#M)cy*4oIOvy86%=eAYy<z)U#v$A{jq@RQ?&-a@rR}z2c&0*`c57pM$
zXy-k<w0m{+XBGRcUusj{T-x40O=jQDdDp+5Qog^h;3M11vlk~V{GJnMT>0f~?7ssB
zY`1d);uW?|pTm9PQh4P|1=;JBcU(4qoS9g^V_qYF`t>W5Gvm*{=&{;mymQ{!%})C=
zqK%`n>$CLdoq3RXq<!=9uTP3^O}CSq8G1H(S>3s1vyZaBd|ABi<or3yzk65SyVuWM
zx9|Dg{L=p?m!8*VU-xN?LhLfrs)B2O4$e9Ako(!0p4iLcadGb~9=uy?yhHc=v_5lh
z`8hH7_kR5ux#;1KXU`Wseth~OdvQ_wKK6eaaTTv))@+(E&#rU=+vLSxdHy^JtF=h~
z$$a^=MDxQ~qra>A($7zik*|yS{>*uv?VFmKlc)0Ua_g_&uKu%NwX*Z;dvPZ=w?|h`
z%FI1?<@>*sL)(`vW1W2P^y}N(Lr<T6_4xeBH3iYj|E8Tdc<%e%Tk`qeYl`jbex;xP
zo_1pQ>htsE%-_#He^Xs@-nq{+Cf9|YcAx+AN9wKZ=Gu1dW`D)bTigDa*Vz1S_p7H(
zduLCV>pgB06>xUC%{d*7_4`{c-`^{H@WbZ|i%aj;{<wDLz)R`s>z~-4%_?a7;=0Rk
z-}DPjvCo4(e%p8R_~p%)?4R7wOctwq*QYNN|Le+*b(PO~_DWt@^B}l?=3ei+n;$>s
zU4QKKlJM>RvTKc>mAIXqozr(Sx^ibl@afxzpVPM4m!2zrYMlLUeoWQxpyw}YuNBPi
z{{8;#_rJUH4b*ME+`N4L_vy#CCtJDOS=4?xdAnZb!=tlvo;^|De)W6Ly2t0w-CNz?
zZ!RIXeA@Qy&r8DW_C5RlDa~)n@!jv=Jbui(tN8lKFLQUlTXU=LLD%B%b3XI?u<sJP
zb?Do&Z;p@NN9FVR%DKI-diErI-?cDHd6{oLZ_b?F`{cLY#k6UB)oS`C#xpjbnlt6~
z{qJdC?)h9fTwr`ZDywRP>CJ1E1#|oV&)T!|qhEdT%FW01e#HFTmw(?mx4y>m{9gOd
zZ>@4IYU?e2zvV5{?LW;E`8iE(@6JEfKP#f9oA3Yb+nfIE<H2+0`&X@>d)auq(Ysss
zuGT&>cD_4v-Pt+i)A{dz{qpj;PfhyUto)kI{r-M;=dBB`+}-@_%&$MplM{VxC9WS1
z+v@Wt%WiYEm^`oA<*#REXs(Y>Okeyu@teh~t1;g@)n><3NFDin@WWjHxjmOFV+x){
zzuuMp&|2D$-+FQ1GBbDm>o&Z3PY>rmO;_7ok?E*EU)3&7V(shaCw}i){kL}d3(NC+
z@9()<7j@y_*?WIyO>h3V;<kCYd-nV)ZTbIq<j+mK&c3|<+gsmx_e{^()L!s2&3*Q@
zr26n|#<Pz&w_W>VTKaxY>3Lt@_qS@BN~#|lGk-d6{CBgt`VH%|T=oANXD<6<nQLeG
z`g`2Ec{^r_^4ra*J9>8ai8c9~&!5^Ae`l|7|K-zPOXd~y@7#ZL?)#s6H^2V2<eg>k
z?7fzABd=O$q{sc(bLeo!t79LkE31s=zP@QZpXa^wTyy&y&&#vx?S2Q_)xWd(y!yS>
zz7N_{+H2mvoyFJhY<_Ru#~Zhmt;A!`?|w9C`SJD7j+&Mo`}g9lp?b_Ym!0hktW}fi
zu77)c>9Jaw-M^{g@-;7B?mjiIK4H_FTgAQQbu;4ZKHF);g}slfviSKW_;KcwjqPpz
z{)cU^|2;di`0Kk(PI4zM*Ixh9X=C^J%H{PYmM0ds+wwmzcF*>c=i7hk^H&+Wo6k@E
zj(K+Y%>3V9-yPuo?YFw7X4Bi+cYCUDiGQ(t+q!n?xtpiw%bfpwuY87Zra{&H?9=`J
zefN9b75;IQx&LI>bKdV0F7I4-_QX4xsDQU|lP5o&{qxJ}oki6*j33XgO+RmMFzp~;
z>0ASU{#jdj@~gH=o^}1qb$`~)PX=<Em$i%S%ibrNpO?L(a{h<2OTTm7pH(?G(0y|7
zXZB(vZS{S}l7s(vajVbYbzV%K|LnPQD<5a>eLXY2GJFoG&2Bw^&h+2we`SCA_~p&K
z_VYQL7u^=k`Tr*M$xFxe&rhZI{d@;nfRz7b-|~H>F&`}ZWxu6wo5iLspP&8egXPP~
zoU8m#eXaldqdD#2vwa`5`{cK|zukOv@iNxWhmJQN-W~l*=I_SJkJo-aOSi4HHICc6
z>+kxn22M<sOWzml(O#Fn;_2Bbyq7AX7eB7rANk3oJZtW?&q42He^$K7@bi5gX>v2c
z;`@x5*RG@;Ijx^R@2644zGsVVzukE67hN3nzG~|7%SOW2OY5iU?)`ag*}IxwbMD>z
z>bbYR-}`4u-S+R_&+Xe^ec;Ehe`i;R|D2ca_QxpL|9_0S^{;a)?+VV3eP?9)^V;&|
zpEu9jJNKFE`I&#8=)L^&Z25UlzUB9J+rOP+xA*(Id0U@m{!`rg`(Vn|cM0`dKHopM
z<mAiKtF14T{%KqGZu8OElJD0%oqV?Yp7rj&`TC_>R<_rlseJc)w)y+^^5ZWo;w1d9
zzkHm#?)3{x?RQIT{;Z#W=g7{(=@CCO=DxK0^(W@pk?TL#Ri@SHe@;93JLmIell9+z
ze(k;f<ni~tCEt2iY*sHX3NzJP@$7x|rNWnI^ZlmH+xPsK_Hpjp*G>NlojY?!c<=jN
zm)_2Zt1&WmpZ)t|^^KY9CKrbP+!ws#Gk*`aX<5bUeOoRh?Jzxl@5h-ranql-p8R08
zDtdnDFT1&!ad&^MxhuWxUS*9z-27~%_)U8pOMmS2W;-_da_#j`>ep-K^PbHP|L${#
z>$dspwYyF1jc*Ft*8D!S-MrSX_?3C}z2~#$|NqhW{@$$bGgB*O9XH)}ue3Vovclfq
z>+bSiUoo%v@M+f1kCw6)zB|y~{v%=jwU0Z##I7&7^QG*ZU(AKtf=`o|KR&x@``42%
z)lWH8eP3Cfe%)l}XMUd!xk(ekKQ~?O_kX6i{BJS;+R8gw?loT)?D~B2VYu<PE#Cju
z+Wy#gIg5Y3^(UWuwrca^*pA({+Z<k#z4G^$J<sMxeUJH`qxbpa>e!E$7TO$9?>ByZ
zc3OG<jrq&%)ophi-Tpl2ZuPEtmQp=--!ISNpFU44#DD(Wv-xig!;hVDD^~DjTYvxX
z%wF@K&#o5deg9bDYiE3x<5FVwH}>_G#<P2NPXDBR|0nx0_Tx9!XMFjv^5HesMfsVv
zfp&9l8h3Bs9(cE$=eg*<t(MmND#Px4Ib&H8DY5Up{`EP(O{dqyJ)9NpTzzSF?`s?0
zZT}_KY(FPnyQkk~UikfAUbFYToLT$l-L0EfwDtLpso%dd+i<@1_nGsTZ_R#vl}E<J
zoBwe6+T*OB@1B1zFaIQ$f8P47S1RnRa_=$A+w+#Iyy{)P;%?E?<E(deoz>>gQ@1NW
z^w~V0FE7rI&8@%u^%nhkUv?yH`t-}Kbkk?Q=khZ;EDf!T4eT-!i;Z_beSKz4wcGRG
z&S!e;<m}4J{foZ_n4OqhwY0tdP2}0Ub9V~L*sq@b%=U8S<A;Y2f3U2oP>J93@y*XC
z3DxUQezz+<f5`XE&EVb3>d*Z#{XVz6>fGPrZ^6~`m%s05E_<P9ry<|V7u_um899&o
zaA~8uopF$VT{rjt3y+Q0l&#rv=J?@)lh0eZt9<9#&rmLY75D#M`Rr9X{c}J1=BB0R
zv;F(SeA$VgcYe6Vykpn4*-Sh6a{GmUFN})IzSkH}UlacOY>uw+Hk*q@PyFsazHhwz
z{Vvnne}BAvUsseTx-UL@{@FE8zS-2eThG3I+Wqv)JDrimTRK<&`SK_4%ly^VHl^>i
z?%%l<Uw>aSKRN6Cr!(%KXGNv?ot<-SS^Krm1qWq{Q)YY1&Qq`T+u@!5G;`hi7XD|h
z&1Kv2OP9}_9$h*A_rJ35f2;TJe*EVB?z!~|9cO$d%(K(?etGuj?L9fk@#}tGSv&J`
zO!cDbk1U0s_A19zXYBY=v|;C!vZeQ|=jP9^`SLRIZnM4dqwA;5)%{=ZojZS*41dph
z|MywB+V>+%@7EXo>MXu~<?Nh4tKuue?`Z8lYOAvU)4Cn^zPi=?vkbN`yr*2=+pcfL
z=XbZ~gWc+y;!hthrxwngFDI41VP~lPyGt)^pZWUTUtwln`~0%GxG&qM*%xj3bGdJ;
z+wc7HZF%0^n0a5c`)^*1|IVy@;7Y~@ZkFZq7Fq^#Pp|3wvvKE#w7Q&6vK!mizxVI9
z{~G*0e|_XH+miLV{`U>%?W_NF?)RUwCm&n+8$Z{aZ@;;!{<^Jw>A5?y>x^H0IQOJR
z?Zox+gRJY%uHO?K^JAy|omV#B>#7&d?f?7d-Sx`Nvro_avbJ^h&zB3?qm9>B-n+_Y
zXK7(vVSMTHl5?4FkHq}f<5s<V+c{fr-<P!)Kh8a_DsH#_T-*7HmZkdlE8~rpbMe1?
zd3KR$di{>6eW&+)TVifrdhT^yLKx%1j8`pJD<W-eCC(jOo<DEjqh;IET`sH7o^H1y
zuP*J;#HW)Nt4?nA*PVQe^ZO0s=VxQ9GWz4<<U`zp)t4VT{pxwnUzdL~&Fv-59$Y?s
zVd?qr6ZXtJcy6}+#_tz@t$TQ8q4~R~PZOSBx&G|8pKboL-Osu6o)-6K*nE1q{nI<Y
z`=|1Me*1AxKK}k;xjmM>A8nqj`C~C(za#o=-?7P2=d;g=$;VeeD*o_tdqvy{b?GBV
zoAd4cYbrmoT%9~U|Bda#`0vb@pIs4q#CsrGE>?C)yZ_!tR+DcTy6<=T{$OkKbh#W~
z-|7B(Tc^kTICsMF-;X)-I;(YVDX(uYTN-}cn}6G~c{N6#4!$_2<ve|&zy5jS&mS-S
zc>8MJbH&Q<FJzys*>UfBc|>LSo%dmO)t@YD#4NtQUjBX7o;Rm%&#}7ip5=bGYRjG0
zWo7$M&K8XgTbpk)OYXz9%|e^^yFaLCe%KUyevi!hnMN;z51%|O&#Qm$$Lz`T=iHNt
ztZq7c^!)9wTfe{ed3DwD|AB}*%i`qX_z$1lx#u+N)sIgfT-o$;`>TxVbp7eIel>U7
z`PJ=T?^`W-cIh<J?)8;-xNcwndP+L)o_);oUGx5BRR4To^X$xdi_gZ&>F2&IKhFAe
zyB&M}mpP&TmaN&&UYWsGa{tTfD85q%LzktWbhP|&q2}2PQJ;G}8THkNpZerIJInFu
z(Ubn>xIJq>y*sL(pY}ZXa{64m&A-m<+nW7)-o~xc=WpLAt*LCCUHY!s|7<(|vzGE*
zeCgt~Nx#Fl)-1N#JZWOE`|(oQb(`NET0OtwU*k@-9EmqQw_GbW8AMgBFQ|z<{o!(x
z<(J^?fA5udW`BFuvfQz5Uc#0I;Wj_k9e(=Za^I7?(z5pDpK=qQFHbk^p1-X9VWz>X
zTYX<1KAp9^ludko<)^d<m5D~NpL3r+?+dky>63i*=A~8DxjXeL@9)`7uiSmta7Ohm
z?U=js)7s7(e?EKr^5<EH)7z|G#JPVuD&22$<oLE#KhMmvt>d>g&bB_hd|7!fcU5Zq
zs~;83XXR&$=db<9@^Q1@{L8<;xIb()`~2~FOSt*D%8xS{9|y{}@0~IImd+njkiU+d
zdCVlX?0xr2^;0v2pLpi>NgZ2kCnkRH$IZ0&at}Xm5?{9?qv#o1W$^i$;#UdhvaWen
z-l=}~utYZRTUq=0(|c!6U%Yhr@^de1s_t0^+kZ}bFyH!qc@X>W9nm{>?zb#8I6hZ?
zw!QDpe?L#!S*JEv|IYlN`SZ=JpJz;^cU|T>{B*|Tp3R|`<-2dDZreL^>AULBkJL_m
ziCv~1Rs8GR4B`2gP4!Of4lRGT@Vmd6zUA&Sb8dX!wXN<hf6u~d=8A24S0e8ftgMxg
ztNon;TJiE`!hNTI-o?-NJh`(yz5P3v{qs+^xYg&^W!dyzuefEO{j<`)=1=hJ^JlNm
zEBJBmdd#bNht+T2yS8gy<zC5;-}a_7um0PAcK7S#&+ooo*>nEt{QEhx>c0N0)O&h&
zvc1H*>ieGA?uRQLPnQ35G;H3+-|Jp}11*Q~p3k%2rl(zAd`j!uwORYF%H4`vXZy~0
z=USWklHaL`*{dxlzmB>7aqm0!G`-%;wnI;S;<lN_>{*$*t8YI4r}b$cT~5E;_j>ZK
zzwh*9<}Q7BXL)7Jr;nAb`MKxb&)jr5+5gA7<?-(fcbHGVRvvm=)W3M;*XW<mto3hK
z#(evDZqM!yY>yu<f2}D0_w1DObMM-(_%3<r`|~$;HRsMeK9e19@;S(Q^5kB-&qlpA
zXV<=Z`P%kl`TBP~v&7DD-#7kn@yFuVsXuOAF8w_zUUuHKGa0_V%|D(L9{f=Ga1mI-
zG=9@`zvsLB^1lC<JG1m)@O$snz+ca<Y*|}VGH-$L=Pe&rN4<+Ov9J4G`0HAgp1kdi
z@0Tt|2hW}u`;GPYmh!B()jqlPo4%P}-}>|H%DdXOdUacGrfr$F>$A<=m$UM|otbTF
z{MLV2^~{1-=a>K4bNb%j#g=x-&kH}UsD1Wj$F;MwW2)a~tSjzcYkdCAK6Sm~;MbLh
zcAxf|UG;rsYFh5IY5Tuc=*iAMzwi9lzxsF0cUk{lQ~SKy-az-u1KoYLo44hBn(6v_
z7QgtLU8SWL+7GLKo{>C#&CYjRx3{m_Zc)7WyP>(v**x1E{=V($cJ6n-zpA|HeS6i*
zxxx9Vv!)+EcxK14eN*<AOkexw_PuZ0KF2E?=l$4{uW-Ng-z>W?Ck~!7FJIX=@ACPn
zkro!UXX~FC&$s-)v*Ucs=4~6^i~FZpWm$avQtW@<llN)rwjWpT6s*4d{rn!8&%yKS
z6C|XQUtCz#_x#dJ{!6E?e(AI=e;xPP@9pALzPf8=JG$rTzlb|q>O232@!R8DudjJ_
z>-w)XlQY+SzYsP5t6@z3C)c~$ceS5{)#?{q{}EFyS*?FI=H)a0ob}eG%ja3z#+v<U
zum7T-m0$6jt?&MU>wlX6U)XEUy?VXs`Jj38=d4qA|NLg{mopsaZyOgn8ZWX2P4M)7
zJh$6re$4Mh^Xn5XeQ`Q?a(TY)-=)US^S+)<UuJu@{W5#yhr7GOe^=@K6}qLq`>OeQ
z>70AEhtC_=etA}S@WbEA^z*lCEF`NQ&%3s7Z&lr~wZGHds(%&;*#F&}AD{i>%;}5U
z(?6}<YX3+7U#mRlopW!cEou(i|N0wV%RO)JjH{LFt{l86edoNq{MwDR4=ZOMKY3Q}
z{*CXq9#`|<|H-b_JtuR{EboWg^%CL&(#~DGoM^P=T>0I5S1O;LxcG6)$>aCueOr2N
zqT%l&`|d1#?tTB>v#SR8uJ}C<n<ewa(0N{8zy7T!g%@RIj>I>gJd^zVNqC%$k6Yc*
z+_QV0n0~(X=gZw+x6L<v<$ZGVa}DcU(f-G;pPTJG`90>IsJpRpZSljxvX;}F_l^DE
zysrFg)$jf6UcIZ?bX66NCGBGDm9v7kZ#$Luvtn}iXSUhh?fm?yUkc96u=~68_iXdp
zv#Za}x$(VUY`@R>w=%Xd&p!sZ@qheOWp%_}Z2P<Vw|ma*zT9<t*7i^9cFc@_J8NEa
z{cpBs<_~r@me?L)|7`P2bZz{W&}E-%Cf|O%c;@b3pB;>Y?Jx3ue{TQ(fX_l^6Y-2C
zN9Qj!;SSsJ$>jN`haYUM=gjNdtY5qT(Dv=Mud*-B`DXro!tdD=_rw%G%q%OpU;6y;
zcWvX#{!{qhThE>M#q!hgcVG5BihBP`@!q+!Ri^1j&(5iP8e8}=|KnQjtCp~{0MhP$
z_{O_tALDu74X-P9`@cPZ_ul+?xu5R}56+oaoV4x!U01*RH%e>nmhZh){a$`z?#z$t
zULHQ%_|ezznc|J#Z=wok-u(ThJ=*##&$>_1JD+_oTl4N#%(EA7{rkDU$$mV!b^q^|
z&%4v-ecP6nZ&7(;-<3UUA1@34FR=d1bE)Fz|Nhxu|Gx9>|381(e*OHu=J39)>8rLr
zJChmn^zh7!=QFO)eSItEXU2{z6%yw-)7@WNNc`WsznODl1EZl4`|S5tmQ`8HH}CMC
zv9tCJhkLf(*6DX%<$W}<PrrDUqb=LUO#j}K+0j?iT%uDK`S(|=Idea{8tgy+^1d%0
zPnY;M*V@}fO~?z|VOJ7UW4Yny%cZ8L4qlTBvRC~-<&E>ZiqHFY?r*eF|Le2-`<nwV
zeysa^vNGuMtp2>Z>a*SE?a!~wy?0xFS^7ucb<bDbUA=cpf}c%o`)7V1{a1{#8TU3M
zd|vrE>+aFMC#~i;r>_0}WpCB=zke0CXIWRRt2zH>&l$P2W3Np1n{NJ|?pCws;*~84
zpFe5Grw3Vo+EiuS^f1i5?b_ckx%oc7tKG8fJo01iW*7ON{k|`{_BUJD{f6{2pXbPl
zfAM)_<Se^3J8s^!D+TwKZr<|pt=+$?|Gurb{XDO@z4Ax3y#bqRkKnfi)4j$Ym!H?R
z>hGyMczoVG%je%>e{5>kzfo%P-FNQd=e*Nzy_7QF_}<X;Z`L`j>)$=X_&{^HPbMGy
zcro>n_gm4q%Z+2p)k@FB*;Sp-sn1&eUc@i$+RNqTM{P~#&)i=8n{C}swr}(P+q736
zy}Whj>hziY>a~1F-X~UHy-@q~>z5BJ@A}Gy`1eO1thP7c{9<Sl!~giD>Z@;Mam#kz
zyKega$hk{a(|6gfjLz5nneip^_-X#hFQcxlN$~ru{%qIxnXhAKE@*#fHQ7pPU3Qd_
zpT)gM_1iyF3SP~88F@K7{l~e-sh7*oo>sT7o%`~a<)^ayAHMPC)G}8-vnh8xZ?Ctr
zuI%hW_N!Z7&bN)<usPQK^&G1k*6FfykJsG%;`jd5th)E?Y@Dn-*ADMv@!zzvvT4f|
z?Ygu#{GZP6vRzr-KI?dG)ij>9#ycvkCP&HNIrZl0-Ir2Zy2JUO|NHT5@1c(;TTgTP
zH~;wN=KWsOKdZ9zhs?h#7awT(zxKKQspeNg&5v^>XU{LM&-u6G!?&{EY{$$WMDpA{
zAOC%x?Zufh|9m+=?>=Ac`}aOswFY+gD#iEB>uokpu7CWFpJ#DnRrBHJSEt{3G->MV
zUFqBH%3p5Z@O*{(xt|w5A7Y=qn6>!Fu4NCu>`A-S>~EWPdurusDfXvt_~%czJ|rrh
z`|Rye`*OR_XG7SF-;{*M)GvE>rRc-LpJ#T?y=}hX7n{xMc`J|our1znaqik#b-J^X
zr(3J`zm9z8;oqOV#N4fX*D==k@64N1-w5<`zfP>)-S>|9^EtWuJ0s&C&y=h_bo%?>
z!w;=*$7B_M*c_i)?f?F{Y4*~OCZA^Co>i6gPO|pd*9$%0R#o%G7sXlJFb<BNT>kys
zxxXf#zkGcA^z6fWA3Ni`=ihk0m``|q(%AIpmwB77)XckFz;F4<X!HF?k6%}B(Z7|&
zx32i?OvcP#*Z&@{dE%TN@jLkS@@4HGm!5kW^E`Hv|M|uDo#U!+TkqV*p8IUJ|Jx6a
z`(D(TSZsc|T+Gj|biS^g+^ou%SJQmfeO+7gd9MGp)Bi&2eeLGWyZiaW%-paqUkaw?
zpWQ1r*<Nqw-n;u6Kk`;AvuU5V_TAM*HotV|*cE^H_2lZsD-XXK%!<;R<6}~@VXyl`
z*5z%VetrJGKsCv<W1EwB=dx`s^13nKSKhu}m1TQAt8RyP`nx&*rskz*zf-<{>&c_1
z=Gt;ISGGQXee2FKZ>#mPWo_?gt>3xs`=>4QEH|%R`p)P2#iDJWK0Z6+^Si%oxA`2O
zs#2RTk;~67JpJaWf9LJrZ>242ndi+d`TNJ@{@3LF=I2$;$ZY+2bH2EpT<t5Fd%@p-
z&D&oad)oKS+>7(RlpEOEh!<^IBEB={%eSTPz1^cLQ(v64oO}H3!pM&~SFhi*|G9I&
z<=1QT?kN7Wt$jc5)4|GTdzab$-sik!?Vj@@{^`5?w%K1lGsE`hnKLi<SkATF8TY?k
zZO_cPhcC)cp1$+pTj_{e=E`F-=hyGsSbO&U)wwUNB<uBp+)r~aZ?ic#N7rta<jU{o
zzNDtj|IE+x*d?vz*Shdus(yAexWBR=W&Qc=+_PE*nG*Jn_SG}f&i2F|<9YE<_+`<T
z4`q(`I?EoPJ#_l@?e^I-pIwc%w92`^X8q37XHxQt9zIR1uC|ve+xPrJYV*SnA7<6;
zd3W`5-q*L%C(H}pettOf_OEL%CanK`W!}*R&$qu9^iQwilRNcsO~L8cawQqZezG4^
zWmQQ29(!5(<%LUMEN)otD|nk*cV7Rx+}Eu8Uv3}f{`ht|>&p%0+wT3m^7i@bozJ$c
zPxskp8kw=~-_8xsck%N*+AN%2UuBh}Yif7z`Kj5(nf0&Vebst&`~K&7hpqQNl;+F-
zze)f8--`8nf8SNVKfUhey7wQhZI|2kB>P_Zk4NkOSbq|)z5lyw#osx0-;}==XSVIE
zviNy3J<NW8)z1aB{0~#A=G&Tle)rc}V$lOFk>2wYPM$pc<IF5cIjbj=uin18<I{s5
zPt@J!&--F&u(kSO%9oNIQ{P9v^_?63{6)pBCwHGp)O~Dg-g5K1&pgre^y(kmcDyNi
zGCTU|&t=#C%$YflPycBx|2t)N{ilofb3NDox9+`F&13n$$NAp>`L*7@e$M@0AKLlr
z|Jwid=imSH|Gzske|On`X@B>xKl|^+!@KvroPF+2{@+jf^8bF-*FFDzbG~hH{@+LX
zb~Tsn{~hOh|M%W|+dW_3{XbH2PQC7HIDh@){eSfN_J5oF|N71ETH^CoUQPdUXRDcI
z<@uxw4|992#Z}(eWx2uj?AJeg|DOEt>Fb%#_YWHQZJzLSGyncaKN9ty=C7;$vY@K!
zqe11ob6fL{AIY{!Q$Kxw&djr4Z4aIP_-)OVj~_lBnrB`7viO!VyMN#G^6TuCVU_!?
z74RQCcl&x}%<riDy7Ra9Jqf=jnjZfA@$Jv2_RRbk{r`u3X~ps1_sW0VV7Dvy@uS_Y
z<d4S7{eRi(UwoLhegEG-7x%rL|1bUB-yJR$$FJ9%eP~_xp`CyI-q&~2<Dcz)|9jv2
zf*)_v`S*XT|NrEnu>9W_ckdsqdHV2n{R4LX_)k~g+y34cz<vJmtIyTne(ij`d~MNL
z-}_qqukWm>REXvOc<{}+)muN`KPV6*AT=SNn&;rh*k+@>i?fYqZMMI4=JK}<#n18!
z*RFrHPkgWC_lUy1o4;NuvPoml6#i~<PuIVqy0WP@>iw+rqZhXs%&eUCy4pX!%G&yJ
z>GRp<uW!|)8-EV9+5g4<Z-0CLpM3kWA5Yf*z4h_&Q}#!D>)(Hu>-&G=P4@nGAGX&&
zeBS>j|KFYSa{u<r|K50b{ogPCvT@bNt@-x9_y5b?US9Y1`n|t9_PqWuFaP(o!}ou6
z&bRp2P;>SE=l1@8^Z)k$JAC;5uhsAE_q;v#JNEyl{Y4eO@7hP5zJK-4q4~e_<BzWY
zxa$0s^Rf1e=jqD4S$OuV%)Fm#UMa>G9Nl`abkDoxc|F(fCOki1&+eS#^Y*Hu+~G|A
zy*p~2ef`MzV(rfU*iG-Q{ME|8cBcLK$C&Q2Pv2#3J^6BRZ-L{SJvR>)yq!5m?wsVO
zFA05rm%saR@8-J7@R;Y@vwlw9xBTPw<?jV*{i}2KrO*1P_2B-Wi~B476`p*4(q69E
z?)OQ54SxI2@_&A}$JhSvm$&=f=`Zv5=WgNWy7|_B{|DdySQ_7M_2-xW-zyvcoyq@u
z?cw$RxBTT_m;axaZ~1zCQsG<UNzYC1CD`w_u=rY&Zn68z-`Yz*qHnLZK7Rds_PX~H
zc6Kr6E&m@dIoZSgEH(1_w5Ut9&u72Cl@n8TLw;TQgX;fR&c57flYivz@4l69UsSKi
zd?$R*w(#Q<)1P0?mgo9exX%+?GW%*&@x$UnrgF2z_eAb^@MPO3?fmmIw^~lV{{Ch4
zE$7dlKcC$H^5eVs6VLC@t$De<{`kY%`X}-hb#w0jxcUG2z5cU*dVcPnKBs2C{O_Oq
zGOz2Z-^RYT**^bQ?|qAF`Tsw0|4%$%`SF>~v(FE2Hh=lDve_iYt};9Lz0aP_+m)mG
z{;a%RfB)1hNB{ffbE<zFn*U$$CeMrHS5~$2uYP)Q^2t&=v9H@qFWZC}ANtO2Tz+)>
zwXKn9>~9yB_BYSHz3ORr)s{0^PY$1c{g%(Z*k<y1pQ!6;H#xU|`jb|AKhnBs=F<3|
z{YiUo#$NeZ{OHWZ_(NCEc+bo(ng3Sm{p_QY<)_*IS^odbL)~(FBfo!z*U$e||G)8D
z>5p~!|DGM5{`a4K!4vym_5Y?GR)7CbweH+;`!C(?_jmp-*Pr=S_x}@l`+v$?|NNf5
z{?EJpzgO)4x^?=0zvmu%l=A<^toVGUDzABUx{&|mv)7%Bm7{*odcS^Sy2<{~&*v*&
z7CP>(=9?#G(*OQXh@s#u5AHJA{P>is?Xx$lO|N@>!_%Dmy?4jDZwIZLz5R5R&41s!
zy7@}~LCec|-;FlcuFd^;a^}_f`g>|NWY0XeblUq^?Yw8{_kU(s?g;+=>D;dczaLm#
zHm!YhW_z9QzQ60M{#wufdFG+{yMKRA9k=^n&Nu(p+50wicm9Yc?|<+A?_~A=Pxro0
zsDJ*c`u|P)!assPpRE7?>mhUfxAT+u=Knb1&L{tG{{Ksv$L{}}+n)bl*uLP$Gy8A;
zGW%Yf_N#yX>85|(r#H1zyXx)*J)ipg%x1A1zq#)fwq7nxfBN|Lqq93&KGod3S^f3n
zN4CR{)8<CnJUjIH{=qFL6Pm-M^lsRdUbwkxyWUmHa?b0UKMGggy8ro#W2EGFp7~My
zlV8p{zvkMZv%+`%qQ1wv=kJg0{dnTQxf0vwrQ2#>J+L|Z@oUU3>sN~Fch<bz4r+i$
z&wTc_$^Y!^&#NB1ulaSkef~f5|6g7{zVp}g|F8NV@|OS7Prv_pE#JE4@b~)v51Id8
zJuN?B`@X;3eD^;d{(tB0{xkny9bW$a-`!L3zsvu<J-qz?x8v_>MeYCJ|8u?kf6@Q-
za`*nOy<gSw|FQh92M@jL-*1<{_x=0-iI3~o)tvvsW%~C_>0Nol^KmBWq1%^d8%rB6
zPoJ^7-M{kRZ@aQD|JJ>HzQ1|n4fX_%ZDy6;l|OWwAEw`(Id64d{qv7=!`*{tPqy0=
z{@FxgZT9X%=dJ9PXU7zzMZMnjIqT+4f4kyai_Pq7jf&1*wrcLym#jU1;Btad?Dun_
zb?+*C>e9Y_J3jmIzvb`#&E5WK&w8DEf4Bbo5O4KY*2C^GsAX_o{;O{Je`DRB{?qS&
z&b?pu<ILUroqx{k|NdU?|HK<N16=?8J$wI;eBGB1-S(fJ^Y8!l*uJjf`um^L7SG!6
zT_xI|esZ(je0kfu<pOr=WirIhU%7PN^6lKx>U7)kONUoCSIv?A^m6;F&-V|OMA%+b
z;%@pVaqriYOV7Xl`@Vnw<L$o$?>p3=?|hxupX0~-^OE(yS)WagJzoF)Nc*$f_TS6z
zTc=9hWj6o){7n60^SZ|mjm!Ugyc90~uX=TL!M$&N<#PKzS?~Y+VdC!k{z>&A(>~u5
z|G!V=>+!me&Ck#O`d$B^oiF|$`~L?IH_!j|<e~ciwf4n-&QE<j^SN&M|9MZ#?f$Mb
z{=4=5_wTazKI`5us>!qaGX4Mb&wDmM^o^_e^{)E&hr9Ka-w*QFefa!s@|XFY?|-d(
zZ*}kT{EgTCMD{!K&bH>;QSE*0=Bo4d20a_t+h6Z%cb#3kr()~8@=w2Bym~yLYVlW|
zIX_R<t^2a;)y9(TYk&LvUwUuP`Fnr6uguwg@9*i5(qC8X_P-Zs@6W&Ip1*Hj`l{;m
z^F8lw?42dv|MTNl9?Rk<Uw`WCwJ+_ftl6Ajw>AG)`un)a=HJhDz5nrQz15#a`CktY
zFSq~q@$m8bm(%(3cmEdu_kP#!c=5@fXWsw!_Hg^Vf9WYjpZbs7`)zx_c+F?#Pjml2
z+F!C}@84&4@6X)xKmK=k|J(0>UjIM#(LVX#+xWjP9?mWQzdGs9^|bvT?*IRJIRF2t
z^&K^i3G=4^-1AWGGwX>ezVOY}dUrp+{=fExjsNpqdF!R(PNkiD#(zd;(mwW8(y?nc
z??~8l|L@)Vwad=f2#0RDRvH->zRR2Y?AolD3p2mZul;S+&i`%h?!5EG*X_K|=jMg_
z>qX8t|9U0!$FU#9w~T-P)4TFP;@*k$^EO2rzCPO(R~c4S{OWpK_1h1p?LTfiEPns5
z{gL&Detx<8f68C?f2aNz{y4S!f2m=7)%X5=bK?KcoNrn4VgK*q_VaiCdjGDucKzMH
z-{<RI1(*N#d;0eH^M|_S_nqfo-}j>X{C&@V?8f^ay^H^_|M$`VUNir+GwlB%UiajK
z_W#%McGXtD)7HoD{_WoWe(&%5H6KFbzlJ{VpY&Yyxbf}1vu@6p|F`n9t%&jR@2lT(
zZd?BK!@Gxddn$fDxVQ8Fk|~?n7xOM}J$|r2PulNpT&2`}$%mOIzdp?M)17~>@7WcT
zoeH{J?>@XTH}LY0GaUA|dy}(1eYAOcW4>gW$@W#@F`FzezIfL9-l~=_{?)nF>C66}
zeDWaW((2`QTUXxxKIi9~im878SpT2D``7=@bN0vHpZ+`C`&;_|h`U|YpW_LCE$vIc
zD}UVoe`Wo?m1nK~=RMoH`~T6IKlP7)+AsUyvi$D<@{Bob_n$PSo68?Iz8>@ArvJLq
z^Z7Qlj~0HFi`ldCtIfl+%Ug>xUZx&0y}$L2>YYE0H>Ivkzr8B;rQV(C<%ajB9@{+q
z`OF)|(Z$OPqPObEp88^Q@7f{N$>E=WJ*((HmR|F^`s<CKkw0ebpZ414I%w(I@}Hva
z?H^0*_QtL(u4s;(e`Wdevz1c~>`ngKAN+si{I{38|KG7(ufODR<mvQpK93T%WWSm>
zahLxmOM~541g6L3vh_=TUiUCO=K0GVwl@F6Q=AI4ul!o``_swwUkWO}wuhH5+kE!C
zRqgzl*}A2#vwq)|zjXEi_j<lnXRnvnt?moYYjywlE?3)szu5L?E#=~yD`p=*y7*h=
z?d!WLEi7;REO>U|>CX>)estD+yY!L&?C#^d`S%^_ndhxekUxJ@?D{ULGPTmrv9~+9
zck%nxeJa@#S$6sBvl9E)GcErgkl;%%Se?KBp+(1eo;z7_H6;@9&o6JEw(tDBYj&l7
zo*ljxWWL|L{#V6p^J-IbJINE*Yp>hBH!MA0bpF{J^XjaZPZjuc<gR<P@73P-%=$R{
zZE?MO&(Ga1J$&2zf%Jzv2Y>cF`uROzo9#*S_3w5*Oq0($n!ZhP?di+E_^w|w-u=7(
zgwFhhanFLZ*O_j96zn`la&B~H(ZM-CuDT~RFE%|Fd$GV^&fJy7Z=NhXJo)vPd*!cV
zs)IkTO`B!@`C*~W*|l3<&Yt(>^N!b7((=obvwmK&EIV~s@%+V_@7HYBTADtoJhvy(
zd`~TN_5Fr)sdtr&e{Q~DC$r?G^x~&G&ugpSvibYGDZR*OwGHpB`<tVJ=l|zxoA_Xp
z!2f_L`@dbP{g{#-$N$@IZ}QUZ-*4TTbM?)$GrLRb?K0|qr9Ayu@Jn64zPF!!UE0M5
zuQp$5nx0lNZ@cAYHPFy=sNKGAs~+B&DtY$o9$Ap}pQS(e`2L#}S7ujza^03^FCR`i
z&n+IZK5hMuGdrKnxE=R7%KHC-9TLIG*KG?{zhm7r+1vm0oGWh+wl4o@e(BNsnQuF%
zHCvZn-@D#u@8v1F@fCIR-tB&OUVdNv&B=9(YJMEAsWa|xp8w(71WWDw;?LDHu6J#>
zy%_$p;K$FqHfr|o3t#8oZ^%DTye$6Vsmph2+>Dj0;!JMLs`~0P`~IxTla@8VMAzBa
zu70mp|F2PTm&f8LjU7>L`M%qBo^${Hi1X2tvwUsY{Jh66TV(G}*<P^KKCbfnn?JAQ
z*6yyi_*~e#^5yD3SHi2qf1Y{udv@>T_Ya--R2PRuo!|HD-{sAx%%{)&^;34+v|Bm<
z3P2;5a-VrCrcL^4<Lh^S#WrL3vI)cLKU+2O>x#ZzIs{thp;&y$*y-@H?^7c7pLUy?
zpI)Lr??=I>gU@#R_2q4|;awkpcd2dG@2|qu{#(wJZvXPh(K`L^zAK+>quH*@Ret{Z
zaaD84=Dwu87Xyv^`Tg><H=Ct@T3vT;@08wq^Y;F^vgyC#&#Sfhciu|h_{C;3eS-eq
z8Zq_haei}suFqWlytlnS@BN+5`%cCSYksYJd+^|g=khZqa8@l%U$T?qUV`|7^L0nR
z_q?e3oqA~dvUxK<Y&v-EV%4%JH+i1&mtSmeSwH`3d#C$;&$FkQbN%`5Z{4$Io;hf-
z1ZcSfd!<yhUR_ajrKH8?ADz+0-#@LjRkMFz@H+qgfmhNW=2RYQ+VSJ#%EQl(UatKj
zQ@2m}_oVsre#qSXa`tlg3H8@`+W8jWxvD<St50w`(<pY9@#CdQ6S?Ob{}!(PzxQ+C
zn;q}1KCWGvZf9A}>Gu4kPx0KBd--?PKMyOtuUz%MT)*c1)9kZ4^Yx?Buap?SnP?sy
zm-lUM|1{&B=jO?Le}83W<Y#-fyN?ZTKHqaZ`TPB%_3z9doNq}t+40MGW`4u=?6~_A
zYJSbL{5kJx<kzhke(#Iatuyz`T-)~WoV@|(nnP@o3NksltNrrczj^w`%WmJh!cPa+
zJ)ZmTS<vU%qGvMy9a(c<|7X~5<CQ<>P29D0-{UJr>T~u)somK8=IF;#yLmD()&8eW
z?>_xF)ym&kz4m(a%x7mK5`XWCs|=4x-xXI0j;-HpzkUW*Uz6V5r@y{n^EthmEV~*5
z^*xtMEq1>UzP*1{x?OGY$rCFVKi>5I53{mF;9DoBwwC<)Rx=LImok6-CHi>X&70=_
z%`<1tQeWY3`}4=`&8ON=PqZ!N|IK~lr=|L=-@ChIgT3|V_sBeXZm9nvwXLQ)>}P@H
zY8$)Fi=LPCKDL&6ckj)W@@22r))alTjD6gcpR(`!omcvA@)yj%xz4uUaeYnj%Eym+
z&FXXF_G~>SeB``UZQtGH@9OgH&)QxpKP&#_Rgbkp-Mr8IKHMvd3#y!3ZcpB&e{A<7
ztNp9qE<Stj&4<dHjNvgRmc`9`R;KT>Ed9`Hv9o>gychors^Z@9hR39xzA5~~_wSvb
z^H%ab+u{Aq`rGz>kA5`I&5!%*_WUhq*zm)ewf}rvPiN12+1vLy$2qci*85rci()ED
zpC4L!-utdb^1D;gYt!e|CoD^lDAqru+MKUf!<TpN(EJ$v+PMqY2K>8p$5P+&yJ>iS
z+7HX=)7ky({$8n=*Y)nE^)uV>-G!_7SRZ}d8l7lkt1h?Kc1J?--S6u{?e5Ll`{(4x
zqWyJghtl2oc-uDHm-=O^Kl@twhZj`xESNw0=bo+UcKH`4eSLJ-dH0)4{k4{+ylv(4
zPoDMpRq^BUZGG;=mf!0VSd@$&haIkb^qjlxdHmT&z0)q&URN*uz4!ZhOOwxcmRFXh
zKjuGw|MuCYPrv3lb6+n#zk8Wkb?N+*AHVtCIdwaxChpUwyQf{e-+p-X^Tok$A1+37
zmusFEp7M6r`(@9XC+|0tzyJ2mzQ%uSHo*sN!Ydy>y8PX^-8lW%Ve{kcXD_k;j1Io6
zu&?;yq32U~?KP>J_r-G0@^@eA-m|A|-C$X&|0?m~=dOL9E=)GezGnM=Vd?oViG{WE
z*S#&+p76!C-}?CCw$-)nm%GiYidR>i>r0=SyYBVgKljp4_q?!4dv#ZIefj>G@h|tx
zyr~{p{M=4*mu-bd{o+rx_oHinv;C4jvHAJVFMrm~bC25eCGxoOPUXU<(eDKc?Tg>e
zsH&*^e);%q)4M*KAMBNvcrwkhhW~w(*z}{X7F;g1u=|z#@ls5Di*@SxHM5KLU&K{c
zFWS1U?b&S6lJ(EN{djr#d*9xgnzD1Z*1Y(;b9>F%(~q7=KkmGzzDwBGZq6>_*yEpf
z&pm(c_Rd=7==%-n*NWxk^Fn8D{vPvr&4&5^SI*{KTt2t%+2Z!<7k`bjOU>#NZrz#w
zihE`3D#OZMv+VT!;}b!5<sR8rlP}v{z4+bz`G?oJmA=~?`u*;*^Ur70oPQKqxaHo(
zeUaPq-<fDjTF!`hbu4tAo_h22i=Wq4%v(_PlzVz|_=eZsKVQtXH`~7bwz<K+#-Bc}
zeCGbe(O=Ijx&P_g=bQU}q#v6<`NOM(>s#hcy*1PL<A$#V;eQXDnULr>-P^Xd_U8-B
zhjYHoc5eT8?0W6>w6_oMT)uZ^k#p6SYlq*zeOG--ZS$<%j}GUa&ENMrMQ`rT{eNw{
z`PpY5pE+?JUv#$Z9-Ak;b}IKROP?Fx&;ImBc=>tR+4E;c*Z*d#Vg76xX=`sW^X6mq
zZT@$EA6mMc_3CBw^w+n=^QJz(>m>Q>=>KYi9?o@o8;)<iR%v>skMQ*QoHO_SE;svq
zX8*L}{l`+CA3XTt-JN^hcjD}#o?kVno;U0MuGO*zcBXS~eyN>*E&uCV=?`}f)F}Vm
z^I-O4PVv3`e3!ml=y`Is<68QsmrpChWpp>cuno_hw(sM;`v=c7=H~F;zw<}nV@r0N
z?)k;%_w2D!Po6G!PBLw)oZr7m^}o&(>VFQG@c%vOZB6=zvuE#KT$casZRFGHf5ES=
zzVW`Zba&~!yR%NGf2};cdZEwbFCWeB|BKwNf3yAB^F7i3Tfg!?`58G^*DmgS#Pfm)
z%i4b=lvUI%uD+O-R=QkNT|P#(IQ(X{y@BC6pSHNwU!7*ollAjI{&ihJ+@Fi7X}Z;%
z*5_~EaejBda_6&Wf1f|^=xaW?yZ_IVs`g!<ceokPuJ+kG>vGJyhY!@R*Y2rVnfdU;
z!z%~hrQ6k>D}EaO+fO?0{r3C^UwA9bE?3sA|CwiXy{=}%>xy0eZ_hiupW1Bm>FrV0
z;$>w?*WbTWx?a1Z+TK9$d)xMF&9ly5m}+KOyD9ErkaNuje*YcU&g8rg+xtBC?4Oe_
z7gs-QD%$W~u&@1I%$~EW&pybF&och0_D!aI?!4n)Y|Vep^UcmXom^h6|8()^5;^wg
zK7W%xeY*ply}#yl_+y3L;m1Lb!_TMhsEE#9xAnv454VhMYx`$j{akV_Zr+2R>}g#u
zc^hTtG-sY|f3352=ao3y#g?U?V!!|S@NBm5I@=!)zFbnvcT1n;{r2eNc`qxQe?)%%
z`flFJWv5R&R{fguL#qEQcU@IxZ}iV^OP<aCquRUw^XItgSwAmNmb8#qfAj3pcXso<
zE5Gl1_*Qzx{f6{4KkN2=xGe5p{5R%QwO(cTyfgXp*Z7po+4Xy$^Orf-zFxlmxqqQ}
z{&V>ml`FrrU9egar@Nf>tjFEy8T)EKZdt!Ia{2kp{WTTV2|K)(f4(ezcBb)HWBGli
zrO#GO_S9W{|5j`JTXW@EKhr)xzPx?DoL)QsCH;ke=H+KUi`%w!@1JS;-S4Z9ZGM`)
z&v^T<Z@fR)o_!XsdmY((?EGb0y%#qRf4!4Y0m`e<!G|Zme){{&?2nfU|9}3FKF{jK
zocaWwu8n6O3eT9s`0%@*ez!mW)3*lQdY6A+y%;q6V(q6ihs{mZ%b(}|JoChN{X3r@
z*Pf`&@2Q!fzo#bsh0({SOQt`c`SVA{pNDfSC!1GY|0A4U_v+>PnVU~NTz5AA=eCN^
z54YO=lfJjF@#mlK#!K2hpPz4M<!@k<cWvLt51&sws8-8+G)Gx@zSObP>#rTJ|JUg0
zpm9QGva#jA7qOrH-yGd?u2k0c-?KD3soHC`*Uy#e&W?>P-LiM{^x3<=7!*Hku5>+I
zDx3d2#ag+2_P;MX6!u3Rob&AR=`*`(qf3pVmm5dVldk{Gc8}-2gZ=5)=kHeA+yDFX
zk!^S1xyPTs%fzH#L7ps^kbl2s@@dQe2RPb9{N^sG<GXoE<@pYWU+Z2LoIAu`{r^d(
zalW{Z-d4LEQ#0qq@B5yA_0y)!^J|`ManG&$mGT6<4l>^8*SyC0^S=Dql5j4}E-HPO
z-?5pcHPg?XiTUKe_cLfMdDg#KvgYS!|CfG|zVCHiUC`_1k004&@4QK!eSh`x`fr;K
z-n&_v4iTNZ?!3JLQ(MV|YmTKR?r!o=vhzZ}%X~dzsa+LU@w>41v!2mMi%-AS`n+Df
zE8T7W->mJsx5=yPr>9rUD|pvG+v0QC!}NXWt8Qz{pP3kb_>Oa}&bxbO7Cuy8m*#gq
zF8}<zbpPtCy8Lgx)m!&9UfsOw(XZg&#!`La*FEM(*8aDAHLH&ImVACzhTJ=iJr%{r
zzkO=A{(oReredvMaU1JLy`}a`zulLAWO{Pmmrr&DRr+-&wA1<Oz7=UtX|%ap?mPd)
z<9{VJRZ{0{7n?5UZ|8q*GJV(cBa8Fz-?2?UdV2pU|NnE;Z~snrJ1;z?8LZyI_HMat
z@%De96*`SJ#;c#F6}|jh`O@;!WqJN}#b>|H$<D6)cQgOv$FH`x#B)ub-{bc=RQXiG
z?Dw;31^Jw{ug^U5tbO_6*6n{Mk6QoTJe~9Y_eafZS7u&_-SvLfzSd`#ti2B}4L?4A
z*Um3-7c-51CG`E-Sb5R>ynp^#xy>29bDtNBTl}2qKi{~v|Lpu_du#qZyYr&B%wpda
zP~Yj9`GoXi#mt}2tayC=aK@__FZcfV_-kG}cbwJD%g1H**v-50@OR$BuX7K&o_}en
zp7ycaz-h0?jSpX9rN#L4{U<MUuKB%d-;>!@zus({zs`KNzdX<Or}M4k?S5RjY+QVQ
z&a*3jBMThYzpyE(O)Hyg=Wcf6=j5s?^X~noGUxB{-K)6r;j?A^o;Ppbe&g-QKVU2!
za{hV!w;H#TY>(&Gn?0H>c{BSW-{xn0yZ-LgpR@1vJ>UFyf65J}MamhkV}JB0JMO+r
ze)9FQhnM25-rikR{5|{K{MgUlCw=BrW%t*-p8l?W?K{59@BJQD=U+ehtaY~JX7&8=
z=VxE?#6MTRZuz}q`RgywE>$htWgL6@aZ}~Yn>FYC-|k5N<y|=wl&#n1ANc%yXO_<~
z<CXKyXZ<Mn@uk-4{+~Eq;gHYY<#zpj8GJb9Tb8l(d3%Gs9f{qCqwjeaI_^7jd)4IJ
zx%_fRPnp|iZ%%WQ_i^Lf_1|UJoSzS`PAFe=w_@`L{-bLxAKpEB=G!`ps-n5(?RwHY
z?bBb{^o5Jbzp;v}l&r1sOTTjQ(b<PfSqs;$eyZ@^^yir!b8mx2KK7WoefIhI@I%3~
zTlU#APriOx@ag5^%6HA*{BzGOU@wk(|7*#-d*|&9e7}AAa7a(MPkrm*>HGGc{meGo
zJYUH^j(@f}sF7lNDKX9cd)B>s37<bMd%ttfTkhk|^<3X{stW}6-;(8*-F5!V^5c&8
z9%#wOe_lOD^0N5*xP5<%_rH1aHtM78`&l*TcU|3{zhM6S8tHk8d-m;LSx_SJZlk+c
zTHns%XHU}e+3al3t-1O5;ivy{J&gv>cwX6+7H4HNuGv@o*7xlV=lovwPp_ISB+jk5
zVtH{EsM!7@r+3^&PD1zVJpFld?%l5YdUETxi&DntefCrz`Y`kSY4IHYs(mX>{j>de
zE1N9Ou1<V?R<>FH-mGxv%70hWyV|BVUw?LX|HHS^FY*=6Pfh1^`@Uyso?Y#^F7Ep~
zztlckmtkR7`MH@dKY7cyQ-`meZG3ys^xkjl8MejQdUxh5eE7og>#5m1wx<5iqxzq3
zJpSg%*_?BCp8b-0__U%r>{Z2&iiJC?ZfvfodUxvj%x`}CeqVia?QLfK>$C4Gm#^QO
zRebxlO#B7yIGg+pJ1cIfOUHkHIk){uYF@=}wr%?wZPIIP;?J(%aqi94O&j*!d}z7+
z@V)ypBmM7d_0PT;TK}H?*{ucq7nz?QUDW#dRL;Bw`?BZgyouRix8<4M)v|5tpZ}0M
zRC#vy%co66Gqu@&W^O2so>x))Xm0vZ-}7(6XFmH?d?x2t#q#v2{O$AS=T40;Ok4A5
z%U<h`Htuy_WAE&^ZT{frXWuWyZ+<TK&Hp?-YqM1FZT7bv&$fR3b2~Hbmt{NqHgWdl
zW$)S3x}3Cg^5Zq`Wmsgm{n}IU0<;(AR?mXJYaia)9=d&d`i$P@%j^5!iRzgiIdAR5
zAFEeu(|df`y()XD<@XQU=4Zb%On+M$7F9fR>HGH_;#<ToP2ycXJwI=%|GCWf$)BEq
znm13RPZ(c0zIo@RTjsCN`L3-#zdn8Xvz_h1&nNru|MbOn(R#n?7vEkrKbM~|HG|_#
z!u7Sg4c1*`=e}N=_HpKHIriEcU$Xu^c=9BndUu|!@ux!v=iQIV(l>rO+y8FO^^+IR
z&bayE<P)Fw6Zcdve*O4#<Btblwq5(Gb-U`-w=+AdXTAB7!p3(jyR3NS-iolF74v4D
z{{!lte3pLk{G#!(%TjsV+c%|Mus!W4rMLO<;<aDCecCx$wyM&0&b|-Y@BT15ziG9|
z_#szzFX(4RR@8>dpD(%hTm9Mc?reii^^KoDtfYPU&t5wHy7`qQfBw2P^W=D*Ke&AQ
z!mj7dHodmu`yXXYFVMez>)PB$H$SybZ+^Ep{%LgZ;r1t$pryat_BGa(ZMQjl{`uDG
z^BD!E)8%^I=ZS@U{`xO+{Wl-~@82G#)&FZuoFUG2-+TA8n}>G>$h`;cE;u1>XSyz1
za%ZT%{F#?K)zkjh{`z|1-IrH8+r{2k?K`)kc~9C}i^`qv((R)Be%Q@Dy58c}naA>7
z*U!zgvn{#)<<&m#ihCcjG$zOGou2<T?Eb#S_B!Ty);n#A|K54|`0>}AM~@bsU9+=f
zrl|b7&o<Q=di}rizCM?qv9CjM+F_oTv(A6$eET-%bJ`7g-s@ZU==6#oyS_EXz}>F&
z_pZKeR&$q@uY3LC-3+T+XWAzRo@Tjv^7(@+Mla6>`se?c^Wof?H5D>7S@-5-Zz#|G
zx!unBkFovl3b{%B|I7039|+#pSjV<~-rf%%x0+k0%g>j5^{r&@srJeKwP#<>oV(TD
zc$WSD10@Eg!Xj7LtvBzI(f8%I{{Me-dHu#++ipi*NZ<ASU7q;`-mMGnKJ8D^5aSW)
zNNQrAwJn3mWik7)3I|(*iz_%k9yl_iBFDzW>rvyw1I)dKhFa=syx*1x{SjVxB99|r
zg~&pY7xEi6?Ee2?&%K>>?{__m`2P7!`MIt8*5BWLtycYfb#GzsYpKU|?|z<nemA@J
z{=Miuud?k|e!R5u;F(u5?EdsD-fVTuH|PJFt@|Ipc=E?!kCczDA#Z(AxP?{JjjCM<
z*G~2CzgnO9WmUM%wJ(p2FTau~Z##eWeB5RG&nxHuEdF|V|L0n!zdUDey!Zd{^SASD
z(>cMt?))D9!f&EJZ$Dydym8O-k~^P;;`b+rn4DZD(frDc`>I}(w0&6I=1Wd@B<AUF
zbe(MT^@+CMT>teM_m94^d(`>t%bSchyMI3W5_nzx#QYiT*H_4$xzx=zJ%&fUoqv_-
z^czO%mB(L6f9KqDUj0G2(f1qY_g8%V-JU(?-;<TwmsPJaSF3wB>$f@ctoi%4JY4fy
zyyvWtkcp9>uHCJ^+qVsSeOEnv>Nw}@;gy~1w!U2&+Ws(o|GJO9dt8leYuEp=u*}gv
zXZP@mi~H@ZeZkL{&;5C2{ik_H{g<!b6Ue)&^xno_M^?Vv^Z4atf8Xb_m-FwaUr;aj
z)>Gm;=l(>U%78cDm+!o)v+LdFSGVsizLE3wT>qnax2w0VfA)npZhwMOiQsNVw#wH*
zhs$fW1^$h?eD6qBmAd~Oo4)PeuWr4v`AgH?*Nz{f7K`nB{Nzt(e(YxVnuoi>kAJba
z^{nuv=-lk9v&Gz2i`(<~i=W#hUi{<Z#m=jTI<G!>GXK-^c}M?GuswJ6OW(4`PfR*D
zTZwO9{+RvvzdsZF68`<MRbFiz(7pU|#?yl_cg5Wg+kc+t*}QnF{KG4ydh_;P);8U9
zqvwfU%!gmB!i&2ND)qk>bS@Tlo_FPl_{G)zqRa1Xy&3)g!K(5->#m$PsX8n9$KCjc
zRQjAhmaE_Ie7tk}myq|>hgoA+US4tfEwBD{`<mb3rMF%j3Ak^Wf9>qS!_R*_KKbb7
zjeB}czZSH<efi@={Mxb~jPn|vvwah6Ieh=qpY?k_9zVT4ev9m9v+Ex(e)eYGoo}({
z=d&$&$BO>VtNq)Qxv90YI^wknU)s`bm$of`%zpjX<=%6z-uPdyweR~o`+3bXyZdJ4
z@te=@sW1KQdGGuDKWB`eU)ZHT!!FWRz4CYP<K=sgu2-+$6M6Qu`uC9feF@iY|B~PJ
z=KS}kEWdu*?ovPR^Ga6z{eO;mQF^vV3x4(g`0;yZ-#M$Us|#&UDB8~{KJ>XO^K$aB
zwWiF||NLUT+#Gi3S;oR%muBu~oBEPUZ&<}7UqAY6cjbz6{^D^mBJS6>ev?1?@zdH5
zL3{pNd|Ew!q2$Fizi!mOUKaNM$Jd6p{LA}y#g$Y<{qefK_r(u|`!2<^<`;f{AGJq*
zs(tadUnO%7T-;pn?avokKl}ON`>Qt0|NPFdQf|*Yn^&I_ie)da*<n0?W{u<TgCG6l
zWY<sM%d$S+U=|B!qWK|L^XX?>`}?NN|JU(+@ov`3-t{N8&uU(rnNwe~<?Q^I!H*js
zK6=0B@s;^e?w=of>zA&u2VX$&R()2?+3o#&ezI?$yi|8PE-bQrzwKG~--W-c^{xM<
z%x_57-2LXpx<cXL_s@Ikj&9ehjhWoP{rQT+>()MNv5wjk>wjN)p5E7Ms^vGsxBN0$
z<-GO9{g?mceWcPPzf9PBZ%UMzKyPo!naz)`NIlmvmJ*&l)55#HuJp%(svld<zs!Dn
z#bvc!_T2LGN2dKf*?-~R?!M-gH@WBjGkIlTwe`r^)u!rg7b6~S`m(rj<;5*}h0|^Y
z|65sIu>YI7KYwxJk0aZEEWZ1Caw${Yvc1|eA(Ib(kUiZzkN<pY)aQSFX<3Wj9&I)@
zwh-q#_v_5pEIIb8PkL9T*1uESx-)Lm|1T9^)Mwl@`I)7W_iD4D^z)^2XCEu?zqaPp
z+P$XN(y#8e{Cnsl%hBNO_K)s|``dq=x3O85{@}+wvGBdKFV`1+6O7}jl)5c1oBKQZ
zexb?Q-AC8g|JpJ?+;;2Lp!${dSBs0~-*f(u{B~Y~{jCSz$Adrrv@Cvo@1btJ>$E+8
zPd<+Qd49)_dAra3TATH<zy0C8wErL1Uz;3nu)3LddT%N3b>~AnUnG{qdfR2299;8a
z{_cuPx4EuYR#-{JR8-A6wyyO2%8Tm@kJbKPd3NdZC-Y~o|7Eg$SO2}}EpyZVosvIy
z^_Oz}`KzBb>tAho`@GrxbNr+IJa^>fe{=qb{QBV8v-1|a)^$q@f8P7zXXRGO+GqF9
z%-U-`|Mwd?+1I5<cJ{v$@84^B>BUO3>eb)t!f$;m{qus`ZL^rn(JhiW7VFFxT&q2F
zu|!r}SI%tujWtKoyX#*)U3vM%=3DJjw!HZQ?2i{dKklj=mM#B|<LB;uk9O6G>}LP^
zZt=C4l22FvE<MKn@-eUa^ZdN0{pYjZ&W!Kn-?uh?e((ElEH=XKv7d`KXQ->sKOydO
z*7%y0jF0bJ`SQ8{R|&`+&kqZDJM~YmOnuv4@xN;7`6939?)iIicJ=h%^<T~>Jafz8
z_@-81rgfe9{*8a3XJ*IMlx)7X^QQKd^iXc|*S{V~zg6A0_{W-Sd(-Dw?)YMGea?bk
zSKQ_={WoFnKbuRzGp63z6P<N&i}_C52MeP<J+oTI`AGV$Zp`tE(ZzOkRdKJb=Re+U
z&uDKw_jmd=Q=8a=qLZ8d%sJ|KYigUHZsoO!$M3JaaC^CoT}kD=^z&D?f4^k7mh;)U
z-}Cp(IWJ@5v$y)9eQW<e7Uw&@g$JMIE_rPd>@FQAvsOaBWa%<Fp8SWC&DZaHbS2^Y
z0oJp}UEOETvM4S5{3mPe<>E&Z<NFg##O!ufX6-l^egBWvJIl@Ywl1DmY`@mqm+$O^
z^?zc8k8kg?&)WYtuf|+`!u;zo7WVfQ^rC8#?DJ!uTS(OE*VxFG%k9g4^yOtl{O70o
z2fv)SWZx0}b#wgYr(1r>e6;oEzjy3PUgX;7x`Q_^L>l`>-8Nj$yIR%1=2`giO#kAU
z3)fe=$6ObFefiI-@RGHnk8fW#oEy1vtNUKti)#6APxWWlCS`v!(f-=^GQMg1x0zO!
zTdqHObkD!y)`uh;|DuoXFW=v@-uIT}&zVK<EPlR9Z(ICzGq2fk|NB3$xHZo%tckq4
z{CUS>!T9Rdnyt6`t2tj?-u!Id)eK{IpX{<NSv3bwUjDFGWcT^6+{Yf6y#29KaqU}+
zeR5Nxp08|wEa>iR{q<yF$;-)0&-dsbZSMcJrY3FU>BQ=)|7+h%zJ2U#Yh!PB=Zg99
z<goKEExx|HT==>#>2G|KZT36o{hN2rXWRe#hrq`d>DT}K+4=qameSQbw*Gq1^zp-4
zi&80j>A1>*U(uHfw-i-;eE#_ACGUGyG0CsP4eOJSe|*Aa{`ky6^<{_IHy?_YZ8!F=
zO?ut`=(V^{{<6o)k7cgy?EQFdPo?RMs3g#-`F6$8lWTq*PW@<?a^CvDx7W$%S9ZQV
z%Cq%DP1eU7+V!u6Umsu3UY8a2uOM>Iqs247xrm?1`p;ba&+@Bre))S=`>)2!xwpmp
z*nj@knYrtF@t<FN@?Y>2#mlPCPhTb%$Mf^4W8KDEUrq-ve;9cA^u8BX`F!Wuzxv*N
z6}97LdtOq>+PQ__eb?MGJQq`GV0BBO_eR~5x4yjg$@^YZ9y(j`>+0<Nbq6IDX$BUg
zZs`=gwEAq!`*~A$R2EBL{mQ$o-^}K1m-pY?Y4>X5_wxU7vD+M+KY#BdHNW~_7gXl`
zdv@fY&fZ7cf9&4(=*4~2Z+3B)w*Qq~e*H}N-{{L9*ZvDV|GlyL)${x5TQB+PRf_e*
z`|N%cwD@&#Y-VAv?PU9}*Ivl$Wh=?g{lgQzyX&lf|CPz>ExuZ2X9e?bKg3=6KT*D9
z?b60AC&LTBzxew(et*I;gQjOz_K%_`|H$}wdxOlj^*fK`HM!lh+IsTjLof4elU|c=
z>)ZV8vcJuglJzYLf3-K`u<ARzhfm(V-*+*h$~X7<7RO&V`TcKK9)Bf#-XwkN&Gf1D
z9RD^~+pM-+zw+gt<X@ZT*W1^BDfl*t{pj0#J=-UD`{mrP+otPQ{{F%{UA0~O)05;^
zR_`me1#ox0^_Dw-XS&_R3y+(At*zSP=abH7x8mBI2;R2s^G|+^*`L6Z&D<Bkr#`>t
zT1MCm->r5V@3dL_-`TU{`K2@Wf+x?p-*aunR=vXY*G%R|_`ZLVbnE0&zr|*s-)Z~V
z-%F_YcU32<Zl~SBZ`<>-tlrO1k2${9(<c1eq^tA#me)P|b9R6JzpJ*p;<xU5-nV%1
z%z5j!x}Ra6ef;2+BgK9{V*Wfcv;SKp_iw?``Flz~U3=7&zkApE8-Kott!6ELxcFt%
zj~ENvTgrL9$E(bz+wIMmwfOz42;N7JkF$bOLQ9FONo(dJJ-)Qk!|cz#o&WYKzwZ0H
zza@7jFWX=Jx|Mqwf1G@&sZGdqdBytI*3Yu_3fEN>pIkik{Epujw#U!4pQTfLBw()H
zo~8Al${)VpXMFC@)lK`?t=+M%eErn2qq4ttf6%I%_W$b7^4ZgW+}_-k|MTZf=K6q|
z?)y7G*<8=Jd*UDe`Rg?I+lKiCzY0yNPTm(Si~pF_|1CZK;+G))^ZQ>dU)C?T<>c4A
zzPzODBeu<Ure7CGZoc>DD>vK9jcftJRzKG~p5J}f+&2CGlgMx8kG(g(`m^EnqX)rX
zGph1sKeIpIbpPb`{~CSUzl+YTOWzpz_WJU_C5|<ZzQldyPcM~ur&(`e<5>7Z=Xdpq
zxa_9~zm?3n^`+f9I{&TwS^IB4*Vl=?OFnlzefA@_jki1Qd+CbziMd@bEQ;Fta=ZPm
zZ`;l4w4?SFthMf59)It~=h^kMcT}(YX8zjt^v(xA^7sD#*4ex{|GL#X%ZK6Bv4vG<
zEWfR<``cv5;dUXdCP1e5;TGY=Cl8(f5hU~V<V?f8Rl8Omn;K?oXS*;?_<3Af{J*Ju
z*H`?1bJ^x^@SI)0H;J!UCogL!!I$q}v`bXp_ge8E@xy=Hcm8qQEOj(?{>Iu1em!>F
z_K&~ctS>qL@b35Gy1I+UPV;{}7dEeI{mIpjn<E4ER-2TIY_B`^cIMXYC%^LUk}v$#
z)hz4oegA~<caim_BCE~iGL4PB_Xe)XtFP$D-(#}(|BkwY8H)sZ8ae0RF;cLcYvrT6
z>zuXU-<77%x7h8yval*EmjC|d<#s!*deUEAQM3Q8UVrkE{5P37`%Yd>ye?#Zo<DQB
zUZu%hdGRx^_8C8)TT`_9?=zOo=l+=Z{|qnw!dDmdclGb8b3fPqS^e3<D*az)?Yxyg
zCC%2SFSfceeOcw5D<_(RFK_MFI(O#H<u?m{<ow?||61$*qyCp`!wO#?vDLp*{B1pZ
zd|H`(b;Xzcu411~T-YP=N%g#uhwOT@pZhj?Hy>s1zo%ln+_-yPrD2cS#-+=Dt?{kf
zS}${@x;1#R4Y!)v=AA1&=eaT;{-}P=Yptc>lARsz?PrM}&Jc>WEf0O%Y*MvHd;h;*
zX@2*&|GHT7)%{<``|$6ca=df@>i;c$_ey@MeeLEq+J*0{&-vS){wKew{rt+ec7ZDn
z7u;Q5x%Fi0`A5wUGiGP!CS_-RkQbdb-8SuH^}N6B!iSaD{k~u(9{(w3<@ZC5rj|VV
z*OV*QpS;c86UOs%eSMRs;_BJ$*>PuNa`f))yt!`szRJS$?<6~SyWN+%bH!9Y?&lec
zTlL?2%dW0AeYGL|+z+v{tIEGyzG{sBIs5YJofWtBm(7*P*W2}S{;wxnI&Ys}eeZYH
z{9mW;?<#-#Jv&G5&yHv5e(N{?T)Fc6@9WOCmGkRAz0A*jwc7Og2b20^YpdF_|4)22
zeU`n|{yX_u?{3?Le>bt5ck;F1lE}i%YVB`N_Qb6GD#}~;%6fVByI<-v_BEQA_ed=F
ze6GFj_fo(6H|%CT2+sc2x6jfzOh&gi@}k-Gdl^^MRvmnI`PP-ILebiOZ#kadTa<n7
z&dJy5Y1LNG;tQ)T*=&El_TM~N|MT8!iw#YbGgkWg)E-^??Dbb~)BE$D{dtpJwB_3y
zx$s-Y?=1f*=l+O(_PJiFa9;hph4pObcm7{#Yt3Jr`9%1wd%i>*PiFJAHKlTA_k{0z
zEzXmq+E-~dA$@}Axd+d#CT2$+_x~QWW&4k_QH8IbT{u(w;N_P$dzW9cGd;nbxw~(%
z<zeI8tgv6@effD=VOvF~#})s7xag{I+xA(r>$aZUZoX0S?BfMdpW;?ao~@nq_uNt2
zlg0Jl_8z+Ww|(}%0`2{kHbr%o^#<Bsuk4cBS3K*({9{x9ez$#c@5zSu=HG8v_Ex`_
z%3CD)F>1$?3XjFtZaouPZK}4dYX7hDy^o)Y_qZJt%f1tHyr!h+#_XAezaG3O6sT`2
zE_?64c4yz^>vC%I=gjY8J3sr^s%7iKOZHwVED?~Ob8B5`j{MoPJ4|2Rt~{P~wsg+E
zZ>{+`^~a0tv(7H}|LnfecE;-CyFV-suRD9L%Jp)!_q@_)Gk?vT|MPjR+wHoq^Xwm2
ztf|<1>-yFYS!-uYRc03o=U?<Wudeytc<0kU&+h&H_dDHv`mTLDX8QNeyW8LXP185+
zqRO?^JNp*TeEsWuLR#X~<uiSqtSU`{m%CYS{QBqOhl4MppMI2IJI}cK)Y<9mN8g_B
zIr({A$-}U2_qD};o89a79gE&lwO#+?mu>5^&zARREbBAdV=*uE%z7~q`Jc1@Yy6#V
zd;RRXZ(jq?z5iV^{dxHIlAkwI`<}{8mjAdV`0}6Ma@Okh_20Yar(d?w^_^e5Lpk?#
z<{AIK=8NAC9lu=o{Ne6n{gchV{hR-lb+X!-3k&XrygqW#)%kjz?IPbhQU4Oe?mK_`
z<6oCiR#bSN^S<fFCyyU)uiqVAdFbPZvvb<)OJg1_zWTS%Wc!!S?;h>%BV}hx%jSMR
z{8>eOeaT(_y|%Ke53f_TdvyNU>dLRn&cE?qY(Hn0^1n0k{@1*}|9@cjZTY>=%j5Xo
zI{#ak{J-b7PT#qg9sTA1WTLd&E^dpPXXR^PlXq;U=VXi3dmpu*I{dsV`2F9Q{Ry`&
z7+x0Kw(aqYyB?3OR2lTC-zePj#b93F%dcE^<#WHz*lcCqZa+g?D(3jb?eV?S?5$*M
z=h(iuW&HSw`|7{izUO1F9xm<g3!eRN=Kd@9Ypc>8tt-8=^<=ty<XX?VCDxDTfBNib
z+#H$y@5)aFe*^7*acjBlKNq}x`NKoLZv9tIo6@?~pRcdnE4%!jU7>;1Ey?A6$!zOw
zPS`(w5^VojIsfx@{TcUs%(DvH<ko&Gk=a}GjcdNP4X>>(&-@5En@=v;7uDZK$exQ^
z8~(WcN5;{Wox95`?Dj4`ZE9;_RlCc*`pCgG#*MQyykKVm)PL`Km-BUx@!i0)byw2+
z_`k&+`C>f3=6CSo>+$E<KW_i^wR+`ze!Frz`Iw*2_ueR;uzu&}A3J|-j(cC7`*rh-
z=jNa7CjYo<eav-sgj`RbS;oV(d-tv^TmH54<wxWBbzh&Yk2lCPGH)|}z+>9)X0ws~
zvTL)s{B;T2*yCvrtd6s8zV-jWo_{&<#{<vA$nU8&zaR5D&cCK3=<(x&rf$C14SDr;
zO8D`~hj{OavMmm+5081j`0<zdJ8ez(cNJcUvlrR_`|gj6^BwGyW$jIOZmraNI`5+B
zb=$@BqhgY6)_Uh%i=1<7?dtERivKpfOzd+1A+uJ_cFuiX_413(x1Mx<J$Qc3d!EWn
ztM?JLO1|&yrD|Rme%pD;^>Nnwp2Zi_zfIkqUQ{Hpwyq}ju<x8%=d9=1{nVAZCHl$w
z|I}wa)$xDQzwgN2Z=(L-rq%3wvwr@*zVBMA|GrD@<y+^g->|E_|Lyy6oxe|duj@-3
zPMB@gH*=Y^?9nYR6_?G8d1aDioNu?$m3{ZM!Y?M5cdxp*=0e<+UF&D=n7VD}i<p<!
zx1RfWQEl6q#*$Z#rYH3Cd!u&rMNhVPo%@$RcHV!>?_clm%`f|3{J#9P{V(AUyDyv%
zJAU)vl@sY}e}3`cvwp^XJUQ+8qZgYq<TgD%zw$D>zJGh)<oNvwla5?aE6j?FeIIq4
z|J3#Qv9D(=+IeK>rjs$BGM>JjZC<>rfBoyuwS9%#ld7$^ZGU#8R)5C=?NX`IowX02
zI{rHnZ2$VATXXxbdyn?dcyC|vh2z!S9pbugZs~sXuHF9S-mF@t_peyO&ezY2J)b{e
zndQene`j0H{i{~)YF+JaZo6muqJLFqC1bCDz9{Z<VxQnfw}XAp6@1T6u%ET~hTGL<
zKK69BxP6yCu^j#K(ckZFZoxb6^=E=!@04AB@3+<G7pA{IA70np{Pz5ut2))e^XtBT
zkiBfG-ex=hAJ5N>d9R;0=fA$5{@AW@vG9j8Y)7|z{^@NSqi5K&{I9#se#zdq{Pxec
zhn*1?S-mxW@6OlaJ|{S&qANtCSMcRBJWBi_`P$UBNY2jUyKeaN%j$a~CzK^shZ(-(
zIosj(zwhn#(pdkTqwCpo>Md%oJU+^9-8Zd%>Fb@cvl-9Mx-l>G&$>UGx7YgERbD?c
zf7dl1{<p_!nfwlXzNFEYcC7N<Ay(^SzW(Pga&Mdej^pveZnb-HSpjQ5AF&OVSu1t_
zE4N#qqFT6lc>K%5M>j`p|M2X>p=X7{#*_65Uzwa;o@OeaTO=ou`}ySVX@6E;Enar*
z&WDm;ho2SpzPiwpQDl1F{jx<VXmD}y<Hn2ov-jUyy)Wy+pL0j`zkZi|Q!(GcPvQKP
znt$i#ZN9ql>~q7q+OroX?|=O#*qQtMt1JV#+MoReOLzavpSU!UWy9<<i6#cORvvu0
z^1fDhvl-X!@a$(bdv70?KJwX7>idREu9L4CN9orE?7eof|H7Jej}x-?UVpN;f8F+X
zC;XZF|2*8h==7z2{$<mC_=x+4z2E)y{h|K`iF?nlOPyBxWnR?eidR?6-w8*|b+A7l
zJHN(0Jbiy~*2|;Dzqh&N9xe4<e{Z^l)xVX&*>y{gy4L?~@|<+_sO6T=>|Y;CKhKRl
z{_#xA{N(}pwv)_{%j+3G=sI4y{>ZPda@Nc8-|R^Di!aIF{6^RIPJD5dc{=~YqK_BX
zZ7BV7(e(blcapwgzmNRcQ&IUr%wGPF#b4X(<G)#+ajuycFLmCYx9-uJ=a&4}|8&i+
z?JL@EzM(X&#COiD9k#~TnCt&Gy>yaNjW0B8TkfgX=ARj~{mZ2LO*VV?_kGQHmy>_-
z{JgimbL$sLy|G*C8>_o<>!T}u1@ClsJv$RyxWy#xhI_SD-rtF3Szq{8`Nmv5^!3eD
zxA~!O7k^p)Jr3l6Gxs|eKR4gE^61N(=fAx%-fH8XAvXV>K}}MI+#Zp*%z~;@i(f|U
z|8QM@hDw<EhKV;D+S>g-ca}_;uV>Tuj3@l}!t2XFdhDNde);_)6=AcUeQDjyo_oD8
z_;*O2eaXw@m8R2Y-TCumhl2bS{Tnj%KVI@rZ>>LZt<F~ZW&a=B-L>D&+i%>Ob=LOj
z^P4;T4{*-0wRb<CzvpA>)@8}H`is=<!p^V#mwUDN+7Ctl_v$kHEpE)}yZ@spQLSl~
z>Ur1eHA&t5dNZ`U=Zmd6{ZgTBQRKs~2OPIP*||vgd|lRCLH67I$5qdJ&08975Pt1S
z+=<`(rIt3A%42ip-Lac=K5ECh%O>md_zz0D=kH{<tEoP8^YoM5$E4?2{kt}M@2aiu
zH1-{pe-93$FQ4z7myfmIzxJ)gt(S94|AxKz8TxwW%9W273xA)pvwdZD?(vJh?-$p1
z`z&6N8hkQ0?b<B=JC$3CHR>nGUEg_g!ZV)R^0C$7zb|$7#oJY1Fki2~KBhmxf_wfP
zci!ujuV=>}wN1aayX;EwJ9VpDSB|{g+ZF%l{k}g{>_^wW{#g;X^Y`<7|Kne_|M+@m
zhyMcq1IEuJC$S%$xA{lGUFAZP^O4U!mgKp8Sd*W%<<F-DJ4!8zAI|xFOq@q?4qK%`
zIKL44%S-L+Y+qgc<Z4|EY3F=-e&uxY&NJ^S&IM-sKhmk&`1f+#{JNNGq3FBDb0UqG
z)pNeGOg|e}D{m`*etygy+c2xzTbDOly_sd9VRrscLY7!;wbioSNBwsf&Oczoc;3I_
z{QT!V+kO_jU1;fCH|xjl_C3$l`1*yHAOG^`%tOQVm3JiL{&(pdlQUy4y(c|~dG|HL
z|NMV1@W*~X>@9vK>h064RSQaGC%>qk^0@!QiTWeU`=c&Iz17|NtUt*%?1#|#Rp+1O
zSvS7_Iq&_>-_zFDeSIfh_fR~~IOl40JyZPNdbzqk$Ls&RJ01V;ll1pju?q}}|9F3V
z@qPc#FYo^R-uM3Zy2pp2AKgnne(~&_@<nkE*Vi|7R<09Urq=#eaJkww{mLKv_I>Ql
zk14fzsAI^Z-)FaR-^#NyA1-=r`gz^f_&dLj=<Rz^)cV|$cY1{G4BOWie=jer|Ja#W
zT=jKM-{P%{wptyVt600?vGMuHwbdnOF2@|-e(mKw(Qk4`-mm)p?sMJT1AqRWzgwAh
z<&R!_c=Ou#R{pOZT@n60*I%!1-Q#tt??hwQ>3G<eo?O1)RQ9zfsM{oFBf8wN?W==y
z_P(88dfxxu|Nr-T_67d=9_LS%-urF5cxS)XyT7;6)7Jhtd2|0?zb)ytFArb7WHRsS
zi@b{$>SSKz#96&QQGevTrTZ@BdH+Ap|NrN%|NkHHJANM$-`8;KN8|hh&+WeN+^zrj
z*!_y{OZ97CDqDAMzJEW`d*0K?Jf8LU3bTWj&y+Y{eEqAxLC>sH;U1HFzaDB2K74le
zjD0VnX78F4#&`I&wdp6(ZS|q?g|_YW_mubjJ*)c8?&8Vd#dB-F2G75BF0<kc$12BJ
z=d8o#S1hw!{nGid-N)^ZCd$vZOW*r)8QcFU|F6~N-L-4H%K4>uTGjK_H;Pw@i7Z#k
zKNk~o{@~hQpH`lf{#iJ;e9kZFcmt{J8<KsS-D|GzicgZ;Sam_vSI^Y=>4s|G-l+Gf
zSx?e$Y(Da(xPRs48TTt6Jv;jHxVLfjWrtnojvjoc+n2ud;QFkGKZMh_{%frKTNzfp
zwyGoTeq_DY{D1S-Uc2+gy*YnvRI%*moIC0tu5eaNd-1IJ%1(=UeUGQI7njD%%(JhY
z_Gi+a`U@-D-|wjYeBhez{WZ3~nmmJhl|`~;VhUr$rLR<dTveV0nhpJCnEqk;zE7W7
z^JBls)E@tHc4q$n%g(!RN#{?Pzc2maiz+vZubU-pE_NjT)<61j;k_?iuYVmE{ciVc
z@7+!9%m2jgUwZ%A8{re26=K5GZ4aJ&*#76=vFxMIyQatQe{m%1>{*LhS1&Pd(~tSQ
z()L%=%ig6K965T0*K&Rwko)}dsPW@(Zj1SX{qK0|Z=Jf$R`&SifA6YAw*S}gJHL3}
z#}#L9_|%oosCpDv^>CTl*KZ{<{?~(Nf6bWny5iSl`|`7Y?XTA_slUB1|F!+C>(A`p
z2wVLA>!~|E-T%%!$?expww=BjWorA>eZ~7VuQ{vzcHI2`i*>Q0v%qvk_l=Il%I-e{
z=YOa=cx~DIvzMJ}Om-ybz1EnwIqJCdk;Bi@=Iog+`7o^R_wweoz0>*RdD`cDq_4A*
z51DWAcV)Wi{CQ_r9`r7(*mcalbnVN3#?P8BZ-3NplD_x6O<K+!^#_)XeoH<dnOD7H
zo!Al3mFxcerJpOB(oCjTZ2dB4>oe<X(&9&!9{<X%<|(eMl+vg6x}$!D-TUD6JMv~;
z{$;uH@5PH|^5?sbAH4ayWB#sp>#u!Ipa105g#K-nGD~><Voi3c-JjRD`117fZ*!}5
zTD}c`{qtdl+I`bm1$)<DQ<=BAHa2_T<7+B*t7Jc3-v62ZH;awB!San&=fZ1VKPvaN
zi~HOBYD4yF%ZGhp`PaYZ>V15YE_e28d~jT@Nz)p+S!!D<?lk{;C=6;@zuNnS@A}qf
zS7&V&-@3pwyT)MG%7bVBp10X`^6S3f^G4a%(&Tjcw%HekWmTz(A1>HCOZ@N)_(;=-
z)sGjyu6<m%GJWsb`2OkV>_0ExcHOSgj`6&<U)|}?*KfU?&i?h#QS+VaRIf?bw^WtN
zLS{Gh!?La|wm;aC;v*xRJo`%1-l)Uu(dA<0{V#sZjxW6EHrX3=FZ%b;=i!GBe~2`;
zf28;5*NdO$UpnsoWS$;kF>k?+%3BMn9%V$C|GgMdV^H(^qruj=AI~y^g4;`qI`}`S
zhqXW4^yEWh?T<Z2@Bfm0FZ@FI#OKM{=chgA{<it5+}DD){`YEco!|WEQT02k*V|Vu
zwU=v~{hPo1Z<FW7qqzauZ>-`Cq_!TDjCV1wd6C{`H+O#F$MxUNUf#O+@9o1bwoT_F
ze{EU5bKmx7FAr~3`!kWx{=M(Ix+}(eqO#AviF)73KZ||2{m)g${OvFPnL6K0>f@2;
zKlFXS9k**NWSUn!W7Bi7bLr9d&Zqs}?fz)pSL4}H)9m<f{wiLYd2Zep@3TwUqLts-
z-a7a&eqttzWYdnD2D1<PKDoSn>kiRbqP6-vEl(CY+MT#vRhU(>qw`O&xA?s~*W`|-
zM|~GuUwhWh<k{)Pmv?V`eRuMF{&hdDeE4;;*_MBO{DmxCy^1IKzK@pwG3o7GyZ!6y
z&4u$F<{!BD`E|K!)P8Y`%B&qX)ptgfL>kv8oVS0z=83jm?5z2*!N&VbEhO%L<z_pn
zkUyvQ>W4j<e?r!7y(q6+8)UwGYwU8)N7A?JMP8pZFRf~SFZx$-`zqhu@2_sy&3avN
z?d#FQ6+zzjVvd^}JgNSCIk)-Gb*kHz<y}2}FMR8l%C6`AW}i1LQ@?XDZr-QkyRU=F
z+=^vEuhaX&YVD>MS)Esqll%HKI&sgpMfoK^`eq+y|JncOp1kjcUH?QSmD<cw8_u5f
z^_e%_&(@;)n~h<PuHKD3_hOgNw7T`-QO41;>hJcHc0Qj~Rax?j{qXv0UGasNSATy}
zU6%!#mHhcsyZ-u-ySsmXy3BfXZS>E|{*t#ZXZ#bZueo;Tdhy?1Ie#|zKX~(V_tT&6
zFMsASQ};Xj>CGwWml;hvUVN}wc~NEB>dW#U?@pfo{i1k}TbCo-)+gF_GQJb~%Z_eU
z-?+5DruEy!ty9;37u1#CXZuJ&mS1m=#nvM`b$0%HSb1d2!EcYk=SaQz`!LL+v?wF2
zsPH?dzjR#Bb5Fgzxe;$q$jkapSoha9c<%GZAJUJ-{buR&JFxl2`F#7$A1m|J=S$T;
zT0YHAd#;^{V|A9^y$@e{OD=xse)!~P@OHV{gC&<aZe2L5CZGGtWJBq%hfNnF-8cTy
zy<xk^ygQul@Mo6dulua}w$<*r+}~gJDxE)WUP9Ps{xiQem&&fcn*Yvz*SFF+x9<Eu
zlmGFx<dgQd{&U;Ztu{v4gzZ>&`N1uD|MR~8V(M+G-wH>}ZAf1^e`no2o7o@z;_T0_
z-BY^b*tPXZ|Bm%Neki=W@3lot_1k8%%Hyy4_a#i2;FxU5vz{&3+vjrSqm$`j*^~V1
zcj(+}fAiA+*S+ZP2it{jdzWvQ|9j=o>W{BoSI1uv<=ywVAhK#zEU0Dtb53V|j{ots
zo_F?Md2#j0s~<1(_htXtQ2OY~kzzjio<1?TpNBt}#@kgqdwzR|f5N;2!RP(I%(J(s
zK4Y`%+PNENeh95D@8RCH$X`Y_cf(KbPp=kdn>haInH;@5-oV97^ZJdp$+rtk9(C6I
z+G4iRE@_6{BkvDq`0LDmXWWZheDLv;nqL<lz1?5CLm{>%DeBIgqwD2r&KW(|?BA(<
zcg@S2f3%J{?p=Q0)^8sFs>2_4p8JzE^K82O`LCaIL5r>)NPe!Vj8p$~;pF)ZTUX!c
z`Qov6{>x`U+52Z+e7ta;aOE;R8(rR-$K206P6#ZS+5ACUH{NFLWb@<w)meOVCI7g4
ztk;*d+bMO<F8HwOIj?tB3D@Rde6jfWncFvKeJJvP%@Uf{X3P=%7dEHP(r5n7+m=h+
z+?Ctk9^cDd|LfgW|AcuB={(Ec-JEml$=capqqEk2jPcJiRhRlTPx@Z#{?z~4zVDUy
z-uuxMIg@8@#^E2|q*@lYKFoZy{P5+aZr5jh5VNa1{>pvD`l{-y1$*beIJ|y`vaRlu
z`J2Q4Rh-G0^JkS<pI+fKN&cIU&xhvzvh1t)y1d|5^)@NJoe}p>mi}G*VK%5K4jS>e
z?^S;6<-?!7VQbhvUVPB>u=wGZfW`A?tz6E%F6?~xd%1^TH_QmXQB~L`(bD~0<C^)`
zm_KWuA9t+zE?_Ud`}xg(!HZkJP2BT+{XMx`JNIYwf3bOWaOd&ozs_F2%wuEne1+fl
zZ8v@!Y~I;-Hf!DE{zLiCj@2@)7LKs3556w7_1Tfix}$3kv)Vr1EH`g{oLuhlR}ZcG
z(u%~BK3?3{r(FA(+wHOI{NPo!l1A)?-_MrTguTBfdwjCx+0r%7y+2(0`}%J2U3<M1
z@_PH8?e_mI?9ZPYaR11~QvZE!g<m55zt#ur{TK5yKKy>{mG56Ct#kjk^Z(*|?*Ekk
zKKsu3g;U1X{`1f7bvr}%JUTP0coFaQ+QN@#BIeH%%=@-<_Ko78*|qE94W#_82+ZH}
zI8>IsI-~k%Ue%(iUn*hZ?bm0QC7DG2kc{s-|HI;y@V&S#*}26PFZM|-4i{hDF3x^b
zJ9fvK(DffarmghfBeMG5tt0OLu2j90UibLgoU7+-HXqk|-mZOC@_W$z$n&wk3;Y($
zpWoMCSHCDTHfjHJ+4jTc&r)u`UozXeD^t3E%gmWe`6}1P8@TWkd^)*%TFtu1_X{^q
zi;;abJ?i@5?fbu$yfT<~t+fB-@^5#x&T4LcrgD7d<QUnqwXYv8pKo^K-;0dd_Ltp{
zGpFBwl66;{{rQ|{)_Jkt_f4I@Yw@3)XA_tI-2SzEy=;Ai`i1@BJB!a>`tvt4*2I0+
z;>)k=(u;59yA`kAQTk|}_`2`wK`o~yGb8`t&$Ax%efn^Bww}davsKIb{Po(_&b0fL
zarMCyy{2&aszd8a_pExH@TGYD*-pjy0Gq!LXM4YS)coU1e*EvV%R2pR{+{jDe-tkN
zY}L{H()%Y*HfzUz)_&V{***7}|JRt8UvKU3fAE6E#{A&o=l@sU-(T@HbFIWTo|tb(
zXIs>S6@NPUP+B<sBHP(RYtv%(C(MxSe7N-Y-*%ZcacP&^H%x!6d%SF2<;PRvdiP>3
zUUaH`x}o}FOK|(zYR^5d?#`Jv+1P%M#HRxp%lgW`Jq`4~S7$S)ZjYV+&zC<G=Ebk$
zQ`hIe^hK_4Lfy0T;M(|rP2=Y0>$5*r@+I!bD0<km?%CqAvuyi!7~7eC-X+iHHeGf8
zjHo}w^ZWl@pOS3Ea%{%ZYZCjU&qcjjZCdSqd5)cS-!!-S-wzsJeGv}kXaD;1S^mFg
zyYqi7bHBe|{Os|MiT$?OMaJ`g+wZEkjeqsLdG*e$4?c_2;?M1$xNPT_bBAIlo%*<8
ztM)sw|LJz0XYRgUFZTGx4*v%aS!~`52hW{z=Vql^bJ+2<^?hOMqc8Mye)RL(x9aPf
z*Wy0XcNh}yzsQl8Z(94~dD8jK>qV#UE3VtIv;W&CpR-?{o_^Y1_hq^B`>p;DikR;I
zjg8;)JN38DH%^&34*P@mOizg3b2;s7wby*NtzRBqFMhUm>C6@7pU>Wu&Y4>od)W2*
z=k@Uh9%?&}+17}fo7=9II(y_^M%Kruth1#ucY}W~zuv8Gv%d16{V(-@Ma!-KHTXZc
z|9kqrAB^|^?)$n~c*gtw&EI`~t+{9aL%}}8`(8|T^yC{|b^C6o$>kQO&3XITBRTKG
zuX2Z3$FE3pt-p4x?`36kWX%R!cf<Fq^8B(kFTW%A#If-AZuWWRJFeR`)-wHO$+K<T
zll<%N!@0u$gExNn-%_P=E-U}_toi`E8aLzX6U}y6`pfal_tc4g-}htj*<E!9w`jCJ
znI=`-wnE)3WQ`wldi>w{%~g(@CwEu-{aDx89Qju8aCbue8{r%38~h)%34gf9QMLcb
zwf8bL0{3TGw#n(Y|1i#3E0MPT+g!O%S2CO4Wr`ke_rLS{7priPGn4PtDrJj#3CGP=
ziNBHiQgu-#u{!fy)fT&5=gvOizx3eDjUE08^AFfHZWfN%YyWBAN4<}Ep8a+FE8E{!
zyb7zdSPhy%`F!M?oAeutQYqt#r;hU^FN0=x?i99s%4_r2wc(w&ExR-P&li>LFD93-
z;d}n)+Uk#oKV%u0ZoDV`ofG8hf-<IilB>VFU%#~YzJ1jt74gd#&&Zr#EVp06Z8B)K
z<Jy^<t3Q8x)Es&F|AD^!O3vrpKIIAJ{)qXJP@Hve&6Q|rKi|E@F&|c5-PiYc_D<WD
z^QrgG+MDKIhnW6=Wsm!$>iZ9#Y+3!?C)?_o<)Ld;{jS-^x?ab9^w(Wi_|50u=Ke>o
z=O<LX(0bRKm6m)m_OiEh+?}Y}tIO)A&d)rbRdw;pzu?1{bML5c0ENX`^$YL&f9AcE
zD=}FeRc!o>|NUP})05Ha@h=w_pS7#nvVP~v`9CMe8}KRm9-ZZ*S1Pr2ruqCEi<)C!
zTU1HiJGMFMwa{(uf0l9cdVjNg<9s80g7eGo!`7>JR(hG7UH>K6y?Od~xuEPgzF^_c
zt&cr<<#XOH{m>;W|8R1=0ozi?<5FhREvEOLT3qV<w%GXWOY^T6OYE)o$ell0e)ajz
z;_Y>y$ol@8<yY*ZyVvgAzL#6|Qhbi_F1!2ljjtb{SMhc3-o>-!?its7;!c~z%U3UQ
zdrj4aX9d3=J=NCr-|)EN(ealbg=)lY<BZCyL5}<JW&VMh`ZM2eU6j4I=(4rOwftYf
z{L{U89%ud+JfH8D{Cl>2*ZOz^Gp^-~{K58JmAmiB*v;VGeX+A7ee)fIw@2pf?mBO=
z73xz9YsU9;m3^;U+f~<Z%{x|eFlMEBn*7_1>kBF@YPV?T{14pw^R@VyVCSIyr56wF
z6O?%~ujFCS^2~oe^0NFr`+h!&_1*`~M0TfyUzGbDPkSVFbo-wFm(pK7I^Q~dw&a_t
z*HOlgEBdajiQS)&6mUl2@Panu<K~wRT)D%ccVo`Yv#!p|_40jk+zc%H-YHdt3Oh&r
zJO;{?-#G77F|Gd2&i6{S{h{@=_Tr~^zhC+7Z@WUizUtA{L#b!~bnNc%zQ3<;`Tt+`
zWj9%8^Ird`#b18<m9Na*oL?@>?`{5AET)^kp;q>M)F+);izWG2{oM&lEq0CO{s~|I
z9dOjMJi@+Lxj##L-`~5;^8UYG$;!EZmf6C7BhGkN*<WFwu2==WvN>&^B)@OiZ1Hbi
z>6PO-RmIltcT~5%U!C5v-KuYY@hoUKR=i^Q_4lDI(_>L{wP)7V^%q}Uw$z(p`rBs1
zdi%5WXJy>iikho!n?7&#<FDMyTzv#v=etFfp5>V~KQTM~zh(Wm$g{^y)yhiwXBBj=
zo!1R&@`4ggwBLgJ^7phi{Jm%I`1RSBm%mQQ=Pm8Le<{AM?d{^|pNGH7EzVu{J7#}^
zM3j%jo2uhxhpt!to;}}iuAJHIn6>HWc9d4RT)y|Ruwd=MrN@8o+xK(x{gUse_dnhI
zo&VVF`!DtXUps&A@2&SgQp@B29D06l-_3U${2v5YG5!6w<LO^x)4bci^RIpVey(eu
z>B&r?^sV0-E&thkdbM!gp5)>JgFj#AA8fgz(R$9>Z>@O$vbm2Fe)lESeVsQq>iMH*
zKd)X|o?I(^`~IKb63@Axvez9izx%hb{?+xnwV%`Ni@(SJ{}8|9_e1%=+1I20uB(5*
zUH<>#{%_Xne)9Z#6#x5n`TvjgzZZ-D+WuGhe%*KWy6@|E|NgrF+4T5S`>)3J-{0;3
zm0bVt-TA*$=kG7FzM=lXZhk{K-<iG7<|fPTt^e@%-$iHN`5)E>n=^kpJ>TiqJYoN$
zIgy`kZvJkXy}Z6j@g1A&@_W*ePaobn(lgn9>n-WEHZxB9mfx}3=)8zK?d!jzTf`4m
zfBDG&cUAu0-~9ik-mm+v|Nrv;4^K}Y{cHbRZ2!;V>+a9q#sA;C|K-K$-oO4de>eWO
z_WpO<>Gra=%imvnC;Vf}JcoPYk)QuQl)e0ZPUxF`Up?=|eS9)`yZX=I)zz-q=W9N_
z$Y_38nDp;k*Tb*=28z1^KjoQx2GtzDVkZ6Ouldv$eZBDaq3CBPnq#jsn}0Qqf0@zr
z{`RlN`#)o+??3e`{@<1Oy}#4zf0yg!zhD37Z2XSj-~XTf|M%bXFT4Ke&i{SpZvBt-
z|Gu4`erf*S)Ar@MPy99O{~WJ-_3rfl^XKo?zJ6|B{k{F)(fd{3=idL<x;wt?e|Y}>
zkJkI&zH|To=>D#(@(unEYV8_->V5oo;Q771(Z6J_BxYOHow{#(KIwOtn(<Tj!tb+w
zZ%p6Y6kPnbDbQfW*(}>0zv5X5$F*atzx1T9yT^R~%89ck>-T1Dxp3yC<)zQHQ6KAn
zZ?>=fZvTJ2edYJ-_21sh)*XCuukPLd-$&iI|ERtHd+F)v-se{Sw|dL}|DycvSNlF)
zjo<To|Nl$pWA-ID)qOM0|7WxQk?b4cihjQbFaAFKTlB>)F#mr~vCp5Cw&gFy?+0((
zRVn=Z&E~(C<Mt<*@IO11rMI)OQ+L*rSaTWiBNy3j&;PUZ^t{L7{#(S2ue@FT+TzxC
z#{X~p_x-zkeC_wozTfW)-~VsDuVmu?ne%_#+&%x-&HdFGXXnRlDq2_na{0e=3-iRk
zaqjU~e-LYUU;d|UMB%%;ztt<VXNNzo)SD%LCbjb{um5esbziG)q-P&`xVZYS_^a=p
z;%UylNm+CENc-oTMAjI@e9!fLRKByS@8{n0_x|sm^E>nX*WGoO%kR|wUjO6IQ?q|J
z=Krea&wp-y=YR9R`=6xio-X}Y|7Yj^!tdMveGBK?x_g8FgIX)b_k8cC?lZr0^LP8a
zu)3Du>p!*LeUGVfb54(+Y&^Sfec{#V{C2;Z5-qYWl}aCGjWt`HHbdst9viETQSV*n
zKTr5B{5jpNxbvy){D00z?pOampS$Vbt@D2l#r|X29Q89@@BcCT|98vpm(<t&e7*Jm
zv-bKL)!TRM8oz&I*<=0e_u}G>&O5%!8kcVNfBvX$`$y2~&du`B!RtN0GU_#MU9<Vs
zl*wFJoHYA|+sd6m_Lq-{znyb%{;yN##cQ(8-n+Q`f6UpL^7{X;)O-BQ|F<=M&%fxT
zpW@76+W%{3)&KrpfBx?Je^c*QeJ|htY3uI)U+RAtm)AdkUz@9X7v_wnzyD^upFUm2
zVSo3R=9lVxU5^E4-~75bs^WKk?fI8~U)=rrOs@7|Nn)PET64Q(De2(%yrnX==RJGX
zO`~qaJX-V3-hh9;`=7w|&))9;UEA@I|IfMh`fro;`|STE*Z=KR{&D87{eqw7_4n<|
zzW3L?y#223<LdbRzt8_Wu7CgUllwnf%}ZwAQ2(%R{(-gc`>*YN;<L>Dy;h9D^z!);
zwx84PME(BwFMI8*d7qYl=+&2C?(d16zmfM~sBMg%G;f#j=IqP){%2=zUG-4vcD2a%
zf6l%8Ki}T}^_~2G-u<tNe%pU~y1(xG)b(|bdl&yWDF4H^eE-+D&sW#iK7MEae}3JY
zcjy0K-T${OP53v9U5oIG@{>3J+AR%kuPU8)qndx!YSzM+8y{WWTmN;I@$BadXIi|z
zUf<obVfMpw7oIJedG_k8<7=z@WPLwBd}Fw0M%l9;&mZi5@o`S2{Pb`0f5+Z0{eJ$>
zw&VZ*PPhNCyZ&$NKg-k8>mQ}R`!D^Y{^72vf42WE=DWYc{;~YOi{}5U-dOK@`?>u8
zll*^I#cTgfeNz8D{)cXOe$)IN|F@s`H~IfNfBQ#eoBSU*TQvT;cc%Q>+V5}gGC#I{
zWqQAUt@Wqdw~x#-&c6G7<?k0eFYf!uy14PI^PeME3uJnZFSDLE=ib}J@1^F??u@Hh
z=AFCrX=Ab7zsr5`JO1lC|1v*x$NL{+?Yj8D|JF(Kf1feG`&an>Us>^!|Gz%}|Lm^+
z|2y}U_dg2X|L?ngebLW5f9;!3-aP;Rp7)Qv-#BYJ)C<1-`|z*Pa(>^_gFoj5XWv^>
z_y6Id?G;bb)@`wnIRE9f@Rik;9~bM-5W8iNQlWP%B0sGE<jKmaviG|G)|J}-ago~d
z$NA9zfAxPmcgOgzU0?TCy1f3y{vX2SKht&gSNy*ozj|tY^qc!X57*a(-ns+oVX&(|
z_{$vqO!m6z#;DiA%irzgEPNZ9eZFh<-=}Mj9-OBfR{cfZI9JD&H?jDP`wizG>eqMP
z)7JYJv(ogFiTh%<#e(rozXG(g+P|xR_?rLc?_vGvwGN<`>YXyCzjcD<YTxe7e!u=o
z%x1OsaldXz=6_n(`rf9rR!DyB)Mb{{S^pR7&ydSu-r(E0`(tD;XwQuQ*(`Zm<tnLr
z&lcsz-Lb8*lT*JB?NmgAnnn?OtAE8_Eq!k?BkKBQ{yCAK6#C}dt(az!{fz(3&-C}L
z^+j`+-~P(I%zUa-k*~t%D{l2$DuSQq=e`OSmR%<(zwYsu!!PIV+57P9{3y9nq}JT$
zzlEoNFE{;j@I%(j`8z73tZscMsrhzZxt{B5%a@a1gR=YdD*iTYT*=XC8kl@U-Q3}A
z$LyN#Gw!{UlwDhU(ci9gdeoNA-Rkud<jjlzKpTlRrA&YSec-dI{=X#N#^leQmEA87
zr9QNNwx8ped)9UxtG~@VetfK2>Na`D*6aE+%(hwl$!W;;Ps+|?xPN2zf%P?JYmS-!
z{IY=aQmcQ@>ly9&Q`>K6gW6uTOxx!;+*AF#u5<Z)OWEaS_icB)(3$t-$Ac%k#ov1e
z%%8V)*YYoX{`Q7nLHjRm95d}T$Tr*Dc%|>rmAu%y%5u_vIsV#lbKT}&{kQmR&|==Q
zKMQWn2SwT&;fh}@d#o4v+<EWyu5SLtkE}ln?gei7Be33nK4ir8(M$h6?qi45kIgRr
z+mzT-(Dh{25ufXYJ9MhHa##LesAqrZp0|ndb#{Bxv#XCD7S}5**?HvQ=4JmI??Nqz
znBVZ-W0h?6c9!C=UFUYQUGk4Ds@rkNL_9V-Jtxhk^QtwUy1!3zICt7Z{gZ!>f8}1r
z{it)60ehy9v|8K64*i3|@?TPnxA#92HqY1pkWu$LWA}R79B60jCg+#m&Ua?)2)}21
z&)%T){rt{7oBgXZ60*ZLN?u$(&u03Ljejq$-|{2j8fc=7-+SKG82-8ycK1a1KHZuj
z;}`oWa&hL8i{ZTb{EuWpic2o;ICOSj3AEq2!K$&YzU1z2^*It%=T9VV$?AN*C_3}X
zGWDHOJk#Y)s!zWabMeCRG&}vA`-}A@+BiB2S3fhkc$xL^<@Hq;mrc7`d7S_1<MZ?E
zf3J9X{rAFLJuC6|AD_hDg!B?$3x9Yw<NfTJ#Vzl@`&ZmLa?kN>>wDMBGPT!_WNoO7
zF{sgt`E~ksv+@3~JKW<9&S(mmt8e4<O?b64C_eMb;_I(<u6+-CGw=M}{d-v}^XKj^
z1x04f4RwS2^7rch`U$OmdZfVk8{ey67df}P-7)?V6wH54^3}tiFQ2}=y0Pj<-{f@L
zUrm(@<m|#9h3u+4zUORbbJ+2RM$32hRmL@)zgvIa_S3!;`P-X8U6kMTOrQT6-p}?^
z*md>y(!UqinN*pav%Krh^Z2#J&pDH;cD(C;{QPB{tb4j_-9Z7C+iNN-HuCy}EDz;h
zufAliM7~(vvFVSD?fQPTY@eRK<@O~=f6Asx(VFl5th)6NG9C!-U$s3fKW4Fot&qF)
z8w;6z6OY$eRIjUu`LIlXM&2ynFPl~tto5E3b-nQ5nroL?Hzz#0b~ftM_Q=(iXZQNP
ze|r}+uyNRu@xA7I{*L<DlP_r79=U5CQ?zwK#jCz=7k6#8d~3dVXJ7uWCQB)?x~-Zq
z0dsm!9Nl1A^{DCM)1d4*A6-lSU#z>s^>Wv?N4xethPY2=Zo_x>o^!vmpJvXr;#>D)
z`MvocKWz`=S?oEd)%#5M{5g9{A6D7^YO)kAJDavkFz?kY@%1$iADtDI)x8qVw_DuT
zqV&ct+4qo9m&Z1Zb>?Sx-V0oN(9!hgkuN=J;n#(pXWgr@eOgtb7ngbUOmwDP?ZF!y
zj|JCBnO<l9c-MMPjBI+^r+qJi^ZkGKncNNDQwS*t<ezg^<bOT$tnXg@y}~WMvd8ah
zn_hpj_tK|xQgyA*mR~c@;QueL%Nf_SdZD)7-rs49Hl95B-7aj_m7l_&4;So>y8WjQ
zGVt*saE`<N?mhKkF=>wz->b{ie}1^>iqzGh=i=<U?-gdPURwU1|N5`j^Ao~cn-iq_
zAIVAhR$rav{pQkTMw9tFe)gTc7%$gvv0~lzr4@(U?aV#4r$8JyUHHSjhQ6iu?X%9h
zPT!OL>c`dJ`ujd){bJet>+kmiHuEk^eO*v%viy4Rov++&2YHWlG~a!r5trL$X1aI5
ztUEQ80Wxp3u1yd3ljcc(IQjF6hgSKupRMmfa*Yk+d#U%mo4@<-xfg!VwW#*1=f1A!
z_3qV`L7NMTEdD<1-?Gy8@0s=S27>8JBiD(kZL>ON%l>oWS#|N{^LOp|uHv`WHmTJ1
z3!mBX^V4mzpV_P|ol~<O6yJ7pgm*mse*br~*^Vmpr&kVLHvi;S{N(s{wZiooyQbgj
z3f|0LnSFG_cX_bsh6b$5FKm$Wn;&(2i}3B$*Y@=V_sfaT`BxCTyfJvbjQEqYYZl+I
zYl{5SdERE_`>mi%wER8GukTgw{!P1I|L@u||DqTJt0=>H+g`ujs{i$gtom~QIi{c4
zzdhW%SJr>N+`$(a>1)1!<!%c+Y_{sG+K-nPZC0G`iJn~X?bWVXagd`4e4lr!&$nFb
zY4`Wxri!C!YVR#}UX{B8u7~V)s$bZD`tNV+<Xs;+uUfy0N|Lg98@PT>(Dg~L8}ogS
zmpt5*_V0jQ%`Nv$eYe3wXl5CuHGi949y`<fYIA4ftGSOW&TXiD)cGe*;cLuiHFfpp
zm(^EHi<mFET<**z?OU5&%a`5U3J$iJ>JR2lxcl|}C)2vG{{qkdKJYvF(beGXUWet6
zm`;1TtN+T{#SwowZg1apUG)0iH-<8~-}lrVY<c5kE|`7oR%q}q<(jN>6Zy~2zZqHN
zaou#|-%BTMuYP~`_5Ay;e!?Q3U$;+R|G}p?Ecz>?>9XGc!L<AHSHAqCagJr{f*=3Z
zR&}obx%b_#e-(SzdW)Q`iC?lH{(HjF((|I`Uq6X{TE6WTzyIq)s_`!m@2+_Gm0Qi_
zOrDFeljWS|9|<L4#~)@~iSPP$X#T#c**8JUXFguO7?ZXB|CMsdi&DG3mEGBEop*NW
z%O3{G7p%c0Oq+1T-+wk=e_xj?v`I>SdNAhh_Uwnt<If#FKV4FGyPj!fQufi(eq~wS
z{WevFS&u#x&6qVqKc@PS{ja9ZM$hIaQXP{o$9Ao^J9P1b{MDC1?{|FNe&nt1oYnay
z*Dim~$?yNOe!sGQ^hJBlxe~L=&6>?-95sIIT?ihyE%?l7^L6(UzRM9ZBKFU}Uw`&v
zZ~c>%<@@{2b}xIJp;oSV@6qD#lPk`>sCsXxoPMv`ckcGzZJ;fU*OFq)kGoF4+8h*}
zS$XC0;j_F;zfD>izbCKks=8J6yuvR#x}W_^&#8a=a$iMU-OnReW?%mAbgzEJ>G_A|
z{hv~H{X6HLe078Q|Ns3JJbb76_{rPzqx9zNu+2a6UH?^_%}dAb?!04rwiH!QkbkIa
zwYNFx@2&N6df}grRoq%{_w!xl-=@qW(><0^hpPqjJjCAz<{W+{T)nQMwPy7!$(39E
za{l*Dx9guj_jTiE*2fPo$NRPK|FY+QhTW}os}D|Hp8ZE#cHM9D?T>4j=5G;xk-q!;
zwVLDe>SGpL)TW&gKeJSB%HtpE>-*Zjt<}5ke(!7FRq5UL3e(aaN*#?A|IAu_|Kp0S
z_WRZpRCGMw%@JQ4vp->$N{f{0@q^zkwr1ykPXG1dOY24R`~Md2*!yS8=4p5SDZIV=
z_x!ro4}U%kt(M<nUpnjA`7akg9(b`lKKIkbRjThwk8Dpn{+p$4rGLWLIp5y9esjNk
zzJA9w)%cgc{@s$_S6o;7^GnNj=XG{<rXBwLciyPmANp46)1NK!z2?`0C+TwadVBU%
z&$#$^R&?FL431<o4)Gkn%g+`q44!VTW~Mwt#=Tr{&#F$vw}Eo|o?m8Ne*K^RtlzmS
zA3r_#>`T6$)UIbo1I|DB){?znD(COf2>G}AzpCu@AKu#h7_`oLvl{=S1+!$fO<T6}
zh0SyKJ#i%`e{<d6dgRxom8%~%N1nZX{OIRZb%Im-mi;_=^6Y}6=Bq9qQuckd?#<^-
z*Q*OHzB3iRY`tv0_1RPLPydpiJ)9j~chJCm+e-7>vyNO`3EBwSZ>4W9_vws{&AW`Y
zdsS;btZ@IFwBuFs|CO%pw`+c1Iqd4(-u`g&lMhb&el4)PytZb?)cwETSIj@~ip9o0
z_OPR=<q`Jq^YU|N$@tZmto&+Py*>S#p}LgqkIaWxF0nq(db{T3bsN4_Cl&2xNbU@J
z?Y(xZ`^P)WEzdsgt1_woEbcS=&XFfp{xWm5XK(WS7x}t(wc}r@^gI8q%-d{q{FU90
z#eYA$T;KQM+qz}p&nLgGTe<VupLhB1X12xEXVewdUTKPbKO^nv%G{d$ehFVU&zn<|
z<oBrK^PRKL&8x1jc{zR8EW23iPoJ0go#(F%UOxZUlgM8x&;0+~xmx?^ZOok+H||yC
z{n(fB<&BK^nOU`RH?Gfrwm+?Jv3tD1dBbhn%%=pde3+20D6`*co#DpUn)`RIt<KEJ
z|CnAERy_Cnzl^4u50{=?b+?GBi&-31E$rX>E9+fg|GfKkhCTIL^S-X%^YBOitJ(JU
zjoWSaPpv=tRqt2ig1K{Q9=$2<wzrMZuD>p{JU#h(_`d>^nul+EYm1Egw}=0p{k~%9
z#{bvO-dlMyJ7BM6?Jm3OS^F=on0fWy<{h;q{reJf!X`34QZKvPR@nQi{k6s47edRY
z$*AY`Tl`v+5jN+R>z5|}>W<QH{OS3fn-`rtdi{j_y2n3WeDQb}bbWe#XunzZwL@Re
z^t~)Rx%txKz`K9EH`-kZyxh<4mwP>J&G{$!XYafJzdi5%DSON3Y;(&$P2ILL<Hv%k
z-&bdyp7SI&`1tbaGw%J{b<MWQZmnF&#S3eHeKP%IcKzcT_4krn&bl6Ezxp$L)|W27
z-s$S4b9NLP2c3R(i@ErZ<=#NMUrn47+h!RZxUyDsdera9+x51dJ9_r>>a%hut9|#{
zNZB?$49`Bgen-XZ>($?S(q3g8?tUz6etx}}$oA#Qb#a#Q26rwl%CG-Ezpi%i!;8C%
ztvoJE{EeAx{n<bN6aPv3_g{B@m#_c+;?7R?=w@?mQ<?grm<@kFetq<O>g5-cYecul
z@$UkyA~sgozsGQE^tCHzBj=v4{FL#cX><Cwh4Z40&uxD{OXA$`$g?wNom*~KS=|3m
ze{ymRZy%%nJ2l&aW5M6u|DBMZIq9&C@!9CkE6;kSn%#L*{_MZ){^#HC)IQDL|LooK
z`hU;+Z{_}Dwr*Ts|2Dfk{`arz@9W+@uY1S5`*ZDXcl8fb*VjCK=l}1dedTv$`%lW}
ztM<!$&92+Ge%G`gZ~mHYJ$d;(|G$Iw6`Galvo>B@Z()4((R<U+pjlGuzMa0Z{;~Xz
zx{p0-{j+u<@1w-)N77BDJh%^+&#6`2ZodyYKVV_qSXchVdg<e9OQx6mW>>MvmHF0$
zEpF6)+qF18aliEAspn^W|HXRQ{QgIiby8Vog?V;A`TsrO_q(ZTZroX+l>GVO8^Luu
z?w!{Cr(g4syS)Cj|NpbQ^M7y4H~yyVT7633<B^?>S2o|-UOmUoa(~TJ`$u2=`ltVR
zeED(g@5|PwElX^6UU~MXATrpxbpFpb>F@1+&pdyp_G5Q^&63&z`?vPH{%`+!+x$)S
z%$Tgt`!XJ!nm_An;4kCFzi$VhpZ`1Kd{4OL|J?`9*Z=!me*gF0`_<p?-v4{Ie_rRk
z@^|W|ZNL0|IR8<_V*ATwwuNGUoxknz|1Nkvcw^PG$o_wlJ-q^MEyBiGLT`)3^M6+@
zn<u<n|LeD#+IdO8kDA=%u7Cgfao1*kZ=1lq-}C+(NEIem>^l;<^0G?#{~eu|*R%gS
zv%cP-`#4X`Cs0c$>p%17s{gUu)n(+*=wxSAMqR#jB)0n0{9QXg?EH7NW^dEW>Dfge
zAAaFjw`E6X{^Rp&Ui$yHJUlN<LeG1C#oEOdU)No%7nxBzGqqoPUAnvd)*Z(xUi=8o
z@2%PqXZ-$F@W+e)s;AA^_B?iff|HiPiCibX!`W7#rN{eUpS|5&b$;Pu&v%RB6HR`V
z^hfVmUAI3Z=Dlt8gv0m5&(&`KH|_J|=dbOaxjg1tzTT>*E&l$@?em}Q{CBOp`4{Wa
z)jw@aihcy`ugiZt|M%R=ZxVW^_jrHOT7LXwwSU&ZcN1sSWzGAv-T!=nEwjAeTO|q0
zyH_s!3tC|N_037u_r(i%-yd?cy>&gNr07I7c)YjlT$ba;TGQ*rpoaIZ4%4&=hvke+
zvmRP6tLCb#nl{6H)-$2g>Arl6y>mYL#{He#vG@O*^R_Bshj+fevgyupE5EuY`TMGm
zJ?FZ=^~<!w8N$)e9=*Ksbb{Ys&H9qHm7V+3_a6Db?ekflu4?~xhUrh{TzOjX^t$=H
zYo&5_-S!&u>uLh_AG!AAi`U-gCFiP-l>U9(^VW98-t*Oyop*gxo#sCM>dqUr7f<vT
zyh@vY?&!Cf^ZsNVjQNpKVDfO&y8k?BUBPb@KP`AR>*C8q2|Ky$qbp5kElkgny=<ob
zuJ+<f_2pC93;)FaHaYTb{@z{ppB>4%_|U5C|4P}bv-9&GeN#XGYUau1`*(ipzJJaB
zw|#ltpS^L9p3nTgDF6Cl)$;$JR!%LSyZmqQvdBMkx5w}OEBpE2i`(~Wj{h>dzESe*
z$C{vvalii^eRup`X1Jxl$=cU5-iuw)zx8E<cun!emiba~Uw2MF_qF%i#rX+NDXw>%
zdA--3-Ewfvm9Sf&Wz6|HJ4=sj|F7}x@ACMPU%veJ?p%9h*K6?}ln2gkUNG}{JHOw4
z%e&dX&fEM+yU-@?{CRoUx_h5@_gmF|pBwW#%xdqV*RIu1{O>NB%3dhH^!~iFM%V3v
z%;Vo``rjAdU)Q_#^$yd{v$OxG+m<gox8AV&ef6@rdp>8c{T)}BwOzq}i+weRyx+aj
zJ4-A68*Z)m_vE_%jGG!q#ni4(5PMYl<gI<z;<s0KJv$mZ|D*2SM-Q97-Ojl8yX~Fj
z_fnDF>0j-_V}AFaTf24h^NIFypZoq)-1vO{Pf3ly{TshGm!AOL9`f^)|8e$@z1sGD
z{M+<nif(xa$lJu`*L%v_%Kw-euV0**_}RVgmcO=D`HbH$s!QV^eweWBJm+!t+s)Y_
z?OAinbJX-C^g6uzMc4bSpFZ>8YjK}RW-93i%%@kZTN(ZHvE`%PX4UdftCr^3@tO5!
zhqSwIzUO|=^2=V|b>~yBO<L_N)p4F@P9>-U{_KAG{tCX^_x~Q=?thN`{GZtB&i}d3
zj{lCS|90d1(fi*Q@?|Q_TRu@uCbszO_V=|tclTEp^Zj_TW2NUktFO-&{oC;ST->vV
z*4wW?c(VBV{?{d07i0fR`UrIkw7qvrT4DG1liZAXH5D?o0_?l56}~EdnD8p?(kt)9
zd@t{nm;A4tuYGRknOkQrv$G#w`)9|Mwa>!pc3lB&p52?h|7O*99m6FLGvmP9^snx}
zwD#TpotDo0QWE>VyNc)V)*W5Bcm0c+gm;_IFZ^lOeC<Ja%=JsF!@s!SS#whQ^6I}U
z&zgR>|GPH-|6==tTRd_KW?xa8ZX@m=V6(MiZ`0a9_(CIXzqiiEw%bns_Isw?(WiUn
zFYet}UFY%ds-<n||CP~yK6QSMNw0m*uWoSu<W95x>XS3)R)!nD*gb7$g@oR$m>mmt
z{7sMf^(CtAV1_`VdD<Iao1?DY_g9$fRX$S-hm5~C>hEW*R;&H~@^|?CAMgAYoR7Nx
z?AM>!`MKGLwy(=RyWhX=JJWBw{GIi7H|p*jyY0W={Cm~s^`})pM`?-A+4{sJ_Oy-Z
zM!Rp9zOH-ee*FH<il3~>%7UfI%M^THne4dN5LJB`a$3_i`;C#Y$9>;w<>!8XaZmgH
zGrM2HFXo@UxaHcMzkkwv_xta@U%O_*``pm`cigL)YX5DwsV}>1cZch;@vVgK$B!<)
z_VwA>EZMwoo&LIo*Ure_Ft?u`Z=n0yt$6drrFNzlA4+|EXmxG*Z}-dhGOqkQ{59yf
zuYH|T?2nttS>^vuS~qT<AAh~C?B1-OpWok7zgoX#{n`3I>IJVq8<*aE`NXC=z_#-E
zM>F;3laC9p+gfxh<He7r$TYi@?X`OQ6L@Cp&a#(EJG{qij?LC@ogepndMB8-wc?7^
zb@@wk9$uVde12VRk>7*d`nvgL|J9$Xe@uM$Was(wSJaPJ=Cc;A4)*PBn{QraI9Kk+
zO3PWLM_#i>Z~xQu@}Q5fX=d*6FBhK%J)T|j#l&&fhd*xv`=|N$pZnPyS;K$xA9Seo
zcsbMOzsC1N@1@@>y&3uFgGFK1Tk-O}f0I_MpJV^?_L_Iaf16GktWLfI-nCsFkX0nX
z>py`_d~Sq&oN4I|TjBJNXMUV1Hhk9)8aepJY4e%o*IuKwfAzBN_AJiM{pF)4XIE&l
zqwnxb_REvYj-8C2Ub7Ci(fYXVy9&P7caFVCxBFQUt$fY6(q`R<&cmw@Ua>Okc0VU?
zx7wEf49uZ#)gRoQRNmR@JugCTiSX*LyH{j)W?s^_vQ?;k6?XklY5&TJm$#N3`{gz}
z0=%AN;)@d!e=iz&)IKx2Q1j^7+18g!*X3`h-J-2`>&n-Lz3eets^3C}@hsIhRMoe9
z?(_6v4u7w8$3?E%t2Qf$8+=fY;qNWe*tV64&K9kG_3cRg-=@rkkDfd!SUTHumfNg*
z1+RW6=f28I$_jdXJ={-wepF3~ENB5Qc*W2~&M(%FHTuGJHNM%+o)cN}=gZ0G)$6uq
z{W7_<)+B4K`09fnz8PE2doA9Rn0r9*^us5U&r6-<st&%qdRhFZBWE911TTL%>t@#4
z$GN^q#UBu(*L(bRJ{I4z|5&BY`uOSmzk8;?xbk&F|Fwr|mrT~jUq6y1AaAdC<Ih)a
zwM8ODt|qOq;_RDuB_8L$dfWbX_TjUg=f8=az4`BLo8HcSjvIe|ft$<tzUSw^1D{Lo
z6~5YYu&#cq-<|jNbL7%0>q}#ElaSA&S*$;U!}J<M)}?0!{#Sp_>wdXA>f7{NJue?`
zUGFBhE8)E7{&zRwL!@t5p8Y<&TP5S{jo-_E7Tk-j2{`}c?Mn;OTH*O?Etmi9Nc>eY
zr{<g|Xxng)W5KMCj)f*{ZQ1>QobJ_^+}rqT?TxsNvp0$Fz4G*6!H)!+Kd<I)FFy_%
z6n`T;L;b>g?)Ovb&b!=yKc_GFG5@zk*>d7{1Mk=#agW-2Rr+Y!&Gd@G4augU_RA~{
zmfJo2>0jBZJYKo)ioE=KX-3|kZ^>pka_rT5u{%QdZiS9TI?O*%Q~yME61RT;@!v~d
zug&J&m)`kxqI}}(BX_UcU1@r>a<=i6#OwEe{BJhYSY&3R-*!>$+|;AX`@(0}d|8_r
z`)G4&SayMdsqxD*O9I;u$IGpSodr<w3))VPnCr0LdyoCHyiaduM!lDt@$1WHm&M|G
z9nD#vj$OHAA0C#qS1n)PAj<H`{(qcmt!wh+)>Rr7Z`fIpE5rYF>fv{emt!7nk9@YK
z$~@i80y;MMjq^?s(_g=n)kk)xe0sU{QD54YvaEAyXJ*wb`kUf+{m9wb`)^%-vM$~r
z_QkRv1&<cg6xrICitm+f{ByG3WM%5sZ;g@l%lfx|YRUH9qCHm*nkWj&nEv{G%;S8%
zx5>Nz+AB}>_=jGXW71AY3(vo5)V=I^Td{BbeSZ7=>-T<WZ<=~zLY{!$>e&yQwCjFF
zPmcP1CE=CqcC)Q<-!9(i$^0_Kz5H7Bx0^pfbCvSnIM0-O?Dq!k@$k!jwtdb5%ReW>
zV_sF<_<K0@-<q3~qZZG)S7iHSW%-|D;yn+|t|V=JW@T2xH}Ui3kB^$K1#i9fX%EZU
zhgZu#fsRQ9EhfC6e&IdWd!w(LrOpZ-TRs1K(3T(He9y)F%gFCt{IvaT{<_E4RL<@C
zCwkNQ*RG9w4A0)t2$}9~T$*)pT~bw?Wv;=TR{wi@esu*m-(?o>`7TypUA6}_yldAu
z=fKU~kJnsV?*3f%>y_X7RkMy1*@B0s?f<UzKbs{d{^a=HkF1LeTG||%Cv`s#6<;pa
z=eO6kGj@yi|NrOjRXUuW78?57<Ht!$uN(oF2@00#u0~!0j-MC=Lj(>BsA_6;9Aa=`
z(`aHzR8Z((S~O{wqtPVSqH~td4gURpTNS^z^7`%PA$NbrJ<hIrZ|Jvn>$6$KYirA{
z-d+AGWN)5f&Z|yI+nlMEKQjI|pZIW$t4CBq`$PSHrg!o00wXr;Qa1`N_?db2(8^zH
zmb&rPv{k+3vi)Jvet3i0zh6v~o4zPo25C&Y^W|i<(vK&r<a~U;J`Af%`jNG^KUHO)
z)35&9pMJe+>=TvHHV8}juRY<n|M~L&-m~qbN`JlUj;KvvaZO_NzF$YC#y_^qee{~!
z$4`x0)v{J?g0kt$!-ngs3W}qC7Hxd8L9XD)W%lF~=GPC*W&ix>X7ITU$*drkS_Eka
ze3yCs>>um2>abt0Hp+dtdb(6!__)=Rj?AkEUjO{GCiw9x!}&jcF(nIoiurDeIKRwq
z|E*QZ=N<dEyi8wbF23{1wAJfd7vG;Vw>?g`_%Otw4?Na5<ohpL_q)G(vc$&fsI6H=
zaYa{>k6v1K%<743@xGtAIrCQk`O2y$J!8)1>W5K>Co6^Nr>zN{9P_tI=-BKnuP#3_
z4x0T>%UbR@I5aoh<@)lie`)Qy?e!<u%dXV5FMc4``Ph2?nwy8O%rt&?^OWMc8N0r+
z9^=dio?z!>DR%SNHK~jPo5c2Q{L}OC>Wkaa^LE&LzVSrhy4=Zw^2uusL^N(>s*Ys*
zF7aJ#%dcl!9u*wf@IWT%nt}TMBCYs&RXKfc^yir#(em%J*f=BX?Jp+g1_jq&lZ@x@
z{PHv}J2?CAoDG!*wOPya*RNVH^Z8XQPvy+*&!7Q%BaOA_|BBzDzs@|~{XgQi&5kOA
zw!*Jxo0sRmJ@P>2+=6LeH*9r(_IC4Y`KV<K_jg1cNxFGr(eI5{PM^HJxINO|)b`At
z;;qYK)_kqr`GmI~;#6<#2X>F=?YRE8{Z`hc_lYyt+ZDdcK2m&m=eef`ZS`}DHuwKL
za&3MBOKykg;s<l$yH8!Vnkm(tU0rEdeSlT?`lRFj+UBokuaEh-D$x23$nVLl)4~qy
z)%Y%ESYmr;&u{-I)2+*A&GO%qHEqY2GkZ!m{F-?^yuI|Esr#ON2WA{G5_y!aoaFw<
z?4Z$>A0Ld^qNS!r|6U@tu5xW<(M<OBTc0L<w>p1?5A0as?_5v*J-lbU{r?XB)P39Q
zH!kX2UA#0~CocEXrRnO^!t8&aJ|4E`Si!aJCp6d`y)PvyKYF4f9zU=5O!xA8w`_fC
zi`GoF+$eW`*Rx5h*S9vmKOvU{O;ZVZtY&ZJcU})@wpBB%T`Tju^ZMSE$3AVgi*n}|
z_wKVR^USY*zC3jQYhj)Qv*w&aZp|yR!dJ(|+<vT|_-xC~`?F>nY&m&#d)n43#s5sr
zA8lj;WdNPE4tMQu<liYSiuYV|t@*liaYa9O8vk0G<h2%N&;9QmjwyQn$Ljo7)@5os
zvwWW>WX2U+zI?JQKUO{CT!r-Q%PQAqw}0MRf2=e2a(%%ua9W+9ec<2Z-+Yz^-<RIW
zf41Y=>e3_Mli&7-*{?0Wc&pi>|K6XI)|bxzT(55+v~hxJrt$o<XS$cVI_n&lDmv5s
zT;=Gtja%!k8HO7sf09eOm0QJs4iaHEobQ-#cxN3|ye{NeQI+M!tl<20?N@IV9DI;;
zR(+b~=WiZ+>z+Qb;oEt@VVfkY%I%Odi)N}H517Bx@~_v%-;1V6>?=L8`s|+1lP;fD
zZF}FyR=YNFZ6YLhU5IA<F7ll}S$EdXT2)K$t;W|^Pn9rTyV}&h=l)|0|KhBx6T~l{
zzajTTqCF--;XLPo%?)*rUY)(DQu|0|YCezqT(i<*yI(se?%X-+X8pQz2Oy?S(0))C
z^qs$O$L%-vQ{Cs7b`)Q!JC<=Jar5@7&rdF$m#``R6_uTtJ>OZ+Kxk`dLeJ9;fxi+y
ztw`pZZD+aT+KP>)Tb^82zxRHF-`l<StDMcl64o5(EN8vpU!-5CdMCYSYq7=8DD|Dc
zqIR4#SJP+b)(fkBKBY8hHNSuS>aufsaS59gS$no7+~k-)C*s%2<LL(`N7sJ(c2TWu
zec4I%?IzE%bTZxYAla*wwMbua`tPu(LhAMB+NYO(*%+GKqpCk$sz<7Mshh0D;!oLo
zl639$;u3Q5IFobDuB@Nz;>{N`_v?YPEB)>2vNo~(n{#YdsK3oINL2NG;d&C6^7hW|
zBbSz`eP8os^RYYswr>%i<-N9eL4WauQ`4Kz#yq<Hqg#B&PNuzWmWDNMTVHL;dv!v%
zd#UT>s#*)auP1$d?m^2Fi%HrOeqX42{VeY3ziWqA<lnOm>WR=<Te)WOaaHzvn|bd%
zKCCD%(XD@V=3|w2OcCnhT9r>aZJ&JCk$D}l_?T_%-0rBIlFRe!Za@-z&Ss|DZ{(*s
z#~4<H_Uzbxf93i=YZk6clKlSV$?Fw+dM>+{pI|+9)}r&}^|a!Rv(_wM&(<e#t-0oz
zkyv{+|EEZIyJ-_`l6L;+>G`@k?WjyYC=d0B&WLZk_b>4Kq*IDwmls`JK6~S|Id+vv
z{68NZi}dH&eLe7X${f4W^4NqK2JFm>>X`X#zHB)2`nJZ;m#2jfS1s7Ozw+@a<72Ci
zum3Y^`#OthihXrGP{&3we&?z9b^DF|JHxCEze3}aE6@4rish}HTO7PuK07}5S}9*-
z`E}M~otkBnqFP?2f7IF4vb^qG`J!hVOZ~oh+_5mMU87uU@JemkzFE-3Zm^wcXZn{v
za%sBXO_M5QcK+XKe{%KKs)|={7yItL5x1sl?dQd8679uI(eVi^q6tS8&iyoNI_z<e
z>*n7XKVRhsbN5>1*lKQkVyW*R$G5}w;FG1f4=TWw^O^&PxW0VjH%xhFdE?9TZ~CTN
zm;O4ld;QMoD;uNT`Mvup*Y51OynVSu7|+{ZOwJQLJ%mILC!TpYGy90H+#1%ac1gF6
z9Nlu$X`X~k-;v<yJN}-{UTX?1t)GP*s6AH8yn6oco{05+pH7?>JwNN!!86%cPu}bf
zUG18EH){DK)3*8(|M}TA2xS{5Sv-2VIK3k?{KdllC$9xAPujjb=JhGV^{wfA_Jy@;
zD|MJ-v%+6g$bgy@YYr^beh_!C?vTN>$inZkx;C}C5!XED%u%-Vp0RV@Qns(f9hqk(
zm#a>%D(Z`!pTHpcNI7VRQt=I$lYz^9@74W@dwXQf%!s-5`FfoTpL)zKZI^|ZdWq}F
zKSurUg5RgA+FDjv-kC2X?tO3Khicn5Q!T4HvkyKfP}#Qcz!ev+GfU6zVcl48X6f2G
z<+nB`%<mnu>VJ|Z`<z)V?s-~{-0Hqvk8URafF!gP+7IF;{brZ>Cctm`NU}RoGIIHL
z{;wOR7X93~oOyHnIZhk?;wY<`*SGtfOR8;L>2&gz$jPH=`~1XwpKWHlGfUk2-kkY&
zZY`d^dd9}*4XobQ*Q*~u3_c-xqV{lYi;czMzijdA_Q@o<JzaO<Z2!vJN2bl*d$4Dt
z+*YxQS5G@LFRs-$Xev(mB(~13^~eXwBQn1tz8w3-Yw_X2;V0_re|=+IZ(3z(Q29gd
zn(B0`kI*D{A-eI7e$oFG7PpRkFfNPV<o@i)vo~|DNj>YlygV-H*sGq44XW28^klLZ
zN5>~{NN|N+%sL!4q4i{VOm08>HR-G~S0(P)6-~=|J2|RI@_Wti^t_e#PxOjPXcs(+
zYrGSF$38~zo8b3JPdZOtK6LZ+ia&4i`E#D8@)s3dS>3u^-+yhz)0FkG;xj}dmY9Xa
ze9Uo@t$gq!>E-H^`+i8SK5n$>9am)Cnwn&t_Pv+x`_F$G*#k~=_NTN1zVn~ITC0{^
z^WksLs^b5fru|O;c9dQGvisz!zh@2yu3x`)N7bjkSaAs!%b*EIwffrj$h^MNDYV*D
zJv@8u&dL?*_gq=+s~6F`eI>lA*|3GFlz-K4-`?k0SFKK-mO8oGZqJjT#Yq`gULF?o
zmOoP!m33;Zoni8I)-+bxnvfjF<h2%DwMD<el-RyAOi%ao)~l`Pdv&;YiT<>|2ZHq7
zXaD+gmfspwH$*h<6g^?<y#JlK>AhuPSs!{g-ekWY^Xt<Fxo@rMylZPLZ=4Z4ywch4
zsJOntq-@9TPT}WAzFZFSo?E)H=)>B}htDKSUTfNI@<g}rMC#lx<}cmqAeF<;^d<E>
zv>(s&kgfS{th@Ki#v@5rPZj&w>REo6m;2zH^V-QVmbaYs48*2i*j$v8vc|V}hWh%o
zG8HFP^L4K8C^}j#wKa3{{2w16m1057dWXC9M)N+;oNT#f-|v-%Hs7CKd2!l*UR3V0
z53eUouYEGZ*zO6_Wns^C+r+%rS{f$(IdXJ`_c>;p;%{5SK3xgxt37aeeN8E}P4vKH
zt;0LZm%;aIeeUddCUidL?*FX5T{53eNT>T7e(HHMeNX7O3+|RPPf9&#k4dOnq_g44
z@@sCLFDGB#F1L~Wrz)S+j;-xgpKSN;+HzH04%#qo-^}#RcPm@9NV5I!@OSywPX2oK
z^6kIrHnqj)4of}joListX_c?vuMd1X4@B$`yO|v$z4H9z)pjz5Uw%b>zIG^0zQR^-
zhI4$j{Aai;*ELl0nqF2v_qSc9y?Rz%)++t!QG6SsuFo;;%+|HM5qI~@>vZ`IYdrVt
zI}ouU%7f?QtL;zP+H-ELe(bsY?N>v8-r6<$q#noVTlz`nC9Rxj3{IioMr`fkDAPwr
ze!R1e`uuD|(n`-edw$Q|T4h^3qw4kPmp3if*`Cc_yK&!v8!nAuF^p!#o#%gU&HS_?
zH7@&}U1#@6&*;h`;rK^~gD3BK*bnJqWwPEdFZzF?Hf8qT_FE^N-v<`%xORNj^|W=@
zRL?1zZ=5&ZruO$ic4f2l-q`>45{|956J57tTskjx^GwvUt>29N;+_e$XZu?|+j{MA
zlV#BKn3~FKAu#uvfm)k);*VU^e``N;_1-nA`;L_UzqDxOuQkcKhHGYAn^PE7bmhCv
zNlU(;EQ<p+g-zUe?NNkf=R;$o?M}b?r>4(8a<oeH!OY{YmdnlEA;#nP>fkYG&10rL
z;dlG*u5It^uNmjh`OR<nd1d^eHNm;Bvh!BXvot++b<%S8bMiU0jVn1%MsYndzVxd3
zyTyaPCtY9HOjf^sxgk}*a;0!{^v`Q+cCK1}Oaf9U-q^zQ&hXQn=q)?rPnx#7`RtXj
zQ2xHmGEZ60CPG`Y^Qz?`W&P#p2d_MpdAsqoSfrT8rX7oRHkma~|8?c1dbrQ*zi(3g
zwAFuiL|U)4%DEPzzs&a^G#hN#!t_o$^XYDV$<vC*%1>OLrS8YG=h(G~O<Tna`4_kC
zFnir}(Y`q8Ls8yq?w$oo$=uNaHr%gPpH<r{^Yh8A#p!RCt0ixciVn9~Tg>?S=eO-`
zAEB+Kh$zPIk{0iDPtLzx9JE|ad!6ZY!y9JIzV9+km$@B%Gx_<ZweyRk?kg2DiJVJ&
z@J!%a&Cjgfr%4B^7Po&l*wPuj`&vtIWzoT}7hkH!eck%61Cnb4!WF(xy5oPqczOKS
zW8S~{cjmf1y*f|wHouSj>^Z)5pVmIKxh_6KWui*ijNmsZC$2v`@@#G3*B57&%FVfW
zIBaHf|0{l_TK>4AuSegyu37&!T;>I&p~x58c*lI&H_0i_f{Qbb{#D$%Z10Ab!LsZA
zZ29!y!Q|lhzfT@KkBCoT*sQU!^^7HBlH2-)7I#kh^Vt7B`*ZC@JNc@=no}#@MnB(r
z{+hEHs1WSTU@g-BvgNhi<c)Lg)F0Wlb>-a8D^ufhew~x-v#YGx85yoy<NoZj`Tl(e
zmRQtw9NWrZ!M;Q0XVKY2+Xo%X`HyW_wv+9h%?$H<DcbiVqM!TN7Io&oGW-Nd4h82=
z{9XLc_}Jd7LGi^aSJq{HIJ;cmEw(0E$7W|ldqi)r_qwb}>-X<FprN)fK38lC`*F_9
zYKfhzwzuu5`k>nL=OIsab={R&pZS-czW^F0D0mdnxb&}baq()y<Av*;u73`8pEtvK
zUBp%Eez|a++*fOT?-@P^b(5aw_+3fbI<exK2ao;h1IB*yesxJ^SMQlMd2(3a=ks@<
zX{w-RUBmBwTO+^wd#=q9+q1oX*Lqccy^S?V>^s_LT$5Vq?Q?I=-Cs=3f$Di1yCzN#
zR#yz4Exc@=Rbl0~RWgrmDO*09)IML?vXdX&kKM?0{5sc;>yh@!fA7rxayIkmO64}z
z=K{+4Yuw_BKJ-qWURBdB^LXCfUrfzA!VL^-`gV4P<;@Mas($}p(v4jbuO7~N{dL6+
zX!`kZID+x}`Zua!-}MW3&OE-pdQRo{`&XJJm+QOnfBkW7U1d?VWc98CI-+Gx1#?zJ
z%$p#w=SZhy=gaW3T|29mOs`y1S0v;u@28iL)n*Th=7>h+y-a)my7R2|kFU*5I=A{=
zd_nR5()uas`>vgmd-CLV`u?)o#*GPE#l+0lZJR#-@R6<aO13_G*_v-xEAEyTRr~dv
zW#QMob0V&)+x-DGwd=lwD}3)+x_RpIsj~}zy|Yis{JOGn{_pstN111ni?7UjCM51X
z`{$RZ9hpb3i_fsKOk!WubM$%6)3nR8l+D&})!TWdIec$S&bi>V6`$4w{yu0p{g3LN
zPi{6K$M)ajI`fwMtIyNSli$D1>^giu?f<5AX1}l76&>k3dgW@wo?B0r>ihd>@7s5P
zVMdCRAD1?tyUhK-jZ%j<yFEK#G)=wj>U8fl>qV8*R$OjM_wzeC>&F4+s7l)!;b}j?
zg?7Q0bq)2eEu9V5S|;mO{5qC&W7mIy?&PP>>Qwandkdp#t4<foMYLJmkuf#f&UwD(
z*9+r&rHzUQ52jd1+!8B!B<G%YD<|u0?uI9?((itG{paE8lW`eGR^Pj^XWOG=H%^^|
zBruCz;S0Wh*IxFOr)TS<i0=|b&$d2$(w%+vu<+qm>Uq6Um!+OvR=YlH=K6m!?lH5i
zs;*S7(>E}E*dh|BVaVMrnV(!e>&P6N85T3_%#y3RZqB#h{~2Yva<!#pWHI05%_%QU
z!JS9<^IT{C`gUc{+*lX&Z_!P2iPHZK&lCN)@6Xv++9CODW9aqA>q6L{C&%c1-6nhT
zs(<(UJFn)v*tqY2il-pU2dydDa;G<Z)VlR=<F)fv&$QBf?m6>lFSAQ$o+eYAbmY~R
zqBA$OKPR2^t=GSE1v0p#yqoFY+H)W)H(SrBK6)^JRrv4w>tfR1FX@x1eRO0^uH5UI
zqdixftj`Eee&73K#`{Fuy~Stmb*9dhxBhk``S#N{PU5=)UMD+xa(Slt-9PzN$MnkS
z`g6tejBUT~JpcA0JGfi|6?exUbKUv#%zVCuS?{j@yXzO9uAO_sHctNcz3=<PH~$vq
zVMyW@Fy8co%kqatyh?IulqIzFkg(<ee?9As`NdD_c=OK8d%Lf9t<{caCzsB@^Hq0~
z%GIW48(!W%^2oI9^o4B+HlU$b15m09+{pCi?%uz*_s;WtHgCS&&Q+|ZFYa}H#>!au
zizAzP!>P&6d6_Et=i)ErpL)9IfmC+&uQQ?Y`#vAB((>>7DfRuslO_7w(<e`_>)$P}
zbDq1l*Zk_5n&h`17oNZM^7$X_d7n?j{8AVBduQj9Ka)2<IY0ORB(>tu`Idib&Yt@j
zI{D)qwU1B2<>i#0uk0^Pv8~-&wB=Rj<?}lpWv#w@q*(98vp-SBk5?(C`>$F2>B$WL
z?02>AtK*xm&ri^qaa2T0X*%<rIaQyMeylube(YSP&~*Q`OD9UzZZ-A0GiTem?s-oR
zT(#scD1J4$Ki~H2HG%bW=E?Oe4BP)LXUV4kQ`Nl^%fym;gYV4tekz?^EtS<3K5t`K
z+*Osh;v@E_e%<@IOKzU|9IGcPaX(G{^3J!<pY`Qo`uSI<uO3>zPpY8i^ULm)=3&a$
zqdpwDBC(n^y<zp`sPdx`wrPAvtR5x26gGacc9FAuaI?OBt>J6Q<g3g1*T3q$Y9(Bd
zosqrvE32BY*s5zvW(St_*=&r6+VN!V!q&$D`8`voN1Q)z_44rAjiv`J-^|`&Rea>x
zN7+}MPrE{Qhu2=aa@=T*YyZ-RbAmP>xu381eB!^Ly-&{md|~W<$NKw|7vbI03X?9b
zKlkmzS7HCxQL1GsHP>fFy^OA2w?1Z#%*HjYeldCc-o1M_+OCVZHE&)`(H!;}TQ8dx
zJYV>!N@i#E#(DNq)n7K8v98~E&$80)TFdDdg-4|mpC{HfuI!A`QO|PjzTvSaYjXPh
zC$CQ5PWgUn{nsnj{>i$3X5BvhGkyP>&iSQpnCI=eb-Su)i*4<*D_5(gPA>fQYW3PV
zJ(t(-lCoakmEZN&@C$o>a!%CdGrQ|LU+O=7X0g&Ue&4k@VsoAwJhqfyXSrryRdTkP
z{Cr0De_WBaQTo|4#JyvaKJ;u&`0%`KkKFM)bHw%(Wv$uv=*T?xXCG{@WIbKU?5~qt
zxb;S?_zWM9GQp0o4{rwWyk^|~sdwwE&C5$Sevo<DeDm_3y0<~G#ov^!mGgB@{H&1g
z*Sk?n=DwnT%)H8+qK>Q0=bvizN94UaC~3;B#y?*%UG!~VHlN?s)w2(u&EMo)|KaQA
z%(X`MtNYH(KE2gfe%_o_Cu6d{T+P&u`}!$MzJTxRN@4ZsRmrBGo+Q|=m~NB2^9WD&
zx<z+iFS-|V{+q?O6EVN8tdw~?%lnSZ)&rJb&UOmlzASZ8_56g*UBCJ_i_g$mbEV0T
zFNWv!LzlA$y?d>y1&pse4zD|#{`Skmx8*6a&!^3(JLk*u+A*%LGWoe$UeDW?)s;K1
zT)7^#{oCrwit4M;%DG=Vr?-8Me$;d4<94RKU*9M0GkfLpB<tks<gfkx*W<4pUtes(
zANM<b&c5f%uk9-MbZ6E4UGvu8yEAF&a_9Za%liuEF5hSN_16;#$>sTcJ<a#N`N#cQ
z`#_9;v-pgiNhW5`RbEWCtK{2x>y+}gX**AC<*Ri2rns(hgR)^!T;%$5=VQ)s=bp><
z4E}v0bpEuso9z}~pIkW|>VM|N%cED;&tTvAELcD6^=e;j^RLf}|0Pv#bgnNbzLj?O
z)6Rzd_n)7)TFEZFeA_-V!x}fc`d3FgHrxGK6Z-Yp#TDMOf6n7S7O=mo%>LTH-J98!
zvvQ2*%)b-&_sAvp$+ag6E$VA^Yif?m%&XdY>q@uoO=mp=%ZKv}K3`pb);M3+pipO)
zP2k2S3)k-0yXDE#rMVBzHUEtBJ7-q5uJ7|{sgt7Y!q=<*Wj>r8o*gH{t+wu1L>&M0
zX4ClGtLBf+IY08Q`Wd<Xm%CTK{_|yPf5iMhWxep_-2AOy_dGkd|5eA)RcarXKG(1O
zQLyo4bLZ{j6`uOy+V;86KFV%YtGIgd>ZI}|aXN2f>^^>3t2-@h{;wbBjB5=(K6#m3
zykP6PFk7?spT0MO{!QTa$({6Q-uxPMm1Vv$KC?}qHctG$V#lm5;plK~^TJ1G1m(}2
zh&t!)qwObeSS>XBdYaznmFr7SES<N<{pi|wU7Odd)|LhbzYg1b=Sk<)T{oxCDSUcW
zrjV~Rs>o9R(HX(#2Fq2;x4bHjotwY)oc;O0{jWaTtV~|}WaZndcir;Ou2~%a+oJu*
z)#aw^x6YF(d_D7c)6DCuCadS|Nm(tX_v^^l&3X}^I-XY)|J^JnlieY`T<*-CYx_>#
zzPA3><g=WaX`i*cdMCe1oVj`0o;CbwaoXo)u2mInDe8D$p}X<(gxbmL<13F9U$ab&
z^YK2n^V^0ir<kK3P4Zs1Z`-vqRYhB#e2~4leR}ZnsmZ)wpB;VpbkEVFCyd+bzGnVu
z-&nWv+RvIb^E$6C-f`adoc7nOBRyBU&%Zo5dvo};fPB53wsD`TV_vVgy38-<q}BT;
zkg>Ppe=H=P6m`u09JA%Yuc)07ZjZE=^iN#<_v!h_^Gm1S|H`SxZLHX~P5mDCwbgTH
zY%SXKWn2BDqK(f!K0G0Oy~(&|E3eH51@+3A_A>j!tA(e1zR|`lKks?lReziFhxgoi
z5?cG}%kwXfZq2ceDtw*r@W%Z;VS6`jd)0Yz=Jiv?*SeB7w^xEDM1EXcbbm|Tx$8f(
z=hnYEIkP<XO7_`s+rq2r;k8?Dru*g3J+(9}Dbl*|>r8u@`&E18o~_A`(XIR<^W>93
zdar8q^Mv_b@0UIcvM<^zmsJ*<pkOsIORz(8-eIHrpI1I!a_0P1w(0unkGoQBi{y%*
zr|Fgy&sno_{nq^-&9*J~)Vc1qCrR>haNIZc&nup%t>L@9dT0DztF?c(oV&R%>iK%V
z=+aRC7|X1UpH{23_Z2!_dtO=5SNU(=Y%|NG2=}bDy`jsOCB1qY>AtVxSW?#9_NWg}
znokElwt3R^J*TMpr{$XE-fPZHw0iRNi_VN)HtMBOme<Zi@SNVzcT2SDgJ6yQVvu~N
z-0r-Ij%7txuW_E7>K?bIsQTljBWos?_1%BH{@lKmtj@uf4>}{mz3tlXoat80m%jh=
z#L~XQF-cE)-sb1{%{BX+RB(0m<x>}%jGsiGpCL2jPuJw~FBYAV?)&!kOxA7-U4Ay^
zmwneSo8?viieDd}wczrq%iE5ebAI)-Tk^1I@ce5sHqTe}pRM^-B)q!D@<Gq3*oC|0
zA3nKrH8f}YtAr(XKa(~b*~&hZ{k(ngk5^l>I*L!QZgwlW<ezuVBIds3t@%|+k=3=0
zD?Qa;vTPJv9m74#{MxyX#_RKWe`lYZth{aBzNob}rZ=v1G%wB1-w=0h&(>KMa%Z?t
zUhWFdUf(6G|Fo*|`2s)g=`w{$FHfJ`^=#v-r;Rh&i&gw{{QUQQ%H~OzwzYD5_5IQO
z3t!(pIsLQy?ArLF51-G<T|9lUnD^Z+KdzaEe?ECIT_yalR`CZzOZJP+a+UL=FG@9s
z`^>$z$55(PSE6}FW14>5)h$Za{MU|0^~d}=a&!H3_S<DC{;%FW{quI?KG$bQY#6&8
zO_pmEe>$63tv<K%&zgxlqx37E7`^-Xs(R<G@V?TkQnQaYSsv-UI^%T2ys&d>v-dvR
zQEa-|{??O;#@C|m?^u3*PTgAFb@wDz&;J`d|Hs1@SJU>sF@Ap9e&K6N`|}4)?d`75
zujBiDbN{0w>x}o+{E;bmb}UHGbgKDvZr(dj(%10Kp7SP^*YefXN%x;Do*4Y~!OY9o
zzdZ}uxcA66_hf#ZA9o7=Wli3_?|_cz8rBC<EzkUpa9)YXdnFWnee=}xo~Ikaf8BJK
zkIVWX`RZ%uWbVA&uSqKprmu*1UF}{ixOD!UFU5YH%lG@r{+OD+W~=zdy0^;auN#-D
z{mrci?N|FfxjZHJuc~cn)vqf{^5uWezwmXA|NB3}>!16-`5At1`o1qqUuMVumin-3
z-PfxjwaV=KkG(p&eWU#E8^@O&xBvI?a`?VaQ(boz|N8UX-oEzp?E5k2B?I4bhui(^
zd0Lfs<IB@z$!iB!vHJU-_vf>7whi0=sCUQl_BB^0%dPyp{o605$DL0eE$LU7J-hf&
zRK?5Hhm9^+YWc^^j@cm9oXY#>$%EPJEw|3}m(RV{G=Ij{VCHtkZCz#Ot+NmPK3Bfa
zxb|J~{Mq}y?|tuS@8bVx_x-=`zRWydllJT1_x<}%M5|l-eN*%OKWFv6il^y1&)MyN
z9Naazit)$PbRBoz*B?&$*A?xZI5E7Rzu)xNmF0G(wO?1qvt~Klev7{U>zbagzy0>M
z7nVVj_gS73zrV15>fxOR{$@|l1fN&5|NQFcgIniI&&8Y#@B8eY%;!6oU1IUIw&Szz
zf8Y0gZrq<o;_ol571?cSTYGJ7?Zfci(&}&a{~p^fGvEL7?Bz_q;#t$&PTyzEo+~b!
zU1a#^#J-oOPg^dVA5)NIs8iK9PyfE$rvt?^*jLL`pIpE3M_kUe6?@kz&x<KK(s^+5
zYX3N%v%jn*gjK#O8azuXaLYRIWVvtL*UoBXb+3KLR&ESGceLi&kqr-eR!xl0Reo=y
z68H6qQGRY^#HaPOZ?l)z|Gi#6*Y4lP{_Xbvg6BLExh%TA;^@n3+xLAf`E_}|T$J?s
zilf@g>VI#q&z`M6`-rE1)uoqvp4+}J*?s$N-mjJOe`#i(-S<>Cf2Q2O5AFWy_CHT9
zkN^KQe!gD)&(rJA^ESQy{&jtQ?XLfS-`m%I+dO}6UO}_8&-T4<b8pYN_hp&6Z-2!R
z<!d&tWQxxiUiQr^n*7pe`pz>_^^c|RTiAY@*dOyf&F{JW|DVfW$9>;*`Rcl|tzUos
z|6c$9yWYL14UcWUEaabiuJ&EA|Cy)q{~pRO3*Y-H^z|?MkHYqbe?iCFmGl+QS?pOM
z{%gu|o2LTjY~L03zkHK!Uwv7&{7&Iz;dvigUMlieo+#P(d2W7eH`Dr>r`pRw*0ryB
z_%^@(_qH}W_lWBceA2Bhe>uQzS77yd=J`E#@}Iu%zW;aG=Q+=9a_emRdA=4uKV);h
zY};m2Iq4_MOqab|w$=Lj&U0JmWzTl0EU0~5T)OM>+&ri1M(&t|T{q9>ZM(Oo_H2;b
z{LfWiSI67d{yZI@x866&?S1L8WrBP*1&wRh8wZv8Ew}r+^7iM7zpvx>@2%U^mVMgw
zHz*`ef3Es{%zU5W?_D2F58l5#dH$a#-`ZL}m;E~@dU`{<+2^FJhw1xXP5*K2LX>*;
zvN*X)x8Cp<pB8_;a=q9uX5Hsi*Zi(sSatZ->Dc%L9~I4wI?F87+uyf**?Mhbo5eMm
ze-C+HS$tW2_UA!U{dKC#=bM@S;K@3Wc;f2yQxm_RNw?daTM?u1uI9P5f4a?M$>sd@
zKMuc*RT3B1GwM;d``CH;blkU1FE35sS91Hw`KoK1&F*!_eOdJKAb;J5lI^?i=3bXq
z+0OFfsQjDa`M>X!HEvATu6WQmtA@+s>PkP;!r#q}@3`ZCIBkw8cyaXDr%BWIEXnQo
zzUR5^Z8hd_UK=w%Ga<buP)fXgFEH-+t?O;up51+BwmowX+dCTr^;efCbF+)zw!Zt)
z@3Q~DC;r>~Gtazlmj9D*yX3+K&l5X8wCdln`?&YZQvJDh9~$|$?7H%KvaERGE29m2
zP5+#5w=?<++S~JG0lV#rwGXeZulsszX<zmMOS{LC=V#PCHm^&L?YDXV;%%yYL5<#&
z^_6F{Z|yYj*LyI>``qPUdrkkXz5i?NORn%8POG0vUElh6Pek!C@%=xJrd7*aH-Fu5
zaelP#8hLSky*lyTH;!I=?%{Zzd%n3v%!ZvBmR0LFUpeu5@3|9}%dPKy?0Z{!AbX-Y
z$DX>1#Yd%;+p|x%&g|woFRC1GzVq6?ybFQt*ZK0}c2qQ4ewn%5?%L-I{@vI1lwMix
z8*f`vn|p26=eL{Vv-Ne_o$v2#I_(>;^YdE4xs!~-?c4Vq5J+j7F;QaQ(Xg9$Cwuv<
z6+V5#D&gAX>6V}ND!S+PUp{=naLcRStt)+b;?K&k*Sw3lQ2%AI{M@(?P2yX`?d$LC
zk!Ie1WvQO&-#_R7|2ZPB|9J2F+WgydZmikKadUe2CD6X7m!N>Z#df0Yh&pfeqNn{6
z%HO=N|NmRvj`v9db6WAvQ=#iF-D6Dmo6p<suhOF(`_k+3-gl+z!}`lxEGN0Ydsn`{
z`nJZN11J8zod54-sjZ>zd<l#8`M-D0&lZ?}POtjr=~;Q%!In7{HH(UTKUoHOyt92@
zdA^GGebMyYGqUDKML63nED&7y|Nrm$|M`D+HJteM;bgmih4_ui?fL6VC(63_{FB*Z
z{5|G`q5pZ;bye5i%}DOcw7UMI@_cpN<-?8V3*N4p7xT2?Ebr?X`|o{SXa4tT{J*DP
zb{x0OtGaPm?%KKgbEcU~ys!JddwKl7r}1L9QmfY+Uu&$){cQDk>zU8J&x)q+j`@A%
z@2=~6^RBbDwOx6<^TTBEt)ERB?_KBJ*BqS*N)WeQCvo=_Pj-&wOD;|5I}=*_RAu|K
zP5pb0JjqX<+kU5~df)S8zS9inEl*rNG;wwO&nHha9$H<ye~{q|SGVFj(d`13{Igg2
z`h6>OI(gZg-Tv=9xtzR+{+eG$uK4QIR(GBBjX86x!193c^u7O{#{X;GQ0rxR(vwfm
z-pa1>L;InG%?}?HpN_t_>8Oo`xZTqN!$)%!X3yH;VzwrD-lr+K#jM5We&pA_j=rtV
zU|zD}UO@4!%k#Fy%2b%|Gx=e1#5!dk`_0!szAU%j``WtcN_C!XU$M_VJ4?MyJKL@`
z9oC&3<GkU_{SR&CIrBfv`}bw}WUD7XMY2!MW#4-4^3G1-*Q+O9j!rI~n%%Q@&Y9d#
zm2>Yt65F1UpV4Rg?S|gp*!NZ8uMeu9zPDn%vBf;)?H7OKO}u{dj?K}FA8tMG6}rFD
z;LO9~h1Iuj-`n<Y%e(u$_xBcTbj**}t@_g)^F&E_e#FkRUOMaiYuPrk&v`P@{Fu>|
zWZ9SM{d=l*CP|+EdCh2k?E#}}=j&dbO|(3+xot<4>9MRQGtW!?=xesV!?$S0l0!$n
z=;jIPSn_}JmiY;pvb1`$?Xcxx|M=RZm)CbL-DhsTMed3A@gL6ezXEo*pRavnb*1^U
zXS=`r&sv{nmFdS4oSDxb%w@Z`usFK&HWyz-O=R^#?${N3cl*V}pRSSo!&n@B^u2SI
zzC}WgTTSCR>!*8p?0yz-zr5IA_vP2+=&SjMS4urQf9%lCU2UcBcDB7RKF`|me%`&G
z=gQaFzf9ftP5E5qrnH_bOYTo%mwP3}y!+ot>q~a?FG=iCt8TvS+p~GjQ=Qi(^PJz8
zrp=39y{GQ4iVtJavrb!g1G~`A&yHA5oP7HAjN6l*9Qm>2#Gg;4&gb@2?Q>54aLdGf
z&c2ORTV6etJnVaakLd;;i=Le|-tQhCth)7vQEguF7T;%2XKv=Ri2C}e=i$=)I9s#h
z>!MR;dL%xI-1Gc=;x&c&%D-nYA2z?X$a{W-9;gO+7IW$Ru9LGrU!8Tm=>I%_Ci~CE
z_Lsf7uK(K8{Wwf=cCxL#NssZIhdgIL>22gQxxVY#R<(OGi~i3nf5oHcwnzBS*7)CB
zw=TIBuU;ne?4$qxFaB@mzUa*>Sv+l%J>z}VLg}XWOgp9?%3b~E$W<0={`!B<>+jil
zO5Fc(%zWODmIDutbM4vv<Qm6z+jWJ#**>5)mioSw@|?pHSD!T%Sv~FjK8fP&6S<;h
zUU`cPxhMNOdnfPzye8X+Ki=6p`+3Z^hbMebvo>89oX=9#d|m7O_SY=x^Xnh|vQqZn
zTQhg%#YM?BuLAqC=12YDYx92$YH-|sYZyQI!^cYA_%DmZbH%N)H(ZOE@Tv50zu1li
zJIV?^Gac6T{`zHm-PhpvF<N1!k==7@{v4JqJ$FU8xX$*B<w@VZy8L-bE7wO{J<WRF
zu)5JRs4Lec?tabIXHRFTUpsznk7eb|_5UW_i@9pB{>;qd-`vhEpC?@NIVxL4yoZ}-
zhIHsTXZhLg*H(Q!`SGsf(N6t}gWTKvy<$>!90-_P-g&3%!CW($wrP8st3Taod(c16
zM!b1vbk_ZU-?raYXSGxPb4mYi&~8)rxoeL9t-Hs1`!$pG{Y;A;Q;+j=%uu%XN!XWP
zaaekp{f}n*8BY#A{Jl!G@9Ue>%b9AD*Zlo@c4OOK#&h5KYkr>Dv#xmVYm-^KRz=Qw
zZg^Z~^Sl0a+mBr-&%2iP_RpbtKR@p|S9oE<>ifGpqm94rQQLW;W9ifI!k7lXvQ3lM
ze!h0$Qg{5-vwP1y3Ea+iZ$iPxN4#wFlXgz{(D}Q({(E_}{g3%Sj;KeyTUWj}JKFwr
zf%mrWvvz#n`+jen@{WChAH~*JWxd|K?nhJ+&*#+{UuWEyGry+xwea%%xNN`Z!bfMm
z#$Enu6V!Zdp?-Yy=VKA3-gTe0?>dljQRMOSC0hM5${(L>Pq8@=ym;-e1?A#VbHnP6
zy__At$@}y2X_aedgw3(%GE2H=IQ#UzPd9En_;~x@DdTTqJ^M9IS^fC%W7FT2{<T@Z
z4>G*J7x(Ye^zHr}c`Lq6&gac@4Vd1`JNG@)+3cG&{Wot~>=gKWQT}gWwfiaY<1r2|
z-zO+HZa4XH=)2wbo&MGCziu42E33LRd7cTV>dTyL;Qvaua82(080Vr#FY}|EckEgH
z57g>?IsgC9`Pc6=rs!H&ZkwAP`*;uU)UQ7#I^0V;HRqq%oH?8AW?PC+ES~py&g-v+
z?WuQd-%P!B-GAS?8LQVD>&5U?t~~l&{q3H85(V@AzDeIc|J~=my!+>*eDF5kH~ZuC
z)N`v<%jIf(3#8xX|9h6dO#S_ztTWeppEFH2cRFS{e~r4{GSThnQI?%wYbyG_9NqG4
z%Y)*-2cK7X@7T5FCVTF)56|1~?EJIteZr)W?q@CLAFm{Roy)OtU)Y&lueN-!kSN-k
zq+9vG@ovnzM;~6lNDRH+Eqq#Po_772KR#2=`tr<su70ds?hn_Q_W?(q7Fl;5lwT3S
zTqf6HdE-dM_sTnk$G6TuAM`rC{#*L>+Re+Nbgb_A7Hju+bKCH-mCC-VoPIi2H?Q}@
z%ftUpUJhT+>ObE<yr%#2!nyBR|A-{z@3igvy7kJM>=kjdvsd`dE`F4LAm+`__PTSb
zpI<KDckZ&xG}C9olF~2lu*$@(&0RD1af)1@v&`w@qZZ3z{+ulQkU3rd#?OC?%kSC!
z|7rEO>A~wWRv)H)`Ea88^^EuO2P^*l{3;<H@GQyp*&4SVd6^%(PR^hBJ2)@z=_%Lq
z1^-sRc%W?4CU*bl<L4_(&#t_x_t3UaV%oiL=6<X7`z`pZCJQTvHJ?@V@3Z_ZoxOQk
z#I0EI898CxX?olt`#-G-{<zAxZ8_WO_^*#%Z78@h8#G|n^g5m2u(UmU?O9#^Ja3!V
zk>{iSS94{5*6Z$_dQeyMU!mmxeJu|wAAW9K8o%gM@pY>?*6|^qKl}g7J;ojX<4~FW
z@8k7<j+bA2s>U&m-SYW-o0_jVMmbFXy7LQvzB;;bj{fr(6As%}-n&>lyRW9`in@Dk
zR7H$RG4ILM&!>6DI{#MZx04p1EuVd2j`97bx$FhSGw07<{yCuk?7v4-)7MO$URAW$
zMy7CIfAzWId6)lf)Sj<$#hCqT-KwO?@6MjB`opzu-?<;28%x*Rouy;*VKEQe{5g^}
z>yMXD{P}*$fm+`ymRGkf+dn_(v(h`M5ZkTKj|puL_xH(;O<rp;O-|;?ne6AkX0NY$
zv}SUZ>1=~6i%Htc-d;7{{#s1Zg=^{54%6uo=fl^tMQ`kR`qiL_r}*l(qJ(o-TUS~=
zdh)P)tIP9)v*up8Ca}M5=Mz=^oA+jZeDpk4Z$3lC^<%X;dFppx`juzxXL@Wc{BNth
zxQLmBp2VHiX~NIFbN0O`shD>x!eC#^({GI5H~pNV_^xWjWwS$!Ywg17)(J}S8RR7w
zOiaA|Y`@=x{|4_ty~khI^RDeYqN-=O_p$8zjQ<IJ<)8j6Xq5TCp+BDe<I2W^(~tgH
zY-Mrh{qseWWqzA~I@kQX@#*xEGsjJzbXVosUNikNXUmmSR!9Ck4$ph|@!g#FjuJ%|
zp4wQ7v%TN<Ip)dsC+C_s)^1EV_94RBPBN`8et)51`G&qdZW6Dw+pYdAuh=p7<mbb8
zb{KrP>sELC(VPwUW+hL4K5gaJx86GT@#%m5MA|%`B4P3Q*_|Ip4!)l6-?4}BQPR<b
zzCXDIdh_fn)|sy7Ec*X7{{Pmv?44ge-=A8k_u{q9fp69;T<zP$;_t+rTNzb4b$y@B
z;#WQ4H=TbsruRO%9yc}nY}QrPc{6M`^u>zL@S3*7H?in!_DRc}TZbQ9nU!$OkNe$*
zv@GFZc6&?P+GoM)=5OP6tX%!?{oi}<x7IH{xK?{#cESh2dHp|QSZ1(GYyRiec=z{n
z`?2K$Y|`BO-|jyw`|iTMmrv(hFgReb;_&YLJkgKucKusyzfU`{c%$3Z?Mc@BS57|c
z7x}bXENjEbg1{$cocq;2Uw8k*wYrbp<^f}FUQEUhbNhY2pDUf(U-Vqw!e~Z)|6$e>
z@rw?gwiMjW_Gfu)#qx9FCrWw$PJi-2a!&esKFfV4_PzAYzg5?9U>W=MQe}Jd^EToY
z*UIY>`qu2+QdV>S=>E9rpZov+=${r5ZSm)~sHGkIp2^R@9=P?<IHzvLfdsp6*FT-s
zWt*?^W8LA0mI<-VHFH0zdCKtGm>xOzGSk0WDzSR)=Tw{dAwN`S{FiHs@Ax?DQR&G!
zGR4_vvzxB_7X3WFtw!ln@I+I->$}`4=OtYcyPjsh;mIlS%c~U6EsUFMS^4Vntkp5u
zSN81LQmJ?CUE*#N>-V#6zo`rlJ9*QlI5I)s&eUvfM{U)fE8lCjp7E@GI&<=Cr_9ea
zN47l6(y>dQ{$r2wGiCetYkoSP`k7|CuP0UbT>r0`*Pl=3jW4)-`JlB+(!YYEFPW#$
zi;H;h{mZqJI}a|FTl}c<;;B1x&i|=cesa&>tN!PN=ilzSvudHbw8&P8Cu?5cIlA%L
zhsf-@Tc@PHeMz#B-&?GFKBjiwikW{;8vEPLd}i}G=E4V?XW|cDtZ|+<aaL~a^ZoI*
zR@pZun={pjAF7{qqVmw`=ksSAyk+pm<x10B_G>MskCl?|u2JRBuD{1)^USb+=D#=R
z|K(Ucn~^NFG%F@M&OC0*q{H`l{`*?n{ViH}|9!%_bKO#=?-IY-RR8jwV|CwV`<Kb-
z^4Zs8`2GFPyC=tfGJTg=Q-3C6@6)@5a}1KWBd){*PhsCt`o+MaGkW*(wKh8+{Ce@_
z=tj9`lftVdSF4Bh=kx09aGqmP_*v9@pN#H&j~|Z<Ca;gGtT}YD`*e)2*|s%|{q`0A
zUj(yX-}mTM@5WzOu0HRNvM>CyGVz~n+@l<uJ*(4XS4{o-#IXKf;VN;3g7%u{c{%s~
ztyy?qd&c2Y$BQcXimnJhw=Vp=QvLkfC3DhWUEEM+8T4KzX!FVYVfyFqUGv@ZZT~aV
z^*8I<&aGYZ<mqRB+pNNOGAEhSZ7b)hzLQzC)qei1pI0gxe|TD3vX|ESRun2um-(kH
z9`ohL_Rwm{NM_l+Lds<g#T}_SVPCV(t`5)U;rDwQy4Pln>60a@+t04B`Mvt=jk<(i
zE92u61e`xj;OU#sdSt_c(k~lM6$;JXVacDhLfC(=UD!M+!-CqPA2NK&ubY=2+jZ+o
z8gK2_W3PI?XIGb26*o?gsVy`;^2_qM-1(ZTD~?YpR`I{TM{38f;wls8`WLUSm)_e_
z_o3+Tm+4<}&een;u0I*E*X--d+1Do(zsR0z{PW9C|C@JSg>Ap})oK%4SZ&hP=VH?L
z%YV&}zZEw9bAWPMyzUOm9mk$LO*nWIJeqv6ChI|p@9VDB>UMJiUtgJbMXXtSe^iD2
zwCyLP3KA4mnxA$GSPRYn{Pf*%BX)n5y&JcM8y8<~e{WM=dUEwat1A-O!t*~r{r0BL
zWUp26jOR)Fjy)>g_NjNPZS1p4?b&PoCcb)kvf%8-y%UR9|Kp52f5%q-?Y8IVb?xmM
zKdj8T{44eBt>wo~zWrJKH2SdRr<L9Bzx;S|OZwA^vp;R;N=Uh#3zk3a(YJAqn+E?(
zZ~3U+?k^JxgzMkU5w>5F!BClZ^?AEV&sTK`wZ|tqZ}Plm^tY)saJy<=@ciJOk80ZY
zcS>d-UAfrb@BXhN4_*nGPnR;RxE7qx`|*_Gx+;UVsJ}bs_0~L4H0{iP9G=^|*=;Vj
z<<Dn5TOSpCJ^8ZPxaaEH3!-^`)ip0yR$Kh_e^GVq&gbj9o;~>jlH9TO#ar)3s<xG1
zKOK-Tja&G+|HJo16SM38osIl=>)f8=iS9l5cD074$090<Hu7zhTJ0M%_u8(a4KuxM
zYArhhwX4JIO@BPQEWTK8pP|^im^I3Ozp}bDx&~$FwTc<LuW^g#cHeJVT@$eWOr^@a
z&jRAcVd=63mI>$L*W6m=uB`s`SCqxCvo|X@OxrnYz0Kptr=QteS{~n9UECgASbEE<
zyrA^fo8^AlwXYjiUtZO&-Ih9M#+P-@Q8jI^AM9$_8TQMT``C=j>o>LUivw+a+S<GA
zIO}H{<MsJ{zlw@=kDR$)`DI5^W_8u4lPimrj$hc8@GP+}**C@3zI2}UjF^q9%B5`c
zuEoSB2&5=+FPYDKuy^_vzpy^D*WYS3W?hZGzQ<ytrQvf=J;P*!LId}tACc^Rg`cXT
z3@jsRzZOe<+>&+F$nSp5*4qWE)RMoRv2C}AIQzAt=t^ewuNd`8@2cOb;qkv0ular_
zroHF&&(nhD^EQ9l^h{=Z`)c#)g}<JG)^$9u$(nKaRWYCB;m>=XG#GX~T|eRK;$Nr2
zn|<f*x#eCHTKccBbGxse<+;^KCH`k3>dx`abAR+>x1K@A=OxvKtw)NPUTrWFo}9jB
zt%dL^&~^Yzt#x93mWD~SpMG=-R<C$}H0#RYRDtY=C$b+jwm(@C7h@~7SGjh>lj}EP
zvM#N!dGxn0%KY_=V!N4_rzg*eDNZ`_>y!4hpTgbuwjRi{`v2t7Za2~UX7|G4D=q!2
zQrFC%^<}dDx@FIV&dXS||C+`8++*)Xsjo#F<gR$n+ZdD7W*UC+U8%t9n^EeP&))d^
z-JfGtXsBb+KEw2k;A?eu`{at<dIpg<m@GMKTV4tqSN#f2`<fBAZt}^fU(bT}pA6^r
zuT8Rz=Xu>Y?eLANqRz|eX(#;uYHhAE(cgZ~@bkC$OS4b!eDVFux6tyMTUB|tzZAVI
zsQz^(T7Tmgf1Rr9jJsd{nY{aC`Cqe--)5b+T;=OC|KG2Z!iTMnANjKVVsv=-wOy~O
zzn)onc$M$o9X8pL`IG(M&6!{Nb^5c6c#B`R=Iq~kB6aVVla>#bv(?l#Zj@Z$vQbBa
zO}{Y7E$LV2=A?CUFSkzFo|biKy?RO>-~888e=PgF-At<XcUR-<^tWFwE}1t+s_0kN
znaRaBjz{Qi+-GL^^JaXGewm+rdwz8F`d>EgRcBsmpZ^*1C*!L1ec!UYf3r)TZNHj-
z`1Dra`Ef6VU;j*s_<PUhthM?h->*-j{C!^?d7$(2nnU#KS<dw;?&l`&ij0qs{(Pi#
zUcub``@;6l>YBVhxwbKIN{gjWO!nfev%$jm_t;rTIOlEEmHheS(dy%%xxRM0w0*yB
zUs)w(RS}nYQ2Y8G3o)OV-i<beI?l3oF>QCY`~r<B$gN9WH|>|4Kacft|8tY(|B}lO
zjyo%p&lkRY?&Gr$Uu`MgV;K{BYj45TrE0aGZ|#hE^z!$g?$Fz-wcGDZva7u6&fa!)
z`8<g-Kjn3y^RGqSkjXl*s(+ukkiTz#cAU2QW5@yysUP#=e<eK1ym})(I{RCJ;hSGf
zlNEZ4QZCLa4*D?J-AC_pQiR)6;pq6=k5ku)cC{~!xo|D-)7<_UVKNhEuy&lyHlF_T
z%5|$JLH_rY3$wrf_^@X6wol&{O`lzQ@Xf{9(=E5&I&#^3|H*gmn^!*LG~GXctB3Ee
zQr@bax%28vPM)^fd!4gZ`2EYZ6Zcr%@0r|wZSkXwHNB?mw=SD=<fvAAMBLMk)sdUB
zwnm1}-MNO_Er)M)eC4&3W|dD?*=4VqnjDk+ohevaaZ|vv13hQe-Sj>mE86nlhYU~U
zFH`lt)Emj7Yvqn^ndxm`-MRW=)AKt|5+_H<)qG}P(EaA=;uzx0<Il5NKd;C4%&*R~
zFP~<t&EzeO`fz5Y_nDo^S6`kszSebH{*L0Z*hAXv>t=-2p8sZ%bZeg9n&X0(Prbb<
z=k9a+a_3izq+6$aZT_mtS?;`b<cb>G`RA2<+o#zi8GfC4SlmCa=*ZKRhJLHh|Cz*o
zF0e4kbf*7286D;4+nmDsUzsP)T>meK_j%;+?&PcL?lE!ey7z_geHJ>rJ?~LxC|{xM
zU2Y#$!SqD6z>RDr6(_Gw@AmDHlSz0K1?q@So3rNj<E3glMbGaDxBmRiGwzySOx~-n
z4`&{)QqePi{rIrwyr|-ccH5qfE6vxd9yhpV_TfPD9MySNxkcMArrXzM&z1NxZ*|%F
z*USB0OC?Rec7Bdk?$yJ}>2a&$_U*X#548Bh|BjUH?Aldvb=O2LFN@=`ZdXs=Uzcx}
z6!lv={I$%(R6qN|=b66A*(r0X3Jo8t?*7WE)}1qJhH!(rxQ~2xjN$Kw=Zf=dvOc^u
zKYnu7uc&P38d(0VN3^FE`^J59e?76rAo+E7?xoe6ms_o^dStU|-K);&7N0JM)koV}
zu@{$|d3jcSd;8pgFO_mH&!3I=JKwZ0ImFhoe^zsR@wJmN{mj#3{$A-0-CJ?a9lTcK
z$cKYZ1&rqi*PU&Y?VM=4W_rXt;R-p^_IrEk=5DXdx%z#_InCmX*Dn&MChvL8v{`&1
z>jq23M{APTB^`TWdt^h>tCg=Ay!&=YY_wV{vv#kMzFPWzv)2*!hOeY1PfxZlN{aef
zaG>X-?UAag?B#K>N3YC2{!GEI&(iR9=JPMlzOQQc*LS-%@AdtTrw?1!l>gms`#(n6
zbY1APBTpuLKJk=!@@l({XJ)>CnJr(!^Yxju1phZ9|2eg5lI3Pc^ae*4AK4rD`ryk%
z+uWkf=2gi#a*^zJ;!X;#F5M(w=Rg1JT4nR%Une6EmBl7x%sH%d>&(*mKX*!fIIAju
z-?@)_f<@h<my3=2&##Eu@Mb;#yA=|q5>b`a8&|IVx;EDG!;vioSJm6zD=uH&t{hkU
zyfIa!|HiM*<@)Sr79NXvt0^ASH>2>`fiuzG^RDgrctJiU`dZ7^MBf<u+Uwbwe^;qx
zuRLyK)ZTaTa`$ta3#-i6vtG|Xcdj|=_lom-_EjaXje49_{WETD*UHPY)cxkybxN*2
zJj*{mF6vd$l4&-Jzp-qVvvWSDWo4otS81zzV;wh-gV~mjX@8bI>^$kMYni;pE~fUk
zw7UM+P-g$Nd)6?5HoT?IsruZWT+DZE-PcX_J3$LKR++zhX}o;?*3IjF$?2QETpgYr
z^L(0Aal}vWs-og#zxS32{ykOKwa?!-Ra|bry>4avr>ln#o}VGN_58A^7qZ1w*{3ew
zx^Izt&3Df)&`OTjx6?OT<*c1)d-7!9da-%?Y_{6Q)IJrMT)e{cnwon~pZC6Rt3N7=
zOLRqENQ>gWRUtk5))niCZ<g-oUH|IhisQ4khb8^Wx^nf#&g`|Vws$6)PR|ORxAEFe
z;n(T5AI_{?Z87W0Y36Xy+FFAv$=fe3SNps7)n@&DRnHrIeeTaY@^ZHQ!WXxnl*@gx
znPa`v_xb+#y``(~&Aau)Qa|VD-2GpJ^ruyAnCJGcE_ZFF|ErhT57q9^*dwE}V}{+=
zRbf858-IP-9QNpk<)(9H6-8BbYoGr-wf5slAB`_hCU?B|knb)0RkVHMx7OKqhFg!W
z$@iI;xF&S+=O{z|TBGSEFV-$x+GqFQ-Tuq5;(dF;n>8Q2h-%!q|K^dohX18=+v?xn
zcyjjVt6=Rmx0=cMwUt}h3eQ@)?=%$)f4%dj_UB(kRZ<&nCI97AYxO+k`B?h8=aOS5
zEjoLi|G8zq_1Px#%7Wsk=c?gy8{4;D4d>lawN@(G^g+*+CHnH`=J@CJfHoWS{oy+E
z_w3v6@2^*_ylx);|6lLP(+_<Po=udzmUXbP{mjXOUE%X*Ox#;ls4QDiAlDLUp8Y^N
z`RUU5udlg#IJ<8IWZzp9B|YnW1kdiwC3>|brswWGnUnmebEWzG;z0go%i3pdZ@YHu
zS?}5C%Qn*z>qL8xgKg~>z47Jy^ZVL+tM7DO-GBRDoMKq6f3)Qp<~8ZkJ3c4KR-T-?
zS$_8ORd$9o)!B3HYj#?$|H{gCp(SZ{#@X<7JNEdNt^X6{zxT7rHMRINlhxJL`foVr
z^r`3ZzLv^gJ^%67S1Q;4i5lN?(=WfVk;(lwSI*~Ope4fJ?@asFdHC;d-`e%%NxyFS
zelGeKvGYeL|F-E1<9vIc7gR>n?l{&NnOxiWki|yi%48+A={8)d{`Rw%#{cw7u`gS>
zZs(l-eZ>vRZC@4U@9a7H@Ydm~%%_c(o5W{S6&lnQpFEs?BGPrY{Pd#TGnJ*Z3%;y%
zc>i^FJ@=U%MMl^Bd-qx9K1zxx;4`d}%6>XAS)f`#T|c>|t!j;O?H3-y<efL<((H;~
zPF`=?o2^$^e1+-x1#@-3Hxcm(3e_GeWf2!Fx=#o5FaH$WzJA%SPv4R^tNqQ+{k(Ul
zWx3AJQ!6)aEt+?YVRg;(Md$1uMSZs2J7>#P@HRruOxBvS`NruxqfCB9{JnSI|Jlcf
zU%osDjZgl)g^B%H!rv>Wy=#9xE0+6FpmnW5SN=-)uD=_Kgf5@Aj5;h+`0H4L%r(~d
z_yi%JMNB%%l}8>uD@rQbTC{=hwe<VzY5ZAF_H0U<JAcoWX3O<ku6V{>+vJ|~D^yuL
zyS}Ev_MOnPKNsGor~Lo>qCIWRfro1jn61Bm@Adt8E5E-#etnCT?yN7JPiHCfr`_FB
zw1H>mFWx(q9<@oIPQ0ESKWqA&d0WHu)u(N}tUkZ0NG9o5)Q=y1mNB+_zOu3z995a@
zafU%Sd~)xRNz2!XS_B-9yR|0rr|Gopy|esf?#oS`Uix8j_|79d6|b%=xa_a(Ki9_c
zLBgX?TSEEIdC24@J=>xiX)-f7zVhVBUsuDopS)Hz`-gIU$yx`y`j^)uXI-9k-l8_X
z9<=i&u(mYnbA-W~8NZHv-T3R|<>Svz?79}-e|BPJq2VLT_`F-7ZH?jCyoE_Mr4f9e
zpKVCG7NET@H2>_A_4)=~8-=z;dicyf`XtiX?~!*+Mb?&2#(wwzOq%<;UoHEj@MSf<
zWlP&CbtRbj+#lKA?W*12m-R7NfBU0v8~1Jd)M4yC=kT0sF~?rczMt}a@y(FpC-oKD
z6VAu~DrI}N<;m;U*JB<f9C^0k*U8g$qUS68Kuc}sR~ck?NS~gb92Z^Pu{>{m-L)&{
zcO@Kow&jaw+_$wA$6nYT>D|mWqf&Q9@^x0XfJI_=oRV%F(U~P7Q~9j-@}t|#-a5;2
zTbL~^MUB_}JhD3e^>VY~%DAE<9k%<AT!?m_6A`cNHfKiF$6Mw*E!j&?wr9`T_UqV{
z3;E|7+vW7Obx!~JrJuj{+WjZrf8}3F`Im9UT7B*3wT3^0!itaGnm2DwWlrtiRX4x<
z+Uj?8_2snwBUdi#7uK%*^~BP>s8d?~8pp>8GKp1Zd*$MNR$r6I_TAWX(B^<~`+7Ue
zF9zy;Yb%(Wve$$<-`RV>!)NxQIXOii9)k8?+L=DPx=Q@|D#L5A(f;bK!kg=o&K#_4
zczt@UnBS*W`#yDUPJ4B9>yt_P_YN@gpEO)QHGR$5S+9h>=b5gWTD;>|RQc^2|89TM
zexGqMe{<d5on3ET*Q;H3vbFqt>&!yI>rDqAGMqjvv#rn4)+YNwwD|ppb9y$4ZmxS|
ztCRiZ&z0*n>*vh~>)jY8<IT@kR5`=@-JJQKx42!sZN0Pj>$ZIdQW*UgB}qO${5c`W
z&ttFUPQN=hYF?emJS&*apXB!Ja(wFd?;dmKWWP=3n`c{`_v-A*@aJo;gx4K=x!i8+
z$&J&m$rR2_zBVCVSH}IS`u1O0eM|1mDmJS=`7-g@s<(yJ5mzO@@38f$+iIJabbDQW
z)}{HEPrr;bDCt?H{yebwL-skVnX6@ruPM)u;O4Vgp*p3Xf8O3B8+y(})=!PJ{kGxE
z`JcA2Nu_;P6!k$HNUv6|_U$vhY7uUE<XWJ<JNLe~5&yTJ5J;Kq%ev|0os_lHV_vD<
zpUmiA_vlH{iuE#Ir)JOjBNu+p%<TNhpDSKJt&;d-rEc(in%Er0`&GxzDZcgExN3Pm
zZ??MLva>P2_R2j8p8nZu?Y@{w_o)2&mb+K}pX2u@<NEG(QO|o>Z=2MY-m<KHbnVJ4
z<#QAN9u<zhWG$a973}U)8&&+_%~H^M+mo&37K_hK-O+y0Ic9e4K^yarN3!(JAHS7!
zO<nAA*t)&nlFDnFHb&}B;LYx{_<ZF<iZT1~UswI*_Eo)3y1Hb()#n7B%3r)T9|CsH
zeEsvobhl@=?mzd&B>j+CZu3-g`Q>@vw!D69vfR@5bG6u;E6eRlvlDf76V}bQF#GuB
z;*9lG#WSxTFFJ9uc)jK8Z#zW6>&x!`eOEre&-PnH&}+GC+v~lLHCHa2BQ5bWc<!r^
z;B}h&*k7;jZ#})C@9Xzl|9{{A|L+TEZuZx$>-)B?OJB<-Q}N@O`Tm>de(!kP7yY?l
z+spXpE<SUs@4k)`E?s-rX5Xi&>$hwbxcqF+h1=oxZJvLASH6GuRnNZ4HM6c&Ja4r4
z_~os>dGXe|^?6AdSHHgs)7kpu!m|zaNw<GxZGF{IT`SbQ*zf-5Abr2soj*<rhX?PB
zbk@DL@Lt9Gvg_&+M=d2c*c4jMYuUKXPowhM)MUMnvlg%0^D6!PlM}}Ie9^@>{r7z~
z3`^gWviADplyjCRtzUZjTgm>mk2koJvA*`B@%rmWe<r<6tbLy6H;3)l%IzC>KACy>
z)XdA_a(}E|)ts#VzWe^%eP5R9`^NwObzS<d-K(uC!STtJEA3Bu`We-JyfJ<2uGw<u
zO5V=TopOaaLcD(VKlz_0+?TQ2eQ3N4TE_75+xGpnm+N0g-_MG=7h$mC=ic|V>*szC
z-~a2XY1%o{yv~Xf|9)ld`}0)afBwHO%hmNbp4k0)$iKbv&WAShIqwSEt=FuM*!`;W
zwT)n8`{$i^-{xJ<+U+KGHe&y`mk-Y!l$pjj@7Ix&r^ES=2^>Ek^XQ4pNx|q%=QJ&o
z&RvX?JiUFs%*P({pWhB&tNLb=uDkZ{mRG&svsUk`ZY&HEb5~gw&wX<3wog4<=V@%*
zcP(lrvvL1basS>MYI~)0O^a8sd)r%9e_eU_#7|-S|E2N=b^2z<e5}!ZAG6`*<SqO5
z)oS_6%-bi{W4IhN3alGdn|t(t?60WviNW<>uN_;pb$!@7_xKMrch}jz@6F$IjDP$8
zo##r|z1+5a@7t1--f=~Hr}fu7QC8PusQ)NlzwzDT$;DT%AG&zF$l}uXKPN5gpBJw5
zj?L<g<es-r?9KXruh!pk?XQgbZ1ddG-&+2aN_c$tyu|vPUr(Nd&6%+<*YU`s;$NrC
zudOn_cWu$)<;s7%PWo~mw@eP6Uw1CwZ~oR*>*KuVC9WyeTm9yldx_=wRV#LWWmRi^
z8LZ&?GCXd*qzwD5o`c5Q=0$wU*4ujW^6_gEBc4Xy-!(OR?UAE=$E();UOTbsyyKbT
zC1q!C`mZxHeR+8O$4P8@&V2vkzI@uqmo1dOcHaCu^Wt*!&9c8$1$o=-{IkC~uV`|!
zxK8yZGnuRyZNti2YdF>7ZD-Uyon(Df)6ekkk7MR>#oI0(UTJf#-HN9;>i1;t`8CI$
zNWS_qd9vM4snrLKHi;GX^VeB4&*D4Zx#RiiwPJPW);?c-ve-+`RN~pzlb-T<y}|wa
z&n{?NTz>A!9PWR=n39WgetElYl05qAgxiy>9QmSO-@NmlJ+OKcZ~AGq?_4Q^+T5#G
z?XFqQ()oV#ef9m{e&xGw-(ALE_o4Z+cig8*ozc3Wg=@>>|6YyHy??Wyjwf%X&Htb0
z=f{2Db=?=VFk_kV{GVsu-u=2ZuXOddz0A)~zg-C`5-!huU-SGWXkFl!RpEQHcAZJp
zGyZ$-{hxD3%2mERs-6T|+IiVK{@0~zueHK=o+>$ReXsD>g?2j=+n*=>=h=PR*zbE>
zrr788`Q35HK(2XtRKM=ym#*+Vi=N*6q6b>#67Bxn?)y&Z<6qT2SQfrZ`1$9H#mx6F
zFXmVW{co@T(JuV{R(|p9+iRYGZ4%#;P<8Wk+_gO0x$jDrXQxKSU+eq&;LxGs;{Ctx
z=I{D>Hs3DxiIVtCxo;cVedqr?lYT4e&hLBQ^JZ1w`#kTm<hg>jXU6}<_kC#HJ@4@D
zJ5TlA{#N8z*FVkjQnP9O@7wq73U`0a3g3O}NUMXL%slgFrQOkYl6JicU4QFU0r#7k
z=WCvQS!TX>Wo?k<|DWgWKU!JbzIkq2_PqW7fA7Dab@#E{_YBK(?N(nFnjQZ<@B5y2
z*<J6sPkx@|bUgbDv-}T-X!CvitJVkZ(674K%~#o5V14eo;BzP4YpU_{_r&d#t^E5s
zzJAxeuj{Tqd&B&?Zkh4im3!rmeoLAezOM4?+2+^Fw}wAEsI~lA@6~MK>*u3>^qg6F
z_gWPHKehWde`Q{C^E3!wy#B2vlI30<TdAyVywB{<&eJUlpMAZ&jBUOnuLaM}Us0By
z4)kw3_+4!NuPe)!soOl{e9Kfc_jSzjTF%q0Ek8e}u77;7zwXPIU)T5Vt5yHNz5fHZ
z@O{ApkGpTP+y6Kyd_VX@?E%oz@Ry$cRY9xEH_yJCv)Av*i?5)?J!_xv<`p!*{QJJX
z{<gsWA4m25-d7yAUX~sI`&RDf%5R(J+uD9v$e+7C>c)>9KQ;;)?vK9rY1&&eLFqe(
z<^O#s3%Kz7YN`3T=f{gDI?t*6yCv&eQt<iKA5Zn`e}2*4|4I9`(E7Tst8csh(#@|t
zUDBH!v-s@X(kDu%e=dB!Gf{V^>M_?BQP+2cMQfXV&yM>%YpvMUoj;5s<jqpAb(nJ=
z;hE=reG#KI|2+Hc8zQ3T`R}{_aMAZx{Wbe82On<jul(>=jCs!Uw&(AbneWZqT~Hv`
zU;pRv?X|miR{py6VCOdb?U(L>RzueK=6;rX`e^ePsgGYh*Z%tTM5*@E<oSDI7kpy+
z{IS1&PpnHN^OpMui(g*&{^wxr+9mqaYO)iyUrqP@nju?k_w&rj``4cRv1Q-#tN8PF
z(1DJVUvvsa_+(G)xojT4Rz^Mk^AXeOhQFRjm~XI2Ik&IV(fr$<t)Fx=b>jbIY|435
z|L1u99W$e6Uw@vjud8~S9e>+Q|DVB6Q9;9av(Ku!&x@97$7Wicjy!is&#z|H&QDX<
z@2O+_xNh><?(({M+ozSE*wg*wdN_~W**!nc=I2R21Z@y7{jcd?>9xB<cJt@VHh=B@
zsw<0^O`iKE<@NI!z0=C?&;Nbr`7O2UU9uG$rk~%x?YO5;ylvsHXXZDr#C+Q{J@@%>
zwiA^fRvVa=+O-zm1J!%cmS&j-_hv4an;*aIqw4S5_r7i0cJZ@}MTPl!i^r1ZEo>h!
z@<*)KetoF;7;DpWgX}}ko6g<(eAHIFnoax%yX_0dw@&VJUN8H%Hox}u7f`NxyY;{v
ziJDD6-=y2$)(f)q&+A-SJn!G!J)h^k&zT=n;Tze0J)qWiE1Na{J~#jRUzfMf`f56B
zy`bqnw+EkIo_hFtvT1R_#kyOU=UuZ?4eb6n>-wH$Yh^#*djH^0vFyiepWN$9zpbqL
zyl!=2RPoK_?Mu@pzqfgkI%i+y`QxDK_w%IXt;Ire5|czDa;C=GYF$ZFt~6!W%kNC~
zTdnr`rMkLd&11{jM?XGYZc0B_cT&*$md@-s+p}g!Z@0NI<4@|P|9{T^-=g_D@Al7P
z>-K}YBimjdX*(*PpKp7kCrkfcXZ%C1@QByvtM7f@R<-AL>R*dJJ8FL4zMnT+a<*Et
z<*sAAH!2Ob?f=Xq-t7IxF=ySYlW$X(%;V;1?&h@EzPMt0&E3~=+hYyhc+QK?j7hn&
z_;C5ZBRroYYUerY-Ab}+&soM-^sV~-?|au1<~e77Fn)c<=jp2Bt9HL|)xVXnHRnO;
zJlnl8@xgUcizRmcnw8~SCRfwD>ieIXUL*cE<(~I7&#iaIDaYN3Dtg`+omg4O_`LLF
zcGvA)e0m0dP8_;D;ZgO*b^Ox~{|r_xejt<dr1$Cyf4^TRy>0h7_kG-E_Its}2>a~U
zvkw<_r1y5c|0&#aR3p#1R{9yslLg5qVqHJ?`(2rpwR+L??dq1FuQ|`(_w~ul<4uvL
zEk6Hn|NX(vMqHBZz28ldzgHgqsZ2lHcA~Z6Vddw%%M-J&9G>)As=M&FyY2S;9jeE5
z`OJh0b=vp7Ow_B*wr)T3aJ7G~|Kwkm_oZIkJfT;zkb5gP&wcxX#>C=%cb@89KiBRr
zm~Q(z@^-oRomD~ExyjGf`&6g@oU{JC;`Un-Go26bu4<dlQT6p?wEX;o-yPQ2OWP=a
zzPVV{JC5gdc31Z-=Gt1{nX9jT{%q<s@BP;wb*uNet-8h?_{hdT=E2U|lk30R{kqt{
z?e+|t^mgNz`S)%Gn17ahyj-o;wD`|Xn?HYfUfq;G?a?E#r|8MdaOXD#>#nih|H{dB
z;E>pbNy$rQ+*tI?X#M)B&815~W9aE?pQ!gubLPq3t9rj`<$0?oYc;>Or0v|WA@Jil
z19rpt8b4SL73`hVY+wFQbpGYy`SYs(?CJjdd;kC6FIW24zWQ=||KHoYZ>?Bs`gZ=$
zFS<;}CRSAzeapI9Z1^x(?*8(E#+^r0^)BjJt<jzzV^Q(F=B0OhRe1exL-p*&m)CbT
zsb9N1`@4M0Gy4@=*6o`2wCTWi&73#aCYdi^Z}VgCb&+4cW^MYWcKUmB&GZx5EVrwB
zb5<QxFWHy<=$qpFxF2y{&)*fe&$F+~pL@XKiQ4*K=iJv7u3xwF@WyW!uT@_AnL2OZ
zt2xed(_cM&^NS@pXm*lx=gEUcM)`buo=u)zS<_Y;cJZKl;cxjfYxc<P<1~I>v)a_3
zz2@`Q?-P6en(Mi5O1t(c+@i++z*-&l{YptOKMskDy}A`MS>?>blLw#gX1BZg=aK%u
zq|FI2H>wWL+W9W&!|M5a&V<j2`DZQuXz9eNI?wMt={AdNJI`2`>lwrZ?D%_V)+f%k
z_^ypFt?a+>8Q!a`_U@3W_;h4L=j!u&_U}tJ-V18Pud021?7Mc)74ruNnE&gw9c-QS
zx#+`Pq0i}Go@x45?^v(-I%DSfZR-V1uNE0TWICmP=EuE>*LTgIqE$Zo#`ERd|E<Y?
z);l@7|H!KKe(&mX=C+$2>Ad`XtKzh<+^iGUU*>MVW>Z$%s2I?2{=_rwl-AIBmIbC!
zMN{+jeqJ+3UlV(%`m3<_e5>NZM_;DS-ZA5|RnWBZiGN=I$!*_naci1>|NN<T&n?eq
zzUTR=a`>&_z7@~9EA|PLHczTw^49WPVc)mDne!ih;+v}90cz>J%L<<VI_7`uk+}-<
z`71jQiXTs(`&aze5%0sMezx~D=l*?@p1(bR$Nc(zpV$7os69X8k89+=Q$4>{ZkIQ`
z_v4uPw*NAG*^ktG>()O%|Lo-F<NT^S6h7>g*njV{^|ZM9Umv0>u5F%o)z0&iXPf@h
zogQ-AKhK}>aC#fh^OLz}L91GKKfB3c&F}upbnDsdBln7@l|Ham$lLnS=HAzJ<#QLm
z<NUrgRM+*D)oIU|Gs`5^&;N<j{VEalXXma5Q`6V1ttu$ZoIL$jthj`Sn1|!hrx|CH
zCBL?8O7!!J$ypj_+m&fN-R|cp#dU{wUW@5{y6}9=qpja2cI@4|@qScY;Jb3UYl7E5
z{pH>tP<7|AoVo2Y!~V?Y9LHK)>zyAIEA79w_+1R&I?Lay#h-H*-V3z*`_ez3U0UM*
zv_@XvzT$xFwe!wCKT*T~`RDETR;!n@@1OA4TBWY``Ga}(v!$d<_liEQeERdlQxkEC
zx>vq$+ijjG<~A>%SCcKBeRSg-?fY}@KDYZm^WU%a|9Aa;GvoPW{aru5tAV!8rOgk{
zlU`W;CRyJ4W4u_xhrdTbRp7JF4{Ua>jeP#{r_8(TQ=c#8eU_T|TIQNC-*Zq~=eK$I
zAEr-9;=3bKzP)?)xqnuvzfZjOalc1jw?-!ajFexyxV>AI{r)`fs^8&#Ten;@+P1vv
z<Eh^p=l)-iaJyH(pppB{t$=E#qgM}!UJhS>mh<4*jZ?huP5e~6?%JEgCsh_V9@gC1
z_I%>DJD;ER&;4l`5pB2f%QNozzpvc6_K`nKc3b%Q8vWzeu6$;<WbQB}3!gcdE0OhM
zE`Qy*jp6oR|6jMWpS^a!(Bnsksy@qHxo9oF<4?4xS=D}p`H#=qwr}OPzx3eSwBj3O
zv6Xf|j(7iQ(uudfa=&a|!OQK}uV1;7{iPsY`Al=Y#3_BnpPT*{xZOK8_qMP_|Nm~s
z_~#+>t)B;59((e2V^7rT_HI+hj2`<fpWh#lcs*Bv)vQ4wZe!0=)n$D$hhw&STkf3t
z`TuQ8aTW8T<ZibL)y@A)Z*b3?8_~YhS$1iI(#<y;m-acaR2simZ**FH(p+l)!t#y$
z`@*l;NZ%~F8(w#G@22Pf58dX^`2P5gww&y|`lcIeW6!-g^HFu{uSK)s^`88(u1i0&
zH*Nj<a>sol&t}E1xf*`{@cFj=(_Y>B8CFw#?N9vcSYz|*y?<<;op*VAv-nZ^zt#22
z%Ie*oS3bL${=U-nU$)?%sT%d7zu!ITsS|5>J9Dj@t?7=tMc0gX#ZC0d{w``AoVQ5s
zdBeJE&o0PSo^AgAUo`Thr9^Jgx12ZLd{da8H?3yhJ7@2XSr6l`J~?3<m3}Yloc{NW
zZ%gCN3+^8H|DWy0ceg**M*nSZTC306|NrgZo`O2lot;&)rmo(;%Vy5KR|Q!M^otkC
zRoOnBvzTv}yy<G&n|F8p7d~^&fc@h1?6W-Pvu$eSlR{^w_Epv{*tPk?&T~7aKGXSZ
z{YB=*ywvA=f4pW}C;h`VuVMeHr}kGrUyrY^z13K@|Nq~fh}>^)o}d5YW2C<7_U7qZ
zIksCZw~FZh+xutU(rMxk!-`)ootOQS^>Bdvvc~?LXEK}4mG-gEv#DOSwd~p}pRBpM
z>SpC()$?8!etWY1->$~jY<26UAFR*%DQ{Kttm@nM`ntL~wf`)F{i`ht&b=vKIn#Bv
z<d&D0gX`0$EMIp`Cn~)5^nNAfKN*%w?p=HK@nev&dF7ufhuRO%W(OY6J}3F?YsWdJ
z^I^~D{?vO5GJKu%408i}`>^@;MHR2NyI*HMbUJeL`!lCzE;Y~B_1m}k!v?G834PyX
z`)^r(*Pp=_RsLety6s=@aGdRRwMlcZE&8!$uKDIy3E4GOuIUXrf78F7t=Jn2ih)w*
z$87Wd{)wplci`-Ko#TfWzn=JBX2(o(_D!?GC-0ZsxA*1Jd|&(T&97J0hu`0yP&MP)
z?gaB&SJP})?B!UmwkXniy4=0+%B^WnKJ1*n)pp0}IZyBYJ_HW)U*-><v-(@T?ysq{
zIDB5-KHKG6=G}WbGTid|*%x-2fBHRJ?(?Hl!Fj*Z-p3eSdG+*tyn*#)y&KIotL{e3
zXK#4^RPO1=u*Koa%U&)l?~4h%J7@EU9cQlZe)J{2;_iV`=J?-if95>U4F9@&zI>gV
z<@~sHEBJPW#hLsNy>}u%zn0I^_?vdk6zBQH@8S)D6PPX8Z+FWrs?Gk|S#|E2-`aNb
z_c2xRMcPLm%cP&#x3lWOTi3mBqgVUa95Xf!uLqgmpZ{Ry{k1PM?^nHBrnbob^UsGe
zMZcapRK!2Mdf?d|`E_!Yf6WU&hTWfX-em9BigiW54*VAHX&2?(ax6#x(8gQa?XLX&
zZ4<INtH`#$dfMUV+<T*{EB9Q{`!4u(ChJv~&)>eTF!evX>VLwz@8Hntk&gJA_qBYY
z?Xu;2OO3B(B~@Aq%$qJ#eXIM|mxg^`nqNJ85HtC5ci*>(PkWw48y8o-czWR1`*;Hu
zL6PN!uYNso4Exz!`EPF|f6TdE>64jj7rqYM{@vu$w*{52Ue33Qv-z~BIK0w!d%(Rj
zExS&EZDh|oaNl&I?i$C}SKsHCzPkI~{?D27_iAfg(yhzSy|X;)v(EVJ_1&vyZ=UzO
zRKN6s?Ww8ipD&B^xUffCd&riYZT$M`Cr8zbnO}WA++A&YbKYwm<L@)?ots&G$=rY2
z^9^F<KVMa>D+Pt*`MVDF|I0f6)kSvy{oD5VsZaLaGx@&jr_V|~w)5z#)lz+~$L<{b
zQ}O=a+Iow=u0O`v?=H{0rt~@L^7+~er|<rk*S)*q1jF?wcRkj;Q_DINFn{ak`L54)
zq`lpzU3+w<x%ow&7eCK_kpDV)_O9XwD_5WYrB+v6eC^1}_n)-q-&yQa`~FJpyK^@`
zehqkEV|{PWE)D&6KUTi4vHn+n@_g})?*4QCSNZ?felh>G`^>rPYqFo8^qph1S8i)j
z)`HW&g&(eU3@gr>TWDPS{cP0!9hV<kZ!R^S=Xq|<p7hrFb7pN0-(|UXZam+=<@HU4
z8cf{}_ng|T`0I&v&97VA)6QA1-fYu9Cn9d$3cV^hn?0vyUk*O9JWp)z&zIZt`OeMT
zRlIubGqd*VTOVJw@0$C%@|0nC-B$O#zn-{MekwY*C|vw&$ESGH_pv|b*lpKXzkUU~
zU;NIh@UNTimDkK!U73CU^v)-0i>|uApH=fcv2XpaIq!RtYClvxoqL^U&aMo<`Fs9K
zp3{l@^mMJY_&U2^bMv>?KYzKi{-DK~UYi+;mHdHg(w}|VxiBtp|E`GGyjJb`b3E2P
zU+z9RSp00`wW`^(Wo%E+;fOyw=Y`z%f=}m+vh`1$-%~YlR_QZand84th2O1u8eKT=
z>YN>)PIXqCo!&gZc4t=jzaN`V{w?|1_auDIEtfso`{!hwi)+c>`|0QA)zf?aoVk4Z
z<?88Car!Z~pMIUWA->jf{=RuzZSJkRc|K<E?q4}>=da!TwBYCYy1H+>>kn2`m@iI0
zoR_sWynk<d?zx`gx2~HP$i14%_y6M7S+VDKKDB6m-mv|ewV;2kas2+xE?b^Gbv2o`
zw?cXU{+E`Y*A^A6u6e#cxcr;@Gn4m~@iRY9{j}a@`#rn;chVQy_rFtA-!*-&2LHUL
zSI=}B_w)P4n#9|0wKA3aob~GI#fa52Cujfj_`7HM9qWp1?Xy0=RbN#6%}!me_UYWM
zhkpL~u0MlIR*OHK_m=-T--o|1_21*!`unZT+|0jxyXw=Ye6}h0^f~A4%;xiRiqEdL
zTzz9#<&S;4;*GC7J7+U*qs8mkedm*PtHgdA*Bt%rf3EVo%>Va)Zr<Iq%C>6StF?ER
z-+6bwe_rRAhU#bM-`~tJeQq)R=Dsg0ZhrSU``Y^S<3h{!eZ{BN?<qR}U~#0K@a8W~
zYr|*loEJU6()QEarw(Dy@9a<Dds*?_!PNiUyu^J^9CqeClPmao;&kc#P`SH%&%E35
zYIoJUi#M|-Z+8E#%05eYxA~m7%|%DER`1z$E9?HtgRkYT^?!PGbY6VixjLoayTa~?
zF0X&2eQ)N{|6M=B=Xt(gJm2%{y~ld%_h;nJ`)B;=OyM@;?yGmDuOzQMZ`@e$YQd~I
zdm}5R&-%OhhnL^_=PCRazZY$NzTo<5we7PX*S+`}WPSMO*MFZ_i_^kB7s$2UTbQSz
z&cEp7_OiauZ)dj#my5+rud>W~?sIS7uQ?kpoeKP&Bv%<%)pf2d+t+Wt@r&oDcRss%
z*7~yCU8xZB__cHX7+3Dmdw%=;9vh3j+V8H`Jl|gCxAW@1tI_{8fBy8D7yV`Ci{;|E
zMbBKmhSn8*d3Gc;jyL4F&X=oKo_>sa%^rEx>hRBVhhFp4R-9SgyyhAIGxvLO{eQJB
zHqY}6S-!pO-;)<-BPT~*J#(SkJ-#yQ`<2!A;`pUrPuHI@%h06ZT3zVlmHhqtKF!t5
zzjjZC<N2iJ=8M&?@B8;@^{(GOdvDFjv_H=re|FZ*YbjCN+rzV$ZLRyh&7A$v+iCyO
zKc7pTCz-zedil2czr}H%&&~I!TX)hj{nv}-<wyU%`)S9#b?<Yr+JE1^{(iH1kIcMK
zxpR>Ud+kiW&tFmh?5kyaUFdB0@;18*yY_94{1KD(vV70Imzw)mTL<^gsctT+a;b=`
zy7jt{@9!$Je!I^<&R$V>U&if!T|eGHbY=PhxhGHE)~2tUWt#DJo*mDMcWXr3(~e0N
zy`A|qOZU5A3E%I{FV<S~$E~;9IP==8bAim!i_8791J-Xo6*)V<FKVvj>OFVPY`4Gt
ze`byCyu~u6r#H*r{b;vy{fzH3|5X0`^Y&{;#hRnPF223^wc*3$)%(AmiavLX=R}kE
z-Pv{T^5g!A{rZ-6uP0)D@xhbk?|uG$d(;=Mf9<x^`7D3Sy$Uins-AuPVbr~RW@s$G
z>1mq`+n=*P9=!dRdzo{Yr2L+$;<X<uG_Pc&SC)LPT0TFHZ;s@*M9b$d>i#Ltn!j(R
z;ct%F*}m(lx9Z>LDK*Xdy3&w;-7dL}Ki~PEje7d@<TsrUPv_kI`*Fjr{|9B>uimq(
z_{G}0@h;hG*UyYRe<u9oXPN$a_tQnI#h=Yptg3%;cIMRRr*j!+O*iJ>b>Yg|x!uc6
zt^UTW-ZSr){L_;b*;A)$U)#U><9C_0<&r<E<_7c0>sw^koQ;0%{645X+xPz7Fxxv>
zrRV-~A9FtEaCYtT_3fFx=kM*|Sg-c#I`g8&eIHJ&?p$pn)7^7=PwnTT2WLX6LuRL%
zosOI0zS(VaTl&q}!Vj;ye6BikdHQ7abhbWK_qA#FBtKOh4gXx+A1c@PRC3MD&0Eu7
zM?U#-vpM|VkI#=|E6hLtdvo#YjKI%&JJT(*rtQ7iY+F&hsQBv)_Osn-%iQaJz4>@P
zb=jXU=l9Kwd@VZDI@|cel~-$52fj{}v)j91^;WwJYa;Hiy7v6e&C~vG*8CRdS;o~C
zHYaN1>}dZh?|n+*z8t-lm2%dS{fhV6@}n!8b<!V}p1j%oH0t{274PKcM%IO%?tJ&y
z@<HXr?usv`Z_X~}+aqW3{DkkEN~5ZOFZX<QoR)5RJ6>Myb@a!#Z~f2zmPtRqep}VQ
z@XvRqm#2x9@Mo1&?ObH_BC7J@gYXLF{d+6<YQLVVx_bER)yUw@<?+8ot=!j_H-)b=
zt*hKyB>c7X{>z2WkFIjdkGry5JY}l=jQ;)qzp#FO^P!wSq0Vkajl4Ub{#FayjIZnF
zxz<+Qe*N-Kq`&{~YsTs8k3XMof4D0BUR+9F-OhW_mV3VJd$Ie=p}_J!yUkz2vTZ+q
zJ9mJ4d(_?gduN#^$MydSKlR(Ewr>9Q=hv0L{e-jtpWHiHeeT?sIcIeJ*Om#pt*@{8
zvak7^-E2eK&F0pX)faA6&zxi2Rq@4t-o2Su?)AnLKmD+8*O}Sb_oe<$*Pl^o;A6am
z{q4n7+f6N>P0M~euc+$uX+!S$`aiOY*Z-Qe^&0=CJD*?F{rM19dw#Xu=l+VXkFt){
zxP4b!9-sF#w(zU*a@*49X8q4j{|(<e^IVbq--<5_H@-O<DmQ<RoyD}hE8Yjx+brK>
zS6Ur7-^$iIZvL*lEByZ&e>zjJ?zhE#xs;c$_dUD#b@lD{pU$m`U-x-M?71!G-uG*7
zy}ny`)jp`2?R)%NW7}^PYoBipJ$!g|^@)?`_w1FdU9h^e_QkWWr?%d|dM>D3zOwqu
zwJ+cQ&oc65mMCw(m3d~y>6staew~{AR<7vVlc@F27HmEdWuClt+4^eV{?7+i&b;3I
zE@#KOs?+sbzMXjzU45)*b=A?zvMqDt>b8FG%3k*M)b2;KGJB`1UjH0jE#LmR{rW%u
z^S|HNw4b-J{9P$t`z?0gyk~PQOMg%8dv@#PyTH3=tWVgyKW_PS&E5TR=Z#E_uP$%j
zyDIuS&$V}v{hvQ<S+{)ayrQ*tUx%i&ZFUT^tg3u9{~ssY!Gd1ii0=7?FW$MH{dB>7
z`@e^4&ShPz5j<OberML|nP<1CJ+67~dv~Yx+&}gk%ZjV_#rl@nO;1;O{3i1C%%3l-
z&EMP2wYEGTf5iFN*X7Ud@7*8%`JVU<>)GWi`+vSuRDWmm>XF`hJ-gSJ@Be*xVtVvd
z?Q@lP<>mD)vnTRw%|1T){my0UKU<%cx)PihYX5k4`nx&LK7L*E<K2Ij&)@IYo0ng`
z&Km>ilwIfDQ_B4R*EilT^S7(TJOnk^cjP?)^#tqoHrD?a-zb07sN<DYI|Bm)gQu&X
J%Q~loCID_T@#z2n

literal 25052
zcmeAS@N?(olHy`uVBq!ia0y~yU<_nnU|Ph%#=yXkKjVD{0|NtNage(c!@6@aFBupZ
zI14-?iy0Wig+Q1weg35&1_lQPPZ!6K3dXl{Ip>HR{rT@cYfRn~J6A<T4y6?<7)6z|
z+6|?S&XDL7pQXXLKBoRkh2T_$thz2WApz0F4V_)=Qb&Y&1ACYjH8n6TDmtZleUsjs
z`uUfns+L!$Wu;}MRjr!;tEO!E@?EQTy^6N=zaIUyto)?AeC?O{lO|1i+|tP6(ZJ%N
zpvyFM>eT<5k(*LHQ=@jym;n)WTQKe3t2;Y4-+Q9YIe~$5f&&+m_jJ8b&8#IJ$M32*
zFsV2&d2$4}Og`{XPe_4L$iuZkX;zoO_sJloLQEnTRSI@=gG>q%T+p#h>BwJ@mI*Bk
zt|pu^@01vY6dFTVG#0JoD6|KeuA=B5=*!f;8|)rY#;y!4r#t?`)rtjSt5_hun<?<)
z(`o&u^Z)-@K4sdpQ>@}K3cufOk5@a|V&|XYQu6-Z-c40svm!SpwXTWW?Dp#VdVN`|
zk_qSLT3g@VxzPSMk5-5L!%t67r#?8)cxiLGf3wU(?@ft^*&_E;Y+Mt&JM7fy(@RrN
zPb+${u-)tSw%o(vk=>?;-oLT`|Fd7~W4itCnVa`-_UL%gt-ntrc$v?{ySvMO`%P@)
zl|I#9_eI(A>y_Z8ZoKF6elUm{ELyY1XI|AS&CupqrrBb1JDd#UE1w8fe!Uu=dVZd*
z-K2KevKcXzPp1Yg_mjPE=O)6>xZJhm`MJ49iHBG!f4|)x+J9wLsJB(wn-y*h(&l+n
z{O$jSY|Fi^c6pia<Wr}-EdPGF+`as{Qb2IWX~lM#MQhsSY^y|KyX9*>IL@@K-nPoz
zZQh2ef_V@3RKMT*{mT7Sp{qk`E}Hg<_6Zh5xv2Zikr2L++-K>gxA#kssr};U_`tx0
zXL?r#FF*C{?Ceq#duNviyI!y34$M8XnrYz`rmAl@(|_w-u(&_3?pJ2!wKX#<7y3wg
zF`esraa_J$r}+7~&<pH55(>`kd|yi$+?M_Q^>y;%J}a-XH#Z*MKF=X^V#)#a`8A6+
zO`9_11b_Vx=XgWkStb*?_4iy5Ki~04`N5iwBtDUaWp8hNx;+1%N#=Qzj0+AQ#N`dt
zzyJIFUi<Uw&*$x@SABiu`TN`3r`7j=&ntO#MbmEQufB`Nca^@r;^gu8Sa0aP%FoYM
z9u=&yf4AfD67T7H8}~>|-1Fs<w^nSonC_I!>$}VI5BBTZ?fG^qyUCU7k49kpm6u<y
z$A@#LMXYJqS@GjxJNvnfm9MX^2vjaT)5<NbWw+x*#p{;GdH46lis?iw@X3_f>^s}6
z=z=5r$%*cAD?c5%&U=62yI%8q0o>&?yfUw@n!3y3ph`dgvdlm^F_!ADua=52JwAP~
zT>9^qqvG)={`~yRDt`aj+1ab@{{8#DU;YNaV`)eK?^mnWhlrdhzrwG5MNM(G-L<Fb
zm&#Af&b0IKd{ExR>M&<|?C!Fui~H@O!jJ#-S9dMByv+C0MR)m?=d52Ynasp$6ng$q
z%Z~5&s;_os1w?V2*RT7?eZN2XSdV0ryoyWaxjB|uj@<StvT=1kQ&nFzv-5{3r=Gd_
z?$%cC_tV7VDja<sdF1WxY@hY>PVxDbn>H#iHa1(n(5-%UX6C24?`z!u-T(i)o@wD1
zwpe`*-MST3^CU72zP}I+T%+>;>-u`pf*$_2x3&g%E3(TJIBbnwzvokz&6f+#O`1aa
z4s+{%o{m4&sXkAl+fV(i@p+rYw|ZKa@`c_L`FPOHzVYZ`etVq{4?eJQd|zMxH#=Uw
z`m)L`yAKDLlXo9rSbZ537H&Uheu*{vxgo>4^3#*7Hv;7!4zhFCRR?nTb!o(SmVD@H
z?(_b-v*cya&Y#a_U+vOz3l?Dbqp?AP^<&lZx#cYCr>5yfKQZ6`(>I~8-}c)KsiOyb
zpSB451vGWYbGRk++yC1kHP_+BgRItxs&176u`w47c`xp*{+@N{u`P#R)Q+r$IXnI>
z;L!;=FqdUf(et_Gr&a_m-V>R0`|@)C>8YoudA`23mQ^`!%gNVS&D-u5o!0f5V>s)@
z{r&qBT6(ydZ?#<1zj3Gb``wL#`ri@-S+y^u&nayC^7eLkrPZ34ok3}5XDt<bU&4CH
zbM<GHUt2Ev-)iMj{%KeHYsI#v$L;cUD}FI16?{6WuD;6YP({x^!$qy@Rcv?+Vp+O1
zPCVk&QkiUbZpr(CH$I;mg@4I1isyf5X8n3CI{)M(Rqrb+;@+10ng3adi_yc}=GTkG
zUIGT6c7D5+y?X8sfsi%Nl3Tv)|Nqy2ZiB?#qwF0rf27v$dZl&nj`krzcbSDQ;>z>V
z=hue)J+W^8zpAf?kJim;`O&vWVq=wi{*Cp_-;VcBGVr~yB{MiwzeDBBr3ISoZw{BR
z+-hCf_oHE3a!L2D1d}z)F59EG=dJn|y*+Pg{r}(hn=YC#wa7Dd$xkXj(#kFH>ZPpi
z^2uTH))$xe)*W(X*Z#l%@7w%jWxp7fyj?HVjtYo3`nZTJuKplxUAAUd!lOmM@BjZ7
z9{VLgF6Q;5R-a!MllM8x8l7ynYgKLeaQA&(_y&d*=a)M+v#sQ2*9!>b@UwEOa$oea
z>jk@f%>uWq7d2~EvGvNFv-#{}`pa4B&xs}`H>Eg6SE(zkPAv`c7v=x|I6k96iLY*z
zfHTV(W;L!E#ZrbzE^pk|UrrQR!75$c>BzV^?27mN5BE&E#dKF)D|>I3<1DddL$b-b
zX0wNe{1W*>%Dv@v=5x2~`m?}4`Y+40{lD+NU$xQ2{y>$(fj?ydvzuOt$g^v6EUt>#
zB48lZs>*ObpoZ;d-z%d_Zy)>o)|*|kK}+DA)oY#mKU<0g_fOVfQFs0Fdj0;sud$ni
zO{bmM+$hMvbcC(A-;uGKMIuz`!MdIW4e}GjOy1Yc=;iov#6#CE<KppN#(O)1@~!?H
zXgbw);$@&=-5*EB&mj?#d|U=s1ryrTiuPVCjoV*WyN2TmJL9s~@&7)Fo2ClhmfSwk
z@79hrSNGj|rG7>IMVZT8eu=`wCv!6ogm5kkQ@9f4v+=^0_4R+f^Y(rXGxg%tvc79~
zZp(Y4v&;2A?T|=*rKypirNVX4vsiA~a=ssl%Z=uiMAc+{Y@DFN9hI^tX_C&~d*UWc
zSAKtZ8GF?CJ5$4-C<Vjok|Iq<!k1rGt}w9v|L1dQ$yR?`t-~w07JE%$FXmg^r#`<X
z=s{;gWpYeP!nK1Z??_+re0^4Y|J>Jghg?J27g*o@Vt3iU!t?=u&V~-wYY~51G;2Q|
z6`w7(_!8^a!ezD7Gwo{Y61g;AmH)ETTvWBC-I%YbVfPfDX1UTUYopCG#dO>51?FGk
zsl2uF_0zfSCbnD3P9N+L`#k$3)3<6?Ni|tFIe{P@tv$cr?S93-xbh5dm43?0CB7l;
zHQy$eTPX$B`aFKv#8xIT_fXeC-G$HRmd9=FPG7aD>6gXjeW%Ule_u3z)xCA^%7a|?
zDhKxTT>2P!c&e!5e-Gi(J^K!O&fea6>8Z7x95csCw@Z#+FI7H}n|gAtlfml`?81WF
z`4M|tuQS})k#Mfc*(!7I&o5<$--Ul1di_xT|Bv=r`K;?h#C7lH)v!Um`PQlZ_Oiut
zbLI%Qb{tCOV6;!^ar14KJ9<cz^W5=HraR>Vdz#iNefr=(`^v|5r#<VY|0_JQ-1A#(
zyubtbRpJekmilkuw_74n`)amKf#PACga8lqwdVDPUnXzg_wn}c_xtO0xXcTWw3qw_
z`OIYgzK%qLh3=a_=AKBg(%RRP^yA%<jzfQ>j8Zxt_4gg|(72g9H)7$Dx%M2l){7`D
zdVGcNy#0=&2SPa*zdw0yeV|fWt+=M)_k^+u{w6o&=O6zayW3^q+kzA4&0e%x`sk_%
z1=jYITvGDC@tbqs^v)K6ugC8Oa?Gf{>a<L0-{0wZ^69tAXFj|9=i>Hz(&i=71`G#<
z*DMm4BNA95<Kklfll`56f&arJeS&ICR+1kheA}eC)cy!=_|RDWQt(59ki~)O=i-I_
zUu4VgEc|wurCB~@A2UnlnHh$kp3Tlb=GHU6_S?)m<@ak>X-UW~H*Q_{x<5MVp>ij~
z@v8OGll_`+TN?JaTPK%PJZNMWS^i@p`x*uoot6jF!dpr%t>WSQ*SdFpfnTqTWsq&l
zk=Ln>xf_mFwld^*F0i}~4LkWfyNmM_B4nE5H}UP@6{*`+#TtKn_pg^v=B#+9^TRnw
zRb;W&nrDynq*-=ssSt13;P6QFaPc`y_q(V04jz5mzeAf@op;~sP*0Al8xjvQ)ieD1
zvGZ5UYMz*ycRQcUmD<}sTmD5$TTJ#tLbp%2&qL|%K(kYaS=rXv8SE^)t?IUOhTZ`V
z?q$2m!kwz_{O_O0euTHX$Yc3mj>76Sd@q+=trV(l+d2Qk8pfC#pvK8+`xuuE9L>cZ
z@lzfezu9Yf@b)=yv3uCi_$+(&`)#-Lg4b1;-zjL83QP_Z^51YMpKE{r$H&L3XFq+i
z?XprA-`*#ayr=9}uY0n?DM=}YTf;A>=f;PCG~45CamV->lx;hhd_;X%UsQjb$i7ZX
zfNhGr{Fd{Hi$c9+*V_v}ZRc>>(Zu9-GveY=6IL-*1FIt$%bc&uhE?2||9xNXT>H?y
zC01uj7ry<Fe58b}?#qwMjElW`u52~7di0R5HPG5kdB*=MjCPX*qTjP>&E2A*9=W&p
zrvI-U4_<wBx{&MrmGd<F_OD4tI=lPhc%1BFW)y6{&R_STxkY?8*pJS&MrYe6YP{QU
zSXsUB;t>bd=Q?{#KKwoqa&U>~<SARHymXcQ%3ZCoa#nP(|M3gXpErbC-2U~jrEP)}
z&)&(uPo6r;&+u=7MD454lP)g}=W_(>yzo<ha!`Y1QP0IFrHL&XN%PB6FCPDOSpMGv
zxAG4sTV@L|xmA1cKkV^e|M{VD=-xe<dv8aW99SXZ#Kd^juIrvjm2}KUXD8{xK(Axh
zO>(WiZoBE9F?rr`-dz!|%x2dlB?^}|Pk12173Fd1Y0Bl}yLkT2^t=Dk=EoTo`G|)x
zN0_tr?D<eqAE9^8;{C?1O6kw{IQ;runyom(WB)7_R@m{wm{VZ33scu0iJL07`%O;P
zrQCSWYmw>ew5m!~i&?xkM4WG~_`U^k^#QW-UovNz&8@oqM*YgoYy9%_gl1NFXXGub
zU32;M`I29L&kv@n{XD=GZ23`f;!)B0>t^h?-n}8@%-ln}CNpq~@H2L0eEcGs?Zu=b
z;KU?yQJ~Cgk=DzTKV6Dfc78J4SHZENzkB)m5?|%*8<t4N^~{fOIMl==SJ$-DiS0XB
z&R===h7g<BC+juE=3I&_`855&j19sG^6h)u|9o9+`9A%S1gKMOpynWG>UOjR)OUWM
z?jZQpIFSd`U6v4D&>^)r$qA(9gYbfmUo#EbKz;2V&H$I*Ktn~4njf42E`NO_oI$<l
zV=Nkrj;)w60i@;+i^iflwH`%AAqB={CXvA85FZbanmQ(tKzre1pss#{A!FAHLoGEG
zkQ#f&t`+k+lR-W612Y(0uSkdrPh#Ml&@i9D^~(7cLy*%Fd>WLpdb&708(2IJ_%|rM
z8g>3?=#M6z;hA+;q|TYd>8aq(vhU9)@0+_yv-`Z#HwG$P*p?f;GJ1QS<18;hU5+w2
z5te=beq~2)&6;ZUbGCWDpN7f=!^WtsT<WQ<)<ws5%(%$PRP|-&|9`)^|9!iiZ!bRU
zsF}+I23M1&xp6Pl)<<r3oB96!-*@Gj^IG5W$k}Hz#YCKvQsg#JW%&GevcKKLQ>VNZ
zHp~i2-nBvafrrT(+b14>Gxk|unwZnp&)|Bcy+v>v=Y^W>zEhsIb~3n{`0RZc5&Pwp
zb(mk~KI>~cbNqT3Tus`Vq|G>MzFrLn4Vi8Ibna^T?3Bo`8yo>Hhp#E~U1@)|n|baD
zHE2<LD1>Fp&%P3q`@t6<)rE5exWv9Z$+W%sS#_gzL%Y5NV^_w(3%iRGcIZERe}I{P
zO4Zj_J1-k-YhmHx2yo$5F!VHFob~=-jD)l<lgP!4uiLj?yHvBiZ4#@fC1Y2{#PS5i
zRsNs%3S6l?vq5M<N88qPrzrh9zxx7mR==<Q{%-2m*Vny!rA(K&c8diC1qpdbeE+&W
zdb?lNwKXd*v8w$tE4scec2nkMHPEPy$fv-Zldn$H?o@XWJZqb*-WRau+3$I_)hVBz
zoc#3VvOo8&h6^hKm3RL6bb4w1|9>0zIqq_ouMGhW?%mu|xw$L<(vr@Y!lR;>*2nLU
zu*%Vi+~o3Z$78;qKOXmo*37jkeX{5Cxyg#oZ6V&r^)D(o2==<!r(gB@`$53QLb6<5
zG&o{oQtO@%hq#L#wu*awe|Pt4Y)JY2+U-4(#%{aH-fDpcSk4~g`2F#?{B+~<Ho<(B
zPXr=&m#w{1|Nn2%Y2ED}?R>IV<b|4!hK9#3-FLtEylv3_y4smmrK^1ASOi9G&(l?(
zSCM4+FfmqFU_nPz!;2!pTQ%*!gADB~b|xS1`_y0m$Jxu<JJh`N)fLZeIX9J(kM~XG
zxBH=>w#cJ>V#eV%-sHQHfq{wwr?%g(vsPOK8vWR`$!O=pHt8k4v(2>Lo|vfobZ+^*
zKqVi+-iO_1*ygKC&0OcVexX6F;)05N-;G=vQ9V0-br;NHc;+r>&~=4ToMU~1Qe3x6
z%+8V@UoQJEEqr`zV{ONA!>X^ZR6zsg>uoM({*>ee#rv1ysI@I8yV~0i)EwtN&{fDX
zYsJCU;p?Yq1~1dN{QLL)|8<K}wEivbw+os-*SfrK>FU_s+uq#R=xpHiwQZU2Y_4aa
zUu#yC%WuD{<{((QyZ&;XtlRvG&uVV-kDC3Txng6txc;<<hucs8d_I4@Si>ySY_-S7
zdO!CD?ESet|GwUNyWeZJ<lm30`u0ZhcIl6Y?W-?7bLO{Q;v#Hq@P1duMWv}}-{0Nc
zxaCd<8{@f7x5e{=w+X$ol304Mrk#6&_hSE^75%o~B21@q9<2U+*8J(L>~(?NZV^0O
zTr;?j9!<HjBJfnq^~|~-hviTG`T6<kpO^OkfBJ7-zh_TO)V7?JlM<HBQ;cHqT6M=%
z>tf3KlR~;IIk|@G_oZK|j$i?|9-kR*^pclPc$d8O?<wu|Q;g49DA#TO^$#@GcxtLP
z>!P2a0la0tv(+L>s{Z|a{?b^=<IG-<GmXjxDzD=1FT1)ZDZbW!^~U>ZcCS_}zH(@S
z*}=W34lIfbKK%4iS>VBcUE{4>>-&h8#~oVyzAq45d%*Hy#@F&STO$g~62IDBTfib+
zrFw6-bg+0q@uk)8tL|s7-@9zi3xE5+B|opOuUon}xGpJ$+tKdnl;EIcsZ8HFK(@|b
zmNU`p{>FlqpH9;cH}l)Ac&8&}k})AlrK#eOyoeLm@haI3KUj`eab$1LyZdD6^temA
zue=Dlzm-LpPkg>!?5-88YG?XEgM?WhIgclF$T4<h9Qh@~)DW1l@$T<=ndY+fe?ES?
zSN;CvS@ZikRUuui#%DUKT=_rGE(kpI=+=vii&x9?eZT$v-QDQ3_3!TN47PmW+#<L^
zfPM4-CT_hI+ZaOEGSn5$Vi2D;=iR;9-pl9zl@xxhjn@{=cl=_OcW1?&Z4W~JKQJy9
zR`=VO{{EirrpK#wgEqg?UG`O~<-6GpThaK_`sd$FUSxV_t|p_NPO8^Bj?b<qYy7X+
z?x>I{IKa5++v)XB7R{EQuvL10rG)3AFGuD6m)_*d+*u#nl_6&}=~<1Og7_za)nRLe
zW-JIaygzwk-G`SuKmD1*KUe(1ruAl_zOip6o@(1V`QZaQZx)S3(;V8?O056s$0)ip
z>CI!K`jgKSU#qSDx>7@ba@VH0UJh%;&K#N~w4g)nXz(2Cz0a(}9>nhYt#Mbb@n>D-
z)CRYMHTQ$}&1RbQjx$No*7XY05d+bUX=kNMcPqKiR|+(~f4D@>ZKa+_pnKKqXVqW(
zdYXRj+n)7xZ_RVFKD*WBwfFW1x_s`t^N%re-}_{*&$aU0c~9FJTutof6qkw2djI>v
zrJDQ4o1%XzI|!bY&tC0*>6x`$#lfHc6EE_gnN)xN=d+pf!W`RIY&fO0ed*oX+b`Ad
z2hLxhC30~>X@_TN*VnVN)pEVfdCz_?=``G%%Onzb+od>0?(Fy4hW~%>AN_P7IN$31
zz9n;?f8RPMI#J0%kT*DAWo5V7{fS3hKg+)LR=@MFKRk1vG=ul_)s7Pv`UH8zXLMy~
z_;<dVT6DAKx;Xn~`QOLZ?oN5LWqa!7@cTBdE3Guk_dUG#J!kIo)7q!5CjY*(aMBLd
z3iXJ+RbPeFPdt?C%HVr=OGE0N_mASjFOu(PP3^jVM(gw6f6MQPU$}dFTZrv6{k;<_
z1$JMGTKZ}a=dI^aGVY7keO=M|?S-IJS5ctD<+-<O|6kVqwEg+&dzrzve55S?$h_2_
zuD@m1uQ-pwjUS9Px|A%0coWTC57zi!H_bl$EH)@=e<nxu>Ab04tK9m7-hB&cjZJFR
z?^TNWVYecTId`9UQQz{YR-L-SpN|p*g}b$kKpm^n8Fio4&VCmt<y!5;q{$KB63lSw
zc;0mPjCJSVK70J<f#D(F2BoM6|1LhWzGu{#UcXBuW}n55EB-m&Wh@$tZhkziwf*$7
z-TN$dSeQ->U2eR&m_=g|>x-c2?inWcxeJ^=PGD7a5Ik#K_cr0)p334`?<>>JAD-x-
z#}VLC>}cvZ6I8iO%J#c(tET*-skURe(JU4b#;y!Gzn0kDWhY-<UCsL5F8|`9)?%hr
z`h0W#pE-Q;h;vIHgR9B$Sf|gn#~UJTI7MbKxSF)fE^yD#oBdvISK8ALQxY!n2`%V&
zwjlT`m+9H>G6zy8st6b{i3FaOU39kG;#@N8y`>K}Wl!_|dt}>_=?tz{l=5f1muTI!
z<G><)KD}LOkv6OmAuOB$F1jVVuGf?o{=58iXDs*K^GZs74N9|~a)PXy^?u#%wA7nl
z&-gKQF}Rv^3nyM(6}qYTx!<h!kp?MYLK<aEA{Tk8E@bc9ZSmjpvu*R_rbs342BleP
z*Q?K#&-kEscc15H+q07!PkJr@8PI!K;qLU+O9M*|POj4DTemY!R7OwxfeB;R3dir4
zYRnsssHg}8GKpLik$o?_aA(@SYJEOEI|)_S>qX|A5un-Krist0g)Hv4GN~-!h!73j
z@jK`4uFzQ~nM$Rvu5h}<L`J^s*4Nbhc=RR5ovet(ZoHWn7Bu#q`ng<g;nLrEU*?3L
zxx^S#c6L)s$I%H5hK$-uyONG_RX&;Mp7Qb0(T&XC-`ot=+xsOb^Tvimop)ca$4~$G
z`1tXCuY2Wet4>@Ek6*ig)%l&p&rfa1yqt1(SLv(j+uL$eZ)`}sv@&>k*2|pw!k_;N
zY6}lE2ga0~-Bhc$!A8hHF~QYkx&QoiZu76l6!!}Gc04^Z)A;E{clppm%e6P<-ZpzG
zWK!}XKz6BJ^wzA<x4)ZMxl``!D7>^fTz_i)`FXaVJ{;yh{o>-{r=S5QezSGc4qg(U
z^?sVeCJCVq0Y+^ltC}AlvYu79^T|G$TYhh)nbB3BM5XVqulv{Y{+VN#-1fk7s)qPW
zLAM?WMP>KCDVD|0PDrND5uBla*~8Y!xlSCEf{ksBXY{iK39p!F<@rj)@$>xZ@9#p_
zANH8LyNYYZ<!&)uAs_Y(M%S)yZ*Q-5Kb<%w%lJWsfaIDzyT5%9h><DyK5=#NZnN{u
z(_EQm3T-eF`YI>$=;s;Z^Cy=1&QAI8;NZR3Ea~5hEfGFV!R4>7tzDXScGkucY4g00
z+i!1e?LPXFcgA07vz!a@oBy@^7Wx+>Q@iWUtf{5PH!}!r@HjB5!*7m7VA#5tl`fgz
z-`#DhJU`jbYGqVtVYkY+yOq!9HdXqu{7{c8x#(JSBe8wu`-r>l2OhcCINbU6_V(k&
z#=rUkZ}rJq&k+fj{=CfiRZf~xqm0l7wMBP#l?E%H){Wi<nuARJ^yFkvSeV-Kxn)sn
zelfH01bkk&bm`KdxHvuUX*z-(?_<mFswN-r3vF5zyTBl+m%pI&(EMHoNBb8GnsY=%
zXBmCDqj&cEg%VC}Ax5S$k(FFmHXfH-eWtv};s2-U`#q-X#iqQvvhvf%<MPK14z;v5
zC_UI*{r#O$$_W8etJ?p6zlZMm#@>29v&JE2v0Lw>#Xt9UHI(Oxze~`wm1vdqVM<g>
z@O9bSd&J|#kH`Jtfxk9p-TQm*?K0oltJX_wRWixD6H&V^et%qT)&I4zyRYs1E>?Ma
z`b)Dj<$JEnaVO76U)GT3HR-2^LM>C6i^+*E*SH;KeD)FBAk@#WU4v!GagVHfdny<C
zRv*!i-xqUs`?q&@rQ;=6alE)%9xl&w)=#Z5Nnyg*IT^05t)K>dmf*_^&iqqvZOzvH
zAF$>^a;t11#|-AZf4|*cnty*^){&OhrLElJTryt^j|W{}7n{7tpuEfSDyOiT$NztS
zS^a($Y|Fp7X=%}ce$}22ZKun_Tz5p@{Gy~XVQa^slK0ow&p$KE)O%jVBhFTaZhLpx
z(kXMQ-|gIJ8L(t^{QiADvrIgD7fcXnvMzYwVEOrs@zm3kpP6S|Q22U__s&<7>Tfwu
zpWoP7oc^>xeoNN+&#q4|r(R#P;)~+#mwb(rR*4pUbrI+YF=Jfz{n^>sQyr4x&b|Kq
zQde9#{6|yLJwARd&u<?DpEyTZ9CB`1EcfM=wZ)FIWQSGzYEutN?fgBn_I#Sh)O``(
z*GK+|zZtymwAa_$+cK2S_x;~HbyGyg`~#PkdWSACO>L5R<*M}m;kTm>JdfW`y}$kX
z{;O*ujq6ibl4H#77Zx5^?K!DcA-^}}<<9rgOcwcz1h`&qP4;zJd?BzkYq8mV!(VH{
z*T*efHF5IeSJtb8ME7mh*?D5wDfy#+pNc*Wd;fvk*qP@X*Vo$%I@*4oS+Qz%nPBn9
zYgbC%t@%}QdzO||-S+Jh%HthZhexdrxjQlZf|tvK2O<|Ilx=$b%v$bO)5Yd)@%9Px
zg4Trffodiev)M_pX7^+FS)^QkekOVki^d|w*VeP%E4~&8Yi9`(SkSSIVaocudi@vn
ztcx_c|GCudqs31p2f?%AFIA3T)V}gzeXIW(?}Jafn?Y4f3aHkwwAQxV`t#kQ&wJ+G
ze){6_sg;MEoV*&8q89Wu7F*8S({elF;|0;{^Y$#!=M%ZWG&jK}=N?CZ%jdSL`;8g<
z-X|Z_h14iE-xtU&+?lg)cSU;WJbz)ibsZp8S3r(nnboe?Xd}F!;~C=)v-=xA^@&zY
zX9~X``^tBlsxXttMV}Q*Cmt{TESsNRdeKz7S1;{S2T1V?mJ58()~(;S+hY6d#lcNS
zt-KnPW;OTqHvN3}>Zl_7a^~)mISj5>ir62&bXm90!Y^JXV_&pgW<*S&@Pdx0S9a@v
zzFXA1^K|j<X?~1i!huX8f!wm|-81yo?c4osR_emvkuFC#16(%SFlOva=bUiUbHNGD
z02kvo4zu1%HYJ-06@Z2cn)$xYdT;PBwyL7z`=bYsngfkq<fSP#E@9DF<oWSO`LfSN
zruFX%j#udOt-Bj3n)hi<tRZNG_S-zUg*$&0nXcKlxL2=AOrp$i@<azW7L7%0H)8hL
z$HdD#usOfGpU00)O|j8}N#vr1!pHc`eaD3#mJ2B`>N9q&nBJBi-G4#g>7vfpo3f`Z
zm)_~gWT~DI>QcB{dETqbOFV^F1~2!!bn39ny1>P4CK(qFc<ox!x@4!Z*0bH+;_W88
zXPxv^$Yu(2DLL9D`ssvn|A|LOyOTv<-Q2u9rt0O=OB)goN645xJ2zJwv<|2A^|h5h
zw&mVFwIT8FlHlcjl1o=lJ9$WaO~B*xu8kkp?c4oqR_emnku01kE(_e;c0Mxloo^T0
zYqx&qGbu^isx5PBKAkkmzh_hV<)ZuQr7;^48hfP8{jAE~XqextSR7M+x3uYM-jkaf
z5}kF{X6}k$<CZqKztO38;+AfvuAQ+R8e;tq_C1-Dzq<8Zx}eGgPz`TY^P^zrn@y*e
zRDXYWX`wT_<^MmQukv5DHge@nKQluy_tqA{CH6laG(Vl-%r{X`+07#|a^{(t#_HEN
zE|+ZNiOf4tb6iHzEq&eEfY;s5si{jRi?{3So_7-xBqkaEir?Sc`>OQ7t~P;HuH9ms
zXKH%vN;B^7+ba~)V<+fy`Q@LRbx9>{;o{DBVx<=@%>DJ~!0!G{w!t&zvovwO3EuqR
zZ{~3)oB5T`ByVoXoXjI<V==A%@v+{l-LbpNHd^exxGHq@49omke$UT73%0*^HuUq|
zt1CNme$A=$JYdF{tz=dB$R%=T(b8GvxA#_W=aIDv@w0llB%=0Xvs*)OIiwm4-IBTM
zhmq0GzKQ93tG>>eC4XgI<hpy2Q$6jC`8l6VYA_Xidu{D(qxS7NH<dm=KR^BCWcAfM
z&t3Mj_Pr`!T*M)<@)-LLtB3ptO=4>#XVx5-S>b&!^}5dVU!A#y-3_LKw%=|fC#RgV
zes3dboYvzr*D7>Z+1pijrf;#=sPTNv{7A|)Ysn(t%SWdRetoZZKT`DTzSQ4`eGi;E
z6jURe=p|SG=c88Cd22IJH5R|WuC}HKG?F8AG^st)Dqc~r_rmJ;>-JsOTy*zTnz$gN
zwvtrJqU`<tYq*pj2={&cAb(ZO`q6a#_;t?$tG~bNU4QIl$fJ(`#Wzj0AH|-2CN9`G
zYkGX$Pu~^!o72u3ttxYMZ4H^a@R@z~wKXfnI_}kc_O1MMQhjOZ>uW{lET3~c5>%L%
zzvp9H0;}BiwnKl}xPv0@?0nF~oy2Xk?4{AF4azeg>}%P*ui!D$JFd$;vYGSNOKM-s
zo4(U~-<PAi#WwyueSS%if9upV(>3woZF6?z&pPY1P)Ehhp;{=_R-Nne-uV4>M%mYN
zDj#*KUt!$fQF0~F{p8N)^R$;PUAnQEPs+q&uV2NpGc%1qRhj-Ra8>p`cB{FsxVD9p
zbk$c`-?EFQ+D@@2msvS2NI5x4HS4BK(lp-#FA6_DJNxS3z5-b<Q=_J?<kCB@E96UR
zE|)k~#&&mqdi7hI``U@S=igMDHD}kZzP&l^V|}XsPrbjUtIu!KopoaK<NEobl4s`3
z099gF&#iG^^h-chRrS)A%;3MKPnW;^(wMnx3cJoH7K8gA+iwRM{(Ts9AbV!{n;R3i
zct-F0YV0?w!@8EG;GB!1$friDYc3{SvY{)?viRA>&z8TPHT6{b_9bqf3qOdzEj+D#
zYHDi47G8}>UBNEScLMchzkhk|?Ys5!=KOH&sMf9t)m|IAY96QHzF9j%mAf)Leha5b
z<TW1sQ?x2D%47C~4N-dWGD2pvtmmjY2=XRg&-#3K>+w&FTj$*_EzDACSuV7C3Okd?
zMH>e*+ZMTn2k)NV>VAD`_P*Ih$yP!dCX8Jf3#%X8etfxx-_w1Al*$A(#;%N62Z|=z
za6Q}Iy)JU6g?L2TN5KUhVjIpsknddnYInvy=GFTw3jS?wP?zMNTg)VKagH*d9mCo0
z33@%MjY-N5g1Qd<F9m0vUj4ozeQNf)NLGu`iW5o-4uWTs)nAHc&3a$ia?W|8Lmy{=
zOEFJ``1-TuJ?9=cybrptE;2*<-w(g)=~dHnJzYU-UMIBvHMnocRa)5S8ZQ&GXY(ni
z>zg|`1Qv8W+c0_Wv)$dF=j)w+`|QJ(go}NG3p$>yaQ@11*7ft<((7wv<_hUt19h5Y
zN_66?AHC{+{N-rlvuZv+8L`MIEE<c%cAtfI&+a}td1%obMF+vHSEg3AJbT1tdbZqK
zowK`e5`*g%r|qwnZ{BV3>r0$WO!3)G7ryE=v9u`7I_l~0*_ONFj2Ba%z=Dpn8x!vd
z&dTO{cCWiR`@HGd4ZCOdvIv2OQ(Puju%G>YBxgrE%ObZ1rCDzMuLYylMs1z5=l6-!
z>uXGQ&GhtC&}9+{bdJ%xFTYNoufm|KyF0lp_DqV(1VP5G6^v%H-m^`Z(ZZqxs+yNP
z{>s7Y86&gsVvYZ$pLblD+E_FeaXMVA@n>kesN%qM71aB?b8}PbX)(~!%PG^Qg;`Jd
z7Ze$}(mZ*-s;cV7w?BA0B0<C5j?HWzcNcw=g^W?W+>{-5&W}UPhsl#8Lh#~L?eJ4m
zG=rZU=C>E=P;vSAVsZbpZvA}`Qf4_4)_-2F->>)hcz=KGb!pqGFB4X;-xpOMI=}e&
zxv80#mz@MHv;2-!(_OuE^UtGQKi_@2v+nHYhSZ4;RxE2eUOeu%U)N_@^P|8t2{cRa
z^zHWhVmp{(%WkG_{FQTio3HKHnim%qZnVhRl67^}t?#VdVkdSKK3)>OKF-VH`<t7}
z{Puq~^vKyp<?ViJ*2ui$tpMxiyP?;0Za-%_t=w1w@<aUJSK(LVysoW{HV2Kzr~do%
zbKkB9?RVD4+sE%QPXaA_6rbxjWujc-kq$wlq9-0Rjnn()6dsej_arhu`}5tS<%@UM
z6rR}iIFf-gLLuO=ljKzvk*AJ7W|`%#itC)1_w&a^{irP-pb=l;fGHRE)mDGaQ|bxI
zWwW`L`}*42tbd#1_Ewp7>s3S=-2WI?9V7GMgTTJuD;~ri;<E5KaLU7Eo_A#A%$ko!
z#V>74KK>(iQ~CS2MuDVzBKB{tt&R3RJIgfrC1@mZ+wHB{;@y{}4St*F+*q(b?d!_t
z_OUf3bMvGbcJ8p47JA&+m@`6cg0SFR)9h(ercXcJz{tERR9t!C-QDG<=a%2ooblY{
zz@KNX;;|~Ag~Y%50u`Cw&FkdvxV^8ox~9bKexSJc{c4xbwu>(}&h$`7X1eAo!guHL
za)0qPJHEfXygcft!m1hkt-pm`%1%yFH7b1Mvh(%2-6?NwZ1f7)$}Qry<|E@ezaN`L
zV~q2^-qCZPzwMmBG-sxjoHv4(tV&K4sXQ)Qu3;bee$}3JY(5ol?YqvuySw}J1V!g7
zFTVW!en0%=7JH3*fg<t(*H;8C{_)~Oef!UMb8nZveI)RcPpu(9c!QbH-HplZe}0~?
zpVrmIwe#Pv*S&KeZ)9j~s0?X2)+@dG{MXmlSNp%;zcu?h*B@8OZ-NVc?(1jW?y*3C
zWlfKZVuQhP^Za`{*W;>lqw3~Fbh^K|u(0{p5gE;vqI-KPPZh?yhW(A+SF>|h_lolO
z_pG!&%{REe@fTmY!Mc6!|4I}Zm;^T%3H^N?|6l9$G~LPae_yzNdbxc5D*L-~9m-+1
z4B4xGzuoSAe_!p@CO)xgVtO$Wv+dvB+PeDOBC#cE{_}K%)qE!W`}>=F&X<Qd_cx__
zKW&irmUzhf_nGgxdbb}c374H64|H`r+UDQ#d|tI*ZPov|b-!K~eY=^iJ^%c#udh!p
z@tmCWZ}Hab>(d&U*-y<(pSLn*UdcYkX10~zx1FD38Ju>0-r7%P@9soe-eF&R>vc`w
zk0n3lTI15ByE_|11@}ImR~@uXa`mh5*wU%9j9c|J#O!C8WCr=#>}}<dvx)f7zU9Ny
zE9H8XmtAtB*Y7)A!!FDwq|kUsc!ScSmnO_f67}nAHvOqk5@}v>wY;F<V$JcRiYKHG
z-+nK>@6WON8`8($K4CefeTr4DJ&+^9TXV|PS>=MgPVKjH7N35$`}?_7A@8@WkKezD
zYxUgSS98Ak&p55MHdIQod+CH}TCOHX_A~Wdcu>vVSa`O^|NEnW_3Q5ETO5fMpS5ad
z*}WFFHOrMm0{MFka$j977ti;-TD)7&&Q#myxxnj5@=PKZ{}h<naoyu%xbJ`FeZsus
zTX*+=IePHu&e+F(X->;I0$iN0%r&|1d_{5%7pH{Kf)1&sQ>8|>PK$re%f6&DpXH6v
zf{t5HXO?A}+`sI0j7LR4i%H}nQ(3#&{f$ktP90s|aP`cK3oqC0OD_>fQ)(0tSkNK1
zLO90!er)MktqU&?9c}{+JD#7rSoTb8d~JDQp85IZT>RlGEE<a{->lG>@qS&L%%_T3
z9|BxKW&U!$!?tI3*xzye?@?P=@bTO#o4Il}K7yeB*N)G7p6%{tdiCi}UY|d&*n1Af
zt_(iwp#BRnF}3A)O|{#Xvv!w(I!W%bQmmiv9_@DS^J5o#ZNS*I;_11iKl3Ctx|JIz
zfcj!@6xRRj3!LT6&wub};>k&>mo_9ie^om8V_Rrg7~7;H*_$3SUs?y5*PMCHoA>eQ
zhvh;X%#2+tmc~VFPV24uw!FLBeSZDFoez#S>hJ%vX-?U#%uloL|5+wwx+kFE)s>Z3
zAMJ@h)-SKmE?=|Z!PAz0yI(78zFrA_b#{YCbNCU^AjqZl@%H&*d6OM3f~v%up|@&|
zPu?0Uav^<Qr5k6)T&vP6+H0EK=70v07GJKIvN`SSB!0Ue4xFmr5>@|yJT4!uuV(XP
zf^*8-TU(3%|NVYicl(`1aWmJ(&z6nn+dtW12B;_bLU#Il{_EoG9dd5-o!fW>_q3X7
zl)SkS_~AM4?(+B3I)&9&g~vP&z0Tp$JW*pAOUa5AD+Knu`0#f7{V=ChkAHeH9d&9@
znw99kGiP7*^D_C02aP@Vw){H8t<Rxnls>mKtjFM4;N#~(AD;!WbeJ)7iYS8`LwlFG
zXPkJp=x5$xQ*JeTw+#m8`)xj*Skhwu>xJ^x{l(AEd0sA5=WLnk(7Pc_r|0XT6I@Eo
zQ_HW*ZD{Ofex{Rq=Iy?(*P=h&OrO7U=lPVsJ8FNIRermfzO?rDw@aJT&!>3q>}PTE
zZcq+9ysojc+g{v#e%$A~ZQ0jAlYFM{EejqTSW;pr-sS$RSIX3Dr?sl@nYk(gLEz!w
z$Gd*!Rp*u8+?2X0;UJUc^Et&!%HH1MeCapS$aO<i{nM%8plM>^WsmuUIIJ1FGA7A&
z9eQOg7n@#O(i@o3D`onm$M~Fw$G4x)=Z9;5kND_6O)ru0jw6$zQbMT9$AB)~=xrXG
z)6Op0vc)9RSTW$oMpI}%IAufd?Du;6r0;I~x$a}$jSY@*wO>Pj9^|i6xV6^v{pI=V
z_kNpor|`IJ(XW@wPp_~0sx5ogUq~Yg)LnjhYAVy`H;4J{L-=m)xcVO2w%9StUqR#S
zT<h><zO$F*{XUG`g!m!Fz3gR@q)y(8<GXLlER0+e7v{P&d!K&nu8>%Xua4K($FHxk
zDm<+w*1TtXso#9N*t=7|OrHP8MScCZofRLGo<{I*UzT@w*GX^vy&|{!S#|Gi6*+vc
zS4k<s)#c&2CIe6_WYduhmUEYXB*v88Of{65p)GBmH>c=8Tfrl<1MTv45pMl*y4&xT
zMZdAjx?HlcNjKN!V2ywI*T4V&z5nmBTanRNFYiaQ=*KUY{g3N#etFs>X}l!+`a00w
zAhvHDdfPm<SAEU8`uv`Y#`^O2_nNF1OL#1p!7(MoHpI!+Qc2q0cFl&Q&~WxUtwled
zPWP^?-03sR#M6CsAjg@%hRMf{$n1E?WnA>c<LAxubz-yS59c<hy-Z?_zEN<qW_xYn
zk5#WM866q_@=k11xW%`A&vv(E=i)MV-&pc=>ebviCG~n`>tKU(7jvUcCZ-?%f6psY
z=ZHT;m{il$i7Ub#LKlYGFInb0TPxnNbjqswABv!cji2q;D>E9B<ZD<yMsfDoZ9I`M
z%Wr!2<H^r<TOMt%tD07`)hxp0toKQsr-d_9y{*F|uPQwFe69WDa`!(rZ}*%Lumz2)
z%0)xlI9J~-zqg}svDdYAvAcgfxwI-&``{v$CQw&a(&dKS!qkA)IjI}p&iZ<^>F1|M
zYqyK}I25yKt$Q#x)Liz>ieI;-#m}!-nb6_j=OXg2-r((r5_#E#Ps#_Ds@W;<m9JNr
zv8-EP`R;oG$unmYCo0#e%*~5T^v?hN$l&`y_LRb@(LoE{7W{m)d*!P~`_uKG8prR6
zwd^YuJeoT(V(Ht9i`&1vysUoA)7~jJ|A1$grHO5S+AO`Wf;Q<20k`RTu|{WP@8wkG
zU7wcjsCf2!O<>#4eVbqPGtJU}lqY+9RY#Htr@X_D&Z_XIjXuAdA8kGOk+HB>$~5TW
zvX_recl;{9{mj~Ju78*=-!8jfSDsa0IWND>zL@EnOUdy**-y{y|3_{xs{i}-`f-=w
z@U?}H^TVtjrc20wD2V&ftpxVgsr#Ax(y#qCxo`aVSj<(<h>xxZoi5$jn0!@Re%;=0
zw`S~L{yji9YD<8VW&S;zrxVtH*Nxv7V|#<yu8CvW%aVU9>JQaiFW&v3sG~kEeOFDw
zzVo#SlP)U<%y=(yq2xTzGJlr^X;bZ=``+Lbwz*vJ{cic{>kbKuoaGx1d=LKr@SIrg
zs^op2d(H0!Xn&~K&iBm!<Co7>UtgVM6^{`RX1H83^V;>PH3er62|xLG<VVijD~a3u
zWv#AcestM?xaNN7(+~5r{%y|rU-l_<_Ji4MMV0?@{(mxFc_%pWsQ~Zm>r)k%%VjUs
z5qqS*z_xSEjL$oSSs(6vJ}-Fwz4{&Qzus&<9~M}#m*ts#`nfrpo72yS{aaM<N!~EY
zWou~l<&t}kT{34st4`Z{_F{V4of+DejN0Wos`f4);#OG1bQiRHZ%UY@7b&Ut_A)<z
z<IB9mrms7-^``4TJ73H>alLMQcx6k@>Y|<AroX<V-KlwS@lzz@oVS(7Cv6u$v^V!_
z-%_7hSyr_Pv-BogiA2lQrcdo%{>nY`>)ta5YV@}iH-6>iZ+vq2z=tcwmrO4{v(EE6
za433Pw|mLF{$npg;sWE|J~Y(ZersBMiCT}wqL~4wljUwd``x`bf9lcyb$0!_C;l%q
zGQ9se{`4LBja$N2R*6Tv>ks*%oMOG<#4=Wqi#aczTIiqs{)I95>)dC*?ead<B%aV^
z?8?adnHFMoPk`aRfAq88>YL*xRPx)ZRGZgn@~+A&FEw3rYn$%cqsrly8)AQg=3VvQ
zPjTOzyYF#>sJGpuu-)6dSO1k>W>aUV9`W(5b6(d@-Zj;retp}D^EtELD`ttUc4G1q
zUeM9Dp!(}!=bV}E6*GiZJ1|XDbP&`n2+#g3+xNL(LAnB?kcJ+pvGh&+OnHwJ_shp&
z2cCVtpz?r)u`7dd*Tw98w|D$r!QlHq(X)YNAIKS>S2}#QJ%6CmLg<7cV^>BWV|DlO
z#s5EuXwP~dr*%iI@sV1>(}ib__9}ee+Wxcer@zg{E~Z)4_iUIrpG;<OUu3!Lt?B)Z
zOz|hGYl`oLi1{;3RB;eIo46gcjBPK|ti|VLoYF3;1SBw-JTJb$c&p}kwx7lVONKK_
zo(e837D8L^NSfT&Wlk+r5h!933G9}2`FvN&N6eMU)u}-#YvJN8pKZeL>mEoER0&97
z(O48&HlwbTJ?!4jU-MLb($pK3K$b1KoUt#Ru|LxDfFNjI*D7fC`xB?Ge&=B@;^wq)
z0Zr?sU#jsJmY6)b;W3NGqRbM5JJUZLznCs{Va5~|8FdFi(-#TIz4%3sGxsfLIC57-
zpb)f|SG~dP{>KL?`}SLNYP?fw<PhGVw+J-Vc>YYzg$0fZVR!uH<h{JS9xYC~Zz!}T
zaB-W8mj1L0pW5m^t39{ZZB8vzc_6{KS_!nw2(;!e71VyZU;AD2d9nWb>+$um$NJ^p
z_XgdD_SJVq{kgNVIQ7<+%uRWBtwir{%Z-*a%b8K~>dML}tK0Dz`);e9`s8sSmnqC;
z%bGPla?q`)$@yz|qzdyuU33597Z(;@U9pXD&ph+uBG;{7w(ZOKyw`WO**@-uwaFV~
zgcKOJgF5Kt_bT1(e!nr^`E*+Jle^{jr>f7dF;Y~$6Mt`g{Qj2T8$ml0nG~h%YIamf
z**rp<scqC)eK7U2>^)W<6$hrBiV06E7af-=?&*;-^|C5^Gow^D(Jwh_LHhZ5hK#NY
z-`?IHzBmTdH<#gO>iT^zw)(T$5#ik1JBxSwrs#CDcpPv(aLQv#+Syt2lqTmVJ>+!i
zIJ)H7+1cK&udO{g8#L~`s-f)dt)E;?H}@wVW{a;`CTMVfd*0nuuNVbOH7lN%m0w${
zo~mcsm#f$)Ah<zk(XzJ(f47#szo%P%uX1_9JYmMqv&CaeCd!oENPK1O!n-i<?ygst
zfAbgK-hNv$G;zwd<l}tL-R3`7`n+sw_O)Y|ZpHQ7QDYR^;GwWy$tvLhgQ<K}RFu}!
zr%yMfoD`aAQMl+%>GfEnvNsW`E2<p1l&}3@2v`4elSAN3GoRH7x4?y3hoA1e8_<}R
z>hU0&sZ8XgfVxiwhX#|~?(+9~&TTw_i!Xn_Umt%oyFOsgd|Nw(b%BfBK3@D2=X&7j
z&e$>o&X$=Daqf#86+j~$iyo@AUf5BX{B>vD->R=K|FZuN{?Tm|qQ2m4`L49k=ZErD
zCh#*=%677ua%g|#khLlam_I|gHQ?NAbN?-w{j#U0>xUQD?ydeF_VUMjX(ogFhW$O(
zt7D>NlI15m7z%7K5^9~fH|M6&)wtSr!6O^%{{A|3e{<^TX<2+<zTM8BzOVN8s-rSG
zI=V4C0+#vD*V~c2GW+^E!?+pNb8RX&`OGkI{Pq34e!->o&9<i+ne7gnKeM(GRhaYR
zu#7%4=LCm;oDqT-ZRh>sWMEJ%1)T-3)O-4>R>l0U@ArO>`}%cCu;0Yu^S0qXYn(#V
zeP^lM`nkL8?JXn3Eb2M?j0*~-|NowuX`K4)%}uTR=jY~5JzRTX)!uXBQ~jsMZeDb$
zJ!iQ!Xgup-yS!fTG9OPb*45z7c1TDFM~$OlQP!m;o~9qah#6FTNH{2eDQQWo^;`)T
z%k$06+2(8;@;w(sa6XBhsnGWE`ziJ2>uVx6r|eeVoDW)ZTJ<&SseN~4@~rn0U;bJn
z)%978YvBa3tb48|T(Viadrj`=3irBIJ{5fm8jo;WwDH%mNlqryl%hCZWy%CwpTAt=
z&nz`ri)raruchA8^_EObW)it5!+dT_#jN);CnehnozQ3O%BZW9mi3+eJ|f_-bCiTf
z1Ir=r1|_LY`xgF`+r*bx>Y>2O*p<QM@beb${hOhy!wSFJ#viDZ5!&F=pp?a#Vs`XG
z&G|OD&yySyIRjj{PsjJ#72ejluNC#6@4-V)1!pGKdIrz7uX?|7eqEK_@w0&`>dW1e
zY%Vhx+!wLFsG0Siwc(ueBnRl6Yv9HRn?*n8b?`m*T=0YA!kqKL^Dow%7tWAtWBKIM
zpnTDW;rp!jHQ&<Z8a@lCOmGKz=5XBRG~YKTKi7N;>Py^QA*8_os$LdkKd)T3?>UD-
zw`$`A&_MA5<qyw%_w7<<Pl#0EY?%O>&Rl+>W;@T6qZ1uK(~-KR6U^=h%FKPP>zHb&
z62Jl)8@B3vwwtv>r-`L&3WKZ3>AvRQLjNp&oe@&mJlSEQ5NN=+(B!@`%kdmg(c6{5
zChPUtmO0~$6H}kif{tZ3H{Pnze{!4k@*1PblNmUlOki*|;ob4;s_dNqKFm^+CxL4T
zHd&v~cNv5xPjGPI3~&i9*<*J9_LfZLiV6;9&<>Ld&H$IaCXcpd?mN!-FkDE1QJ(R&
z(ysFNabGVyWaE|k!S}4Up)+Q&8}G)c=c3ED-8Q+uS@pyp6#-eMFxQfci(HF9J?L9o
zv!Cw!{f^tD{yAbEQu9>q?QK&N54U+P_nW&a(A+m%cXF#fxIoi7JKLOp&Hh&B4IDxW
zjO`o|m78iKBWDVokIvs4`t8ll#UDb#!hRX(Mr?36)+?<pYh5-)I)6{#y4~-r4laJ=
z)-ShqUeyxg8Otue%&k3C)825Xw)6A+Z7Vj(2o=n35EZO_KDYeI=JR%wqw{vU{`&TI
z_JkWflEy6DCWqVkr#JK4MSvD8OByD%IJ7)JGgJ6<`YgR^il=#Jycf8ztMs)NW9i$6
zC#}ohotPxBc`^g13aJ0qZ~06@(ll#|RHB-dKnvHiy7TjFuf7Ogo_&AcUZc5&zg!G_
zmw!(G&G}jO{J)l;eJfd~vxLOUY)U=yN5z4ulQUwb@Y=}DX^)g^cBg};7gxvbF59<d
zZPeDTnV*-vtZ7XVSQvgkao=v0c@7I>H(%J+RrNJBnyqF=D~pGMDWkU1tX~F;o=HvQ
zQ!9qfDVjV}5e!-y+_~vb`^9w7w4!i8ZQ+Btp^@_x&iFC0v3ycnRJD*(F91Af>TKXE
z9`B}hKQ`K?>F2rYlTwP*4EQ-y{1oz)R{eD>e|P8QYF+R=;UnM6Ke;+9SYkIT)iG`O
z$*MfTTrl^}j*VGQetmsi+uItiDOM`r15#7aVs<}v&h6fU?VDb@IvqImYL91h^p=c;
z;L%RQ$+ADE>Bp}VbFBLQZf%#LZ+el>^~<0oEwP(p-rH|G&&w3%BJ%7<_4~cc|9zS3
zQIPI5r~HX!!U2Y#e?Fg2J=DT^N?$n7_xru-^;>do23381C90eSilZiJz1?Z98?0|W
zQBq4dIwyWt$;uvC>upkO9m<C^m(NjpKCgP+Ejg2n3A@(UVNB%pn)@#2>V058>%HKc
z5;My!NX4mP){_SZn_25WupfP8k@uU2YuU@DPrIbHXJ6Ng+*`G^=>MTD?b-X*uKOl^
z`>9!D0_$n#*|SZv(@I1xm$<cx7AmdVCtmnmbi*sqiV_0_?JElwB`8U?_HDiDHtYR1
z54Y8GK6Mq{+^8&d-dAJEd2`T^r1syav@_zDYxoP@TeoB_-RkvpK{Fp$=G!|f#avC6
z)UG^R9+OyDtp%!GEI0#PoNwrZrl+3neXsaNCaja?5l4W_;|7sWtFPBQzw6%mhEr}f
z%Nfo9m$Q*iO;pc*pYtg7p~?hf(2UtaQ~ipot3qF?vCMk^?97ZwEQg#9oXVY_nCY|e
zD)TezXZD4M8Ckd7sOtZ!+L+H#pc1vf_+a)v@k@a_9L_#Z^gJL5YJ-<Non@MRW%57E
zUpfpma+6qegcn%mOJ;0(wB={t^6$Y8lP5m16Vi}llIeW5a(%|W=bR?|!pa3%`<0V!
z-#H=6*p>0_#xbvDKjoYc_Sy)}FnBe+=*dFa&m~(j<lB^H9sYOy+~=6u^NJ~AvAqtr
z#eAQ<um81lOYYCJuPau)eKLIxsBmRj&2fLvOyvzaW{Qp8bybVzls%d#a-pTAXmhjD
zEar74_lp^(x~i!<e74n`H|O1wj;JH6&z6gvyjtF!5E<gcWO844(aGC<T`N?tnB3QG
zOffvhlCe*E@u^Iwt`)3%3gQpRyU!O(*u<gCWFGfT_~%DX+uln?fq9^jzz5#o3AkB;
zjI-WLCZ5hz>&j@W$lRCC(Rb5GtsrXZ=Rd0H-=Dv#KE_f!d7{!R#_-&Ij}M;w`s(WG
z1uSWbjbAt})cE&@+XV-^Twb#F{+^RR&zl@HtaM|^*q7d-yMCs|qP88G`=pzajIvoW
z_C-6-yxgR*h^^x5VdoFm&N}V8e`~=ipGO>wJM?3JeV#0n*?ar!f{tY`;&b<XK3b^h
zP`F)`DL2||;{LxMjr8Oq7tWmT^hs|~#k8~<4Nc9?{-FEc-`xd`F-=K3JIk|I>Syhj
zm1g%}Ut6oK8?|M^-*30|H}v(COg_MA8|6J;yI<Ggao^Oi-`6z{6jq+_;d~P6vVPAe
zubUeZo7b;f?AAN!eeL_|jXywZW`BHqoci!k>!#}Oc`JjL_sNvsDKsj1abZt~=GpHN
z;VxCpNn$VGndjBSxr!{_eQ$5IcfXwNs?ZM&%zPcS$305V%rM+k^)*X%7N}&e{QT@>
za=)#bY4)`#-1>VArkROLo7^vUoSHhRVK>Vstwjeq1k?A|{S^|5-IUU)6TQu+jbC1`
z_Scudm$$a(>uZOtnP7ge!nut{QfcYZrJSGBcQG%H=P*C}-G|dip3`NrL!G)5uf+bZ
z*P@#&FDduiY>IlN+-KpWP$Cd{oAH@7i^%Htxwp5KX8jXh{C}=>`3<*YpFBWa$_d{m
zY8-h5>M*qNN_&A;P6jS^yK2SU)Yhuf!?AZ^=<2Xnudl6*-g_}Je|OHlX4QY7mQ9hn
z!g?hx<3CTQ$4?87uMOSssZTH+G;eb!{q3!-q1uX*J~DO5TIJo|mU}J3!6DZ4{@0_7
z<zc$(!{grsZf={;I<Y|*<mvBsiu)hbIt!floo#lqN7DF7t9V?%>i1O#IUemwKQAXA
z^Y+ma`&v$;j*QF8dW*mB%f7C2N2I}iS6XU8k^wj85=Vvg#fv05omdnX8Qj$0@qj7w
z`ntJ${(if?QS0!T`#X!%-|W73phlzVtaV#Vbp?k{`Hl&RdE)gV0kz*gOlAT3Liyr?
zG?Uz0A-!H-?K)I^zHQoMWa@PFV@19o(~-u5{tmO>@7a9ne4C-l1aDBw{Fph5^0}$n
z;a=^0vPru)aPb${9c*IVXpwVfu5~!4#<L$1-vkeE#GZc}<nX=lp%~|rZijnri_Y7A
zpObTQlPjP7pMum$>*M#wfsXUJxvzHjpD)Ypd$(>+KR@r%5>MgE4+q(&-s}&p++ph&
zVwm5xlA$f1<3P=ECmFZrX3H&4OlR>pFvsDZi%9W&{e3?cIrx+w;P~=t_4;XgvAbSq
zJoTu5+-uGywh+{s*wM_X_W$Se`TET4d_7CMf3cnYzG6OOPJIN&6JHlYroFG%?Pghh
z+`8;dz@Zg)XFW;;RY7_Cex{k~a}|p!2e;*OG_b#4^XR4n(?i7x=7Lv!+lp)VH1EA9
z{=bvG|3UvlX{K8>?Jv)<n#~hc5#VF06u($tvinDt<LA9Ue)X94u`zaKocJBNf7;Ef
z)~lWR=3iBA1T7QL6cp8CJp297#^)0~4@_Zjy)q?a-sQDXTfOe?Ji5K>nWPQBJ5#2R
z#){3gvr2niie|i@@&AZ1o5q5PFN(}Io!~4`ky^yJ<fq)Ca|xjy2SANafsl2RFV>tl
zO`PV>v{TWc*v>qr*L&&DydJIfoYr!cA#wf3n?>~*`&_thl*fIR<@-`o63b|PxcJ3E
z^S(**?Eh_4Z=0<$0W|+)ID5{!gNy%u_#mJs_f(`fs?~g5)&6To>*s6yNKs%6W)cYu
z4w`l;^LgdEebG!=D`y<`xAyhhl_J4<Md-YSsI%bN<owT9Wh-0e9$T2PZ#iSPXDy4y
zB0H6xoeO@>lU{doiq~gb>8dlUIRjiwJ7sFKKFc00{%7ny!B}J3vud^rGgLv%T7mAl
z9<$z;S=`cFdS7+=DbMMAn`3oOcWZ!J;#P9+ynj4?VeH-j*P_bUmEq;`Qgy-4d2;J(
zmM;4_Pyf<IYd+U2N%Jq)Z0ER~6lii^_fSfp9g|3){G>BVTYmOk7rVYXTz|9EjMG+)
z_ica6)Y`8NPHl{15((7r<=OsqwYA0nnTiKwQWpQ5$Gk$v2;!(nm9yo>en0(OKil3v
zvbff!E2Hi2`m^87a&K|S$sH2lV=}pa_#%JcDppsM=6iZ(pZ8wnRQGtC*PeFa(xX$C
z7JG-Es}~EOZW$Qel_7OEV$HMa$IjJDE_$h{G75RLGq_%vAa<tQX4ksP&(BQm^UgGs
z<aB9daJ{l%`qrO(-&O4_ZZb$rp5V{|I>D{v+q&4@DPLb*4ceX;n|W~&E2{~o_B*A<
z6+#?aJKo*h9d4F)N8{`))5%h%pMG0u%z7XA*K@;Nl?if<0bLqy4UdoaPjBTGKlSeJ
z?xlWnt%~jx9zS_uq4Q^@WhVD8TX)Ww#j?mpp+qSvGEy`7SWjS@iOc5X<9*<zf^Rk+
zUy^oq7HF^Fvo-rO_C4p(<yK=%=WOwFnXVJ5bb6ZZ<cEjbz31E2iv0NY_V(#6QSB$a
z=JzHjI=6XbX0H6ock!9E%=3**=fTI(sj+;rzL*iPc>BF7Z!a&eCnuEq*G&7>q1-3X
zBcixz8}pg+9r}r1=Q3r@);q1txSg{lPo+yxQEbu%rFXn*qqYXcE0%3*s{5uMem_?*
z)lx;kmT94IU`NWHhDFgOcedr;Uh`#=Sir3JVFjB6ggSH@FLY|$nf2|>&Bw0=AO-5B
zo`%ada<Rw3j=3qoad!@AzhUb0b948ZCEAHJ`uluZn8?C8!GRIvLB&Z1H&35BwJPyo
z^=-i&AA)(g_fKHp6q(`h!bN2D2ZQJ0IuQZ9XYcGRp4xDUWqn&~yhj5Imybe8@gm#m
zZ&TEKXPp3TIg6RQL5qL8dWV+G+lT*-fNf4x3<!E!9@%-S<lP-hozh8PUtd3M`~8mc
z>FN67cMe|Jk{Jv-+U@C+$^Lx4vXO#93XK`U5xYuOG6{GIUX5+84Ajv`OgRNHN@;<s
zNy)Q4;zDvZP4;Y{;|4gi8!zbUw2F$nb_Jap;K-t}$T3919mEDL^l4i#qld+#fu)Hf
zz@>SGK_7_C!x`Yh>u4wm>NBzkF6dwjOq2n!A(P%oMqpz>d!7~@vH-CSR2&3NS&pWF
zjusGbX;6}KX)Oe?6FeG}vN*a<f{r3k=wNU)>EL<{VnfO-k;xN5M-K`xc4Y{N9s{u(
z6dAi#C~BxFgH9V%U=q2gpw$CnGdhD7GX?m#fgC;Rfu_+IfL42>Nyq`bT5lL<;+=DH
zK*v(n{3xh=yY>2<%xBAdXFqw|Z|`?=p8C8Br@H^Y?=SaBpY;IL{!5=%sW$D-7P*Z)
zoMt&wCoiaQOLtrlCRW*P_xjC2d$YX5A1{CZYtUmX>UpTEi|gj5)b2MoHY%%|+CBDP
zFERD^6<&3zrN*9L4lwhd*i-rW$-m$4r&oP_wNeLkkepkul&7bs=bDc7`+j+u<=v6^
zJ@4(YS*F=6P0O7FY`^StneX`Z%#t}SPmS;CG4{E<{gjfas911HbNLDIv}Qn$SN-4D
z@!E-J(?uV@p7`oU=c}1{mMi-X|NX|{Ql*l`uk6hw-RR6`>GDBbUQ1j1@#3Oiwt==m
zvL^fH&73y*mBpR;wv1gFZ9Ink6?aRopH!V5qXg;=O^>gO1f9#-E?2c8rsSe)(Ehr=
z5hp=s5Twtq4ZBzOI~O#l0czUsDu1t+KEHO`m9^2~OD{i-t@(KL)BOK`+@GD9sSK*1
zR<GOT^~Fvm`{t(9Pp7okuSk|HK4X}*rS-A>pAUyW{d_*(yPZ##B~_;20OP6{ncqjn
z<EMbSVsF>S?%r1N=0@N-+wXTGW<|I<Z!@g^mQ(rb<?^Tf^?w$dWMA{Sx^B%HAJBPz
zFYoT&{^yChedkpPpR_YG6qAqjOuTd{$W;F)=tMwJ!+WM#?yNmuuSIL=T7VYFO#+SJ
zeVweAaJY@vsPa?F&lijPuWV%Fms``f@H>0$zR%~ZKV1p-=k%#4uz$bjbInNu`&F+O
zmg_}r@wf`wKM6YC^ySsn)BpT=Za*C~7nEq*e9EzYajtgwx+!;emwW&I_LlYQv7Jkq
ze<c35d_HIKxrr`se?RKh4~e$>^TFA4E%UwO^7VWE{5Wpk=Ue|`6C00&0;u`)_V)JE
zTd&8hcKZ%m#Xmc5muErU%Mbs4zdzl~Z>Iq|Ptdu3-Ak+VPoBkg!dan}2K_tA-bT$d
z$($s#QrOSJ@k6`3_M<%y=T*N8w4Vi9MzVBz+^Ra09~U39^G$TV@bux5!<~KdhaK5v
zLvrPxeOJ&?pI@^{rt--|uO07qz1I8rdH#Q$`@ipfzrrtQzvg!Se%mm;ItPJ*CG86T
zABpc5_)`Je4R_?yisqIN@-B=$hTB&jesr{()xIJ|WDldbY|I3O1spS;vv9M-+~~7-
z#Id#4?#Ds?I)UGPC)V%(7sXlH%*LB?VuE7OVmDq%^Sl_H{ih_p=RZ8u+NIdXzDzfI
zTZmFq-50ieTLFH?y-%k_r|kdxZSq3rcCIre9fmDtk+zRdNA9cHx$5(?v$LO`F+Lws
zdSGWuF=Oh>hM$oJhg;Pne=qZ!yQ)PZ_vhLCI_211B@>U!Rr|!A*_)~hI=*7hXTQ+v
z|Nj2gzPF>H=GV*RpWf|$|7yvr&sW3aLzx@Qa&Lunm%rt9UljQ*<LoTcr)|=C6WVyC
zS4}F|<m^%C^!PZ3;~eYqby7bcvNtybimdx05Z&YVF_vBD-Gg?}ypycx?<4&Di;ezB
z2u#z9)#4V@nV`LXPf(xTuNM(kJu4KZSnM=>)pFt5s;%o+m%qKW)Gc;JcDI;r($7QN
z8h4pzUUJzgxLBU0C(qzk<o>$7QdhU<-VXa4@bU4tKA*k0jTVVVz8~V&U(tOs&|UWF
z-L=2Cln)B~|4B>aUS{m(FQ9C@X#KQ>uejY(S4f9FR$OwT`{LUcPT@zB!+!H^Y?=yM
zG<<MpbHkqMZ*Kzs&RR3?UQ+;{*qMTNFE8FNJTAN3hF78P-e<<{^!<OH>QCOr|6Jgl
zzHHT(7Yp^`9^75-FE6`ROhNHh`rOhm9lqLzVj=NO$^EurN0U=}y5-r#cFo<$)0bPI
zGAp(H+uPgbY6~=89bo1UvFDiajYGcXL*uU_FOExpIVtwOtvN7lLW7dNUz+ZMAAQM*
zSqFYMU$n342@u#Iw3c<to;@)M+nnwQet67P>~Pm`DWkA(sr!NcstXGoSNZN}cwrH<
z<<Zf=w<bT>1urpmJy{#QJ?s!if2#}Q-?m*ZC+c7N`uh6%Spr9&yUHd?I^^s<)FilN
zd;H_iN9)@kB$ae#GUzVwU=}>Gvq4kYr~1W&6}7))E>?c*+!;~9{=mj@?w86nrw<t_
zEV|e5nftl1+jA>h7LnR#q6ztO)3<%+^^eI4WxTz}KWokl4hzY`M@RpAd^qeF^}e&`
zOVo!AbG2BOUbXl8lTdo$bE`q`MD@ChPRqF;tG5V#K5NiyxR)_lE?8*>ds|0RNx%P$
z%Le~*S-<%1$y|53Eg*qQ;o?!h<=y{}oREKhw0!^XyFX$xYuh{f{vBmCv3p_laF17-
z+v3_^GOm&<ZY%fOEb=Kj^4P{v`ruXR0>*3NiTO5coSW0m28BtiX*0iH6D(_gds|h%
z;I-VYjJ|5NN1c-e!&Bd{V7;IC=>_ZLm{4Xl&1XT0b%`wO!9v9aGlX^97%oex>51tn
z#2F;+|2+5o3F!QwppWmK@As;kT({M*USU^^-5<60Mn~OwwHHNAef>w}SbR*E2p{W{
zU9Bfo|LgMnDXq*4_dJ`G-P7$be@pgtznNcVgdJ$*{roGC!{mAKozqn%OMLxnE%ruS
zS{bY^J9V=EjQtXG=hgjsY1rSGQ-8#AWk!>eVb}3LGCvmTMo1jumr?2xyj*<VcKNfH
z8w#fBya?QFW<GhT?^gcOLma$|lk*S!DPMF^`_e<E4gdfBUR_r4IWdHjpNC~~)gqZ5
zr^n|tpB#V0cg|AxONX~;!oK=%H`7n49JjIhaVY9yu*S+yum47zJ#O=N|Np=FM;Vi(
zS_NKC%&>dsbf~i>ntNkMi=d{@rKzExlOp~cJk(ikXDqHRQ};$-_VfAmaR&9>J54GW
zo*1W8s|)#5=^S`?yzgo<%Zyc^j^jLbiMPq7mXQZK<crs=-~VrylwqUi^>wk6Q$2U_
zbE`!hXgn?AbJO4Mr^|*Li<cJ*rT%-!U%%qcqyl!KPYZn`mK-t*+wJ?hvs>xc$Nc)=
zvtPJwpJ|-F>SZ730HjVnd5M14Kp*`?Mv*m&PeAAV7Tsk^zTEKB-(ZGa?XFqhd*^c*
z=q|r;$u-Jl^Gh9D{U!FLk-v8TJF<fH-;#)}M>+eoZ5}DiD=0k3FYUPe`utscQhrY`
zv)emQ`07VycD@ifCX1aP+l8g;)_lKLou5<ay!`6?d&%vI(u@5J4!d$J4w5zab>t|c
z_^Kbfnw!%azX)*6nEv7Do|nsJKly$C|30CMKT3AxeDSWCStW1hZ~fNfC+I};rPJet
zI>e8#t#cFz%is6oQ~j64@|yp>D!3H%`<TCL*BY9xRc8@j9JhtN?kLBLXpR--A#(LK
zQ#ZVtzrA*a{=B&j#Ug4ppAtekyVsSUQV5LP<#XovBHay}78!B5-u7M<<9tO|X0CPl
zHJu-s9t_X;>h45wOypJSl;2(cFIc?&OT@?AdwVLk%FimVuc<uw?I6#Q`DTozQ8QkD
zR8~4O_2G{yL#EsJtk|}?P8V<U=V;r<Q2Dw!G-J!v+w3>^^(1nemYXZs`c(D&P>}1q
zw2)s>D$eoCw8h&4^`|U<uJBQ|vSgpjQ)RjCJ^|ku&p#gAGVesYtI8JRx{pG?g=Fnl
z)IMl+)$UL{<s4_g-ky@Wa_;?q)h`ydUvYX+`~9wXgna(3r2EINurj%Bxlujot9s)E
zfdj1-M>+&wl|}cQisg@T*}36KmH*~il?m!hGq$(=lxMvkpdZw=VmjM)&juDFwT9XD
z1=$<R{mdR8>e5gapVqZvb3~{RhcRP^#=k{k7DByI{hRlyI535A2Dq$!l#;08z!a$L
zAUM*5kKD7~U-B|&HS1;r(4ayGQ=`<>sZ)y=T?p7V5i}~1BfR3$`Tu|F8)`V-ukKj)
Rg@J*A!PC{xWt~$(69BClL{$I)

diff --git a/doc/images/dict-ds.png b/doc/images/dict-ds.png
index 858cad685509b24a9d00655e73369cacdc8dd5b2..1153f1b95fd59d83448b93945fca4efe7c60df34 100644
GIT binary patch
literal 89590
zcmeAS@N?(olHy`uVBq!ia0y~yV4T6gz_gEpje&t-z8c441_lPk;vjb?hIQv;UNSH+
za29w(7Beu23xP0W`us~l3=9qoo-U3d6^w88-rl_SW$8WB?_sM;bGD|Q%ssjGMCiuY
zjlrxpI0d?7bPlj-m1#H^?l{YPly}CWAL1)Qf~GQ;f8cizEOKNj)8jbNmHZ~bZz}ik
zu3jId$cc9+>8!rG$?xv&$o-br^Vg;K{oQx}&$XEB_glZ+dA#=5Gl|EN=Z%m3?)`c8
zXV%-jWv>sa+y6WnU-jX^!TEQ-yyE=AQpIH3IPbt)-v`s>zCA3ezWm0^wsD?={{r<5
z^AF6ga{Mkl|3^#SZLr7%;TN29Y#RM*Uj;|MJv>=^%La9j5XcN};TOzli57EVCSF#*
zz<%cC=Im7e1z<HgJ`4C~v_33Z1?GKW@tf};Z?OFQx~VYB3>xhc#M&;egj!@#%T#+{
zj@|CCZ%_vwV)@k&DdD#q>|6)`2VXe9Fc$xM6LnMg1=tfK(E)o3c6~8<n!SGSHt~Ib
zzulhA&M%j<;r7=Dk3_{!Uox*f>AE@X>aTA>^*Zs@A$4c3|1yn#eEikdzwvvY^Q^xA
z|8Dxi`TyU#KVLR~{i^lz_s_EbRjJ#O{LATn-TRd{?>;!X`n*lUKiz%**YEjsYTMPz
zRh6&U&y?lKX`C_m^VVT|%iXuuHE+b$v0v)j_G8x9uUoILt?$W?eQUVy`<DHUr`b<h
zuDSSrtMKu?Df$~<U$Z~9ecd++`|n%s*4_XAE_P1MLWA)1UCMIxU-vewT)$Q9+MXL?
z8v4)DYF=mce|)<$|ML6)c_RKl{@y?TThqe-Z$srR^%uc261PL*+P3i^%dhtdY|fc0
zpvfuEuF)<b&+hO#SbA*c{K9A~;pGfXUIm{)$>p<TSt~SsNr2Mh!2l^(dY$dRfPcp9
z^Bc55i5Zk35}0Za@U&eDfTrI&HB7Y!?$or!E`-|121@V-Q`%tZ@tN=o=4a20-*7=~
zG??KaZ_vEZ<O(!>n$JHF{6Bx<-I~*}3)KtCg@61x|NqWi)A#4T7cs5>cg6qy>Ds&P
zzF!%O<?prLJ8W#)c>e#}`Sr`b-JV@rBwX?J{J$%cwd>fX{_a0<?t$-{Xh=YOF9f;j
zc=^)r5NpnXTs`OD>>Jx5;qdM;%ddu={qMcruLL`L&Ow%64VKO38}lLFxN{s7Eb{lK
z-U|l%(*hK1#ccUW_npA}9sM9*+3nNbyBr*D1t4EP<GFWaA0!+L<U!fIwkEvFAMEW1
zJZcx%&q(g+tmTIA?fe$-&-ndg-Isaba5^9f3U=cP;oo8qe(f9wd4umCV_({S1?O{P
zP^hJUQ2V9}iHF}7jdls|9`C+X{fg7(A*W5vb8B<`J@0F0pKWH}e);91bG!FFuQq%C
z?}WP<e_X`B{WBMRKU}`|b=j}7snxcPPt_mB<?l7WF8qQsrkY8d{h<55t@Cfxym|D$
z_2a{C{k(r4<Nv=mTmSdbeOrys?RC%Y->dne{{Jg;&x5u3wb`HR|33eJGwt)Y+rRH{
z>+jvt_<v#jzxW$Adu$@^{ra}ueE+}jf1jT5*ZnT8o_9|EXMcU!=TH5APMFpFHLoxJ
z{PO>&^|P|7+du)xbN|Y|rSlGCFunhGuRo{m!TJ9`&;GXi_xJag=7atQ@BbWN|Mv6v
z9E%u>1$95t|6e{^z5o5yw+}!6%CAlP{Nho;!hheEFIM{Zp#SfUe+7zP`^xw4Hn6hU
z4vM<G_Zj#7{S%BD`~MyB&$;*e)p4`^zsv2n{=6su|42(I>;K97Ki<#Z_ox1!eD#Bi
zv-988%G3!xD){*=eBY*@U-y3tH^2Yu({#R1k{^zz$^V~OpZ@vVV)xnC|6jDXvdEZp
z{a>Z;0{$7FtL%U0RWV)Wta%w;U;4Rq|7ZLBeLrtyujZ5Z=keyO`Mnv}et($%WBRt8
z`hWE6(?1q8ewkSRH2&_M*N5fr)qI@(fBV_l@&Bvj4KA;o7rqGDytn4{$+M(Y<9;2k
z|M94tK`v+C=U=a9+yD5JpI;v|@q6F*J?Wp{b??8DUi<p{zCD#s{r}HA+kOA<-RN`S
z^>459@y!vx_y5wf-~W2+i$7m8-@o(co&P_!o5}C}adP?f&xVb53G@2D?|i>Wz2Gfp
z&H4R*)Xigb{$;%08vp0$S^J;T^|jLbf5gh)iHfUxVgIM!j9)J9uaj2&$^Wzef2}Y5
z=$<(LUXk6m=l|}sF~2OX|6G4#&(E#v-<H0e^B<Ip{(s-`euH|!T2QF`|9;kd|Bs{H
z`*-|*b~OIl{`$`g?Y|v2e_!`>>e=sgkA!EhuYb3Bw*KG0@i#xLKDKUs?X&-PYhH%e
zJ$)2D&wO_O-!J>OR(@=j-}B?_rujGj+=~CzJ^Opj{qMQ_EA#7KcF(^5v(;ZK^Y<K3
z=6U|4_ucI`oNMMDcs>8$m$uVichCP5Z*Ko9{!i=M^``s(9Jb$Nn;^IMr|jj~_xJrs
zUT<Fadi%DI*7rW&JNy0r?*I3m*^2M?Ik10Y<x~H^FW>r`-~aLF`F6V{-~TP_&)@le
z&kxb`x|<KScJH5F`P(}D>$a11mffI)CYGOk-^KsIN#BP3Q~sa3e*eav*GJ#qv#EIg
zPW!QS{NGpm6xmx}ug$MXe!lPPwQIj#pOXLcysqT%)YnJf|5|tU`~Tnn4?gSt|9-n!
z{Qo!U##jH%1o_3dQu()871MU3#_su6b|2j9D!zYLpZ@>Z)2H^o+|A$rdQhH!x>}&%
zMa}Ee@%Q$;c9y?Y^TEA7=kwJ15B%GHzW<f}@8;US&E4}Oez4Ds|MN8d-oL`=cfG&<
zFfs18`EX1B@7}ZKb>GX4@BWhnC1c|%<KJObOy0r|;-ByT^w_@6q4MkU`l`<p=l?l*
zHvIoX`#XOg|NplC=7-BC`2VZh@BVr2X#BCyuh0BRKJk6uuUBE8*Xq}1e!g{d|H8t(
z-@exs{$BsX{*V5@&hF-Chi~tnUU~m`dHtWSx9z{%=VtzK-CuumeP8{@^NgS0cF%9J
z`~TTq{mwTYP;n`_Z)L5wZR16jdmrz8e^)PL`2SG#{p}Aw_3!*~^2yixKYGu4+kbJM
zJzekri`Q?v?ce>{`~Ug>do}O!|DJujUTXEz`};qv{}=z$*nVH-OZK`1?)ul-`?vpm
zbJYGq&EL!W_1+qu-v2G#_SOFK${e%jY&Jhy<A1cit&eyiEWTgy(rWb!!V&Wr{&)ZW
zT>ty|bkFn&Pwm}K%GVci)ck(bf9Qwl)0>aXPsQzdP-L<8uW8CZW8>S*YX2@9Z~paN
zvK~|mJ-gcde_izY!<;p*g6H32`YU|qVT={17S&Vx@ZwSY$NI<f|6LB<{9wV4XYc=<
z(^{ue-({FrJx_SYuj_%&E9+~+!4<;-^#XTL$=JtsKerm(0Nn|yfQ#$ffB%Ej46>jo
zvzDsa{ubQ4dk(7L&;6Bs_xm-NUv2`b7&1QG-3F=HezW{)u>4-W<NbOt|IS5F#kcri
zIi%rQ@D60zo%;{>?T6H3gWK|i`U89Ze!G2JH{*SVJ=BL^Sms^iyz)7@{(w!zhlFbH
zTj^i^RozAe=8EUX|23@q{ZZx8wVLBl;S0hm(p`?Rv-_yobZ)Ud2KG9rVQ@z6z|VtI
z(~tdYFnp*Otm}F-jaTYDI9P2PpQkg;lfF|Zr{kAUe_(>l#Na7)@@9P-a>4C^ihXJi
zzSr9d+qlm;#%)!(qan31P>(x0x%clO@qHWGuFaWuVDIb$zwiJ5cXqLRzghmipU?K*
zj?RCPr*`1;hpp>tb3Y%G&cAb(ZQaeUi{<~mFcsasSz-VC&o&pX2iffG|I5N0xXDFl
zhWDKxx2DBM-2Qv%)>PK6`zhZ4Z+)FVLE-z9f3M0a&%cZpJ2C6!`gQ+XI(IJr62ARx
zwcmfq-T$wCzkOt$gP+3upI`JXf6nx>_qO4+-~amM^SC#$$>+J(OuzHj-$2aklTcdY
z>s!Ho7hZqMsPli|>HA<czkFU?#lr{5pO-|H-c3(n;@6+oK0U4~v)Y#VcI?)pHyN8O
z&a+p<B<TFT^4?z4d&$~gn;Pt{rCs&+`wb1}g8k|nzQoRBZ`;?-S#J9Ir0gF-$%bB=
z0;6N=Eu_NCZYuu01#JbMKg42VaU;8K`tMqPyI=pNua@hxoAsA*GUwl{;1&GGRnzW3
z((@OVd2=~`)V?dX+?G^n{<TLzUB15lz!erl?URu{Hs%38Z!`V91U2(}8dF{Q?uAn4
zKm7SOy*YIK**garAFrIMv{8pIj9;u<Ek5VUjTlHixFB3nCH%qqR-feS-?jS3Z@e$6
zNGiG_mCVm4aa2X6J92`Ica8YlxPwQu<L6aA-UjvFhZ401-`7uD_bcM>ufKB(e|_5Q
zckkpu#>t#5B1x%^8@r_YcZ4!;4+p1^7o0YCIe)~iS$qF;U48fR)aB2<-rf7PXX|BV
zHm0MmnS{4jnu&VHtzEkB+PfX#oce_&ub%1W+}Zosn<cg-?Ub%eFt-2M&E9iFC#86;
zOwQAjo-*?+>efTkZp9|y6YpdG{@OdoP)5J-@tu`hg}m#l4n%}(YCW<sA)<CiXKLP(
z?Ph!8piVEa7XDxznjM;)Qy2dG?;Hu4pPkX%v*#T7%Fid!J#ovzBY}DwpR7Fk>a^*#
zRfkV`uK5eK$HK1h&%ZCfLuc<?lM<&>`Q%J^j9u9g!}@{)4riPut!hmUEH>u3BQtI4
zHJKl`{uNY1TCdM*nd+t+wg34ia{QO9^`?`btz%bjI~T!Q@#|*%*@KMCHy;V5Z4+x#
zpH}Mj^$v&G=asX+=I#N9g3Wv354+30{nd=ypFC4K;?>iR%%^>6y2tGb4j8dn|LBjs
zwuDKy>Eb3y%j}M&s_8bLuHIr^w`bPm%aG(^lP|pDetTWGRr}KSkrs99PX(vP7Ot&a
zYm;0ds=WO_r<!zBNaM96Z?Uyi6&Y8r`}TaeGW)vT*S9g?IIFm)_Tc-{`x8ym<Yr#>
zx2gS_kUg#Dwbbgn@&*hO_Dt${?-ieOGD_XNAz!vI`%YQ?>ur!S`TQ@IKli@a{n@vs
z@Y9FC^F)t_#q@1;3){Ohvi|dL=3{LtIXTX{JHKQbf7+>Ko?P*b<+?cg<n^l4>%RHR
z$3bGWAWt~r*T2u!0^I$plg=csJhrh?H*@p!(r@fOT(6I*L^s@+ZD79X)7o4e@jG!v
zCpsT4XS**EZTbNk;Kef=?w8*=|K@l8m)IFr`_+$bdE~u$QuW<`*Y5mRwRfo7_<H$S
z-lh2)XP)&{bH5Yyt!eT6uz8g_rb6tmuYz;WxkRSxKmScWUHdw_SS+dTf7-fVMH^%E
z{{HzlRhxbHe@?bX8{3|36+2~7`}yjrlfF%z;rllJd~$8}q{Yi1CE^Z$;T87-CC}G<
z%jaAD{(F2<<@%Gt@`<MDJ!ju%K6+ES=KsHjjR9hp)sGup>od#BTOLv8I=`mo@hszO
zhYqK&^t>+<@$1N5NR=1stFV9l4d-LO>drrvJK6bqw)!`w&({1pk8=xtDyeT2jGt%u
zyJNBV<m9u>%xsL)pXf9k*t75Gr0M&7r{#QFJOA(5=9lMxtyYi!`A#vrV=E+%{F9mL
z{%5>g*?(2Owtl8}Z*`b9``-?A`?a&4od0$DYE=7;)AycyWA|zDJaRtmWU+JS()`b+
zW~DdfbuA74t}Xtll$Uqp?5&sSbH72V>B;jN?%PN0kAKO1>}mO|eKD5rF4i3FT&q}~
zw%LBpt!&?YuQq-E*RZlxK=q<hLebWfp^H_IulmThx9V)vB4yqgJ7&pjiTJc)`LbW%
zvTlQ8AkV7t&%BdSoy*^g?~=Io-q`Tfi{#7d>i44(N>?)a$M;4={W)`6-SUd?bna)j
z<P8|ORI`pg?09&6s<c<!qtM{WCr7t@Qy06OW?Ok}!sH!0uWY>!F*cd0?s>}EUw_rr
z_fJ2N#WQV(;nt5^Uu}7|t>yIeBVV4T%N9rcJvDi~>H1Lje-ExtVT=&kn$Xenb?dW@
zYXtMB-+WrcT(DDXTIq+)({~<mtEyNtD_A}5_hQM!2aw2e@Jsj-tGH}x{+wwt_g#P1
zs>Hu8pH_IaJNably<N}NsOp(NUemtbErxg7x+8pbO)Fg<<*c%Q)EIc<Skcz3EFQZ<
zPqK?Ie-dt<{<rgC=(>$!^R!?0e)@C^Jle&m{-FHmi{Hspg4<2|_dolsZF-a6W_sz?
zXFXdV-AMj>HDmg(=<hEWC%b;xXku7aY-XnRUUk~GUq`a1{he%m_|5#^tjVc;7M4eJ
zcJ5vg4~e#`ET8K4KmXo-U;3wPv%dRmn+-8p2aT4i?KHOE`786|UGHxT<Scg<9nmho
z_Wwb{#v464^Ui+Q`zr0|#+@B+r&?}&a;|3Qw+8h#(euBqF?sjxm|<A9gnhd>xLkhl
zb5_Ir|9{d>zvtg?zTuZ&N5%U6XVlGBDc_e;wtjTw-itS_ruuGmzW)Q)3zmH-H!xd#
zGGk|_&Xj#pl}E0!I~%_;Jv8mdvkiLLS88tt?|FB6PpQ`VT~D;beL;2BgBrC5&tqQC
zy(+OM>ByRk-+dl^+V;fTZr=_uoovDDQ||{pxv=WstI5%yt}a_E^=Q|M$m<9F4b(m_
zJF=nkdeX6iJ%(GK^;|wBzS{7Ihy9@kVYW6qH`jKqHVtcME$);KpM7W6Yfv?`<G%2R
z&##}?y!?EAd((aK2>q>hR_?QTAGfFILGLw=^%5IreBCIz+V<%(JIf!}4$NP>N?y*u
zY_=%l_L(tBf6u(0ym_ac<)158BW%s4{}n!M_2{PXnc7wUy?Zyl3R>JB8x>jHd41<R
z2mc5Ed>7Q!{XLhkye>cE=lwUIHpV@>dP4Ack?Oksv~5>rua`>FdwqCwf5fw^r#G$>
z`(t(bU)DEvA2F}^M`zT`Yk%D9h{``Eu}?~O=a<gad^uaDl|0FkH88!}9{ux+kB{z;
zGwRnt?fV_|!ZT{qgwwD8oO%8Dq0g_&U&kNO`C4=&Xtyd`c%MbsKc3C}KVL0g`%9|7
zWOH2S>+AEBYw8bNh;jUt)Ny(H3^Vijc9pL~ZFgAae)<?Z*>2~}MPlA{y~5_pUEB59
zvwPwTf1e2KPd&N*pV>`)+s1hZ=K3aln|c0x(ceE($qzsJE`Hye5^M1IidtN4l30!D
zvD-&d^<F<Z?JIxg#vaoHJ0os=(Y8;1edxOR{H@>Eds-DWJ$&S?qr}vg$LE@DJGSCF
zN3;E<X!W(VN3(Kd3#ym;%CFmK_3G7ZVdZm6@6|lJ1!}0iD`Wau`E|3^Z=c^Y&&z(!
z6klJJoqhGBzfEmr#7<-RxpM;RH?C55%Z^`bu}$xH!|U_EK$Y1|ougYN3iFOR9nZO!
zarJieo^RW?RpuV;%=Yt(vfSGLql4S+-tP&~k0*YMkk7uUoV^89l&qQWP&X}Y)sr5(
z{a-(4$(DRNy5T`w=lPo7x791330*dyzW0uQ(x;7CPeOHeX4hsP+Wrny<Tt)hojD`b
zG5M`o<r7yu(=QVrsJp!h{e9bM@3wcRcYW%=`6hnr)@?Dm)e|P)x)c3Nx$pPn=`zLO
zuFzNE51XgVKl^26h~<%_h#xUY89i%N^S|?QK3=6)_o>6(+wa+%nU=N15x-Z9P7XFb
z^6bh9!+AGPZT5S#b^q3H>^v#@CnFgeD{H$$=Kbh#uQknFyMLSgp2+??hbQI#Uz7a5
zt9M7_?Z3@WZBL#2vnK4(D{z_fTJ6E}^s~>`*VX^{`Q>xIu2uTpFQ563Xv@bY9XUSj
z&zps9b1HS_#5_BA_GJ6?x>whJUE4m*_R4Jkn)(AANs~MB`<z~$m%3SyvesWOdujdT
zf05}|>f4s;{od_wP@BC#P(Jb5=CWTI7u2WiGrbKe;~sPN*wq{T)meIVy78svpF4fJ
z+4jy_Gu6(<@`v~8Pn-JoO|yC_9KKhg;^`#m#0TEmrY{%I{JQ<#zlK8RTUuhrUmf14
z7?IVpJz<Z^I)C1p?98*#;rE2Xd#_zH6}#T|$=E06^}bc6^M9|e+Z%3r>*BvGKfl}a
z4s5n-yt#R9#V_yq^Phy;+pm6kc(rNqvaNkPj~u;}X7~5jX_>J3RzKba$7tv2{!ZJM
zbnNP?gRc%B-0uG?;nBD2i*Cysh#lM&G-pO#-ho9|PtA?|aqZ%%y?OQdGJAg?@SpSJ
zM$qcBwVg{%*DtlJTz_P9`J;l)&Fk(QS)02q*Z;vBwFjT$-)k2BO`bnraQ(Hj7Oxxo
zza+il`#-_!OW|y*zi-&5%`bi=+5hU<mBvW@;?BqN(JQZR*NfU1IQPj+`ycreBOMlP
zdt{=x+%!M1^x68&nx<Da^?mJqnsN4a`jO_tO3U?r{wlikX!XXjYbW>EY>4T6o&E4(
z@y0iaad%>l-aQ>w^V8^%(fvCA2m5>yzO3oWyt}$Es;EZo&zuRTLqGocb3!)p*&6>j
z5<e1`uU_|I)3TX@dSTyJrnRg-cujTL+MiO<-g{nU{okX%GwF)J;rsttg1aZMc*o42
zqix8&T<>$1Ti86)Co1dm`DRN*=@}HRE$!X9)$N*JeC;RU$+IPF_Z--~{LhgGCxov@
zU606?T_f`+P;O7S|AT$L2hvNw{FzmJ{@B$??&qgk{ynnRbkk1uPb;VEr`c>O+EN6n
z@$T4H>KA8i*%`iZO?hm6ZvE@D`i)uN*?lJ6UBfHbc=Djsa(y=Yokw&w#+Lk;W%+yg
zvTJ5x?Q5+J^nXTf{?%?h%l(^=ThhD3_io&}A2C-Zd)c*^qK79p&Nn@~bgiA?=~>`9
z(m#)Bak}oto1eAQQx0DFY59TgMCD1v>9d}^N|)VH+PgvW_`fGtmmV$8-@5+RlL+;l
zNjH|J-hUDyt&^RWZ~3Y>dv4Fy@9aGc*PMQst(~#4GRMqsj#cT(^%jNC)&v_Se~L@^
z5mlI@XPGc_b6U~$ACb&;*9^nq;_FTsF7J!z4eK-e9e!p<u783V<NWz&`Zt_;zFA{?
z(y`31Yh8Qfvh@s$Kb&1HdivkgWWT(u>3=5n-P&rmvD#$%jGb@dv#(cV#xI^z_51L~
z_0wXWt$iHVnJ%;QF!M2$YrPL{pW#iht9+DnYogq{OF`V~U$ahBcOLZivHuvw-8ZB3
zKt$BXEMxoCjmKiX9s0gWZ_kl0!snx2Jm`>YewlnW{M|H>%Ezn3^MBX)9(b<s{#JS>
zXYlf=-fQl~Bz@>GPLGq>yRYW;Z10%bq+d^B-kr86PBNZ->*BpT)2k&5SLpKF|Bklb
zcuKMC<mF{{wLc1uY&a5Uns58D=U|bnZNelUMRUe=^DXvmtTfNjElm3P?1<5|?RtgR
zPTZ)PIsfP4U9UE$y}Eiv=U2?ivwshtoU`w5@8s~W-vq<6b9i-Tc+ZLG-P!Xr^Qp|{
zo3ACdfBv4&^!0Ca)&I|x5B-e7+Si(XUU%|j;CiuphViy{R=KaXt4zu$I=J)Xsej)N
zM1}Xr{o1Mj^&O+%C!y=>w|#Tc58HX<+xG2-J8#|JoAL0<)V=FU4+MB@oPE;mSH$Nm
zHwnvv(j#l6-e0(z{moym;?<LbhV8!bwXZ(xe6s5JrUUCYYu&%`>zmrO^|eOJ`%{;)
z-S6Hr=Zea*x{&1PKc8HA6Mvobw12I7@84#_#$W%QR?o95fBgB`+*BQL?mpl6+N-BT
z{m-6gSDz<USfp3G_D62y`}x1V9jNkGzJIUa)hVl)o6C}ZU7Kk9D$`Hz)|a!%Umw26
zKKSaC)o*4s)|bmIS|1f{j43#Bsog)PcUCa7e(j^BQ}2Aact!5pHn|$ptL@tH*=Mix
z*KEw%+-Lb)c)34MJWur3gqi;Gc~8~b^!I=ByHlGG8EIT;T)$ju|GY(#;aOj%aGrTK
z-=g%ht-pPxvi;6$f`=D9^pc;q^~ljHLc5;`E%%T4Y1&pCtzG^2a<}%!!1~V-wckU2
zn)>}avA*Wfkxk3%o?TA&H!YigBe4F%U&iK$ATgoUt{sz?^T*5cbxYjg)~WmzF|DR%
z<169kr{=vpyfN;Ykoj~eLyMIM&5xZkdEw^$RwF!H^?1zH=Gm7Q9iIN$Zev`*k<0AK
zp?}5pRLp$2TJ3w1uf@yN2R8+6b}m~VI(g^wgZp3pUB2&^<>#97m)A=ruc@jn4$b$8
z>ys+J_Q=-P{_zzxyU$N2r(dmTzjto+cgL+?jMx2rSh+sx=Z#bA3$M;#zkXcmarf=x
zQc*vj#Lg66eNFDcr;p#+eS8HrPuk<WZo{3NJfD~|6(Qbzd$r296@Fh7>b@pE_pSdt
z?>lixnJc~RcHTT~^KFW&{`9)7&$d3<d1rfB%hP*Tlb=2cuTA<@@MYtR*jK$9J6E3l
zWB6a>?8aH=gZ?f1Za;f}Y5M#5KUewBvDCA*f3_v7_}{YwZ&asUtBLxwZf5?!%o|&O
zm+QZ|S(|-wseXCy+P@b&5_cBew6}cnHa<7YeP8L7gE!?3nr;O$8d@&qJ#9EWrpA1t
zO+n?O%(bf9j!X^C{T7-Z`@1`Q?Z(QV4<e^W@cqkK`|!+`2d|3%cP<ZG_j6Z#az#;g
z?CY89@AN#q#UK4T(mn6k%h~I<6&d;Mf7PR{{`kw&@ZCouPem>-GV+VB+d6e};jdTI
zp3Q&1zb1EWYR^^w+N8x&PoB;`9_3$qR&cqW+>P4Ed(L<L--X6kzxsFecDIG$Yc;m%
z7SAIpr{@37(q4b;n(KD^1eUFuUiPy?V{~PTlaBo8e0_NO^0P6&P9C-2wrQT7RL!fd
z#Jwld*B$$GXS(Twm$QSrOHUfcZ93^I?|V1-*;{=z^TOJ!gP)nE`=4`-i?J{M@c@*Z
zilZz#m*?~8{1rT2wfN4Yc`~n;{feD>clFky^DnR0neOYmw<~MYG)sfp%3DW{Zh7)$
z<v}H}>-SU3EDb(BIcRun)04#5m+Jj{s&*zx-d}qD-rl18dzXE`z1P{Ze+}of+K&&f
z*B!eyDP8yVjpUQ7PDXt?EBT&Zf`LWz(sUj5$6qGrFFx|+<je5AKRTSx?fGU^EtPp>
zL)@2b`+rI`H>cKrP589ErD9{8LwDY%%i&WZewF5bINSft?OgYt9^+TDZ_JW=xAfh`
ze^1i?uI*o2_4?eGncMx6UPepnOt072>^5H}yCd_U`#;U^{<7J&nzeiTd*1rz|L*^m
zoLBb#LBX_7x1ZQneZ05v-v8Y9_vNmwH8#qxPZFO|_$%p}&%U~-pEn}^KarO)P}#JT
zb<4BO4ZOmK=Re$9_q6xZx8uw5<u~qX51eyn=J|O$&LrPmK4a_A&Xc`6R(i_&zUuUk
zUA#+lvDpmU)%p3KVxDb%^;FgF(3#}em(4rHYl^aZR?EH=mj0>SvrFfFvH06>3)b6S
zh;K^ruCk0;@=`e7y}!&e|K3a?{j1yUuPt?pjk35IpLg`)3S)PhPum|H^}fbBIsf0j
z+jsVVx4%{V$?d1$GPc$F>(6!W`TKQi#;SbT4>4QUSytY9(padv%|3y_H*2!R=ZA99
zCnc|LjNhuPw^wNUwur6oa$CA1FGqzYzxj71@!*loe3q4uu6f>>mvptyBq{T1uR-+$
z?|J)vPhV~tpWT)Ga9JFW_W6CECQbe&c>dnvs3#XTpILtO{GNSQYwu(|+<av9{w4D>
z4_wWBy6ozD+y0j;IhVf@zJ7e!{H?*~<su@l*SsoUb9ePm$!R~oO#Z*-$D8?<Jz<ZI
zzq`EWT9xGE=VvaPx9gd1wi1=k%v$^8!tH;bI%0n_A6vrNDyqKC!7Rvp)5&1%{u_JD
zif4*nSG&LK>M2q4YifD6hHEXP4A+)!n5wS+QPs}UH0r0RSbXy4`nAqEaoN5*A00`G
z+8I&#qiCb3x_#8t^!_8k(|6QfN%%UsTz2oB;IHOy>t$`L&(>D`ztL44e^sr2j_Hx!
zvzceJAI?17rQUXa((dkgZ^PejzBl>Dtlhz@T{nltS6*B3<C5JKmGounD|%OM{Qtjs
zp#e*-*@<N*1;xF6kFMc<C!~DsdeceP;z)Ddou>pRFW(nct)jQ=Y}BVU+Q)0NpRP3Z
zi!HkTZvU&5+G+iQY5L!_w;#*8{Al&@^qawZE8q5&ex0>rpV+j0-@Gcn-qZW)bo}U~
zbl$?^Zx@;#pN_r~U-WR!68^iTU*CDpz4rIIZR75~!n4^IZ}Qt07K<{cue{uJ(pP8a
zkLR0S**>eCm@KwaYuUY-s_}VIS*qcC%|71@zaMoh!f>tS<1J6z{vPD7Yhn!O=sz)=
z`Mm19h@z~zDc)zSI(5HJpI>`rncnBDb;(zwrQdRFR<rpW@%KtP@8^V~py@wnt}B|<
zety$8y<PvZU%j0^Lsa<mZ-#L7@|4Nj-R7HK)O+dvH?69A_VRZbGu6vy|6Tc9Zq3}i
z2O>nJ@7m8fQhw^A@x<?uzgKTge>zM4=99ip=eeJ~ar=I{XGhVyPuI`oADjK~P4X3I
zAM4Arzt?Hy{}=Z0Rq*I>I&$^UX3u8_(zRco@;qau%v1NSIpW_WU)g`Rrd9_8|872C
zk#%SGou04hVrMm`Z~c&;eKR}k{f)n?&(G`#EMDf{XY+l+&gBcw@7>(K{O*6fcl*!n
zI(Og?hkW9v+was4^wjiiN%^q#T;Oisn4%+_`YMaJ_Whi>HSE=$+211iYToi6t9qj@
zap0DS&h*}mG3%~$uH6V}iRL@>Rj!dR6;fZP{d%T!;<Hs#z2&P<O1?cTb8YXd?5mka
zv;R(%TUUL^e%rJi-j=V`mcPrNvU-ML)Yqg4!?m>=6N*0WJ(9O*`!>^!J3F2<sJ}P+
z75rK4_xzW4r7Ndx{C$7n?(kxlum2`r|M!rkD6f6y;S<l7pOdRS+xtwvebrXB8?$Op
zoc#4|`#Lkrq?PL{iwoqf6YgwSvgJv~&P&TDNbJ+znxw4VKWDb+<!g6V)L(O39yWXH
z*I?sAM)sdJ^H*jS+%#VM_24CU_486kl76l9jNdC^sQuOY$*ZkJ>y7%WuT|P?b~cKC
z-B;B4FuiA<x6azFM_=^4cij^<e``=aub~e2?z`bX9u;-w->P3bFHWa=_xYJ}dOLSr
z=??EJJ-dCbe}b8Hdd55n`*eM`uV+@C-6Ik6r{}HXxv7-~k4~+Y*l6|l&h)C{Z$jpE
zZyF>yMJ8Te-mq^+RL--9ow>r?`cu>SRh}4K^OvztF7f{R^l)*bZ1lHvd!qQ~-MP5$
zg8I5R-k)DOUrW7wxZ?03$+d!UhOc|Rh_1eMCOt1q*zf5{*6Y`!?pLgpn>*{v)!Bz%
z<^R6@p(E~A@~`eHz1KpoZ`)hWynJ1azkbPd=X0T7ADtA;uHMUO;hf$hdfMyR$&&}o
z+qmN@A4PiCuk4q3Etqcq_YJ@MKc4o-O_N`5WLBH}!|be@vJ6k(bgP}A{QJ_b@=8bF
z-*x5E@l(vl#l7Qut&+leH(%@9xO(OOl#9#a;%%y5CO-|7j@PLzdhp6<o81hlzgt$a
zrib$E)vnzb{N|R`he@l~m##nZYo~m{&Ii99Wp#WNubh6g|D}HB?YeI<YodRxzj(Ot
z{7q-wZ@Vh8ZrkTFeYJgP%W!y^f9cMv-)n;(`w59#r(Hd8`TC{%wl9*;uAZpe_f%;9
z+r*Czo`qtocg#NVtl&xJ!=?K1wr1f)2Ya_BTsu%SQP?|vZ&Y#7)=1&`OVh+-_bz+J
zwfEDia}nH^r6Tl-l3pJ6og20D)zODxb=OvGUAtKB^(m{D=S@1JAB)W1d*Ql-PW4jz
zNB3R)bHCnNezU&Beye@qx;yEQ-roPm^6BQ~^`F)Kc;?0YJ+u6LU$)I|?(A9qbM3Cp
z`>={%?RZVr!HBKb`Sw=D+9a&H5#fC}@bWIh+Y5ucL%r=xPhLO1Y}$@jPgV5J--~3P
zSG)D(cDZRw%fw~BiF<3`|0|Jw^x})jm$!=<?$~wY>{2(Ld0($YJMSs#SS{DHG_3xb
z@yAs+#iD*rimE=h<Yw^yZC|#|D?NJi@`>rs=Vj~EN&i~2bpI89zuU9@8!SKnvwr`@
zxLv<}-G`dIEuV_RXL{E>JFPzd@235=4_-y<e@!@c?b50EP2KEgd}i?8jk)z@FJsn9
zZ+r9EKO^7Iyf*L2TFo?@Rr<$w9Z^1G^KIAZf3NPiKe`zlb0%VL>4B#W6aCN3+4kz<
z4DY@B#QOeS+gY)3+Rj<)_e93s^UZyy{C8_<@MODRQvL62EnnVu`@hw6R=K(Ghspz=
z?iIgWKJ~etdrXm?{nb^w`?lK8x+Q;R@2vIJlbTC=U(HzkZ6ous*{hE9JiT!u!unCu
z#P4lSrB(}?%SBp#o38Aa<9Eg`$~3|v?no&2u}#y;+T$LcG&JAz>aDW-oEvi@-dP*&
zI1+bc=aZ&~>9PiopEPdPO6$2AzCYMzo#6SZth1?e_WjJ7ZsBeDdd<TVvXNi!RIi`M
zaK2gm@`>k%(phEf?e#xB$#|%@_SET$XTkk3-?p>wn0{l@S-B5Je)I4AlaCVG@M+oC
z@|nluvkiYfh*|t&^ZdVW81<Hit^Xyt{?$6+_%}txADv$vef{*m)BZ09-z63HFP_<z
z8fU+@+RrZH*pG~e{(E&>Dt|n9c&+Jedg0IVU!Q_Di^lCcQ*ddfxBXY|x~xm_m(CO!
z|1G`$e|mgf<>wa{7oVM-zt1xJ>W^YG#(C}6<Lhfb|K9)q_xD%lKF{?3pDh3TM%nzI
zdnZ;-IufH(c{}0Lqwg($mdO5L3FcNW>|H;vEiY$VVBxDzYAcVXue{Ipanh~^{~}wD
zviP;T^<y_q=86k`vbW-W)TtlKPBKdWOv>7r{rvsjs{gm6#LtJmdii=2`^MTYTW?E=
zAAIq5b=A(z-{;RNU3qcR{GXxGJMY>5|LqiSeaY;a@Q$;bKkg)5j(=tNNOhV0?>~Xn
z)0}5l?Kt*hv#R>nBL2Fjg&$XHo98+k>Tb3F_pv`e`hcg*{nT?6C*#_^=ib`<&b0bu
zY5q-b`>!iwUq`3w-nTtC|K~NM^`XsM^WW8Tdi(xb$(|mW-aG%!+8?v@{iFXMJKR27
zJkH|BjhN!&zV^#GZT3{i*?nl_&(XK%zBhlqweAn8_`g!tRsV!9m*;2yK5f5^{q^C+
zX4+eS&re`keOIf?qtEh9slm<&v#I8~ZBxTvtH1NzIsHuM(zAQ^{aw4%G{3&`!LNwg
z%3G_-<vSOjox1bLSL67<rduzpxV-ECmM_NZ^W$W=)$ATk^xpGprup)%{f5(~{+LvE
z{NCPWYJY>jL~j2(kKw$)`6=fonawv|KIO&<e;;16k6*I&i{7bMUi0#a-?#P2vZ>tD
z_DLD8k+}1haq)#E+a4X6sl4v=o@>vJB;C4lirG8w(X$Pr=VkuQa+QCbadl_=5%=HI
z_|NZ&Dq5*NtvUXB(7K||$@%hzxsQ^rDVeQ58}n>){90$duTP$;<h?y*9#$M{Tk~tl
zy}0aO;d3|s-V}Cwp2OUR^V6^GIUjKJZ2y{BXU={RJwL-L?$NPG=`(xGKL7d<^XugH
zKFgiI=YKU`SfHX5UTE08>Uz^^PrsyJQI%P}Z<n(A@Bh@3ZuXr+{dc-vVeMM0>Lqzo
zg4<Jd-_}pL-K7_QBAn0AyF1^%=DJ~yXTHDXwM(~{xsOFXI^}sUtmI=*@wW?y4o^3K
zmAv*&`BnAfvp${O`j)dtZNm9U=jV&nJzHJ(rKdCVs>JfMzc$+$&#_uO_3Oo5TI=Nc
zYz$5M|FR@Ao{W-~$Ub;^dU&qc)cG@NehVL-U3m0r;^uoA^Y6SmeO{_S==%Do<Sp;y
z*NIoYj&fdYX8GgU)|0FMN%j5R{LOGp(c8sqe=B_ZclDI7P3g0%r<lJRO}F~1YAf@(
za((A)_U6fdCx?H1QuUSPnqR`ppC2WC`ev9Fe-XL9tN+PF<M_g##;g6b&+mx(^yPsO
z`!@T8ET>J^m@-%U?@7BFmytH(@69bTYorX5ET3Hpn{P4Q^k9+0qpfAfGK%DnCB&WF
zp7!j*8H*<ougWgID{V=wd(v;xxsiW*#og#*1y5HBGe7sLJND|x72)Tl(Z8aeTm8Ko
z4T-M6qy0x$u0F38WzYO<%goE_$1knA+w^ggEwf$0(+tm7%YE<fi+u5*|3q3!Ve35=
zv+hHuBmSL;3bxxgqx4c5ugNnZ|1-OyDqgCaXFr%+d^5Y{;7ZejS#PhbS~+Lc=5^C*
z^uEp%_r51JUux&^FK1QVe3O4m&kkM=YRP<kwMBW3OtxqKJI`0;yI)+NcOZ|+uK4;)
z_WA53UoB17nPpG@{8^=c&kQl0okzS++aBDw&aCv>8q42V7vJzpIJzDaQ#%*))i~aC
zaZJ&djgixD)J7bZi2HhVnP1%5RG#{6ZyfJMbuQIsk1kC5`sqo>^LcKTpRX<Q)BBwC
zY0IOlx47@@JrQ~8;7OZ})dJUNDf{WvTHfdq-o1Thf1hf;_}jSP$#c5W^OpFp`8$t6
z_<>|plwERB7EhdE_Os14pPoia_kF!ID}GZ}u=y*`I?nTQzwMPaTS%Xq&1ydV(3i>U
z=k2k|&2p3Yc}4i}<k_`n5|3V$T79@_=aH*j*^{-yc1AYO*;s9G?A31l?68=%HlHIl
zTntLqdwgZKeOh|$h17Gmw#I!^pKeohEb8kq<=SUoHkVxs)#qP5e^2n2cUyD)6Ec}>
z(sx$;6Z%})GWq;!J2T5)#&fJrHf}Gw8NAQ%>zb9V#-EDgU#;D4pD@W~(v4I<L*Fxx
zuP>9l9u*l}e=^NK`{w=HmF4;~<ujiozm7|f$ola4U+?B=KVQF_A9eg&eq7$Sqvq#q
z52SX!U35AA`n8od$+_=B?aNvH^>*yrA(iwu+2->~&-*shLW`}p#8)#t=6q7jp*&x{
z#xSSo>&8z{W(mV*72PLWC4*)aCFXpYoE-c1U&F){rfkLHoq~o^FZ1ViiyJ;(CA{9I
zF!$AiG@av8H@-X!t2_E6IQ!Y{^t9<EH|67wT?_7?y0|r8uI}CaIhDFLwZAjhHm078
z{<QswaQr5H)hr&f+lM>qg>7rEWV`=0Zh!x8OGedKmRBsFetO8q)h;{opz!CMrSoNK
ziXTOY?a;2>m{qKQa=qQ2Cqc`PC4{n1%dS7L#G>}Zu}GgeGCRUz)`{);bxqYg>eExn
z?1N`BS2jcD9DkgI&N)izZ>|4yHqx6r&oBDBlWft0xNBkYrk|cBMk@c+E56!X;i+HW
zyEJ~CRC?b$z1p9q)24^<&G_dN|8Z4d{$Hu??Qc0P80Sr_S@&h@hY!6QGp_vX>5LYi
zZJCta(R_AV%%`j2`Tn0D{F>?AQ}t@K|C?L#23?*n!e_JUGPvLA?KSxEX;uE(nWgg2
z)-va<-|}*|`kGyD^uv2BrdNHQ>1|*7^6<)yzZsrya(~ph(meim*XoUGHimznG)3Ot
zQ}{`X?fbUrwku};(~$e>=le@}@AqkYCh9Mf{hGT*{Q=9LH6Qo<=;=HtIJtjq%*KhV
z$&u-2i!EQzH~sQ-*YYhl!|T5J*Y7@gdir0+$q!C!x7-=kbEErD2J=ekmnS!8<+aQ0
zJGHX*$mF>a`@Sp2L8dSl`r2nN)qfswcg=IVty|?x(@USu0uA$ByC)e98RaYM+&pD<
z>74kZ{YSr9gx0UAdp>_Z=MSI4=XT+pjl%1H{z>EgvujQE{4=w?edbxN+4tL1XX{jV
zy^T-${#<3}alN~uRY>_c>paV!ueKIM9J_j7O+4<3_eT4Tmf5@KANl(5^yO3XS0_35
zO)dPj`^_KI-`B04t$AK2Bp%E?o!h4PN$=KACpNxWJk_0VeyU&e$0swGz3nZ3ltx;A
zTxD*4_^kY9^Q-c!@Be(B&SbYeVxG31;j)A`#_IZ(FV*wSTrFpAcYF5bY~s!%7rRdy
zPT#oi?-PmsH?Nr4KCW0GaqaZkS(`UjX77CXWa;|6wP$~AHQTuL^7&h#`tg3xjLkn^
zUAr}M`Mdd2&)k2jKX=_%l*J>iGrelVDfZJfuRdni_10<cT4Vj`Xwm#{M%TBg7sRVQ
zc;5VctKEOe<@3)M|0;;+Jp0br^4CpgS<BD2W-+^4zlt}_n*L@hp9I&<ij(Qec_z76
z1!f;lPyH*q>D|^>oAfM`uASL_T4Vm!%kGnFJF?|+&aSfh9=-L$nb3H>%I{OB{RxsU
z+PbVNd;P`mbyBaN+x1=DKJ8l6u^0K9@>cEle1C1;eU=Kl%4Id{E*EWo_I2)omFKs9
zbuV4BQueD$eBp+u@(_8Sy+5<Qv-cdy674B4wD?h}ob+nrlZPj-s)_47&Mo+;WOr(A
zSLEf|(CmA^?#b`i7nZj*Bl6MJ`)b~CKH2<_0%bov__XEZR<Rj7q`qD=pJsmOZR1pZ
z|LCs|)*M-@9QM|)aK%LDcY0smt<3d5!1=-Fm*tA{OJs8Fb{pIO{AHZ?R+WEse*Aa!
zb)wtD-p<@1W%=yL)@R?@eR3BCB=x%QIQlec=aGvug6E6PtJM8@q|?~FCa3pTG;?;G
zw{5}tBb&n?T|2mHI=BCxXHRr)z6q}U#=737x=Xk_bMrhK!=IhY^$LH_4%f~*yJcm&
z|D39wCz&Tt-Vw3&!{&FnFIHY$tsbC0;k>ft{G&&XUbz;r=hl;#*LVG#b9m;*6}f!b
zvTH5BE9BX1y0-GxU&iJWDy+JzWJOt}pB~-tE3Y9UUfb-o{=C0yW=s6biFBT8+j}<o
z;HO1tkAB^Xa@Mt~snFXQW%+FDOmXR(g8n|;>)uU`NqQH^!z+{Bv3y<9wSeWU=jT}E
zep^xdc6ybiD0BMF@c4Nf!|wchutxQ7-^KN|jfXjZ=p@$8+hTB5oh>feVA_tdcDYC2
zCQY_Iu;)UUo~2=S_S*D0*XB%{Q}->rxZr@plO~PG)em-s?Jb@DCHq&jzxUoR>0ejA
zoiu;O&La;h8&^;6_T}lb0Z*?+di$-NJtz2Y;M*f>W=m9;%zyB!Xm#u4J*(E&JX$le
zs!(@l%%je=7gt|icU67;-+2dem^MG(^2m7aj`PdQ+S2Xj*Z+8OX7c6h&*mL@W4!s(
zmXoXho_xzc;|>GoY;7-|`nQ|-q%R#$^U*bYE%aPfJ@@NXxy@JBY8$ps|69EO!Le6I
z*36D7KG~{%yzbhTHkstF$CgKZpZsgh+qygQd+yBsb*1C#tZOq~t_}S9YRjvwUnHNt
z$@hyc&Hi%o;`X}R^Bnvdo}W3o`I%RY&RZS*b*_u&oBe&GeZQvmpZlFV*H3H@i>k@K
zKI_Vj|IdF-Uczz6gJqt~qnn%7&2Ca(wm$6K##^s8#;i-Ws=ONIf2USpwshjNV0HWN
zsd3hid%n#ty(C|_cK@++@7UjJm>+s@&35Ja>NQc8%C)afY!33bd8EQN|3+!-UfWAi
zt8@Jy++cb2+3eBpo@>vq?6|eY(XaN=H`D3Y=KSedoBnRb)c0}^)u(O!&hFDRY4wGs
zg0KC#X(8qtzr1Z<TXFWL{Jh_y&8MSIy_MK~{Y|Rw=fyGC&hDADX5*8?=cBT}uRm62
zzO|BnXZ-i{+TxS`^7Fnc%nRFVQ}pcZ#GOYT^nOvUdwMW(arygC*>BtVzuSM9{OYQ3
zMGn)?H#5K7G(Prhv)a5F^Sjq<zqWi{m2SkV&e)TJhnrR(EDD_yan7t#^7VUrL(Od)
zmMmo|c+HlbGxx~b^m8|=jz!e&yt-)OV!6H<+g`a9zB9~zkUoFb=Jvn6={5z^ORpwH
zUOUjG+Be_AFuUcgQTY06`<%++uBz!5cc$}NOjQ?;kw1GPJfCm1{blvIuQ$~zm1Exa
zv@Z(>H*~B^fBp%Zb0huSoI<<rE9HOw+_P$X+^3UkBR^e9IvSKeFXq?DyYdE}t60w_
zie^8Iy7SCb%zt)O!J{iP&&$lP`Mh=i#+a`W({{y{{Mq`cckTOmonN!%i&q{@UwUkB
z^3$m7mQY(m?d*3GR)_!2T5pt`e@ys%+{<X*c`*jHg{DV-9j|z{I&I1HY(L+({Qi8?
z_Gp_X<yJFgs|U<iElIM;wkv;d?8(!FS~d55UpMhdoR-?1ad&m;mA<N3lf9pQdAr3v
zfnk$?ArrS`^pa<jrrYfTPmQMV7k%3%H)GbT!&BF9O?&0OFJf!t@i~7xKTdAW-}mfE
zce1v5_Ca;A)3>f2+O%eKH(&hK@OzV<Z8(%TW!IO))b%~W{=9Y1E}f4#y3*Iq@*A`9
z{9U>gA176QP5SWl?8@xh!V%VuHSfOEZu|7pYyKXY-z!Xyty*dKv4j8JtjwdU=UEt5
z6n!=JpZ}LJnQ75JX~k_0VpEnMn^W^8>FV}v*P@QROrNv$$lIyV>CiCVKTDUE9oZPR
zmfO5|CF}E5QieO8ZHVh!?msW|YxIXlM{Nx4Y{Gvf-MFH%@7VgN<lJvp)R*V;CznPQ
zR{ZjJe!uV5H<mQv50Y089X3Dq=}ghfXzw-0R;oTXw*UMzdikwY)93%aD}C*>)rU0;
zr|PHIA4p-EubP%4c=Y5!_4u92I$wXi>iD{P?cbBdowvPpbW5Ku<$rD#cJ1PNv)`8|
z+f4s)>EFqdr~m4`d>9!Vzjo`L#T8pWY1K`>G3#dalkUv7mY2h0=6+jN^*VYvWMzZs
zn)CA`vQBiK7WM8{t2}Zo_R~q-wQDwBnLp?6+IF+=8Ftz4_$6Fsu1I;LlO|lc(o{Wd
zZI|@=jo;d%Ukg?1UTsRAyJq41t^HRcPxTjlJ1ckY=-%gcYbHw6U29C9vu6!xb&2kb
zs+zE8WhWl52TfM?YnPvpI_JZ^?%wYy+IcpcKTZ2$8vfj5_1zzz%^BybzpHsRd-eH=
zhP$p<xf)hpJJ>XL)0)iQTh(FWaqpbxeciHic{8(`@TAQix_Qp#v&@RGZQ5trd;P{5
zb$i3Cs)^@gdY|rGf2V(+<<^MlGLKcYx4&ceJ^DaR-tX9tciMlSbY8zT)p^d=j>wz&
z?J*yFp7taaUu&DZZ`SP%*{^oZ58SW1*YfL;UyGx9ZTAbGc<xmHWzPiR>*ZNT;u5mw
z*;`)on7#AM!wc<GcSwlM@%C9~ne_Kb!*x^J1d(TIUv%dky>ms1&#Ln3`B_)}do2yu
zi2p9`f0oU|cWlyPIUl<^y`7!9KTrC{`zHN}`LeG1^xq}<vN>1N-=2AWUGCM%{;Cwa
z?EaeUVD0cC;r+Sy|1JL}{nCGJ>Fw{=zP`K8Qlq!w*XHy6*3+kNtlDB;`|nD$e0J^M
zQ-=BV$v+Z~=+&;R*m{{cP3?@^)#W=Rs%qD0*BVql>%V#Bd`(tbY{ii^R|L9eOBV)D
zuDdEcf7hmW8~^TperI*<(FZTm-+s9m!99PD)Z?tH*>9QqRrht5t?yjwZ}xlnvt|E$
zU*8L<zx;Rmznile&YMj?-?wj?^`Y{!1z)aBSnX?jqeoqS_N*@_L-$rQP1g>~7L<?f
zmo?a$s5_yu)_j84+{)U|4}R#Zy_2<lN%wR?JvR3HQK88?{&S_ir{0U0x1&^O`|=rK
z>&n{npSsUF^5t%R)T>$7&H2~$UzPuOAY$t^zP<l`hi6~3HvFCOc5>mbXInSNJbJnM
z^0^}8nAqFT%bBw6?0wwlou3qT=lr2dDi>F5RtwWvyRY(h!|UYB=F8b;YiFyii~rm&
zYhV%`W%~Zvg)5Jq81burJvlu+uDdPtv20aGbf-uk6YMMi|8-`Cpjp39A5Nb3oHIwe
zaA%a|Ey+B)+^2oNPPAvo&9?k=Bs+Jf^1M4&^gljadGXq=BhNPJ-Ix^T`|9IsuefJI
z{`QtXHs9e{|Eq8Qea<JJ&xll{?GXBI>6IOqoo9A3FivOfzS6sw*W`Vg6#a3gooSJr
zb%M{CuCO~dW*_WI{Cc$W>(-MC>tCHY`z`eItILnB$Gs3byx!)!<GGqwLbtp0<F5!l
zdcNvo)VZMbYxvL0MSXgd@GENLDQ5HVosWvHBpuz7vGYu(_B6v=r;PogYm>rWm7jQ5
z+R`oiICbCOc@4r3etwiZ{>vuu>(SngN!Ko(GW5&#^VX|PHqie*&2Zn}uNS)_*-tag
z*Zs1&wBUeB;mQYVBr4WA%9`7*nkf;bXL{xI9}TwX&9C-dP)XzcE&SY0Yx_IyeRHma
z#`V5!j*Yt3wmC$(^5ohdYs76{Cw~?8Ut4Kl@#)GecF+vq)yb2W-;0R;dhFTO;{~6-
z9SC2}`ueJH#4HE9{U0jIYU<q1hb4KJ8mHUlKHIc^@6(Bw{e8ctSI>I*Vy*Qf85sis
z)lhFm!#}%>rt==$nU(wa%*w^vzFtwEw)d%O*_rL>pWI5{=*IiqI#cO?#ka5aNYCWy
zHw^zr%)Kb1J*~P_{-oey@$gT^W%^0)=33}~y|qTat#s+NTM?yE#Ye6gE|-02lzu<C
z%4Ba9(_+pi#TjyE(*1d?AEnhji`HJdbxT&~=T+y+j%7U9^~Xj+|K_UG5_kXEU-x&o
z^yum&@zpVpVs5hVe&ldY_N|mmw|o6~clgiF(03YT_OE(3_t_eS|2%f%iMriue)qU<
zvLDwsU;Qhjo~FO%@8o9wd1k+7d)wB1TC3exy3*e->Dt8j+#=)YR@vE;%Y$pLW$jl#
z@cD`HQIi_J%hxm~T9@ABe(iN;-?J?Joln+IobzRE;9A=&lf}K?{ZpSYOXXS6j76u;
z#+a>%Dqb1?DzI4jZ_xWQXKSi%u=CmOIC810`Dxq*)oC`xH?F*B-W;^wxon2z#^kb)
zaNo0$x2sj!4y#TJt9>VWU;B4QVr0bYu={_eReYReQygmiXvh95OXkn|@>J&X;n!D%
zR|r42`6THh&(9pe?#J=vE3f{l5xRYN&NR81!r{(wKK98Qc4gItXm7moo`1$J%_O~P
zmaUJDWxh_E6m6cUSNNxAW$f?kbsvhaS``2KW_In?eF@O4+k?*4rst#*7B5w+J|TL!
z?~CZ>xTBqGyX{v;e*N%d(&hE0N3KdIe@*{&WVPLImHd{~b3X=6-uK6}s$_2!(`L>e
zJZC?Nw$Io8T9>zBYWp#ponMUE&d=FrR{i>VT!HZFsNacu*KD;<U=WGAut=;yxov-1
z=sv?~r{}%AegD_9pyu;U*}OkZ#r#*>ZJe0zU;OIG=IM4}a#l4PznpAbefq|)gsoyX
zE}g0}j=MIe@IbNrv8bYNUibHy75^~46BSWebT;zz9t)elGv&_ue);m^DtJKtOw{Cv
zGwC+-Z+^LWVr^X(bY<AACl9(-UT&JbTI}t=2FC=&wM-rBj^sGyJzITvS=gRe4?32v
zzbEzVN!G)q`ST~*9@{)UDp_}j>4unh-7&w8MNF4^^lI_eezCY;88OE9|7e<3FI;bU
zBk2B<!^YS8zC2kov+mW!jR&5*TCVnY_N#K)-&@rSs)aw?T>9w5^Pgu!ljm1{{VKWs
zk5u~G!1~WCFCRbmD}60!^xN0#l*Il=J2{K5eLD7ZhPmH7JDI;v8mlA4<)%yNc>CNF
z+f!kfAM?8-`{`-pYh8!0t1r)&O)4nuobBB!vFAz(@1L1zp84-h&8n~O4XM5B{poC^
zzcyd^{(IqPukL!aCHu>jgoT02=f1rA+3)6h+s0Di6VI3Z`a08?e_g++*k<D$rdvKe
zO)#Eb@vC6X{CyHJHOV?QJ0mQA9r?}d<~Zrd7R@W_&xMSS^%;C#xs~0r(C~4fuH}mp
z!u<xHZ@kv~y}DSwGu^+?FuC;F!BYp<|28+j6n#48)z_^>R~qhr+r(aaS^nrd<x1sv
zpV#w({re(j|GkoVHIhAMZdmQLkoD_w{S)4@)bu@g{(1TQ^K)Z1W?j88yXNTxX6c){
zJ3dVM`t`1`(MFxb|7UK?=hPn%NNJieb;i*RkMa&g><;daPoHySucYDcjLk+e`X5$J
z&DMo2TK{IK?w8}I^IdnE)rPLw*C%c7yCZe_sG53m;ZDir`TK5}&RKObVz2S3Isbyz
zz3Sb1WkuC<7r%Kj$+|MrXT*Hm2HJ#N6KC{%b28uR_r;NhUq5wx-MV<!t7&VhEG5s^
z?09l#eN<u5O4Is+13MC3BS0GprB7Z?+x%s-+P|EYC#!A--?zEOtvlVaS|U4}zrvJV
zjo&`}=+#4p>TYZN<?IcU^uL~*zB-hDx@x#~zl`1KIolqcG-RJvSM(u&)3jH!iq|i;
zD>|ckeU8M&eKnTHW}2&~>1@ySPcUh``1#T1WWLj?ezJyzMM+P3KSqAqa6LA3^2WNi
z={>0jg*WeyN`7;YadOhh&X>wQ^JlQCy<;nzxjOuF_=y{<|0b@Ky}HeO+8?3gQOB!x
z7*`%Me*N#nYEK{g?`mydmGqDA*|_)M!J?Jyt7|r#SuVH#S@v7qhnw2=h3);g((LsO
z`;Ez^ldUhM*M(?*R{ra8Il^B-{ekh3&x`ZtMew{fcDpxcN7c`wO<_mR=tjQI+{`v(
z$KSP6L7O7`q~084Og`j>v?=oXRB4gJ=RQQm$9+5T_i^~yp!sVi@0pqZf7bkmoA;*N
zzhhsTE>*PE|LLUjw_b+Z?wr*=IpWtVZMJ=7SO2b_{qR};&E41JZ^u7BU(8e^R`c!4
z=g$-Eggw>?Gd`ZQT6O-uKd&RcM*WVKj`4}tR{#8M+q{is6$fT)nP4d96Ej<y!Psp5
zIjhd=y{Ue6x6Zu2eLgDc^Q)(guamz%TzT-7dR*<6ok5d#)ID3hf0>w6Y1H@lwUt$m
zXZy?h#LV0F>R@E&V&5}!%4X}#I<r##<B<(3J?$;M|7p%zS~d4I=M$EieH-fL9eL1O
z@cGmA8nG)W@4uYQKASqn&h{<;^f`r}`mRbAUeu8@SiFdDVbqSBEqmr1d3g52nTP8m
zuWZ^EHn-a2&b^{bhm6-xt9jM=^uhJ5Q&z`3dUD&{XZDVWsLxTq4?OgWnLB68hcl~H
z=l?oozRmyD+0eanx(=H!51U=_>skNJV3XrnW&6}82usw~RlNIT`Q6e7)LwekoxXl%
z{8sN@QQMDQc_d_h?%p?VoxjchZ=|ZN%2%G9c=W-m>|p+9UUPTMkXbXstoY^R^HcvC
zPv5am%yyr4>Ebz7ri*R6GS|lDzIBcB;ZF0fnO6FA#`RM-C+WutUB7<lV0q-_9nY?0
zK74pOI6qD%?p<_D&mM1|-7VpKF@|q*U#`8pO?`s!he)=^GgqHJ-?ZcW(wNUt70<4m
zS+mthf0=3eoN04vw<Z+Cbap3Bp1kAVL4O19Cuc79Or61c@J#Yo?eLh`wdrxQ_o&ui
zQ~z#y`S3*d`1N;Y|Gt>E_Dycw>^;GMKw~{KCHB7MU#Gu4%HrheUr(aFz4g96iYn4c
zek-=8X5!`}!OMN$UB2+V?)H1mCoG?SvOkyns`T7=_1WiFt(4E)In(#5Gc&#PY_v6a
zN9#Ys>Vg9iZ)S9)O`R<r!2gUje(s$!3nw<umr0s-LvPmpXZNmLxg{CB`_&zJv!B;Y
z*5@57T>h%Zf9pH-uaUR^?y#>Y&6k`!|LPXEPj6H6mY6S(y)-#lxA4uxZNH3dZNlDF
zx5p$N$^M#k`y0y~hV#?T7bb0fUVkLie6!vDnf`0+_J2DzYjxOOnXKLBUvKiq`yO@Q
z+02~g8PTnJo%f`o`ZCjY*2$AA4J|WQ&;NV!>8UwiwbOj=dGly5vwPjFdVG$=Mys_l
zYxnl7&kl~S?kN&Ac6+VbCc1j-(Wg?$S2NFEt@hU2=PkSO$BMRJPadBC@}%f)$o#Fh
z-g6o>)+}>7uNbke=i<7^lfm(Z$!o&b^3JQOOo}Rb;-+o+?4VZt|8j%HOJ-bix;m-+
zrh|^I<>QI#r$tQ-FP6MrowC;X+&s)Ft#h+Vd-C<Oc8Y`687*Be7hU*h&D!|F>@`=_
z@Bd7x|9!$(-TZg=$w1}fdp6os&k&#g@?iB>mLev*_jb<5qITG&uRQGUcXsCXyxxmZ
z+lwA_srt*T`R2E8?}pNo-Zd?6>zfoaoo8!ZNZU9wpZ9ad)ybFD*XyslcEd*OjH=(9
z9X|!Z(^-a5ddX|*9)&WyueB+Cc45Pjk5?b;K2W4;|8e5}C8hB%vV0%!lK*h#WqR+L
z)p2pJf+z2*+Ip-Y;@U0O{{5%cSCvK-Z7vP|yC(1P`SUC_*J{}I78gFMVH2Ld+E*^3
zwr+LVw?9$-`}TB6CqKOMZ|3^Cr`Id$4=AK4#~m@dq}H}S?WRG#Q0&ozPZG|amQ7rF
zusrg3Mao|FokxCsIJ=v__>)$j8{f4(Tis?zf!5InpPst!#-z11$!qs^eBCU!Bc=d6
z)N}H(`t(^}9&WgD`tHKr^OC+DT&DK-Nz-z*zgJ!?j=cnF6Mon!^-xs#+fUi275|DN
zrC0mC{>&9W_xyU(E5fS}tLc58;cI*6jeXa5_8wlvNELIQb3%uwx7$Ze&0gc0%=>%t
z;p1xjc}brRL|$9@&ur(1O-oMyd$)30Q2*4$zP7u9zt1ndwB3B`W%an-LDTJiy_s70
zXyw84GW&kcDz2Y7U3uECH}h{@S<?Sa#CGf2X1nlS<Lh<)2cBQ^l&OxJWdC_(s%*}$
zj4LlEi+juKY<(BF?xW#s)1dDBHA}DkYY60sFlRgFrC66$)^qs!ljU(XUw>VjI@z%9
z=-S!Ue)0SE9F~o9{l<PVJo@pGvzaF!o<1qD|IrukzQ2>%j|pAgu3q@-$hs>Xy>C3$
zUz@WrY);j$Ctuzsukqu~^RvF(y!!O67eR~X$5?jmOfTNL|IQlqwEx>|8Py+rc3u-d
ze|k^tx}f}f>67Nn*tfB2=gnaI?A89+btiAFfAvOxp6%uP@&*E)3O*ZWRO*~o+SwTU
z>__(1Tgo4g-0A=MCV|hVci%PJzApt4MXT());1se7xnX<>RKy{byrTxCVmKB&tIN-
zGWyYk=vBeR*L-C5KYF(H+13ZIw(Jx))bYM+wxfd4zwc+4t>)g}8MlQ$NG1!te4bKc
zcks((?zEh`mQ>##MOPvgN0ol+nZ9Q0!zF(A|2^w`%MF@(Z%Pp|_OmgcAoJ&D(EQmg
z+VgfD`H*e@_{mCf>uc`!a`>-ZK4l-a{hIUhy0xn9ch;<n`5g5jO27Eks@O+5PuD0P
z|Gj=k;nr7MUiEH$k)`)OIPPgjdi=)QSJMA}t7fufoWK3Zs`)bWPak;_-V?D;W{r*R
zjQPBOc1?2Ed;BHc%Hq=<|D=_-<qaAp+?8OeEt2d`7q(b4i+OVU{MC=L9?lR}K6d?8
zwEw)Ydn=~RS*5zp(o*@g+}Wkq=FIr*8N*|1qyOQ|)nAdpxleDf+x$HhzI^T0gRA4-
z@tD`23ER8(;!I)XYuodV8r845Czbu>-D1$J%9ZErchWOE7xQt?_dX-_tmEtC$@^@D
zH`i}Hc`<x`OmW1zCmkmP%L@)DJeU;2J;PncKYsNxGo|{RrD3&6zpi-R-<9y_#aH*A
zXU^7?X6Ig8`FnZW&!u}0D(*kBG3;$)nJ@p>h-tIFtmU0nS9J33vs1Ue`RLUCR-5*3
zWmVRK*wy9oxz$WQ2ht}zcfWs9pgXblSk}Gg{(3*xOs^}tw7o3p+sZJ$F#GBg=lATH
z#k}2o=U>Lj3tDp)xlXWol;g7QnY+}6rK$g)+*tn3HRheh{Aw?G-d{&9ZGR>eU0ND{
zts#Bguc8yX*Kc_;{nrHPt3JNJu57lmTm7v3#ntSyi|d85!_0r5ulZIiY<p|wKhHba
z*K69;1Lpm|Xsp?G^?TpzVz+zG{o}ir{kq0@KJ;~(UTsCz#;tYFE}p!)-TzTi!8djv
zT^FOyBWBZAi~9RsO`BskD>-{x<?9>!qds3bzTNLv=SlDG^Q*R&y||kFZ2g6~>HLeH
zynMdz;R$p8W0Tm|^<QnDyz@%8I=lSZ8z=H6i|cQl_QUt<HOsWO>s#$VPtQ7Q(iy(@
zd&I}S`SUrSe4hC4D0_xA%f>Cg1ioyHsY~1Va<=!`Z3mxrmuA_0eDXTou6BN|;hNuq
zo5PQu?T$V@@5W!oWWhBqYg>)l<EPJN4)31-YnHOzwxIc?7X@cukLr(kc695>>FueR
zA0MX9vHO|4`kSZS)-%~>Z>tv?T4rkd=RNYSsmR*$VfDS3M@d&#iL3j~uQ+Svx_Q~V
zj^OI2wS7N&=l*B;H1opw=S)2}WWx4;O1tbOH^;Qfa`UW5Coi9`OIZB3`?}S&6MMd%
zS!ijIpraJXou_D+lk`JOExdB(;(0$`3HOIxJ<Pbd@8^*s`9}%AZbd1Ve!4q3Mz`YE
z)burL??~-d|1nco{IFWvc`u&6Jx9K7y{3}3@-qARm`A@Nu6xY4tf>yG?=0_GU3Tnr
z&99x)UuSLh`+fcy%d6k>&pVuzOn#lNl>8~KuFfcIzC`WArl)d8w9|Cv-%wp9`|#T&
z<J<PPPPr<l<*xnO(azrEl4B++ZhS51#<8L;W~SE`U7eo1cgxJ^N8xfYdIhDC=7tuZ
zj%>~9+4|tu*6p)Q%R(MUynU0-|9!pL>sP0zCijHxjaj?5XKU8RlZNZ3rmqq8x7}B{
zc8`?$^?#i!qc>gi`75-)__=B0#ozkNzV`KQeH1ZIUazQfrgUbIzP_QU_xWcX%FDJc
zE8P06?EjI1C!sNRWtngPXP+{jWbUS1J6m$`+K6W-R{uYfZs%+fv$ahszeq!>;gwP7
zMybQ1m!H)gD3Uy_SpKmhSMT1WwW`;SuZz5PXw#kcz1Obn@I6=hz4+bt|EILq=iIA$
zz4q+({eR!ymMOko)uw*n^M|SHYf?Yo%3lAm@ws<G_V)R6Prqlf`(HP0?^UVh-<96>
zhFi@y+W%;_-|^l#cY3W>n%#HnN2gYQd(aR#Lxnp%`O~o{u}NF|Dqd}yRpH#ReeaJ+
zeY0LhU$2V(cXWcBUCoZW{XgCN<=&ohmo0kcdCua=lbg}ndhD;|K1ANuzj=D!r;Vk#
z#r*ng1wS1o-M?n_@ZalyZ=T;v`?+iRsqp2c{jXmA4Xr)9`u6SUs{eQ6-<IF~8?vu-
z>+jm_mxVhxe^lPCn|4s&?lQl;&7HdAAMQRW@3on?T(|7wpZx#F)#I7P?+f03-hcl8
z(?*w-HQ&C?IsJaJ?*E|ex!Jv~drXV<6LdDdN#-xMekOXoB8{JK#vV!5ts8c1d$u;P
zFsW$H0v+>t`)=tzeB|02R&z4#?y1vvCiS2DyZ+(HgU^cYM-`ij*{8kTe59EFo&C<0
z{`-qM)-T>ZZEtWs-<dt%^Z6~Gx&NAVI-)M=c$Rwk68|%QKc#+LTfQgx^P_J4N$<Y)
z_#F6t{_Qo;sRBClCaeCJ6+eHZ-R{f6v#0g<?|J@s#m%Pa`jOfnzqrrYwf)KYn&0Vr
zC+eTKDu{R#wc(2J`pCokn@=v<tdw_T54h1~cW0u0ysp{Kl{eMI;;!^*d^1eHd*q{W
zoA&x&*CwtPn;r8dsq?YA-x;Yy(et*suG951g6G?O=yBgyRUGkmW?anLjlYBP*N9G!
z|N3m>6F2YPJ3UAJE?&;=t=qEv*t;^OuaPU??|-ko`^@vD$3AU&;%;YpB-{4GnU~os
zXRdxX_fC)Zxw;=Z$tJJ1Jn8@W>fxqI_P3&suKM>teMaob!;6xxM$O=j2$5e`nfvU^
z#$Op9VnfsUV&dPGt|{I6ZTq?%({7nAXPaH^8DCqpd0MsKS)nw)?ApgO*V-hn{jGd$
z`LxQlJ5LF_FJ8}@eAeW{r0(~tYPHYLTIrbmN9D`AwQv8<YdGJq`%9$awd-N)KF)fc
z9{vB*%&qfwWfkkcbAB^p>o%)z8qez1Cg%Kq62{Y8`TFF>xZa~%zs)}Sdw#;EfL~nc
zW;<UVKL6~Aks80+I(@$IebZuoWyHMf4xJrUyz;O=U)?j~_IY!DzB;_N#-wxQR<UVQ
zfACqpHLVU@cr4+j_TN+L+n1>8AGiAOHQTm&_VHz)4M%#WFIO+`*WMWX<yvO7z1oA{
zXY<nREbnDc|99)V{p(d*uU(6?*}m>cQ)pf9)x_Z0b~~@UOn!KBtzD(%m4uadU3Z6n
zb$Kb=|Kq{BC+GkCWt=?QvtDgWr<wWU_1liE+&EpPDCx(w3+Bhdc;~<-<*xq?vE5<$
z_2lvMRX?t+*iq_MWiahlENHGXdyeR<f9{rFZ%u5Ad35FDy(^K@G3(5Jo^+mF^*f?^
z+4SZ2q#j+rxO@IK|9qx>@g-~iy|MjnE1S7y<F~)d+rD0D+L-lUwyHI}uJ>tw*2$}f
z4w@gkbbs&Fy(c!8UF}MaTzOxy{qKQI%l;m{%U*cxmb`)5osK0l1?tw_s+qER+0ICP
z^Z8=FufA?xU+TXx(tUqab<}*D=@w>&#Szo?e0katy3X`$^86#4^tXOpy><Qf#5muh
zXS2^nv(GtQeWlO9BsBiF-piABL*DPZZMT>6NwwLh+HE%kE0cFB>y*FWJgsWumS?N4
z-Pm{J<?Q|IYA5~PUiQxT@14~#8z%Pq$#~D%`i<R3O~hl(#vRftH&#T=Za#T_SHh!}
z-aPlM9+`@rm%18%c%{_uhSl{#zt8VmY<Dw$-JU={zgth#_gxEr|97>p`nsLTpPeUH
zB~82Gu|N5Z#fK+d%j4`{p9rq@(ck~}tXjbHIfcKrc3bLJ-amijN+_rWr?Vsc(X$OJ
zH|yQd^xk``C*3ZlXlMVG$=<ooJ_M`hZ>cYSb$Qn1v{-|WYj)cwFzi+FUgK0a`+CG3
z-h`Ebm7>b}$76bhk8f|cS!-FH-#J~sNND!YqPMg6bRAs#M`|_WdD~N$Pc5ErQ+%uI
z@Y<bM9&di~X3^#NxB0DWvi*7@;_HqY)%)<5FWG*~XZ{aE+pSr)-|v<EWtp>+E8VK=
z>{7S;bHe6WB}EkI8GbqzRavwl?$gF+R~vU8xVGlh=4H2fzGmAe>)O=55~voOoP74x
z#L3O?z4pzpDUK?vNQmov&oAMyUT~t)v#%T1=<IM_7iT<uU(b;bJKg>s)DrJeT_?BZ
z)4_<M@{51AUYnP>dEVcPx9;!RD0{Sbt$y53Q-1z)|IgpM`{u;7+|VXIJ@ZC8p_M|X
z<YG7Rzdz4?Vb!DzMJrcZ1}CNFPl?aw&wXfo?bf%)bxM!i-b^);FYcRfIX(CO^QzcQ
zM#B94pKN+p?tgV-Zsq5^hf)6XFUMT}{%OyJHD6B3JzaeAV5ptc-910fef}l<!6s2{
zW%H|lvNx|)z4~druzmi|o41YAXJ?oF-ZiaS>}<oy)y=Oe@8A4<Q(wC0`{wWSf8V(r
zSN$gc?z@8R_6EMY)~K#6&3*CY(0jk?@~>I@^{>r*b6|PjH2yyEPb{)=ws$^$d61X4
z>F0&!XK%BL!*^L0r&kqc8u#-*o55;bUs`ka{N0%9=hIHwPkQfj{p7RDb7~)+$=myS
z=KCH?^|<*B>6Kq>e%)M^_<!D^r^(A^nOpDjJ3rgX{n(vj*TPG8%t?86XZ5FB=l2y~
zFPkZK_V3}9itGNqlkER|=I_%~>9Z{tclqr<WnTW9SvW{y+eEpL?@sqRKR#JgA#?Yh
z_X49TyPXL}KYjFU{m#vK_V$Ql+>S@Hy>qV_&#bsx|0t`@V)ufWw1+<qJzY}1t1SJ_
zk<hmGYZXh5Zogb!bAH~>b0xaXpJn6E&i-EQa6YH*`m^2Natejd9$fyuYAV0D|L-94
z^?YS#&A-dsUHrLb{UU4U;$82pzx{o@l-2rj@rMsLf1gfG+f<w3So-D4x01Wx&AHXe
ze={e0TzFYf{A!=W9x?a#s%KBHyI>P}!-nsh%)Ww)m9y+Wo!;u6J5A0kpP%p1<b$S{
z63_Roue6+Z?8gho(&x+L<=>yVJc~bFZ|_Hs?EB$YSJzIyUHkt|V%6-$vQPKFs{Rx8
z?8mv!c4t@r-r4f{dy9JUt?R|=_Mc}au8TQ;^q^(`_R2Xv=kw+NMw-a0?VoM^^Jco+
zegFIAS+RC^F5Y~3@^VvFv9a*>S@-RJ`Tz6(l+K`R5^<jS<+SxRVs4KQ`%Y<pR-Vsy
zE;ix(o7%aDAE$&FX9_>Q`}C~mvAqRGRaQQ2*M6?MJ^R*6nfmM^qj#6~%DkOu;~&7c
z&FuBm^rL5Ee*JhBS$KJId}X0Q+<CWm*IRZz-y_d=?zh=}Q+YnQk2dcn*s0s*PS4M;
zzH(vBm#iI+&*bgh`C&8v_nXPfezVTaIJ<t2#f&vQmezVT&u{q~pWge(|8DJbwfS+!
z)`?D+-2R`<xZQ>4`W~xUmt&?y_Oxr;zZ3l8`p9&%rSY5Rw<|vuIeuPrG4XfW-;U#N
zQhv@h-n{e2t<}%w&d9N=F}`0n@0pc<`@5y>#_N|m|KX~9)4{&|(|@6u`){Y;sNZsV
z^DFB|56-Or;r^*;!*jLy{w7v$Zq8lU{<@~BxanD2d6=<!dfjJ>;(c6i3*MjE+Fh0(
zUSnjt{PUM*@6Ikg?Nnp%`OWs({PutE&c1l(Ex%9vw)RJdSL$;6o%`@?_q^!~PTDq|
z+@btG%g<tdW&L-9)f2B-y#8W&(zZHm=ChjZ1wShPzq{*vuJ%dupMbQi)j8Eq6m<X2
zxhq$?!T-~_J@r4X?Vc7{xTRD3eb?-r>tBWM4!e_g|J3amdwZKRXV$&tQ2+ko{rNcy
zY~JiFxy5z(>4hhS4>P~-*|e`;vLd7J-|7N8`||sD_rJfm_4kS8`@hdkQTrBCnw<50
zp7o-iA5!-DyytrUWzKDRiKK$md2{Rz*Bsi}p}J+>dEq|&tut4?m%Vqj=KG1BdF$if
z9yk5O{`}=%lR5ta=aj#(+;Z~e;@=ONiZ;9#>YLt|?eli?DgWH9<yB{9{yzM;qUq#%
zzWmoarrO^*wfj-o&u8Jg!(!6IKt$Qr*xfdA=PY;I)Gxl(^W`La=Gm=o(|JFwx@@lQ
z&%aAQ@7u$<*9z>}cbR|LTV;Mu_N!z2G`agS_m50<-?#VSBi>817ppqIzqu#v(~H}?
z|1ckx$l2^z+jzyUNKe5#{%LAcNzC&?;j_om+x|YRVzZkQ8|=TV)^@S+s~6{<RGFRU
z`nl+B+LmkouGrbkJb1Z-Ki&WJ$>&@2Yi*2H&pPh&caE=lH~*!}&uu2{w_0!i{%K{k
zz21-P^SkfA`Zw8ozCT~g(@e)*KG|O$tohk&IrFginVFKim+9}>b0_t{?f!EQ%I00G
z@4NN=wBGmccMn~hec1f@Z}-!k-(GyI`H`w<TYKNIZr+tGqV_vO<<CX_YkZm7<0yW3
zXF*k|jk{gsiT$t6w%E8^JXh7;zgs*mEZ_gr!!Y-@YkT)jc+OE?Jt;Hy+?DVDQVwlj
zwv2W1!PBpAZ(sd1_3OvyDPcSAX6~0P+VHt{`?uq_ZSUXdpa1XX=f9dy?q2=w-#`2N
z`R{Kg^Y}lnJma~4)zii2YyKF$wVow9UwL-j@y~w#pYQKJXIuOI-@M)L@84hjKFzJz
z{p*+V{Px{vEx+trZ=<`S@7aSdy>FxcHCC$F=ue8%yWyQNcj0mE>E7q;Wb$97_s=a#
zd-(j_k3%1q`uDz`RetWmY{s)(b>C*(+<nE?+V0+mtUW$erN6ISv`Y3%zq04#vl)9&
zpFTP}>R#VW^UZ%(7Vp!VA6Z<#!~B!%x{Uj+HNO{rk3IZf=)3)`_dlQIt&}Z&eev1f
zmp{JE5aqS6wZ2zp{9{-6?DhXm6Yk&t+qC=reCzUMukU_0oIcOz`Im3U((U!+iqo#e
z?BbET^tIRa^EdWo%(3MKq1(;B?x}gbcSb+o=EbkS%=LcnBQJMuj@+?yH-q^ZJJvn+
zwcosFL;5Et<0i}1XF@CgJipj;Z+2&uMBcM#Z(sgxYPYTU*M0tIKgrzu-phQw(r-6d
z_iNq%{<oli``#@(KP&C|%W=Q_sQGu>ckk`?%0EB%PN>H%e7CrLto)nHRj;1RUAO$0
z@#h~2&u9NPz4lY?v-P*X%b!`x)Yi{CW;xmH`H}1Qex%LsnX}6_cKxR^_Omm;zUB96
zGyIwm!ykRs=;P|2XWm8Dn9T6GZk)VqPhIQW-gWIaAFl{6zN<bfr|4m(z<Kt=<#we;
ze$NXJ&dgu?dS2`M91GhwJyx@B$?T2!Y_j8Y`~9csYMU!E9p&$<+Qmt%eZBs~?|n1B
zmUVh(=Sh8at$)40YJcU-{Pww97BtV^oAbHoLd?7cm7fCI)OVb|+_d`g<`>^y)SrFv
zZ++eWyXCLb4PNh@EEgwx<?$P?e6}b3>A%wR{VwpCzWv7DX3!p?v*GZ$mFnx#jy9K{
z6n$Rz?evTJj*;KJx0OFCtlD|+sPMa~zh~e5Iq$yp?mYij^NhFNoPBv_Xm4}Tv)1$K
zHa*Moc<QGtSHHY-p6%z8AL`!k`FYUJ{`$X~@8@g&->G~Se%@-|2kj~CHE-X};?s9F
zx0m~vvuHn;)%W@5kCr#Bk1;WRdiK0b>HDWgeWw)mzql-{dq?~DzjOEg9k4O}BKZD~
z(cYS8mw!Jg+N2%-MRxzCLuZxq`DN$NYx}+G_iW?mukNO{+Dusfd)-Un%9`UVm&a!o
zO>pP0mOJ;o@7f$YnYyXZUt88}il6#@@0s@LKfm(Z?fJcfS^tgo(r3%rQ*V3czcc=M
zFMHYhmF+iui~ASboPRI-`={+^9johGCF{huEV%VPwP;h#%c}*Z;qN$}R;Kmy-}`qU
zg3bC$sgupha`!g#y;d`?oL%~z^ZqQ^PX=<Em$i%S%ibrNpO?L(a{dR1MCIH-_sPMZ
z*^7;|)%P9q4*uiCtv-L(`M&=4wDjj!K5n`9_00M`+UI&=_x(Jl{`~R3)&C~e*x2rV
zzL#^mZJO(L?Hm7Yo^E+Bdtdo|T<!eRPw&-#`S<OUx%u9=p0)Gx|J(hJ{PEY^{PnjL
zd(}U#$~;)};p2l3b@4BYzf6Dj*ZukI`Cq?$JyY@Z)wlW|`@4H4IM}_kp2MiE_s8Z_
znp^l~D`)QX=XZ`O+t;qWTov~|`syd6m$QR!-#5<Kbg<x^q4C<4XFI0H-?RCg`l05m
zd-c~F@BMaLt}Wkt>T>4H&eyy4pZ3e&w|S-Ye7oi4WwoL9_a4XD&75Cd|NhPI-RwQ<
z-{0R;HTC_^v?Kb)U%x#6`Ge(GWT4vgd+(RqTI{+nXcxCR<I~!u(;hybZTnBM#D2z_
zTQ$EI-~A`;Gi%PiJ-e7=kLPE+va`N-rXpQ;evaLjdpAq})T~_WYx_t0`Re!i_x8x&
zlU@9{BGD#xdH?pE>lQy>vt#wAKkxnX9^H9py{2Z%xf0phI{o5DuWPQ`7}rm!H2eR}
zpnl@teYgMUon2j9U;9}3=MUTI=jMHVKHp(p{d}9}&z`+cUwYbK|K9uk&o70^<hIX!
zY4z{tJeT};-`J0dXXZR!w{LqvT$TCpdq2+3iJShs_2dV$RnhZHf7#8=jJx}5&0Xnj
z_bO`);_hcF#c$f<So&k9H`}qvmus(o3cv0ypZ9Eb_;;T>T(`|%-;JF$f99JGxqY<{
zZ_l<{Zu!;t=XS>Hj;60??wMOV{rt1Dv+mz_ogM#n`g8k_U)3+1-@e@B{?_}vdM|1Z
zq@L?q{&{w4{_Dw?{iig3c^CZs+`7!7?e+$WRUS@uXSx0C?PjL?{eCVN^?AqDK5zqd
z^5OMqGMV51?6&=}?{XIZeCtm>_iWYX$FUu|ZMQkRCVS=YFMFQZM}Lp`o}>5q<LcOt
zmloO_QSUc?ee=(4hKt;Gv;Tkj$A8<tZvMY{xwk*QwS2w4lIipJ*()pmon8I>{nFnR
zHEQ!`rm?)-VEVhcf6h$bV|S{5PJRE4eHr`l8}l>1d|3JL9n;0~sQ4-T>EF&gdYc>a
zUH0(Lmi*jvefjf5&25YMV#V6t|2}Q{yzZ>(eE%KKu3nh;CGD}5fAib@EU(?4ckjF7
zE_Z%)e(h4<`(Mu3)s?@^c{Np>{qf}dcT@k|K6E56{aklL^TT~P^=(&Q%DT>fdj1DX
z*nZ}i3-9g1XVp~A`|;`E!6&oK*{ARGFS0Z!-Lw1hzKW{+S1C`w_P$DaJ~yvELFw6%
zH)jt1SkQX*?3;7fXGVVSIrn|~49QxXns@K!J$tn<XM*}yFaH0pBG2ZXyHilce)a5U
zwwEg(KRkT+gJo5P;{Ey$GC!XrRLh_IZdZE#knfwD!PQItpZcTxeQx=$Q-6!U-Tc4F
z|G@7H`;%pIbhjTpT=4NpGxsl_dG<4ui{IA$Dt?#WuG2sFqtDvn)wg(Vz2*1ewl%4-
zdsrbAeY;X;^5ypz{=G0NF8f|%JbjJ-@3T3&#%1#|EQ_wc`#OK-<?_2{%k1lZ@18#=
zy7m3}ce`g!y)$w7`;7Er_n#S-b9WnM_n8$=oj-5>;{RLkJbwOT-SfWV^AB9yFE4fG
z${zQ7OB1%(mE5w;PY>T(lYMsWJ2Bh&D@*5B7Wc_+w>RKOix<0eS$bXHwK@9?OXu$k
z_`EXu^qrHX@A<x6p0%H6h5Q~H6@H`IEyp6i%jzFH%U`@q$Ns&*{a12-E>6C9+Fae=
zdl~=xD^DNwvRxH_6#M$`kJx$lcAVaxeyx`O=eIRGuI-Mi439}a_p64<-CyB-fBBX`
z-P!kcPrJpweU`KF;@_6@)02KbQJ;SA-<7qqk58_9YH0nd{eQ6mljE{umNVM;t+adP
ze9!K8E?#u|^1W-7O_R3^-`{+tcKOTMQQvFlN6t2`{Cnl>(ZfF$FU?<<J@3Jj%cnno
zeDL<2jc?nr+r@=8Mm8n2U+hX`<mc>>vzyglUsWFSW2gO{%5&-${1f&mzbyVVPxh+G
z<~`FZEYd%+-!`uNefH^fb!*#Sch}szUi!!Q_vHU<lO5WHPN=KzvDz!8zj`_QVap$1
z&R!0`^W|Gl#;=sm7um0#J?~?)sitU4O3{avsX^8c<7|uX-C5fH?Zwltj-@80MOk~+
z)SbKL|73pU=jMwtHC2*P-)qi4Im=Ua?@#C6{%hsD>3n~WeCGTjeB$>b*{^nAtrtI=
zd~|vE>Gd`jW$J2`<^2W3<>S<({IhKJ|37&u{rKhQ$@T`i%eD#RGu-?1;?=&K9~I#-
z=|R@dUWC7p+f(-8QuErCFF&1J`fVcjeM!p`^7Ahn7p`Aq`>84;ysC81mxSzBC)JhZ
zd)}=vDv|v8<&%xEyngTfb?++Yo!ssI-XQ(x*M0jApYpc<Si`hheL}gWy2X7<DZ3f|
zpI^;8dq3utto&ISx$35~TerV{^7GK?)zWXdwp(qtH?W;h*!I=HZs&sT13zATTsD1f
z)bCw>?_O-#{yOE2m+ac=IX)X+S1jMZ^U9wz*5X<Fjb6`x`?~7wzaO;~R@Y0v?5p4M
zF5S+m-}1Bdxj$!4%ryS{ve5D89oKEyapkd3Gu?mATg<o4X!T#Cvbhy@jde`-mhSO?
z^&<B2hfll93x55OE|1*veOusM%a0#d{XQ4#{(epMiP!3&#)Xg>Pnp|WC7VbI-M#)6
z`_`rY$UG?XYwPX*Z+0Istu8)vS;5}lAnJm;T+Q`|ML#mdKfPs_wJ-nlcEjh(n`a&M
zzkK+EiG**i`>zj0XD?edcb~VZH2$#1VCK4?Wj}W&PvxJU+-6n1t8bq1_xKZ^kN;#b
z^FLrMwKMx$-T8{9ACb$?zx*CrFL-b3O#7<(vyV>Bd2+Vl;?=U3*513@x7!<h?^%1k
z_2uuRSDi(+-Rg5Jvn2X|1>O01@Vr^|caHh}dkc=bPBu0_F}v#7>|pldu+8gEW!o3?
zFMnOIdAoIu-MhPcWOQw9OZ}c-{(NrcubJk||F8bsH`(gO@w<o4{ykgzY|VM~3;qYH
zAKQNOV=Z3b^Sj`3^K;+*tE|OsYwcbgJC}a%RCj#hj`Z{X{|<a<Ek9fl6TxqNJtixD
zhWmXxsdx9}_C48UmacSu@6O`5qIb8A5C3kNUtIaNb+W&`>AYj^HgD%|{j*2i?%&F<
z-=AgsThzSI)+;^#aB^;bcI^2*_j)RR$89=z^<VlY+t+K(t3TkZ$XBduueo>m+r?SI
zmlJ-})&C4DUaWe2{=D-xH=<ruFE5T&|32B?pg7aVSVS-V)26i#ANlHDF8xz8q29Dx
zJ<9KUZ2Z-~{^bu}=<q(bJNtN2|9SPA?BcrfQ|8K5A1b%~TeSYc#h9r3p}FBUXO~`k
z|LJUb+_uj<-aMXLS^kjs*kS+c&UU|)EAI)PSKm;@RM|dfPrBvViwgaAC+^Rh#rAP-
zx0s#$z86)J`@WT&o&IL;<(=y$|Ng+P=FB_qShe?})61si`^oyst{3Lp|7pv)>2KDV
zeGhzN`T1Y%{B>u`wkLd1_BX1@dcn8a#y|PhdaJVZxNpx*u77ondGYbbzukXc?N)uR
zy#D;0b0xC6?dCUruKs0s-v9FKji<N&UvpmFV7|jWdG+@Je#KjqpV(I&KfCqto~yri
z&$_<(W!fy$^vB^DZGYeX1UV+WIXs3x^6E4{-OU-XpG}wZS;e-WUh{0%v`UurymPU4
zEoVO4%&yLVH*xE7)5^_KyUmW*8SmpNFMj)W_Zh33i*0hh#u|IyTlcbBP5%9vboX<8
z@BbRt`_8jJum0g9XGQqNdx3xXmal)lA~CIGZrxP=>HPT<@~_RDc)0p)ot3zK;k%bV
zKi>OyV28tEt7EaUZ|}W4z5dybD@R@~Z8sPG<X2)|^J`uBuP1M2L>Av!UHEjV`f|Qi
zsb8KwZnivo{I(2l+>wbhrToulu6up%-K%fQ%Z^{!?epWCZ~m`2q4z#dYJa<T+4@SG
z8nyg$ozI0|s6U9!TKD?e?s@OEbXT04bLHOUb%!5Hr~cxbJp1$V?Z4-mTUW2!ee&MF
z16wq=cKgp0tNHTfX^h7;XV3flzP!6o^IU!YJifDU_q~4c{oI|)|IRFOuG(_#u>9M1
zdvc7<E-#<8{dkQ;e$CzTTrrzV74II-x%hp~&2OI`D%eHNv3&V*!`3T5D(okle?Rh>
z)8;qJuf4(5`o`KZRZ#)9wY%@WH8#GnXJ*<Nx%)T1&-xQ6|MpwGc%=R-?xQAKzwF)e
z`bW5X+PQ0&6VomPnXhmA^2M^K#3uLC$L-5&R~Dz7*|+I_*~_1owr{UA?J?hadFNC$
z_R2F8mOp;nZB`jm!p{D&Kf&np4a=WX#n~rMj4#|h^ZTAOyIJ%1ZML6(;2r0ayPxY=
z=Zf|}e*N8S=gIFe_e9-|m1~P17M8V~=Dcsb{*8a-XRChiXX^iXk3Hz%<m7spSi{%9
zZ{ya`Y308v4zI3kK6~_Vd%IDUMY_-Yx_jLGXJ_wwcGXDu_rHseroY@dcX9h`8@W?2
z6yxIj+kb=?mj8EuUV3kC*qyw4r*=O|tJ|7gb?#pc(`U|#e1%y4j|cbk|8#lHpF8!X
z&HX2RKQf-J`)7OM%oYDFhyVV}uTNNZfpHeM$)!i<gJ!X6$5hTL{#o#2o~)n$@tf24
z*+0B}+wSY)48PyAtDpT#Q_;U3Q!z{SZu#AxAO4;^^F{dS;p%0VC)>IIyA@l%ZpXFV
zb;oY+j9mY0&5oIu*YDBR`zM=!t@F8Xge~KH-wm%TcKg4*fA`}4c)6eN3J=biSDgCI
z{;sRv{Trn<cgy$Q`u(upWt;Ki*vr#rGe4d^=Zx`<-*2J{XWsn%rhWI^G`8@cvFm;=
zmR-HuY`SID@5_&yYTav!-oCH<_4Cop<$KrOl=hR`rf-`6ddJJF_K&CjTxwYU?)iW3
z`_J$Ee_hM;_h0q(#QV3buSOL=Gg<fP;h7iZTV9_l&D~aG5|d@a^SovA;!>HO|A*_F
zIVUzS8XB?Bes5)2m9>2Hj_MgZYtL}FXX|b4zw;{Zqlta`#j_l3*?Uah+dr8deKpM`
zI(3nMf3=!3_oJ)9{_`*I`||O0iEneQy<OCVys#a1B{4OY8-BiAYI^G6wRtP;C;#{P
zHq(0EJ^Q!n6TUCG|MJT{Sqa(urTZ-Xv!Xs<Je$A1^5e4)F}q)%|JMF8vS#w@omt<r
z^mS(l``>@~jeVK;*9Jb5{D=)dul(HdE=l~;IsThd*M9%9w`%&|zpCY1Wo^UvrI*D$
z<1kJxopt~0o4+#!<?~HUb#LtXbL#rcD}8&`-0Ml$adqOt(*36&PtL4A?{Sv>W$)^0
z-*=mT-YdTbiKrRhEp7E)%srCYW)*dPkImYZ5BGSdXI{Qt`)Bpvw}IQw-+jjS`Gfqw
z0}>*JZa12*emQq!zTNy6Hb&1_<85t=&%NFKA(cOV!|RN9v#s3EOY3dDY?_yJKRN5y
z)j6T--cMX36Q{P<>V$gp<He_sOuwaW<)6OmozJT|i)+5jyZP^m-+j$FXVzTyf8X^x
z$IkeCv0bD4yaN}1&;M>PzhakJ`B%NqAD5hO{Gpt)UTW9+J@e%3w(efp{OYBl_K%1B
zK1{Vdyw?v`RCVs!J9m2Ky6>fDtv7Doa&Bp!|Ep`!-gZ*8*FJtaoU&`0srHP^f2LNx
zd4A^WI-d)N3+8&t@?JO9l~k8`zh?5=8Y7FZXTGd?xz)Jl`NvH!cRzbNdH%k0C4WUL
zcl+CbGxyxj_gMG--|^(vUDI~Ckju;JzttQ(S0=l*_*KIDIi)3XpHnYe?_Hh!tKHtf
zLnC2>+&9&VNxo-=mn@C@Xq;R>q5j%i&%4%FY~EeooRTs3;L*!7ul#zTS3ISBx%&mZ
zINLeDAJ6{IbzEIsPu+(1(QRqnz5X^UpI&`f{3F=Cd9}@2<Ji-mUp9YyXnon#e*V9!
ze^MX*d|boyn6pCM`TOtdd&~Vx($wt#ZhpSq`TlR~$x-q>{pI&s*QY;zaOTGSiXZH4
z7ajH<eE9jL_q!b_Pj|h$x%PbQFWGN0UyoSYSK0kYDBhC57k}Mk&b;eBRUbAV&)IF1
zANqK~oWBo07rO6wwCL=fy+78UOW!y1RYKp~cU`aFUzrodXE*!&oX>Oo6TY(SS$%Ki
zu^)SjH(i_?>sv2!cH`-}la7DYDPOYuxalS7#n!Qpo9urwZ#FLLINtho!`@i;@2!>T
z{qOIrk^gw6$M)gV-~S$dn47D&)$+&9^_%uC|NeQ_)=L#qKhNg++M0gvvHM(=;Z}Xs
zwq4&+UgpirmGUQdSEoO(n^pPiN8hJsANEf=-}8Bn|AP4r_tf8Cd2+e>e9-4g|HHP$
zPg2wNKYskWdW-(8EWUNcXJ;~I{+j=%vGSRBdc^PG*UOi+e_VR*Wz6%~N&e>-+dIWo
z-?rYlk3IL<Z2z|(9QVDbF|pYEa=DnFUFm#TdH%C|zGNAzUH_$bzvlVmuN&*H+E40V
zp8nmYCT+H;t!>QH=;HO^pQfum@Bhr%qyAv-C%LNayTZFay(qV+efHq%$<>Qj9)6u@
zvNgtHX2y?%YW+jj%iBKvy8YkL`$(2RZmXV<Z*Heu)Q)$-+t+`+QZ?`DpMvk_?pXfS
zzI*Q49rt}(PaZv;A7*0|%zgg))}6iIOX95G@Z2|zFOHRenrT~{7VUj^=DNjC-+cP`
z?2ONE{kHA$7Bj!Rs(7*4Z@%+%%Tw{f&(DA6jG5n1t{%JJ{%rZ*SH++G4xI^{J^$~|
z2ahi<KlgBNnf=?Jx36!#bL5`n+u;Aa%i5ni`Az$xG`;uUzAv>eGql(9*jg_CyhGVU
zdtU6{7k?+u|2;eS{kJE4C*@zdf1kpC&iK9Q*PGvE7rp(oFW6@8ORJmz;*68OJux<3
z{`pzSvsb@f+RyrsR>tREuc}}C=qF2<zry<&kN;jZ-?ske;$6nE>W}ZczRLLd;K~H`
z8Jiz3o;mT?3!nJ3Z#(}sCeAt0<A49F*Z$)t*^3wcTeL&r{+*k9^jn(WF?=jAy}V}T
z#nUqw@762D_Q~DTJ7Ik>Z%<@JW$o_*<I8)hrY}DH?d-3KyU+MMQxlJq+qV7t<HYCH
ze6eN{eEjk!kH3zyeZS_s`ULe4FMdCqd)wC3>d9-nt>uO<{=Tg~a(U*w=Jp~R?K_os
zoB7V}_}f_M$#~*M?e#BiR$EML`O5nAW2$F^rzH2@GXMMSgHz4#Oh>CXbJv#JmHz%&
zwa)VGYsty^zGAah|JQo6^IdcEk2gnd&Y#B@?cLk|ef6hjcW&R`RSoJZT@`-uy=1BV
zp|8~^^ViAw)qR_J_5J!dyNvtBb9~-!Zcn@SmfuI;J3xZ#jNP9nUoO1)vSWew%H{p`
zcH+--eeSyJ-MMnheZHJ+&-(ADch<i?tD4Vdw^wT0@f?}@Jth`AyC42_e;)p4^PJeZ
z-nsstEhK#R?fkI0pP&8d<@FX;Pa4lYZrXeL@2u|j{XfrGpa02H=6}F?^QG`xPcA)f
zs{FoZ{x7%EZ(pmW?B+lFD*oy1@i&Ld^IrW*xUaeMX8Z3C?8hER%uGCEx%qyfc=6wY
zjo-|V-x7ac?X$l6z>`X=>$_xy<v-4tt5aW`W_JBMhyL-~n}d!YKF(eJ?#$Bjnf)?*
ztoGfFm46cX^k>vz+vd63*MHveZR@>16Svo%1dYV5J9oVN$yCdaHB9|>jPEa>dVlxz
z_rCetPMMn5uC`fMy!lyUiR}^g&DQg;<<%!FJHW%6F{kvG`?)()eRfp7dG<UrM>l@W
zR?F$vs>5PludbS!d5)Q{eSZ1n%gsgabp5k)`XeW>O%66cx9fX6Q@(x5^75sR-zA=Z
zlABk`zb|3W<;|zf^N%h5`QyoRyUl(!^A9ZcKd}4Cj9a@!=R{S_yLM~#-z`_3`P$X`
zRj)tuFTMI|@5;MNzt5`p&3svHVSyc!W1Q*Pq`!in);+sz|NM3M??T6Y$G9WytL&wg
z*NeP;@*Xw?Xi>Sj`Qa^NOWQfdPhK9B`Mv(`*Yxz=&tePb-oN@u`>)62eE<83zb1am
z+Lu17@X=3}Uz|3-`kvJGn%{V@$LD9eyP)i4`S%w;-$q_d+qUgg`)liC_hZiQ{M(p0
zNmBgG@lEUc^)CPXR+?+3XZ?o%y77m-^{<|NiJAAl@c+K#EbCu#S+jn(l>5in{PeM_
z{Tw@6_}s+htS{5HUW@rLr=WNGv$^Kn;&blk?f>*`4tOMIV%-wk+4JxF|2y)T^9kpf
z?}vA@zkC_Yo@r5>5q!M*(dO-oOTXIQNxj=RudcNI^Uq87{~b_>jgSw%{_^*S$GfIC
z+Z+@X-}kv@&&4YyGe2z7jt4hM^2MK69=ba(WzkI5vzKnK=U-(#|IU-t@O=fl58wYe
zZ@%r^?dEcln|D8Nw&}GMx8J#VkI&;X+rQ2HRekpFnYriQ=>KQ=wbx_q_j_!Gwb4~3
za+Og5XQxY^{eI@^yld&X^82c*n^*7rk`cT8`#1JwzLD3|qBgw#VRYj|sC?eJSuwxv
zZk(JaR`;$?Unc(7l^yFUpY!aMys+lM>f<^$c3+w4%m2*z_Q#VSSbm;4G}D#;zGZF6
zymKb$%m2Jtem%CyFTH$@<;C64=I@ww^0UW0aBt)j%dcARx&HTz-$!k*EKOTpw(H%R
zni}hSJ=GfLr_bFRE-#;NV3T)k=Fw!mJ%1Y`XYxd4?%3yYU5v%}_{&-I%{K16_{Ct3
z<iVOn4|h$Q9~pPUxN@Q7!8xJNR;{W3CeycA@@>CAzp=C3iRNy9+5G1zFAuJJJon$T
zpz}Uy&t@p|FD^ZMeP-nOGul7T6xhu+e|`isYBl41(Y?)e*B{OO`{(=QeYUaN&3^7X
zzPD<6?bClZO^b{Fzvb^a`qy<v^kLS+&y9_DRFsL&m|5}sWsZq$$@+{}S7W|+s%bkn
zSJ+9^T`N1q@_gpZm9N7$r({-joaZSuDLv1pf4ydpadUUST0Yx6aka~)`y;C=YtnZ;
zdw#jxE-HQ3v+4ZL_DtHZc7FbI;U7O(_ITgh`t#q*mzN%XKG~S|(MR|1oXhtjx0hcl
zR=3?_wc_|q#rbvN_y6hdezT!!k*gTXW5YdPPcA+GeE$ER^Yj1ByS(|0>3N;qFY=p<
z8f$jH)+qh(_ROEFU*10Vf4(=fb6<b;?vK&Gzx}<}`Le$3U;5u~&!uDL9sK?M|7QC?
z4}Vox?Em+4=9BCSJ<dII@6E3{zgz0wvwt(5|D5+#$7%1`U2pbCtpEN0!?y3o<?H__
zzW8v&pL<#Uy1x&LQ!*bGW>tK2IiK_U^W1wa-{bGMTi;GByYNQ(yVx0!;W6qz{-$Sq
zs{g&c{`cYfzw`fpK3xCrdHp@5^pC&mm@4J}{k{MHZ#!7}Wb=vNSKqI$`l_c^bKd^z
z_J^ELpYC}V#(uxA_SJ*?|Nq`+*NeK~6Z31`bDk=j{wv$<4W_UBx|qHF-9C2r*|mEr
zw%Yyw^_TtJ(J$YWEBCGZ81vz;<uCsUTmJw3#{AdpNtXQY=YOlxvi~tZy=brTF1IcH
z$?iLP-|E(OzhC?8ef5fdlh1np4S$(E=g+_Y`S_pZ@$>HgZs6Ycac6V-%$dJ#yeWv^
zUHd-a-}V0gf4|A!%m3d!Uti;PabdaKJtf##0Nd>?YFBRmRWyJ5{||h#1mE0?J$!!e
zzZ>!Yd!GE~pSpeF&*Xsr8bQzHEN8y%PpH~__UYyS56|EG7qI{D`kLo5KMQQcAO0z{
zYpi0bH2?JRU-kNX@r!TQJH*~wc=~nKU;d9$h1&f0H^0uVoITy_|IhO3=lAbbe?Q?+
zdVyX3jO|^^zpqrLU*0FW{Z!lSe~mMpFMSs(U939yDC^_D_v`=f&z~~Wd{Ni6U3#be
zy~;Be?hNhaw)*^UbAJ5u4+r-ZUw`}a)vfZEJI}6tbyD^9?`89>c<)Qp`&FmiKkvk=
z|IpX2`q{+hwdU8qp4xnAcJTj?{q=ty{{Q>g{{KV$|DW`$&qV(3n}0z5{=N47Kj;7d
z+`j+c>;3y|TleT&-n;qk>Y0CkKlsmmA9-fZz4hDFZ_K-Pcz65nkB^=<yFb7EKPP#I
zP7LoB6Tzwr>Q&V}%TAw_U3)nt(PsDMSvAG47VkbPTwC=e?ZZ>Ovnzl8UU%`uhR<(n
zm%f{M(>{Isy0$$pC(r%)&n|X%dXe2H+v>Ea*~Vc%_szH3XZNjr_U}Vm=l!}_lQ!o$
zXgK)6-A{3q|1Vj`uHSL(`EJX<Z$sIyeml(?{e1D|rjxhs?_2lu-NSGEXYwNA@2GBC
z@;c@7!`!v6pH%s8S$Y1Zw(Y#is=Vxzm($LQ+sa$@%-hu;xn*j&+Kp19Z(q)=U-3K6
z_WZws-Bvd%^*>L#dG%Y#y*cMTd|h+0bX{%j^OQ4le|{;N`_gJ&`sb4%w|wUOQa!c&
z)Nkqd?EWh!&wMwE>9d(redzS6O6&D``8(zm*nU41SO0Czv+}QR`FmUo#4~EI760_&
zpYC5@Sz30=;roky*;Y1}9%aVn?*Hw)>t@ZvtBzZL{yO*mRmIb=3c>qzZ$5o-FEm%*
zvwOzT+ctV~Ti@T_ckS%qlLybW8@KD7Z-0K&|H<a*ef4JV<<#f-FPPu(UF*j2>TQps
z!VjNYlD9A0y3q0a!IS>;`pi$~?YcMTUAnFDc6)=i!;*KtzBQL&|2VTT`fPVU-{aRc
zzph>SZh7g}^1k~uH=<rW>wo4ipZ_^+{j+20%s+R%-}QWN(085hIp^v&FP|32_vyg1
z!rqb_yB}rmE3Vm4`|#1<S9@aB=lLHH{&4T$&%Q@L`vbPwo-|+oZs)@^`Mjg)+a%YX
zzWj@?|C(|2kNqd}fAV}anjTfScBbfjsYhpC-0_;s{p`s4eFD;b*DT6i4<9TjTXt^a
z<aWOG>t3JV7ybO!>{<Dym-o!%?|+<`2b!2$GXHq&a<l5)(!r;fpW7HbkFQei*>?G}
zmuCe#&s%?HcIl&^EPeAD%BAEg7ysOT!A@q$OX<Z=_nuc*zh(3HeN%do(P|ssTlY6d
z1>gTC&7*uURq<csl=?51YCoo=$MOHR+nc;}`}d2t=3IUA?9A@+db^CeUnx&N7W`7z
z|KHKizAo+JgIBvRHGNMjnYZ0?v)cAg>vn|N?fbUs;hm|HXV31DRiEddV8{6W$`kpQ
zsn2&$f8&)sPfqV=O@ZUrtZ!YX=eYOnd~3RX>uq@n@#L&GyV&2oic_%O`DM!)&%1Il
z6;k!ey8q_goR?v_Bm4V}^P$ViXKni2`uzFJeXsxhd-!{@?MwAj?e$N8&#sjG(<y)c
zOl0Nk+2<4EwC{a$iGO<d;q%Rvs`l>-zdaZJz_KU(m*_g1vuDdqj2At3ZeF`G{QZ`n
zYiCZMb9j0D!&8?x|H}Kc-QK`OJTruwHT?98wI|K4|9oL*<2Yx}&4UGR7e1_zO3$7C
zhA;g0<EiE6&#ixVao6v5WBKbdX6-xWU%Rz@>iISM_TRMlD`@xFcGl)gRo|4q&z~2%
zZ|9pU=hJUQWo`a>c<%EWru8<A?}IkoTYmDT^wqLu?`wWNTXfQ)&N!{VUgYUn|8sFs
zJ3uSTPR#kzb78~Fy=vF&Qx~7wZoG@%zsBNc!sl3Zck}3ZZP(YoyCk>u@2}3i>QT>j
zMOXb?Fn4oaeAdr-y3N`Bdw%|^xaznoQha0Gg+Swee!u+e&1UJJR@a@|JH7Ybyv2X6
zZ2CX*&#Qgv<#vsCg+IhO?fddMc1}!{WvNkY`n-AOa(27+7OU5_r#b!n5_`M3`C)#2
zf|J^d$@3;YQ>ti=ZLs?-df#}_>$lT6@6W1AJ9L`O+Wqy+EXi7fJ9{sG&v-xQ`u76;
zI^$W>mzUaE)?ELzsp?*W1^fKCwrjTXPcq-^{BctDY3hSBkJR6#$vus(R<(a$@C`B)
zHM3l&qg#HyRgIm^UH9`3pYPsu|HsSD^AmmV+tjw!Y<jotQ(N)+1^n;d^80jHURY$Q
z5Eo@s^sqRsKGpu;n;H>oyIt#QvR}>gKNs6{vC`^tOnTLO<L~e9ta?}N^8W9;*7tjB
z*3NwT+x2zNth_ecPid!4pWXNQVv*YQo2wr`o@-^C{V)82ZQRMar?zo->z~!__CK(n
z^L<9a*L)-YhV9vL{vLL<=jYU%f3@aUpvm&`os;L9+&dF?7_=OibIl<(Nd=jl+;H{s
zlD?ucRr&bu7C#fNfAp&_UitGZ*E5s))NA(de}?@wUiow0#9dqWJ-%Y3K4(vq+KtU`
zj(#k)n<o=fz5dkp-KQU?TKOBR*IwW4^EqwJhT7Qmd$iXX$FAQ4imS!y7vA^Z+I{av
zY0b};*`;L<gFioPwtP5u-Qk<A^KbkMwf+2Zwzr#~tnBpK?e+#uf>-raQapZqTiI;+
zXJz4Lzx~$VPM_OXDRt(|6&uIeS0|6(pBHKu)Awd;^*iw!KP}Z~{odUz8|<w=zencD
zb3^?X$!#^&VLuBjSKHWaUi7@A_wjCtdv!NfzW2GlyQb))W$fdo`^NXH&;9!Tm*v;o
zx3_+ae>pkXOIALA!%y$e{}!9hQ>eT4viQxuGWqJ?neQg<%ig!ZKm88lr_Xo(9oRC#
ziha4c%MRO>zmxW8ulv0Emffv4XZhy$%c4xJ?LU6fR_3eA_x6jQ3-fn8GKxMoPa*%+
z`g7lXN)3+3Zo0p5|5wrD@^5NBzj{A+JE+lHaXsw+vPDmg&wp_{Ub%hY8q2fgXUzlk
z_UtNtc<K4#yeWp|PkXN!gT}xUB#QM9sW#{9)$rw=I}{&#zh>^jwE_R`-LcfS{B9ba
zpZ3FY`gC?byT4Z|?7H9Gw0>qAzPoVs9_yozo1+tLY}MuV+U`gwzWaS$sNKCei~n5x
zn7h9&?NGWqA8*@c`%=H`@Mp^_|8#;1onL!rzK^bc_FGIhQvROumecdTT>?$CReYa$
z=ggA+cKf}5HyO<O{E)xL!6ofZmWBVHnu8zytd87sv1r%(U#s5LfBR?Io;L5d$@+IW
ze;)p<-W?ebcfUB};jVX;{a4b~zcaSHcds+La(4H5_qc7<Gc#7o#@Wc*-jK7a%6|Cn
zX=T%<*zb3*)D(Q`fA$#E&;P|)vAn5r{ilORm%lIPOF#FeJ-?5C)>8gY+m|hKta-ku
z^}Kp%b><(Nm&Fz9?|yyWZf~%<_3X;(K>qG|{$HlH&+CcY{I2r+HQUS6kAAJ)we9fT
zri=YH?_~O=)_sfhd2j#X?AlkB*7HKQ?OfOY$^E{r@uJT&R+fkFx%W4%Zt3T=wD~D#
z=l)K4@$G@)-|DBo_odf@=8P-9@0osY|JC0f-qY+}SE!XM%Kf=$?Q-XQjP)|PxO;!U
zd@S=dzpV4)AwN%1I^X@nyQdvZ-DvfqM7FR0pVqzEuN`*;e>=0w@_W;}(k<#yud_1t
zMLK@Zde<@EuJ*mfspIL-*PQLTcfb01cAS{{eF^_Bb{FSne0q2V)MlA)J%8?VOVA*1
zMf%?FA0LKowRC@PdY<d|-}$>{8dP0>nQm9LBmMpS$km(wGGBhSFC^aMZBXyY%U8ct
zR{r8T{Pav@__y2VuWj7%zV!b;xiZsL#q(qDme01kpZv+TJN@XzD)--MclYhQye8#I
zLeWa;@XB3tc;ej7Z+}$T^lGYpOkeE5b?=`pF8_CFj{P}xgLwyPmMgW-UcNKd*7#-l
zy*m5b;{VV5C>M&8eKYIY<{;~0HMwna?-tq{7^g&BcpBs%A8%LXXR-Y6vkQrPK9=6!
z8tHEFeT(_#7Zc>xe*NIS`}e#}C)Ye%_oHC<&$H!o&+Ik+zI}iC$A<}@EsQT+PRw50
zKD~X<!SqjagUjtc*Q%YjFZ^|9<IkCvzdv(UFnzX-+-q+!^X6mqZT@$EA6mMc_3CBw
z^w+n=^QJz(yO8JayZ_Y&J)G<G3XW{OR%v>s@5;|7CoX>60xDC!Ej>5U@b{^@+e@E&
z-@o_ls=>W0e$T^Z%{g=N?{c%>XX>XE??0CE{NTYC@9x~Iz7uE{_57+qwcYIdcdznE
z%$GWs^J|~~>-1VX#`nBugkOGVy)Wax<3(-3gk|k%D*0|(>?Zr`pWpo`W2Wo-omrc|
z^veH}J|lDE*tHL5&*}?;Rxf?B`E};>@?xX1mk;M8hP{6H<o(a(=ViVd)wh1!qJQ&T
zIotg^cVu&arQM$wy6<`YvbeMRj^EuK{rv9Qoi*Y2&G$&1GVzno|NM4->F-IkX7<nL
z{(b+N^U2@Hxw7)>%hwcJcwBa_F|gjV|6*;1@#bBZyC(Cm>)W~dO}o8;;X0o-yH#JE
zW`gI^zOE~<`*SfhO}Cog`uy!X#^2xXi7Ed4?{l@w@q<t9y4Mx$b-r5}vv}s&y+P}r
znM|*?_;IpSUOzr7%A&@ibi?nN{_{VF{=B;Hb=&9XKUvoKAJ{$f-0$BfHouJd{qf+s
z$1m-+)^qO-=lgVGySVt7nYX6K{x1>V`R;J-4`$(y85P;KD}M6CW=_7W{#sbi^a%U!
z4=vee&wP9LN;yCKnZKX>U3T#)&9(gnHea4S%8koq%l{oT`=t5C=R011*>mapohQ|1
zYj@5){_fko)9%k-+VGv5`78X>w>cGdjaP*~<gGQ4>HltQqi0(8wXUsu`_^Ys-1hwI
zZ7*N`J|oiBKmF}f&U^n3_!#b0+|XQXu=Z!c+@+?|Z!J$ZS?;&*^*s4|HN}Uvvdhnj
zyY=Mk3!mbZwH0@aZSw`}v-jP*Ykak&($d3!zHt2GrIpW@PrtU~^mcXA`%m6y{+T=f
zyVa#L^XHv8aIoTRo?hwqk9SV*{@(dqc!vK0>uWXp<A1#DUcR$V|LNZ8d$j$ZZTAmT
zv+}!Jdtb52@Aa>juYXRz@Vo!E{EW(#U)nBMt%%cI&U)74?(~d(wI8>v-x|66eCGa|
z3hRU&)yqF$mOeYv_^Yw}KGV`?D<*sDuD<{F(BW^h1<%%O{`v9cZGZmhhuL3#5BPUt
z`|Qdoxo<W0e}4O8U%HKT{O7rrufbX8FX#U1@WmfLm-KU2eJ`*zmx{Bi^80b^%7<6K
zz7;<^`{UV<AGJS>{bft?>JxanHlBSbJYx>y!+t;gZh!u#Zw<QjF8{uIF=+P1+D~Z?
zo15I1KYv@3_Gwvoxmrzj(PV!&yA$GZ`;1Fw{wTV1`tzBZ8k2to=jNQ0-kbfe)7bv&
zm;N)6PYe2=mG6_yx2w5wy#CQomS?~3zn>s=uD<@)3!8%<c0^V`diZ?e!S6nIj##>@
z*_rlCk6+vW{~Nm+<3fdEpL0)sEG|E5zft@$X!*~N*|UFUe2M%XYkhrdPTAX68Sc+D
z%*$UUK0C$!xwGxH)xC2k%iQ?PL5qUwHaA(GT|Rwg>F=^qqurNh&VBymy!wabA6S0H
zzOyQi|NHyn`+oBqr6qFr_dkDNwRoBD|2IFI=DxLxdVb~LkBaoUG3Va$_at~cyu$hF
z`Gi<C%j2w<%6;35#q4hUR`;J>xjUg~<=2C;%PQ-B-rK+WX==Lt&oi0*xBh%NdBW8H
zHILrDlrOf-_O>s7W*(dq3mSj&J2tbl=KHxbcRu^?{Ty7q<bTe;iL%R|`~T<sVtv1K
zzx~Ru2Y*yF^W}ZpbXNZAW&7%z3Gd(RGKPryUEgkRz|>YU;hJNqiMyNplkB|E@1Qv|
z?JB#9--W%O^^87ReEJo;>}%*<<HhIew%(4t-9LHyW@8(Fi|@yM=Tz?gV0_>B>f5RO
z&rYmPe7A6)NWT4<g%8!&rTLu?%s)TzxySFEe;MCa{@ph3z^mBU!oO?(O7kA?&R%kU
z&A$J#rM~qnZ~M(nP58?N@73=}uKs!W?!N;|G8Jq6irZK}>Mh;BtgqhgvFXWqUq0<C
zsFJTcp`FfG_pL~KN~6u)a^LwU9{($;sggQpyV!I&e>?wklj*yjA6cA#|Bh|?(bM}+
z`Tw7ze*1U2+j-$B&0zHwws*^Ii__~t`TK<R=Bj+P>G$?epQmj9_u~Vr>oMmmw@iCJ
z|8HOa`u7+2WvsT8|93!Tj(=a`=KOu^pAKHzbuMS#mG6A(_r9GUv*)sX^~?{o`gS*F
z&0@Q|^!K`#)+W>MMM~-IwfYBIr`_o{`67Gq6aBN*_igO=npU4#WLh@weC&fK>2|f}
zzU-Z~-|zRge`j}IeEz1OW+iAg_$SM!a~1gs_asaIR7v>C+V17IkGuc5;9#|S^{*Mt
z*N;!Os=2SbXP@zo7nZiqPwD)V?g`KrGP9|@-qw2f^yQQn0{8c=d;fFUJiFa*m%l#y
z>@xe|w||14A7;0&u1b41`|_M!`?>XA2+wU_cmB+}%g;}+S=WcIw?F$RpZ9q2mS%G~
z(?6!q^{3m`&+$*NVSJwxV0-`n&Cimm(mmz>Zg=FTrO3NlpP6O-;@kIq1;5r+oA2Fu
zyS{njnNKqcZ3V>RKmU4GA-#JW_w;}FGT*N|cUOLAec9ReNi!|J=JnUS{{HU&ig$dM
z-}^nR&cA;0S@Uek&FcB#&(FT(iGQws-ST_K^4DLUU8-8P%Q*J*<EEc8Zq}Ulf4d|7
zS9Rq~&{C;trhE49Lz9i}d48=4KiqzJ`TNU1pY><WTrg|@_X}_R=S!&-hs?eSnwRL7
zD3iJODXxqAQ|i5Se%ngzDg?Ff|5<Z(mSnAgq~(i$!Y_-SwTC<3>nwYG_K<z|Zp(*v
zkDmFq&Z4Slu6etjG*A2Vmo|OjV)AdSA}b|pYy8r$Tzqu);ZoMZwX2^hyjT8t#^U@>
z78}O**~upFMdbPT)7SmoJZ<Kld3@^g?Ph(q%lLog8BdkL@~`XGzxw+8Ex*s?y*7I`
zoNjsS`S!!o{QS>*4n8|O`$Yfs!_UqhJ_s5^nQ`-C?X2zQH){60tk%o_edyx_`)1qI
zaxzEOmmPO*e`oypW#I(#9jA_8|D%<D?90*WDf$2J=v!Cr4y!p|t#W@eXhrMae@`+i
z+CTiN3wrp%;Ld7yv9!LO#m}Ck=d;<_o?CPC@xxF5Z6%l!&q!XWef8|h1*XW_=eK6x
z+Sq<iivP(~_CkX>kt>TAnJ#Y&zy39Shs@`Sge_Ox_f-^C<^R4Ke*Knv_8A-FkMB4S
zr`zerZ?Jv&bJ;bUwU(w&IG>rUZ(D0#&bjY@MjY?cpW*j4rQ-PPW|{v7567RVej3|!
zac}<0+5Yo4KRQ&dS37^Fwp5@0y*~>M-<DXr_tS>b;)Ln~aEoT*PE+x`a~BG}EU0?w
z+ct03^5V6}Kff}xt~8!)ynW|B_X^8<^QKzK*~Mk7ll!JKZ{F@trOWnCeqU$0yR`b&
z^{UVA_g-eNzjf!E*>UkNo#N-EbM)qYJ9+GSP1W<6d(Lz|7rtTJxF@}KPyE^SJI={m
z-Lzrv&4;$j58t~#Gt&RQR{!jqq5mK9pIPh}zli-@w=4Ja$v15rYp+{G-q=}Cn{oE;
z>bE)Z=Re9E`gvye%co66Gqu@&W^O39_TOXq@!aM|%hJEC_9^~rn`TzK=kn%L?T635
z-*#%fg>hKrt&4Lj_9^YJ5>qd?V|+hf{o?zL-{+g{J$rxk*({%2`7O$`&cFM+{qmVF
z#eDoZ`h0$G56jQc<XXF7Z|%a0#Sa%qzWn@fp}Bbe=Pcu<Z`<3l@2|_tKW`w-zC2$3
zu6j&X$Ncgca=T)FRY>Xk{(bQ`W6nR0{yl4V9-mYCBr@}C>a>0H1@$uYm#9kn>EFMj
zHGj_Kd*Pp+ff_Y7jeDGH_srH_Tf6z)oh!S(|Ens`yjN{eYWMStw*P(QU$3^b=dHJ^
z_|3doh__Mp&8|}MW2V279_~7)V^@6n@dEwXacAY{%#q2-zrHrz&CcS+=h@zGlb6+e
zUI|)Lv`f-h+HU5YmwPAV+rRkrqe#KdV(;40y{ER#+htq)ZlapC?aapJkF)N^WXaD9
zwVQYTnel%cP^)IaefReg{@FWZ-)%~}u=lj1l-}mYi`Rbn_G#y2*{Vw0Ir~0nzx&4C
zc7wa{!UyFydzOB>cx6k%=TDc#>q>uQ-kr@@*|*{I$5OLda<i6Bzs`QOSngg-q^+&Q
zxr586FDyOJUMW?rS9kQ{yN7|>w%(ol=;qHuryajvT>ok9%7?~~wV2gRf8V{cIeY&5
z*6Q~e1*X&Gdfn%Vg?#?{FLM1iAOG*)9;Vg*W<G47FS2iXnQn1Q@j{z>)6esiPSCH(
zin(r7v^vgi#^vJmXFi^PdEI&U<<-ySK=W@_i}^my+WP3p(_Qm_W>`M_T_U#sQHF7U
zy_o!5<Jzhh>t0^1o&I6Z!>a*mdw*%%zZE&(|G`c52YV-<w!Z#;uAN=ndo?||TW4l@
zPmlcg(CU0~%d<~A-mlyLxAA4SM3Uv13G06H%)fE(oLPR`--`vYr%zw1NUVuH&072<
zc>DU-8LKZxRz2U<_pWc{;<Ggtl3RTO=GO4}=}x{U^Yu&HdCvD|&U76=c>dYhN|x&D
z=l1{R`*{A(o5z)E^8YK(sehQMe&PLtcXzqv<Eu9pfBQIdVV?i>)ioABuk_EEcQf+0
z@#3Gi<!A6MOKWQSm5?4b{qfS5iO;XD-uX`0cUnK&=GEE%K5Xtg|5D0)<LBVlHP=7B
ze41Dx)iZ6DyWL)Y3%j@*b^8*|Y4z8e)JuM`)0Rws_VMP+l3wdW>3@r_ojG6kEB*hP
z`e*0=)iC|#J9}&Y{12b+^XF$<_?t=^E7<#Q*!oO<Wp#R1?faLzzAxSPw^31Ik~b&Y
zOFiyP@x#sbVUfFyobF1*>1{nc*{<rBsQYwd?R)DjY~5`y&bueuUu}MWj%7)4)2EfG
z1-)Mq`XX(1e95w~teJ2vChPdTFR_<Fi=gs<a{e%%`ToZH{Z(Jz^Iy04{BrU3<>{BC
zgYB!I{e9c;EnP3);`ulBW2usoQmo6x<@2x4eLL&8YGy^P!1GT9Rgbds(<@&Z{F!ro
z)}15nHpZ9lhsrH)pL=wt`kZ+`DxzOo?Xr3QW_kV9?|PMX#b0|(JYMh1{&nQ#%YCnB
zUiSC@9{YJdcx}1+dyni_f22=dWWW0FugUgXN3R!$6<hCK{dQUT{?*m__pk1qWo%yY
zn^|}<|7LxK1^MwNHP_w6P1oDb_4PHju6^~aa8vF2Ym1)GV6DD(_2XG*?)#-xKd<!9
zvsB($V7ofIPA32Jjx$~7(@kfKAIqL*!*gEzT%maNlaC))W<I=PV)3*3=L^eE*WV@k
z8(Ys?clq;@b1&oW&Rn;?^YiofFFDWL-(Q~cl_%q5iR^m28UE*wemrr0U-_p86<@9A
z?0a{$xGc@}@anf7@0+>r{X3xY;_!@p{I)T#eq0GqoAoQH>i@<^FV>#D`HVe$^W?9c
zbx#bl-%Ysxc0%@?(qHL*_0QKmziTx4-hE#2FP-O{ukV(Q%dh)!ZhgtUA6G8i*_r?9
z+k=P3KU0cQc9m`KURd|x(7BSmr?0Qr{6`kli+<xS!1w>e@BOFL=C9dP`LRs*cFgtN
z->0*GyHil{`)%g^HD5pN{r!!7*-5iy?^53yTg(v7efrkt`t>Wnmg`$xwVc2H`9GQO
z+s}WV`TbAM`|7inpMPJzt6p3G|BL&~o$c4ZH_e=Ux%yJM-7K5;%9X}XC!fuXv)@_$
z`Dv5o{Il`P=h)Y4`!BeE|8DuGb1v_#YX8?axt~7nV>;)j?EISj*FReBp2c_9k^kw#
zJHl~cXJ<=p&RZ|L<I8q?gS{E4Iep^0JZyF(*qvLq?C`gTQqkeJ-=B8gWfNaf8Xy~=
zJ@@|Alc&~xP}=wR#?zPX8SXZ#E#KYW_tMn9(m3Jy;hE0n-Tddf<9}9(&6k-nJH!9;
z=665Ws{Y>l>1Odf`?cyDs>S>6&HvYCtpD8p*UN)-=c|uBN&S#^>cZE9&vreFEOfWD
ze%kb|dGdT4+5Bm{S@P=>csPv?$+dLn%T4E&mtSx5zi;~EY8K<uH5%J*H9yXLQ&Y3&
zto+Z#Cl3^yEWcm+r8<4P{mwIsoIfXi-r;6dGQZ+e=Dy;Zf?pNt=j{#cW-i$Ed2XiN
zz4_Mn%Pn8We;59s_jFq9ZqvM^FLmdCgxCBwI-dUN<Tp91oZPMIcix@YHgBi(JpHQQ
zmwxXE-}B7mlA`WE{lE46YRtttyUOnCxt?ZyR5)>6YM9L0!gre%8*ZJuviQvO<%d_l
z{&m?lecj&6!uqvYcfX&x()asi`HO#RA19cUKQx}-&i8on(!6=s=13iT+;ZBmpWW?o
zX8bFeTYLX}iM@RP(@W#SaT0c4m48;8|NOd&scw0#w#<^3i9gnTb$s9cz3JMX|B`3F
z9J%ezmY!Z9Co|{Qo3mMR?3urgW$c{)ULbc~_`CU%;L({`bz4Qu|L&a8efrZm@5j|{
z)nQfD@@vn6wsY+%Fmn9*<x%3Nk0%~4{JELG|Fx{e&hwA5%8H-)pR+x*dZAD9^T&_h
z*8JYxx4gFh$=UOB&YixrcrD-GtADbdo&3AU|G@hV^~Wt<xK(xVpZl&Z6MvrX{SWzx
zOW)W0N(uj|thY1${KY*}r~RyucxU|GzpnJ%zs5-08wEQfvUkJ@ookmrc0KCX%8x9?
zkLtgjNZBU5?)Qfpn;jqi*z~Ubdgi6!`oe2}|1Lh8{Orm6x8cRJqHFv2Men(r{$ES}
z-15J>Yu=lFj<d7MfBy7A-hb_%rw@HTe*PcJpLJD*#h=S%;$OcycBM#vul@V!hUxdt
zuCv_zyYl?Ji(4bD&wYPUd2&aza{tUNmb34DkFB)6{<YoSplxen_~*2ZPj~ENSo^%?
zai*-ezMR?gTkEd4yVw2tda?3M<lW|D=ar?898CG~wD9AK%(;i(2JHJPdi~eBZ?Z3J
z+popc{JQ$RTaEqaWZvb|^Yf<qpUZq7I8Tk;9<&~0eJ#_y&bwFs+>^O?@}>GI*2R^_
zZ?!jHeDP_=?SJKpHh%ZkDZIV=Z?ar{ORe~4wdMICv*+&n{Brj1Q@`tf+;5&KUZ{9u
z`hlG*?(x(lKM&uUlXmi>@7n6!;Th+=xXnw8KlZ+xbZ4F2rK)dhHnUHc{B}!tiGThd
z%P-mA-#$NgJ~6!Nx7@`?FLSEO4>(8tdbaBs=OgL6x-r*3S{K{brNy0{UH<60J>!1s
z$-m35NzK!@*!jh>?))o-_ooiKd(Yo|`p5j0A9gR7i(78<eRKJ&+vP83U1zI){(b(Q
zxN~wgJ@+>Mc>l2dKilCu&V>h`#V#qG_wq6C`o8d9{$DPO*$-R)0Bs7B;r+%FbD=H<
zv;^tm)w8EB-%5XWB=%lUf(@VD-ddBG?{D+#Lch;jxqaJg%lDV}WmILf*G<j$oqK21
zzk8M6Z9itubEu2|{NPVr^Nxy-EC22*y!$xePwj`3C3kCoT)Q&!^46W-UdJCibHdQR
zBl>J{{O+%Np1t{TFSRWvd5gQ>?`ic3F)uP^D879gb*(k?Ww89ymo{@V^{mfq%|E_%
z-mN*$!Z$z4UN3cj=DMG6x~@r9r9bk$e=k(-`oAmZ=46I{S@$#kp!;*5`Et9mt4i;y
z+vHc6#;NW7RsF2`TcrIrmOtkny|eoJs=V#-*WJ8k>gVtO{c@~%c4?8N?egy{9tYk}
zYpt=Ldwg%xvoGr^)1~sit*Ct4H(gD9j!pla)i;Xs>JxO%U0C;CH#7hG$*+qt?z;1<
zFYaqE|8@EC4<q&Cb0Xu9ob5lirl_p*bz=Ije{bK*&Yj#V7bhp5_iOg#jjO+x$nJe!
za(7>B?mz7tyPw&fvA*?t`GoJbb^SYj-!-+bfB)Ay_x`H9^_DvljEXk*oqJrayqf=9
zP4%w6aDM%te=6+LUfyoc&iTJ;TK*fWnKg&bT2+5o`SZiUIUoG4KYX*uKj;6teSaHY
zo-WzTeJ=Ix?ip|1%wB#lV`b$of7_pLa{YhJ<e#ow{dQh;!(8*@a~H3?dz3G#!ZOO}
zo!0$-SDu}m-8dgS#kHnt`{lVmnk?t;H#%;=y#CwVce@`f2e0B@{WJZ(rK$h<Dz*G`
z`MkExHS5=1KA-N!zrO9$uLXN%nSK8C!p6vC^PTSXzn^_5x^U-(U-rXiGW$9|ZY{rN
zYi_zXd(Pfp2{n5h<+lEQVJ*#TpS|-(>Y=k$&t9Ir|L;IVl16ZWXi2B&r^{*iW$(T2
z?%CU0QrtZEG4J`^j~3NGn{oI4>i3QFHPXw!oZG3L_vlPIpZ}|w`F^rz47DrW_k9&T
z{(tI??-i+e&v&0&b94Q(?aN=ge_lOvKkK`D@AuEYddhm|7fXXm)AwE7$F83*eR|aN
zo8QkDZw>8Z&be6H{T19+9(sGe<i*SDEq>iG-Fxxy+7C|q{uc1>`}WD<-j~(8(!czD
z3YrNsY<srr{>QhTd#yj|t!bZ|t+!SG;NpDw+@h)-pL~0lPdxrN^T(Iq;`13bHZN-z
zeSgS1eb@7r%jNr?AA3B*bno5IY(Jmd*yMkYy{s-**|)_q{px?YPww|WdVJoqZ29kX
zKl|(c|NZyzu%)+rNcp~<XD)oVsgsF6KPT$fxtY>>?)>^s4)(u%z3;VUlUT^^>2@<K
z^@|@pJkEMH`fSGhS?A?yCS02{i|z34^G{MhDfKl&UnIZ!{JJa~?K4Yn&5wG2=<f2o
zxVzPr&)&TB)X#UX&Uov6ce(A^<;!NyjXP_-^M%cpo8MzfpPghoe0qJ^$5XG*a+d9@
zy?nX$y3xa3dH$~|i>A*xS7Q5j^Yr|G+o#3Xy5FCE?f%Z!KPu9eZ9TW*X~Jg<318dq
zE$7|u-FucEr>`tu^5pV%|NC(<A2u(4zUuAy98=vH{C4xM9eUnuyx92Fx02kl;+dD*
zms|e3cEzN_Urs#d-#2!(CH_8_XDF7G8Z2jzn|Zvx>{`w5>azRGU*9wNY<pWL#-RAa
zvkRFO9@pOo?E4#g+H|_r{FKiZkFTCzdj8>in^?PfGSycmoRhz2X#Y3-N%gxmo9j#O
ztluhnz3O~aW%wPl`-iIkhWz{c^ZShOPje%$_W${J$I)&@oyz;2r)*|#mp_%h?r+-b
z$8V#|EIwPvZT=G9Y8$?H*W%wh!)<C`JbW7dIpf)kgR}3wdG<qXoBLhsAB!(Gm-+1d
zd0Sp$$w4*;=O15!kK1?Knj1gA^TqO=`Rne8T{bzfvU`>vzg+%0%Fd$yx8J_cyRB~S
z3$J-5d$p|e-kfuvSwF5ct~RxwbGdX!_0NiwrdJ;<-<7}JSNZkexf0pjXNP6y`aeJZ
zVSerZ-|r87pYi+S&Skp--)5`4cR9^|ocr->D_i~CXLtM8e}3zGuQOaP=6Bz#nb*y~
z{d;B~{Qb<;zsv6Jwh^E6XYu|0#jhUBxgB+Vulk=?>$K1H>^%PW<#u}mv4av;J^ZU4
zZ=6$}WMlawGXBUy|8spaO)pQ+im7~gawg~5Sr+e&o}XG@v%~H4^EuCczAr4fe>zs-
zu8m!dfy}+RUuv}N=FLg}H2uJB{_3aAWu~j5=Wnh4;MZf%ZvXmzQQh~shkxHY|L5N$
z-!QpHw$Zg;>?SXN+-y1Fp7E^PSKrPrO<(qH=Dj-$-Y-5EQ@Y`G#ZT$fXLBc&mYMD?
ze17(vOx5C9@9HW#^7ru6{x1B@oXnv(qd~xKZ?a>RomG!m{P$S*{pHW*eM=XUy|j3%
z+`e-E`YJ1*v|kyM=YPJuzvxW+UiS37Dytmb($AkJl>fSP{PJhe&MNEbn<tl-Tjl#3
zJl8m1tiS(Oa@hxe)BV5V&fDw{t@~<Ic0RH$$^LvsUHjSDH$B>)eKP5vEmvDm74<u=
zwCvfuGWM(P-{1e<qW?#^a^Aent8OoUSNm|@&i#@_H*bEv^YHNh*c8R`#%EUp^lJND
zOKP^%|5{$Z>+ON>;@#=x_x^qR|KVG9_3xkm?DeYGAKqK^#&*|x?c)9JYUf`a|Nrmf
z)A#SoH}0DKe8Z)Jx#5Q^f~@B)ugfYj*!OZ`?%Pk*=hy$s4K4fg@ch4mYPHpSeg+@D
z{qVPcoc{mv`tRlTe}2~gz0Uvtqx^rxU)_oSqbt7tEw8*E|3CZazjHem|JSMb`uq32
zgQxd=l;0%&>0JN+s%rUvU*rFOZLj}1y?*E8KYRB4{`a%r`TYvrzjvd4x7Yt@e_Q|W
zQ>9#*uU+l={`{k@`~RBHuyk2bS!%L;r_NRh{^j;H^@2B_r7RHFykQ!<ExlA$-ao6H
zJMP_N`-Gj>fB)b0<MZum`%P(aU%pS@{CaL4-yZY+^Evk|{~uhnFVWWjclE!1`+pUZ
z;^)4b?ce`D_4@Dc`+wZ~pEu*FUX_HM^_PS9n)}Z`<ouP=_WQsO{d?Q<=T3e<Cw&5Q
z@b`aTP9FI8@8OxeGx8r!pPcpmJ@4K3SrPxY<ga~q^IYj(|CsrXCHwzhagUVhxqs65
z#L4RSCB4}u>~6vASLe<&<$oi2dG@_>-m<gVeg$7U`_;F;e=B>U+)wt*|5J_Acimfl
zdro=Y^7}Q0J<i-^wmI9k?f=|<>;3w7(*w?jd@tX}Tc>~L@aKlKlc#2`eE$01xBCgV
z<~U9>e9ZH*?&#M&FaG@h(f_|<=G=Y7)1P(M-MIQ#&HQ&oVZqepj+Xao@}rVVq~7;s
z|DAg4-r_eC)0g_@eY@G(ytlq+^M9XvYdTl|)jt2^i}8Q)`j6uFf9n6A|Nr-J{NJnb
zclW)1b#M2c`}L1ESC&_$u;;%&P}~1Ud2_$b7JJn{kN^LWxBnCW|8@P}59als&9|37
zdU5ktp7wcVDgG~dXXW@8FK^o$&s(YY?7MvM>$+cyEw|enbWF7rFW&jWc2E0HqYde0
zy7DnkZ~yk%yX$q=={Gy=@9e2hPhFP&>`d#$-zT>BW#3<C_sOl;Xn%E0@#W2z!eY|S
z{%-HS?jvz8Gw)gE<o7vQ*0YW~M*Xr|EqnIwtk3hh-!D1;z4*Q8x_$LKX7X=8bz6P$
z^y{bDix;_P+tz%ydH7$%|K0ujiuZl_fB$}FU3UKQ?(J=}Gu$`v>DkJCx^U}uOjcBK
z*7En+b+2Rf{~wSL$=Q7HY^m<?<?XdIBh&f%<k>&ETa<tQn{l>u?#_1xKfipcv8lNE
zLc2FFtfuybg<S_|6<6$T_u|cY{?E$po37ot&iMM?5505WSKVvBR`bkc|LVI3<Bazy
z&5!(<US^^_Z(sDUIg8JHIsZ??et-I&xy!%*i&THCGW+t*Ylkl1GPnKp?U9<@qnR_~
zgYTbzGV!_j`+N8I*O%8^JbUzPUDcU4l}3BM+uS@l`PQ0eyZX}S-Tp6kMkK7ZZKukU
z%g2ptP40ERo!;-xcka$A|GM(3^K({ikCzWAx3gB$-~FjIT2?aZ`!n|P%ALpD_oS8U
zeLb^n{nlsIZZ?;XOUKPUvufIM)~mZ~KHoR4-&tIH^XlGx&;R|K7yt9mEA802@|%x;
z^t~*%dH==afAo4=_5Jnt#qH<&e%@pAch2Frd)_|ZXm87R>^}Q^pX+zq^L^!(=fC-F
z|CL?Mxn-ei?aFT}A9uH}|D1MY_O8934$ADz{{F|mGNZhz^gU>$+NYBzcJIHv*63l%
zleF{7^0L#b%B$|3`+Q<fO1WLl`&YN_{ivvxi&NWM_4IY+mvbe)?Q56b`{@2V^WS3g
z;%6~(pC5jC`(ts9k>&b(|7YEMzWDpUm)D)YU-*A-WBu{JI%VfGkE>hP^S=!}TycAS
z|2biv{@JBvpO&0^x#riZnEG`VRrjBN10Ai!{dU9N*yHcJm-JohE;Ks0?(x(1lO<>K
z!#><BHc5W>>Ym)s1iOz9cJ=N5Y!dhLN5P+ha}QphS#$Zl-}CT!_jX@8{IzG@;<JC=
z#Gm~>=iba+Th~R;u6Z}{^1LtB_xtuwpWa-?R^0dL;?o5_2I@cU-g4XjE|~kW>N$V?
zysyGLzW)h3e}BojGTFVwuM%qZZ0<Xk+`h(6!~XS`%l5xxw}D15_xbQ=6;FHTm%ghn
z-aZ|4z7)T`KF|Cp`8%nPN`G7~_iZl@`<?koKz_Z|tX=8t(~Yh7)ugc<Pxm|jqQ`1R
z@s#(GA7$s>D}Qo3^PTg2Te}<OfuGOUeVW^UEPr1d-y`|6v%hD>@!9Q;=Ueyb^X?tR
z0qb@y{uTNE;+p%rw*87d^W6M*o!ZIEyN?~64cf<O{^CK}{hJxam;YV)^W)}u8&Ioc
z2G30K!;u9oZO0eSyV3pg(ZSpO***XNr@wz!mmh!q(}MpuvfrAUNprdCwDOwX6^K6S
zbZ~_xyOfTLhjg?1F_(`24ab=MeQdrRu|L4f-@&e?#<G~VQ=c(OhcmZBL`QJ@kq_5`
z1S&JlH^jewFO^(-Y){?ynthMW>x$29{T@|p$N#hM^}hALcfI>9d0y)C&v#qDahJ%>
zZhS2xekSYx%*t;!_w_BFvD2>Nciz68*KB83^aVYBe9+X*_qrjk-cAWWKKT&uJyEvB
zq4l9L?-xJ*GJmJ7>He<53vu^F_P^i#@veR2zuwY6H=bO3R<8M7I=1kx@voIfO^;pP
z^&~B}J9u~L*SJbO{TXu0Dq8$6zPfn$XYIo$a#bF)Z8qBdnE5%@Id0ZD>#+GAmw)%O
z-LINcyRPJ7#VzZ{8DD1BK7BiLj*Q!C`S|Mv!poO^?py9(*WFgu`sZBz(w)cl>ix^U
zUwD0=jrxP_rMXqv&*ty{wpFj@(^R`X%m3OO{Pyzqruw=wm;CQlR34OIyM3kbjLF>>
z8q0k74c|TqS{^vN@^h!I)s3xvi<i&57uuWF`fbs*+OtR2ZaM4v+;jiB(!PGPjj4P~
zg85fD)>UR-IaGRQ){#j4*Y@R=zn<T@9&Ekm{$KyU`=bB9o8Ms1{rC1O3+owDKi8Pf
zmphqwyyjuWnKv;qwPI&2t^dujs{Qb(<b}o0r>v7z+RQqGPrs_VZe^!EzqV{`a@RAV
z=O@)ZpIAI~dw$)_>|Z~2&AahRqFj61_T=hpzdQF?#lI}^TdcQTe~-<H`4z9yZEt0K
z2)G~pNB#3(_I^3Xy~5uYwZ`sNtqZ)byLWrq`~$148n3>$-yggGzJhP@qo2?7pOt)@
zeMk818`-;GKHTg2_1ZMOB=$VJ{)`EKU5`kyTF+}X+1vK#qRdgVRdOX37RDbwO`WE$
zv8=zoC`-S&IKC=%TGaWs7GLjOH|>wxY;XT&m&J{LXClvTGXMHAod3RIY;n?!&o9?2
z%AXDXTk|3H@2{LY>IEfCb(<Xx-~Rc#R8Fs7;@IVX%Jc5`9Q)Qj|8unVGtRE7x7Odg
z^ORNCsOgxP+)=hw&e9DP5_QL_eEa9L^Pj6def8%T&U~>Yb8pNG?b+Ry=CZi{__y1;
z)~RoMbe(yd{T#bjA0IW#x}V;E>Fb@ovkhs!Ip?+NLjT>oZKpPWPxdqa*z9HPWsmI`
z)gOGnq|ujl?C0H9?y{cQ^X4rU&#}KNc<iva@1DI^7DPSotX^gjWxDS)w_Bj1n!kB?
z{L8~fH%D#%@a)2&XNAJXll2N;nVemoW-6asBqx#k`Q+|te>Pq%UUu!yhmv21pB47L
zy3mvH$>hBIWsA}+XX7usA7@@%f3<FJc<t2%Kj(JGU%8*Y;c+dKW#gY^&))yP^**OG
z>+^Ss{rl2hoV;K9Z{@<)>#wp5<Z6HR7cAZVCx7D7M3xP+&m@`{+**0?<;we7;mu}T
zyTh}e)$F}}T>8joN2&XXOS{!pr*Da?3A4R?vj4)Gb&nIW_FjLow}0LCcPIRr`~N)L
zyy*0$e*R_Ce$3LFwdP*=>-g6HHi>)BuS=a)`(<9#<ce2U%-;z|%ysxbZ@1mgf3dN@
zjh9Y~v)P=VeI+dB`j=O=or@pOx7zwFJSyhPba9_aYxK@7oIC$2|9*@7*H(S$&wkmo
zRlT0L$MRpnOvZ4Vb=9iZ)_=cYSety@w)oeg>Y1teFCYFkU0z=NO+b%d{w-JZarxNK
zZ(q;5n6lOX%=zx=?D-!*AJkvEKmBdR`~x<PSKm)R_I^H_ec`pw*8JE1bj_~qE2_^+
zczx!@EDO`Z>a;cN|2{RnbdpkyFEngh?y1+-pBc3M%cT2FHhcH?ea(1x>)xXIwzp?n
z{dY0FQ5!XTS5#8=(Ur0f??jiJow@r_M&_9f{ohLN{8D~<<%Mj>>>aCGU*FX3wOf5_
z_e=lxd%tm>5uQ=6)>pUxqpz;t`G2|R?SfAix1@c1$$MD6?b*TLhqAnW{*@-Ouf_j;
zYVu4fWtN`Fn^Ez?WWERc&zFZDXRLdeW&h=uiQLQZ&p*G+mN@TqdCtCqZwua9<z>mA
ze%r2BtF!f4(B#?kWyGH}|6-l}nBV^I!%ZKa=e)hXdE&nl_cz~8|NlogdiAwC$#wI3
zf3wUvu=W1=i|@_v{n!+BdE-9yi^}q=@2~xrd$su54@Lj?>N5K+Zp`YNUwzO(*zxS7
z=L@s#HXd~sKQsBLKljzAB?9&r*L<jYupsJ_&Be}i`>o$Pn%^FOJSkoE{3Y!f>e*TT
zPyV*=l97A4ThGitPyS@OZp`(}S>fB;AM`BVUc+uzQ+?>>=_k97NzbwRcWw6GRa@U_
z>^my|KJGWmGtMvX_tw{!{QaGqd;Fr``!%n(JME9(I&bDID?6*g^E0bw?7CJabN7qg
z5C4goB3p8_cAh;G^|{l!zl`rG|E0%P=F*p94u5mMe(&nOFN+>eKQH&??CaCo*OevC
z9a4WDc)0Z5uV>+f=VyLhC;N5I@6J9m)55CtkHkNg$Jgy`est|?jm`Qy-=F9EAOEub
z$JaYM{1^Bi$Ul?sAt&;C?$P$wa-EASPZ{+uFE(zv{%e`rX?^~#=yqfAbC&1#CU877
zIni8MHNnDTx?RcJ!2W6aw`P83-~8j;&BybD_4%I}?tX0PzSg#L^N*w7{H5!D6~6V%
zDLr41c6P=;*MReu+23Bhzxes%pOZ)LCNI6b+*Wq=;dPzONuST~FH5_)b$Rlx=s#Pe
zzjK}u{_vag{rBhPZntZ8e7g|iTsP~-?)E*;)%f~_mmmM~=*&aI^_6!__v}fKh`w|9
z@aaSgJ84he>xTC0rF7rS>)c$CR&&;P>uQ@jTjjoaT>pLGsQ+^DyjPPSS6ou>E<bj%
zGOgyU@LS#0)jqZ7eRH2ZymkNMmF36y!~d--z4Pyfj&ZZejvq&}YBsz!*%AHcS5D1l
ze}(;$`=!+{?!RAP%x`Y{aNXK>7w<{BU%&NbPNhxFql|)J`_GGOKP|7TJh<kJZchZ?
zZDl`S8UL_PALbR5WNr9ba&S$BPTkKrlKZ}{o@0LFU*B%C->%csw~9w?U7&9JQMUc`
zrQo+N_v%+XuAcvP;quAb<;!`O*FAeXx7xEe&X@1w#jarC_VbfIJN~(1VxN67{@Q%G
z>bJr#gkRjBQ}OTIleg76dFOko{gS@+9X@&WEYEy(?n{@?M16MO7`HM$&cOYV=z7Qe
z9p-JvPyXDc?z`j4<n<P%aeKcU+pke3|Ix+xtcPuX?P1aBx4tar&wcbV-%sYuCG9$H
zb^ceH?{2N`sg{>bKX&Hr=AWTG&EKk@%(s!R39YL&dna7L^jG?|#n+ji?=-pB*ZtnE
zx9qG<q4M0F7kzWHzFALvuleH+x7+1x-;6NnXTjOIN%1rEB<@YFsXCnclJ)S}x>)bp
zt$7!H;?F;v|NF@H?K_X$Rky0l+Om0l-K*f+mc0Fvj;0=$E04btUZ1({>X(HdZ9i^*
zG*N!O-Sw)=zP$eo|F8XhXICxLYT+06BVWy3pR_-C>jDeY%Hn5_s`&D*PWSh{ccTCG
zp2t__S0Bu{bEwahSMFo%>$=X$Bd;9&O)9UPnR57@scF{U=_@D3AD*YWY<{)R++%;v
z37hNt*~iVgIh*ZLsUBZhexZ#vZ(S(&@%a|3zotLC`F!gw<ExglYSaI2toc>FEvk64
zJnz1(S!YYnY%ZLCAX)vvb{F${_qpAVUs}Xf8u))d`taxE^ppN4|FX}m`q8)BoImI8
zm$SE;#eHUF$t;X`{GjXgt{V%kb%*Z_{=B5lH(9=zt^Sp^ef)=Ospl`2pSeHh=Qn%X
zEvxr_Wc&HDTC8tfdQ0$rvu1TE!<_#sE$pt$jw_7)A9QqY|IfR5HxDQOTX+9be)c!c
zCoF%&gn#oMJozyH=V$5lqVv_`>i#YgUTtdrI3vuP|Hi(8v&+9dV7)BueNo^>%%e3o
zKb(>K{PL*r<8N+@`GWoLc<XPSy3JPh_~n1^sztW{*YG>Pc;CkrXK(n_mCmSo6j$|d
znc3HGB{KfkgJ*xunDx5i*JS(Bvw!Wc)-S2QxljMK{jKZI?!OV<@$I?#R-3x&N8iru
z*y?8%Gw<4}mzwrYwdt|`H;NCP{Wo2_r;W!krcLH3+u2^3r|z|fUb9Bet~2xJ{&?|0
zQ{|e)73Z>K^9A^4&o2BFm(~*f^X+`TZDw&+H3l+uN^^I<stKrl^kw<Ht2I?-%h~*o
zK71+l|H{^7zt7L$_q*R^e<|j5?b+mG$7-4C)Gu_F%)9YkZq;hm!j~H#UA^pl*Jj=V
z$+N0)y0+<SfA)Pn##;EYu=1eF%OsbUGZ#~2KR$nT+3suC>uHv2=TE*RFPr=M<C+SY
zIeYtmtbF}1%eMZT=Q_Th8MBW&-g<Dwb#nTrw=XTMYAe(4ube*na^2Q>@_lKaVi$8>
z|DEOgXy>i#Tc26y`94~FOVIwWb^T`l1MgX$nS|~CEP8*}58KK8;r|y{y}6a;w`1|q
z+oiR$y={KZbT9sSUnx4*q-l-ZEVV5acOq;59XYtJbWWB2-ovG9E4My-<Eoo+R!Y7n
zFRP&Vzj1$F(cbr0HlLZbb*6iF^IQKpQ)kUPdDI|g{j;M6yN-mNkG=Xsp;zwDs~<0_
z?pMUTiqwC7{juxw_|MC?UAJqrW85D;=g+kJ@!8Ac<*smx-+!`eT15UI!B<yHWkM#K
zFPpYEVr3-%KRz{;<VQ0kZZ8pgb5+Xj#;)wb?;U;ne~OCdnp9qCe)O$8zO>HNhG)L%
zXXSS)>-y*YpCY$KyS~`1^)YAH?B%?x)ccl|UY74Y%6@peJb&=(*8Dy-(^3!h_8$uM
zNu?5c-hAiZ{QN9d|GIpS{{nx7{qt>p=Kicb_%C;>yKT(x$>sCEeO|NU$GlzZzD8fY
zB+q~N?BDj?dlG_j3Z<_|?LH^o<F>Z&nEFLt`Cl^^`ai$E<45@KXD@GE{P#9-k=()M
zI<>bh$JB3s_VVynwLcU2?Dx-(`MV;$V(Yb8H@DssmN((|tN#?*JHKwxPi^~LlSiHY
zALq|{(_hQ<nB~vA#8Y+K3;u0;`uBED{dbQ$TmPM1Hf`y7%jo)bCTDL>u3K4oB_aFB
zUUzGYKkg|~j%^BgW@pk0gnxd?)Xi&6bG`4K=T{Unf&bICxH(d?c}oAUTxvDnzSaGs
z>Du>#>ub;2nLIna`10<JukTKt&%f@+l@Gs8Hrw*AkH3(mt5@+P-}lk+KPJ7MYo~vG
zy}59{!~6pm-(R0UHRJEj11EzIpS3%Ab<ycrKWFa!XPK@VU-<IUpEt8+{akza;14~0
z36<tOg=S%gKQH^3y!Dz}{gyADcjsIyo2%B5pYuO(jrsj6FJ<?Ie{sLF%53Z1)ycmz
z);*5AF3$hhQ@65M_A-n5{5kXW?mXE&?Z&KKq59SFS1&y`oM(UQ%;{P43f!wJ&wyJn
zVd@Xer$+sMmT~p@`yjvP<{j<swLilo*6)2GExYgWvk#8{7Vr4(F1$tWe+Q4C^K7F7
z&z`BNo%dcYH^;Vmp2RjW@tnB#>n{7q=2jGLdGt)U{NAo3#lCxOto}AX49`Bge#gtJ
z)t_wbw_aPS*8b<y)cx6y-rcSJ`LgNJwY7itxbON_;#1#kZ<qb<^~$<hvwb(!3*LS&
zKmC5c|M~n4mW5f<?yuW3u}`g|oA3N&Dc_`>R(}QW+y1PS-;-bx#ACEVHU8tnjHa3`
z+UsmPb!(q!Z|PsRwq|dC#?KFL1=(L#6g)h-QuSQ&$*=t9m6!2u6W{;nO2T{o?T1!Q
zcHTUxd$)hZtq(~y{zZkak7T+3dy&yp^7j4AS2pon^=WUm`agKV@<;6V_uKn#{`ixp
zK3}T-(eY_^+H>tp9ILbR?tS>uTXOM3_roVYgSX4=N!XRilKUcUa=%%r)D5e@1qWZO
zSsd|K?2X*T*+;e8A67P1R>jM@-?qE=^0>S8*Ujwu{syam8gKrW6MH=S>*wG7>uP0}
zn|-(c9Q~(??Puce;N=fH{nm)}i>`ZZvg6zF%f*xJugaf~`^^%j{$Tr+{X75d{h52r
zy7KRzyr*jqn{KNU{cK()!$04mH0JojTiNnkPFjc6e`s=aV(Wcsut&;A*U<NQr~3TJ
zwVrl=A8x8RfAjJDFMGGYYvxzqHvL_m{V!&@?ai>W09Lk!Kfc}_wts=TRL${+o4$lt
zPy8<b>XW7L{TuW8q9^aDUU_l#$*UhP-><p;Bk}c-m7ULJ>?CA$Z9cU>f4#5f!>sxF
zkL?;Onfm|ME&BeudGqlzi?iSMobA!ySap2I0`*@<E?#7tZLj*irleP`V}4=L>sQ=u
zC)A!w-7YAS?sK!5=s*9O+BJ8c%kDK?^L`vWpC*6ycD6~yoH_pTQG5Pw=NDhn?eEh)
zd-IR0&Hj<kY@QjGFP&{_J3IcU#ftA=e)mm&-u%j-W?pvP)-%sG_b>nT)9jt_3*isa
zpMQU<o_oSseSh29*rRDn++Y2jou{|;+iXc&xmT7G(_bCBeCfdRI0JX5Hife?E%BK@
zA7#$nV_A16x%kDI2lh@?wJ$%Myjt*Wrj%Y`Skd{Jk@aqi`{j)D)3XnqR?K}ayV`%x
zvYla<+mA^;%s={a`r$7#_s$K@DlsX#QFmwchvkrN!jImASN@tUH>-S|_IFxT_Mdg?
z+h+;$)}H5mfAIdM|5KNJpBQ(3Z$g-wv-&NAeS6s+W+Yb3`tkBZ$;yjc)%LXd-`n_0
z@YU*jai%fv)qj1^e&^xO{qy;osrGWl((3zHwJ!FalX}du`p3>yzV^oj*Z-67t3Mxh
zSXKPB_0DzsrR$2pz1jn>zHh%2`}oU;-@RdL*g%!@!_N=C1T3CEYvpq8bz$ej-^)Fm
zSAB4e&l&BUy%x?qhmKZ@yq;Yp_wU;0#|rzZJLY%Y{e0_R@Z#2Q6Zd>ye^2h#&ixtv
zUu<3-+<AQYud~-L^Vpa?U*Y$C(~aK-n|Jn|&06=k{BZuWW1yy8#NU6*)|qCV?fm>(
zbUUB;7wP$5Km7UfDZ@I9|9+v#WNX3h{%@r+FQ4wuIJtb|pD>$SU%qT#muwZY;qkie
z=ATX%BV`}QvDp7O$bYZ)0rUC2_4?Ib{=a8$tb8>=FXR5drV9>HyS|m&`S&66t)=n#
z`b!6%i*7g6f4x8VRJHThZ@2UB+x}j<*ZkX-@{jjy8vpE!So`PaJJbJvN@95)zqa@}
zXR?(a&(HMQPpkJm410a+-{Spy5;)Yey8Q1IUOy`QoBLRH=T-GftY>rle^hMRb+6X%
z=&J2uxviBu|LE`kv3vEUXZJ1$|M-^wYu4`my$kQx*1w%@&G<cdS4qv=e_dsv$IIml
zlOOGzW!<%0edj*oxVQY`Z=bRjr_8DOlsBPf-Iabb`|P>f)ossa*1gL7F!y%&@AUYp
zTb=c<pVuV^S=T%JKd}GzaDAoo{-6JD=@&EYtp7Dn&|E(6S=zV1uFJ38*!5w{*~dT9
z`sPc_Rh{?y?VN9)&Nn1wE%x;d{yghJ-=`0EXX{z)z4)*xsiw#<r+1#kuZ*h?p7=HW
z-RPe%|A1ZNbeqP?{~6{#pX}Jz{~`A9&hH5oaWT(6s)gnEr4{`+b|i9(<K}|ZlGDX`
zjFk;-O85VtaQH(~bB6S8xBI1cu9)h_{XBGZwz^f+iuE#O`m>&u?SU8@?YH1P|99>;
zQB@BUcVv8e&@}Ja;<K}C`*&p5WIZdjm+8^-wlm!N<GG!_{)|Y4HYt;H7S4<7bJm)i
zy;*bq-MxoTYb-WbD%QT=nf)+&@%dx5Out#aao#Cns;z&Lck-3B+Q%zf^tQ(B(Z26>
z+B*Bk@q%}{Rn-FiZ}zTz7WdC~#?3uPGcR?US(MJ*{#>*0ym9u?rRnDvbFQnXzOdPJ
zrLX*7sDU<ROttkpq7$mu-?hK^^74!ukL*uHdm9J7e>Qt_{tc_oyW6_gJ&%tw@KD=%
z%(h0<+}w7x)Y&8VGO|8KWt}aRxtsiZ`SosfoAs5_-#On1-%u|&&3Wec<6E|q>sJ3}
zmw(cpb#iugZnjYL#q+y!pItOdKen}2F7pg;+&{sY&kVn|9a_D0V{+BK1Tp!X^MPk}
zubMsi)*H?3?3Dp`{=I8_&iigFG%WoU%6;z3znk+zzWc8I#a9z8R_|S#{cnv;y_@m%
ziDtVj{pI-Od+J2L@B6X%?5;ftQB$0Xyn8L3uLw(Pg)MK~y#AlR<K6`~Pad^ZuepBY
z;F@n84?Q>7e}lOAFy{{QrgzhC{5p4#{o~r1$uB+@b?k3jD|-0N)qR(p=UMq)D33b&
z@uBedU3(IovOE^7jLK&@F8t<(+t;SM&2jp(lymgYZk1cxzpmK$XS0cgvDrJ}8|oYU
zAKc<x^REAn`8%O<@2W4hOXT)FUK#!L;hJw{bE?h@-<HnZ@c2sRnFmwZE7N?6D-Ukj
z`IzJBU7q<-6;d|2*M-*qc<GsUQT=^{?75$7!ymUlyqb`ewAUPN^bX^&@9x(xEq*U=
zn>nfbWky=x^T7Uip2eOz{BG{q&)!_Etp0d#%}e{ukL4#SrYl#Pcbe76)oifbnh^GC
zE${MW_bl~(+{lVQ{_*S`xkJx4zJDe^d;4op3VS15!1Qk7lXuc{=9HD5-?A)uo^sCG
zYMm(Ku$b>%^;w0zo6|qds}+g=$G5C~-J^Re(#)paG2Xl7;nB5M!*hRy|1^EObyl3o
z-v3uVl)#e2YtAo!4c||D=jgt9m8p61zYp)uuk^fU_0vm!Zu+;2i)+vN{yigKd(fiA
zL^RuI=atMWY4>W9y7|i1K7Nr|A-(=;)bty1AN)Ul%DJPy!9QWX11MvahZTRGk})g(
z<?=o@{r9#@uI-UoruK~c_+%-&8@GZV%KFu`^zTdH@oMff&Cx5Alb-7SntSW{>6w1}
zSN1RaeevPf3ax#s?EL5M{tEK+o;dXj<(<3N?wtO2+smc#1?OJ;+GC%-uHW|KE9+`^
zbK5=FKU@?)V<Ii{Ph(r;*9B)EemQzNJZfIT@sCIPFF$tu5c;KJ;?CQfL5cPEf0k!|
z4c~8FoL|xH_kKad{+Ir?F>;1I%m2FD?3e6)oBvN^-=2gV5kF?RWpyH-%l2B<7)XC}
zRlgKF`ziNjzc)Kq|Bza~tq@c&)iPc8JFvHS$;+za*Wazbc6NsT4E3+a-YmBLCd$XZ
zyuYmVt^F$V`pSbgW-4E!#dY84H#Og#tQYgj1Uk^1Z&!JJ(*BjNo%8D-ygMwv=MPKV
zD~U_5SKAf+|NrshxA`Z%&)$Ak%k+M^@C)nZ$@dwrYwUaa&wKvLZhQW?ytECk*JhvX
zd2AWAx$NhCrEbTK?5fAyjXxI@e>{BU^5Wv!f>#@=*F9VRr)2fKUms64Yp;8~KKYOQ
zzuW&0-Hrb@&A#|o*8l7Ie;?kh|M>X-am|0r?0-)!|9^A;_t^IMpZ|Zpt*`k$|Nr*=
z6)T@_|8{-<>)G%A9ozq_b2tCqzt`^8e>UD<_1$>?kK5CK@qOdm^G^N2zL)P``ZZ=1
zN$g9uti7;z*|WYDlV2>E{s;fMXBP%HKc8;?jpz5Fi(CI6<aTQ`Z0if(xvYQTy(*Rb
zKKnU`U)-#)@|Yd7|68fd*)y}PX9=Etz2)C4_5W|4KArUb>qY*(rJt|=4)`m3e*W)U
z{rCQ|+kbdle*YJ5eCfya=e`HsIcV2-{R7LNXTSd)aEy=U`*`r`-=+8V7HVH{)-66{
z+P}Dx>y~-WddXN&Kkm&z<M3>s;$3oIBF+eJv5G5vw#@8r)&#ft3!;=`cdWD&T>tR+
z?flxKclUq3{_oIT@%QKd{r}TzU-Mzn$?JdD-v9l0_x~sRf9?MM{Og<3^-r4f@BUr>
z|6RQ0U)fXZ?^LhZ|1W(1%XhQ)|4S~n|NH&l!@K)GhVK*HTR8uKbR|>m_Ajze>t@ce
z&i_?Zk;OO3ZEf+LiDLZe`G2_HTACInS5!AXTyvV+ZKL6$C&gQry=L?OtJQz)lK(pY
z#Zeo+K6@;6`*LCSk6`olTh~YbslEU6`TKqUvh9k#@BjO^zU2E$`@eUJ^=H)FxBv4c
zUB2dR#i#!LMRtGt_y0S${?EI+|9^bmU-{j-{=@R$te+noDf^^0&*8rOJJB1@FMj9W
zxAWcPs!wrS9)8L9J-+s>-0F&RZ~v{memTeL-@N*t<rSjQJ`!)Lju#g^f16)-tmNV5
z%y@;JQRn9rz83nty}U}sFT3F7N2_)H^<SFH|6luF^ZD-lx^JJ$|KC0T@0M@;N9OPU
ze?7YYXPtfhrGJ0pe>d;0|H58h^zrYh{C^K$J}pu#+u;9z*RFA&ebM?acQ@^-Uv})`
z*S}Y7zZ`eHZ#(I-%DJq!GcEtwe0sHT-k#**0)szKS%oj9?RIp@^|;r~e%(@j$<DU7
z{p<F+|IV7XzgBjA+UL(~@yEZK|KFOw^Y@GP`}=;M-2Z!a`TrmOcIB7D|Gdlp{cHF7
z-#^;@Z_WQz{r`d5d9k;`6_foA)L#7V{!ZpQ-<<TO{`HT~9WM9fN%yaw`6n>%{HwXM
z1@~MtH=Xru`SYjp6SsEkXg5>md-l@w^OY}te<s`ioZLS9?Y_6&|1&-=xwmnS{#O0E
zkKNP%ew!E7{J-!0kG|dK>%JwI&;R#jx%`{>xzGPL-T!mG=IY(=|DM)=dsklfzyJNe
z-~0cr+<m_O;rx5G?~0#K_c^C}zj*7u_tyI#yZmpy|NG0``#+!FkMfi&nE&@oI$yP|
zz&`%T`gISv%j0*{_nmuH`(x_2Y3t`S*uOTo)Hk{Q-RAjwe_vT{SNgqs|BpBJkvlJ~
zeK-Hboydbz-E41N-4zzjotF9@bZK(MPUgcaRnJXw*Zw{?e2(N=Tgm%Bcl?p{`Lx)L
zr%nC(jer?Z$G03@6KTEqx&PJ#Ipd5fyFPWxeyMjW<mc&$=Zfw5?_GDQ_RjlPdzM$*
z{Eh!s`M*B0Sl;IP2UnZxzhYO{-Y>8He3$**|H|v@|G%@}`Fr2{Uq|lp*PP#e=Wnb1
z_p9oskMIBFTz>!m-T6CyKloceed+c1U(?p_{r&vj#Xslm|G$o{`nLD}&wu<~>x+&4
zu}<CpZ~f=+xLWi3((6p#m%e*(UjAM!^XFLq@=GtT*Uz8(@6Y`GPc`?Q-z*ewb8*k-
zIeXq`oLiUv-Oc15>xYSP{&AbF-dogW9J$NvepuRW*R^G4pI>|t@IU+XeL_%%;NoL*
z+r8J#lz4UZ#Aj#wFV39uKm3n)*Ugw}_Ndd%ME=~q#2x)LPn65||MUL;{_b(RZyT4q
z|NS-H?%&1B<v-@-|8LuEvv=RS$MQRWf8YOK|L)&s|G(ed9shf7eUawhv-`h^`+uBY
z^XzlE{r}bV1(zdhUL2O+=UFcK$&SnJ!?o!0{MrZ1>)(E_mjAo7;(X3mXZc?j?ryKW
zz5Q<OBjNcw?kL}!vwO+KWuR8z3je)-G&AaKI@g|@E%|1~y1i8{)2~Vyo_)%?Sm2Ct
z?@3-e(fdCi%q~4#*<^7m;rHbIFE%~@aa8#2QJ&J@udMpM{q6hd-}}`5?bX-w{~x)2
z=kL+{Kd*M%|9X7>-rx26zuYe0|M&O#f4qP4|Lp3&_qY50udV7o@Be#xf9LNr&(GDD
zU;iijUigOkhd1#z&;M5be!8nT?cMw*YjfjzpRdfQGw4?}Gq=e-zT?{K#QAGE+xy>r
zYVy3qsy3(QRaj-do6mCox@R+&i=AH`^=!%gKYpLWO<(W5q5gmFbep~R>Rw0t>(BUe
zeA55+`M-Ph=Kj0=({l5l@2Pdq#Q#5Rp7n%%-|yM){(Y@~`LO=~)BHc$_lv&&{r>;&
zjQD?B@9+P;zW!CXr};bKid=t%@5e97HtjF_Zy^!&Q_$^tdCK$EGs1Ldi0=EIDpy-{
ztFLfR(F*?$2f5o8&VHCAwp=fdXMSox*4`%p{*_yjwid{$*Prs*|Klr1)a2JU*DkKV
z`(g8Z`~R_=U;f(txW@kO-_!j6zk+}5|9^jf`S;!RKR&##d9m-)Kl_Q#>=WC5-}w7q
zE^=Of{ZsZp>F=C-zNtTWcS8K^-G~1w-u&D7G~rJ07F+F@=a0U1Tve$1#&JKUC~E5!
z>t*xrG>iL)Z|;0@w)5(xD?#4-elb1F{IPu9>tNyfFq4|}w7)0UtG^Ff|LWsCqvUT@
z`=8do{`WrW-}3qY*X};Q_w%BS|IgPx>@NR*vHoZA_y2W=!|$A(&hPs{z3$s}KmTIu
zd+HxR<-PK|zJjymf2J5;(x3OmgHL_B&DWI+gXdSjytC(-+~;!JjbA_5o3-pcelzCe
zvB~FWsNJ)9Wp>6{{Eg+sk6XTl{SUnVtiQ@M|Nq<S*vESu=KZz3yE*@7tNy>stM#X+
zpOSqG>R!D5dvTYz<<^(w=a+?NRo+<%9+Cg{_+R$gS@S*}|FBcMr_ue`y7M>M9;}kn
z>+fYdI`ih%m)n;=I~#Sip!cn9SM>hJwcwr<sN*v|=Ca+g;P$H0c{ld5U%lG2<4eTH
zSMTEYK0EWQGDGd$uVVcfd1hx<@A<lUXVm8%q3c&J&b8a8yf1t8zwJf8?ytJP3u2T-
z<Mf^O6^T{nexILnvRrO|`lpYt<wM$IyT#`J*m%_Y`-A(<j%=5&e8`-&>s+O@@awA|
zp9Gzr6~E&7`fsh)yU)+JSYcLNlWbBA^56#l2d;h(ZvB1uukq#mjW#dp_LTjfX=?iM
z`z7vlHG8{`=7-Dd=PaGR=i|Zq2hX$#emi!%BKyq!y_M?IZTS5IY_?YHZCV@HUSfPa
zAJSMpu)CJ&o&1f@cj8yBbl!SRJ<MOmS1u;t&cE!KUu(jCr`KNXe|C^t&8b)ISVOX%
z6Z383o#$SL#iTv+Tsv{OrIe{e?+=kH?NNc&P~)^M8~4Q@>FvB*{rR8QS>x<a@0RxW
zepY)Q_2XRdb@h)IqcUf0UjEI#;^3DA>4sddJH6|#{#YJ2@7I+z-!2+2TK+Is@7A-U
zcNaf@T==OM)bf5KyyGiN*!SbF-o4zt>h(L58By0a^UsO=q|i6tZpAc<>}ToUex<)}
ztuLCp{Pt7U%d@={cdAXO%vx+8wP)q$?PgzBcJf{C;J;q@>){u_d-py(^VjX)RrA=c
z5fn3dwvCnbcZ&XRX|tDz)BP-L?(gj`J+JTlzse{53+GL++ZmU2_9CmkzQpXV2@%4k
zZZ$>BSNe9GEbo8$cHYH{x5WQG3I4vqb@q<xPwX!X5h0qae&Kt&^^047C)a(v@Zs|^
zy=C0fTi?(4uOcD8^6sV=U-%zAI{td9l<%W!ad8H@IfXxNGF+c`<k}sEeH+ai<A3Hv
z^yYth=_tH}d%nbVL;m|({M)ZX-D}x+N456)k;~<N$5)=+%`QIo=wuoBIW^xO)e2r&
zp1yWpa8>*A`7?e!WxXuDt<YEb%&fCH3R@RjY>f{8-f_H5`1a+l@Z}fNxBk!Ad?lk<
zc7EvZVn{cle}2Pm<x@v$!;8Mxx*ZpPa(L(BjGu~e^>&r73wqbaAH6(ZM!cupzsLOf
zr>4Z7g03gCj`&<J+@VvoRk-s1LOuIK_q<Jvud~~mo?U(Pu()1fN#&7;o0t7R^X@z-
zn7?tZ@jqZYDeL&VX$kY<F7C`$_<Ke5dAqi6@x`rW$I^~Xj@bLS;L{P4imeG^|EAoj
zkBKvg74W~(V(BsYhJj&^TMd`o&jsqUch;KB-%(lJ=>GY(`|aAdiO@(~H`n35{G($>
z_7<JrQJ?VY-TclyoBgXZ60*ZLN?u$(&!&IJ#=jTWZ~2jM?J4WzCGD!`v(~ZCU(Ijc
z+Pue1tvz^p&9w}v%rBvbPd8hzUzLe9nOCq`|1Na!V~yW}_x<a3*B|O!SnbBQIMmxl
z{I1txGux9_6Lx&@u-kd%Sy!8#>F3JC-*S5rB$O16t(|q*#b2DqfB!4j*->H7W#_Lx
zKHs+fTj1sO-<@yAl*rwCd~)|DP%qG~F<t$^yBXilp0Pai{jcymvyIj(c7E8KF>CSr
zSrNQu{oHNmo4xBRs|%iOm;3&J_3#{}!s4Xa7g(0fQ~x^E&9-Xqx}(4Db>02E^7r=b
z3h&nzZ_fk8r1@`_XMZ35du{ExW}5Kfvo~a~d|fP@*SjPA!_sAPbBwPX{(SlL<<-ew
zKgg<|ulmqr8T|bGREw#3_YCukA1%0AxZ_Oby5xD{2baIw|6HyzK1CkVV|`uE^!eY6
z@3VwE@=Et_vA;Fdt^b(i^4}eaHL~jSi-Y*D*B1V<xx4!Di#3PEc^o&Koz*UW`+!Sn
z)YlJHPPaNgraerr(XxB^c!hsOb*0m8-MipU`hjNdn}s{Ff5jcVctE)>G=J^A9d3nH
zDt%@*3N31s`+pXEi}|?Yfv^6Iyji|qHmxjJ>pd^(df~w}*DkYePIz?fY}BXek*h7w
z?)7>97G&UqvzCnCr~GDq6#q=+ix+?4ci!nSx*GF#Ew0`2?$(@dvoFRRH{YAk*VY=J
z%Ox(7t_&XN+mTRGc||I{M(A$+7WwT?yVkAUvF?2ZC?IQ@+|?iaYq+>`f7rZhD<41T
zs(<sZXZrrFNfN$~bYha?{ycfImizkagWS(%ZOAse+*=TQeNV+xZt?tiFESSHE4r~a
z<Iu{(*FZ~@Ksh)5l<<q)ndeH~x3aNceIk6>c$Q79_nhUGpTACdeQ{^S(op04rIjC=
zHVPh7jxo(z$Np${xy4Sab7!9Xy|Db=yl=9ZyOvi#Q~SOt>JRR{nt4|CZu~ooTgUny
zzn?lQ{aajSWjgPEr_aH!CAaYZi&u01Gv(PVpBUcQ!jE5VJ}=z&_UX)7AI`qy{@S$m
zXfCv%-d)O6E55TnEautc#P^yq^`9SZx*~No=(#xi?t6t<tCyC)=fD2z^!<Zty4Vhy
z$sM&dnDuRy>GT_mmosPB6@HeTy?DQkTwy@$`rwak{Iz)#@=k($`kTd1{lUG4zNPQw
zw?13seb2P?&#Qmk`g>;C9bB{T|G6`VE!PI}-*PXmvON|XXTY=1p~vFJ*}g|t(=viD
zbFVsib~^jfi|dkVE1zyTSRiI+*)O&3^EGo=jeJJ9;Q9{pb$9JQ?plAxwW#*1=f1A!
z_3qV`L7NMTEdD<1-?Gy8?-_ml86BH1>G*RCN6S8**YxMYv&r3;{bTP`3oXAUw{e$T
z75nVR&%NiF7SFq4<+l%9vgV)Tyz}Y#{lAXVF?T&Jw|@B2yXT_J&yQ<8?`Y3@w{+X1
zD{q|dMH#;N>u&$~G`AYtvIink*ABl7em$cssru@z>xHi_K5n`!zwWh3!K=xSoA%5s
z6}jzh&~5+G)c+N@&i?Svy76DJZF&9a`St&<E%PsmF|dj<oVV@u+pYRvpUA2&_n%|>
z*|_>&PX6)B%iRsEZb`nbtvqOub;E7zO%{9GS?phD7G?{bkBbez%-t5=yi#@9OPh~R
zjF+39Ty7sDw*JPMC$j3>Z#CcE0V-Llzq9;0U-bXyT*KHOM_$R6>l*UT`?ez7Z)Nt$
zuLrg-OWsuwX>7mwx&LpEYlYQ9r<*TcWLw*(uRkO2%$*f>vn5vCv+R2=wawpV;(c)s
z+w*@WO`iPurErM%n)6-3{An*m-)?m+_uZWRo8=ql9&`T#b0^&WI{&HnpL2f~&-;Dg
zui?i>E7yA+mOo-T?dhieD{B`={N=d4{nt9}b=5bMEpEN5tUTEA#>reT``WG0;9tr$
zIp-$wpPzp-vdH7Q>Bhg8PTXGo{_f`eb?TPB0cY0B$L%|mJu7=_==!sumd}SbEO|da
z8=KCRKRR=Pn8^M6tCs(mbpN&9_v4#$=Pt^4Ry(n&?ryW_b=&YeS5AkYn13tF-exWL
z^qQso?;o~K7x(FyQ7d?s<7olkqvnf|vh9ll>jSrl|NC<F_8HJZn7;Xa&qAudmDes8
zT)Qwk|M=bAkFU*{)yHqlw)Zlq63eq_ygGmW@qd4|y36$6h^RF1|Nb`W$II!TKYUJg
zJHFQ2cixSt!n=<>+z;#b$IY2#0U2(*KJNp6oPnW1=7bpL!lGTlALsTLnEY`s-F3w}
z@2_rQwea(o`c|)BR_5mO|2cne;_|gG=C}CqoZW5KY&PSl@#EmadhnR}XHJ`M>7KI7
zHd<)Zoths%`*HdI6T$E6WM_-}9>3`G&SlRL_xI`_=Un`HFWK$fp6|1)^1t)eS00qO
zmK0-t+;#fZ=Ah`z$}5i#pXFWpP04$IMeWVd`7hp79=rJ1Z`SYq$G%;k_pbZ-)9L;`
zdoBNhm-+oMeDkwEv%Gfxf!AeBpTFO)uRCIJfA8ZbZ~b-o{qD?r{^)o2E^+^=3y&7f
zHq>8xNA8I`bTISV>h{x<_ZZImw%UJRbzGc*@47Z~_v{M(L#!_!*>>ed)Fz!5T|Xf|
z)L41zwa&NuKVEtMF#mbcgPMaCKfX-A{LtU_z5T5IZLhNmp1zd&@74bL-&s&0TK$&g
z*Y>;B+53|B*T*cjs7*T~erB=Ul*d2R*Y~x5TdQ~7{odEUtJ1sg6{e*<lsXzK{+YG<
z{>K$t?f0!IsOWfZ&3XUljy(ypR9d7|k01PYu{AsQ^Yt$mUve+b-}l$Ou=;0ay6(=u
zj<<II-d`5Wf1Y3e*6#&>S6()$_m!9B@2UHBRZV_v)T21}n(VSY{tr&qGOfO!`G4n$
ze;L2N%daav8NTaZ-CO?qmizbBR2}-QC@#NW>d12Tyl<1`6MtJRJ8s%lZC6|H$++L1
zKklCGnHP0ub>j`B4$a^_#5()(mYo?dt~~ASJj<bW{Nh}e_g9Wg_@=>s|MSbH%h~_c
z&;H$Z<>RM>;$P<Cys@8?R-_kIAKDtvyX{}fn*ML%wLk6j4{c39{+ne^!~Iz{9nD!q
zH=<@eTlCr5{?XS(-uL`}tW&)<-7l6`{!G?AJHL75uhauyX3UyD=MGO)&0;BCn@daH
zowW0>-YeezIaWb$Z^5r+*Y^BzxmSP2rl$C`I8Sl%?5fRcJ!R%r1>E`fZN=wLj}_0K
zIsCXU?Zw*TT>Vuh`faQ2zRiy+*>ZNfzio_3Nri-+H=q9#Yk8CFCED_NPv8HuzNfyy
zigEw^bq^QJl6lm;`o8?!Su%e0B`d!gS8q@MW~eS@`y=z=l}oJ8v)-<GdEJI@)k#IW
z8IqMjuie*fb^my0x#ii%eN`s)pShR$?mP0t%3o%#`s_`f{~}-au6Fz@m44^nm3f<t
zj=!?|vH0(2m+SjJd|S6H{Q2b9bt@~M{dt%F&XjlWzYBk!{93`f`<~(1uHf50s^%Ve
zwf^gqC&I--?sM+n{qxuD{Y=xpLE)E|XS>(UyYlj<V*aZy!Lx0==O6jgIe*tK|2=cN
zrG;-tpXa^L-#c&a<EF^X=V#V_%lv2j%%bW;Q)So2t$P>tc=57Vb3goXwXnC-w*TkZ
z+`HY!zKPX8OE<k<`MzK61iQcQy`LQJr~9)*vhyFU42(Z(`|9H7+xl%E*I!%vZ>qV>
z|G?VM*Zm))p3i?8U%0pXpY8=eKfA(jJCDwnn>TfTcIV~I8((YJTS)CI__oY$=gi}`
zSN}a*zUR`7`qydiue>o`ac_=Y?0nm^@tIf7WWC?Iqqc-U&cJN-35JityYmk3aQl0>
zbWUAKXRvpl@OF2Z+AtGszqcw?jr`RerQi6|^E)>$I(hi|3Hf!8f4unO@h<TC^!m_#
zv+Qe!zMkoOS$J~urNx1F{{(NeyApW0pWiR{dfJ-vPx8;kyZ=8u@BS%!%jax!%Rf!s
zwlm|$f~wzFXPut&BsTc?^64|~{o8fTw#sg;T*<`?Ykz$*{bY9i;~Mq%l3UKY9%jG#
zGkn&UF2COC>ZNmb6dMPfesyc6<-a-iH01XrI4xPYjK`of`{>eZ|DLS%URzxF`A^nn
z_fK)b`u%SG2|unzebm;w_w4ID+r=}jZhd(4<H*_1t67h}eK})(_&IT&@+~iJ-~YQj
z{(eTqmv?jcE}6L5Uw^Xh=W_F(v!Ber|8?bk`+x5)?kwit#+DzJW%2LHj)dQjUmrcM
zz5Js3Pp!PYawU$1uM5%~>ME17wy#+^d$ZO2&rdF1U`;>&#@TjjpEdt|Q^Ps;(@oQ}
ztmglEa@O{H(@WmWD{O{KEDx=m%>MbuBH88Qb1im#TXFvHsm$B@d{NI%gXTUu&(8mI
zrds~(;n`DT?pPIOy?uGZ=ijxs&&$Pfe?R%P{?Cq=^DC>iY)dxX?0=}-PR;%Hzia1z
z-2HMsa`m6PbMB{4yjgs$E4yFf*nQh4D=)Jg_CL2~`LC~!_|slq{`$fF^T&%RAJzSM
zyPo#GwUmrIc>K-J8-K2;pA+Vf->_5ic2ULZy^pRO*<icp`h@<pUz5$tD-Ukj_}C=N
z`FL=;Mo#Yc%zf1=@1h>9E7$!S6g<ChOYr^b2mEO-jUNYpWVL_xXXg3Hz3o>P9cNwt
zGkAI9+w1GAKiqIHDlAz$w{Gw4Vx#-@4}L6^o1phI&`0{rt2p<0&z3(={kz<E&*zK9
zeUHLz|EGRGFK=_J_{WvZ+UL)HeB~(f>7M<3LQU1A*WTyXxACWy#@4K}`Lnjg`~A*k
z>DThl?)E?a@q5h1_ny*kEJ~%SA53MxJ$Z+zth@E+Z|eI}OZhiHw(io`pCQp{b!_dd
zFB`5tyLJ2D$>qz!vyyDzrvEy$dMkVSGMhTvs=kP|)i)1!FR0sNe4M>H?Rf0t_KOz}
zT@kwcLH&En=||5kH>b~w?=An7=2#oOe7)RB;p3ML{l6c&c=GoAsA{Wa^`ig2Y}hCB
z+4%DJmp_xXF0cE4{Le4fbhiGe3y03m*<NY4Lf>~o_Q|gYw=a9Va<cp9RpH+j)gRw+
z##@Kq&0Ts+f${U)dHk=Wd26p%<h$DLn!n?>+OnhW<&_6j6kqv1y3!muE2Anc|M!#J
z((_k}AAMPR&#wBYZ_fT1YSj<l*Ve9l^yaXTf5`j2x9xk}?nunjFARHSa<aDm&XJeb
znd{H4uQ%vE&J*)Vbh#XO_tm!l>uwA8@uy8Q-D<NoGxyOt+h_iFV}6AE&)OGv@XKlA
zoj(eySi+<39GU(x{o0r1|K}w7Yx7KB>c8h&;GC-KFYfc6*>`5sanb9W7tfE1Nwz8Z
zvvRweZOr<a<!?9s$oOyT?Q{FHp8kvpTs%dyCmjAT%dfYl_3itr&)*i@D}IqNsrp5@
zM6cc5$71hS-Jjn5dT%;^(T(4Se%@QV|LLC}KX>(8UaUCuay8%Lhu6!Wy<J|pYX8?q
z3+fy{X4&!g%IsSazkmA2^MB9TRP#(vy{B2JzWn&fYX7W*?<UTu%aZ%N-T!=nEwjAe
zTNMe*yH_sMSzee|_3g=|@0J(ZzCTzX_cmM4%JPZrp_Q*|M6J`eF1WF8*6W?q#eG`j
zl6obdY-soCjr!5|QqFnaJk@8t%XS|56gm0u3!&(m$>H_-N$>4{f0h+m{jlc!l}$DN
zrE~tAxL@<V=e+Q~?3cRj7uB|%IeK~JX~ns}lK;Jk`mFSC-dCl6)92==1>C9rBwOru
z&NG%Tysq|fX6*Ban}0NadU>4vt9OpC-})=ne$V%~$6Vh(W#eA<&EJ3CeKKKPZRgXA
zsik_~_GUbBw<z80|2*lpkAL0P1i2a$i&+Jc`STw}PJZHItFotUmVfN^<!b-d-28mT
z?mu|gb=|AI`c;3Qyqzs$|L<?p-?=sSpB>5i8MmXa_WzZ>S7*1I7yh1{{`Jh0%lBh`
zAJu<7|L=S&`+srzkDkxG?|Oe-yZ5`_r<aG_E1mc4{LHkE<@f5oek(u2zBs@Bv+V2J
zF~`$Pj(?7Gt$zDn|6A>wxn)y7yIkJY_cPD&?;>CR>VxLuzCTtz44q&7GUk4U{2y7L
zjx`<CD-u_3ooO~>>MgI^^ZFjY>{Z>~_v4%V(Y^n_bo=dpd2sgas5`#}pMU=(`|J1F
z%?oBeZ|C>hZ+SQS*ZRsIXBY75w>|S;8?*O$xqRubch)<<tu3i?z25!p#Qa^Z+We31
z`R=!!ow}}eN#4F&$@Bij{rP3OZQbK*DrWhg-haI_(`x^*H+%ORzkM<{KD+k4=<+h|
zPtLzLw|{u}B=-2+uJ7`}-Ov5&Di5A<)7)mTvu%sOdFA~7fik)4ubJw<`_+^GQj}kQ
z%YC=capqs<e%{-cbU$+MdC}|t78hr~eN*|Q|M(tdd%16avg@quI`ZHAy=ncV`7QVK
zny1SjH~%;`RsJ~pZE-!zx0);X=dIhme+hq`{Ew;e`o)=vpWW+jeb=@spYi_U{j1-(
z+S|9(`dQfBkc(Mt74mvdvT@<T0>_xDH5H{*d(ZI1#Tj_snlOj)e$1nt%krM~Kks;d
z>rL&H*Hd@>w76ljE>KqPY?W-~^9%QLi)!^YPm7Vg<WQ6L;7s(--P2~+NBwgvz47mz
z{Jz>EyNa{-w~Bw<f96lc{8#7Yepi3|{ym`GMBw~o58=LbJD=VDZgp(m{`b#hKAbEJ
zp1h~@mA~uX#P4(Wo;h5exBlQs_x1JHUtU?X`%krjr;d}vKIzVdzrLKVPN@3yu<(nc
z%$um=E6=w!ubl0<TEEw7N%h@}-`~IA`Do7RHD_&V3k>d@>i52zmG^YH_u8#V5_eaB
zo4vODypXfhyk}Qu2|Le<{;PfW)o*k2^cRlIhrjQ8(X{s9dW)^sMd$LL`TnLjW8e7&
zrawflZ~gL0^sk_K_NQZCvg)&n&;IqVe|`J^gZBwhDrP%;vnG4bYggBp7qutu;I$Qp
zukH2N^Xl%LdD?z&eUDAIo&N22_AiO)pX<8Je!cst_A~tXmmA;x?>?IDKj*pCYis-Y
z2W-@z-?Dk<dhX4va?|F0*)zM_A1*rC%-wanzSnzx+-dP1Ho>ywWA~0E$87o1TlIKS
zdS21iW0Lb-zRQ346ulw+Qu+LU|6WPQ-{t%g`TADO{QA#pbA5kYD_#5Z`pNgZ5B!_A
zy{6voM%|rbxBVBKfA4zk|1{4u6E!n^i|mt`yQWoUCDp!J`a1S<f8YM%kDpkRl?6+a
zmnrzZGTCvjA*%ZD#S&R@UAb-c8zW<n`@Yr6&;9=5p7#A`_x=jM*l*^3IjZ>W`ul5M
zey{ufTTc7U`)#Z8-`%xswEG`jS6_D7?he;w<68;ej~`up?d!9%S+aTGI{kGEubnyn
z=JWj1;y$N$UA&W1veMtTWQSYLj=rxi|6SZ-E>-%kVDFW}%l-2`#OuDzxHWhGcfSX>
z;`gtUeY?l>^ZNSh_g4Q~T$}sPyPj$Lzq)05)^q3FmkaT~SGecw$)8U?wq&oJV<u&_
zFJaou=Wn*1f69Gq!_7rM7blvX$v%8CID5XtdF}Ud55v0M*B1X(JZow*tN85Z?Dunp
zD{k(udtd&)`uX}Jvv*Ej{;zJCo#nZ`qDR*HnVL$~-FtDgr0T))XBpQ7*URVJ{lt2?
zd8S&{rCWV37oT2y%>3tz%%+luKW{IV)15Cj7qa*2A9Mg~`a70qe~sU3eV@5o&)Qo?
zPTg<q-$(1V$Mbxh`dPhx=G9s~{TV!)t&YhiW?T2|V_&M)e(?iKX2HeIua856+wU3|
zik<ISU+H%Yw#-j`p2L0Z%eTq{U#H2$W?xP(`uL%9@xf9VKl>T;wix@}+x4VawsQ9V
zJqcCDvfFn&wp>#zy?Fl5Cy#S`BhEkhSaC?5Z#`S^>l-?9mi0f@e48`#?@rKgj9uex
z{{wd??LKly)nAAIQs>oQdat6AW_{`Q<M)`q>+05myUAHkO4iQZxbLD`SpL6HO_oBk
zl8f!5*jApu!#2zR&YqnHd#`-u-PT`r)OGeQxeebNy35vs1|+_5+B{_m`|fU0?vo_7
zW7p~e;mS9fUsrnS-r@3p^7r_g%TZD{ZiVKAeOY;1`2SPZ%T7m6o_y$Ko^8@=viISY
zkM6gw)ON1)?2V7NTw9a%@nY$j?a(zv?&=rHj|IxCj|zBWH+xQG$)7JLpW9xKGOd+*
z878&$TKCn2ir+J3&Oc>Mj*u=mQe^S-$!53BhwfeZvg+k@o5If)_pW5_O4}Cox*~e=
z4Vgdik#vRcovL-G{tB<R)|Aly|K@qzqTuU??V{RedtBaA7c0ElvF6W?gwNB(eOxr3
zbY^hv*5gYnJ=}Nx>TUbm*@w?|u79gLEBp6$>0M8Lu^oMO88&<Misg>v=YI!2m)t9S
zwddfz{ZZ=ge)BJHk9@a&-D=;Q-W}-|mM@btNxn9_{$2f>P14=BFBD3hcifz3@n@s_
zZ^MU2voB9S<XCWJ_xB5h+cWKItJ1DN^8B~={_nlz^MC#^zw`H^{NKRsH$O_(Fvb7)
z^ZdQt|5p7s_m4>bk)9F%*LeQVGk5j>9MZq@_s#i#Z<^}^->rMKJM~!A!{)uuY?r2I
z3w@S9`s>(#W&2Oc{BPd+E==!uxJLcDbz#_+v$1goY^K{bRQ5{k&hyA$^ZH|?ZSt>W
z%eVeHICcF`{+b7W%(H&ge(a97x%pQA>$|o0J-66HS0g@U`L%CGInV6htdE-i>})SG
z-#PtDm)gfuv!lYUANl1}bAhKL+vk3$tpDs7p2MlJaR#12Z?2yG`0&Lp$$9L@+~@yr
zum9rCygp~<ZQjCwv-93aFS}RW^DbHb_l>*$e=ohiTl+P<-t_k|^FJ*2s(!!Sz5RYw
z_J6f|AMQKW|K+d$ak%{c&$;(2zn}E4`{cAcUErPAp6cZj%_Qyyt}R_V_s`avcZ+|o
zIC$mF{?bm}(hh#Rii0g5o(gSWSZVmg`<`9to?D<{%eB^~dp=#PRylm|L)x}wmWDa{
zu;r^~gipjiyw?zH{PUa7+THBS?EczZe9_ANXu+&KhFia!pFA~c{mI+hJz+dQ_5Z8Y
zb4A{@iTRxLETQ=0Eep9<+U<9nm+d^Fzxhn$*SvE*1vWciGl)-Fe)*lWeWW+DrfThu
z#gc31&dN4U^R>HJXS6)~(X+GhZ!?Rgi~ET0(zKgnp)o&(-~X)h`)-GSPuyo+*%Vcs
zc5VL4<h3>rqlDjjEk6!T&@tAH`-1Q2KD?v7<4eZcc_p7j*O{D6ZQEn`acflC#V>aX
z=DmFX{_y$RTc7_Eyy=zWVa_rA>e+&WqV|8+dakX_GWgmTJv&POcShbZld4mTcVDai
zcJn7_1U>&7=NaoI?<ZZEWIp}!te?8-8GQAhM5kNHmHjW6X`lUV$+Z>Bw#V>SzLK^7
z-eh>EEo#lRnB#5d6^rVu;%Y8bt+^I8Pu#J%;_KW!zo0Jt!ucikp<eL*u*H^#D!vx$
zyLRW_e{$w&|F>%vQFS-|J+sR5eYEDZy^{6v^HQg!FP{-_ef240nV;^hP@nVK%X!;2
ze>gciJiah%L-m8EkM|zspYMaL<eebAqpUn;_1BjdcP^IO{eRJNPo3+*^PjBV@%8fk
zUsu*VD|D>8Q>-u1s%*j{H6=!7{Vt2G1tqWEdcIj0`?K)iH}&&Th0jlI_WwNJ(E1i+
zN@)6jmOJt9RwV4GR8L#}@TGL+;+g;69d#D26|=Y5eBQ4AhsGD5n#zM)7C!D+WA-TO
zcHygi9*?dpvzIyFvv}^WXF{J}$)CykcV>-!{?)a2XM?7N66PQ1p6_tqe)WyN*KZWs
z)FgdR3dm{S^GV@<&t(6<XZrV?jgK?fJ2UUfqrT0Jac^H*Nd5fM9^U+A%fTy6^D;ij
zwx3=U4&L4IW1i<`X!*GQ70a`^i}UZtKm2v>)eQR=o%7~ji*4hNGO;)zd{=AP<@9Hl
z7vKBylr@=S;xgT1Yd6$B>byL?YTlWQH#@Rd@4c|he656=vK{Mp`PFe*&=s&BwEPlE
z)t9dSef(~V_dCDYCocb9^pO9N)a}LoudW5IspI}uz7$mPG&~Ztb6wr8KXs10db`b9
z(ewI>^=D4spJB0juk8HQu-V-0a}T`wx1;R*+IRZDEDiU*+%0zRa!u0jm-Dpy{C)Qw
zTIp$Lx$iXhF}4J0tG<bDlcNj1b*RUD_tIJZ-o~*1Mvj%u+^P+xC!hCRQ@NKt{{Sda
z`dc!V_v}`U+bDI!y%{t$dD*$QE^FDmKKmQ1pFiHsp7$!_!^y%4-#;~R3Odg|awPVB
z)bTCbld8YI=Uv?{yuAE)n(zNBD?VHE>{|DFCo~wh&vCdf|9M~6{@0y%?W<O|Kj)vW
zI)7u;kG`*Ydb6fSLRQ)CvgH5QJuTNmXTF5-I`+(8N;B&ARvL%R`S&)m@YT0f>bU{`
zL)Vsqh8aP1?N;G}^E-s+SN&gN?tff+-D_jNd*7ozElyqU{`JE?@toZAf%)$~l^b|4
zH}5d9=}Hf_$}l!QemGP%-EGUm4+dY4^lrHuUz_#u^5NZ3H(vKU5PPMZTW_D}`gi{_
zpUgC_OxyeO<<4bi&#ZebEK(kOMtsZrNbkDJgBom`C4|2(coO!xjb(GfqZd~E<+;9Z
z=Ul#*adlx;RxH1L^<}pCyUu@m2cBIt|IPC2U%_{oyY}xEu3P_Z{hW-?HGWmkesr#V
zJ%jJM#=D<i4xT)3GwZaylJ{nggsy3hC!;UlI#R;6^6~BU-@6{?_r}E@UR&~O)z&bc
z#hy7|dG0`Sy3E`I$=}`Yo4%ZAz0A^Zi6OuJ`(-mPm;bL=E83skYf*7Ff8Srnf9&<_
z!kgM%*X(rb379)wo<ICo_8h4<KdbDH9lag3ah~wy^Z(LwpMxfN-U#m~WBUB>MD62q
zFRPdCys5wIs@0?LTLozjR+dNDtN*X8z7ka}a=tb$&S3L`O#Y>uX+PF{T^4<N<36($
zYWrEk=RFJiy&?Xyb^g0)Kcm5mpY0m$8t>TGzF#7CZts=vXD5d3zsdezDWh)BBe&|t
zG?n-1TmN5K+gJU6x;RgwL6XvquX4-!vU}7md*w`C{kW&{PHfKK-Tk+oJXu*?@L}3b
zn3;DJ-}Nr2W?yBw@?2(^>766rR<GT0)B0AyMYgN6U(ebl`BvQD_x<CY;yy>(mNIT!
zXyLniUX)n<^}avp#}7}BD(?Jx(ErV@+KX$l&Z>SpBK-f&!t2lgUE_CP?xTMb4p;QO
zn|dwg_1&$Z>z`c;j$bj)=A&2g{H#4TD<2=3J9}c(wPO7l9sN8HcQ@{+tlP@-(xP(x
z%IWTh*>9JN9IxN9tL)0==ki}~{sCpB-z>ja?x=tMcfh^+^k3uBle^tN#TC!9k=vJW
z{#m&H+Q;B!pI@7b&lT%SI9c$1N|0-|;&Y#Fmvyi&xI3(W=4-~__ZC09^=hBJ5r4bA
z78Ff;cB)VKz2v=+`onn>4=dY!y}5jAl0@$7r=W4d$7wnKcbD&d^y0{b?;Pv*B~&Fy
zok-jvH^ss<=J;FxIij*}dxFi`&8E-z9yRCI*3v7FXQf|<G&BtS7rdWz<=4Ggx1OxE
z?^^uY?$LuUCz@AYUgm!7%;Bx=`Zd?Cod2_C*T2fItjRmXif%9;EuQ>wnb<u4{U5Ua
zto6S$@7=^7Cl){dqJAG*h^+s`@=Nd1?)Q2z$<@Ekz1mSNbGQEbJEyJRZaF`@!MtQS
zXW81H(T`T^&sfa1x^eHuBay;Ccjf;M^6$&;S^oD?hR(lhX6~>y>iSPCzvQYe?yC*o
zc|R=X*XrHMg(nMpUpZzk_0|2u<^M$3eqQy#jJmbwCoZdGU*Inv@;b=>-NN`plV2|k
zKTpkn*E)UM=f113-4fG;cRc+!W7d<&r`McRjlWy|C-}bY54Gz*PtE@o6MVh$_($9C
zO@)%%H$1j{qw)M@UDCXa0!RN>v9D$1*GjG|m;aRz_IlD~wR5jxY;4n?!n!9PLAyID
zr~CL8$@I9-$t;>N%i`-3xvD*Tem`vTkKOG5Tz2{UW^o_0IqKR@A3H0aCm$`1%?WsI
zz3ecn?Z;W`_2%1EPO$%Y<@~OFKN7_3{_Tat%7+`AJB$|z-!J;VBe|mK(aZUkbN7B^
zTReAfb-s;$)3ZbGvia|RKgfOT*o<7EV>b%T-!Hok8kjL#B{!$~RL`@gXFHq2jz7G#
zeP>@KY#Yi8mS5*0j%xeqe~<d~;?tME&+8V=-Wyi)`)uRe<F>3n7ye!9zQg95$h%KX
zjz%nnf^tXMTqj@MW&HWW=GVsimWJEZ9Q?VoVC`o8_<3r3W<Go&<^SX#XnRY-`~y>k
zBks!YxN*nwU|;_`{dty?_P>5-S}y6orFiX*Yb%_$p0hR+7C&;d8hJZ<tTku;j|<vC
z#RVHGW!?yu?8x|Ja(~~mv*GPku$2oJId`Prk#;P+Z@eRP{<Wok-S6l9d3XhMde8*%
zW2@i4G5$Hz{r{c+_A@2~TePe8v)wQJ6KPSAHvhj*t)7g}U7x7h%qxi{S)H@Roxdi8
z)x5Rc468ZM&u`eR^xbpXoT5+fWF_WGw7s@FyF6{{GpXg<4t??XA7`;bE#GJDUu?U?
z#XH0I&c3{P=g$9E<7Rc6`~UuO7d#zr*O;w-;k$cDZU2t&bw7i<*G>PuvNGm%oa>%h
ziDB1`xcLvePF}wAG<TZVtp(R^l=3!TTw!|dhsv)13#Q+1`gZZwyJY)^AByvfzAD83
zdQ^Q3+V(Q=KM;HAySvFwXB(3r=L!$5dAE62d)S?um4Az$a;L|=*Q~M6GMIej=&vt&
zdipamRoZeF@s`!*nax{Q-k*^!dwtj99b1c!tunLR`CfqMdWA{#XHY@%26W0s^<mpd
zRX=pT`zA#h`hHro(spxy{kHdprn%?&)cLE@)_-`r9J25F$wZ6N-t;+cJB~!2{M^y}
z@$^ykM|1l{-S6*`oGo1UE#m5-i>lvV%#Ql~0ouyhVAZ%!|JT16HG9sgzPqzG#qD~5
zd&QHh&bF1uUtXUx$6wBW$F)<Li!WO5JI$@;DR$V>I{pUFU5l?LKd&nR4J_n7dw6!?
z&bDH|>fqNkqO<RB&Hh}L3u>T%>eINwdW(s7l;2Id_V7i5iGO79{m*AP{9@00^tR16
zw=$H~ugj{s)-3KLZ8DR2ruu#7OYM3!NioN5Y|RUw|2eqkU3J>JdcVCkGmfw6i%&WC
zHTKObP-(sXGv}G#hs#UPm&~*H)4k?pasA7u|K9BEJpA~`$1U-9zGnP5TJY)5%4pCe
z|CcOh^Vu~vD=)t=HlH;oyjSd1=@$NfE3@tMvk#yBGffVjezywGD8H~LKdtUc_P5N~
z?-_S{7H8*H`RK{n6`JhmJN%OU^5n8(CpXLONjP_9vws@zQvvyQ3)78$Cl6O2y1eq>
z6|25;vkFVXj_;T!zV5HdhQG3_VZGstoL}ZD&ij7$O#aKO^NxH<IPbaUnqlmP<h+t9
zhpJf#*C)9fi=Tb6eqTaIy7So&C##bm9sBa=vbo3Pi20y-giG4Dvb*2SQrr6O^2g+T
zvG>8Pa)<kpviskh+#!5fedBMQv}qPIWXva?n-_NL%AxfiK$FFGYnL{j-<x2f9--Ll
zSad^fjz0f#wO!Yi=`Ek?uUq%@VQx<CXIKkucP-QBe=q-NoSS#0De3!48>{a{)knUp
zecT%BZ6h9geqrEb`|nMWGdtAJrM(S3tm=QqMz1#bbIbc#JFB+#m1mvdy#MjaXIMF~
z+NyD1v6Wx_cZoQ=?6c*$_v$xK+gJG_X!>`bm{*au>r0=%`aItx_NCmz`Jf%UcOOLE
ziEExEyj<;?{!aC;*|RDZ%{BfJ9RKsDRQjA6=$Oi$Gn_kSr}f_njMOix|N3{C|M&3o
zIp5=7AIbW*u)V72cYa@9Qnpp!yPe`a$2Ok~{%qN?fB&7H#Rre-x4o)jt@bO?&b9F7
zIU9H%n)$;kncmI%^2Va_zWvIlh08l{8z<lTvgy#-eOXm%^Y>;nt=<<a{(VltUE`lm
zSr<P%(y{4-v7M;=&ld|<+wCiPoYhxV)zO?J_cKeZSJ(Y^OmzmV(7wgF!(8ptgURY;
z?;T3FDy*|TyL$KgFHvV>3jh4Nyyk;P_A;w0k3TgTwlF@DY>LhPr!mhtdV1WefV*>^
z6`J%0yWjp}T3ceX_V!0mD*w&0Zmz?--hKAJ<aR#&=lTBH(f2cJw)|qhns`0!{*%2K
zv!jo$6`n0#yW>e#mCcX;?9C}LGff&lmfW$eni2Qvf==b@UDs;1q+MF!{I}`hnr~ap
z4Cl_XfoA#-H$XY)Z&UyOTYoQawe;5iW4iV?_c7zYcir`41lX@W>0P;W|NEJ<zTUZi
z&_Kvp&GL$k$K{wuYu3%3`StmgnU`(yt}0r6U9jWtN6;?WTk?6(hyrhP-4Xs^PyLtR
z>EHiOo>ldGec>;kod0WLUoStVJby-2+LwQaW8(}qJMdgKC=6R{@yAQ}UY2fNtJ(Zp
zr-av~U);(s{`Sgi%k0bG^MycF)`N}01;;P!j83>8z9sA9gCB(tH~-4Bx-_pP-0n-3
zXK``=#if3m4;8rV_V9z91yHls-B|9A@}|5CNj8@QoewX{uK#^x?a_nt(x*u+d1+~}
zSNdnu-O2Lo@MYyO){NiXl=oJ9`c1ak=*oU|vblKOv#OZGmfAnNy!mb3?0aamKYPcE
zs{HBVJd-@vZEX9Ir}6Bq;_9eZYfY0|pM5Nm%X{|gk@Q>DJ6dM({6C=$RgkGZChw+Q
zlfP^E_A&3Hg;CER=0$$|GS}?$ml<;`|HkI^R{Kw{cS&Q;ymR=_>Z3clUV_)yt={@5
zJZ8_?*S6Je#-&>x9{t!kd;Y(h_0ZP;4D}1;p7+%s?pB*u_jBuS^{vs@uAH4Ycec2n
zOwQTl!q;CnoIlOI%vDou`;{5FYF{mFcJ7k9EI&W$_u=%lJBpv)RR3?BChK}V%JANr
zCrLZr?YIdYx2$KX&5zlg{wO5>{Abzto|(31xyt6eyLid`lIvs((|?lN)e6_2=2lBF
z_gyz}7O%?rDBdIP)?d%6zN>Wqn0bM_Zq2jhp`VN2-MP-)cW)cW%zF!jU+lhcecpGU
z=O(rPALJeVCU^8@YTkzA>OQwQRY|wrotEBv^=sc%ef=3`<uVIv%sA$&+wj`1jk+Mr
zyYF#9WYwy<Cw}vn{!F&`T4eEkPTfk=|2KM|<zIvK;`jZP=TC$$KWd--c4lF<(CYFY
z@B2qSC6sJ&<Tn5OZJC+vTJiWegEN{P>SfNmGIBW9?YOcmp5LbaM|R9B{moy#{k`;B
zqi&|<?cJbG>g+<M>+ky4$<94C@mQ?reXYFsS0_JTc(m-kU0761^6#&Hcdfeg^(77|
zzv;~~V}H2Yy|{C?f61q7AN~FK!gob3&Rnwb|2oj3C{WIQ|BQ1-{h1egl1o>x9bW&=
z|9jNyMZSLX?{K|8=xBTEy3Ad{dw-fdgQc(M6s^2`#`nUZdj-EfK74s*)~qMRZrN9&
zrtb*Po^>Bu2;5sMTyXv6{hd4Bt8J7zvYcN}!j50B)RI3oTj+H3^?ygidTUzE_a`L9
zfp*N!TiomS_RfVb+waxH6v(mFZ^>FMIr%nt2<tb?J`wc?|6WDzsH}gOxqDv4y~0=T
z?tg2aT;6k<=iia4^Ho{?k^WT&W3qFcFW%5tw_iYS*R#p#rt0(NZT|FUX5=f!!t7bE
zEoRvr`1S_eU#?|Z|BEH;JHMXBxfsKobNinC70tcB|DC(l*PE-;m$>Dh>wW|(JzaV~
ze(GHPOR&9t-xrs!XS~+j+t|D?SLE~U;?I9pOXdBV4e{vu|D0du7QVfG$??`X>$3k3
zq>jFvxa0l)XCHcB9gN$&JnHj~W9!O&nwx)|=1$Ag+bJ6S{D<<KTXI&}C$BEtx3bjs
z&zH+=)${lKxc1WUx$EL<zq0>ad0PW&hFpKo()X_Qr|-*zSF5YjK3%+DRR5B@`rjPq
zX8*p&vn}hAURy0Y><HRD=wv9pX{CalR83NLk#WCY|GL)KbNIwXE~|+<$9&SUlh~JS
zGTD0O{huAv^N!jdE3G{aYMt#V_dhWI>pexjRVNdF^gZ42U{C#|$IV-6<sZJRc+&gm
z%(Bh>31W7);*7(qd)`+a|5*O-0qbO^c{ytSVm7MXHA@%fzFAmx@6gt;JGIvHe)rE?
zo_@4>e%(&1IeTm@Ok*K6!TYzu5r2Okb-eGu_tCN3C+k%}uN?o+#fMpso_%dt{c7R8
z8&S5q?H()h%5Bp(eg;07V1wc^lPtgFIe)}rDrar}S@5IaQNr_?oyPW+_FpC}uifl+
z*|y(eR`!fY$WqvQmW_+;Cs)jn?Uw$mZuQ;m+8+BwpI01warMYAmGeRTe)qkq%WQA=
z*ChSAyDLgN&nG9p*nehW<-si-noS=rd#si_WAtOr-G7$9%jLJ8JQ@7`L6gP5d%ioa
zt#~-;v!j&h=3RZ+xySu4Zp(*+*)8D@>0e)*SCRYnrQlsx`hUN#KmSz+MBkbF(plN>
z-kf`{9Dg4@S$Q}*>tt~J+G{J;@0fZ&uDY!F?sM(BU(4%%eX;ueMBTn})?!7$<gQrZ
z+jqDwH_!ify#CMe_jQld>ylLO-vMPqaP)Mme>iOa=WuzYT=eIE<@Lv}f3GSk-(&G(
zrGKr~hY#-)oQ|w<{In*oE^S`zrDUt;%_h(qa)bW^?|P=4^Q*ts%EryJzP(p=&c2MR
z!LN60onG&9ZPCpD-5VPfXPvjXrBmVc?Ks>zbw7pj@2~#-`+wV-KjG%KRax)nD_FXB
zepl>Ja4c$LSCaHpk`!^>(Bh=)>glzzqp888QOQGqi}4^shnS>_vgKoCo2DmolK(!B
zuHC=y@tNJ%-n}b+cez^LcJ;33bCUZEpWj;j{pH=4`<@rucAt6vr)OoTZbZ~~Wg~r#
z4r8|n_J+`TGFipb_5|82j}JXvdeHRx_b-vF4QsA<Uf1&P`#S6UhbJjI+n-OKUf91|
zT&JJA_H6jqH8sV5Jr|z8C;9xB_Pp08qK+N!sw>gi`R~b@ql+KUznrr6)n>Oj&);aQ
zn{~#0){)8a$rTanE=#OWwNKt!^ySq_<8yl+Wvz}sTCDrRt?=#4%BumzYH_P=EU#UT
zwtm<mEVZYGJ^66XvH-!YCI#8AR(1<6Z@VF5e@R7eeq8Z1spPGu{&!~WTh~4F%7Lpp
z`3kaMP4>^R|N2c}{hWDnJi*y9>1IJYSI-KX=Nrtu@tNkkwM##p{c6i=dsO>;jQ;v8
zq4lPpCU4$XzUN*0ao**#<{Z)9|Lo-3qaT7N8~&LSnY^>=hiMqIUyg0E;n!zbPi}F~
zn;})a^?}3=tG%`2Jx6P=IlNKkn`UUKmOoLpZoX8~Ps#3^=VjL0C0B&zue&z2;kI*p
zwXVKF<c7enW`zuPrB_ZKy>xhK9>1-O?_SHexTL)nzf*X&Kl{e={Mnr&S0k0T`>k22
zK3zNP@3LQSGJB4{Ioe}c?7MR2<M&&qy*^Q~F8-67;jc9lzxUZ%9=p2uXkEyc?!~q>
z|BqbW9o{M1d1LRg@MGWP&Q9%~t~_n;iq6w-6IT|R?K>{&egAT>f8T3{&E>z?-rWg}
z>sKxpe*bZCp&S3{U9ZJo%T7L??7t(TU;7@1b@^#-AKfcyI|JBn9dUdVI@{*C%JqnQ
zTKhHke+zzZb@uCr?A*zZ&sW}@Z1LNI-KMg1+utWIs(-Cnx%#h``sbdj;qjI;(_>0a
z%VS03r&=ekw*O*yY?bZlUB9Q#_!yIW#MAfKr?1z(Jg{k-*`KuI+J|GW&c2;llf={a
zhjr7A?eX6>=uO*o<iX6>2OsqN#PuiVE@53iXV&Vq7CVnmG)>CS`ugcgqx!U+JEH!q
z<Mt6#+0FUn*asPnw(o4)Kb`&hs(4xL#}8Y24$jG}U0=6uy=nSH>D_HdR#Yy|^X=U!
zHz#7Uy54y!JIg1p4!UnWr96FhRl%BT2c8Hf7m3|`x98e}kiEME^J=Hwf5ku7e)Tu4
z*L#nj*tPY}?Vg7xSI%0q^jO5)eUC!**Pmm2zRa%l(UqY5b#C)y_L%=tJs+cInRecF
zTXp=E=+{5xj!Q<Ko?$mNIWD_1da<~Ld2;rnC+D`f7p+V#5{vv_SJ8O#m{;zLM+c66
zxEHg+v|?r8bDkm}+rp>UtG=C+xEH7Ud&jmTJ;k|675P`5Mwpl9K6>_J-oEhZ-u}sZ
zYhUk)YTv%{p4`i9AG`E*`F)$$&MmRNaQna9vz>wAO5y%@CGu;6=G5Puzhm7+tBSev
zE04*|kNSP+Wb*35S5+IUvWw@<oK@)mUh3g4zvS9iy(<%ErsweXNN=7ye@{>JVbgbQ
z;xht`*`kXD&zziLWxn&*Ddp|cx1QR{U#jzb!gZ?~6F0<!e_Q=}^R(AavtQ4;e8sZp
z>hkokbBg}9reBM$PENMnJL4DYXMyWgua0KbZ+-c6*}bZD@j1f#ugX^yMWx^Ww6S6T
z_2cL5R<a8(-@eh#FiA(={%g{coAPzvR#m;uxU%$ol|I|yEBc%6elPv^?$yE`xz{sZ
zPrm(ne#EhiB0kf+b@wCq=SN6CTseKU|K1yO?B6g==6=VyIqtEQ&FgPW!p9e%WES<7
zyVYgw?H?NlO6ZaAuRdAx*u6F;{+q`-iy1raJ@)6nzboqXqY8sU(`TQmcF64c`fBw)
z!SZ)P^Dm!1zt7Yzs49J@S?y8x&)V-JF7Lkg>UCjn-~Lx8j;>PsxbwJv<&lDqlFgmg
z$7}rb#r5rLuXS#{CA{a=lUFOVSBiVvuTr14aqrPf(wFDoC{5#0n`e_;BNg@g)z!zB
z*Q`JE>{WYg!m9})-yc2MtzcODDCyT5P5z!;+q+h;wAfkuwLn<?ywuM+o$8%(hI=iF
zkIeDRi=Dr9&GLQU7EY^rbx$kr|Eq^L!*k!xo^@;ctEX!IYrdV`dF71u`fDdHUwOIm
z>8=x--R7nF`oGP%`h4H6d#_^a<rWuSeO`F!c-+b0+pl-`-J5sw_>Oahyq&B4^JDYv
zEgyZ`+{eCoUAVgcotksux-nlmrPJd#Jek;EvH0gr{yy6yXM_3EV&C6+vQ|3$?MgSN
zHp@L-L5~+zMO=HMs{gw=^7`q`ZQJL|?3MW>xL&mET~XerUhVTWPhx|w9sP18CY#@T
zt<45Yy{%8AUT2?wqwenC8*zH)-dR?AWvW+f*W=T_uB+!Jd;696`(yvjzv+LslJ7sN
zym5#4_l+k@m&WzZ*je>);=Em^>8bo*uT8rBSatvLt^HB8uZ}$1^V+X(#=TjURatBL
zrQLLW@60;Bh~50!>7&V=`V;Kj)}EVg|4Gh!{l3?-K4xi-Gxn+9V|o46?@Zjzh%{^a
z!krbbj}$!Ve0|WcxR#m!-bv56Yu|;xSFJx(B>TGH;o;9WJ{;?OUKkNRd(SHWxgS0B
z*PZ{mSadtTT;J!ludmL2y?Wl9S*3eziuYRBrAJ&pZG633UiVk%@8?yq`|o{SK5tg(
zcelOws;*8BuPwS7KEK$l>UW6VUZK<XI#-|nRhRVpYg)wS{gq#@Tr6HZ%{=?tjL)UK
z=T`nuvwi+7@b%e%&99l5FSdsCJNSI$I9;W`tiOAc-78+bc)w?&r|Yil>Fqlk_rh(?
zo6I%k`+i#OTkfgz-EB|OOyl6VbL^kP`p?G5?z>*RzN)n9`ODbN#b4LO&)xTG)x14L
zR~|hL_ve)@(|P^b!seJwUBB;q8N)r(qN*QXUAb~bRpqyd`tx?qh`PQ|%;x8VqANT2
zc0RJ5e<!ZC<!edjRntrDyXMSe51xK}iJ$)Qc{95o8vb4pyP*Bu!S6}7u}P)AXKs8I
zluQv1uZ^7$Q+eg6*7oV=b<fznbpLa&ru3YzuEeZUjQ(f#RlUkA+N?KiPifM1<>_{_
zwjNnA)B66MSyr{zjy_lwzI^&(_Tx`(pPwT&<4;%c^{P2X-YDOXe0Eaw@aoIyx{oI>
zw(DOh_dnzR4dIfi(qCaWc6#rvF)ZGZ^y+eS^Yf_QkCEpi@{*?Nv&*c$!@BFYoZq_G
z*rR2u`BGm^)@SpMsrRUS@nf^wnz;3CHokf@Y$r`FEZTg$F8TV4nqQr%@1L?R6N_EK
zedP9<qTGzTG4_wr@7|C*cRhHyTb_OL)~d>^4=V-PPv5wiuy<BzwQ1p<NbyO_#n<19
z6jh(U`s=H8j&tSoOg|klnl`z1?c=MbnK$z-Q}xeTvOMmmY5V3rIoWByd><vp-sjsV
zv;RiMe=R=y?>Vx2WwuuQTBg2j{njXdKEr7-U%O8&{QX46iQn}~ZH{X;Uz}lS)$3;&
zJzo<fEZfp1@5qXpJlFd7<G1d*$)Dz2U){Vm+j8>0*)sc$r^!#;X~2IVO<=9&saZAI
zKkhlE&$XydS^LdfZtI!qjlbg7o|~E+zxCO*j|sCZc1mT>Jbn3e<kRA79oDaAe!i&I
zKWpc`f6r`duk~c-7k+(K@p#VsUq`+#4xjzE=$yv1`ZcdD?fMVe+G~EFUpedZocO|`
z?=vIp3Z>>uJbN`LxN>o1#sf9`;?f^ap6FDc2wXqy*D8tLIjh*u&)T?e`?RjyN!Iec
z#vdLi7yr$gynD}qGp1{JAKYqrsCR_*N=)7>q2TMEr>6Hkf3~KlxX*CU6@lbey(cGg
z=jDG*TB&&KivFgfdpDmj^7A{kbJ-E&xaItRP8naf?!L3*+{D>`4+KsAXtigR`{d6n
zvv1z6@bjNP&(2iR`uNY|yXHN9DO>;O>yMMR|K#|2Hm{HC{k6X4srKdT`~Q7qwfw>K
z>dPbdOPiPZ*E|xwEIj|mk(aCE|Gp|ZduB!P!=m4Z#P=E0zK*`1RVX)E%3#Z#o|Pxh
zTD&f<s#a~6D4u&RX2I^ljlO$o-KDO*Gdy{;+DG!TbKbE|U3~+N>Ldf+g-Ls)UY$HW
zW7aIGaJjErt~6ek(Ww?tZ@*EscIDZsV;P&p{~UQUS1Kvb{?9}Hh5EX`Q+V`EkNuce
z`+fKQxpx15p7#fx@E28i<oCVr`^;;<ZJr<d>CM#5M>n}2yE55dxA?0Z^G^@{xbH4|
zXFU<<Uaeeicl`TH|N5$5x32Ho_GD$FGtYD5`9FQCn+kJZo!tL<?)xpO7R#6azw_MA
zy!QX^`|+QG?jM-Dd*VE+t@nOieN^dVDK?)Y*4{Mv_nEWle&<e=UR*u>_H-+^dE2el
zKg*g`@x0Hr{s6O_!QLmT`k4VwugAnzU5_-p9$NVMir{}xH|fi^?R#^r4ojZf@Osa~
zIS=+63_5(YBl=P4-X}>F*ROQHRL=9?`Xp*yqlKm9;q^Oh%|6~-d~RERMbXNM>TLe&
z3`-47PQOpk2{37E=q)PHF-`b%S$+MnC$^_sgVtAO&6%3Lah|E6jYXL0r`7pS=I%an
zb^q73`E%v|zHs-Rd9GxcvF~&1`#+aG?z7I@^;9?Ca_+~T^q6(>f1~exnil(KX@Pph
zkHhl!wtTC*Jo}!>-_!g5oc?msziyLl=bUFI%V(}Dn!4I&`~JUgmxES%dB3dx_q^Uu
zzvdzLa{t;_!M)|Dg69?Odcdl0arfuB@_BWyme*xj${)Oa|KGQl6Z>nPl)MU_U-b)g
zBiGAQ;rl+V+qHTB$KHG&{;CVjYV&gPYaUDcm+!hf_m<7S3i+=q+;vUASQb1uP_lXU
z-JD&IMAzRa__kF}J$u)OR(+eh57^9StSeoct^4(j{NJi?9qu+szdp+U|Jb?p&)@t1
z|9-i3eP7wi-<|V+biOpNdu+b!^PJ~4yt5zA`F-bk-rM+(UEx0dRhK3&Yqx!qc)3-t
zWZ|;UhP7W;$JgGFJM?hJP3JS8FWB1LzIo2f_K70@%yV_$Hot#$bn;tPy@JM<_rC8d
zKYaD!{-0;_*V%}DcZq%XQFL8F>(k1J?>lrqJ&=8V>F4?Se=qm{d%ZvH{C2tH#Xpq9
zcb+Kej=r;K?%|u($=}|WuCKm(#9HE<Z%^rN_j&2zyDm))+ScR#JkoaC<@x`<2=_nk
z%_~{_a@O@d&w}1RZh!7{{65du;5m;(Hdp)VUpqN#{;w;`w{`O$=bdI-%Of$vqO!<%
zS=-6&?QwgGjy&C}W?gP7KL2yZi}tl$YpwTJJ-^|<o-bdgys~lQge6Bd%}m-OlO&$9
zW_mJz;U3dRe<f;79=|HCEm+(AdZpxYe_lg3ev9~jpQcCGwOijww0drN-m><kcl<27
ze;@n(^{a25z9lc`Z!~?+6IJQ<-A{fWNf+GvZO(I>^s0m0aTn&@c~|#+w|~0r>&WH8
z{x%!;dOdk`$d#@7)8zR!d;dJupRZTG^R%z|{-0-WOFh{8<EZ{TxnCFB{l4#cZd?A>
z@zX?x?C1R7=KudWfB8juJKM^mp!ATpGwm5@<zG(KyoyMDe;xhWm)^H0->7|8JpbwB
zp5vVFW1d@u|Nimh{=c{Pm+k*Kdw-@s%k{nQN;9v2<E}q$eQ)E(j;+OW9?R&~+`2r^
zZ0|$f{26sWr`K2Rdf}>nORs9p`^EBqGpa8=ES&J!d;b^j%SZLfHmW{Xmj8L;lhPCI
z+CBa9|1|w8y{h+wy<PacrTT=S-RsEnS>jf|3JzC%KfK$wxU_Vx{m;qvH}4e|>8!c@
zdEq<5_eB-u2e@b6ll%Uy?|9o!JHFRN7YyeY&p1A{yUMoxwxishWH#}1y<>YeT)MM(
z@4WPNzw^p>M_Zq_5Rd<PDtz1LcJZh^GZO6$zfTvpk2z4u82o+LJmEQ$3oQQcJWw#l
ze9uGP>3iRF9<R}fE;8`vE6o#aj^Fskv}^9>@cG7_rped2^vshtKDm9^RGr;N=H4eJ
z=Si$ZI)+KJbyw{cpE@H-eA>?118>yzv#(UEx##v@K71ju>g%&#SJd3rq#gPBa{j-U
zFAp>_ujQE^9tFzccD4^W{WISC{8)Tq-t=8pmfn(AWvYH`s3)*T`Qel2{j<Z9ujp0Z
zJnd)yz1aTxJcb9gADZQJ#Kq^Wsr=O1{;})#tML6*)um^J72XHcy*XZ&bG_yt$Igb@
z7tZptD$E}kE_%*6gImS6!t}1O-mE>!2iH|yUG4XM@B7+l`}m`)Jmt1l-+dkTw(}5o
zkIlF9bx9T1j!Idyy^eifwU(tn{FBt{sl|U^$M4UqICMJvcR}(0v;TkZ|G!&S`}ISo
zb8?5I-zr+ktABfLy1vr4y1o3)IqPd{wmwm~zH{ff`G0TD&lS0s`E28j*-F*NEnDa9
zE$+XWUwugWt*oi8<r$CKe&%V<4c@C+wy*lg^q5)x$AOaDx9@G67B%m=<ok|KKX!0b
z&->W7G~I@8kF?8i*Vgj8pfc?C{kG!?{&L*+ChkoC@?}rs;W$ukieJZQE5G#P_7kp?
z9$$Uq>(^sv`0>k;S$D2{HTe0u;<}>w=eRffA`T}%*r``pWl_|tJ%5*sZA|V@SssV=
z8zmma6-x(xeipFx<Vj0Cjml%!9;Dy7+}wMn?uxP6^86%8>tLU}M@e5UJ!p=8oU-q1
zZr<g6E>EUT-%+!-_{)cXU*rF8otj_1`?hb*mK5Ie+D`vE4D_6?{CxcFQIp)`w|3&n
zah$)7XUo5`@tpf@%ko@tjiT%q_doWPZ+Tx+<Fwo^y@uz+WIOrgXC>daRkZ$jn_pku
zw{7*aT|ao{s%M-@p7LVj;g8i?r3JlDmp@l}Eq7?Md0{^P#Zx;^`sQ7__t5t9%=0nZ
zwx~_`9P2K}ZBzJYo}A719YrhhlU~27O!_YK?D5fgd;kA^pP#)>UisA7&u1Q&{IkCQ
z^IX}y!i{T9zgA?=`Caqmn0w-*YZdLz_Ike(?%l|KRw!J&&sMMQW4FKj?;FQ&?VkT6
z&^+9k-|&^hjA=F-PKi#ofBsfg{dq%b-ki@@q7N4fpO<^|>gtTu6Vq+01+sVR8FXoC
z`JB1&%<N$BXSdou<^AUZ{P!*oZ;!toWBjM*s`|9T*yva8*^`}ZEyH);x_ZmP?$k`<
zXS><HeE9kJ*>6^z*GCEr{%QO;apHX6!6Li$XAJ(Ih${NfS01vazklA32*u~03wdh!
z-|VTnwr2L@qZN;yCyQR6J*TJA=#e|eo>}*fRDAvSkiWj7>P@ozZM_?zr>(S(Z#{T+
zN7h~E{g;dKuRf6r)Aj#Vqw{m$_r3W){rqc--m->W=bZL+p4_=z)jZ!lB(ooKN<W^n
z=Gd;E8T^lbYw-BW`M<aMEMa^8kKLN(?2F~i@4fx-=!mH$`~P3p_wU=g<H2w7!h3rw
z?iJMCTFuJ-{=p|%sbkzK*Yo*{Ur9!@pTCjpt&{wt+OYb?%fue@bEa16uRpE1$u6_D
zs`A+fqiyTt=5Kqgyh&$?!N;6?-R?7NS1f-jlbvwnSyhST<kPD6`Y)PapH%qGH}2TU
z!0fr@9O;&)BX6y5J#gvY7ytiT_7;gf_Ac7z^IX(I{nz<FXU@N|dba9$sLcH0V#N*5
z=FRxLm-m?dg(Gv=zyEmLKffaN)bsOuZXf)SD!iVh{_XWT->lEJwi2&@fLc#xkC&P6
zeW}NLa`XJZZ@w9_-1q$$$R!{6#m?{LTlV(?26bx=_<R1$Xz4$+uJ&!V|Mq=f*G~7(
zdR-K?dB@}3Lf->!9KT@mJwV4+e)We~R(aP?f@<&Ep5<KKc;)ApsIA9~tDi?*dw9b4
zJnNxii^B7!^QY`RaA4(guX*V;Eu9~mMa~=lxMTC}iv2Ug{>=AL743(17wYNNl;~_X
zy}k3X%)TS4dKdM?zU?|4`|i>?>3u)G@7Z~EZQj;DfoxGb;u0!89zN=~H*TJ>yM>MA
zk>94zGLBU}lX!jfMDOZ(cXpZX&ECFl{Vc&e`9B|+CNIf(Qt;~7wbk48u3POi+;?s5
z$<tN6&%az-)mEB%)@on+&UsZnAF}nURi>+N{PmaHW?#UU?ucJ9+doU%%~KctVi&kG
zt@@DSIqAP{Hd%FLdHe>yKHTMgKV`>>5AFQNCacQ3ez?dsZC20!NBaL3)#@CVx3$t^
ztNZUb@0fpc<?;i&TjGDT#%IWDr_P-bKmFs;)yJNHl`!5J@cF6P-=CqfuWLWgzHjsQ
z-uu6Cx6Lcw7|Q5P`BUL|?(e(u{U_r-T&f6nsLwCGTktpH-1`k$?0-O4ecqmazDDF#
zx%Rn*+h^HKE4_B|yIjqm@b5S7Rh?6<6L>i1-p4+RHJZBDx&7un-(dXZ4_6O&z`XTa
z<L9OCoA9umcTW1A#l?KKud6B?54p}0m)IlyP(1s{{=c{P-|Z8(6W7lAzT>#<w7ncQ
z`4!LSJm-DhQlI}~?|~nJ`LWHfv(J{l+ca<E*DqJ@uI`!aoa38s`?)9EKl{fPIlbe5
zudUvk*XN%jqF%q2+sDkyuuyN+r%w;As>b{D$Mw#OdTV_=eEIa*mB+3<uQ}&#J^iwK
z-@N{LKbURaSDxR!#<E|(?B_kD>Y&H{P3lSaN>k3xdsUg#e0=(vsp{?F&m-&#qc4Ac
z`VG{i`<80I{@#yGlgl~m7M?o1nXNZ`(wC=7o#*0fBCmh86*_)$@)P+#2jzYCC_O#S
zZ>M<jF?UQwrcC&`C!$*B_fFdU``Dkq|KG30_P-XZO*~%C_<jHXztd&v6jju#g?G3A
z@$#;H`r#b+=WzF}es#UsG0DHa*Z=?ivhsX&T=(S3wZ?Jjb6>yP_&n&G>bcKKmOIz)
zR5O`*`0+`b^NGJtH5*^&w|iDuc8F7bi~jBSudBjK&l~^N3km+ss`6a?*qrBf-*>*X
z_Nrq$yZ)cSzB|u%OWFw?e(`YE3ETW17C+Yi|FvHIJg3EsdG)hfLTi~%&z-|0KkeDa
zl$g$IU#`T4KW*x-DBiK_izR#RwGMZ+@{s#qWql@PU5@#nH7{z<Ms7v(Yuz`)=gP^M
z`>cywBg%horSw%TzWq`Bt9QlCn_*iqwO7`nAYrFG?~R?sYvtxwJI&=5`mZ!o-MsL}
zv8sKaA54|@XG;2Z^z&xlGu)CgzH<J3%dM`ioF+fDF!0Ig+UF}3{U4v~FBkbUvAS?$
z`lp`Csi%)e)v!F@cV*s6^)fTtCyy$xp8jr8qyNB~=lO}pC)F$;eR^|J?vuAwU$l;`
z{Mv+{D%Tt4T32uKt7ALU+ExGJx&Fl`51+m|`f6j!+~aNGf8K0dziIQlzi-oJ?Qhu^
z?);`G9{fJ}sO1};FGZE&hq`6%J?*&3yl=Bbyv6y7=ZC(l&P%_txA)7VFOL@|_skEp
zZtp){(Rira*k_K#^;y+#`yC(rP->E2m=JpZK+*K<Q<I|hniktu9D9~j@%`wm<BR<L
zk{*2X-1ANG`jd&PRoUK0o_le%JT~E(RNC6>9&0|uL>zq@&hO8AZ^x^n!Tj!fK|^k~
zI||PU1aA*NFRZzK+mEBu{~P42D__@m{_D@?r}qziXrEwZm-i_BjD-C0539Q4Cs+P?
z@S$?|`Qx!QHWUBzwOgh6?_2S#f3khmJekU^$M>ginD;tLL;U--lMgKH3$rT<=A~3P
zeTuJXUVboe{qqV-w_@A*CyNswpPZv#_xY;2?L$@f*mKIylsc!?FK#}0`18y?)i3yk
z*O-4gXx%s0%D+y(>SFh;Dy{xG$q$t;WW8Q<x$f7ShsiEycg4-y8E0c_`ufMt;)r?r
zdOw6>_nKDiHal;8&-FuI|L2~17wzMp+xNUW`?2Oqm*w>S{T0j49gS!{o_y-;&npLt
z*FXL3cYofaA6L}<-t3yByevF<o%r#^&)v@Mva4Qxtm^9I^!Zm-N47ql^F-~POilmh
z*UCn0&R+A+u2H?#eKoi^<EYW}>xbXuudRAzduHpkpC`}m{C2Sa%)G@`KX%{yy6zkM
zNq5ITr>pO6`|N)7`Jp<QC$k>x|9$s;-u`z=*Ys*%dT)QP{zK@q(e#}@uMf)Wt>06@
zeqgoPzUT+Vng1B2_A@=6ZhF4{-{<M}JP*WE_pE;CIY-@iUr5=yd6ma1_O(3apI`b}
zb%klg&iqc{?^!2TR@ohUpmcb$+4~DW{<$ar|Fd;=?ah8rkLj&^;3uzn-KyducE=uH
z_ui9z;KC<<U3Z!5uXKtGzfJi1;c|hVMor*(_x@7;i>o&BzdjP9|NqC-{^u2?=e{d^
z`dYIx_WH^CR>gkSb!ltt_R82)AGx=a&t`w!XHiR;bLM&yMF(u|cNl(~_}=)F%(I$D
zGSBY1=kJrxE}Hji{bTXFV&5&-&r3IWGgHdo?cVpb`POD}8HN8oD|K)S>vtLaJNM)E
zgNQk;``(#u-F5xk2k|ty?jLi`mtKw*{w@&{{Pjci46EOveLKHe@!M3Z)Qeu9cXhS5
zjbZwOt+C=WyrwPjPb^yddSxcx+r)w_e}n4f?APDSymjQtL4QC0`CqS`^tC_!HQen_
z6xZYHCN*ykO~3cY=*;%F-zJ}5-?z&4$3gyiKd#@s@&3=b_glEx<7GbUpEdj!C=tK!
zbD(hcqeEX0u-k3e8~iAl>0WEX9`6U+|CaB49ecZ+T}HmGO+ABW?eU}5GS|*%=lm-;
zdhy`%ldP+&48QyHzjM7>SyVac;i40)z50Kie`|i9Q;~jPGP`)-wf2uoj@K(T#NSO^
zZ6UWm`&4pz?Vshb|6b1jxAL#h%6E$5Me#R_{(RZgfBact@xdodzWVdN+&RAO#LUv7
zg<r&rGv2HZe_!)^SNZ=B{QnhFU*5Dnx762S-sBpY=ay&AZ}`c`8uq;TqaVv-`M*Wy
zcA8y(CwK5+q14>;4?8Unm)bv;JnwMpob$hJKiX%%G0c7>%XR;Fp`YRL<C6bg%t=^p
zoBtqj&D{4wJJ%Y?XZH*5li0XJ&gb)uP17R2IZi(Atan|a|77s|d$*b@JG|%pUGu$W
z-SvC6I$QteKc8AqeeL1YFjeQ0iffw=s%_l+%;elk=_a+Wdn0sXzD`Z|T_?SC`MS=R
z+Ijm<h5wbYzaCv#bNtX`?e%Lu^P5$^_-Qn)zx&UgdsW}mmWjs~EdSZ9HD6-Q$H2Mu
zKN421uU%Pu=7voF&zLPQqQ7f=mHeF76FzIrY;~#9s<cgEcJDm;vJW0!%3oSq^-AKu
zYr?hTuB}qXHYS{GeY~D|?dgYCx2^wiaLwxTrJr1~Vr}P@e(K|2JTH4?q5pob%dff9
z@{@9}oVL>Mv8ex{S@LQp!-nfC+mD|W*Zr1o-eUXbh&4;&c+PiEId1!|@Ur~>kMjP<
z-~Qn;PCuQz-Zp<vM&#ko=7;Mq_m%J8li|5Ie%<nC1=`P~Vv7CucTLV#*cRS9`MFH>
z^(cOSKYh34_*bUy6Km#o>c$;=$D${<kvAu6t>!7&J6X0oeviJr%hdMQ+hJ&xT)4+P
z`{e4)XRc0Ot-g(2E=E}0|4!A>N&4weR-0AUTsbIz`~|;&Ue&#w6@`i0KChHK{8dzQ
zqs89Wtu0diEESb2&+j`jv%lienaS&~$?#1xuH5ugdB&gbVxO*Vu8ULr?K0_?>v3oM
zn`-N;itMhPu?-2Y-RrTFEo~Fu8guzMwofDW>{wB1TTqjvc5Ku1jeq9ZnSP2|{9@`3
z+c&-DesSMS_nj+UcX^-m!^ftk73Vi!*=+vxk<)ye?{B(~U&#KZ{`|4wJySW0f&_7Q
zJ-hE#g~|W4#bfULc$#u<;kh+Oip(s`H=a4V>fX$2S67>smpu*LYqQ7p$&%&U`a<V@
zzMA&V#^CW4eSL!t#mdP%esg$_e0XrRD&pymj?g<X?6y}rm*11n_wSY1VQ89^H*4qL
zgTcx1wOO0nH&zvwKCAw^*KY6D1K#U4?vN^a98=t%zBlX2<CU2wjkm31TldkUKW(-B
zpFgGZ!{5s9xnuv>vi9B1s@hkbI}a2jK9e_@q`qF&y1cV_=QF9v$)Ch;F8qDu=Xt}A
z#y?7RN>4slHrw}pN%%TWJ}JYmRR!4vXIGv+*xW67`groUlT}#{Qv82+tyaI^f7Py3
zZST<sr`F5eTi1U=s-QqwrTJ;&gzV1#q@C3t*BoSa%wPBZ>zSzDhr7?k#lOn>FiWbq
z_R->qyz}o}FTXZEWFz+4R9yb&Df8>!OCnE8tlRmoKKQ)P8QbIEb*_g!PL4c(%U15M
z+VTDC=JhYE2%q)-)Er~;aKB%^KeK9k&br%G?s@%aar(adJ~c~NzssB|m3pjwJjPFX
z%I-C(JZqo1Rz>XUnt$A~i$7cHz@3kuA4}x?<ZC;cvD1M4@!o^N=OuVngXeS2<DWj=
zZC1S3qPAzH<n8$~F|m)X1u3(guY2`YG0yTyD1X~ZQ@OJ_PnyeDde+R{k(E8q_Epr1
zliSnQiMMC_oRyF<4&Uw|zQgpd=hEfx>z>KKuKIT8@%7!$uk@^xY)*dm>dT{(50hQ(
z_f5Gz>&>03F*Q#f<}aE!`?XNATkquK`j>uWNHR}f&8}{C{P5)2dyia5c$Ovpf+>9Y
z_VqGff2?|6DAYWEmXx({Z}ytPt1}*7T(Np@%<)f5iy7t@nw?NHn-DFo7QVN%baqAB
zlAG2aW7>Dj*lAVWc$%?zZPL|nTPe$x=GP7z<{dmYcki03RZnNm53##G(eQKDy=dz>
zU8^r&-`c$T@^hQgs^7QSW9G)$#u(asTfC%P{*rL=yXN0a&*CJ%+enyQ(qGj+U;k0{
z$8%Bcw;wlE&WSYN=2pLRr+Ct}*H%?A8^74vetmMqH1O~jUCBGW7T;X1bq7D+*mP2K
zb=CBXkJHXSWo2^|+vIr6Qs7RF-|M8OFE;1vi>;2^Tf4S<a<p*q+$%!H?85Aqg_O_P
z6`YxT{c_XEgVL+zGml(eEqdA}`SsQHhgZ%zb9M7Klfn&AuRlInaryg~o&KMmeL3g7
zZsWfvYrfyO(|+dl$J2u5@|Bf0i;uj0_-bwHyp3O9X{&z@^x@C0NbXZCu8^B9W6%@x
zk16ub>h(3IKdziyU3^45_W1YWJ*8PE3u8r-tCF65DlYx7N7Zl7Yo=xk{$0~Ad)SCC
z;CpXiSo!Q%*X9LL%#+>cgcWWrSkpOCI#}JW=g#b3aqHY{V|rrv-Q$?~@2RSPee~+%
zi>*BeC&d?MuROWq)5-5yTl2qdd{(t7P3O4H&TB_b^ga#Od2O#%^_^+|s~?lS-^hj5
z+^vbNefrdD=G2{qSw?>QcFc<Mw#j~Q=gM^{i|totuMX5_f8Seo(s;Ue-_7EQZ||{h
zoVUJqQu5iKS9;dI6c#_+Tr9k~-L&ZO6M=NT{Ohc0(zg}F6MGDji`FcU4-xx*?dh%=
zZ&Gt~zphT&`r(TDweF)I?p-J{-abF(Q_o4mpDQ71u9>FY{aIX<y;JP*yn8!e`FX|n
z=gy5>C!6O#zx222w2%E=_i7KUxBB;FUDw_Hp?iE^?{wSRDQSG)qB5!C`ivPLt*U;%
zx_B$RcKv+Q(u%Ds#iyt1e=dD>QugT0>lJyu=US83od0^eJL=o%8MD~zO&^@*?m5h$
z+Lh{TSkXB-xl=OyY}3vi>DOZJ&RcnMhunm%f_Af}{#f;RySY^I^R7ne^!Gg%m&}_b
zm31s@P4MM8$$Hc8M9iP@XO8~1PWhMaKX&akzxv$JD0#_xo9n?J7l*#D3jcZWSNO{{
z>sQCOPp_VBxcLIu-^ccrMwR<MS^ewu*7>upbRL}9{kC!2x2<jeJfhZ3-gonUMEvU~
zrE?2n_iv2bJF6>r{kA;^G`tRR2w%5eQT6(Z%C<ZnzP6KV_lYi^7nAh$$c$gEWj|`K
zW$*D@zbdim_*A()MQghsA3Sn(#%bZ>$*(#dCKX+lPTza1xN66(71Mvo`SaLcQcu_O
ztL@*uYF*k9>4&erDBt4<UoQXAZO5)JvkR^+RZD*TD^T}iPwk(htKNT|>YVF0e~;8+
z=EKsLL3%r0UtPXk+|HLbqW9u=osU<(?6~%|$mslydr2>QUpl_|n98FzFRu6V*RARN
z;)nJ14LFT7bZ1|i)!j7TrYI{?{BZJA|GfIz{^?t<X}o)u<rv*|vfMVQs?a6LOkw-F
z^HJA=<9`Qu+m_~c-rjw@Jw1Nw)a{*ddEZ!z-ST6vU3n#Z{>Cq@{o-d=%{!h|t6x2F
zR?lm>FIlf`{=Jwqy|(H(XR+}6mv1NT*>&&C<o0XPM=#!x&X3Lax9sc=<=eUElwi2=
z^Q*5mueZv+Dc*BO>fVk|Z-Q$-tq86C7NUK8&#!l^%lMp97O!cX8SUQ_b?xla7Y93c
zCVuM4_Lb?kOrEIw?&z1u(-!HSt1mV`zxCwdWM@8qo_w9WKL0cSI(xqqefhSf-O9G&
z+7;Djw?4k=c{=m;(YgHVI$u8jaH>&zS@`|WwtX}9Ef;=Wc;rh_^}geRm%o=JfrN^L
z&sX%h`>wMy+}e5YbD`YBZ<E~hmf2+=d34gZZ-<TPvzNV*@t+Rt44o6>du_5hd;im0
zVkaKO{ngTWZ94DuL#x*{g?oNI={SA5*6`Zt#Mq=G-+XO0o>E+YZSR2)p-QtfLD6i7
z_USRnJAWLRagf(1=6y|Z?YBvjYpeHMQQ7`z=J%@fyOt+U-|IZ>yVua>bwz&X>9hZi
z6iixvO)9Rq&C>4cwXatUAd5<7K3;iQy<E2Tobk5n{Z03hujcQnfA!^^VqM<<H7hTN
z+uCGZ`}*o>_v^Xq=gpb*^~l?cpDmZadYbNUSo`Ye2W1<}>fY+tf|srD@2R@Zp`U%M
zbGKjhtlP?;uXK0MJpXg6zQN6utA}D3Y<4CbtN7ey$!?SXY31^^8<om_-%PIEK3yYw
z|FX)nsu!wp8)LFR71>4QpJX@QzW;{SUaRy~mshKwkG>je`%}if?w8d1)$YqTy5%m}
zKJSiP*_s!hEsW&W#`~RbUU+!byjk0$n&Y#-os8;do+k77N_XhqigoTh{Wslnla4$n
zI$?O-B_=z;{ZLWcU!l{<Oy{H5F5I3Mb3Io!{;Tb}>{C*=vTWBBohgq^FcZARFrQoL
zyxldeG{3vECE|Q+YfU#i>FA!g`ts?E*4nR=ioU(t-2Yd2@p{Wr%X5p>mQCkpKQrgX
z><It-_g7Z0o>BGshsmcW5yG42*Dcw;Z>5~w<_&LbXWj33`Yz(y?*Fgl>fcS2`mU9o
zRJ5Y<^jqf1tL-+fiG2U^wM@y3s@J?d*6ESz=Pkc&?DJpqY~@<hPxG$U6;ws|&%QIK
z_nyrB?QfXht$EUM)y}ei$MW<4zD=BM`uNG2#NB!ZJbs%y?Xo4)Yp*cx+xkSfdh%m7
z6~8$Z$6l-vP7dXs_PO`q)~<`pmrvh5vV7aO?d4Ao2wy%NI$vU=xuvbG%txu+d^Xc;
zihirl+bCn;+q=~&SZ{}n;pa7tk=v)+>@EGg_TPnjo7CU%S3mkExjVl2cev?IZ(F(3
zQdVo0i=QuD5Sky$pLeHeuJzV)f%8j~zdozl`t0iWS9{|`gO_jjn`ii0$T+-x`@D^N
zzI=H)E$UUoT+TH6B%gCi)_e5gDs6RdtmEc!;M>wU@0Zr+15cJtn`L=VV%^5iXD3hp
zwW@J>Sll;;*E6NEXD+|@tFC6<!FyZd&n=&3ll83X>od?=kj>@aLhnCbs+RmU>+I`W
zLCL)O^?v@jDaw0~H~bI0vOB)=&pS@j#~1%Ct<wwRZ?`B;yJESzYT<Ras_Ijht?%2^
ze)HXPY^wRJ)^+Dj$H?ycc4p?4Co96a&qvI=CAV&0(TSCrS!chV6qGJpdA-uq{tc6}
zv9y&>zBBv!$HB9!#3ya;x&AQJR_bfT>u+9XB6@et+FiDH?}y)8-&kH>{prltb#w1n
z{BBJ5jXipCNu1n{UsqCi*n|7y-RIBhF~9meCh6-s#`!Zg8lN=YR=4KG?MLPBK3T+A
zZw)=ZKYVZP>U%SPJ=v*Ob2N7U-yr>IRU78Hy^E`T`_ku^<m-oO_vh@AvDq=h@b9WH
zAKjh5dNzkYI+A%aUDn2O?~ZSuE1q7f`Dh<`f2G!!2a`S4r1l)MN#6Oo;`yPoGv?e&
z`eweoZ|3W(Pj-o&IV^w1lDDe*#mnS5|J9ufsv=L%xOHut^@h8Ri}Tq(y)O~jo%L_~
z`5E<(e@s*>{JK)KS$&_@w&i<nHSf6=v-r-e?$uv!%$Zu6Y-!6IF?VAP`{Y9^PZxEb
zeXSJqI4Q>E+2S4N{MT-s<12e-*1gh`Q{CU4z4vN0Tg=|L-knkfI;N7R+l{+c=H~8Z
zzAbC<$=cx8?Ax#Jum2mApR@Mg-`T;_4^M20KAik5>*T@RYfc{QzCJ_dbmZPW6Z!7#
z<h%4{wr$7RkDrXz{d&rJtjSkq#rC}5z07OV_1fZ7SDu!LJzH#MdVNMk(yO)4qpmcs
ze3^Ld?ZWNbON(EB+tPP@jsB*$f6LgnSr-JoIk0NK{r|X`cOQqX`FHo*JnbW^-e+pJ
zmo|K@VJ?67Mp=Jn(YHsRBd)5uy~)}8x?SJ=`qn)M7@`8+2<-iON_6`6Q~9UX|Gl!?
zuekQpQJadaq)#XIcJ@|0`nF;H&t1O+*I!rPd2aoTpH@{nqxau!T%5~(&9Yuw{d14)
zww=#A|Ni^CY@fNcVe;Qqr912P#5`KXe*4Ik)hmB;Om8=D%bqvGcAB^Z-+|dpRRK?~
zOmbiRMDqED9_{<BZ;qb-x^>!X!!q82BOmUqNY^bc+;MJ0d{t#a)H$YLeZI6D-O3{~
z=D2SAUAJ!A?44(~Sr>eH>+t^1+5N0xF_tr>mmj+^%dXJS#=_h%ZPx3jfrn4*ov5x~
zoaAF0cUr<$Elp4S{^2$0y2-D$F0Wjxn%5im;7-rl&dJ%Qxp`9Zg-)7E&q^<@eDyG-
z?p4RtD-rkNYQCk^z0KXb-Ryeb@;FP=?cwV#%Oy;GA9cmjJtlwe^68WJ9eWae``v+!
zTbSp4e!V7gom{Wsy&d1bPcBWeu(hqYdi{>&+Jgs8Z`gnR6f}S1*BExgIbEg+XRW_Z
zeP^?0&XJzt-ftV+=54f;F#p{IYI~>!GRk?&?cA|7W=70jnLTOspZETn<Jcb){%y_c
z$<wP0u1}q3ck*=HIgc|tvYtGe>(8_P_}s%W^1t>*oV(v$xBBM019fEyb3bn{|7UId
z_21tLztxu)pPUi1&h%BnH(!1B{*$J856;ED5}xdS_r|X~yPka6v$x80<D0pLU#|o|
zR!dvc?!TtD;OmEJ;t~f$f_;=M+0@plv3IKa$7UC7Xy5$h=H^e?de`f=&a>EPtfl{3
zKz)7DNyCa)R~8ui>HE*Mv3!v5=+l=_{yx<{GsEm(VLG$ctX#k6Ny>kz)zMG0_lN$;
z{rlopW6d9<b*r~5+di-I*t~jBBP=kvwCZ(*!JZkvj`V&!cGCFR^3?d>tB)^Fjg9H4
z5jpK^|H$fc)z@zV>gr+b&(rQo#hsDMI{Nk1+nIl!vbq_@EwYpDe7Sk1P4x-Snm&I2
z-nhDFlF{=&FaDXaX}S$)b#GNw#P#OHf*q>&F6-WC|FvYA#n&S3cQU_UYxmn^KgqoI
z<(d(^m3I5r|9gB-9#1cfZ8Ww0TJ<l=TL#qdvZ%CN|7d3amv3k6j;&<h+`eOHjpenk
zrEL|j%z8I3FZ{-;ynR`^->0IyqsH#<eec**H$+}<&fKkM&?NNrftk=@^|Z@J9-P>m
zH*ekz$%-PwT4k9vCs)p>T&o`U_?G?F$kUG}DZ9P<sM>Z<?$MKDRfeCAT<N~P^W<66
z72b9+pTC%zEpIR6=DYW`U}NZ>HR&}$FE;;QwZpuAs@iM!#rI5K#^#?r_<Tc@@%8Ut
zuB>_d`seDjt3R{nuL@s&Ub1s#dfcO9RbNjQ_g)b)_g^FUNYC=n8L7yA{bk|VecP8u
zJWIHDV6)pAJIga0)cV#}FgInd3wOS^_kf4b{6#T2MI8?#k4rDNGre|omH745hS!^=
zpYs@&{{Fi6Ugu4F!)p($4)i_^<5#Z?jsN-Nrt#NDRaqy+^B)}C{RF%yH{Jhhr|NmR
ztEX?S-}f!ny!_v;Kc}ptzPx@DpT9O~_KT}e;#MqAi=A(3@~Fzd;?99jX}s~dOWM=<
zlYR?juRAFdZ}?mN-r-H|`hK-*zyIodd3DC?qaV*aaMR7dHp#lHc<#3qRq5*GSMuL-
z`<Q)D(3)mxXp^sVigo37wd<|3qy6Wa?lt{1$FVQf_OWYe{`W5@w_dZn_Q2Bk`m%eo
zs!G>+)jmz1SNJM;woLlVwG*$Krt$y0didfhyPc+C#VTLF$^4w7y1YGd^}ge86GPMQ
zJ^p6!^Xm5<oojdhUwN`($@I&g6JBgswfx!IYY(o^s@)W3dF_q6?Z#;`dxE{S=1bV5
zcRt*>=4O3h<el#u*7QG`r?+vJ+phqSu2-*iT~#|iFDquXOwsQZ(-*VHU!V40*NDY3
zCA3+_C~D2$N#6ILR2w`v=|3lG)~{26@jIWLd|&u<?c>igV)}Q*t!+QJKAWjH_vJyu
zpWlqjd0&cmx!NaJ->@z;ti5LR?(BkjyJEt#dY_)MzEt(R=g+F2%5#5QTvs0db)7W-
zwyeLez9`o|`gSE++5hy<N1bP1#`fEueW|?6Zm(&@Iiq9gwvV42y4`<u>!j}nX&tYN
z^=2Gbn-{V6>Bk$<XZ}4&`gN-Gnp)j;Yl-%&Y?d3Yo!IQh&u^Ap@FxE86T#Kn_2Ybx
zt=!DlcG5WS!NJ|9&PM6C*{4T-mw5U;t5dMp`faAaHF#~{y>kU^##?qgKj>Hg>+*KN
zZ<m;#{p)-zd|smW>#FV3N|SBOEi2z_O}j6*J?Z|RXXeX6YjrMb$9?4TIxYFFyiWVr
z+|q?H(h}9j?meA1>-&bwbKjM$om%^5|I0t}e;%-3{(b-dzn8D$|Nq)Ff3H-*hj-EU
ze}!4U3*Yx?s<+%htIw}zop@P%|M$J}MeA!Lj)(96bv3rW`&yCji@Di3b07aaz;1Wp
zm&$RgIA7^K#qRSej-8u6d+V+J*Ub&LysEC%o)(prae2=C8@o0}?X~)JZ_beiD~!MG
zxYB(&T(9uck*gtj-vYX?Uzwf%s(f#A;GAy8)6CN!JI;9hx@l5+yyZ2a^`^g0tu8$0
z(`WPg+J~*vK0nzlS6uq6_+Fi@-?f;@dxGbEnsQnD-e1?tQ~&LnZuPq;K1TnZ<hSy-
z*N#Xg%&B6J_MT_Dch1CppB{v-e!cYH-uJcnzdlXhZ&UkN`hG^q^A*>FeQM7>U1@(*
z)6cN>rKo<s?e(43w@cSw&v><Y{;$$!^>32pXUlz>(C%Zt_oeUh-FKeq<=)@__ig_6
zt)CAuE&dLg11`H0|NGYUX){c}?+|^Y_gs4Q&r{+1jB1}5&!4$NA;9|M5#ifbc}0_F
z`+(**rpLaC{raSIZpWL$AMgA;SDv@`uJY`(yqM=-3a%&c_BSrKD}43oYIEYFBaz;7
zW=)gXX!(BDB;{vPbEodCd45vxd`;*Zo0_-JeX_q@vi4tpuO>MD>s{`i?oF0ThL3M~
z<b9o*zV5rj$=<KuPD#xu-LtVG>qywkt1n*8TqdXU_(_h`W%kowC+~mID}VUxt+VTk
z7KWAU{^-%Xb^nItRCT`d5&UhvCLbncuW`>_vtD9H+M4eYVQ0hh^Y=tOzcu;R@%SH1
zch<yyNHdSW_TBn_&2#JfCCjbvX6`zZs<-*hX?Ocy7lp+e?0;{zk3MHuaQ4ZuUtLcN
zQ{Q|%T>f|6<4x1|z7dlC8v1{F{m<!d7ag}cs#nm+z2))3^IEm%+}}sNS-S7hwXa_e
zp82Z$x2d)xe_eR~zIE=$eRLmpo%H2DZu&TQe&M?OCFkQz!`6cutg)vT?fNAbyKb{q
zR&HgZXW}svkHBM7uS>JJJI}VPc=k=$yKe1Lv&v&XvN}WO{e2s~^P5*pj{UvlyV?C$
zs(F&+l=o(ztt|Sw@}xxF+2<w&hL%TWzj*rCw0ctd`nWkUUw?nSx!K(K`qY?z_Z`jm
z|6IsD?R7%_j+>|V3Qb;qeqO?-tId+(dRs5gd1i9?Y+l)B)pS|gIj0_1yl9TRY&}2f
z*cIdDeJhRq{El78UdPs-s{ct&zQ*3o|7^0-`=dpx+vjJ$KAQDu#w2(CGrR08B@eHy
zeARi~uqtD3^0H@99n-}n+8-Ow%bs*NBTSb)aP`jO6_VEaJ0qJ{Tkg+#5<cI`G~w8<
zRjZ5N6q{7qrGpnb-~BxA`y9JZ6Z?HY>oV2t-kj$>!@wXL@9E+glC|^7Qa#hZuh##|
z`u(r*@!=mQp0Mgy9Q<<3d|%-&&??WDZ_@3nt4nKl-@cposG7ZRdjE2{FALax%lH4j
zyZri|XQr34<A2|J`Dyz8KVPEve~lKtKhdE3y{FxegZzHrrKoE_3(+s%eOI>q<zo52
zFTPw^Zddy2h`ODjtVO|sv(H2Iza5tUS5S4*JI-kDudD0xO6PsiE1KB7rN8f7{lCxV
zeZPGlB|o}#@YBbag`4hOUL1Kn=>PBi|9=awzxBT2xV7H(uZP6<6;%B^9e>ZR%IfmW
zb60L{+W$uO_rccI<IfuTYaW!mj=o>D>&H=jJKINs{WI)--#ou<?~eO_-(5HPzVm$T
zvdwdz>gcBZ1<iAp*|zQfq`m*rKI^6j|6W8Y8{ha0%9X<M+v7gZx;|%zz=`(5kB{xj
zE1rGZ=lYIgrcv^COx52u&$r$Cb!~p``w+dFhur>i*q>Wn-&wZyb9w#u^62%|_kZ78
zd+g(dcFQl%zWsS_zrWh=<6ZI6bDAY{7R&$p(0+U0$Jzi}_lNsHE_@^N@Ug{t<-XRq
zH{SE+&skq1Q@L3BZpN;My!kh-y^;N0w{7#>wR8KEW>;LBS{;}C`oXc6bElSWIJL60
z`0KADy_>}ir<rbjUG@85yl8a#yls09FzgUWuJxbc`{3=-7puP}8P=}jkA3tc(%f&p
zR8o&zfx*sWRhFL)^qW1d?)I<$b@}q-d0&>4G4A~Lb^ZN)El-^e{rb5ny!uVDy!GCf
zzWG`AIsg1Q|NqaCa+VK29(`NLU;E-nxoD02hn4=dSyiWk=Uw`B_f^>TsCUAqX@B3|
z|CgIx`B?gX#jgwPc30*J?EkV<-}imx`RZk_<G$~Dd-D0t^R@53d}z0?d9+w;-j5wW
zKDr$Fl~;ZH_O|}cil*u(%JMh!OuiJB-aq^K<Hv|66VmTm?49LX^J=HS{#T*vXT2+E
zx7LZ?^R9G#w)jiXg7?c?*Vn$?R`zXTx6bkQdB@xKK2bK*b2=_xUvpb~-ktTub6;<X
z`||8j_eOgg&CTw6JQR*s@Z9ZYdvmAqPfg3wd!H&k?d22St6x|6aqc`Ry_z-6@3$Ki
z$VtoX1}(gQd+1=H&Bspv9QnJw*Iw>CnEbXz?mlRZwD$RxrRM_m?24avJXhcQ>gP$<
zU!VlO+u<qev&r-Sr0nka#FVlASn^8A>OT+WX-jsi-k1AP`t@e8ZB(vE@cCJPN^95M
zPj<+*iQ4~ny7-J37yq6EX;rgRK=TGqcl?M_U%&OtMfKx*8lUQApY!F}we$Ge>G|Hp
zKOebIe(w2)|NjU6+rpBse}Oi5fR;^X_{aT8{G_c^v@hqGcU0fgRpEPImGl+QSsXj3
zBD{F(>e$>$rjM&8tLw-8th`edr}$ZGQvCkJJ+mus-@bQk9>@BksjGE<`d8n&e9QIC
zfpfbh@2$0YX4pT|uXI(gu6**mjLNTnf1a=3XM1vM8vFY>Pam&;Unpc8mcMVM|6kAo
z`?4Av#v++NT0QEe_gV|@T;FwVYgF~TB?l`~=T#-$Q~ad*8?<cno6Gs+1s}8ItY1f-
zw*svMh<m5~`%v;R)~4eI)rX!poxAt>sI7Q)5BHz>e@@Qd!Yy0*ZuYP8J&$ECgECW@
z-UhXva<lor?>xWds&)OOd(x|z<@M_CtMC85Wi5VA^LGK?)#6pWH+FuO0j+DjQ+2J_
z<h-EiJmrGQ@}-q^o6@Dk-=^C<mV6s4w08q&_e}2li0g5^kI&btth3yEce>T`S8I2#
zfA(_i(>Zd}W`%BiJz;v~v1_(+*%drC*H!)bpNrf{oFsZ9CouMo_Lb)fm0Q{L^81o~
z*Q@=OR981l`aIFDFzM&ZgPWi2dD0=9J5SxxepO;_&69(|llS{necyfm?zA_nbFZI2
zZYi-o&G37ty3W6f>fZ+^2hKgJ{ZTvq=PB>MpaS?>fB5b<^5*(__kW%%zcpFXf0jgc
zNx$@l;`Dbl*ID)0rr(j?x%EnOe%8w8OwEOcjL#oy#OdCDz-FEy&XXSWe6fk1(W{Gs
zyX%V1Slyd(d_woO8U2d>%cM-7&n-B_$@|Q33%mX9bLzo6UwwR~SJ>%o5~1t=pmeV7
zUYYZn_j@n)MA<ICHDRvx`M|Go^Pg+Hejsyj-|xHc-&wiu*|GJ}Ia&GEr$<@me4bR?
z)n96=XYl95p?<}q<{#hj&zt>vx%;&PJ39l-!x!6GN~-IBJu*w?b7}24$H_YjznN`o
zd#*OmR%_o!Yl+zx?=&9cJHvXyvHfIh%HwMBEdQ;c7gt+Po>lsL;rSbNpVmA+_$GB;
z>7&JW|H#bi<~g=Hc%De@^@qPIQ_l)3i8Gyf{OszoY1LN_PkJra{qbXemEFFF%9eJI
z9(20MoIiW>%!X+j_r^M3>$ti+Ovm)~k#7#?g>Sm*S6wV?eE6GP&%nkq{$p2o&hf*$
zJBsIhp7VCMs@<xf*D{~)MXgAc?c3R}D8Dr^vib1psx##*d;eW|>)!LxR^az}VVh}R
z=UnVss@L{?&Z9-k7OsCjW$P<jyYqpsYSthB9{p8jWt6^4=Vyz;#^;Z{>-K*C*k8Y=
zw&!H>Hu>WEs%q!^YtsGZ%<8$?^JB5qpS==)=ky;JQf6N-Q+e&`gzR-!_dVEs?;yjC
z8*Eis5nU&9vvgk{tFo-n{hIVcaNgcY^DUzCk}7_mJ^IbN_S?cd|DDHYJwJ3vSadzl
z<r9_e2dxFp{Pp7d_~M7Q-KEc#w(~!J*82AT-@EtAmfQb*c{%^zv;22bi?@9%sk>&p
zjZ<R#mD7_quM9tbw57bVX8s}8XP2h$E7|>G!}>kN509;WemeGD(e7u~{iZj$&+J$y
zYO`_PJuCkw5&xRKey@66smD<>|B&$Ry-#|-Ol99+?gt8nz2TMn<e%(zIVV{2UMBKt
zbNP#!>qm~a@2P%Rttq$rZ<L&UVgCFBJ5Kt>^~Uzce2$CH{{8XX#p|WlzNXII`6|Xa
zHvQGZH&yJ(f%B8tJ5L@=j@-@`_xj{nE5o$;u4OOc?)+@m>R!>l{?MA;_g<|vZoE-7
zw^pV2fA8suZ)WcOBg%JQ_(R~dW9vIMbjQ9)a*CZ_J*h=-o=nod>IboBb@K|lpB>z>
z;p>@sJKraL$ey!jO}NefUhn+8qe18OU(WlwCVi{^#LB1VSlhU{<o9n_zNh)&^dy^?
zyX?Nql32gzuSbVe#it`5I#-|HwSV8^lV7~TcL^>1Hdp%o`h=DF2M${Qi{&}iI_dGH
zA9<Z$llPXMy8Qn8oK5}nzOJe6Td{IpH>Y?&UE;CteRE##3tn}nv`Bvby?>kcN1FSu
zGZtFC(Q0S)$5PpE0_x{)6g%tey>%tvdQa^3dscOojf#N|Jx@QdZaScKUTTMw?bcJ<
zr`1$P7+*jCaPPm)RG;~Q^DK&=s_8x3)i>pNsLFq<`q<Cn?yo;R{kZwkbKCcoZ>K80
zPx(>NqQB~=(mZ{a+NMeMOa4}#E1vhQYv%lipSY&#cg+9uME$)~u>9*g|6`BLRgvef
z>^vx*-v9Ud&#nIY<^5L=KeS$2JpcEdw~wXm&hNj_D)#@y)N-AFi*)K!+tj{3k+8k@
zY1;NJ|7G~9A5Avd>f1kG-CxeWPU9eJ<NKpOzRtV9@yj#g_Tq<@=PUiH)lXVW?wj&l
z>F24r|BvwOH#ricE}uQ``<~}_x1MvmvD5m}^D9=*J2tz|t9@XtV3+l{aL;kucZQ4d
zTB`Fx{U`4_UnC@6obl}B=6x%d%P&)x`^viBrnvTM^J?$;d#=3Ob--bhBbSz*d%kS{
zRpwKTJ2eV7wpJDDFFPM~?22~#o>|#zx6V54Jb&wv?DxtOe}6m{SN+p<=l#kX?lI@T
z>;G|j$?0El=*y1dw(De-CB()4@iz8%{<+n^Z?RNN_PKEVbK;NoEUI~CJpX2%P2<OW
z$qJ{*kEO2MTK)X9;ih|sU+kQ3d+zxB_!A#xh4$~e{Nv1gb<=q(Ub`F0h0F2B`xQ4n
zTz>CM-HpR?*XBKVseb?7v#LUy<EP5gLH)z!`+u$8pJi|T?BkQ}ynlO7E|&Yc;$iZs
z<8CkH{{J}c|7SX@!M^=F{=Ut>pY#qCVAo2kY<}A=x6%7+^}HkI`i7VS7El}Kw|V#<
zrcaZm?@0+U<Ny58{p>#Vv^CQot9-1=yB1UT&3*OPf{jlEtc(5L|2egB`n|Yk=R)-3
zD*xv{x7WBaueaa&-HurQ6}F9!UOnuRTz&m{(}QJauTCmo@+fAtZMDQ!IlgW4x8FWz
zb7|iBJwKDvYo)4BTTi`L_3*Q$sr>67?5p|izfRv9{&=dA`MiwFKR9~S51QDuEo{I4
zQ{cH&_21zC^|GHg-~6R*sHgYFyx(!_y^jZ;-e2{><-Pb5<$Es-*A)Ml$R?k^v#s>|
z)Z@+ddrs(|`1EJt|6Q+JPVezOzw)BxuKUF;r62g6f2yj)e|vxYQ}UgQ#Z1RP)+e4R
z_5HfB*mi2N-(89Rt8un5YdD>f|6QD0&)%jxpEKwI1IHuL(=l;LuT~^pTQz_6$+a>?
zy_O%$HtsUp()l#zqujQWXa4i%**RMGmwqpJ^<Yo4#7&Ro+g|PP_^KE3^-<Hg^FQ7O
zreBS@ck$6qjgZyi*VcURYd_xBzx0yZ9=Ul|$#H9!hsK_L`l;f|@gui(y>9XU4|Z<U
z_2BDq#n)Fq-!FFX_@Ww--SNr2cH$3=mv1+H6vZq(bMLj4r>`zPd1L3VH=1F4Wqv={
z+H*B9`e<l>{J$=pgSTcx9X%uY#+OIGZ9UsGnOB`NUsv1CnQCfSvO1@4w&`#6ZL7X-
z+jqC|E#IH}?-}k(f0UhhfAZUO*RSvGi{~r9nQyxB)zc+mIy)o9*(c8~HOQ{WfAyv4
z#8Z_t`PUWC1(Rnkmc98&_Dn~B^hEV(hPE<cg`aFX;?_*Fd-e3;+S}ao%-X+ZeG9Vx
zw61wqwq)V<AK<x<k~a+US3k{v1={Q>7=7Wzd;9syRfn(D{#$w8^VOGYXJ@9aVSl~$
zvX!0XGhUk&s$$ohzy4C2z9Z^8lXEb?8f&#=n*5e;Tl=}!Ss1TP%~^kM)|%9O!`fHR
zlCB3^ep~m$?Ebq0W$b<HWFIV!s(VqOl6!am|6hL$zyC@0x18DiF#EiXUUt^XP~NSl
zCQttJW}-#mwIFX@-O9WDCj{0T%~ml_{`z4@WN>)lkD?Es4qRP+%qphzTY$cMzW$#%
zsrxPOZQBM4t(@`&?;L9Xy|De?anN_4WvOLFfnoBqu(dOyioPEE)s?Pq5%Dcjq5HR>
zpXqNMeFM!C7PG%SdXg5y9$36Vu1{)@jA6yGZ>ytT|LA#m^6G8o{*&{&r3<UKLydlO
zVApy1z0c)0{F;+mUGS>t$Y%bCtE&$uuiUN%I(Vk&q_Nui&j&6|vhM=5@_mjeC-O-h
z&5B*IQ|`{Jd9yawo;<i$HBZ+x>BF4VoId%?XJ5|U`}LMDr~JW_{mgdp1xrlto&MZz
zTl4SZPPg-OdW^%l+YUZX>)D<UI_e=1)Cym{XVz_T-i=?6Oc$Ran5lB6bxoJ7&Uw~`
z;$pW)1)JUS=0;3*&XeEx<=WMo+<nXJcG~*<yOv*`u$x)^z3hj|rp0fL{;vJ^!Sd9<
zCrK~YKHe%fU8>@|dBJnNerKQF%Jb_l1+K51CO#u7p<zbv*{^y^pL^DZ>!+{FU;FgY
z)!WnW%#JvJcw@h9*1TO$8fL$Kng;5=Tz?pH780{z?+;kjM^Bwxd8~AnsqNR&dG>Fb
z{q{-7-HCp5?Ze7qyNIGAPq!yM*Q?xW6Fzyi%=M`=Z2o*=dYtr?!>BE19s6OU^A&-z
z_piGyy*4Xi-SL^72S2;nX3y+Cta@$E;_1u9@_pCev$4Du<lm!O-<b1$J7`W)c_Z`Q
z{cHb3r?@>$$(tjUoc-&_(GL&q9GQ{1Zn`@AdtbYIyQ~b>CKas=zTJIO`K#pR%|$1U
zemEH)mmm<dA)<4up1(}L>OO~S`~BB)`<=14uGaS5Ew-<;I9xfeFWf)o=T<)Pz8&}W
z+3uaA)@5zVn0pu;St>Ue|6lvkV{lCR`@g!)em1{;v#<X(%lf$UmhH9K?_-wF>Pq$h
zdQ$f2O5=5}OQ)6YF&6TcISZQ8HZ$8cv2;(Ev|9MNxINwLqOP;d+ic_pIf!QJ?Alj8
zpRO!ETPpF|{nwhqH*bOR<c52EPwwCMm{=cw?AM>)Y>(6YlXreOKO;uZaM`haFE`)o
zK4@U_O6<hK-*e`FR6M5Sw7>7F<;}|x{`-4QzLt5_sr!H7(&kH-9aisX{t{W<VOkZj
ze&gTkU%y<;dUGdkZ~Myd@V!!dUWXs9zv92<+FNG7IbWr=KRP#e@2d4*C+<5g9KF=@
zUfm;`cW;ajO?I|<)LZcN+Sf<F1mj*S-{Y{4`cf+U>{saP`%~2Gh2K~1^)h~>I&b6O
zBdgYz7Fk{s+T3>ij=k*;LpkrcTi;ytV6QZtwqE|~!OiK%Ru=juy*d)BU2$~H&E4VQ
z>gK=I+4jAb?eW!2FnK<02lL8so7v%U&m=FW+fUmY(?7$maO0P2U)QnoZ9j7Lq$mIR
zT~V)AuCMugrE#Wk`u#Oue=Xx%XLe}q`>W~k*C$KV9<4T>r0wsc-xqf#?#Z>UMPDAN
zhwrU^SXgzZs<86q(}t7YIy?7P#J;PmSfl;**t+SZouU4^l~1CM7W38aQ9b|fo5y^c
zf}M}PdGpRF-D_3(=vnc;tcQ#I?^yh9QthufB7OFJUC}ggiP@GXS~Z2r1z%1MF8w5<
z5w3rKm)+|m+xw3@UtWCr>*UJL$m^>QOP}_QJ$k~hwCcl}m6xp-cRJ_mZ+%wvan<&D
z^CV_J)|2S|EvNtbm~9+?@!D5kY}d_@Tlee8f$Vt^*S7sSy7T0}B~Rr#zZ+y<J^c3L
z(J!yge0?DKy~3{Sq^ok=*C$DzCVA`ViR)NC`gCQ+a`Uv>Pep4x5BsjJysBC*a{lXy
zt*QBidwwa`{y7sJmk_h(@CnHo&b?1h8J2Hc8Jrwnyf<o(%%eEjn)TOS&z(^#oXoq9
z`A$UM*MdpmUr%nIJ}>IkQKZ#CUrUl~Yroz1pR@P-CH1fC$|u{YtN&Fyu4~>O|Hh+I
zzJHG5vhry=<7DiYZ(rsY|MkO)$m^^9?KYMsS-e^s=|4y6+Uv-TSM)=6r+2+Qe*Wx+
zwEEAlR&M@g<7e?nXnXki>yP8(5;jfnJ$kU`<1^7>jf#6ug8g|neg+*Cvq%2@pEna{
zyk-<$pM83c-G?hT!}pq2FFkMZ^+Dz7%9V;?=En<rUuN4}dj3)3b!_*~Irm$tgTCE-
zZ}o5e*W&8UnYmXtrr0JwS244ye-h%)zoGQp{hjx&y-AL*s-B#D*5>+@s><Rji&?cN
zHv2!aU3bH(E>yq2Gp^{P<oB#sMRz}4IW2fThNnMu{!`Ypz^FUB7pR1vnUi+!$cH4$
zGm;4>1;tPAw6!fwUn!dyDSx!o?c266!{S%>j(m9a#Zua5UDU=ek*{B_jedQ0t;~*d
z260Qb&$GL(ua_2QTf9|nd;7`tb;5a9C(W1nI$LJ)ozQ;IYsK>JRX<<$UY#t@X<Pdy
z_xzX0a<jO;jW*X?*f;lWS4&$b7PC2R-@5xQ>eow+n9tbk-S}EzdbV%QmE)CHCVS`b
z|5pFLf%}Zi%~{>WhEL2&7tFAjH>={<w~hNNvktDg&8>5`D(T3#l{+f0W%tMF8Ybm`
zaX#<sS5@7d+T%CR_QdP6`(CYGy?wc5Y4V=ZuaVw9HL|ubXa7A5)$dz>M{e6nyWi<K
z^N&=0-aPN)#zpIoKiTzFPPp=E(CQghd%w=xm-OV-7u&t2drGf4%`<)dsG#@h<Be-l
z`G4Q$UT6E{U|_y%|I)ffnM<=z8{R(>zBc<(w7U7W`lBbVN-lnR^veWp_qaz#&P~a-
zEw;R};jo^8XWIm(teM}FEKW8n>wkQsyY5<ytelUqdU&$0&gUoU_qvPy)~2uhX0rY@
z<M~;JdwVaY%(2|D^-7A){hQBTeMnHAyno%jeP4o;-=BGU_N;&1+v!!m!~6F|9eopA
z`DE(t!+mA7a?BfdzP?udXQul7<o7R+KKSw_;oG6fr#C<Q^Xh5%UYp+&z9)UX@>Y>Q
zf6ktraUV>!K2eUzd#YmBwRyRWVfy2vPhK3{dGcgTU+szNja9Eg`Qv>*9l5aNpr`d4
zrpd04v<!|H7Y7^*oo<@EXQQ#L#GcaXuLfCJZxp9l?%mRJ^xLDihiiI33xQ5gUGDFD
z?AqI8-uZ@K=VbOw&t89|=j!sl8&<YeRU22GugUvo_3O!wz9Sum*Y}+e`z~s2`N~#J
zUccYI*s{vv*smwS=F9ci`QtV|NxuVHh``q0_<F8y-1F7q`HSXSf6e-Ga<l%vM=Q54
zuPOe^v3;K1PRYYB&x%a$W<Q)B^R-~l%GSxV;^xRC`Pkmu@u+vlqrA$-lWNMn?DM`}
zN#!~2tGLW;`SNvfc~2*IKV02rIiptW<~#Pl+NYttw?geoB^RHLoT)xf>d_j(==G+*
z8dGEY?7mvgmw5g1=*4GI2ZT45pKEV^3OW_<{mZqt+wa`?S(PPu+S|8x^|L37o?C>;
z?mxcj{N8|k{=L85ZA-I`R#jC$xZ1t)c=nYw(znI^j$Jvq`s<gXN&CI}kHy*UjrjGX
zKk3KLz8-g}k56u?8&=#o(DQKVy$HFlCa)7DCqG{k$9HY>o6UO;>^Pz2QFLtT^zM@q
z^LAF*?l9e3V_A_^kza6R?aS&a1D@Vx_iVl<{aAJK)~X2Iy@thmEliWMjy;&M(+Z@v
z%JS7oVPW^>Y&^os+m_vvdsOsw_N&)D^W=Dnd5@hrb7Sk%s3T8iKHmQ8=+DP-JIqV}
zpILc2F!}7>l=(+H42!pNmo%=vd^^0aYERYPS*HZo+Z6w}dPODfr>Vbh@6%T=qmxY^
z9JywEPHLmfuY;4juNzHk4`1ycr#~(I{;cls`Fp2{OL#;ETsgdE>G_ApuAbhmUYhsh
zrSZ15u(`D#iaMWuGk9HbCa%ELu(&2kQawF%j`61SM|&fD-pgEPJl7k;@4j!wPOIMy
zrx`c*M|=(KcRS~~cDub?v2O9_rw2i+^6ze3_ub-I-~FifKg_Rgj(;~ZYL9Wp%E{eJ
zxA$GIiphFld;h>(>+6d8J5Ap`O}M%#eC<r@>wBKRRlaW9s6EZFrf_G{)zhbUPIW%V
zds=E|)n1#O6*?bTH+}ydD?X!i_WN?iSFanpo<Hn3sCq4&Z|jq9eMhUFrs=8wzP_W#
z==_dXXP#F4c~oq-Gc<qQ^8T8QceWpSFsWMEe=@h*oZ2TVee<pvt*a`oKEV1q@?3e?
ztE(%fE7uiWs`jb;Be(vzzWe;+`fcprr|mG^`1eI@`nQs~Uwr4>h|-=CQ}^`5-Tv+0
zWBO06+<B{O_T%2W)4Oge+sgbDRo||@v052)8e?A8tE;K=48I=MGbl}*u*!pPYv{B)
zJr^&UZ|s??sb*eiSat9-+q|t-+LbF!r}ZD7v-1R>ZN*-j>)Cr>g+IJ@`Fqus<PtNh
zpGmfP{N8r8M(XGGtz7=>?9aV1zTb-aYAimjNPPBdp4_}0HU?*6^z#F4OXfWKv}X3}
zr;+N%k35YuzkYgioywOl8`c-U$?rS<<Y~;;D^H`%<zK#?S+ntt`<k1VV{|Leos4<M
zar#$W()9;_?#(%6*q$BJubW-4<0+5f$5rOx%KYn7=h(b@^|UM1uIp{;UCT$$t{AJu
z|GPfLGl-#Z%Zk8WxvOtD=WX0`#Hg%ohUKoF>e>~_8NI>DIlgh{R>}N+nC-h)=G8Yg
zZ|}TE)xELCzj|VmllJat-&vNmxa!f~o3=WplHYfL$iqjE6#YH+?s!vWM|Rzs*S2MS
zhm+UMsJz>4^KGJ?<;v~pYiECdb!AK7UCGGs&GP>C-;djMN?P0RT(|Vvm6W|jGp3e4
zj%nU#JUQ9kLQ-8l*|IbB%^F`@+c&+(g_OnB?|tQKYkH)z>_9}lirC!E9fsn2PyFKd
z%U_#yb@}pVyRzf6_s&~+Qlj_o+wj-lWUpSFFJks;_G{^*8Lta>x|w`iw{gy@^?Uxl
znmf5x``NF{haDHouKxA+-Th@%-?`^khkXx{`#V>0nSAD&*X~uXf0b5#Dz=mOb)>40
ze{=k~_T#>1BKq4Rq#wR0j-5LF@8;=-aehgAD`ewhi@$l=?upUf^VE8Vu)mFA>Fo;8
z3d9?r?&>z{4eMnsj-C^JvGw<>4Wi(_)NNU?6yN>E>woH<+FqVJt5~^^fq{X+)78&q
Iol`;+0BoVPEdT%j

literal 27053
zcmeAS@N?(olHy`uVBq!ia0y~yU<_bjU|Ph%#=yYP5Y-aKz`(#*9OUlAu<o49O9lo8
z&H|6fVg?3rArNLvpMNQcfx&^n)5S5Qg7NKK&N(7SZyvkPYWZZ6a~@|B1FwW=0Hf+L
zW*0_Af14kBOj#}*nW69E+AGesC{WN<&{cppZUNiW6&);&fqJf%qKXQ70(y<9jtTo~
zPpv;T>*l<h?`F=Mw{G6@y8Sa>uB?0gqW-H*aDHfM`N2)8r|on!G%O+|JQ`R$8dze4
zH8eGUZb<m~>8a|v;0qH#Vjc=^4;1!Z-Bp^s_oTm&0;7;ZqX<jbnuvwp!aNcW$Er9m
zsW>ocas)U8A9$z-lJ{_JV4Bs%_kAJ*=L82XCXovw1v|PyCItyDXjr!Ba4ks7geC@7
z6IPjbN+9z>STq)_d{H3JIe~$5iGl;8FJt>|kb@LN8M!jFtnRpv2rJl^-Z&ns$FU}I
zvzuAY4T1E?&1t@wmzH$O6rE5k{P@R-Y1RSr`!&kz_x)P+AZF*YS=mn(H2(;`l9Tf*
zWp(O>sNdh-PTv3Lss5()^K!>y`0Rcps4iJPw`|sf(13sk8OKljQT}kzUH)VfEBBSg
z^4HgV`z#)H{Am_wR9@DQcA-PSPj}wg+2+%CmA>}!^z6*JyDRkC`gr}_<?pAh-~TUa
zZ`%2Jy4PdN=bB_)(P$Q$X`;mvwLMSQH0w%09M>LEHfv51o%nrwSVG;KjVhEkWM9`)
z?eZ{9IKW`}bV_iNq>M#@!_IH(_kNpoW|pb<(eTw_zH&7m9Cv*)^tz+KXwA7MVxv>&
zoXH-MS^K#}wLBgl>wUU?|KGJ$2W$1Uv?htiRVaF^8bu2!G%n!0(8}NNV}0FM?Z`b9
z8*6?%Y+q$w_3P#G(-Yn0UPc)GyXm!;DROVs)>#o2e?A<3D!%_m>jUG^h#dtBrL-cp
z=gsx{{(1iY7(ct8DJw%)PfOnP|Ic&#rcDN%+iHK8nTA#0NNo4~{p~HQ?b9P0GB2xD
z{{Q=ZY2@a#qD!9Yo`r=Qr4Ao1Oq5_wuCUNEe!F~ro!0!CPn`*CB!2r_JY+ep$TN5Q
zwx18%<yn$jPDp1)Z_Ckim#^KDFhj-g#g<)h_v?PI-ShQY^rqC)VyX2PUBx;7ojLPh
zs^Ol_e*1qB`+mLBei|CGHYzk~YnE#4u9CpK9W%E_-~Rva`~I%<udl8yO+P;`O|0<t
z%x#zN?X6~ger%Gecgpi~b2pY{Tv*^3WBF&293xjo)g7DVR{#HePCYlrvPoW|MK#c&
zaFPA@JH<w|zrO6)^YGu|?^X9IpP$_Md|tF0kHNiPSAzXdE^_UDbZOz5>2Xz_Y`jt`
z$K~s5a^zV!KL#)N>pePCx?Qen1&@qHK%dns4dbZJ&#%|-U)REX*tY)n?fWTjZ*4V{
z<~Xza{XXsTJB95DpK`9O2rMj}WnI25!QwH0{g37?xwp-x@kvXlyWKl3Q{3}vtNo`F
z%1nw^7&8wtB%fG5uWD6a*nBHp7T)9w%5FUYkNW1$ul+W2PUW+iT5|U<C-Pj}`TyT<
z*3Hk-8V>ybJpccc<8swHVsDR%CGp5{_%Xe5w_eC=n38f$_N&{@{lD+NzcN2)&8Isa
z-3+WIx;giRO>=GpeEoF6`3OsJQpJmf?N|8aY$w(I{iVt1d_M2rpPyba8=fpJdU~qp
zoaOT)lada-YGjuSu%F;HRm-zq&Nd`J_jsS|s_Tpk>wdr8{+Q*<`}+UYJ~!(AzK+*6
zbe<`o)L~xb_We$A|DE#twS9Z<ot<rd`ocozs|74oJC4g$uX%O1=EFhurh5-=Y)pRo
z`~Cj#Qm6BhW<U5Ek1V+*>~EteaN<auBHyYF8v@?#daak*e(#Nb{ZDUE^W<YZH+K{+
z?vXThdv#^y;!{12KmPN6StMWgBk`)V+j)VcT}4m5RG-~4lRYM^<`ZzdsdJw8x*bki
z6;I7F&!4v-E`xdRu0!2x*9C9#-+znqIaAd?S*wzOx6Sr`J$IddxcA9uTI5SyQg>kV
zoj>>al!DoFSiXEdZy)|Ba$}O~R-ILumzQna^RUbL!Myr^m6eZs&7brbpX=Cp^2OXm
z<&E+mbhqCTx}NRg|F&CypTLd=s{^XnY_A^iTwnI~7H6B(yM4d&wss|4TH^WXx&8l0
z_1@Y;rpNmEe&5=Xx%iP{#0q8>*1dKtUuNj<c)+x^*IY)Jg@>ufDq)3!p@YgpxyKP_
z;<P^Pf4lAW6oJS5jEm+<Ob{#G@$s1S(&XcPox4?Ij}_Dl>g|4Gr268<y72Y$idqY6
zqHF};9~Jv{vT6R?FURfw8TN^{c|Ndx;LlLML833wW4^<m2LZo+8Z6~zD(DxyaN7C2
zEBlvo0tVgrUCZzFmo^E6f03D{8@+6C>a8uAS-*EY?&}uz&uu7l{^C_S!=`f6ts^rQ
z?M!lb@2>xI&E|7K@roArYroIEC;GipeyN!MUgo`#vH{C9=XJRAbJVkN_}Lb0UHs+k
zve|iE!v05`H*Dw=WBhuk|Gwse@^>opHu$z1-pcs@@9!#&<wj@YwunbB-!;3iZmV#c
zx6uEb5AL1!ES*-B8N5FH_6du|f|ECY>|<x@2-scrcE>#Ks-+w!r%gIodR^VND#|LO
zvG~>5OzF?U!oeIXt7O&ZRV><caP~QSv5)_y3)TuV9|>pYC{Jp*@gn)gw%q7P?{1VY
z-?LHp@nWkPJS8%A!mhXPOy^7fqW3kz;7;+EABJsjMfTjVT5A6IPu6mmk5^K!tdEb+
zP5LuO(U_^^q4DGAnx@A%1kW7(A`sdWteEiU!^`FK!)|xx&j@k2V5?a3%Jomw457<2
z?te_a_-&VZ&b#ZkU%Y)e!Dq#ny3d=vrfNM4Kc1VrxVp5@%~R=Y@)3ikV2?7(lwCc6
z$3nwnmmX_*XxbxZ8x>dgGxe(UyIWgV@8Y?<rd>SRc<#=*Z_At_ZwVh*BITUMqOoA+
z$InxuxHYb|ziQwVlQjrz%w9a1m7}FB@a#S2w7sXfqbd@opOQ;W*ukLG{?sLr^F{0H
z1itzgJ3{8aG;*8wVr`<B+~f0AlX#W7PD;ca&inRk?+vxp>)*be@@B^(DSt-Z6{-9G
zeDXH6Y<_g6&~Nkc>#M`{O(#BH<~5`Dn&MRNHMwWx=KNH?`unT;5x4IGzT0EopTD|1
zGJW#Q*}rCdi<5Z0=VJ2iCzHHcye}4bzMG;Me8uA1<9_>fdpLd0ym)XlY`LL*Zoc~G
zh);>LlNT^<HA>qmXz(x7Z-<KXeVz4DJ1$RtH+5#V+T^8&o2t$fD8Dc?Q;*hJbN!%9
z)`h~G|E@fm8*y$`=<1}vm2C=1ZpYkq_4MjoQTuc-<=Wow_g3o#9H`K^w!(^4e_L8r
z^sSR?itX})9X8+jwIhk0`|iebLJRBv|4WU@&|z}_v7khEsod)j!KZr?JB691@mq58
z*FAWqlx3^<>3#kGXkD%HQ*x(U1PVfh;vCu6`1{z1?RaCHel8@`aqgLW+i(9`disWD
zeaD=4rH?+{2|3uk_T2HdvP-3Bzx#8o@K0xG;h$_$k@$)AwW6Y1{jbaOryN))5hIw=
zH}mD9uTR?|lz+Zh+`sCnSJnJ~F8n;}7EAv6_ICBYq#)Lp3fHU_Oz$+E8&R{4`IKYB
zY`dBt1z%TwU-<9wvEJ^r!mX#X^e$g4yZP^ksBc8Z`u7{VsvdIb>U6okxVyVND%7Lh
zQ12&;y=~cAZnwK7wNYC#7B1R*<5kV1+FKX=PQIF#|51kd>&l~s&3)5@9rRhaH*O5L
ztC<k=@({Ov$n=P$LgQ;zi<Y-~a>mGYs9H!oZ&~oL$WL~|ljX(F&%N4J7*pK0dYXY?
zt4Y-)&hUjV3Vu9n=XMdF{z*4>SIFHbEZ+*=ZhR2uFXgyoL!5y)W4Qi9E%`kLVLdnV
z_f|2yjxF5tvZX}gaX(ueW7Yl_Z<Bo_Z2e*uFof+elkff`xaY>S@OtT6EB7RynEqGf
z0#B5b`MDoA&)12SZ{^=~*oEO3|Hni8;^C|>mnxs^dVP6$|E|mvKR!MVtt<Gs^>%+`
z;f~UXfcX-6J07x?)>?^mB`<P~pU-#kSg7}j>pU;+IxJE1o3o-NvVVTkH`%=_yY=^3
zlpXDz=@<WLx&7JN8*Mutw<a>%n$6Bw{CM(H#_E`dUmkVqpR#_xM|iiKoVKvRw-wbB
z)Am{E|IK{oedpULiPswE?SAK|F4$2ftIx89{YFxdr~G8`=qC$bueKLVZ_C*#eCk5#
zt6j677TuO+yvKh<dcDJ%huaSM9{Ck;r$pRVzV_1cRSYa5-S-tO1m1m$DfqJJOH$>R
zZwfpsnX2LiZl&1UtkHJ4d)C@$=Fh|&;p>MVpFgsPMJUgD-D$TA+kZPpzNk#zv}Vs$
zhNo9guW7#b?T|!0*MpWgwSO}nNU9`1IC?F2@83N2D}t$u=bo~5H_@*<CVXH5FB7ZD
zJnsEZ8yY4zJX;{8Gl?Ze_yW@@PnGK@GCV-Ni;pZC3qIQX=mqstVuTko>~eEGoFjN4
zdA&^kX|cp-vvrwdn9qtuK6^cjLF`oWTGeU6iIdtISq}L*^fwks2H%L*;(ygHS!uUe
zonOkTsog`|uBrEwvl62aM;imHiNrabRu&J1CKinaf;k~_LYxyE3|KT494tuFRB>Pu
zRB>SJO<4SCf=2^OlcED7Z=12VBBM};0wY%ji}ciX7bX<}9!9PVgE^60oD&>aI13bO
zLE=*^8|(kRj&EA+`+=pAPu41Bo?>x_3L{sB%IvH2n-A40i|fa&$;;`nKK%IK#2qh<
z-nGnsQ#a$^lsUg+?0&saR$Z_|UYphA`&+?lQUMN!Zy8yx6PJtr_-6C@Q@_5xK7ED7
z+-2XlTiMCySLi1n;1D_?%p`KbCNo37z4LgD&5sAouOeMuG(NO+sqo>Hi)(Lx`fy?8
z<>mg%8>$+;ZhHtVXmHyUX>6@wGns?G=<ws__xu0<+hMKp@SJCbnAJRmQw~f&{Ti5N
zy-#mA{PA`B@`sv>I=4?hJa@8H>8mFbx&l=u)U#+T_<8-AX1|26dxefs)6Y3Sr*wLi
zKdPJee*gb{GKEJ3o7^=YJ7&!2IH)2b_u$&5RBy{)FBV^2+z|Y<b>{o0r>Aqz%kF2t
z@lbGoMVE$MaBIn>hl&*yA|~_dx;%|+cI~MB{q0rZsg<W5*$G`>(O58x#a@*0j_AI~
z&1s*`n%~z5|2wDn+{CJ{ucmslE48?5%NL(9eAT(2-{zCYn~g_2c(%*$z5aULZa+WU
zuUCwII-Z$V{m#;KTh_ZdrrFcH%3*EnXPT2<F1x*}bhXWg1I({1N-IG<hCQE7X%}4$
z4S%UoH_5?^Nz{A3_CN869X}^7In!ya?95>6<|CFUQ*v)l<)tN_!e4uShp>0J3plG7
zy8U{$`#l#6*ZHFNcXw}pWxJ?-SN3(itB;-Yw*)SBE4=A==0fsOp8x;<od179b$X1_
z@;OCaRcj2ZmUvIonWz=I>cm8MxtWDlUpBS#$*z){-4mC0eO>I;&-XuCyf}2oDYQTL
z_O_MDj_bF??k+1#{lv}r!jj>eL#5sn#e!!u)3px%`f}NSYBs1;&b+*=_sh%6?rRx!
zCm-lIz+)?Sw(zv>c8}ZJa+9lfmAq8iez$CP)wW-^^Y`l>m#fanx&M5A{W=!u^KQRR
z$Nv+0?&N$xVbyv2|9kd)JSJUqOfvn*JnQ*+Rvfl1LWv(994va&slF;#XV&}M+t=SI
zK5v_~w6W`nH0Kh91KyUw2Top(E!bNB|Mz|G{dIps*7M6;U_R3GC${{qYWB4?o}JGi
zO)rVVhaLMx7!Pf){av=T*L=r6ju(Yyxwk@cXXoGDRVv(}UA5u#G~MpEUgok@Cpcbk
zW`DdgbJ09dALh!s*l72UlUXJSEoe}4oqXR~VbP01yFVWeU)r4Re|0sB;Eu}zGy3iS
zS!gQ6tb8J3V7H37YL(T2zwQ}#cWv$K`h6tSKcc<sfxA_0;en6G<>kZs{xxm-(WB<u
zJbxv}g;syp_TN_|o}^BXU3Nr7Sm*to&waBJ>pz`TznVIiSK6$^*RxweC?U{}scNcq
z*_(jd$;bPqE}vf)m8-rlF-FYsd(36ucF*PS_y3Q3TKZyP`zrr^6CHN3Xe@X+>GbB3
z9ZD}xX|E44e)ITvf4H!Zar(I_-FmxDm~wvpRq11<m|=L>Ol`Hn#K}4dhn6QF@5?IR
z^>RyuvhZfRlc!Q_IF~3nF#5W-|2`#fphBf;(F?|;wacb2sP6Yz9A5jv|H#)@SG_k>
z-1qe`pIe#O5cmGoGMify8iX198m$5oV}h6>)K^t^&X6tV`u+WVdDpbi)nP{;ZT&qb
zr^YyKMvC&?lBrsuU03a|rbKK?_6U-7d#=gIl`+q(X4Bzgzs!mksa<@x`~ALdUB*M9
z?tTw99+#W!!q{}0Z@T=$4Tt%Huit#VWo^{fpxN>@9~yUMc^;qseP-US#eG&@slBOD
zRXJC6xHo^<VbIXXa!T2OQMW%}-rN5l4)Z^KHamY>`n*av-SA7vQx7yqR@_<2$+$Pb
zR&J$IkNKGkkG+=gN}H{S=nz?F6t%Nx>94+{U(*g)XjN?!c<(M>8^X&!<M+nid#|Tx
z20vPK*|)v*Gslb*QpRaL2}zuc)8{8uB;DCj_{#de#{wHB8D_Ax`FD0~d}X`u`@QNW
z@tC+C^Q245R;=*2cwm-~j)QsnRbQVSWwPN04_iy;?l>nCZmK9#ey8x&w~A%9r}lg}
z#Qk*X^f;j}TpRsF_Fnn*_4Vr4pEjQ13}<spDYRV9_j1``)1LzMIxCLLv)Roy&tJzP
zKiTKS!be46d*ec;ANLpXP&wdjDct$wXE}%5x_<{-_^Vo8*d}da-D}LD{_aRi>!;3l
zyZ22I{&B(Ebv@tp%gXXQKEK#Fuk>2vtEh@6lO+_QBJ8^gJ!9CqHceD-6Am!bd${Mv
zqwc92W@cXYY&TsO;lLkwT-0-S`TMZFfjuu5m0KkoU?`Qf&(rEHI=gz=nN2(A?q?~e
zQxci7D>cj3bCc_tpWPkqe2t9_iN|F3`uhA?ApSz+!M1)G%b>Sa4_n2rs8_8KIOxo0
z>9S{ycx%StzwY@0r<YF<vwir<Y1d1Gb=?heYb8G%Z#+Ij#X9ZswA(*j8Or}VE#RIX
z|MuO>jKa@+J2t&!>+rX#KNIo(Wr=5c<yQ~$*hK}eiWKhgs7&Z;C@xnD<$9;g2pX0Q
zV9{7$BM2T=^kovcU~<qf(uUF2@W{tQ6?%Wfa+&71bd~*PD=Uf6@0zXlIBvnSr;{2(
z8(1egG_Y87iYUCP(ctoKuHfELlaVR6*t0=zk7x63&`9QkMh4a^%sR6sF>p?3@N8hp
zy7a&dG>}=L;K2Bmp?eufO@h#ZhFK;%d_gS@IgS7a+XIU<L272OXe?0U&6^C;%FZMb
zz`r5G3#3Mkk!!`M@uPvmq%xXvKzU<?Wh*|T{ROjG4mmy8|Nrm$ocsH1b*?7bI(aSd
zoUB&#;UN3-HDw|f<}6G<=*Lp`<01Rc^Y#B0m&sPWSm>wLqueOb*vxloZOhYbUnJP_
zCN!M*e!pISwps2ZP$|1tD|D5Mj*37QlMFL&>E|c@PakYrAHP3N$~;f!MddHudB4BE
zpDt@%rotK(6r|L-e#x=_`;$*k(_MA$gmvhR?fLUX#Ko5zJ+$-Y+`yiddDwO3t@!%C
zTdn5I|NrOtK5liRxGfnIL0yAQd3UX5+Ei}3vNBkm@BaROU-f^!j{h$u-mb4cr=Y1v
z!ca-C?)|;JpAK>BpIE(qpO$s`yO7_j!q@Bd+kEO+@UJuR>Z(wqgaZr*FC2Nh{l4Dv
z`E^x`IQK{UG%#fqKE4_EHD~u5(9Fbf`TCf9Rj+k3FDz(0)EbwTbYolY?2vUak#*m9
z-#_{`>(-XcJLNTv3(n0jbY8dTlh?~DD<_An404^O7po-@xZI%ViO0(L{rg_6bgGeD
z<l4X_wf5VVXBiJRJ!YLQn>_C(hkV_Sg$vj%s=j2*G*0j9k+-+YG?XxUadENxrN1`}
z>;Kivw5#3q=VO2UlzFz*$8zewZJvL0+u7dl_v_>L{rTj*^KqZ`mD6{Qzs(R>(BQUM
zcCA%c&h9r-Y<HgK-QBfvy}$*Z!&@>hPx)PcEi!%TY|*Oy0`I!@c6snwzu8dqHZwt;
zk!!`=w`r+sH^1Ga?zA#uV^UJcrS~&9Ktt;yA|f7(-FjKxRVV#QJw5H@M0YvOf}<BV
z-`ScyeUtU04&^0Itv`O=cs{S%Z|c?k_4S%MIzCZ)<u`mAn6k=$M+R5#HIOrYbF=8?
z<<`bRpEHy0m)*`?lzv5Vk@?+{$#W_mb#Bbrc!cXw<-N-1M;}dCmwS6#(fhsMz24s1
z8v5tf*6gQGr^io=&fBTFyn9db)F*D&IF9_!O<OCGHs?IcgH4ZDDfNi9`Py96tNryw
zaL4oad%w^7_2>5ef6Jzs+^u{*w{Y)q+v;x`jz?UC)Rui{da=mds_@Z~2x0qQFBW@+
zSU#3>7P`sHm60;r>^pl~p+kqd-qz-dUwgM*Ua#D8yDv_I$*$l2U&Yoh9D7e!etvee
z>)^g;XJ?-V4V*uHr5t;GU2N!`M@PG--gTF+U2-X=^lIp<Lkv98FP{26VB9`m(Te58
zA@}9F&ZR1eWjF6O9J-{;(lL+k>#M7i*G6xDwSMFItgEXuugeL}um896)!u*qzVGjU
zdtEx>Qp>%UxAXVQ3g_(YpI;`lpyAfdyoKww&P(MlUccF<fm>WJL~U)<)~=aJOqti#
zM6Pm=T<pdx+P`}CzMs#eL9<|2zH{sCa9GRVtEzSP$GhF{Q+|ASSaec#y2o_ASdDpV
zGN-p|E|_MXFk{vFd={qZvbH;7cE2f@ZfMu};qCVOtNb~V&(1Oh%|&JLYN@pv+$?@J
zGo35#vSH_!m&@mKrClsky|nST-0DjY*OtG(mnHbu_WK>>@c7!TuS)GcpD}**`I5JO
zXxWRUk5b#Bwq~td|HB#7h1=PEdz$cqhNycDi7WS&-8A$RnYLS__Ty1;(8#?dpJ3W)
zLA^a6oFpv@7Cgwad*S;i$o~(c0%(%z*SELY)8p%QO1%!5xHSK`Z26p7Gv$rbdZd(H
zYr4gBpFC`r4|}}emfpu;{q{@qJAePY8^^?Ydb)o2^=(`8?%uk$IN@xu7lWSl5%uWn
zo7f8rR@hI|TzI|5p20^zmHWlgLt?hxJ@vadXB@mP9GdqgQ#g-FJ8VsWXbQi{owp*d
zZq3x&efII(*8hLw?#<hLC1LNW8{4Xj|L>E3a_jT18?^$8>ugy~j`RvYTh)3o)xZ7v
zj_c1)MQ`3e<<Qyt%O~4h$^0hrcEaN*(`5~58>eb4h-{I*x~A~>k41}=R>ziYIlCeK
z-o)+c`kgVxQ)O=GSC{2YXI?s==ccLy<5|7?9#8Xjy)o-AKa{#Z@rd@sH>K}xN9+9V
z>eiUY`1g~>0>;K|dnGQX9`~tUH(g`tY2#CRzxj{ue$pQFF@>X#fz`y~+O=sdtq*og
zyZbCo{lVqb?cYRra*t{*SeQHOPI!-A^}E{(_DEew)$b1|`yTAD`SkT$cbfN=r*Cse
zth{8rzE<SqN55TfZdzsEdG5_vdR{AE=jEpM{VTio-#^s3NWesx)r6&2V47COblK_V
zw`}g6jQqA?PT<A$?5rlga^Jk-c)4l!p((-2yWUtHeIH@LdPUH?&NZo1D9-G=)y1TU
zMPJTH%e!v+_+nH0=19#24|AqFWG#&?6G_`$5%*(xx{_t!k;rcjbzGU^PK>_NbMJD3
z?Ed>;)BF3o+b6p!=4o+dbV#d5hhEmRez)Msx3Zj@tGv~I?lY)$U3vPSXQr6wQm<aC
znJJ>Xw%op6@B5G^cJ-9C0<2qfCVL!zaXk0NyG@HHPOI7Nz3O_l*vW6VcD+0P+t=;W
z1ErDxkqaEAX{($&yH3x0C9$)grAf_!k#|-F->J)b)sK($I{%C*Q&;(=_ucPz$(?nV
zqF)&<Q40v!5<N{fdfKfMkM>raF`0L8>S_nZv!Xv6PHjD#dR?3O!{UYq%ekg%KU6zW
z9W?XF-+f+F`Gk5(-Ax}X>W^u=Gi}~!<^GDBX1m_J(0shkKTqB#{k87bCY!GZPCV;8
zq!76@Sd7&~HcQceaVrPEd$Yt%fkj2rtED40_x%%G(D3WHk%(pH^t;pA_srC*771f(
zd8Cq{%B1YT$jeh&#(isV_4YOK`{Q_5Twfo5zsvgA>v@}^r`zsknQ6^gq3*!=^_)(L
z<`#jQPd2$fomRQfS~6mx180B(^U=5Ui6uAxrk|4WJfO?SwIVu5akKGpzTA?VxpfAy
zC;V8$)Z1A!7Ff2-&%1alb$jNU33}DL)}Ad%1O->|Yl|zs@e7kr_iTNqdAn|Ub^Ede
z5l#-)E0ZQWa0{-xuralBQg8Q9T}#=Bvl9dsG_);I3<_=5s|GK>*s1KmcviMLT=jNY
zYu`J~#}9HO(+aK%m?$xVdM)f4i5-`mSf<|<Q(SafuFbf;lw%SDtBJ=gz0*dqWzo}q
zFF03mQ|X)D?4~r82_PBOc@N5O?YQHv|7>{$Tm8NbNA3tMXm~cQeoe`)H-;j26d1EP
z0vwz#gqZDqv(0{n9?RMDS`j`COtT&zTYP%nW445kDiatPxiZ*37<sOWEt|dW!b6>E
zHQjSt0#zIs&pNKYrQuRF<KVLBXHOSoMyAXYT+qOF=K;v97$>QM$(wfAfWl+N$E~OP
z9_2*7TU>oA;!OT&-Oo%}eqzo{T@0)y4Z@Dxf?`K+Z!wVbKe6Pr+yTx*N^3ybzv%Ky
z?UJ0RcZ<c3T~0m!>EyvTYt<bX&n5|HDQ-HNy8Yw9lE@spG+(BtLJJzEb)VSXcvf$>
zZ~4ye_l$fTnf?haX!vzH_-+7mo^@>5{DVf;LL7>WTr2u}lV+b@7tU5N?e6i(4Utbp
z8M#*QpY@%7m%Zam6N?VWPa7`g>~T82ZTFq@8!kS6Op(eHL>X-h9yExEihA}+nVwqv
zV_WX+l=Jg!v-Tz)?GlxJd-3q<fQ3#wf9~8`tfSKF@pjYgO?Qr$+{}%XoZz<EfRmHO
z?LawW?532?9$D)!E^hABFE1`;J*;?i@j?5aW77F2wq#yTxxOwo%lz2GcY8kjnf_e#
z_W8NF+LP6MCxM1bR;c;TI?=$$yd?GXv|BE<yS8?FPdO+qJ^lBKd7FGUzp?O_Fj5yt
z?VG9<dP*jM&GLuZf}=-|8WlcrnQ55Z_R4pWpQ@^AUugBGlj=_&_uEhVeBM6(*4AwG
zsoLSw*6;h}rLf3KCu)m_Tc3=ktaVw)qMh~s>t-4xHt|TC`LyxNuhY|QSsQIVH-Fju
zsE(XnPRGrr$9|u3`uD^4T3?GKf`m1+Zt30%_R7tCelKQy*+*Z8=VxcDXJ218wfg<u
z@Mq`e>rYnqFUy&zzwd|BvokZ5LCad^l-<fSl>VZ3)}ZuNNamd#8$s(G3Qn81I5xAL
zoS^8O^6kydOWX6~MW0{ulT81y%-?0#8_6c0i8h5!daWx%=KZaG`ObEw&!@Whty%VV
zQw&xqC|zcLduQk7l9!iUw+geEM9#1*URLzl-}32{6tyOK!8WF<udhUf{Uyw^ulan<
zyZE}LVb@mgs0pWKce$rrE|R|+yzT9;>MOT%*DGDOmz%!a|J>OVn$^A!qWMj3vIHbu
zz1R(E<*_VcnRp~6_;4HV)qXZ%SB}}{`C;>YXPbr2e<qz{o_lM_qC2-{zTBIa{c%g?
zn+wmPpA{CJel6+sJ4Wb(ufturBhz%Fr&Rp=wtauE>Oq~F)nRL&fQHMWwq|j@V`@q0
z>&!|%^7hWo;M&sc<(HRz?yS%Mvm%!x>P_YJYU!x%(jKP91FR+Q@9hoRniVQ(Q?X%7
z-rXp}BQstk_uHz07W>51{d~Idq`FSK7tf2OujZ|qw?yl_o?*X6oxhCrmV>#?yZgkC
z?Yek4U4ij7$DbF*>=D^#b{sYZEe~0`V1dJ4&?+6#?KMA(LWTF%iM*>#a*(N7$&vR~
z=yS)d@*QtpUtb@7SRq0-p}8VSgI$iL>buDK6>}&4EVgO<?(q7`O5x&*zGn)~UbJ>y
z5xaZauRA*m7ymN3zhPg<`5U{p8eewLjNbjmLM{3jU+x=C_m^`XZv5e`@Ig*PZNi3U
z!TJl1KTPlu_Fgc{JbzsuUw?mthhD@6g=goIkFN?{J>~TEmBH%%Wv48X@&%OEymxtj
zc3Ns^!F5B%j<`*_wog0en%T(A=lr3zpkS^2?>EL@FNO0ZPLnN6^Z(Rid`>{8OWrhV
zijd2WxBT{hHq456b$569n-9B6U#q>owsx{%^05`I2O@U0nD9!O1a!aNx-i;0SH9Js
zW8zvp>m&2@szuH@$uV>Mcy?%g#6~B#9tlBr(Wdqbi{1HO-rv9fR^H`hy)m_4uf7sG
zyU@9PmBpI(d;WgAebr(`mqzXDdwX|BJ!&~^yRl5f`1FjDLrGP|W%t(3J$L<?zjSPw
zw0`y0pE8Men^gk>ZZU^kkA5ZjaY5JdGnUs1lax+~xGeva*dEutPwC`Iw!*x(la}%q
z@99l$f1#QF`Cy5&y3UlNtGBo9ym@Ke?Oo@WEuVYM=f=WZZpq^BThm0g*D5sdDL3WY
z2COeV6r|Eqx{LGctE<JyYI$#CQpJ>%IRxYK)?eUszM8xHjVaHW2=?C`PkbESI!~P~
zm94lbby_UH@qyJ3Ha{sYKDXh@1C9WP=H$04Rc6PQ@oZ0+Hn)*wkzWIo)FH8R-)<zD
z@k!dIezD7ashQr)`1y=IlgNb$TX&Y-%#FOAx$DigE0!s~=U#zo6RAnZF6-^~O>W<{
z+-JJ2in`!xK?_E%j0Y!9i>+woc-*#4$7uUoz3-_jjoVm^K&AYgL^sPDZ#EV0F<!hZ
z{Sk-2f`(@+1atQ|xqqK>(fioxw%vA5S5!vk%mYa*Shy8bf8VZ{{#(XGxBHASlgNbz
z={b7U2M$EaaHdRTU^VG3IJ@TTQ@d?33m1p8T}U;Lo^)H~gD@l43xAzW+m^<baZJ<=
ze{mu8{H>P<dX!xnm}Wgawk3CG|2xgwUlMldm@95pZ(PEnvB2|U$~I?iL9t`EH{EI1
zt4_;3cjc#h1JkTlv+WmC-RFMX<oagwg`6{!SZstBG*r1wvua$cXWiHJXy&fmozq!_
zI0GDnJD2>Nt5-ei!Hgaj9W@8WuM0o=Ousu#yJXAhyvwogYBRLb9GUhBEoeyVxP0uX
zU6rAI>^C0i`6oZma|mM*;qN(|-1qUoj!%d7)&9Pc+_ySp<)kYjn-5pC1y%ms2`bXs
zWkHRRo&4!HZA}b(JrA%l-e(m#-z0Bcwnjuu?9_{ki-YgY;}zDcm}7V(12p+_$y5Dk
zXyv;*J70Y~{>$>S?<|vvjLd8vr>E&&-UO*=T2Hu5mo<+`JTb>%isiKLF89y8Tzc-H
zIis$g-n33(^;12P#!2C~r%YL)uBN{B;E#`wm*(Bw#njl+F)Q)nB3GlLCmt_vY+NjK
z_V4fSr&~CMQ*LZXG^+XW;fAp7-CHv&(>M7}w-v5>cj?u=+DDcXXH<o+oPK!1EQi30
zd6Apbe6y6hzdx(uxo^%m*F1mTn%Lc8@AiI=n`vLa&u5;EW$NZLGmYIp<UEzm-xDZT
z^<tsXw&3M{Q;+pZpFYsYoP54n-XvoJkED?cXhmi1?{A@*cWzD9JdoV-FHm`=ZgTs!
zZ&N<%RGLrU8}>gXF*Ezk#~YJ=rpB$kb+G74p!?J7j_eg%ME_{5E`ENl=z46qXSbN{
zsk1_RuRfn&A6ND5jb^WusaA5oyj>g9t?l{p!u}Gb(E7!tAbWX_afP#`MBah^ThpHZ
zJCJ&ROXlQ9t*_tb?kHE6SbQ%b=d>-ek;U2>CQK|fuN%YGL|ioO(+pnb;po`-%Jq@^
zJPEV>dutZWGRvK{!&}NMXGII6^_^Q&Pabh*shaot`ugq5u6H_L-uz};$KH2$Z<pL$
z-5%VrOi=B??1o*bErv(7->dT8`7CsGSg8-2IN!m{28lxOu+QCFnvYHHUnt&uly%cz
zz3*>ImsL(Oiaf``qPJj%Mb_P2TMs<-7yI%=c$%{+n@;*6?t^P%ljH*b@Ld<L*AP(T
zF})#>GiSo)M(x)UGK}|+Iou7Ye0ZpJQ^m)moe!G0L-d7gJ=ci4-q@V(pA)_Q`<35k
z_6UZr4$~EVdhMK#{L$PUZv^~zyfN!gk14w%S>LeD=Y;FWJr502{S+?9y|}d0`)dEQ
zdDZVUgFmOwuMN9kEo+`P2Q)qS_Wq8-WJ&8a`bVn*Shkm?8g+WKSe9j+j(u0^FX_}j
zop*Aypk-`@M5KbiiiUZ$-)>%77rT4M;RX-8pHC)V+FhRi^1{Mq&`8zVk1e2@#o^c2
z*UQ!BOvt#pDl}`_w>_WF1y?$l+_`a7RAQq3GJ%^$WggRQmDJ_=mE8`QGqz^$EqdxT
zb>qGw4)2Mp!q>06R&17W!2z^VFmB@|Z}TnEeWvq4gAs3EU0XZ*)x<tYW4B#pZ?!<v
ziQF$I@{3)6{otD4ZTE+luSJ&4)~oJ4RCy@*gdO937Lo2p?mZHM;g16syRCe0TlHna
zzrVkazr7s)r6u5z(TaC>cds_Qn0a~G$ul#JuT};4*d-e7wX}YJ&2M`8=jFY6yL-ET
z=GwVOd`|$c2abu&=PW!GdSiF_`l7p&r}lrHC!z1muNGR6JzcAR!@I?&<F=)?`Dx6Z
z60>*fn?8;sYkueK(s#cItv2>OIqFlV)WE0gl;!&Cq}}RhiSIt5udc41o>iVRKYDir
zlebyL^lERZuB&IPnHCCM*t7WErv~5Ycc(qIE4dkKrgv7!v4KhIQkn@;A4D;?D(tip
zlgI@DvuVAjYrmXg=t}4C*9g<hX3<y>>HOL@dDokJGYwfepMd%))4%j?$}PKD$eFn{
z>uS&9hiaTp*crJpIBw0<tLBhu3{_|};RtZJ-0&=1=<TN4C9QnvH~(hUJ`-kT61gC=
zby2U=l6J|QU8!+>v!)+?#>vQ)!6$VqZTj75yYD<-5E+>wC$yk}?Z%5+sqPcE>3qLv
zn|i1Iz_jRRtT&eEXq^Xj_^cSW2;3}@_u2J^ajuNcu_z{y3k<XPoLZ*)p053JsAAU}
z#yJW)hd{zQ=5xiAqGQUW<$b0<RZID%GGPh>tBK~UGi5j4Y)YPSaN6!W>DRn`e3@nn
zE@((QcHYo5w#;3pN2T!usJnV+$+n$us!|!!Z`Rrg&WMc@SkUn6%9)azwM-{-JPs%^
zi3G??oj&%|Zrk0b_uA8v#8e(wGje6Ld2BtMce+Uaa_aWfREIX-BTrN&m@-8QUSMYD
zTcMuy%3aL*s@&<+ZMnDAD*6H|&$~2L_be}8c8WiB$JXLi{nstP{RN}+n|rsJz4bgW
zv*A5cSNg$zM2F;6=B%`ftHak%6OXHK1P!QaYHChwYGSf{*dqL7R`$AyvrMyREi)>A
z7c<i&bJC0FXUsD%xv=p_DCkCS^Es`j7swV53cp}p>DaPAibg4Z3a4ZYe@3nhT6#ut
z>CEPQrl^=09bt99DU!x%N3IDtDF`3dUcYD2A~rsm6;)F<{C_gp|B7-qJHMQaar~By
zi9IrwK~`mNR=5=Z|M%A@@eqroS<Va|dApd{>AcC?%Qp5H-&t^ao}z>J$&bzVw`2zI
zoVL5G>(thh<;{y0-CY-P>(t7^$Hy)TT&Vo~>?CLm^<MS+sXsqIKmFw7WZBzKcD-KL
z{d(%Q+}mNGbzG4<3KHl1y|OZxwLoFZugVY2Y`l{co!d^lxw(01{{4NY?yZfDd6rpY
zc$_bH=gPKsnzzgT+P-@GY}55un=d-wo$QwV%zskWRlYFubtmU5^L_Ks{t+7U{M_89
z>vq4JB&Hj+<cyGgnz4h->uYPZ1vF$YFdqzX`2Fo|@}th$v$ITt_eOuQ61;Ou^D)o8
z56x}dJ-d=66sPMo-#&am_wyEk#1#kItQME=ul-&2wfVWS)17T5Z;Lz+n2YaAI@*;f
z%O3MTfB#=IzY6pGduu*{#^7h#NSozI6njD|i<a8!>ta{Ar!;fCoM-gD=>5WpnO;np
zLLYn`F6+eKt9&kdb9edrlGoRCr?FNka!4rn@pRnYS-iZfEPMKl_UZ2h&OSRkyV`S-
zakOn&#^Td`4`;c&S4mfhG~nE!G9j3;HQFZil!)cC8Ock$r|WIhdJXA+M4W38Z;IZ1
z#AeZtyU%vtDYnfLIe+4h#j-h^8dd%LHXj<I*t5><W8NM2KJtmd>8>51LDFl5+2T)^
zUD31dyC|l(Y2$L4r^Ow|r`a{m;m|lH@_zsSx|`ec=ijOO{nqf{mG;2hWw~2-7Cv^9
z75#nWSCG#Wg&kYFRr_wV^*SvHXS=bb%`9m-FaL3OrhR7*?OrRa*6Y?Ip%}eAZ)$Y@
zUej&!F8lPSItiR)<rX_~r{qoi)~u<sBHvwEIoYT@JN=pL)Lf2>zrMb{`ea(}<~I?G
zj(j|~VovAJTA6)c9UexlkJ%Y?@k%&fqGr(7S68oAonzybT2b3?`)$Ui*EcsWUlY06
zZEuONOx=%%i_-5It~9CpQz2=b)>HEKR%qFq8w<rQDa-4uyMA!(+-=+cUUr*)_t@#U
zTzmhB{|OvF)E0n7U2VNL-&*X}8x&vt<%Qzk-`~S;@0cR|@T~d$konJ|=iAjTiQiwR
zwW|92yH{1e;B~`=Yipyq#V*g@{5kLKnWCJ#%TDKIpWb*cP&Hsf&CjCJy{bnv*D$`e
zefa66_M}NyFRzW=^d+&c{q#EVW4AY*u(>^bFW=k^0b=X#Nj*#R-ktZ_ZuY#gDC5NT
zZMrFE?p~i2c;{OqgH;d5zON3oD}pcS6dYGGKe%@8>^+B47Pp?57FlL{hQa^fw9|2i
zuiRVHZOgJoAfUS7S9I{~*s=<q8F!Kt8a0F$G_-9g&5e22JkO|V{<beuoNs+uGtHGn
zV}W9h&f875E2dXRzmhqWmOd3U1j8G+ICJ{lWgDIE1}{4;w@A1%l(UC{)x_Y+O72Te
zDVIg9%<et4E7dO0=d4h6VElSaTl<>X?l&^;&z#ac=%cIXz<4&%`DO)Z@a%Bv@zZV9
zOP+1$j4V0A8Q@TS<v>(NPSMTWJt!5$EWK*J1)DvDPB1ZYWr!_MJALVxcFC7h47=W(
zjGFrKr%wZuRKV-(>35fbYCC2t%ZQ$>EE)?KP3Go?zW|NG@Gs+DAQ{QRIYrTdQMdWX
zehyui2#NgDqE;n0|7O=e6RBkqxuCOkW3Qg|s~+*|Woa*$By5`q8s>AFd<#6t$IN=v
zm|LA?bB_*ajLLU)D~H~0T_>06caIA<L_U>e<XYkHo44x?sQ(gM)^q+=(e&#1v$}6i
zXwYZTSYVg1rEq6|+?jlD|C{ZQ8l!Oy$BRa0_AAT}v#zX|xam-VymrWnfM+{DbawvP
z=6%Ng?t4f#A@*BI^z4@&3v@u;gnlDAL^nZp{(oCoVSilyvE&D4Hl7L7bfb@5y^z0q
z#~I^4Ns9$8rk>w$apoKrAyDE)3_7{JiL_8vebqR>&{YpIvb1vETfU2T_Sf&Py7zlS
z;$hHi%qztdj|bahV^od)I8C>8ZqS<qF6F*WnYJNOV?M(_i^Wn!w)Y>*Za6pF-2d9T
zSncoks@I>HZy&GbKkv<rG~{M}zvi*c_u6?Rl{TlJpSG{|_o|Y*+m>O+l9!a-oOov1
zM(612Qv&Bd$tCZd&J^`dGA3k8blKZmq3h<ZWfQm%!*-u#OY!q_mzH{qm+A-vEN_rE
zj`<U}x9aF$i&>`G%c|DCD0Oo9yRCRt_jQZettXa6KdX#%j^2A~+NHERkGE=mKD94u
zYxB~|&(A7L&p67h$!Ch%m~^!0_1?<QX{ndDWL`Gf#w%?$#do&Z%8LDOPl-G;bn2JA
zb?Nnyhc6?`qV*K7?ya7E?Lw7JZ-$&B(>~4>(q>gY-1d`>H0+pbUA`(~|68HcpFZtf
zvBG1g!?up)Z_9T+-~43noVi=hnl?JHhWKkG&J0dEP^7j;;LkR1ozthwbquy2Wp(nG
zthY1U`NqueM5SeYhIB4dBiD*J@vgYoB!`%_QCmZ{+%M})b^T}^`%Pn;R=?&O7ADaP
zx3*?$%SoH(=^SQ#?Y2=)<Y4}8qgGdqLo(KD;`i?p<*&SKn|fx!vnoli7C%-wFFx=f
zQiws_16V;SvN!9hR;lz>zqwW`XZ^?(zwnSXj;DoV^ECm*f~^lZXBONH%=gIyS7_|_
zHt1ZCViL{Y@vv?Gf^A=4T|K?xQo+HEE}Y@wpf%oWIdd;AYR$R1$+b5(Y<*np)BcZV
zBR8jUrrmmdW#wX)2P>D)3o_rl<58D(lD)?Mw?<Yw1k~D2?@K=~r|M#weT^rP_wnkM
zd7oZgU42zv{n(Vh0_VQlYftID-SwEe>%{i=<~5H`Pc+F4a6f0ccCUV=;pF)oFQz)}
z+xbB|Y|R8gWw$>ePA{*m2wZ&SyPR#6$NztSua<p(clT=Pr_0NHC(kraU-fmt+UV_K
zI?K${pa0#~y?Vyc_?(iPxiQY!A2koHV)s}8+SB=}%DW@t0;3k+_sx5>{r+s@{$=r3
z>%5Hhmeig8X6ZNE{US8F!}Gs#=dbt_`Tb@|{Hx38P4T9D+Y9qImF<68cH=<4^><UA
z{-x8kOAZBO-wk$)&53lDX3JaC9LrLqwV-U_Dc{_!0yj%q`C`A_nWL>^TEQf8;la$^
zdKW?C(C?b99v_Wc{yJ^h!lR%fH+N4?pKRLW38ns$mBBWf9cNUwfd)xZ)-G!8(5pTn
z)pk`8I@hqXYtzlt=glvRO0R9W69bw!n6xi&Tdtn<s&(u4FF&1UqGJ9TG>Cuv?Aq8e
zyBT`Nc@IAFRNw_I`C9OE>JiWg#thKpz|X63XWF3yAS_?*LfYl*SElHw^@G~pc{Oi0
zEslsj##ibusm+|TGd1qO*;9``ftu9^+O9jbxPCO#?EwuCF`8+1pDG58@Axs)w)TOV
z<~r7~-x~ac#FAwhxiT1hm$jY{n|}8g`(@S(JvvP+rvw%>Omln`-*Q&Zx=kWyXX?Cq
z-D7h+4oEX{tuT*UxAx_x-EOYVLK~(ru$plDrbFijY`N8$H}{x;%Hp%$)9<>^IMc<V
z16pFXaw2qY;P;h~Gi@w2pz4QlDQLj!UGlCs+t%=WSU7VAE9VbCg><H>2L~9xo_O3P
zs=eyC^l~es9mhnqLMBL=W-T!i-d?6@{BZ+lglE_CGm&NdyuQIg9!?4cjI9Ox{(L&!
zbX@B3&SxAy4CBjgre0d=J$*;kxw+QiYQD3U%rotmMIWSjD6Z>bb~mJ1uez=G+!K`v
z4hjW~wZGqPfBN-${PcT!t52`5`>K6&fBk-&?{|tn9TE2T=oZsml6iUAs;+J^-ANOb
z-Mx<Y$xh8Uly|6w(<tYLfuvo{j$LZfZFz5n`m7hPFS%)a=((0*)%V-ma=kOV7jm>+
zVfi-A=umI=BB=|FD??TWo#R{YbU{@=VuQnn8IM5gDmqn<@owy$_cA=bR&@2bD=UMS
z7Ct^^RPeyT^3w_BrM|Pxj501LXzJ-rySX{NdRw>Zi3Dc*tPb^Qzi$}b>zrp)HSfjK
z+eOL(S1QlWGJU#D<Vd5UX=APZ8}Hl$dnE-q_OM57%?f?G>u_zmfMUkOoGU9P{_5L!
zM%8<o$NIRvEap<z7DjGPd-Y1<i`DOMZ&x3)xqIW~mzgzL;6}yl{F%?widI)`J#<O!
zZ=r<7<ZZo0w?OT8*@+tR$$I^|ALL$GKA)rf;^g12>+7c;I^=ZF;<@(vJxc2HYc{>g
zWIFcj>}*ltx94UzNSWnG6u$+H`d_~3wqCeg#cBQJw$suNZ!J1k{r%n6SJNt282?+4
z^YZTUVm(9OEgXNY?B#y31GKYq=hJD?DPLY({Ivi7@BLXkU*2p!A2!)z7nguG%U$QI
zAFcA9pPQ?7YVF*a_g<SF;jquzQ)GGV(YAZr^q#r%%R8GrIOD*yO@JfD!BCP#T*m&3
zu)j^<H2rwJ%gg=6zv!H|`RsFa?UE%fwMj81h6$F!ao}<M51(WgWje1HJ}y!^{jT@!
zi_=(|6a;oOfW|AHot>?|{a)4TqMHxXKr0wNz1e);>*=YfPp<^~_pbe}qot*Fn4xfM
z*43boRk0bBpdpxumN<$2!$rnr5^aaKZ(J_Jmbb=v2M3E4TbJQ!P*ELIc4m#TgUR~+
z|Ejjms5{mpskN@`?X6eEkB{}fx?FR3$I5qtyFe2IxzbKc(r@NUTDR=pmw8$3YTwSd
zHleMb8;=X?G&-<~Om^p};t7_2wXgO!%X+QQRVy@fwjW$nsZ)6=&#G)q)K;$#k6&L|
zIa%F0Rpy}ihKT)jwK+wn+YF<Mo%$Zn6|~X({AL1E=|jaXUMZ6appu)jd2zp8)Y-hp
zzx!mZlV;kv9A{wAbOW6QaHzxV#kIAwd*too9(*c)dn@$qai^*!#~)S6-no_eTchUI
zi%pNu3n!hAe&+g+=ZRqkQzMs#TK&H-%k4E2TP$8R7@qz2_xI_S%jd6Kyrla3yQYo4
zF`qaak5+-&=Btl>dG=;c^zMjb)ADavly%HAlJ`mf*?IhxwUCC!T-Na5djiW9nAQ5X
z<=j-dx+=8WmrGS!K6!b;_cN|v{kG-3opb4y0K4KL?&P@-(wrMk_f6>icypn!*r`WX
zqjL{D*xC2mZuUFN-ry#_+~^ZCcCRnJb#w<02WX%7Qob$hS=YoTyZ<_+Y<w?MdV1Y1
z&b+sGo`{-B>$+?^v*~pr+paf>){`UT?Kz+LIQ+Hg(0HD@`83~p$MrKhiljf@_%xk?
z)#ONS{^J`9-)W{FPUSBQ-k4SC1sdyV+wR-(VpIDUm!z$myc(Ehh3>g$y!`aLxst&X
z9M*9JI260yTNoo9TXyg1y@iUBQ_Vp&PiEHa*s|y_ww5I;BYQan7c@NEVF(%3H$2@p
zop<_#XFFy_*0^v6I27O55Y@5a3cFK^vq#x!n?HgHx%%@qWwCvZV@s=XbZq=-npb^&
zU98uXiSo>xEi)NdP2ATCt4{yB@AtdO-|toXe>fp}XT1aao#PMW|Nm(J7xhe-U+7Bt
z(?fn8A1?db>rPhp7qi*<VA<?Et;ubIDgtVtIwkt>v8Q$`!`O6Ub_8^)zf<c!U3|7d
zdhY`^qt1tO%kP0FG4CD<cz@V7NxtF%<JD%@^`?>MLvMec%yP(~fk`SsJ7fCYW!fc^
zcD^~#ww(LH#mnh)OQ-Gn$URRlfz4)_l)mwU#3p~+uTyp{7JIj5>EXxy_IkF}-=@_4
z{k2m1<co^BNe(kW)nS(GjyErAZy6=8tv<D*(R-7X|4bv-yAnU&*Z<#b^XJ3ibsqm-
z$NvxNF9waeK6>-;-SqO!Gj_22abi+ba9})Jq@1C6$k#My=N`kUr`Hue^ox3YtatM2
zb-T3AiC+Ib*Y4r8$DC{0<?D8oyttrvuH}(rdvm-FsMnO_eDlSo#pfziUzcXZyf8e(
z3fjwF8nSb~eEpw|pt1LVAKLAwWP39UZD?d*HSu1Xa$D4D*K!`2r=8EI$Jc2V9F+%+
z!JnQM^swgT(&<am&d%DneEqUbPwl`Ot~?I|tz6h^qxfm(i!GarA8(pHGx-t6`K4Bm
zI+U+esC|35<D*2@lh)a`>bst3hp!9i-@Nb1B=4m2`;0z6G2^`9(ZKX7dG$=a-MZl~
zGN#{s8~e_%d)@nEcbEImH~Jz_{&MN`Q>E8q#kceC^|!eM8o2=<<X|QY8epqhIqmn4
zke2s1UmX1tS9PkQ=v8vR?Xs#lX{`neTN1mi-|q?5U19$Hq2RHKl&_l0=PWwrd$#tD
z8sluv00-k7+qavRN4=YzD7a7k`>RdrVGDd`n{@`h3JQs-s(iEY__UktPyHf{tN#6b
zKK<r$<qNCtZp)qhPfOZ7Z;HR&PnX_}+w$+n1;zf7^ghBX#4*F+9IJ@E)Q;92ayB2W
zvd%KuSL~=a&AM_Suy20eTN&Zyf-_eNEDcOK=DBCrn>=op+m>79TZ&&@S^23u{*TiK
ziPtHN!a?BOH1n*>*F9)0tN;7;`sv)?5l(p%92!`Ploq_$y7%KT=~okv?kHqoQj2}?
zFHy&j{ZE6M?<^H*vz&my9XbUE8W=BaO7+fNWOw)0QPoo)y!Y*RlV^Ch>~?OJkmg0X
zMO|CxcTV=|EL-f}@7MFFT!_QAaSq3e$^Lel5yBkP*TwEGd!=U=U;A~cP@r$l#YL{K
zj1Kn6T5DZ&@n<t%B>^3)dv$&NdY`+uUe*}@y`pFR>7!BEjLe-gm+&uIK4%SkSJm?3
zaMdqUy1Tl9<jih0DVjF!UD{({CVQ1Z*5SE!xMBh0QD2p3XJ#%=%k;N?yX8iq`n?jS
zJo&r;!-59~BHpK7Sm0=sazbFHZFO0W+4Z%tYZmaBH3=-@S@nEI$a<a=-*i7e>#KH~
zw(sk-n)n}clWjK%-rQmmyl0c_wyAuEXWyGD-9DP4`oGrxP4MYcn<iEE86U09IQ=<i
zQ|!?LtR>IR%*;B(XuRnpQ%ly#NvfAthp)GA*byt$!m!s*r@b(H`WhMik5z9jOp8<R
z^F6;Q{kPDibp1UF0S~`i%A0xPo&Mf0CDkh{-s#8Q&&pmA_BO#T%Bs6pd`H70_g>Z;
z1^X2y6<h|*>KwB(Ol;Ut`8n<D%`KTX|FPz5)H&8Y*XY~>U+#&zk0h_ezPosPPR(K7
zi6ZA0UHZIvN6C#7X&=u#n35heorOs};7$wEqo23$|1%47J#%P#)>W^(eLvGyhOVBL
zbAMm#+hVEP4tLJYwZ2-ny=-ICr8^Gm#lx@P`0%1jWA~d(v-!_ctiQd{6+K@&@3Nue
zKS7Qdhr-KuSB0)V_26Lh($d%0x-5>lY_#~j^?Kao)B5{u%8X-Uq-IE5@V;srT6_8K
zr#C{MKm58o?Rf5sc}3e|zlG=TaoiWX<AC<D3%A`5rt;f9=?MMcKHu^{^PwJ{m|~k#
zjNOYrTK#-7IdslG#r1LTUz%`tTYL!;ymO1SqQX*>%eJaRz3TZ*5&s=;B;NNdst|jB
zJN<7(x}V=Z8-0@xav5{2N|W?<os_e$`|HthYisuE*d0=;h9Y8O$K-?`UIQ(3sJ*UN
zz3qL`{O-ta3vPAlRR=6t9PanPHo!+A@$B+A2mU1zmygscfj07RB<G4xGu1_`F}Si<
zt598mWqa8vi>CY+rAaapd;NMYr)lr8eq%TD_nFHRXX`Yb-nVqejK_0tS`~g$xPO54
zOONrnfa|XPQl?&<N_Wa^_?YrC-rw7seBz_Srqb8fIP>msFFbHbb;&{BnvFZ+*teJ6
zvg4ZXxciOw{W@)~8;|-L^{Qp~>O3bqJkYbrb1D3KHGH+V323L_s@|`2x8JYZEyaHI
z_{F`|<y((r-rADcv~_WWLAR$mxX%g7Qn~+^oSs+7oz!`0-6e5m&J?c&3%0OFH2Hk#
zsaPht%eQ}K@tW^PTqbCC_`OVQH{ADWomD~h^N=>)LdUyL<@BmWs^`u;v#I{x^Mell
z6HDj&eqXu=+IaY?s-N~rn6cLX&VlL$ySO5{maI>|UU<^(_0`qWbHZcxMDO0=B39FQ
zn(yNgd0#W}&+e6pHZk88T@n{R7F}>CI^^ga&K0gbMNy%bQ_nw(eRuKkoZn}RC(hPz
zdVDeU{7X%lmxnYLDCXT;kT+92bh@l>cVyW&E9aU?(Q&3+8646E8q;Ol_f=iu4*Kvh
zCo}l@1c6B>)_8q3%Ue{D);3|~Y0v;0d%%U=%|$oQK3)}5b@{Odo6Plfmu~MgoZzsH
zBfw#^t66VNbJ5MqE2Jh*VBoY6SkPeQz-i^R`%T2Msb?d<E$HulI?>?@sD*Lo5NI6n
z_=yM`&KA(d;dWog>9*}3B274dI5aT5Vs=>{nK51V<%><#OWmu5IQSX4G7jWAPPa{X
zpwq{)$)ka3mg|nr$mC9;xE+6G<OB~nFsUS%Gje4(yj?E8-Eq3D!ULT)7A8=QY?QL=
zO(ffyH=YWhHG`2Y{?l!{3uc;fwlsjM(O!q?w%!Rdbvau)7+9}7KepiXJL7;fcP2$O
z2ga`(3%~R_d}uI_o~OFM`g@){r-8Q634JD!fcdwgcfYw=qqo~XG!#^;*}u8_I(^%j
zZkA7=4*B6{Zv1(Fe|>#bC|%*=xzuZ_(HX<vCrkY$_de-bx<2=&{v_224l0~aVjR9d
zv^4$w-FvE5=p?3NJCx=vY+=8!lq>IT(9?&h^Tm{A$9y}&e);W}q61r08HGBOCj>Jd
z?U(E~ZnL(m_>f@va>?XJTIS{NV!r-(%qwlS;s?@VwalBKnx%WKUiCJ4pXrKWYU+%u
zIi7?#9PgLcFMWMYltabk3J*#LbkTGx#8i*XHy8iyWoh?j=DgnM%rUW7ui8xBXF6y2
zva@`Rix%Bo^#9G~V5hud*X67B9AA{axy@4ef@SeDj(KZq9`~A`a^|-Uc_y*kZ?0Ca
zwE46~X7*$A*zGeeC`cNmbex%I8~y9s+trtLY}F2SkP^I=+Rkw>ce~<;X_aPMg1)_q
zSb53u+MLxd0}l9}D3&Y=sw#XrS!jO!zsi?4H!nBIy0YTT$7G#iXtgk-;?N3EXEViN
zy)e_OYwLU%GhJTP7v4_0Svmc;iIlaIr@_k1)03>EH-?{ZUAo+7rV=YF>&Cd0Bw5rM
zevRAP{#xX}xwg(nO-@;1UV(6qp#PtZ2{n@TGCM5H*6@6|p<<%m7$Cs0hn;Ksr?uPf
z1+A;Rx++vw5meS6weHPT$a{WH{(0ZsTb5#v6fZ4{EZg-)PHNgRl?jTC2Utaf-PcBM
zpLTApwffpBPtVR<<qr-t8ks?7YK&%9^lUiDdTDaBg~>gm^U2JY=dfH-5m>>!zu=)0
z=<KJMf`hE9#5?Du1O`rA^=qDOb<*vsz02>V%Sk`Vy1Hs9c;(yT9l5*SY~wL@*(h7#
z^V1zVrysihBWO<F`Pa?#`J!L^j`vEdZ_U0Q_S-z~PQ<Zw8#V;=zD{h9-fc9~MT1G3
z`9sorW2fFz&Kuht7BE$PyP592yX@_w2M#LpYd(3tyt{jQ$%_k)TH))~TnkV7lzgy>
z_0sxyd(($4E~~@V1|=2Vt9-uFW&_{l-q@H%!JkgkZIyUW9^Np^VF6RrazELFr+IGi
z9-nnSY;DxhveMVre7|}e?~zoF-CZ_S*1Bv(>lf5DU_0K-Hp>m#{6=E_Q=Mv&sHw*j
zlp7sbuW(M7C$K7FW73^>I49`!^oqOpXH1t(o?Bxu_bBhlRqjooHea@_;XlsnwuW=6
z-|cJ?zgE3y`P4V7n75a8{=EGyR{z=aisiYw(|7;+X0^8V9oPBhNyT~#65goHQ~O=@
z_0`Py$$7iCde3t7D8G=(pLw`tPgL@|U13%-ca@%O-LkuCp+LZH!L;q)ZlxZV*vR`j
zaI<&w&fSU^mek2setMU^)U#PWeDe-Z=h<ICbLfx7JhXPbX-wz~QM?{sv1?9o6?<2@
z!&)y!UXCr(lU{79Ug#R_+n~2wP4JF7XchfBucp&|*?)3({kwOy@uEgH%Zp9vytz9i
zgB?!0ip*&&yIE<OR&XX)zf-R|FM0ygtmuEMN~Gm|#F=s`<6EuS=j-p?>7%*)IU}pd
z@*l3Tv%IF;9`8+v{8)1H@Z|)N3o_eSW53B9+P>vQv0twG_3y7wMSh#GMV{4!op)hA
zOOtm{ZlysipTWixEKDUgg&SHPXtSC;aJ#ViO@v7P>E@SAZbu#oaa>6CXAoMnUgQFU
zG_#&{)%-ovY#m-q6L+0%dxzJ9k#|9@&-A(8Q<xa!CMs=kd1)>_UvT2$&S!}M4x8_+
zE4jIu$6~=7{ePt!%%A@F+VKCWOQ1vUY)?ax3qCKVP8RDIJ7zrR#ir@Zr<(3gXVF<8
zrjRJ=&B^jBU}udY-*nl>b9dBh9yN}SntOa^Kg$i~uRE{$PM_O<`-7z3X642Sf(sgc
z-B7q+`+e>%!4BWO=ic7l|9v9EW~IhIN}%Omd%x=J_SM_HFE#GzDI3-r3)UH~^MoF(
zS3lf#-HE0AuGn<h!#ov<o>z}GuTJ%7IO(ZS59+8FvM<WLy^V8Ta>za7i3&j#Rm<yG
ziZ(qf%AT&X_j-kNY+3E!y}pNe;%>KoQxOmWtsMRO>guOM-1;X#{WMio)u4a?1<>}e
znBudhL7UUg?syF9O!&+)@ifc1vEb2clT0OM$b`?bRPpH=&H84$-<W-!Vw|C*rrPMh
z!LqOC<<#)FKz6f&2M(YjRp>mZr*o`dUcUSQtVr(`(|vNz`u!Bp(#TZD!)?5ieP^2;
z&AEH)s8Gs|#yGue<xU+6FF@;-4UWH2Z{N+Aw&R<ezVxd(wOTrjEJo@A75ra7GxgQG
zQf_a{ecC3SH=&hV{Fv-n&{VzuqLvG<o*(3wGV$nqhdNVVcQLu$Z0G)4sn1oHWSUt`
zp6I~E)cD=uVzDvvk&StGcfC@RwvyYs2Q*rUG!Jj90iTEea;W0Yj~ikik4P9F5#D}g
zaYfpNA3k18nj9?mn0?oH7Zz@;`TchLsnF}cK}ERPY_r@|i<9Q_N}KiU{E+uHsq^xU
z3y<fT^~x?<erETb<ri=GI5EkAs@nTV^X*}!e|`vFsP^LNK%Q@x(BHC>-F^C9@7I^6
zu^53X+mtg?G=rbaNbZ}c7rX07AIs*?9PE5D9Y<gCLKbMv^_%@}Iqzh>U0};@pYm~M
zx(7-k7prR?G_qf@x^S?W{rJ_G_1}-o?Ga*z6xVlesXi0j`u<kxaRcV}Me<v(J^k1+
z)4`9W<odeUqW^!tpWavd`^mT4`TCn3_LaT8)pZlJqHcq>j!www_6>*E#?JIn5^<bv
z>(qPFd1If$gUugim`E8WwSW#X%-j1l>}$YQm#m5lQr9BD>v)$PPP@7)^p(&N(9Dnu
zXi0JZq4K>(4V&KtX86iAuVrC+-)Q&kM)Ibjr(U2M7Ceb=vga_reax3L)@oBX?5I04
z!|>A9?C_f#liPh}7&uCqWGKj5mtFC^@?^5~?uaIioC~S_4$7YdlpGZb7>_QU!;!!5
z=dxcW_kVqPsr>iX*WkdryUWANi|3o=&N?&4GI%X}?%iEm6Clf}&gmR~mV58%y=T{w
z?=E&*0GhkWIwk!`<XXemc{3C)hO4NqULL(W<>g_S`D-J;U7Z{^;s2f={RZ+?w@PPk
zFPxmCdv9`CmGMK{&yUwnG5%g?{U1E?CR_5r_CiU(<38WKrf6&P%GQ&|N^X91PddD5
zmBGj4SPzA0mNfzwa%A`L{=8Lj+D3ZEuC>W;FP%J-J+J1}TFbYeKoj0ec)@eN_3}Ye
zGQ(f*C_XpQc%8h0Kp>k?fszAb>7q%GEq1-J%xk#x==|Q#dYSikm%r0KB-JvDfz>4C
ztn+l+?YxU(%f49^-{#vk#gCEK(;GCa&VIR-Wp4h}1*hLhpW1V>gGs7s*|A#R!s8XQ
z^Ja=O<?IW4c;$7ya{8aNhV_+3n_mcn#^`!qZhF3r@x`X+)Aqkz8thPfrRi3x`^Pz{
z=Y5qgq@L&ft})e%@vLL^rPT9`Us{x2Zc=A>czp|~ra3gNPDv;5Q1{+*UnJ9JeR@{E
z@8s6GGo4bZKpQ|GbS`***YhKfz^*`%*fM4|^IAm*#;>f&uY6u?TK-J<NZhVBjsfTP
z8)+<v%qxDo>G8pmtE)m!7iFHg*U1oDrmofVxtW3W3V)a9rv<0yvG_P#d|UN(T3L9^
z$&cq6DxN1BhTY-6vaN05>AdLfjr&v{^frWkXZ~82v2*J+bEbor4GU8RnK>solyF{X
z{k}1G>*>Cae)qoIaNlsIi^a*Sf$5d=;f(3B=d%t?cG8?@=a4F<lEBz_0z9qGa^B@o
zvaMDK$Ggn4B{y{~PDi>5oe*Mt&06yP-CfZ9%8BRm>-DO?y_pE=PM=htuM-|y8hWjD
zieB}!b6#oQOw$B5L^*hSc|BQQ|93TLcM@k>x0r6q!6w#EkGl1}j&_MYJ*B<=jF+*)
zmO!=GZ)+Z;E>lV1Wn9g=<;%n~pll*(QLq5C+rcsa+M1a)pU;{bWna_T`Q?)L(xRuQ
z_L;Sn-84MhH?xdQNTKnMs=%FuL@|l_KOc{SN_|<Yl8)1RV|SM|#VN5|JI^q^_V>59
zO_60?%jc)e6z9C*dEk|tMpg3+lP2xlwl-erRqF+;?VI+MtH+kvXBhDdb?`B+W))$Y
zsWC4@N_Knl@xGpDuWt3&Z#{uV%t9S9AW84(-`?MkUl#bqNbPUru>;O5*Ge9JE9L<m
z&M?8_z$?QGvrMzS0s{jd8Ls^3@A4_=lu?F+Ba_MlWsqhjPV>Dxc3ALn%3WzY&^gaS
z=Z_PU$^&DN)aJJZ55;w(MA}o|-P!47^RnuA;zMyE1;+WD5w>i%_SIIe3|`*XBW>=d
zn||nx^)xfbfQ=n;-gCg`?Sk^#e)$*2dZnLUbeEqRx;l(=ozJT1?d!h0y6Sz->h+o&
z!{mJ`4osDP4)^)5R54zC+ff*xGta$$N+al)s!g5_+$*l??cwAw7d+Sv7HU#T_^J{V
zFd>2ubh?Cv;DQFLz(g4kdxwGpV<}^&8py*BTpE~OxwIC7*-Z?rS6EeMO#p4P7iQ#I
zAuM`qB8bh+BoZJ#A;SrD9EBf?#sa?(3GgwzdK>``u?~wkL57Z6Fd9UosfdAdG#{Yl
zgHJl|u7<}?wg30Af1>3pW_G?4n^I4w9Pg9W>|eQJg$Em-jD~#82S+dK?bhk%=4hJV
zEtxDLF1}hN?{#3@zq+Tvah7-9&pqIHZ?cQ}(KE%>yRBx#`&S;GI(Mzx{rdlVbMEc2
z)V}(@`up#7pK9OsU5>rE)9}~%`hUvh_iML*d2!MC*Z249Cpld4^74A}pqalfbz}a0
zyPMl`XTQ0%Ra<QO$z$K%-cCK-#@kdQIOkPh+&{msKI-#7oqAYT&+%ky!>{HEJ6n1k
zCad{Ax#X=sHM!4HEo`g1T&0Ub!QnRE?xU&IhgZryo%%B5e90%x^)m0iw==L_k?%XB
z>cXNGzD{Rv)z_}of>rY?SS3M*|3or8z~S<fAHQC&KmF?J>Zg;u^(Jx(tF18HUiJ0W
z$(_&VY0tGP?K)k0cUP%V<|UQX{psiBGOw+fx#{;){d&pGmw$pr2j*2g;=H-Dc=?^G
z*K0v@B^Q7H`ubY^@$vrYPft(x{`>3e(=P3G6T;R;ojk3-U&lD@%!E~;t50bzpQ9um
zQ_v_PBC=x7{=eU%E8lLt{^Yd&{*ZNAuYSCa{~uNL{hjRQ&QPTk>Fsxlx@D^0Y%KbC
zRQ!0>w`a5SS0(R#+-JQcY;Ba5oZjcR+wbeC&n=lWr}&&@(?;JK_h^~QClfy%VCFw@
ztXG;fxzo9gComIqiuBg(>wQnHb8neczTf-(%8r*8-Q{&b2NHy=kF(uoU&x%g;I94u
zKgE_W7BnyMo~{?PGH9uV@n*Rj{S4xNmrjqH)XFWs>R~hJWCvIA*d@1&BW?L@zg)QS
z@kLF64(QbGr<48dCVqW=-TUsYQr73f=LBti8b7u3$!cAXuip!9f7JdeIsVu=?)|>s
z>p;hj7px0g8RQzZC1YWmJ)iX(gV6lB*G;d-D1%P<01dz0+Mcf;9$Px~PU-d7qHB@q
zCugS5Tbc7!x^KDPT&pINK;AhnUYk?5=iF5Co~{?FUe+sRI^}f4LMK*9%c3P#oTb}V
zhpnA-J8!q|w!FJq&*zrUiz&OA`l`JK)OlGxzi!o8mY<Fipk#lLe@FK9bxrfwoAh3v
zvwkn~XNJP9848sz7PhAx=@0~OUHNc``{{H0|2utV8oB=a`@a78r@zPT|0xROPU+_C
z108x6SM$;JD|3frYYDTxozIyWw#O}tpJ^P7*pd;r<{D_tm}&O4j(;1S1NQ%ZXZ>{3
z^)->fe-j-N6gqx1ALPDY+90s^^EvCHTbavOUOz5huj6n3cgwxEKRDmX*M6Ber|_8M
zrM=bVj<d|~b;xU*zg}qExZ=V2cUOY_Lk~6CAKI9F+-p^p)zi<Qb6oAuZOgrVD!=Zt
zG-ylJp8x-T7oE5LzTz|YQ^nZC#D!L394VU~JG(RRSe3j`*#H0U`>Q*f3a^70sh_0G
z^X9zLd2pWdQT++U_7(PgAB>s*?GV?A5XcrTj-RsaCiB?^riMR@-fq2q>gDqP7L1pc
z`AYvhEdOsoOW^+*iV0U&g$jR}@!@=5!Kahzt0VI{ZgQ&65m?QrW}>j^g`*nVl-7AH
zbrl>hQf>bIc>KzpDbe-4uzlK>H40~5q$>S+SH8ddwPa$9fV!DW`1iCai5&O)?Eh6X
z1}yqsazxO5MVw{bn+HE`rq9<@blIBNY|-JF#31gYws3ie;RVonFFprE7;OXpoOC=Q
zV6c$Q(d9f(eOG7V$w{hA7eNcALeF#mKKOgz?{~pY^D@@&UwqD^yHocHCu1(?VEL<c
zPp<|)Zx&@Metxd^G<zKX9&Qf%s-?@sLpCP4mi|+<w)<iRKJ0t)wbVEF_C{A)CooRD
z&M2Js<Fk47`ybArd0p1ItXqVc{>2<Px2FA^ve*37^L-k!vD5ll?W1((X{-ud?6&H9
z$33+}|Nj0C)fe5%tUIrxeKq^Tme)(C?|D(du_D-^N_XCk|C{Ik^_i*2r_|UW@Addt
z@6_xSN?!N3M0du?u&~&NeVK7O`qARc&p&OB-Cee-V#jU{iM9hD6J{_saWpzNG#t8m
z-L_2h<-@n(`+tS{*i7WfxmYIQR>%dKhV3#t%IITV{_ahRT=(UdbsxLqk38Ct$Q5#@
zPbGfek4M~F*$<_%@gyp|DEhK5<@oaRj6B~HB$yK4-`o32=3>3fFMqe^tl@V>{Es~L
zXZTj|y7Yj&z`r#YoqLNC_^&*_)_URL@pgvm()LA{W3L>2Iawfy`=av!&lUbLxzpbS
z&;QW*TabTxEc+J)HNQC;pP!!(|9a@3eBBRFKYf9(({E03xx+#NCqAFIkN-N$kfm|n
z%PT8`Q=guin&rX#xJ=^r7ws4J);kXPF~0435GwQGIqScIT4T-=?DZ-FxyA>y9q)dX
z-?8)joomOJpAUZ1{F{GS!OuYV;u}YNx@$WbWj?UC#i_S-U66Yrqw<<ZW!d(h)sa$W
z^1dftty5Q=b4~KqJzf{3*^J4h0!(YVUCwhc^`4ZBW;!C|Ec?PX`39q~=!}Tw3Wtb?
z+aAp*$v5qId}*>tL9wCDW3vNdxr`5se!IV%V%{fP-}FLv*516D<MY*LRB%dsI%uKO
z)@LxU`*Yd7J(XEJS90xM@E#6snBE}1M`=s!73SC<I@=8D3|`beYM&=@LHS6|p0fSI
z-+zCUU9`FEZIr2X?T?4;tL1g8#C|NiDP*v*vB6W|%N~QvJRcjYIo4GqF0<WeKCPnW
zg=OY+)57`J-$zXEWLS8CaUR<-^I+Dwe!Cys3j06v(eBw*kM=lv*sM3$*4tn&q0d<F
zBk}L$<>mf4Pa9tz-EorpEz84JY5woB&LPWo>^^zeZT6mbjckRjf_`3SVv-KACzo?X
z7&S+pnw`JTa`kf_HQo!+hgz7cn12-R`*cb>t8G`};kHQK==6CnMcrof94=tK<E;~Y
z=~3aG!sDIuCYn#Td|4!HKarh<ZJpM!RbN%&7tNjhUVUE0qNqbHs;LQF=N|m}dOd!*
zPv1r-9m~Tm{Avp>1h;S`EoBVLSJ<&qT}`p@r|u_5e-US<)!ypY1LS=;W(rT%)c*3{
zI#8|ZX#U=>(-QWGtoANASH=0D!7xH+>Y@3ZYT=(1pKNVNyL8~k@nhPC2@dy4&To+6
z%)9;M<m9WrEN?t+X{~s5PxR5Gr_*!h>qXZe;$ysD`t!$;t@o0T^#tZwe@omZVJ}o1
z!T7QB=bstT7WWh*1Oj}Hz5KdXqWEyXSdMV4>*pU|1rt6oGjWBBRzB!bdHX7>I(PN{
z*Z#8W?G4+0fR5SUFy%#l{qNaQ{Vf#<Q(2}>dujFR%P--3Y;FD@(z_z_S$bNN-!9|J
zd)4{Tf6aTB-Aeiuq8-fzNwI00K9x%Dvil``SZT)1<6VM#3hI(%->e8+ob<eP+tvA2
z`k#fLi`lU9cqh7g*|juX+S>l=Q_r=v(a#Tm{8iTTWBSqkW_~fo3)~aBX6)o|{_WTN
ze}m_=_*J!?$q5@==YD8z+VP^n!l&lJ@vcvSVmVtfmT5&lpZMB;O;|%gW}!o^!n`OO
zq1WtY7Gam=wmo1_y!`m`$u}4J@?rwEXtwcxshn^_&F|;pbp^LKTF4rINR!=oKG!y}
z`_INdysw+*9yz<R=E?h#niaxtzAjPU=F8?+xscB);RJXW@wc1lt4l9h*>%m2IM(*z
z@_L;v_nAkN51o8fa_E)(q~MDy)p{m9ZLgX1*4RHUcAl8)U)lK`#?w!!T(ge+mnOIK
zUYV4(*?$$G*UyizIW4W8d&_R-+~7Ta$#rVmGLv>4d2glbVt#YS+S^r1`cL}hk~cjF
zvHMis<-f*%k?*7LM~n<b8tq?iSg-H5rd;j5W#<%5+hw4+O2Gr7VG@h4Wlu@AR@!q=
zE~7<ydb=Bwqu>Dp0X_9|CB4}JU%#%F;aU-|GLxV4i6J8o^Gof8pE#Lgf7E2<%4u^>
zXjsppv0&e$lr$9wrk|i);r?sSCaW?EeVEF?dL?|$nI0Aoh4~x-4xd+Utz4tx0N%I#
zt84Pii42@igc-Rq?6#WqPi65q5Y8kL5MO9yETqs_qvXJNcKNku8z(Vv{s4_KY5S$Q
zF{w=O2OYqC<(5sDkOE^oXMjWP(UWI98dyGcGO(J=kD7hli%I2yHY3-H^%gTFIVU*S
zftJn%XMc|HY+$KTbzuA|s&1^zD0D)dN#p|69l!B8==6g_*Ly%#GjO`hb!eS5Y0}L=
ndk;DAEkZwh7lc^b|FJ(MwX3GD$hnGvfq}u()z4*}Q$iB}KjDOJ

diff --git a/programs/Makefile b/programs/Makefile
index 491b3ed3a..0c920a87b 100644
--- a/programs/Makefile
+++ b/programs/Makefile
@@ -106,6 +106,7 @@ ZLIBLD = -lz
 else
 ZLIB_MSG := $(NO_ZLIB_MSG)
 endif
+
 # lzma detection
 NO_LZMA_MSG := ==> no liblzma, building zstd without .xz/.lzma support
 HAVE_LZMA := $(shell printf '\#include <lzma.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lzma$(EXT) -x c - -llzma 2> $(VOID) && rm have_lzma$(EXT) && echo 1 || echo 0)
@@ -116,6 +117,7 @@ LZMALD = -llzma
 else
 LZMA_MSG := $(NO_LZMA_MSG)
 endif
+
 # lz4 detection
 NO_LZ4_MSG := ==> no liblz4, building zstd without .lz4 support
 HAVE_LZ4 := $(shell printf '\#include <lz4frame.h>\n\#include <lz4.h>\nint main(void) { return 0; }' | $(CC) $(FLAGS) -o have_lz4$(EXT) -x c - -llz4 2> $(VOID) && rm have_lz4$(EXT) && echo 1 || echo 0)
@@ -127,9 +129,6 @@ else
 LZ4_MSG := $(NO_LZ4_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
 
 default: zstd-release
@@ -221,6 +220,9 @@ clean:
 clean_decomp_o:
 	@$(RM) $(ZSTDDECOMP_O)
 
+MD2ROFF = ronn
+MD2ROFF_FLAGS = --roff --warnings --manual="User Commands" --organization="zstd $(ZSTD_VERSION)"
+
 zstd.1: zstd.1.md
 	cat $^ | $(MD2ROFF) $(MD2ROFF_FLAGS) | sed -n '/^\.\\\".*/!p' > $@