Restoring authorship annotation for <danlark@yandex-team.ru>. Commit 2 of 2.

6 files changed, 4175 insertions, 4175 deletions

diff --git a/contrib/libs/lz4/lz4.c b/contrib/libs/lz4/lz4.c
index 98d034777f..c864ba73ba 100644
--- a/contrib/libs/lz4/lz4.c
+++ b/contrib/libs/lz4/lz4.c
@@ -1,6 +1,6 @@
 /*
    LZ4 - Fast LZ compression algorithm
-   Copyright (C) 2011-present, Yann Collet. 
+   Copyright (C) 2011-present, Yann Collet.
 
    BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
 
@@ -36,12 +36,12 @@
 *  Tuning parameters
 **************************************/
 /*
- * LZ4_HEAPMODE : 
+ * LZ4_HEAPMODE :
  * Select how default compression functions will allocate memory for their hash table,
  * in memory stack (0:default, fastest), or in memory heap (1:requires malloc()).
  */
-#ifndef LZ4_HEAPMODE 
-#  define LZ4_HEAPMODE 0 
+#ifndef LZ4_HEAPMODE
+#  define LZ4_HEAPMODE 0
 #endif
 
 /*
@@ -68,17 +68,17 @@
  * 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 is portable but violate C standard.
- *            It can generate buggy code on targets which assembly generation depends on alignment. 
+ *            It can generate buggy code on targets which assembly generation depends on alignment.
  *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
  * See https://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
  * Prefer these methods in priority order (0 > 1 > 2)
  */
-#ifndef LZ4_FORCE_MEMORY_ACCESS   /* can be defined externally */ 
-#  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__) ) 
+#ifndef LZ4_FORCE_MEMORY_ACCESS   /* can be defined externally */
+#  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 LZ4_FORCE_MEMORY_ACCESS 2
-#  elif (defined(__INTEL_COMPILER) && !defined(_WIN32)) || defined(__GNUC__) 
+#  elif (defined(__INTEL_COMPILER) && !defined(_WIN32)) || defined(__GNUC__)
 #    define LZ4_FORCE_MEMORY_ACCESS 1
 #  endif
 #endif
@@ -87,32 +87,32 @@
  * LZ4_FORCE_SW_BITCOUNT
  * Define this parameter if your target system or compiler does not support hardware bit count
  */
-#if defined(_MSC_VER) && defined(_WIN32_WCE)   /* Visual Studio for WinCE doesn't support Hardware bit count */ 
+#if defined(_MSC_VER) && defined(_WIN32_WCE)   /* Visual Studio for WinCE doesn't support Hardware bit count */
 #  undef  LZ4_FORCE_SW_BITCOUNT  /* avoid double def */
 #  define LZ4_FORCE_SW_BITCOUNT
 #endif
 
 
- 
+
 /*-************************************
 *  Dependency
 **************************************/
-/* 
- * LZ4_SRC_INCLUDED: 
- * Amalgamation flag, whether lz4.c is included 
- */ 
-#ifndef LZ4_SRC_INCLUDED 
-#  define LZ4_SRC_INCLUDED 1 
-#endif 
- 
-#ifndef LZ4_STATIC_LINKING_ONLY 
-#define LZ4_STATIC_LINKING_ONLY 
-#endif 
- 
-#ifndef LZ4_DISABLE_DEPRECATE_WARNINGS 
-#define LZ4_DISABLE_DEPRECATE_WARNINGS /* due to LZ4_decompress_safe_withPrefix64k */ 
-#endif 
- 
+/*
+ * LZ4_SRC_INCLUDED:
+ * Amalgamation flag, whether lz4.c is included
+ */
+#ifndef LZ4_SRC_INCLUDED
+#  define LZ4_SRC_INCLUDED 1
+#endif
+
+#ifndef LZ4_STATIC_LINKING_ONLY
+#define LZ4_STATIC_LINKING_ONLY
+#endif
+
+#ifndef LZ4_DISABLE_DEPRECATE_WARNINGS
+#define LZ4_DISABLE_DEPRECATE_WARNINGS /* due to LZ4_decompress_safe_withPrefix64k */
+#endif
+
 #define LZ4_STATIC_LINKING_ONLY  /* LZ4_DISTANCE_MAX */
 #include "lz4.h"
 /* see also "memory routines" below */
@@ -126,56 +126,56 @@
 #  pragma warning(disable : 4127)   /* disable: C4127: conditional expression is constant */
 #endif  /* _MSC_VER */
 
-#ifndef LZ4_FORCE_INLINE 
-#  ifdef _MSC_VER    /* Visual Studio */ 
-#    define LZ4_FORCE_INLINE static __forceinline 
-#  else 
-#    if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */ 
-#      ifdef __GNUC__ 
-#        define LZ4_FORCE_INLINE static inline __attribute__((always_inline)) 
-#      else 
-#        define LZ4_FORCE_INLINE static inline 
-#      endif 
-#    else 
-#      define LZ4_FORCE_INLINE static 
-#    endif /* __STDC_VERSION__ */ 
-#  endif  /* _MSC_VER */ 
-#endif /* LZ4_FORCE_INLINE */ 
- 
+#ifndef LZ4_FORCE_INLINE
+#  ifdef _MSC_VER    /* Visual Studio */
+#    define LZ4_FORCE_INLINE static __forceinline
+#  else
+#    if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#      ifdef __GNUC__
+#        define LZ4_FORCE_INLINE static inline __attribute__((always_inline))
+#      else
+#        define LZ4_FORCE_INLINE static inline
+#      endif
+#    else
+#      define LZ4_FORCE_INLINE static
+#    endif /* __STDC_VERSION__ */
+#  endif  /* _MSC_VER */
+#endif /* LZ4_FORCE_INLINE */
+
 /* LZ4_FORCE_O2 and LZ4_FORCE_INLINE
- * gcc on ppc64le generates an unrolled SIMDized loop for LZ4_wildCopy8, 
- * together with a simple 8-byte copy loop as a fall-back path. 
- * However, this optimization hurts the decompression speed by >30%, 
- * because the execution does not go to the optimized loop 
- * for typical compressible data, and all of the preamble checks 
- * before going to the fall-back path become useless overhead. 
- * This optimization happens only with the -O3 flag, and -O2 generates 
- * a simple 8-byte copy loop. 
- * With gcc on ppc64le, all of the LZ4_decompress_* and LZ4_wildCopy8 
- * functions are annotated with __attribute__((optimize("O2"))), 
- * and also LZ4_wildCopy8 is forcibly inlined, so that the O2 attribute 
- * of LZ4_wildCopy8 does not affect the compression speed. 
- */ 
-#if defined(__PPC64__) && defined(__LITTLE_ENDIAN__) && defined(__GNUC__) && !defined(__clang__) 
+ * gcc on ppc64le generates an unrolled SIMDized loop for LZ4_wildCopy8,
+ * together with a simple 8-byte copy loop as a fall-back path.
+ * However, this optimization hurts the decompression speed by >30%,
+ * because the execution does not go to the optimized loop
+ * for typical compressible data, and all of the preamble checks
+ * before going to the fall-back path become useless overhead.
+ * This optimization happens only with the -O3 flag, and -O2 generates
+ * a simple 8-byte copy loop.
+ * With gcc on ppc64le, all of the LZ4_decompress_* and LZ4_wildCopy8
+ * functions are annotated with __attribute__((optimize("O2"))),
+ * and also LZ4_wildCopy8 is forcibly inlined, so that the O2 attribute
+ * of LZ4_wildCopy8 does not affect the compression speed.
+ */
+#if defined(__PPC64__) && defined(__LITTLE_ENDIAN__) && defined(__GNUC__) && !defined(__clang__)
 #  define LZ4_FORCE_O2  __attribute__((optimize("O2")))
 #  undef LZ4_FORCE_INLINE
 #  define LZ4_FORCE_INLINE  static __inline __attribute__((optimize("O2"),always_inline))
-#else 
+#else
 #  define LZ4_FORCE_O2
-#endif 
- 
+#endif
+
 #if (defined(__GNUC__) && (__GNUC__ >= 3)) || (defined(__INTEL_COMPILER) && (__INTEL_COMPILER >= 800)) || defined(__clang__)
 #  define expect(expr,value)    (__builtin_expect ((expr),(value)) )
 #else
 #  define expect(expr,value)    (expr)
 #endif
 
-#ifndef likely 
+#ifndef likely
 #define likely(expr)     expect((expr) != 0, 1)
-#endif 
-#ifndef unlikely 
+#endif
+#ifndef unlikely
 #define unlikely(expr)   expect((expr) != 0, 0)
-#endif 
+#endif
 
 /* Should the alignment test prove unreliable, for some reason,
  * it can be disabled by setting LZ4_ALIGN_TEST to 0 */
@@ -205,7 +205,7 @@ void  LZ4_free(void* p);
 #endif
 
 #include <string.h>   /* memset, memcpy */
-#define MEM_INIT(p,v,s)   memset((p),(v),(s)) 
+#define MEM_INIT(p,v,s)   memset((p),(v),(s))
 
 
 /*-************************************
@@ -268,7 +268,7 @@ static int LZ4_isAligned(const void* ptr, size_t alignment)
 
 
 /*-************************************
-*  Types 
+*  Types
 **************************************/
 #include <limits.h>
 #if defined(__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
@@ -297,13 +297,13 @@ static int LZ4_isAligned(const void* ptr, size_t alignment)
   typedef size_t reg_t;   /* 32-bits in x32 mode */
 #endif
 
-typedef enum { 
-    notLimited = 0, 
-    limitedOutput = 1, 
-    fillOutput = 2 
-} limitedOutput_directive; 
- 
- 
+typedef enum {
+    notLimited = 0,
+    limitedOutput = 1,
+    fillOutput = 2
+} limitedOutput_directive;
+
+
 /*-************************************
 *  Reading and writing into memory
 **************************************/
@@ -352,7 +352,7 @@ static reg_t LZ4_read_ARCH(const void* ptr) { return ((const unalign*)ptr)->uArc
 static void LZ4_write16(void* memPtr, U16 value) { ((unalign*)memPtr)->u16 = value; }
 static void LZ4_write32(void* memPtr, U32 value) { ((unalign*)memPtr)->u32 = value; }
 
-#else  /* safe and portable access using memcpy() */ 
+#else  /* safe and portable access using memcpy() */
 
 static U16 LZ4_read16(const void* memPtr)
 {
@@ -405,65 +405,65 @@ static void LZ4_writeLE16(void* memPtr, U16 value)
     }
 }
 
-/* customized variant of memcpy, which can overwrite up to 8 bytes beyond dstEnd */ 
+/* customized variant of memcpy, which can overwrite up to 8 bytes beyond dstEnd */
 LZ4_FORCE_INLINE
-void LZ4_wildCopy8(void* dstPtr, const void* srcPtr, void* dstEnd) 
+void LZ4_wildCopy8(void* dstPtr, const void* srcPtr, void* dstEnd)
 {
-    BYTE* d = (BYTE*)dstPtr; 
-    const BYTE* s = (const BYTE*)srcPtr; 
-    BYTE* const e = (BYTE*)dstEnd; 
- 
+    BYTE* d = (BYTE*)dstPtr;
+    const BYTE* s = (const BYTE*)srcPtr;
+    BYTE* const e = (BYTE*)dstEnd;
+
     do { LZ4_memcpy(d,s,8); d+=8; s+=8; } while (d<e);
 }
 
-static const unsigned inc32table[8] = {0, 1, 2,  1,  0,  4, 4, 4}; 
-static const int      dec64table[8] = {0, 0, 0, -1, -4,  1, 2, 3}; 
- 
- 
-#ifndef LZ4_FAST_DEC_LOOP 
+static const unsigned inc32table[8] = {0, 1, 2,  1,  0,  4, 4, 4};
+static const int      dec64table[8] = {0, 0, 0, -1, -4,  1, 2, 3};
+
+
+#ifndef LZ4_FAST_DEC_LOOP
 #  if defined __i386__ || defined _M_IX86 || defined __x86_64__ || defined _M_X64
-#    define LZ4_FAST_DEC_LOOP 1 
+#    define LZ4_FAST_DEC_LOOP 1
 #  elif defined(__aarch64__) && !defined(__clang__)
      /* On aarch64, we disable this optimization for clang because on certain
       * mobile chipsets, performance is reduced with clang. For information
       * refer to https://github.com/lz4/lz4/pull/707 */
 #    define LZ4_FAST_DEC_LOOP 1
-#  else 
-#    define LZ4_FAST_DEC_LOOP 0 
-#  endif 
-#endif 
- 
+#  else
+#    define LZ4_FAST_DEC_LOOP 0
+#  endif
+#endif
+
 #if LZ4_FAST_DEC_LOOP && !defined(ONLY_COMPRESS)
- 
+
 LZ4_FORCE_INLINE void
-LZ4_memcpy_using_offset_base(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset) 
+LZ4_memcpy_using_offset_base(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset)
 {
     assert(srcPtr + offset == dstPtr);
-    if (offset < 8) { 
+    if (offset < 8) {
         LZ4_write32(dstPtr, 0);   /* silence an msan warning when offset==0 */
-        dstPtr[0] = srcPtr[0]; 
-        dstPtr[1] = srcPtr[1]; 
-        dstPtr[2] = srcPtr[2]; 
-        dstPtr[3] = srcPtr[3]; 
-        srcPtr += inc32table[offset]; 
+        dstPtr[0] = srcPtr[0];
+        dstPtr[1] = srcPtr[1];
+        dstPtr[2] = srcPtr[2];
+        dstPtr[3] = srcPtr[3];
+        srcPtr += inc32table[offset];
         LZ4_memcpy(dstPtr+4, srcPtr, 4);
-        srcPtr -= dec64table[offset]; 
-        dstPtr += 8; 
-    } else { 
+        srcPtr -= dec64table[offset];
+        dstPtr += 8;
+    } else {
         LZ4_memcpy(dstPtr, srcPtr, 8);
-        dstPtr += 8; 
-        srcPtr += 8; 
-    } 
- 
-    LZ4_wildCopy8(dstPtr, srcPtr, dstEnd); 
-} 
- 
-/* customized variant of memcpy, which can overwrite up to 32 bytes beyond dstEnd 
- * this version copies two times 16 bytes (instead of one time 32 bytes) 
- * because it must be compatible with offsets >= 16. */ 
+        dstPtr += 8;
+        srcPtr += 8;
+    }
+
+    LZ4_wildCopy8(dstPtr, srcPtr, dstEnd);
+}
+
+/* customized variant of memcpy, which can overwrite up to 32 bytes beyond dstEnd
+ * this version copies two times 16 bytes (instead of one time 32 bytes)
+ * because it must be compatible with offsets >= 16. */
 LZ4_FORCE_INLINE void
-LZ4_wildCopy32(void* dstPtr, const void* srcPtr, void* dstEnd) 
-{ 
+LZ4_wildCopy32(void* dstPtr, const void* srcPtr, void* dstEnd)
+{
     BYTE* d = (BYTE*)dstPtr;
     const BYTE* s = (const BYTE*)srcPtr;
     BYTE* const e = (BYTE*)dstEnd;
@@ -475,44 +475,44 @@ LZ4_wildCopy32(void* dstPtr, const void* srcPtr, void* dstEnd)
  * - dstEnd >= dstPtr + MINMATCH
  * - there is at least 8 bytes available to write after dstEnd */
 LZ4_FORCE_INLINE void
-LZ4_memcpy_using_offset(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset) 
-{ 
-    BYTE v[8]; 
+LZ4_memcpy_using_offset(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset)
+{
+    BYTE v[8];
 
     assert(dstEnd >= dstPtr + MINMATCH);
 
-    switch(offset) { 
-    case 1: 
+    switch(offset) {
+    case 1:
         MEM_INIT(v, *srcPtr, 8);
         break;
-    case 2: 
+    case 2:
         LZ4_memcpy(v, srcPtr, 2);
         LZ4_memcpy(&v[2], srcPtr, 2);
         LZ4_memcpy(&v[4], v, 4);
         break;
-    case 4: 
+    case 4:
         LZ4_memcpy(v, srcPtr, 4);
         LZ4_memcpy(&v[4], srcPtr, 4);
         break;
-    default: 
-        LZ4_memcpy_using_offset_base(dstPtr, srcPtr, dstEnd, offset); 
-        return; 
-    } 
+    default:
+        LZ4_memcpy_using_offset_base(dstPtr, srcPtr, dstEnd, offset);
+        return;
+    }
 
     LZ4_memcpy(dstPtr, v, 8);
-    dstPtr += 8; 
-    while (dstPtr < dstEnd) { 
+    dstPtr += 8;
+    while (dstPtr < dstEnd) {
         LZ4_memcpy(dstPtr, v, 8);
-        dstPtr += 8; 
-    } 
-} 
-#endif 
- 
- 
+        dstPtr += 8;
+    }
+}
+#endif
+
+
 /*-************************************
 *  Common functions
 **************************************/
-static unsigned LZ4_NbCommonBytes (reg_t val) 
+static unsigned LZ4_NbCommonBytes (reg_t val)
 {
     assert(val != 0);
     if (LZ4_isLittleEndian()) {
@@ -574,11 +574,11 @@ static unsigned LZ4_NbCommonBytes (reg_t val)
             /* this method doesn't consume memory space like the previous one,
              * but it contains several branches,
              * that may end up slowing execution */
-            static const U32 by32 = sizeof(val)*4;  /* 32 on 64 bits (goal), 16 on 32 bits. 
+            static const U32 by32 = sizeof(val)*4;  /* 32 on 64 bits (goal), 16 on 32 bits.
             Just to avoid some static analyzer complaining about shift by 32 on 32-bits target.
             Note that this code path is never triggered in 32-bits mode. */
             unsigned r;
-            if (!(val>>by32)) { r=4; } else { r=0; val>>=by32; } 
+            if (!(val>>by32)) { r=4; } else { r=0; val>>=by32; }
             if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
             r += (!val);
             return r;
@@ -601,21 +601,21 @@ static unsigned LZ4_NbCommonBytes (reg_t val)
 
 
 #define STEPSIZE sizeof(reg_t)
-LZ4_FORCE_INLINE 
-unsigned LZ4_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* pInLimit) 
+LZ4_FORCE_INLINE
+unsigned LZ4_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* pInLimit)
 {
     const BYTE* const pStart = pIn;
 
-    if (likely(pIn < pInLimit-(STEPSIZE-1))) { 
+    if (likely(pIn < pInLimit-(STEPSIZE-1))) {
+        reg_t const diff = LZ4_read_ARCH(pMatch) ^ LZ4_read_ARCH(pIn);
+        if (!diff) {
+            pIn+=STEPSIZE; pMatch+=STEPSIZE;
+        } else {
+            return LZ4_NbCommonBytes(diff);
+    }   }
+
+    while (likely(pIn < pInLimit-(STEPSIZE-1))) {
         reg_t const diff = LZ4_read_ARCH(pMatch) ^ LZ4_read_ARCH(pIn);
-        if (!diff) { 
-            pIn+=STEPSIZE; pMatch+=STEPSIZE; 
-        } else { 
-            return LZ4_NbCommonBytes(diff); 
-    }   } 
- 
-    while (likely(pIn < pInLimit-(STEPSIZE-1))) { 
-        reg_t const diff = LZ4_read_ARCH(pMatch) ^ LZ4_read_ARCH(pIn); 
         if (!diff) { pIn+=STEPSIZE; pMatch+=STEPSIZE; continue; }
         pIn += LZ4_NbCommonBytes(diff);
         return (unsigned)(pIn - pStart);
@@ -639,32 +639,32 @@ static const U32 LZ4_skipTrigger = 6;  /* Increase this value ==> compression ru
 /*-************************************
 *  Local Structures and types
 **************************************/
-typedef enum { clearedTable = 0, byPtr, byU32, byU16 } tableType_t; 
-
-/** 
- * This enum distinguishes several different modes of accessing previous 
- * content in the stream. 
- * 
- * - noDict        : There is no preceding content. 
- * - withPrefix64k : Table entries up to ctx->dictSize before the current blob 
- *                   blob being compressed are valid and refer to the preceding 
- *                   content (of length ctx->dictSize), which is available 
- *                   contiguously preceding in memory the content currently 
- *                   being compressed. 
- * - usingExtDict  : Like withPrefix64k, but the preceding content is somewhere 
- *                   else in memory, starting at ctx->dictionary with length 
- *                   ctx->dictSize. 
- * - usingDictCtx  : Like usingExtDict, but everything concerning the preceding 
- *                   content is in a separate context, pointed to by 
- *                   ctx->dictCtx. ctx->dictionary, ctx->dictSize, and table 
- *                   entries in the current context that refer to positions 
- *                   preceding the beginning of the current compression are 
- *                   ignored. Instead, ctx->dictCtx->dictionary and ctx->dictCtx 
- *                   ->dictSize describe the location and size of the preceding 
- *                   content, and matches are found by looking in the ctx 
- *                   ->dictCtx->hashTable. 
- */ 
-typedef enum { noDict = 0, withPrefix64k, usingExtDict, usingDictCtx } dict_directive; 
+typedef enum { clearedTable = 0, byPtr, byU32, byU16 } tableType_t;
+
+/**
+ * This enum distinguishes several different modes of accessing previous
+ * content in the stream.
+ *
+ * - noDict        : There is no preceding content.
+ * - withPrefix64k : Table entries up to ctx->dictSize before the current blob
+ *                   blob being compressed are valid and refer to the preceding
+ *                   content (of length ctx->dictSize), which is available
+ *                   contiguously preceding in memory the content currently
+ *                   being compressed.
+ * - usingExtDict  : Like withPrefix64k, but the preceding content is somewhere
+ *                   else in memory, starting at ctx->dictionary with length
+ *                   ctx->dictSize.
+ * - usingDictCtx  : Like usingExtDict, but everything concerning the preceding
+ *                   content is in a separate context, pointed to by
+ *                   ctx->dictCtx. ctx->dictionary, ctx->dictSize, and table
+ *                   entries in the current context that refer to positions
+ *                   preceding the beginning of the current compression are
+ *                   ignored. Instead, ctx->dictCtx->dictionary and ctx->dictCtx
+ *                   ->dictSize describe the location and size of the preceding
+ *                   content, and matches are found by looking in the ctx
+ *                   ->dictCtx->hashTable.
+ */
+typedef enum { noDict = 0, withPrefix64k, usingExtDict, usingDictCtx } dict_directive;
 typedef enum { noDictIssue = 0, dictSmall } dictIssue_directive;
 
 
@@ -677,23 +677,23 @@ int LZ4_compressBound(int isize)  { return LZ4_COMPRESSBOUND(isize); }
 int LZ4_sizeofState(void) { return LZ4_STREAMSIZE; }
 
 
-/*-************************************ 
-*  Internal Definitions used in Tests 
-**************************************/ 
+/*-************************************
+*  Internal Definitions used in Tests
+**************************************/
 #if defined (__cplusplus) && !defined(ONLY_COMPRESS)
-extern "C" { 
-#endif 
- 
+extern "C" {
+#endif
+
 int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_dict, const char* source, char* dest, int srcSize);
- 
+
 int LZ4_decompress_safe_forceExtDict(const char* source, char* dest,
                                      int compressedSize, int maxOutputSize,
                                      const void* dictStart, size_t dictSize);
- 
+
 #if defined (__cplusplus) && !defined(ONLY_COMPRESS)
-} 
-#endif 
- 
+}
+#endif
+
 /*-******************************
 *  Compression functions
 ********************************/
@@ -708,16 +708,16 @@ LZ4_FORCE_INLINE U32 LZ4_hash4(U32 sequence, tableType_t const tableType)
 LZ4_FORCE_INLINE U32 LZ4_hash5(U64 sequence, tableType_t const tableType)
 {
     const U32 hashLog = (tableType == byU16) ? LZ4_HASHLOG+1 : LZ4_HASHLOG;
-    if (LZ4_isLittleEndian()) { 
-        const U64 prime5bytes = 889523592379ULL; 
+    if (LZ4_isLittleEndian()) {
+        const U64 prime5bytes = 889523592379ULL;
         return (U32)(((sequence << 24) * prime5bytes) >> (64 - hashLog));
-    } else { 
-        const U64 prime8bytes = 11400714785074694791ULL; 
+    } else {
+        const U64 prime8bytes = 11400714785074694791ULL;
         return (U32)(((sequence >> 24) * prime8bytes) >> (64 - hashLog));
-    } 
+    }
 }
 
-LZ4_FORCE_INLINE U32 LZ4_hashPosition(const void* const p, tableType_t const tableType) 
+LZ4_FORCE_INLINE U32 LZ4_hashPosition(const void* const p, tableType_t const tableType)
 {
     if ((sizeof(reg_t)==8) && (tableType != byU16)) return LZ4_hash5(LZ4_read_ARCH(p), tableType);
     return LZ4_hash4(LZ4_read32(p), tableType);
@@ -739,67 +739,67 @@ LZ4_FORCE_INLINE void LZ4_putIndexOnHash(U32 idx, U32 h, void* tableBase, tableT
 {
     switch (tableType)
     {
-    default: /* fallthrough */ 
-    case clearedTable: /* fallthrough */ 
-    case byPtr: { /* illegal! */ assert(0); return; } 
-    case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = idx; return; } 
-    case byU16: { U16* hashTable = (U16*) tableBase; assert(idx < 65536); hashTable[h] = (U16)idx; return; } 
-    } 
-} 
- 
+    default: /* fallthrough */
+    case clearedTable: /* fallthrough */
+    case byPtr: { /* illegal! */ assert(0); return; }
+    case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = idx; return; }
+    case byU16: { U16* hashTable = (U16*) tableBase; assert(idx < 65536); hashTable[h] = (U16)idx; return; }
+    }
+}
+
 LZ4_FORCE_INLINE void LZ4_putPositionOnHash(const BYTE* p, U32 h,
-                                  void* tableBase, tableType_t const tableType, 
-                            const BYTE* srcBase) 
-{ 
-    switch (tableType) 
-    { 
-    case clearedTable: { /* illegal! */ assert(0); return; } 
+                                  void* tableBase, tableType_t const tableType,
+                            const BYTE* srcBase)
+{
+    switch (tableType)
+    {
+    case clearedTable: { /* illegal! */ assert(0); return; }
     case byPtr: { const BYTE** hashTable = (const BYTE**)tableBase; hashTable[h] = p; return; }
     case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = (U32)(p-srcBase); return; }
     case byU16: { U16* hashTable = (U16*) tableBase; hashTable[h] = (U16)(p-srcBase); return; }
     }
 }
 
-LZ4_FORCE_INLINE void LZ4_putPosition(const BYTE* p, void* tableBase, tableType_t tableType, const BYTE* srcBase) 
+LZ4_FORCE_INLINE void LZ4_putPosition(const BYTE* p, void* tableBase, tableType_t tableType, const BYTE* srcBase)
 {
     U32 const h = LZ4_hashPosition(p, tableType);
     LZ4_putPositionOnHash(p, h, tableBase, tableType, srcBase);
 }
 
-/* LZ4_getIndexOnHash() : 
- * Index of match position registered in hash table. 
- * hash position must be calculated by using base+index, or dictBase+index. 
- * Assumption 1 : only valid if tableType == byU32 or byU16. 
- * Assumption 2 : h is presumed valid (within limits of hash table) 
- */ 
+/* LZ4_getIndexOnHash() :
+ * Index of match position registered in hash table.
+ * hash position must be calculated by using base+index, or dictBase+index.
+ * Assumption 1 : only valid if tableType == byU32 or byU16.
+ * Assumption 2 : h is presumed valid (within limits of hash table)
+ */
 LZ4_FORCE_INLINE U32 LZ4_getIndexOnHash(U32 h, const void* tableBase, tableType_t tableType)
 {
-    LZ4_STATIC_ASSERT(LZ4_MEMORY_USAGE > 2); 
-    if (tableType == byU32) { 
-        const U32* const hashTable = (const U32*) tableBase; 
-        assert(h < (1U << (LZ4_MEMORY_USAGE-2))); 
-        return hashTable[h]; 
-    } 
-    if (tableType == byU16) { 
-        const U16* const hashTable = (const U16*) tableBase; 
-        assert(h < (1U << (LZ4_MEMORY_USAGE-1))); 
-        return hashTable[h]; 
-    } 
-    assert(0); return 0;  /* forbidden case */ 
-}
-
-static const BYTE* LZ4_getPositionOnHash(U32 h, const void* tableBase, tableType_t tableType, const BYTE* srcBase) 
-{
-    if (tableType == byPtr) { const BYTE* const* hashTable = (const BYTE* const*) tableBase; return hashTable[h]; } 
-    if (tableType == byU32) { const U32* const hashTable = (const U32*) tableBase; return hashTable[h] + srcBase; } 
-    { const U16* const hashTable = (const U16*) tableBase; return hashTable[h] + srcBase; }   /* default, to ensure a return */ 
-} 
- 
+    LZ4_STATIC_ASSERT(LZ4_MEMORY_USAGE > 2);
+    if (tableType == byU32) {
+        const U32* const hashTable = (const U32*) tableBase;
+        assert(h < (1U << (LZ4_MEMORY_USAGE-2)));
+        return hashTable[h];
+    }
+    if (tableType == byU16) {
+        const U16* const hashTable = (const U16*) tableBase;
+        assert(h < (1U << (LZ4_MEMORY_USAGE-1)));
+        return hashTable[h];
+    }
+    assert(0); return 0;  /* forbidden case */
+}
+
+static const BYTE* LZ4_getPositionOnHash(U32 h, const void* tableBase, tableType_t tableType, const BYTE* srcBase)
+{
+    if (tableType == byPtr) { const BYTE* const* hashTable = (const BYTE* const*) tableBase; return hashTable[h]; }
+    if (tableType == byU32) { const U32* const hashTable = (const U32*) tableBase; return hashTable[h] + srcBase; }
+    { const U16* const hashTable = (const U16*) tableBase; return hashTable[h] + srcBase; }   /* default, to ensure a return */
+}
+
 LZ4_FORCE_INLINE const BYTE*
 LZ4_getPosition(const BYTE* p,
                 const void* tableBase, tableType_t tableType,
                 const BYTE* srcBase)
-{ 
+{
     U32 const h = LZ4_hashPosition(p, tableType);
     return LZ4_getPositionOnHash(h, tableBase, tableType, srcBase);
 }
@@ -808,42 +808,42 @@ LZ4_FORCE_INLINE void
 LZ4_prepareTable(LZ4_stream_t_internal* const cctx,
            const int inputSize,
            const tableType_t tableType) {
-    /* If the table hasn't been used, it's guaranteed to be zeroed out, and is 
-     * therefore safe to use no matter what mode we're in. Otherwise, we figure 
-     * out if it's safe to leave as is or whether it needs to be reset. 
-     */ 
+    /* If the table hasn't been used, it's guaranteed to be zeroed out, and is
+     * therefore safe to use no matter what mode we're in. Otherwise, we figure
+     * out if it's safe to leave as is or whether it needs to be reset.
+     */
     if ((tableType_t)cctx->tableType != clearedTable) {
         assert(inputSize >= 0);
         if ((tableType_t)cctx->tableType != tableType
           || ((tableType == byU16) && cctx->currentOffset + (unsigned)inputSize >= 0xFFFFU)
           || ((tableType == byU32) && cctx->currentOffset > 1 GB)
-          || tableType == byPtr 
-          || inputSize >= 4 KB) 
-        { 
-            DEBUGLOG(4, "LZ4_prepareTable: Resetting table in %p", cctx); 
-            MEM_INIT(cctx->hashTable, 0, LZ4_HASHTABLESIZE); 
-            cctx->currentOffset = 0; 
+          || tableType == byPtr
+          || inputSize >= 4 KB)
+        {
+            DEBUGLOG(4, "LZ4_prepareTable: Resetting table in %p", cctx);
+            MEM_INIT(cctx->hashTable, 0, LZ4_HASHTABLESIZE);
+            cctx->currentOffset = 0;
             cctx->tableType = (U32)clearedTable;
-        } else { 
-            DEBUGLOG(4, "LZ4_prepareTable: Re-use hash table (no reset)"); 
-        } 
-    } 
- 
-    /* Adding a gap, so all previous entries are > LZ4_DISTANCE_MAX back, is faster 
-     * than compressing without a gap. However, compressing with 
-     * currentOffset == 0 is faster still, so we preserve that case. 
-     */ 
-    if (cctx->currentOffset != 0 && tableType == byU32) { 
-        DEBUGLOG(5, "LZ4_prepareTable: adding 64KB to currentOffset"); 
-        cctx->currentOffset += 64 KB; 
-    } 
- 
-    /* Finally, clear history */ 
-    cctx->dictCtx = NULL; 
-    cctx->dictionary = NULL; 
-    cctx->dictSize = 0; 
-} 
- 
+        } else {
+            DEBUGLOG(4, "LZ4_prepareTable: Re-use hash table (no reset)");
+        }
+    }
+
+    /* Adding a gap, so all previous entries are > LZ4_DISTANCE_MAX back, is faster
+     * than compressing without a gap. However, compressing with
+     * currentOffset == 0 is faster still, so we preserve that case.
+     */
+    if (cctx->currentOffset != 0 && tableType == byU32) {
+        DEBUGLOG(5, "LZ4_prepareTable: adding 64KB to currentOffset");
+        cctx->currentOffset += 64 KB;
+    }
+
+    /* Finally, clear history */
+    cctx->dictCtx = NULL;
+    cctx->dictionary = NULL;
+    cctx->dictSize = 0;
+}
+
 /** LZ4_compress_generic() :
  *  inlined, to ensure branches are decided at compilation time.
  *  Presumed already validated at this stage:
@@ -855,73 +855,73 @@ LZ4_FORCE_INLINE int LZ4_compress_generic_validated(
                  const char* const source,
                  char* const dest,
                  const int inputSize,
-                 int *inputConsumed, /* only written when outputDirective == fillOutput */ 
+                 int *inputConsumed, /* only written when outputDirective == fillOutput */
                  const int maxOutputSize,
-                 const limitedOutput_directive outputDirective, 
+                 const limitedOutput_directive outputDirective,
                  const tableType_t tableType,
-                 const dict_directive dictDirective, 
+                 const dict_directive dictDirective,
                  const dictIssue_directive dictIssue,
-                 const int acceleration) 
+                 const int acceleration)
 {
-    int result; 
+    int result;
     const BYTE* ip = (const BYTE*) source;
- 
-    U32 const startIndex = cctx->currentOffset; 
-    const BYTE* base = (const BYTE*) source - startIndex; 
+
+    U32 const startIndex = cctx->currentOffset;
+    const BYTE* base = (const BYTE*) source - startIndex;
     const BYTE* lowLimit;
- 
-    const LZ4_stream_t_internal* dictCtx = (const LZ4_stream_t_internal*) cctx->dictCtx; 
-    const BYTE* const dictionary = 
-        dictDirective == usingDictCtx ? dictCtx->dictionary : cctx->dictionary; 
-    const U32 dictSize = 
-        dictDirective == usingDictCtx ? dictCtx->dictSize : cctx->dictSize; 
-    const U32 dictDelta = (dictDirective == usingDictCtx) ? startIndex - dictCtx->currentOffset : 0;   /* make indexes in dictCtx comparable with index in current context */ 
- 
-    int const maybe_extMem = (dictDirective == usingExtDict) || (dictDirective == usingDictCtx); 
-    U32 const prefixIdxLimit = startIndex - dictSize;   /* used when dictDirective == dictSmall */ 
+
+    const LZ4_stream_t_internal* dictCtx = (const LZ4_stream_t_internal*) cctx->dictCtx;
+    const BYTE* const dictionary =
+        dictDirective == usingDictCtx ? dictCtx->dictionary : cctx->dictionary;
+    const U32 dictSize =
+        dictDirective == usingDictCtx ? dictCtx->dictSize : cctx->dictSize;
+    const U32 dictDelta = (dictDirective == usingDictCtx) ? startIndex - dictCtx->currentOffset : 0;   /* make indexes in dictCtx comparable with index in current context */
+
+    int const maybe_extMem = (dictDirective == usingExtDict) || (dictDirective == usingDictCtx);
+    U32 const prefixIdxLimit = startIndex - dictSize;   /* used when dictDirective == dictSmall */
     const BYTE* const dictEnd = dictionary ? dictionary + dictSize : dictionary;
     const BYTE* anchor = (const BYTE*) source;
     const BYTE* const iend = ip + inputSize;
-    const BYTE* const mflimitPlusOne = iend - MFLIMIT + 1; 
+    const BYTE* const mflimitPlusOne = iend - MFLIMIT + 1;
     const BYTE* const matchlimit = iend - LASTLITERALS;
 
-    /* the dictCtx currentOffset is indexed on the start of the dictionary, 
-     * while a dictionary in the current context precedes the currentOffset */ 
+    /* the dictCtx currentOffset is indexed on the start of the dictionary,
+     * while a dictionary in the current context precedes the currentOffset */
     const BYTE* dictBase = !dictionary ? NULL : (dictDirective == usingDictCtx) ?
-                            dictionary + dictSize - dictCtx->currentOffset : 
-                            dictionary + dictSize - startIndex; 
- 
+                            dictionary + dictSize - dictCtx->currentOffset :
+                            dictionary + dictSize - startIndex;
+
     BYTE* op = (BYTE*) dest;
     BYTE* const olimit = op + maxOutputSize;
 
-    U32 offset = 0; 
+    U32 offset = 0;
     U32 forwardH;
 
     DEBUGLOG(5, "LZ4_compress_generic_validated: srcSize=%i, tableType=%u", inputSize, tableType);
     assert(ip != NULL);
-    /* If init conditions are not met, we don't have to mark stream 
-     * as having dirty context, since no action was taken yet */ 
+    /* If init conditions are not met, we don't have to mark stream
+     * as having dirty context, since no action was taken yet */
     if (outputDirective == fillOutput && maxOutputSize < 1) { return 0; } /* Impossible to store anything */
     if ((tableType == byU16) && (inputSize>=LZ4_64Klimit)) { return 0; }  /* Size too large (not within 64K limit) */
-    if (tableType==byPtr) assert(dictDirective==noDict);      /* only supported use case with byPtr */ 
-    assert(acceleration >= 1); 
- 
-    lowLimit = (const BYTE*)source - (dictDirective == withPrefix64k ? dictSize : 0); 
- 
-    /* Update context state */ 
-    if (dictDirective == usingDictCtx) { 
-        /* Subsequent linked blocks can't use the dictionary. */ 
-        /* Instead, they use the block we just compressed. */ 
-        cctx->dictCtx = NULL; 
-        cctx->dictSize = (U32)inputSize; 
-    } else { 
-        cctx->dictSize += (U32)inputSize; 
+    if (tableType==byPtr) assert(dictDirective==noDict);      /* only supported use case with byPtr */
+    assert(acceleration >= 1);
+
+    lowLimit = (const BYTE*)source - (dictDirective == withPrefix64k ? dictSize : 0);
+
+    /* Update context state */
+    if (dictDirective == usingDictCtx) {
+        /* Subsequent linked blocks can't use the dictionary. */
+        /* Instead, they use the block we just compressed. */
+        cctx->dictCtx = NULL;
+        cctx->dictSize = (U32)inputSize;
+    } else {
+        cctx->dictSize += (U32)inputSize;
     }
-    cctx->currentOffset += (U32)inputSize; 
+    cctx->currentOffset += (U32)inputSize;
     cctx->tableType = (U32)tableType;
 
-    if (inputSize<LZ4_minLength) goto _last_literals;        /* Input too small, no compression (all literals) */ 
- 
+    if (inputSize<LZ4_minLength) goto _last_literals;        /* Input too small, no compression (all literals) */
+
     /* First Byte */
     LZ4_putPosition(ip, cctx->hashTable, tableType, base);
     ip++; forwardH = LZ4_hashPosition(ip, tableType);
@@ -933,107 +933,107 @@ LZ4_FORCE_INLINE int LZ4_compress_generic_validated(
         const BYTE* filledIp;
 
         /* Find a match */
-        if (tableType == byPtr) { 
-            const BYTE* forwardIp = ip; 
-            int step = 1; 
-            int searchMatchNb = acceleration << LZ4_skipTrigger; 
+        if (tableType == byPtr) {
+            const BYTE* forwardIp = ip;
+            int step = 1;
+            int searchMatchNb = acceleration << LZ4_skipTrigger;
             do {
                 U32 const h = forwardH;
                 ip = forwardIp;
                 forwardIp += step;
                 step = (searchMatchNb++ >> LZ4_skipTrigger);
 
-                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals; 
-                assert(ip < mflimitPlusOne); 
+                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals;
+                assert(ip < mflimitPlusOne);
 
                 match = LZ4_getPositionOnHash(h, cctx->hashTable, tableType, base);
-                forwardH = LZ4_hashPosition(forwardIp, tableType); 
-                LZ4_putPositionOnHash(ip, h, cctx->hashTable, tableType, base); 
- 
-            } while ( (match+LZ4_DISTANCE_MAX < ip) 
-                   || (LZ4_read32(match) != LZ4_read32(ip)) ); 
- 
-        } else {   /* byU32, byU16 */ 
- 
-            const BYTE* forwardIp = ip; 
-            int step = 1; 
-            int searchMatchNb = acceleration << LZ4_skipTrigger; 
-            do { 
-                U32 const h = forwardH; 
-                U32 const current = (U32)(forwardIp - base); 
-                U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType); 
-                assert(matchIndex <= current); 
-                assert(forwardIp - base < (ptrdiff_t)(2 GB - 1)); 
-                ip = forwardIp; 
-                forwardIp += step; 
-                step = (searchMatchNb++ >> LZ4_skipTrigger); 
- 
-                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals; 
-                assert(ip < mflimitPlusOne); 
- 
-                if (dictDirective == usingDictCtx) { 
-                    if (matchIndex < startIndex) { 
-                        /* there was no match, try the dictionary */ 
-                        assert(tableType == byU32); 
-                        matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32); 
-                        match = dictBase + matchIndex; 
-                        matchIndex += dictDelta;   /* make dictCtx index comparable with current context */ 
+                forwardH = LZ4_hashPosition(forwardIp, tableType);
+                LZ4_putPositionOnHash(ip, h, cctx->hashTable, tableType, base);
+
+            } while ( (match+LZ4_DISTANCE_MAX < ip)
+                   || (LZ4_read32(match) != LZ4_read32(ip)) );
+
+        } else {   /* byU32, byU16 */
+
+            const BYTE* forwardIp = ip;
+            int step = 1;
+            int searchMatchNb = acceleration << LZ4_skipTrigger;
+            do {
+                U32 const h = forwardH;
+                U32 const current = (U32)(forwardIp - base);
+                U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType);
+                assert(matchIndex <= current);
+                assert(forwardIp - base < (ptrdiff_t)(2 GB - 1));
+                ip = forwardIp;
+                forwardIp += step;
+                step = (searchMatchNb++ >> LZ4_skipTrigger);
+
+                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals;
+                assert(ip < mflimitPlusOne);
+
+                if (dictDirective == usingDictCtx) {
+                    if (matchIndex < startIndex) {
+                        /* there was no match, try the dictionary */
+                        assert(tableType == byU32);
+                        matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32);
+                        match = dictBase + matchIndex;
+                        matchIndex += dictDelta;   /* make dictCtx index comparable with current context */
+                        lowLimit = dictionary;
+                    } else {
+                        match = base + matchIndex;
+                        lowLimit = (const BYTE*)source;
+                    }
+                } else if (dictDirective==usingExtDict) {
+                    if (matchIndex < startIndex) {
+                        DEBUGLOG(7, "extDict candidate: matchIndex=%5u  <  startIndex=%5u", matchIndex, startIndex);
+                        assert(startIndex - matchIndex >= MINMATCH);
+                        match = dictBase + matchIndex;
                         lowLimit = dictionary;
                     } else {
-                        match = base + matchIndex; 
+                        match = base + matchIndex;
                         lowLimit = (const BYTE*)source;
-                    } 
-                } else if (dictDirective==usingExtDict) { 
-                    if (matchIndex < startIndex) { 
-                        DEBUGLOG(7, "extDict candidate: matchIndex=%5u  <  startIndex=%5u", matchIndex, startIndex); 
-                        assert(startIndex - matchIndex >= MINMATCH); 
-                        match = dictBase + matchIndex; 
-                        lowLimit = dictionary; 
-                    } else { 
-                        match = base + matchIndex; 
-                        lowLimit = (const BYTE*)source; 
-                    } 
-                } else {   /* single continuous memory segment */ 
-                    match = base + matchIndex; 
-                } 
+                    }
+                } else {   /* single continuous memory segment */
+                    match = base + matchIndex;
+                }
                 forwardH = LZ4_hashPosition(forwardIp, tableType);
-                LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType); 
+                LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType);
 
                 DEBUGLOG(7, "candidate at pos=%u  (offset=%u \n", matchIndex, current - matchIndex);
                 if ((dictIssue == dictSmall) && (matchIndex < prefixIdxLimit)) { continue; }    /* match outside of valid area */
-                assert(matchIndex < current); 
+                assert(matchIndex < current);
                 if ( ((tableType != byU16) || (LZ4_DISTANCE_MAX < LZ4_DISTANCE_ABSOLUTE_MAX))
                   && (matchIndex+LZ4_DISTANCE_MAX < current)) {
                     continue;
                 } /* too far */
                 assert((current - matchIndex) <= LZ4_DISTANCE_MAX);  /* match now expected within distance */
- 
-                if (LZ4_read32(match) == LZ4_read32(ip)) { 
-                    if (maybe_extMem) offset = current - matchIndex; 
-                    break;   /* match found */ 
-                } 
- 
-            } while(1); 
+
+                if (LZ4_read32(match) == LZ4_read32(ip)) {
+                    if (maybe_extMem) offset = current - matchIndex;
+                    break;   /* match found */
+                }
+
+            } while(1);
         }
 
         /* Catch up */
         filledIp = ip;
-        while (((ip>anchor) & (match > lowLimit)) && (unlikely(ip[-1]==match[-1]))) { ip--; match--; } 
+        while (((ip>anchor) & (match > lowLimit)) && (unlikely(ip[-1]==match[-1]))) { ip--; match--; }
 
         /* Encode Literals */
         {   unsigned const litLength = (unsigned)(ip - anchor);
             token = op++;
-            if ((outputDirective == limitedOutput) &&  /* Check output buffer overflow */ 
+            if ((outputDirective == limitedOutput) &&  /* Check output buffer overflow */
                 (unlikely(op + litLength + (2 + 1 + LASTLITERALS) + (litLength/255) > olimit)) ) {
-                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */ 
+                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+            }
+            if ((outputDirective == fillOutput) &&
+                (unlikely(op + (litLength+240)/255 /* litlen */ + litLength /* literals */ + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit))) {
+                op--;
+                goto _last_literals;
             }
-            if ((outputDirective == fillOutput) && 
-                (unlikely(op + (litLength+240)/255 /* litlen */ + litLength /* literals */ + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit))) { 
-                op--; 
-                goto _last_literals; 
-            } 
             if (litLength >= RUN_MASK) {
-                int len = (int)(litLength - RUN_MASK); 
+                int len = (int)(litLength - RUN_MASK);
                 *token = (RUN_MASK<<ML_BITS);
                 for(; len >= 255 ; len-=255) *op++ = 255;
                 *op++ = (BYTE)len;
@@ -1041,69 +1041,69 @@ LZ4_FORCE_INLINE int LZ4_compress_generic_validated(
             else *token = (BYTE)(litLength<<ML_BITS);
 
             /* Copy Literals */
-            LZ4_wildCopy8(op, anchor, op+litLength); 
+            LZ4_wildCopy8(op, anchor, op+litLength);
             op+=litLength;
-            DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i", 
-                        (int)(anchor-(const BYTE*)source), litLength, (int)(ip-(const BYTE*)source)); 
+            DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i",
+                        (int)(anchor-(const BYTE*)source), litLength, (int)(ip-(const BYTE*)source));
         }
 
 _next_match:
-        /* at this stage, the following variables must be correctly set : 
-         * - ip : at start of LZ operation 
-         * - match : at start of previous pattern occurence; can be within current prefix, or within extDict 
-         * - offset : if maybe_ext_memSegment==1 (constant) 
-         * - lowLimit : must be == dictionary to mean "match is within extDict"; must be == source otherwise 
-         * - token and *token : position to write 4-bits for match length; higher 4-bits for literal length supposed already written 
-         */ 
- 
-        if ((outputDirective == fillOutput) && 
-            (op + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit)) { 
-            /* the match was too close to the end, rewind and go to last literals */ 
-            op = token; 
-            goto _last_literals; 
-        } 
- 
+        /* at this stage, the following variables must be correctly set :
+         * - ip : at start of LZ operation
+         * - match : at start of previous pattern occurence; can be within current prefix, or within extDict
+         * - offset : if maybe_ext_memSegment==1 (constant)
+         * - lowLimit : must be == dictionary to mean "match is within extDict"; must be == source otherwise
+         * - token and *token : position to write 4-bits for match length; higher 4-bits for literal length supposed already written
+         */
+
+        if ((outputDirective == fillOutput) &&
+            (op + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit)) {
+            /* the match was too close to the end, rewind and go to last literals */
+            op = token;
+            goto _last_literals;
+        }
+
         /* Encode Offset */
-        if (maybe_extMem) {   /* static test */ 
-            DEBUGLOG(6, "             with offset=%u  (ext if > %i)", offset, (int)(ip - (const BYTE*)source)); 
-            assert(offset <= LZ4_DISTANCE_MAX && offset > 0); 
-            LZ4_writeLE16(op, (U16)offset); op+=2; 
-        } else  { 
-            DEBUGLOG(6, "             with offset=%u  (same segment)", (U32)(ip - match)); 
-            assert(ip-match <= LZ4_DISTANCE_MAX); 
-            LZ4_writeLE16(op, (U16)(ip - match)); op+=2; 
-        } 
+        if (maybe_extMem) {   /* static test */
+            DEBUGLOG(6, "             with offset=%u  (ext if > %i)", offset, (int)(ip - (const BYTE*)source));
+            assert(offset <= LZ4_DISTANCE_MAX && offset > 0);
+            LZ4_writeLE16(op, (U16)offset); op+=2;
+        } else  {
+            DEBUGLOG(6, "             with offset=%u  (same segment)", (U32)(ip - match));
+            assert(ip-match <= LZ4_DISTANCE_MAX);
+            LZ4_writeLE16(op, (U16)(ip - match)); op+=2;
+        }
 
         /* Encode MatchLength */
         {   unsigned matchCode;
 
-            if ( (dictDirective==usingExtDict || dictDirective==usingDictCtx) 
-              && (lowLimit==dictionary) /* match within extDict */ ) { 
-                const BYTE* limit = ip + (dictEnd-match); 
-                assert(dictEnd > match); 
+            if ( (dictDirective==usingExtDict || dictDirective==usingDictCtx)
+              && (lowLimit==dictionary) /* match within extDict */ ) {
+                const BYTE* limit = ip + (dictEnd-match);
+                assert(dictEnd > match);
                 if (limit > matchlimit) limit = matchlimit;
                 matchCode = LZ4_count(ip+MINMATCH, match+MINMATCH, limit);
-                ip += (size_t)matchCode + MINMATCH; 
+                ip += (size_t)matchCode + MINMATCH;
                 if (ip==limit) {
-                    unsigned const more = LZ4_count(limit, (const BYTE*)source, matchlimit); 
+                    unsigned const more = LZ4_count(limit, (const BYTE*)source, matchlimit);
                     matchCode += more;
                     ip += more;
                 }
-                DEBUGLOG(6, "             with matchLength=%u starting in extDict", matchCode+MINMATCH); 
+                DEBUGLOG(6, "             with matchLength=%u starting in extDict", matchCode+MINMATCH);
             } else {
                 matchCode = LZ4_count(ip+MINMATCH, match+MINMATCH, matchlimit);
-                ip += (size_t)matchCode + MINMATCH; 
-                DEBUGLOG(6, "             with matchLength=%u", matchCode+MINMATCH); 
+                ip += (size_t)matchCode + MINMATCH;
+                DEBUGLOG(6, "             with matchLength=%u", matchCode+MINMATCH);
             }
 
-            if ((outputDirective) &&    /* Check output buffer overflow */ 
+            if ((outputDirective) &&    /* Check output buffer overflow */
                 (unlikely(op + (1 + LASTLITERALS) + (matchCode+240)/255 > olimit)) ) {
-                if (outputDirective == fillOutput) { 
-                    /* Match description too long : reduce it */ 
+                if (outputDirective == fillOutput) {
+                    /* Match description too long : reduce it */
                     U32 newMatchCode = 15 /* in token */ - 1 /* to avoid needing a zero byte */ + ((U32)(olimit - op) - 1 - LASTLITERALS) * 255;
-                    ip -= matchCode - newMatchCode; 
+                    ip -= matchCode - newMatchCode;
                     assert(newMatchCode < matchCode);
-                    matchCode = newMatchCode; 
+                    matchCode = newMatchCode;
                     if (unlikely(ip <= filledIp)) {
                         /* We have already filled up to filledIp so if ip ends up less than filledIp
                          * we have positions in the hash table beyond the current position. This is
@@ -1117,20 +1117,20 @@ _next_match:
                             LZ4_clearHash(h, cctx->hashTable, tableType);
                         }
                     }
-                } else { 
-                    assert(outputDirective == limitedOutput); 
-                    return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */ 
-                } 
-            } 
+                } else {
+                    assert(outputDirective == limitedOutput);
+                    return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+                }
+            }
             if (matchCode >= ML_MASK) {
                 *token += ML_MASK;
                 matchCode -= ML_MASK;
                 LZ4_write32(op, 0xFFFFFFFF);
-                while (matchCode >= 4*255) { 
-                    op+=4; 
-                    LZ4_write32(op, 0xFFFFFFFF); 
-                    matchCode -= 4*255; 
-                } 
+                while (matchCode >= 4*255) {
+                    op+=4;
+                    LZ4_write32(op, 0xFFFFFFFF);
+                    matchCode -= 4*255;
+                }
                 op += matchCode / 255;
                 *op++ = (BYTE)(matchCode % 255);
             } else
@@ -1142,82 +1142,82 @@ _next_match:
         anchor = ip;
 
         /* Test end of chunk */
-        if (ip >= mflimitPlusOne) break; 
+        if (ip >= mflimitPlusOne) break;
 
         /* Fill table */
         LZ4_putPosition(ip-2, cctx->hashTable, tableType, base);
 
         /* Test next position */
-        if (tableType == byPtr) { 
-
-            match = LZ4_getPosition(ip, cctx->hashTable, tableType, base); 
-            LZ4_putPosition(ip, cctx->hashTable, tableType, base); 
-            if ( (match+LZ4_DISTANCE_MAX >= ip) 
-              && (LZ4_read32(match) == LZ4_read32(ip)) ) 
-            { token=op++; *token=0; goto _next_match; } 
- 
-        } else {   /* byU32, byU16 */ 
- 
-            U32 const h = LZ4_hashPosition(ip, tableType); 
-            U32 const current = (U32)(ip-base); 
-            U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType); 
-            assert(matchIndex < current); 
-            if (dictDirective == usingDictCtx) { 
-                if (matchIndex < startIndex) { 
-                    /* there was no match, try the dictionary */ 
-                    matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32); 
-                    match = dictBase + matchIndex; 
-                    lowLimit = dictionary;   /* required for match length counter */ 
-                    matchIndex += dictDelta; 
-                } else { 
-                    match = base + matchIndex; 
-                    lowLimit = (const BYTE*)source;  /* required for match length counter */ 
-                } 
-            } else if (dictDirective==usingExtDict) { 
-                if (matchIndex < startIndex) { 
-                    match = dictBase + matchIndex; 
-                    lowLimit = dictionary;   /* required for match length counter */ 
-                } else { 
-                    match = base + matchIndex; 
-                    lowLimit = (const BYTE*)source;   /* required for match length counter */ 
-                } 
-            } else {   /* single memory segment */ 
-                match = base + matchIndex; 
-            } 
-            LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType); 
-            assert(matchIndex < current); 
-            if ( ((dictIssue==dictSmall) ? (matchIndex >= prefixIdxLimit) : 1) 
+        if (tableType == byPtr) {
+
+            match = LZ4_getPosition(ip, cctx->hashTable, tableType, base);
+            LZ4_putPosition(ip, cctx->hashTable, tableType, base);
+            if ( (match+LZ4_DISTANCE_MAX >= ip)
+              && (LZ4_read32(match) == LZ4_read32(ip)) )
+            { token=op++; *token=0; goto _next_match; }
+
+        } else {   /* byU32, byU16 */
+
+            U32 const h = LZ4_hashPosition(ip, tableType);
+            U32 const current = (U32)(ip-base);
+            U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType);
+            assert(matchIndex < current);
+            if (dictDirective == usingDictCtx) {
+                if (matchIndex < startIndex) {
+                    /* there was no match, try the dictionary */
+                    matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32);
+                    match = dictBase + matchIndex;
+                    lowLimit = dictionary;   /* required for match length counter */
+                    matchIndex += dictDelta;
+                } else {
+                    match = base + matchIndex;
+                    lowLimit = (const BYTE*)source;  /* required for match length counter */
+                }
+            } else if (dictDirective==usingExtDict) {
+                if (matchIndex < startIndex) {
+                    match = dictBase + matchIndex;
+                    lowLimit = dictionary;   /* required for match length counter */
+                } else {
+                    match = base + matchIndex;
+                    lowLimit = (const BYTE*)source;   /* required for match length counter */
+                }
+            } else {   /* single memory segment */
+                match = base + matchIndex;
+            }
+            LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType);
+            assert(matchIndex < current);
+            if ( ((dictIssue==dictSmall) ? (matchIndex >= prefixIdxLimit) : 1)
               && (((tableType==byU16) && (LZ4_DISTANCE_MAX == LZ4_DISTANCE_ABSOLUTE_MAX)) ? 1 : (matchIndex+LZ4_DISTANCE_MAX >= current))
-              && (LZ4_read32(match) == LZ4_read32(ip)) ) { 
-                token=op++; 
-                *token=0; 
-                if (maybe_extMem) offset = current - matchIndex; 
-                DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i", 
-                            (int)(anchor-(const BYTE*)source), 0, (int)(ip-(const BYTE*)source)); 
-                goto _next_match; 
-            } 
-        } 
- 
+              && (LZ4_read32(match) == LZ4_read32(ip)) ) {
+                token=op++;
+                *token=0;
+                if (maybe_extMem) offset = current - matchIndex;
+                DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i",
+                            (int)(anchor-(const BYTE*)source), 0, (int)(ip-(const BYTE*)source));
+                goto _next_match;
+            }
+        }
+
         /* Prepare next loop */
         forwardH = LZ4_hashPosition(++ip, tableType);
- 
+
     }
 
 _last_literals:
     /* Encode Last Literals */
-    {   size_t lastRun = (size_t)(iend - anchor); 
-        if ( (outputDirective) &&  /* Check output buffer overflow */ 
-            (op + lastRun + 1 + ((lastRun+255-RUN_MASK)/255) > olimit)) { 
-            if (outputDirective == fillOutput) { 
-                /* adapt lastRun to fill 'dst' */ 
-                assert(olimit >= op); 
+    {   size_t lastRun = (size_t)(iend - anchor);
+        if ( (outputDirective) &&  /* Check output buffer overflow */
+            (op + lastRun + 1 + ((lastRun+255-RUN_MASK)/255) > olimit)) {
+            if (outputDirective == fillOutput) {
+                /* adapt lastRun to fill 'dst' */
+                assert(olimit >= op);
                 lastRun  = (size_t)(olimit-op) - 1/*token*/;
                 lastRun -= (lastRun + 256 - RUN_MASK) / 256;  /*additional length tokens*/
-            } else { 
-                assert(outputDirective == limitedOutput); 
-                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */ 
-            } 
-        } 
+            } else {
+                assert(outputDirective == limitedOutput);
+                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+            }
+        }
         DEBUGLOG(6, "Final literal run : %i literals", (int)lastRun);
         if (lastRun >= RUN_MASK) {
             size_t accumulator = lastRun - RUN_MASK;
@@ -1228,17 +1228,17 @@ _last_literals:
             *op++ = (BYTE)(lastRun<<ML_BITS);
         }
         LZ4_memcpy(op, anchor, lastRun);
-        ip = anchor + lastRun; 
+        ip = anchor + lastRun;
         op += lastRun;
     }
 
-    if (outputDirective == fillOutput) { 
-        *inputConsumed = (int) (((const char*)ip)-source); 
-    } 
-    result = (int)(((char*)op) - dest); 
-    assert(result > 0); 
+    if (outputDirective == fillOutput) {
+        *inputConsumed = (int) (((const char*)ip)-source);
+    }
+    result = (int)(((char*)op) - dest);
+    assert(result > 0);
     DEBUGLOG(5, "LZ4_compress_generic: compressed %i bytes into %i bytes", inputSize, result);
-    return result; 
+    return result;
 }
 
 /** LZ4_compress_generic() :
@@ -1285,124 +1285,124 @@ LZ4_FORCE_INLINE int LZ4_compress_generic(
 
 int LZ4_compress_fast_extState(void* state, const char* source, char* dest, int inputSize, int maxOutputSize, int acceleration)
 {
-    LZ4_stream_t_internal* const ctx = & LZ4_initStream(state, sizeof(LZ4_stream_t)) -> internal_donotuse; 
-    assert(ctx != NULL); 
+    LZ4_stream_t_internal* const ctx = & LZ4_initStream(state, sizeof(LZ4_stream_t)) -> internal_donotuse;
+    assert(ctx != NULL);
     if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
     if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
-    if (maxOutputSize >= LZ4_compressBound(inputSize)) { 
-        if (inputSize < LZ4_64Klimit) { 
-            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, byU16, noDict, noDictIssue, acceleration); 
-        } else { 
-            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32; 
-            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration); 
-        } 
-    } else { 
+    if (maxOutputSize >= LZ4_compressBound(inputSize)) {
+        if (inputSize < LZ4_64Klimit) {
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, byU16, noDict, noDictIssue, acceleration);
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+        }
+    } else {
         if (inputSize < LZ4_64Klimit) {
-            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, byU16, noDict, noDictIssue, acceleration); 
-        } else { 
-            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32; 
-            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, noDict, noDictIssue, acceleration); 
-        } 
-    } 
-} 
- 
-/** 
- * LZ4_compress_fast_extState_fastReset() : 
- * A variant of LZ4_compress_fast_extState(). 
- * 
- * Using this variant avoids an expensive initialization step. It is only safe 
- * to call if the state buffer is known to be correctly initialized already 
- * (see comment in lz4.h on LZ4_resetStream_fast() for a definition of 
- * "correctly initialized"). 
- */ 
-int LZ4_compress_fast_extState_fastReset(void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration) 
-{ 
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, byU16, noDict, noDictIssue, acceleration);
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+        }
+    }
+}
+
+/**
+ * LZ4_compress_fast_extState_fastReset() :
+ * A variant of LZ4_compress_fast_extState().
+ *
+ * Using this variant avoids an expensive initialization step. It is only safe
+ * to call if the state buffer is known to be correctly initialized already
+ * (see comment in lz4.h on LZ4_resetStream_fast() for a definition of
+ * "correctly initialized").
+ */
+int LZ4_compress_fast_extState_fastReset(void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration)
+{
     LZ4_stream_t_internal* ctx = &((LZ4_stream_t*)state)->internal_donotuse;
     if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
     if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
 
-    if (dstCapacity >= LZ4_compressBound(srcSize)) { 
-        if (srcSize < LZ4_64Klimit) { 
-            const tableType_t tableType = byU16; 
-            LZ4_prepareTable(ctx, srcSize, tableType); 
-            if (ctx->currentOffset) { 
-                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, dictSmall, acceleration); 
-            } else { 
-                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration); 
-            } 
-        } else { 
-            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32; 
-            LZ4_prepareTable(ctx, srcSize, tableType); 
-            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration); 
-        } 
+    if (dstCapacity >= LZ4_compressBound(srcSize)) {
+        if (srcSize < LZ4_64Klimit) {
+            const tableType_t tableType = byU16;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            if (ctx->currentOffset) {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, dictSmall, acceleration);
+            } else {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+            }
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+        }
     } else {
-        if (srcSize < LZ4_64Klimit) { 
-            const tableType_t tableType = byU16; 
-            LZ4_prepareTable(ctx, srcSize, tableType); 
-            if (ctx->currentOffset) { 
-                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, dictSmall, acceleration); 
-            } else { 
-                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration); 
-            } 
-        } else { 
-            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32; 
-            LZ4_prepareTable(ctx, srcSize, tableType); 
-            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration); 
-        } 
+        if (srcSize < LZ4_64Klimit) {
+            const tableType_t tableType = byU16;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            if (ctx->currentOffset) {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, dictSmall, acceleration);
+            } else {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+            }
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+        }
     }
 }
 
 
 int LZ4_compress_fast(const char* source, char* dest, int inputSize, int maxOutputSize, int acceleration)
 {
-    int result; 
-#if (LZ4_HEAPMODE) 
-    LZ4_stream_t* ctxPtr = ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */ 
-    if (ctxPtr == NULL) return 0; 
+    int result;
+#if (LZ4_HEAPMODE)
+    LZ4_stream_t* ctxPtr = ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */
+    if (ctxPtr == NULL) return 0;
 #else
     LZ4_stream_t ctx;
-    LZ4_stream_t* const ctxPtr = &ctx; 
+    LZ4_stream_t* const ctxPtr = &ctx;
 #endif
-    result = LZ4_compress_fast_extState(ctxPtr, source, dest, inputSize, maxOutputSize, acceleration); 
+    result = LZ4_compress_fast_extState(ctxPtr, source, dest, inputSize, maxOutputSize, acceleration);
 
-#if (LZ4_HEAPMODE) 
+#if (LZ4_HEAPMODE)
     FREEMEM(ctxPtr);
 #endif
     return result;
 }
 
 
-int LZ4_compress_default(const char* src, char* dst, int srcSize, int maxOutputSize) 
+int LZ4_compress_default(const char* src, char* dst, int srcSize, int maxOutputSize)
 {
-    return LZ4_compress_fast(src, dst, srcSize, maxOutputSize, 1); 
+    return LZ4_compress_fast(src, dst, srcSize, maxOutputSize, 1);
 }
 
 
-/* Note!: This function leaves the stream in an unclean/broken state! 
- * It is not safe to subsequently use the same state with a _fastReset() or 
- * _continue() call without resetting it. */ 
+/* Note!: This function leaves the stream in an unclean/broken state!
+ * It is not safe to subsequently use the same state with a _fastReset() or
+ * _continue() call without resetting it. */
 static int LZ4_compress_destSize_extState (LZ4_stream_t* state, const char* src, char* dst, int* srcSizePtr, int targetDstSize)
 {
-    void* const s = LZ4_initStream(state, sizeof (*state)); 
-    assert(s != NULL); (void)s; 
+    void* const s = LZ4_initStream(state, sizeof (*state));
+    assert(s != NULL); (void)s;
 
     if (targetDstSize >= LZ4_compressBound(*srcSizePtr)) {  /* compression success is guaranteed */
         return LZ4_compress_fast_extState(state, src, dst, *srcSizePtr, targetDstSize, 1);
     } else {
-        if (*srcSizePtr < LZ4_64Klimit) { 
-            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, byU16, noDict, noDictIssue, 1); 
-        } else { 
-            tableType_t const addrMode = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32; 
-            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, addrMode, noDict, noDictIssue, 1); 
-    }   } 
+        if (*srcSizePtr < LZ4_64Klimit) {
+            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, byU16, noDict, noDictIssue, 1);
+        } else {
+            tableType_t const addrMode = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, addrMode, noDict, noDictIssue, 1);
+    }   }
 }
 
 
 int LZ4_compress_destSize(const char* src, char* dst, int* srcSizePtr, int targetDstSize)
 {
-#if (LZ4_HEAPMODE) 
-    LZ4_stream_t* ctx = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */ 
-    if (ctx == NULL) return 0; 
+#if (LZ4_HEAPMODE)
+    LZ4_stream_t* ctx = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */
+    if (ctx == NULL) return 0;
 #else
     LZ4_stream_t ctxBody;
     LZ4_stream_t* ctx = &ctxBody;
@@ -1410,7 +1410,7 @@ int LZ4_compress_destSize(const char* src, char* dst, int* srcSizePtr, int targe
 
     int result = LZ4_compress_destSize_extState(ctx, src, dst, srcSizePtr, targetDstSize);
 
-#if (LZ4_HEAPMODE) 
+#if (LZ4_HEAPMODE)
     FREEMEM(ctx);
 #endif
     return result;
@@ -1425,52 +1425,52 @@ int LZ4_compress_destSize(const char* src, char* dst, int* srcSizePtr, int targe
 #if !defined(ONLY_COMPRESS)
 LZ4_stream_t* LZ4_createStream(void)
 {
-    LZ4_stream_t* const lz4s = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t)); 
+    LZ4_stream_t* const lz4s = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));
     LZ4_STATIC_ASSERT(LZ4_STREAMSIZE >= sizeof(LZ4_stream_t_internal));    /* A compilation error here means LZ4_STREAMSIZE is not large enough */
-    DEBUGLOG(4, "LZ4_createStream %p", lz4s); 
-    if (lz4s == NULL) return NULL; 
-    LZ4_initStream(lz4s, sizeof(*lz4s)); 
+    DEBUGLOG(4, "LZ4_createStream %p", lz4s);
+    if (lz4s == NULL) return NULL;
+    LZ4_initStream(lz4s, sizeof(*lz4s));
     return lz4s;
 }
 #endif   /* ONLY_COMPRESS */
 
-static size_t LZ4_stream_t_alignment(void) 
-{ 
+static size_t LZ4_stream_t_alignment(void)
+{
 #if LZ4_ALIGN_TEST
     typedef struct { char c; LZ4_stream_t t; } t_a;
     return sizeof(t_a) - sizeof(LZ4_stream_t);
 #else
     return 1;  /* effectively disabled */
 #endif
-} 
- 
-LZ4_stream_t* LZ4_initStream (void* buffer, size_t size) 
-{ 
-    DEBUGLOG(5, "LZ4_initStream"); 
+}
+
+LZ4_stream_t* LZ4_initStream (void* buffer, size_t size)
+{
+    DEBUGLOG(5, "LZ4_initStream");
     if (buffer == NULL) { return NULL; }
     if (size < sizeof(LZ4_stream_t)) { return NULL; }
     if (!LZ4_isAligned(buffer, LZ4_stream_t_alignment())) return NULL;
     MEM_INIT(buffer, 0, sizeof(LZ4_stream_t_internal));
-    return (LZ4_stream_t*)buffer; 
-} 
- 
+    return (LZ4_stream_t*)buffer;
+}
+
 #if !defined(ONLY_COMPRESS)
-/* resetStream is now deprecated, 
- * prefer initStream() which is more general */ 
+/* resetStream is now deprecated,
+ * prefer initStream() which is more general */
 void LZ4_resetStream (LZ4_stream_t* LZ4_stream)
 {
-    DEBUGLOG(5, "LZ4_resetStream (ctx:%p)", LZ4_stream); 
+    DEBUGLOG(5, "LZ4_resetStream (ctx:%p)", LZ4_stream);
     MEM_INIT(LZ4_stream, 0, sizeof(LZ4_stream_t_internal));
 }
 
-void LZ4_resetStream_fast(LZ4_stream_t* ctx) { 
-    LZ4_prepareTable(&(ctx->internal_donotuse), 0, byU32); 
-} 
- 
+void LZ4_resetStream_fast(LZ4_stream_t* ctx) {
+    LZ4_prepareTable(&(ctx->internal_donotuse), 0, byU32);
+}
+
 int LZ4_freeStream (LZ4_stream_t* LZ4_stream)
 {
-    if (!LZ4_stream) return 0;   /* support free on NULL */ 
-    DEBUGLOG(5, "LZ4_freeStream %p", LZ4_stream); 
+    if (!LZ4_stream) return 0;   /* support free on NULL */
+    DEBUGLOG(5, "LZ4_freeStream %p", LZ4_stream);
     FREEMEM(LZ4_stream);
     return (0);
 }
@@ -1480,27 +1480,27 @@ int LZ4_freeStream (LZ4_stream_t* LZ4_stream)
 int LZ4_loadDict (LZ4_stream_t* LZ4_dict, const char* dictionary, int dictSize)
 {
     LZ4_stream_t_internal* dict = &LZ4_dict->internal_donotuse;
-    const tableType_t tableType = byU32; 
+    const tableType_t tableType = byU32;
     const BYTE* p = (const BYTE*)dictionary;
     const BYTE* const dictEnd = p + dictSize;
     const BYTE* base;
 
-    DEBUGLOG(4, "LZ4_loadDict (%i bytes from %p into %p)", dictSize, dictionary, LZ4_dict); 
+    DEBUGLOG(4, "LZ4_loadDict (%i bytes from %p into %p)", dictSize, dictionary, LZ4_dict);
 
-    /* It's necessary to reset the context, 
-     * and not just continue it with prepareTable() 
-     * to avoid any risk of generating overflowing matchIndex 
-     * when compressing using this dictionary */ 
-    LZ4_resetStream(LZ4_dict); 
+    /* It's necessary to reset the context,
+     * and not just continue it with prepareTable()
+     * to avoid any risk of generating overflowing matchIndex
+     * when compressing using this dictionary */
+    LZ4_resetStream(LZ4_dict);
 
-    /* We always increment the offset by 64 KB, since, if the dict is longer, 
-     * we truncate it to the last 64k, and if it's shorter, we still want to 
-     * advance by a whole window length so we can provide the guarantee that 
-     * there are only valid offsets in the window, which allows an optimization 
-     * in LZ4_compress_fast_continue() where it uses noDictIssue even when the 
-     * dictionary isn't a full 64k. */ 
+    /* We always increment the offset by 64 KB, since, if the dict is longer,
+     * we truncate it to the last 64k, and if it's shorter, we still want to
+     * advance by a whole window length so we can provide the guarantee that
+     * there are only valid offsets in the window, which allows an optimization
+     * in LZ4_compress_fast_continue() where it uses noDictIssue even when the
+     * dictionary isn't a full 64k. */
     dict->currentOffset += 64 KB;
- 
+
     if (dictSize < (int)HASH_UNIT) {
         return 0;
     }
@@ -1512,11 +1512,11 @@ int LZ4_loadDict (LZ4_stream_t* LZ4_dict, const char* dictionary, int dictSize)
     dict->tableType = (U32)tableType;
 
     while (p <= dictEnd-HASH_UNIT) {
-        LZ4_putPosition(p, dict->hashTable, tableType, base); 
+        LZ4_putPosition(p, dict->hashTable, tableType, base);
         p+=3;
     }
 
-    return (int)dict->dictSize; 
+    return (int)dict->dictSize;
 }
 
 void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dictionaryStream) {
@@ -1528,34 +1528,34 @@ void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dict
              dictCtx != NULL ? dictCtx->dictSize : 0);
 
     if (dictCtx != NULL) {
-        /* If the current offset is zero, we will never look in the 
-         * external dictionary context, since there is no value a table 
-         * entry can take that indicate a miss. In that case, we need 
-         * to bump the offset to something non-zero. 
-         */ 
+        /* If the current offset is zero, we will never look in the
+         * external dictionary context, since there is no value a table
+         * entry can take that indicate a miss. In that case, we need
+         * to bump the offset to something non-zero.
+         */
         if (workingStream->internal_donotuse.currentOffset == 0) {
             workingStream->internal_donotuse.currentOffset = 64 KB;
-        } 
+        }
 
         /* Don't actually attach an empty dictionary.
          */
         if (dictCtx->dictSize == 0) {
             dictCtx = NULL;
         }
-    } 
+    }
     workingStream->internal_donotuse.dictCtx = dictCtx;
-} 
- 
- 
-static void LZ4_renormDictT(LZ4_stream_t_internal* LZ4_dict, int nextSize) 
+}
+
+
+static void LZ4_renormDictT(LZ4_stream_t_internal* LZ4_dict, int nextSize)
 {
-    assert(nextSize >= 0); 
-    if (LZ4_dict->currentOffset + (unsigned)nextSize > 0x80000000) {   /* potential ptrdiff_t overflow (32-bits mode) */ 
+    assert(nextSize >= 0);
+    if (LZ4_dict->currentOffset + (unsigned)nextSize > 0x80000000) {   /* potential ptrdiff_t overflow (32-bits mode) */
         /* rescale hash table */
         U32 const delta = LZ4_dict->currentOffset - 64 KB;
         const BYTE* dictEnd = LZ4_dict->dictionary + LZ4_dict->dictSize;
         int i;
-        DEBUGLOG(4, "LZ4_renormDictT"); 
+        DEBUGLOG(4, "LZ4_renormDictT");
         for (i=0; i<LZ4_HASH_SIZE_U32; i++) {
             if (LZ4_dict->hashTable[i] < delta) LZ4_dict->hashTable[i]=0;
             else LZ4_dict->hashTable[i] -= delta;
@@ -1567,30 +1567,30 @@ static void LZ4_renormDictT(LZ4_stream_t_internal* LZ4_dict, int nextSize)
 }
 
 
-int LZ4_compress_fast_continue (LZ4_stream_t* LZ4_stream, 
-                                const char* source, char* dest, 
-                                int inputSize, int maxOutputSize, 
-                                int acceleration) 
+int LZ4_compress_fast_continue (LZ4_stream_t* LZ4_stream,
+                                const char* source, char* dest,
+                                int inputSize, int maxOutputSize,
+                                int acceleration)
 {
-    const tableType_t tableType = byU32; 
+    const tableType_t tableType = byU32;
     LZ4_stream_t_internal* streamPtr = &LZ4_stream->internal_donotuse;
-    const BYTE* dictEnd = streamPtr->dictionary + streamPtr->dictSize; 
+    const BYTE* dictEnd = streamPtr->dictionary + streamPtr->dictSize;
+
+    DEBUGLOG(5, "LZ4_compress_fast_continue (inputSize=%i)", inputSize);
 
-    DEBUGLOG(5, "LZ4_compress_fast_continue (inputSize=%i)", inputSize); 
- 
-    LZ4_renormDictT(streamPtr, inputSize);   /* avoid index overflow */ 
+    LZ4_renormDictT(streamPtr, inputSize);   /* avoid index overflow */
     if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
     if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
 
-    /* invalidate tiny dictionaries */ 
-    if ( (streamPtr->dictSize-1 < 4-1)   /* intentional underflow */ 
-      && (dictEnd != (const BYTE*)source) ) { 
-        DEBUGLOG(5, "LZ4_compress_fast_continue: dictSize(%u) at addr:%p is too small", streamPtr->dictSize, streamPtr->dictionary); 
-        streamPtr->dictSize = 0; 
-        streamPtr->dictionary = (const BYTE*)source; 
-        dictEnd = (const BYTE*)source; 
-    } 
- 
+    /* invalidate tiny dictionaries */
+    if ( (streamPtr->dictSize-1 < 4-1)   /* intentional underflow */
+      && (dictEnd != (const BYTE*)source) ) {
+        DEBUGLOG(5, "LZ4_compress_fast_continue: dictSize(%u) at addr:%p is too small", streamPtr->dictSize, streamPtr->dictionary);
+        streamPtr->dictSize = 0;
+        streamPtr->dictionary = (const BYTE*)source;
+        dictEnd = (const BYTE*)source;
+    }
+
     /* Check overlapping input/dictionary space */
     {   const BYTE* sourceEnd = (const BYTE*) source + inputSize;
         if ((sourceEnd > streamPtr->dictionary) && (sourceEnd < dictEnd)) {
@@ -1604,37 +1604,37 @@ int LZ4_compress_fast_continue (LZ4_stream_t* LZ4_stream,
     /* prefix mode : source data follows dictionary */
     if (dictEnd == (const BYTE*)source) {
         if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset))
-            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, dictSmall, acceleration); 
+            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, dictSmall, acceleration);
         else
-            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, noDictIssue, acceleration); 
+            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, noDictIssue, acceleration);
     }
 
     /* external dictionary mode */
     {   int result;
-        if (streamPtr->dictCtx) { 
-            /* We depend here on the fact that dictCtx'es (produced by 
-             * LZ4_loadDict) guarantee that their tables contain no references 
-             * to offsets between dictCtx->currentOffset - 64 KB and 
-             * dictCtx->currentOffset - dictCtx->dictSize. This makes it safe 
-             * to use noDictIssue even when the dict isn't a full 64 KB. 
-             */ 
-            if (inputSize > 4 KB) { 
-                /* For compressing large blobs, it is faster to pay the setup 
-                 * cost to copy the dictionary's tables into the active context, 
-                 * so that the compression loop is only looking into one table. 
-                 */ 
+        if (streamPtr->dictCtx) {
+            /* We depend here on the fact that dictCtx'es (produced by
+             * LZ4_loadDict) guarantee that their tables contain no references
+             * to offsets between dictCtx->currentOffset - 64 KB and
+             * dictCtx->currentOffset - dictCtx->dictSize. This makes it safe
+             * to use noDictIssue even when the dict isn't a full 64 KB.
+             */
+            if (inputSize > 4 KB) {
+                /* For compressing large blobs, it is faster to pay the setup
+                 * cost to copy the dictionary's tables into the active context,
+                 * so that the compression loop is only looking into one table.
+                 */
                 LZ4_memcpy(streamPtr, streamPtr->dictCtx, sizeof(*streamPtr));
-                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration); 
-            } else { 
-                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingDictCtx, noDictIssue, acceleration); 
-            } 
-        } else { 
-            if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) { 
-                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, dictSmall, acceleration); 
-            } else { 
-                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration); 
-            } 
-        } 
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration);
+            } else {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingDictCtx, noDictIssue, acceleration);
+            }
+        } else {
+            if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, dictSmall, acceleration);
+            } else {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration);
+            }
+        }
         streamPtr->dictionary = (const BYTE*)source;
         streamPtr->dictSize = (U32)inputSize;
         return result;
@@ -1642,22 +1642,22 @@ int LZ4_compress_fast_continue (LZ4_stream_t* LZ4_stream,
 }
 
 
-/* Hidden debug function, to force-test external dictionary mode */ 
-int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_dict, const char* source, char* dest, int srcSize) 
+/* Hidden debug function, to force-test external dictionary mode */
+int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_dict, const char* source, char* dest, int srcSize)
 {
     LZ4_stream_t_internal* streamPtr = &LZ4_dict->internal_donotuse;
     int result;
 
-    LZ4_renormDictT(streamPtr, srcSize); 
+    LZ4_renormDictT(streamPtr, srcSize);
 
-    if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) { 
-        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, dictSmall, 1); 
-    } else { 
-        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, noDictIssue, 1); 
-    } 
+    if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) {
+        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, dictSmall, 1);
+    } else {
+        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, noDictIssue, 1);
+    }
 
     streamPtr->dictionary = (const BYTE*)source;
-    streamPtr->dictSize = (U32)srcSize; 
+    streamPtr->dictSize = (U32)srcSize;
 
     return result;
 }
@@ -1690,36 +1690,36 @@ int LZ4_saveDict (LZ4_stream_t* LZ4_dict, char* safeBuffer, int dictSize)
 
 
 
-/*-******************************* 
- *  Decompression functions 
- ********************************/ 
- 
-typedef enum { endOnOutputSize = 0, endOnInputSize = 1 } endCondition_directive; 
-typedef enum { decode_full_block = 0, partial_decode = 1 } earlyEnd_directive; 
- 
-#undef MIN 
-#define MIN(a,b)    ( (a) < (b) ? (a) : (b) ) 
- 
-/* Read the variable-length literal or match length. 
- * 
- * ip - pointer to use as input. 
- * lencheck - end ip.  Return an error if ip advances >= lencheck. 
- * loop_check - check ip >= lencheck in body of loop.  Returns loop_error if so. 
- * initial_check - check ip >= lencheck before start of loop.  Returns initial_error if so. 
- * error (output) - error code.  Should be set to 0 before call. 
- */ 
-typedef enum { loop_error = -2, initial_error = -1, ok = 0 } variable_length_error; 
-LZ4_FORCE_INLINE unsigned 
+/*-*******************************
+ *  Decompression functions
+ ********************************/
+
+typedef enum { endOnOutputSize = 0, endOnInputSize = 1 } endCondition_directive;
+typedef enum { decode_full_block = 0, partial_decode = 1 } earlyEnd_directive;
+
+#undef MIN
+#define MIN(a,b)    ( (a) < (b) ? (a) : (b) )
+
+/* Read the variable-length literal or match length.
+ *
+ * ip - pointer to use as input.
+ * lencheck - end ip.  Return an error if ip advances >= lencheck.
+ * loop_check - check ip >= lencheck in body of loop.  Returns loop_error if so.
+ * initial_check - check ip >= lencheck before start of loop.  Returns initial_error if so.
+ * error (output) - error code.  Should be set to 0 before call.
+ */
+typedef enum { loop_error = -2, initial_error = -1, ok = 0 } variable_length_error;
+LZ4_FORCE_INLINE unsigned
 read_variable_length(const BYTE**ip, const BYTE* lencheck,
                      int loop_check, int initial_check,
                      variable_length_error* error)
-{ 
+{
     U32 length = 0;
     U32 s;
     if (initial_check && unlikely((*ip) >= lencheck)) {    /* overflow detection */
         *error = initial_error;
         return length;
-    } 
+    }
     do {
         s = **ip;
         (*ip)++;
@@ -1729,60 +1729,60 @@ read_variable_length(const BYTE**ip, const BYTE* lencheck,
             return length;
         }
     } while (s==255);
- 
+
     return length;
-} 
- 
+}
+
 /*! LZ4_decompress_generic() :
- *  This generic decompression function covers all use cases. 
- *  It shall be instantiated several times, using different sets of directives. 
- *  Note that it is important for performance that this function really get inlined, 
+ *  This generic decompression function covers all use cases.
+ *  It shall be instantiated several times, using different sets of directives.
+ *  Note that it is important for performance that this function really get inlined,
  *  in order to remove useless branches during compilation optimization.
  */
-LZ4_FORCE_INLINE int 
-LZ4_decompress_generic( 
-                 const char* const src, 
-                 char* const dst, 
-                 int srcSize, 
-                 int outputSize,         /* If endOnInput==endOnInputSize, this value is `dstCapacity` */ 
-
-                 endCondition_directive endOnInput,   /* endOnOutputSize, endOnInputSize */ 
-                 earlyEnd_directive partialDecoding,  /* full, partial */ 
-                 dict_directive dict,                 /* noDict, withPrefix64k, usingExtDict */ 
-                 const BYTE* const lowPrefix,  /* always <= dst, == dst when no prefix */ 
+LZ4_FORCE_INLINE int
+LZ4_decompress_generic(
+                 const char* const src,
+                 char* const dst,
+                 int srcSize,
+                 int outputSize,         /* If endOnInput==endOnInputSize, this value is `dstCapacity` */
+
+                 endCondition_directive endOnInput,   /* endOnOutputSize, endOnInputSize */
+                 earlyEnd_directive partialDecoding,  /* full, partial */
+                 dict_directive dict,                 /* noDict, withPrefix64k, usingExtDict */
+                 const BYTE* const lowPrefix,  /* always <= dst, == dst when no prefix */
                  const BYTE* const dictStart,  /* only if dict==usingExtDict */
                  const size_t dictSize         /* note : = 0 if noDict */
                  )
 {
     if (src == NULL) { return -1; }
 
-    {   const BYTE* ip = (const BYTE*) src; 
-        const BYTE* const iend = ip + srcSize; 
+    {   const BYTE* ip = (const BYTE*) src;
+        const BYTE* const iend = ip + srcSize;
+
+        BYTE* op = (BYTE*) dst;
+        BYTE* const oend = op + outputSize;
+        BYTE* cpy;
 
-        BYTE* op = (BYTE*) dst; 
-        BYTE* const oend = op + outputSize; 
-        BYTE* cpy; 
+        const BYTE* const dictEnd = (dictStart == NULL) ? NULL : dictStart + dictSize;
 
-        const BYTE* const dictEnd = (dictStart == NULL) ? NULL : dictStart + dictSize; 
+        const int safeDecode = (endOnInput==endOnInputSize);
+        const int checkOffset = ((safeDecode) && (dictSize < (int)(64 KB)));
 
-        const int safeDecode = (endOnInput==endOnInputSize); 
-        const int checkOffset = ((safeDecode) && (dictSize < (int)(64 KB))); 
 
+        /* Set up the "end" pointers for the shortcut. */
+        const BYTE* const shortiend = iend - (endOnInput ? 14 : 8) /*maxLL*/ - 2 /*offset*/;
+        const BYTE* const shortoend = oend - (endOnInput ? 14 : 8) /*maxLL*/ - 18 /*maxML*/;
 
-        /* Set up the "end" pointers for the shortcut. */ 
-        const BYTE* const shortiend = iend - (endOnInput ? 14 : 8) /*maxLL*/ - 2 /*offset*/; 
-        const BYTE* const shortoend = oend - (endOnInput ? 14 : 8) /*maxLL*/ - 18 /*maxML*/; 
- 
         const BYTE* match;
         size_t offset;
-        unsigned token; 
-        size_t length; 
-
- 
-        DEBUGLOG(5, "LZ4_decompress_generic (srcSize:%i, dstSize:%i)", srcSize, outputSize); 
- 
-        /* Special cases */ 
-        assert(lowPrefix <= op); 
+        unsigned token;
+        size_t length;
+
+
+        DEBUGLOG(5, "LZ4_decompress_generic (srcSize:%i, dstSize:%i)", srcSize, outputSize);
+
+        /* Special cases */
+        assert(lowPrefix <= op);
         if ((endOnInput) && (unlikely(outputSize==0))) {
             /* Empty output buffer */
             if (partialDecoding) return 0;
@@ -1790,88 +1790,88 @@ LZ4_decompress_generic(
         }
         if ((!endOnInput) && (unlikely(outputSize==0))) { return (*ip==0 ? 1 : -1); }
         if ((endOnInput) && unlikely(srcSize==0)) { return -1; }
- 
-	/* Currently the fast loop shows a regression on qualcomm arm chips. */ 
-#if LZ4_FAST_DEC_LOOP 
-        if ((oend - op) < FASTLOOP_SAFE_DISTANCE) { 
-            DEBUGLOG(6, "skip fast decode loop"); 
-            goto safe_decode; 
+
+	/* Currently the fast loop shows a regression on qualcomm arm chips. */
+#if LZ4_FAST_DEC_LOOP
+        if ((oend - op) < FASTLOOP_SAFE_DISTANCE) {
+            DEBUGLOG(6, "skip fast decode loop");
+            goto safe_decode;
         }
 
-        /* Fast loop : decode sequences as long as output < iend-FASTLOOP_SAFE_DISTANCE */ 
-        while (1) { 
-            /* Main fastloop assertion: We can always wildcopy FASTLOOP_SAFE_DISTANCE */ 
-            assert(oend - op >= FASTLOOP_SAFE_DISTANCE); 
+        /* Fast loop : decode sequences as long as output < iend-FASTLOOP_SAFE_DISTANCE */
+        while (1) {
+            /* Main fastloop assertion: We can always wildcopy FASTLOOP_SAFE_DISTANCE */
+            assert(oend - op >= FASTLOOP_SAFE_DISTANCE);
             if (endOnInput) { assert(ip < iend); }
-            token = *ip++; 
-            length = token >> ML_BITS;  /* literal length */ 
- 
-            assert(!endOnInput || ip <= iend); /* ip < iend before the increment */ 
- 
-            /* decode literal length */ 
-            if (length == RUN_MASK) { 
-                variable_length_error error = ok; 
+            token = *ip++;
+            length = token >> ML_BITS;  /* literal length */
+
+            assert(!endOnInput || ip <= iend); /* ip < iend before the increment */
+
+            /* decode literal length */
+            if (length == RUN_MASK) {
+                variable_length_error error = ok;
                 length += read_variable_length(&ip, iend-RUN_MASK, (int)endOnInput, (int)endOnInput, &error);
                 if (error == initial_error) { goto _output_error; }
                 if ((safeDecode) && unlikely((uptrval)(op)+length<(uptrval)(op))) { goto _output_error; } /* overflow detection */
                 if ((safeDecode) && unlikely((uptrval)(ip)+length<(uptrval)(ip))) { goto _output_error; } /* overflow detection */
- 
-                /* copy literals */ 
-                cpy = op+length; 
-                LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH); 
-                if (endOnInput) {  /* LZ4_decompress_safe() */ 
+
+                /* copy literals */
+                cpy = op+length;
+                LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH);
+                if (endOnInput) {  /* LZ4_decompress_safe() */
                     if ((cpy>oend-32) || (ip+length>iend-32)) { goto safe_literal_copy; }
-                    LZ4_wildCopy32(op, ip, cpy); 
-                } else {   /* LZ4_decompress_fast() */ 
+                    LZ4_wildCopy32(op, ip, cpy);
+                } else {   /* LZ4_decompress_fast() */
                     if (cpy>oend-8) { goto safe_literal_copy; }
-                    LZ4_wildCopy8(op, ip, cpy); /* LZ4_decompress_fast() cannot copy more than 8 bytes at a time : 
-                                                 * it doesn't know input length, and only relies on end-of-block properties */ 
-                } 
-                ip += length; op = cpy; 
+                    LZ4_wildCopy8(op, ip, cpy); /* LZ4_decompress_fast() cannot copy more than 8 bytes at a time :
+                                                 * it doesn't know input length, and only relies on end-of-block properties */
+                }
+                ip += length; op = cpy;
             } else {
-                cpy = op+length; 
-                if (endOnInput) {  /* LZ4_decompress_safe() */ 
-                    DEBUGLOG(7, "copy %u bytes in a 16-bytes stripe", (unsigned)length); 
-                    /* We don't need to check oend, since we check it once for each loop below */ 
+                cpy = op+length;
+                if (endOnInput) {  /* LZ4_decompress_safe() */
+                    DEBUGLOG(7, "copy %u bytes in a 16-bytes stripe", (unsigned)length);
+                    /* We don't need to check oend, since we check it once for each loop below */
                     if (ip > iend-(16 + 1/*max lit + offset + nextToken*/)) { goto safe_literal_copy; }
-                    /* Literals can only be 14, but hope compilers optimize if we copy by a register size */ 
+                    /* Literals can only be 14, but hope compilers optimize if we copy by a register size */
                     LZ4_memcpy(op, ip, 16);
-                } else {  /* LZ4_decompress_fast() */ 
-                    /* LZ4_decompress_fast() cannot copy more than 8 bytes at a time : 
-                     * it doesn't know input length, and relies on end-of-block properties */ 
+                } else {  /* LZ4_decompress_fast() */
+                    /* LZ4_decompress_fast() cannot copy more than 8 bytes at a time :
+                     * it doesn't know input length, and relies on end-of-block properties */
                     LZ4_memcpy(op, ip, 8);
                     if (length > 8) { LZ4_memcpy(op+8, ip+8, 8); }
-                } 
-                ip += length; op = cpy; 
+                }
+                ip += length; op = cpy;
             }
 
-            /* get offset */ 
-            offset = LZ4_readLE16(ip); ip+=2; 
-            match = op - offset; 
+            /* get offset */
+            offset = LZ4_readLE16(ip); ip+=2;
+            match = op - offset;
             assert(match <= op);
 
-            /* get matchlength */ 
-            length = token & ML_MASK; 
- 
-            if (length == ML_MASK) { 
+            /* get matchlength */
+            length = token & ML_MASK;
+
+            if (length == ML_MASK) {
                 variable_length_error error = ok;
                 if ((checkOffset) && (unlikely(match + dictSize < lowPrefix))) { goto _output_error; } /* Error : offset outside buffers */
                 length += read_variable_length(&ip, iend - LASTLITERALS + 1, (int)endOnInput, 0, &error);
                 if (error != ok) { goto _output_error; }
                 if ((safeDecode) && unlikely((uptrval)(op)+length<(uptrval)op)) { goto _output_error; } /* overflow detection */
-                length += MINMATCH; 
-                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) { 
-                    goto safe_match_copy; 
-                } 
-            } else { 
-                length += MINMATCH; 
-                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) { 
-                    goto safe_match_copy; 
-                } 
- 
-                /* Fastpath check: Avoids a branch in LZ4_wildCopy32 if true */ 
+                length += MINMATCH;
+                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) {
+                    goto safe_match_copy;
+                }
+            } else {
+                length += MINMATCH;
+                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) {
+                    goto safe_match_copy;
+                }
+
+                /* Fastpath check: Avoids a branch in LZ4_wildCopy32 if true */
                 if ((dict == withPrefix64k) || (match >= lowPrefix)) {
-                    if (offset >= 8) { 
+                    if (offset >= 8) {
                         assert(match >= lowPrefix);
                         assert(match <= op);
                         assert(op + 18 <= oend);
@@ -1879,129 +1879,129 @@ LZ4_decompress_generic(
                         LZ4_memcpy(op, match, 8);
                         LZ4_memcpy(op+8, match+8, 8);
                         LZ4_memcpy(op+16, match+16, 2);
-                        op += length; 
-                        continue; 
-            }   }   } 
- 
+                        op += length;
+                        continue;
+            }   }   }
+
             if (checkOffset && (unlikely(match + dictSize < lowPrefix))) { goto _output_error; } /* Error : offset outside buffers */
-            /* match starting within external dictionary */ 
-            if ((dict==usingExtDict) && (match < lowPrefix)) { 
-                if (unlikely(op+length > oend-LASTLITERALS)) { 
+            /* match starting within external dictionary */
+            if ((dict==usingExtDict) && (match < lowPrefix)) {
+                if (unlikely(op+length > oend-LASTLITERALS)) {
                     if (partialDecoding) {
                         DEBUGLOG(7, "partialDecoding: dictionary match, close to dstEnd");
                         length = MIN(length, (size_t)(oend-op));
                     } else {
                         goto _output_error;  /* end-of-block condition violated */
                 }   }
- 
-                if (length <= (size_t)(lowPrefix-match)) { 
-                    /* match fits entirely within external dictionary : just copy */ 
-                    memmove(op, dictEnd - (lowPrefix-match), length); 
-                    op += length; 
-                } else { 
-                    /* match stretches into both external dictionary and current block */ 
-                    size_t const copySize = (size_t)(lowPrefix - match); 
-                    size_t const restSize = length - copySize; 
+
+                if (length <= (size_t)(lowPrefix-match)) {
+                    /* match fits entirely within external dictionary : just copy */
+                    memmove(op, dictEnd - (lowPrefix-match), length);
+                    op += length;
+                } else {
+                    /* match stretches into both external dictionary and current block */
+                    size_t const copySize = (size_t)(lowPrefix - match);
+                    size_t const restSize = length - copySize;
                     LZ4_memcpy(op, dictEnd - copySize, copySize);
-                    op += copySize; 
-                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */ 
-                        BYTE* const endOfMatch = op + restSize; 
-                        const BYTE* copyFrom = lowPrefix; 
+                    op += copySize;
+                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */
+                        BYTE* const endOfMatch = op + restSize;
+                        const BYTE* copyFrom = lowPrefix;
                         while (op < endOfMatch) { *op++ = *copyFrom++; }
-                    } else { 
+                    } else {
                         LZ4_memcpy(op, lowPrefix, restSize);
-                        op += restSize; 
-                }   } 
-                continue; 
-            } 
- 
-            /* copy match within block */ 
-            cpy = op + length; 
- 
-            assert((op <= oend) && (oend-op >= 32)); 
-            if (unlikely(offset<16)) { 
-                LZ4_memcpy_using_offset(op, match, cpy, offset); 
-            } else { 
-                LZ4_wildCopy32(op, match, cpy); 
-            } 
- 
-            op = cpy;   /* wildcopy correction */ 
+                        op += restSize;
+                }   }
+                continue;
+            }
+
+            /* copy match within block */
+            cpy = op + length;
+
+            assert((op <= oend) && (oend-op >= 32));
+            if (unlikely(offset<16)) {
+                LZ4_memcpy_using_offset(op, match, cpy, offset);
+            } else {
+                LZ4_wildCopy32(op, match, cpy);
+            }
+
+            op = cpy;   /* wildcopy correction */
         }
-    safe_decode: 
-#endif 
-
-        /* Main Loop : decode remaining sequences where output < FASTLOOP_SAFE_DISTANCE */ 
-        while (1) { 
-            token = *ip++; 
-            length = token >> ML_BITS;  /* literal length */ 
-
-            assert(!endOnInput || ip <= iend); /* ip < iend before the increment */ 
- 
-            /* A two-stage shortcut for the most common case: 
-             * 1) If the literal length is 0..14, and there is enough space, 
-             * enter the shortcut and copy 16 bytes on behalf of the literals 
-             * (in the fast mode, only 8 bytes can be safely copied this way). 
-             * 2) Further if the match length is 4..18, copy 18 bytes in a similar 
-             * manner; but we ensure that there's enough space in the output for 
-             * those 18 bytes earlier, upon entering the shortcut (in other words, 
-             * there is a combined check for both stages). 
-             */ 
-            if ( (endOnInput ? length != RUN_MASK : length <= 8) 
-                /* strictly "less than" on input, to re-enter the loop with at least one byte */ 
-              && likely((endOnInput ? ip < shortiend : 1) & (op <= shortoend)) ) { 
-                /* Copy the literals */ 
+    safe_decode:
+#endif
+
+        /* Main Loop : decode remaining sequences where output < FASTLOOP_SAFE_DISTANCE */
+        while (1) {
+            token = *ip++;
+            length = token >> ML_BITS;  /* literal length */
+
+            assert(!endOnInput || ip <= iend); /* ip < iend before the increment */
+
+            /* A two-stage shortcut for the most common case:
+             * 1) If the literal length is 0..14, and there is enough space,
+             * enter the shortcut and copy 16 bytes on behalf of the literals
+             * (in the fast mode, only 8 bytes can be safely copied this way).
+             * 2) Further if the match length is 4..18, copy 18 bytes in a similar
+             * manner; but we ensure that there's enough space in the output for
+             * those 18 bytes earlier, upon entering the shortcut (in other words,
+             * there is a combined check for both stages).
+             */
+            if ( (endOnInput ? length != RUN_MASK : length <= 8)
+                /* strictly "less than" on input, to re-enter the loop with at least one byte */
+              && likely((endOnInput ? ip < shortiend : 1) & (op <= shortoend)) ) {
+                /* Copy the literals */
                 LZ4_memcpy(op, ip, endOnInput ? 16 : 8);
-                op += length; ip += length; 
- 
-                /* The second stage: prepare for match copying, decode full info. 
-                 * If it doesn't work out, the info won't be wasted. */ 
-                length = token & ML_MASK; /* match length */ 
-                offset = LZ4_readLE16(ip); ip += 2; 
-                match = op - offset; 
-                assert(match <= op); /* check overflow */ 
- 
-                /* Do not deal with overlapping matches. */ 
-                if ( (length != ML_MASK) 
-                  && (offset >= 8) 
-                  && (dict==withPrefix64k || match >= lowPrefix) ) { 
-                    /* Copy the match. */ 
+                op += length; ip += length;
+
+                /* The second stage: prepare for match copying, decode full info.
+                 * If it doesn't work out, the info won't be wasted. */
+                length = token & ML_MASK; /* match length */
+                offset = LZ4_readLE16(ip); ip += 2;
+                match = op - offset;
+                assert(match <= op); /* check overflow */
+
+                /* Do not deal with overlapping matches. */
+                if ( (length != ML_MASK)
+                  && (offset >= 8)
+                  && (dict==withPrefix64k || match >= lowPrefix) ) {
+                    /* Copy the match. */
                     LZ4_memcpy(op + 0, match + 0, 8);
                     LZ4_memcpy(op + 8, match + 8, 8);
                     LZ4_memcpy(op +16, match +16, 2);
-                    op += length + MINMATCH; 
-                    /* Both stages worked, load the next token. */ 
-                    continue; 
-                } 
- 
-                /* The second stage didn't work out, but the info is ready. 
-                 * Propel it right to the point of match copying. */ 
-                goto _copy_match; 
-            } 
- 
-            /* decode literal length */ 
-            if (length == RUN_MASK) { 
+                    op += length + MINMATCH;
+                    /* Both stages worked, load the next token. */
+                    continue;
+                }
+
+                /* The second stage didn't work out, but the info is ready.
+                 * Propel it right to the point of match copying. */
+                goto _copy_match;
+            }
+
+            /* decode literal length */
+            if (length == RUN_MASK) {
                 variable_length_error error = ok;
                 length += read_variable_length(&ip, iend-RUN_MASK, (int)endOnInput, (int)endOnInput, &error);
                 if (error == initial_error) { goto _output_error; }
                 if ((safeDecode) && unlikely((uptrval)(op)+length<(uptrval)(op))) { goto _output_error; } /* overflow detection */
                 if ((safeDecode) && unlikely((uptrval)(ip)+length<(uptrval)(ip))) { goto _output_error; } /* overflow detection */
-            } 
- 
-            /* copy literals */ 
-            cpy = op+length; 
-#if LZ4_FAST_DEC_LOOP 
-        safe_literal_copy: 
-#endif 
-            LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH); 
-            if ( ((endOnInput) && ((cpy>oend-MFLIMIT) || (ip+length>iend-(2+1+LASTLITERALS))) ) 
-              || ((!endOnInput) && (cpy>oend-WILDCOPYLENGTH)) ) 
-            { 
+            }
+
+            /* copy literals */
+            cpy = op+length;
+#if LZ4_FAST_DEC_LOOP
+        safe_literal_copy:
+#endif
+            LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH);
+            if ( ((endOnInput) && ((cpy>oend-MFLIMIT) || (ip+length>iend-(2+1+LASTLITERALS))) )
+              || ((!endOnInput) && (cpy>oend-WILDCOPYLENGTH)) )
+            {
                 /* We've either hit the input parsing restriction or the output parsing restriction.
                  * In the normal scenario, decoding a full block, it must be the last sequence,
                  * otherwise it's an error (invalid input or dimensions).
                  * In partialDecoding scenario, it's necessary to ensure there is no buffer overflow.
                  */
-                if (partialDecoding) { 
+                if (partialDecoding) {
                     /* Since we are partial decoding we may be in this block because of the output parsing
                      * restriction, which is not valid since the output buffer is allowed to be undersized.
                      */
@@ -2025,7 +2025,7 @@ LZ4_decompress_generic(
                         assert(op<=oend);
                         length = (size_t)(oend-op);
                     }
-                } else { 
+                } else {
                     /* We must be on the last sequence because of the parsing limitations so check
                      * that we exactly regenerate the original size (must be exact when !endOnInput).
                      */
@@ -2039,9 +2039,9 @@ LZ4_decompress_generic(
                         DEBUGLOG(6, "or cpy(%p) > oend(%p)", cpy, oend);
                         goto _output_error;
                     }
-                } 
+                }
                 memmove(op, ip, length);  /* supports overlapping memory regions; only matters for in-place decompression scenarios */
-                ip += length; 
+                ip += length;
                 op += length;
                 /* Necessarily EOF when !partialDecoding.
                  * When partialDecoding, it is EOF if we've either
@@ -2049,228 +2049,228 @@ LZ4_decompress_generic(
                  * can't proceed with reading an offset for following match.
                  */
                 if (!partialDecoding || (cpy == oend) || (ip >= (iend-2))) {
-                    break; 
-                } 
+                    break;
+                }
             } else {
-                LZ4_wildCopy8(op, ip, cpy);   /* may overwrite up to WILDCOPYLENGTH beyond cpy */ 
-                ip += length; op = cpy; 
-            } 
- 
-            /* get offset */ 
-            offset = LZ4_readLE16(ip); ip+=2; 
-            match = op - offset; 
- 
-            /* get matchlength */ 
-            length = token & ML_MASK; 
- 
-    _copy_match: 
-            if (length == ML_MASK) { 
-              variable_length_error error = ok; 
+                LZ4_wildCopy8(op, ip, cpy);   /* may overwrite up to WILDCOPYLENGTH beyond cpy */
+                ip += length; op = cpy;
+            }
+
+            /* get offset */
+            offset = LZ4_readLE16(ip); ip+=2;
+            match = op - offset;
+
+            /* get matchlength */
+            length = token & ML_MASK;
+
+    _copy_match:
+            if (length == ML_MASK) {
+              variable_length_error error = ok;
               length += read_variable_length(&ip, iend - LASTLITERALS + 1, (int)endOnInput, 0, &error);
-              if (error != ok) goto _output_error; 
-                if ((safeDecode) && unlikely((uptrval)(op)+length<(uptrval)op)) goto _output_error;   /* overflow detection */ 
-            } 
-            length += MINMATCH; 
- 
-#if LZ4_FAST_DEC_LOOP 
-        safe_match_copy: 
-#endif 
+              if (error != ok) goto _output_error;
+                if ((safeDecode) && unlikely((uptrval)(op)+length<(uptrval)op)) goto _output_error;   /* overflow detection */
+            }
+            length += MINMATCH;
+
+#if LZ4_FAST_DEC_LOOP
+        safe_match_copy:
+#endif
             if ((checkOffset) && (unlikely(match + dictSize < lowPrefix))) goto _output_error;   /* Error : offset outside buffers */
-            /* match starting within external dictionary */ 
-            if ((dict==usingExtDict) && (match < lowPrefix)) { 
-                if (unlikely(op+length > oend-LASTLITERALS)) { 
-                    if (partialDecoding) length = MIN(length, (size_t)(oend-op)); 
-                    else goto _output_error;   /* doesn't respect parsing restriction */ 
-                } 
- 
-                if (length <= (size_t)(lowPrefix-match)) { 
-                    /* match fits entirely within external dictionary : just copy */ 
-                    memmove(op, dictEnd - (lowPrefix-match), length); 
-                    op += length; 
+            /* match starting within external dictionary */
+            if ((dict==usingExtDict) && (match < lowPrefix)) {
+                if (unlikely(op+length > oend-LASTLITERALS)) {
+                    if (partialDecoding) length = MIN(length, (size_t)(oend-op));
+                    else goto _output_error;   /* doesn't respect parsing restriction */
+                }
+
+                if (length <= (size_t)(lowPrefix-match)) {
+                    /* match fits entirely within external dictionary : just copy */
+                    memmove(op, dictEnd - (lowPrefix-match), length);
+                    op += length;
                 } else {
-                    /* match stretches into both external dictionary and current block */ 
-                    size_t const copySize = (size_t)(lowPrefix - match); 
-                    size_t const restSize = length - copySize; 
+                    /* match stretches into both external dictionary and current block */
+                    size_t const copySize = (size_t)(lowPrefix - match);
+                    size_t const restSize = length - copySize;
                     LZ4_memcpy(op, dictEnd - copySize, copySize);
-                    op += copySize; 
-                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */ 
-                        BYTE* const endOfMatch = op + restSize; 
-                        const BYTE* copyFrom = lowPrefix; 
-                        while (op < endOfMatch) *op++ = *copyFrom++; 
-                    } else { 
+                    op += copySize;
+                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */
+                        BYTE* const endOfMatch = op + restSize;
+                        const BYTE* copyFrom = lowPrefix;
+                        while (op < endOfMatch) *op++ = *copyFrom++;
+                    } else {
                         LZ4_memcpy(op, lowPrefix, restSize);
-                        op += restSize; 
-                }   } 
-                continue; 
-            } 
+                        op += restSize;
+                }   }
+                continue;
+            }
             assert(match >= lowPrefix);
 
-            /* copy match within block */ 
-            cpy = op + length; 
+            /* copy match within block */
+            cpy = op + length;
 
-            /* partialDecoding : may end anywhere within the block */ 
-            assert(op<=oend); 
-            if (partialDecoding && (cpy > oend-MATCH_SAFEGUARD_DISTANCE)) { 
-                size_t const mlen = MIN(length, (size_t)(oend-op)); 
-                const BYTE* const matchEnd = match + mlen; 
-                BYTE* const copyEnd = op + mlen; 
-                if (matchEnd > op) {   /* overlap copy */ 
+            /* partialDecoding : may end anywhere within the block */
+            assert(op<=oend);
+            if (partialDecoding && (cpy > oend-MATCH_SAFEGUARD_DISTANCE)) {
+                size_t const mlen = MIN(length, (size_t)(oend-op));
+                const BYTE* const matchEnd = match + mlen;
+                BYTE* const copyEnd = op + mlen;
+                if (matchEnd > op) {   /* overlap copy */
                     while (op < copyEnd) { *op++ = *match++; }
-                } else { 
+                } else {
                     LZ4_memcpy(op, match, mlen);
-                } 
-                op = copyEnd; 
+                }
+                op = copyEnd;
                 if (op == oend) { break; }
-                continue; 
+                continue;
             }
- 
-            if (unlikely(offset<8)) { 
+
+            if (unlikely(offset<8)) {
                 LZ4_write32(op, 0);   /* silence msan warning when offset==0 */
-                op[0] = match[0]; 
-                op[1] = match[1]; 
-                op[2] = match[2]; 
-                op[3] = match[3]; 
-                match += inc32table[offset]; 
+                op[0] = match[0];
+                op[1] = match[1];
+                op[2] = match[2];
+                op[3] = match[3];
+                match += inc32table[offset];
                 LZ4_memcpy(op+4, match, 4);
-                match -= dec64table[offset]; 
-            } else { 
+                match -= dec64table[offset];
+            } else {
                 LZ4_memcpy(op, match, 8);
-                match += 8; 
-            } 
-            op += 8; 
- 
-            if (unlikely(cpy > oend-MATCH_SAFEGUARD_DISTANCE)) { 
-                BYTE* const oCopyLimit = oend - (WILDCOPYLENGTH-1); 
+                match += 8;
+            }
+            op += 8;
+
+            if (unlikely(cpy > oend-MATCH_SAFEGUARD_DISTANCE)) {
+                BYTE* const oCopyLimit = oend - (WILDCOPYLENGTH-1);
                 if (cpy > oend-LASTLITERALS) { goto _output_error; } /* Error : last LASTLITERALS bytes must be literals (uncompressed) */
-                if (op < oCopyLimit) { 
-                    LZ4_wildCopy8(op, match, oCopyLimit); 
-                    match += oCopyLimit - op; 
-                    op = oCopyLimit; 
-                } 
+                if (op < oCopyLimit) {
+                    LZ4_wildCopy8(op, match, oCopyLimit);
+                    match += oCopyLimit - op;
+                    op = oCopyLimit;
+                }
                 while (op < cpy) { *op++ = *match++; }
-            } else { 
+            } else {
                 LZ4_memcpy(op, match, 8);
                 if (length > 16)  { LZ4_wildCopy8(op+8, match+8, cpy); }
-            } 
-            op = cpy;   /* wildcopy correction */ 
+            }
+            op = cpy;   /* wildcopy correction */
         }
 
-        /* end of decoding */ 
+        /* end of decoding */
         if (endOnInput) {
             DEBUGLOG(5, "decoded %i bytes", (int) (((char*)op)-dst));
-           return (int) (((char*)op)-dst);     /* Nb of output bytes decoded */ 
+           return (int) (((char*)op)-dst);     /* Nb of output bytes decoded */
        } else {
-           return (int) (((const char*)ip)-src);   /* Nb of input bytes read */ 
+           return (int) (((const char*)ip)-src);   /* Nb of input bytes read */
        }
 
-        /* Overflow error detected */ 
-    _output_error: 
-        return (int) (-(((const char*)ip)-src))-1; 
-    } 
+        /* Overflow error detected */
+    _output_error:
+        return (int) (-(((const char*)ip)-src))-1;
+    }
 }
 
 
-/*===== Instantiate the API decoding functions. =====*/ 
- 
+/*===== Instantiate the API decoding functions. =====*/
+
 LZ4_FORCE_O2
 int LZ4_decompress_safe(const char* source, char* dest, int compressedSize, int maxDecompressedSize)
 {
-    return LZ4_decompress_generic(source, dest, compressedSize, maxDecompressedSize, 
-                                  endOnInputSize, decode_full_block, noDict, 
-                                  (BYTE*)dest, NULL, 0); 
+    return LZ4_decompress_generic(source, dest, compressedSize, maxDecompressedSize,
+                                  endOnInputSize, decode_full_block, noDict,
+                                  (BYTE*)dest, NULL, 0);
 }
 
 LZ4_FORCE_O2
-int LZ4_decompress_safe_partial(const char* src, char* dst, int compressedSize, int targetOutputSize, int dstCapacity) 
+int LZ4_decompress_safe_partial(const char* src, char* dst, int compressedSize, int targetOutputSize, int dstCapacity)
 {
-    dstCapacity = MIN(targetOutputSize, dstCapacity); 
-    return LZ4_decompress_generic(src, dst, compressedSize, dstCapacity, 
-                                  endOnInputSize, partial_decode, 
-                                  noDict, (BYTE*)dst, NULL, 0); 
+    dstCapacity = MIN(targetOutputSize, dstCapacity);
+    return LZ4_decompress_generic(src, dst, compressedSize, dstCapacity,
+                                  endOnInputSize, partial_decode,
+                                  noDict, (BYTE*)dst, NULL, 0);
 }
 
 LZ4_FORCE_O2
 int LZ4_decompress_fast(const char* source, char* dest, int originalSize)
 {
-    return LZ4_decompress_generic(source, dest, 0, originalSize, 
-                                  endOnOutputSize, decode_full_block, withPrefix64k, 
-                                  (BYTE*)dest - 64 KB, NULL, 0); 
+    return LZ4_decompress_generic(source, dest, 0, originalSize,
+                                  endOnOutputSize, decode_full_block, withPrefix64k,
+                                  (BYTE*)dest - 64 KB, NULL, 0);
 }
 
-/*===== Instantiate a few more decoding cases, used more than once. =====*/ 
+/*===== Instantiate a few more decoding cases, used more than once. =====*/
 
 LZ4_FORCE_O2 /* Exported, an obsolete API function. */
-int LZ4_decompress_safe_withPrefix64k(const char* source, char* dest, int compressedSize, int maxOutputSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize, 
-                                  endOnInputSize, decode_full_block, withPrefix64k, 
-                                  (BYTE*)dest - 64 KB, NULL, 0); 
-} 
- 
-/* Another obsolete API function, paired with the previous one. */ 
-int LZ4_decompress_fast_withPrefix64k(const char* source, char* dest, int originalSize) 
-{ 
-    /* LZ4_decompress_fast doesn't validate match offsets, 
-     * and thus serves well with any prefixed dictionary. */ 
-    return LZ4_decompress_fast(source, dest, originalSize); 
-} 
- 
+int LZ4_decompress_safe_withPrefix64k(const char* source, char* dest, int compressedSize, int maxOutputSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  endOnInputSize, decode_full_block, withPrefix64k,
+                                  (BYTE*)dest - 64 KB, NULL, 0);
+}
+
+/* Another obsolete API function, paired with the previous one. */
+int LZ4_decompress_fast_withPrefix64k(const char* source, char* dest, int originalSize)
+{
+    /* LZ4_decompress_fast doesn't validate match offsets,
+     * and thus serves well with any prefixed dictionary. */
+    return LZ4_decompress_fast(source, dest, originalSize);
+}
+
 LZ4_FORCE_O2
-static int LZ4_decompress_safe_withSmallPrefix(const char* source, char* dest, int compressedSize, int maxOutputSize, 
-                                               size_t prefixSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize, 
-                                  endOnInputSize, decode_full_block, noDict, 
-                                  (BYTE*)dest-prefixSize, NULL, 0); 
-} 
- 
+static int LZ4_decompress_safe_withSmallPrefix(const char* source, char* dest, int compressedSize, int maxOutputSize,
+                                               size_t prefixSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  endOnInputSize, decode_full_block, noDict,
+                                  (BYTE*)dest-prefixSize, NULL, 0);
+}
+
 LZ4_FORCE_O2
-int LZ4_decompress_safe_forceExtDict(const char* source, char* dest, 
-                                     int compressedSize, int maxOutputSize, 
-                                     const void* dictStart, size_t dictSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize, 
-                                  endOnInputSize, decode_full_block, usingExtDict, 
-                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize); 
-} 
- 
+int LZ4_decompress_safe_forceExtDict(const char* source, char* dest,
+                                     int compressedSize, int maxOutputSize,
+                                     const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  endOnInputSize, decode_full_block, usingExtDict,
+                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize);
+}
+
 LZ4_FORCE_O2
-static int LZ4_decompress_fast_extDict(const char* source, char* dest, int originalSize, 
-                                       const void* dictStart, size_t dictSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, 0, originalSize, 
-                                  endOnOutputSize, decode_full_block, usingExtDict, 
-                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize); 
-} 
- 
-/* The "double dictionary" mode, for use with e.g. ring buffers: the first part 
- * of the dictionary is passed as prefix, and the second via dictStart + dictSize. 
- * These routines are used only once, in LZ4_decompress_*_continue(). 
- */ 
-LZ4_FORCE_INLINE 
-int LZ4_decompress_safe_doubleDict(const char* source, char* dest, int compressedSize, int maxOutputSize, 
-                                   size_t prefixSize, const void* dictStart, size_t dictSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize, 
-                                  endOnInputSize, decode_full_block, usingExtDict, 
-                                  (BYTE*)dest-prefixSize, (const BYTE*)dictStart, dictSize); 
-} 
- 
-LZ4_FORCE_INLINE 
-int LZ4_decompress_fast_doubleDict(const char* source, char* dest, int originalSize, 
-                                   size_t prefixSize, const void* dictStart, size_t dictSize) 
-{ 
-    return LZ4_decompress_generic(source, dest, 0, originalSize, 
-                                  endOnOutputSize, decode_full_block, usingExtDict, 
-                                  (BYTE*)dest-prefixSize, (const BYTE*)dictStart, dictSize); 
-} 
- 
+static int LZ4_decompress_fast_extDict(const char* source, char* dest, int originalSize,
+                                       const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, 0, originalSize,
+                                  endOnOutputSize, decode_full_block, usingExtDict,
+                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize);
+}
+
+/* The "double dictionary" mode, for use with e.g. ring buffers: the first part
+ * of the dictionary is passed as prefix, and the second via dictStart + dictSize.
+ * These routines are used only once, in LZ4_decompress_*_continue().
+ */
+LZ4_FORCE_INLINE
+int LZ4_decompress_safe_doubleDict(const char* source, char* dest, int compressedSize, int maxOutputSize,
+                                   size_t prefixSize, const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  endOnInputSize, decode_full_block, usingExtDict,
+                                  (BYTE*)dest-prefixSize, (const BYTE*)dictStart, dictSize);
+}
+
+LZ4_FORCE_INLINE
+int LZ4_decompress_fast_doubleDict(const char* source, char* dest, int originalSize,
+                                   size_t prefixSize, const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, 0, originalSize,
+                                  endOnOutputSize, decode_full_block, usingExtDict,
+                                  (BYTE*)dest-prefixSize, (const BYTE*)dictStart, dictSize);
+}
+
 /*===== streaming decompression functions =====*/
 
 LZ4_streamDecode_t* LZ4_createStreamDecode(void)
 {
-    LZ4_streamDecode_t* lz4s = (LZ4_streamDecode_t*) ALLOC_AND_ZERO(sizeof(LZ4_streamDecode_t)); 
-    LZ4_STATIC_ASSERT(LZ4_STREAMDECODESIZE >= sizeof(LZ4_streamDecode_t_internal));    /* A compilation error here means LZ4_STREAMDECODESIZE is not large enough */ 
+    LZ4_streamDecode_t* lz4s = (LZ4_streamDecode_t*) ALLOC_AND_ZERO(sizeof(LZ4_streamDecode_t));
+    LZ4_STATIC_ASSERT(LZ4_STREAMDECODESIZE >= sizeof(LZ4_streamDecode_t_internal));    /* A compilation error here means LZ4_STREAMDECODESIZE is not large enough */
     return lz4s;
 }
 
@@ -2281,11 +2281,11 @@ int LZ4_freeStreamDecode (LZ4_streamDecode_t* LZ4_stream)
     return 0;
 }
 
-/*! LZ4_setStreamDecode() : 
- *  Use this function to instruct where to find the dictionary. 
- *  This function is not necessary if previous data is still available where it was decoded. 
- *  Loading a size of 0 is allowed (same effect as no dictionary). 
- * @return : 1 if OK, 0 if error 
+/*! LZ4_setStreamDecode() :
+ *  Use this function to instruct where to find the dictionary.
+ *  This function is not necessary if previous data is still available where it was decoded.
+ *  Loading a size of 0 is allowed (same effect as no dictionary).
+ * @return : 1 if OK, 0 if error
  */
 int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dictionary, int dictSize)
 {
@@ -2297,25 +2297,25 @@ int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dicti
     return 1;
 }
 
-/*! LZ4_decoderRingBufferSize() : 
- *  when setting a ring buffer for streaming decompression (optional scenario), 
- *  provides the minimum size of this ring buffer 
- *  to be compatible with any source respecting maxBlockSize condition. 
- *  Note : in a ring buffer scenario, 
- *  blocks are presumed decompressed next to each other. 
- *  When not enough space remains for next block (remainingSize < maxBlockSize), 
- *  decoding resumes from beginning of ring buffer. 
- * @return : minimum ring buffer size, 
- *           or 0 if there is an error (invalid maxBlockSize). 
- */ 
-int LZ4_decoderRingBufferSize(int maxBlockSize) 
-{ 
-    if (maxBlockSize < 0) return 0; 
-    if (maxBlockSize > LZ4_MAX_INPUT_SIZE) return 0; 
-    if (maxBlockSize < 16) maxBlockSize = 16; 
-    return LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize); 
-} 
- 
+/*! LZ4_decoderRingBufferSize() :
+ *  when setting a ring buffer for streaming decompression (optional scenario),
+ *  provides the minimum size of this ring buffer
+ *  to be compatible with any source respecting maxBlockSize condition.
+ *  Note : in a ring buffer scenario,
+ *  blocks are presumed decompressed next to each other.
+ *  When not enough space remains for next block (remainingSize < maxBlockSize),
+ *  decoding resumes from beginning of ring buffer.
+ * @return : minimum ring buffer size,
+ *           or 0 if there is an error (invalid maxBlockSize).
+ */
+int LZ4_decoderRingBufferSize(int maxBlockSize)
+{
+    if (maxBlockSize < 0) return 0;
+    if (maxBlockSize > LZ4_MAX_INPUT_SIZE) return 0;
+    if (maxBlockSize < 16) maxBlockSize = 16;
+    return LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize);
+}
+
 /*
 *_continue() :
     These decoding functions allow decompression of multiple blocks in "streaming" mode.
@@ -2329,34 +2329,34 @@ int LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode, const ch
     LZ4_streamDecode_t_internal* lz4sd = &LZ4_streamDecode->internal_donotuse;
     int result;
 
-    if (lz4sd->prefixSize == 0) { 
-        /* The first call, no dictionary yet. */ 
-        assert(lz4sd->extDictSize == 0); 
-        result = LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize); 
+    if (lz4sd->prefixSize == 0) {
+        /* The first call, no dictionary yet. */
+        assert(lz4sd->extDictSize == 0);
+        result = LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize);
         if (result <= 0) return result;
-        lz4sd->prefixSize = (size_t)result; 
-        lz4sd->prefixEnd = (BYTE*)dest + result; 
-    } else if (lz4sd->prefixEnd == (BYTE*)dest) { 
-        /* They're rolling the current segment. */ 
-        if (lz4sd->prefixSize >= 64 KB - 1) 
-            result = LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize); 
-        else if (lz4sd->extDictSize == 0) 
-            result = LZ4_decompress_safe_withSmallPrefix(source, dest, compressedSize, maxOutputSize, 
-                                                         lz4sd->prefixSize); 
-        else 
-            result = LZ4_decompress_safe_doubleDict(source, dest, compressedSize, maxOutputSize, 
-                                                    lz4sd->prefixSize, lz4sd->externalDict, lz4sd->extDictSize); 
-        if (result <= 0) return result; 
-        lz4sd->prefixSize += (size_t)result; 
+        lz4sd->prefixSize = (size_t)result;
+        lz4sd->prefixEnd = (BYTE*)dest + result;
+    } else if (lz4sd->prefixEnd == (BYTE*)dest) {
+        /* They're rolling the current segment. */
+        if (lz4sd->prefixSize >= 64 KB - 1)
+            result = LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize);
+        else if (lz4sd->extDictSize == 0)
+            result = LZ4_decompress_safe_withSmallPrefix(source, dest, compressedSize, maxOutputSize,
+                                                         lz4sd->prefixSize);
+        else
+            result = LZ4_decompress_safe_doubleDict(source, dest, compressedSize, maxOutputSize,
+                                                    lz4sd->prefixSize, lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize += (size_t)result;
         lz4sd->prefixEnd  += result;
     } else {
-        /* The buffer wraps around, or they're switching to another buffer. */ 
+        /* The buffer wraps around, or they're switching to another buffer. */
         lz4sd->extDictSize = lz4sd->prefixSize;
         lz4sd->externalDict = lz4sd->prefixEnd - lz4sd->extDictSize;
-        result = LZ4_decompress_safe_forceExtDict(source, dest, compressedSize, maxOutputSize, 
-                                                  lz4sd->externalDict, lz4sd->extDictSize); 
+        result = LZ4_decompress_safe_forceExtDict(source, dest, compressedSize, maxOutputSize,
+                                                  lz4sd->externalDict, lz4sd->extDictSize);
         if (result <= 0) return result;
-        lz4sd->prefixSize = (size_t)result; 
+        lz4sd->prefixSize = (size_t)result;
         lz4sd->prefixEnd  = (BYTE*)dest + result;
     }
 
@@ -2368,30 +2368,30 @@ int LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode, const ch
 {
     LZ4_streamDecode_t_internal* lz4sd = &LZ4_streamDecode->internal_donotuse;
     int result;
-    assert(originalSize >= 0); 
+    assert(originalSize >= 0);
 
-    if (lz4sd->prefixSize == 0) { 
-        assert(lz4sd->extDictSize == 0); 
-        result = LZ4_decompress_fast(source, dest, originalSize); 
+    if (lz4sd->prefixSize == 0) {
+        assert(lz4sd->extDictSize == 0);
+        result = LZ4_decompress_fast(source, dest, originalSize);
         if (result <= 0) return result;
-        lz4sd->prefixSize = (size_t)originalSize; 
-        lz4sd->prefixEnd = (BYTE*)dest + originalSize; 
-    } else if (lz4sd->prefixEnd == (BYTE*)dest) { 
-        if (lz4sd->prefixSize >= 64 KB - 1 || lz4sd->extDictSize == 0) 
-            result = LZ4_decompress_fast(source, dest, originalSize); 
-        else 
-            result = LZ4_decompress_fast_doubleDict(source, dest, originalSize, 
-                                                    lz4sd->prefixSize, lz4sd->externalDict, lz4sd->extDictSize); 
-        if (result <= 0) return result; 
-        lz4sd->prefixSize += (size_t)originalSize; 
+        lz4sd->prefixSize = (size_t)originalSize;
+        lz4sd->prefixEnd = (BYTE*)dest + originalSize;
+    } else if (lz4sd->prefixEnd == (BYTE*)dest) {
+        if (lz4sd->prefixSize >= 64 KB - 1 || lz4sd->extDictSize == 0)
+            result = LZ4_decompress_fast(source, dest, originalSize);
+        else
+            result = LZ4_decompress_fast_doubleDict(source, dest, originalSize,
+                                                    lz4sd->prefixSize, lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize += (size_t)originalSize;
         lz4sd->prefixEnd  += originalSize;
     } else {
         lz4sd->extDictSize = lz4sd->prefixSize;
         lz4sd->externalDict = lz4sd->prefixEnd - lz4sd->extDictSize;
-        result = LZ4_decompress_fast_extDict(source, dest, originalSize, 
-                                             lz4sd->externalDict, lz4sd->extDictSize); 
+        result = LZ4_decompress_fast_extDict(source, dest, originalSize,
+                                             lz4sd->externalDict, lz4sd->extDictSize);
         if (result <= 0) return result;
-        lz4sd->prefixSize = (size_t)originalSize; 
+        lz4sd->prefixSize = (size_t)originalSize;
         lz4sd->prefixEnd  = (BYTE*)dest + originalSize;
     }
 
@@ -2406,13 +2406,13 @@ Advanced decoding functions :
     the dictionary must be explicitly provided within parameters
 */
 
-int LZ4_decompress_safe_usingDict(const char* source, char* dest, int compressedSize, int maxOutputSize, const char* dictStart, int dictSize) 
+int LZ4_decompress_safe_usingDict(const char* source, char* dest, int compressedSize, int maxOutputSize, const char* dictStart, int dictSize)
 {
     if (dictSize==0)
-        return LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize); 
+        return LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize);
     if (dictStart+dictSize == dest) {
         if (dictSize >= 64 KB - 1) {
-            return LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize); 
+            return LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize);
         }
         assert(dictSize >= 0);
         return LZ4_decompress_safe_withSmallPrefix(source, dest, compressedSize, maxOutputSize, (size_t)dictSize);
@@ -2423,8 +2423,8 @@ int LZ4_decompress_safe_usingDict(const char* source, char* dest, int compressed
 
 int LZ4_decompress_fast_usingDict(const char* source, char* dest, int originalSize, const char* dictStart, int dictSize)
 {
-    if (dictSize==0 || dictStart+dictSize == dest) 
-        return LZ4_decompress_fast(source, dest, originalSize); 
+    if (dictSize==0 || dictStart+dictSize == dest)
+        return LZ4_decompress_fast(source, dest, originalSize);
     assert(dictSize >= 0);
     return LZ4_decompress_fast_extDict(source, dest, originalSize, dictStart, (size_t)dictSize);
 }
@@ -2434,45 +2434,45 @@ int LZ4_decompress_fast_usingDict(const char* source, char* dest, int originalSi
 *  Obsolete Functions
 ***************************************************/
 /* obsolete compression functions */
-int LZ4_compress_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize) 
-{ 
-    return LZ4_compress_default(source, dest, inputSize, maxOutputSize); 
-} 
+int LZ4_compress_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize)
+{
+    return LZ4_compress_default(source, dest, inputSize, maxOutputSize);
+}
 int LZ4_compress(const char* src, char* dest, int srcSize)
-{ 
+{
     return LZ4_compress_default(src, dest, srcSize, LZ4_compressBound(srcSize));
-} 
-int LZ4_compress_limitedOutput_withState (void* state, const char* src, char* dst, int srcSize, int dstSize) 
-{ 
-    return LZ4_compress_fast_extState(state, src, dst, srcSize, dstSize, 1); 
-} 
-int LZ4_compress_withState (void* state, const char* src, char* dst, int srcSize) 
-{ 
-    return LZ4_compress_fast_extState(state, src, dst, srcSize, LZ4_compressBound(srcSize), 1); 
-} 
-int LZ4_compress_limitedOutput_continue (LZ4_stream_t* LZ4_stream, const char* src, char* dst, int srcSize, int dstCapacity) 
-{ 
-    return LZ4_compress_fast_continue(LZ4_stream, src, dst, srcSize, dstCapacity, 1); 
-} 
-int LZ4_compress_continue (LZ4_stream_t* LZ4_stream, const char* source, char* dest, int inputSize) 
-{ 
-    return LZ4_compress_fast_continue(LZ4_stream, source, dest, inputSize, LZ4_compressBound(inputSize), 1); 
-} 
+}
+int LZ4_compress_limitedOutput_withState (void* state, const char* src, char* dst, int srcSize, int dstSize)
+{
+    return LZ4_compress_fast_extState(state, src, dst, srcSize, dstSize, 1);
+}
+int LZ4_compress_withState (void* state, const char* src, char* dst, int srcSize)
+{
+    return LZ4_compress_fast_extState(state, src, dst, srcSize, LZ4_compressBound(srcSize), 1);
+}
+int LZ4_compress_limitedOutput_continue (LZ4_stream_t* LZ4_stream, const char* src, char* dst, int srcSize, int dstCapacity)
+{
+    return LZ4_compress_fast_continue(LZ4_stream, src, dst, srcSize, dstCapacity, 1);
+}
+int LZ4_compress_continue (LZ4_stream_t* LZ4_stream, const char* source, char* dest, int inputSize)
+{
+    return LZ4_compress_fast_continue(LZ4_stream, source, dest, inputSize, LZ4_compressBound(inputSize), 1);
+}
 
 /*
-These decompression functions are deprecated and should no longer be used. 
+These decompression functions are deprecated and should no longer be used.
 They are only provided here for compatibility with older user programs.
 - LZ4_uncompress is totally equivalent to LZ4_decompress_fast
 - LZ4_uncompress_unknownOutputSize is totally equivalent to LZ4_decompress_safe
 */
-int LZ4_uncompress (const char* source, char* dest, int outputSize) 
-{ 
-    return LZ4_decompress_fast(source, dest, outputSize); 
-} 
-int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize) 
-{ 
-    return LZ4_decompress_safe(source, dest, isize, maxOutputSize); 
-} 
+int LZ4_uncompress (const char* source, char* dest, int outputSize)
+{
+    return LZ4_decompress_fast(source, dest, outputSize);
+}
+int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize)
+{
+    return LZ4_decompress_safe(source, dest, isize, maxOutputSize);
+}
 
 /* Obsolete Streaming functions */
 
@@ -2480,21 +2480,21 @@ int LZ4_sizeofStreamState(void) { return LZ4_STREAMSIZE; }
 
 int LZ4_resetStreamState(void* state, char* inputBuffer)
 {
-    (void)inputBuffer; 
-    LZ4_resetStream((LZ4_stream_t*)state); 
+    (void)inputBuffer;
+    LZ4_resetStream((LZ4_stream_t*)state);
     return 0;
 }
 
 void* LZ4_create (char* inputBuffer)
 {
-    (void)inputBuffer; 
-    return LZ4_createStream(); 
+    (void)inputBuffer;
+    return LZ4_createStream();
 }
 
-char* LZ4_slideInputBuffer (void* state) 
+char* LZ4_slideInputBuffer (void* state)
 {
-    /* avoid const char * -> char * conversion warning */ 
-    return (char *)(uptrval)((LZ4_stream_t*)state)->internal_donotuse.dictionary; 
+    /* avoid const char * -> char * conversion warning */
+    return (char *)(uptrval)((LZ4_stream_t*)state)->internal_donotuse.dictionary;
 }
 
 #endif   /* ONLY_COMPRESS */
diff --git a/contrib/libs/lz4/lz4.h b/contrib/libs/lz4/lz4.h
index a451af0700..66b8547bbc 100644
--- a/contrib/libs/lz4/lz4.h
+++ b/contrib/libs/lz4/lz4.h
@@ -1,7 +1,7 @@
 /*
  *  LZ4 - Fast LZ compression algorithm
  *  Header File
- *  Copyright (C) 2011-present, Yann Collet. 
+ *  Copyright (C) 2011-present, Yann Collet.
 
    BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
 
@@ -33,9 +33,9 @@
     - LZ4 source repository : https://github.com/lz4/lz4
 */
 #if defined (__cplusplus) && !defined(LZ4_NAMESPACE)
-extern "C" { 
-#endif 
- 
+extern "C" {
+#endif
+
 #ifndef LZ4_H_2983827168210
 #define LZ4_H_2983827168210
 
@@ -51,25 +51,25 @@ extern "C" {
   multiple GB/s per core, typically reaching RAM speed limits on multi-core systems.
 
   The LZ4 compression library provides in-memory compression and decompression functions.
-  It gives full buffer control to user. 
+  It gives full buffer control to user.
   Compression can be done in:
     - a single step (described as Simple Functions)
     - a single step, reusing a context (described in Advanced Functions)
     - unbounded multiple steps (described as Streaming compression)
 
-  lz4.h generates and decodes LZ4-compressed blocks (doc/lz4_Block_format.md). 
+  lz4.h generates and decodes LZ4-compressed blocks (doc/lz4_Block_format.md).
   Decompressing such a compressed block requires additional metadata.
   Exact metadata depends on exact decompression function.
   For the typical case of LZ4_decompress_safe(),
   metadata includes block's compressed size, and maximum bound of decompressed size.
-  Each application is free to encode and pass such metadata in whichever way it wants. 
+  Each application is free to encode and pass such metadata in whichever way it wants.
+
+  lz4.h only handle blocks, it can not generate Frames.
 
-  lz4.h only handle blocks, it can not generate Frames. 
- 
-  Blocks are different from Frames (doc/lz4_Frame_format.md). 
-  Frames bundle both blocks and metadata in a specified manner. 
+  Blocks are different from Frames (doc/lz4_Frame_format.md).
+  Frames bundle both blocks and metadata in a specified manner.
   Embedding metadata is required for compressed data to be self-contained and portable.
-  Frame format is delivered through a companion API, declared in lz4frame.h. 
+  Frame format is delivered through a companion API, declared in lz4frame.h.
   The `lz4` CLI can only manage frames.
 */
 
@@ -79,27 +79,27 @@ extern "C" {
 /*
 *  LZ4_DLL_EXPORT :
 *  Enable exporting of functions when building a Windows DLL
-*  LZ4LIB_VISIBILITY : 
-*  Control library symbols visibility. 
+*  LZ4LIB_VISIBILITY :
+*  Control library symbols visibility.
 */
-#ifndef LZ4LIB_VISIBILITY 
-#  if defined(__GNUC__) && (__GNUC__ >= 4) 
-#    define LZ4LIB_VISIBILITY __attribute__ ((visibility ("default"))) 
-#  else 
-#    define LZ4LIB_VISIBILITY 
-#  endif 
-#endif 
+#ifndef LZ4LIB_VISIBILITY
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define LZ4LIB_VISIBILITY __attribute__ ((visibility ("default")))
+#  else
+#    define LZ4LIB_VISIBILITY
+#  endif
+#endif
 #if defined(LZ4_DLL_EXPORT) && (LZ4_DLL_EXPORT==1)
-#  define LZ4LIB_API __declspec(dllexport) LZ4LIB_VISIBILITY 
+#  define LZ4LIB_API __declspec(dllexport) LZ4LIB_VISIBILITY
 #elif defined(LZ4_DLL_IMPORT) && (LZ4_DLL_IMPORT==1)
-#  define LZ4LIB_API __declspec(dllimport) LZ4LIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/ 
+#  define LZ4LIB_API __declspec(dllimport) LZ4LIB_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 LZ4LIB_API LZ4LIB_VISIBILITY 
+#  define LZ4LIB_API LZ4LIB_VISIBILITY
 #endif
 
-/*------   Version   ------*/ 
+/*------   Version   ------*/
 #define LZ4_VERSION_MAJOR    1    /* for breaking interface changes  */
-#define LZ4_VERSION_MINOR    9    /* for new (non-breaking) interface capabilities */ 
+#define LZ4_VERSION_MINOR    9    /* for new (non-breaking) interface capabilities */
 #define LZ4_VERSION_RELEASE  3    /* for tweaks, bug-fixes, or development */
 
 #define LZ4_VERSION_NUMBER (LZ4_VERSION_MAJOR *100*100 + LZ4_VERSION_MINOR *100 + LZ4_VERSION_RELEASE)
@@ -109,8 +109,8 @@ extern "C" {
 #define LZ4_EXPAND_AND_QUOTE(str) LZ4_QUOTE(str)
 #define LZ4_VERSION_STRING LZ4_EXPAND_AND_QUOTE(LZ4_LIB_VERSION)
 
-LZ4LIB_API int LZ4_versionNumber (void);  /**< library version number; useful to check dll version */ 
-LZ4LIB_API const char* LZ4_versionString (void);   /**< library version string; useful to check dll version */ 
+LZ4LIB_API int LZ4_versionNumber (void);  /**< library version number; useful to check dll version */
+LZ4LIB_API const char* LZ4_versionString (void);   /**< library version string; useful to check dll version */
 
 
 /*-************************************
@@ -119,12 +119,12 @@ LZ4LIB_API const char* LZ4_versionString (void);   /**< library version string;
 /*!
  * LZ4_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 may improve speed, thanks to better cache locality. 
+ * Increasing memory usage improves compression ratio.
+ * Reduced memory usage may improve speed, thanks to better cache locality.
  * Default value is 14, for 16KB, which nicely fits into Intel x86 L1 cache
  */
-#ifndef LZ4_MEMORY_USAGE 
-# define LZ4_MEMORY_USAGE 14 
+#ifndef LZ4_MEMORY_USAGE
+# define LZ4_MEMORY_USAGE 14
 #endif
 
 
@@ -145,7 +145,7 @@ LZ4LIB_API const char* LZ4_versionString (void);   /**< library version string;
  *                or 0 if compression fails
  * Note : This function is protected against buffer overflow scenarios (never writes outside 'dst' buffer, nor read outside 'source' buffer).
  */
-LZ4LIB_API int LZ4_compress_default(const char* src, char* dst, int srcSize, int dstCapacity); 
+LZ4LIB_API int LZ4_compress_default(const char* src, char* dst, int srcSize, int dstCapacity);
 
 /*! LZ4_decompress_safe() :
  *  compressedSize : is the exact complete size of the compressed block.
@@ -161,7 +161,7 @@ LZ4LIB_API int LZ4_compress_default(const char* src, char* dst, int srcSize, int
  *          The implementation is free to send / store / derive this information in whichever way is most beneficial.
  *          If there is a need for a different format which bundles together both compressed data and its metadata, consider looking at lz4frame.h instead.
  */
-LZ4LIB_API int LZ4_decompress_safe (const char* src, char* dst, int compressedSize, int dstCapacity); 
+LZ4LIB_API int LZ4_decompress_safe (const char* src, char* dst, int compressedSize, int dstCapacity);
 
 
 /*-************************************
@@ -170,49 +170,49 @@ LZ4LIB_API int LZ4_decompress_safe (const char* src, char* dst, int compressedSi
 #define LZ4_MAX_INPUT_SIZE        0x7E000000   /* 2 113 929 216 bytes */
 #define LZ4_COMPRESSBOUND(isize)  ((unsigned)(isize) > (unsigned)LZ4_MAX_INPUT_SIZE ? 0 : (isize) + ((isize)/255) + 16)
 
-/*! LZ4_compressBound() : 
+/*! LZ4_compressBound() :
     Provides the maximum size that LZ4 compression may output in a "worst case" scenario (input data not compressible)
     This function is primarily useful for memory allocation purposes (destination buffer size).
     Macro LZ4_COMPRESSBOUND() is also provided for compilation-time evaluation (stack memory allocation for example).
-    Note that LZ4_compress_default() compresses faster when dstCapacity is >= LZ4_compressBound(srcSize) 
+    Note that LZ4_compress_default() compresses faster when dstCapacity is >= LZ4_compressBound(srcSize)
         inputSize  : max supported value is LZ4_MAX_INPUT_SIZE
         return : maximum output size in a "worst case" scenario
-              or 0, if input size is incorrect (too large or negative) 
+              or 0, if input size is incorrect (too large or negative)
 */
 LZ4LIB_API int LZ4_compressBound(int inputSize);
 
-/*! LZ4_compress_fast() : 
-    Same as LZ4_compress_default(), but allows selection of "acceleration" factor. 
+/*! LZ4_compress_fast() :
+    Same as LZ4_compress_default(), but allows selection of "acceleration" factor.
     The larger the acceleration value, the faster the algorithm, but also the lesser the compression.
     It's a trade-off. It can be fine tuned, with each successive value providing roughly +~3% to speed.
     An acceleration value of "1" is the same as regular LZ4_compress_default()
     Values <= 0 will be replaced by LZ4_ACCELERATION_DEFAULT (currently == 1, see lz4.c).
     Values > LZ4_ACCELERATION_MAX will be replaced by LZ4_ACCELERATION_MAX (currently == 65537, see lz4.c).
 */
-LZ4LIB_API int LZ4_compress_fast (const char* src, char* dst, int srcSize, int dstCapacity, int acceleration); 
+LZ4LIB_API int LZ4_compress_fast (const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
 
 
-/*! LZ4_compress_fast_extState() : 
- *  Same as LZ4_compress_fast(), using an externally allocated memory space for its state. 
- *  Use LZ4_sizeofState() to know how much memory must be allocated, 
- *  and allocate it on 8-bytes boundaries (using `malloc()` typically). 
- *  Then, provide this buffer as `void* state` to compression function. 
- */ 
+/*! LZ4_compress_fast_extState() :
+ *  Same as LZ4_compress_fast(), using an externally allocated memory space for its state.
+ *  Use LZ4_sizeofState() to know how much memory must be allocated,
+ *  and allocate it on 8-bytes boundaries (using `malloc()` typically).
+ *  Then, provide this buffer as `void* state` to compression function.
+ */
 LZ4LIB_API int LZ4_sizeofState(void);
-LZ4LIB_API int LZ4_compress_fast_extState (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration); 
+LZ4LIB_API int LZ4_compress_fast_extState (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
 
 
-/*! LZ4_compress_destSize() : 
- *  Reverse the logic : compresses as much data as possible from 'src' buffer 
- *  into already allocated buffer 'dst', of size >= 'targetDestSize'. 
- *  This function either compresses the entire 'src' content into 'dst' if it's large enough, 
- *  or fill 'dst' buffer completely with as much data as possible from 'src'. 
- *  note: acceleration parameter is fixed to "default". 
- * 
- * *srcSizePtr : will be modified to indicate how many bytes where read from 'src' to fill 'dst'. 
- *               New value is necessarily <= input value. 
- * @return : Nb bytes written into 'dst' (necessarily <= targetDestSize) 
- *           or 0 if compression fails. 
+/*! LZ4_compress_destSize() :
+ *  Reverse the logic : compresses as much data as possible from 'src' buffer
+ *  into already allocated buffer 'dst', of size >= 'targetDestSize'.
+ *  This function either compresses the entire 'src' content into 'dst' if it's large enough,
+ *  or fill 'dst' buffer completely with as much data as possible from 'src'.
+ *  note: acceleration parameter is fixed to "default".
+ *
+ * *srcSizePtr : will be modified to indicate how many bytes where read from 'src' to fill 'dst'.
+ *               New value is necessarily <= input value.
+ * @return : Nb bytes written into 'dst' (necessarily <= targetDestSize)
+ *           or 0 if compression fails.
  *
  * Note : from v1.8.2 to v1.9.1, this function had a bug (fixed un v1.9.2+):
  *        the produced compressed content could, in specific circumstances,
@@ -225,31 +225,31 @@ LZ4LIB_API int LZ4_compress_fast_extState (void* state, const char* src, char* d
  *        a dstCapacity which is > decompressedSize, by at least 1 byte.
  *        See https://github.com/lz4/lz4/issues/859 for details
  */
-LZ4LIB_API int LZ4_compress_destSize (const char* src, char* dst, int* srcSizePtr, int targetDstSize); 
+LZ4LIB_API int LZ4_compress_destSize (const char* src, char* dst, int* srcSizePtr, int targetDstSize);
 
 
-/*! LZ4_decompress_safe_partial() : 
- *  Decompress an LZ4 compressed block, of size 'srcSize' at position 'src', 
- *  into destination buffer 'dst' of size 'dstCapacity'. 
- *  Up to 'targetOutputSize' bytes will be decoded. 
+/*! LZ4_decompress_safe_partial() :
+ *  Decompress an LZ4 compressed block, of size 'srcSize' at position 'src',
+ *  into destination buffer 'dst' of size 'dstCapacity'.
+ *  Up to 'targetOutputSize' bytes will be decoded.
  *  The function stops decoding on reaching this objective.
  *  This can be useful to boost performance
  *  whenever only the beginning of a block is required.
- * 
+ *
  * @return : the number of bytes decoded in `dst` (necessarily <= targetOutputSize)
- *           If source stream is detected malformed, function returns a negative result. 
- * 
+ *           If source stream is detected malformed, function returns a negative result.
+ *
  *  Note 1 : @return can be < targetOutputSize, if compressed block contains less data.
- * 
+ *
  *  Note 2 : targetOutputSize must be <= dstCapacity
  *
  *  Note 3 : this function effectively stops decoding on reaching targetOutputSize,
- *           so dstCapacity is kind of redundant. 
+ *           so dstCapacity is kind of redundant.
  *           This is because in older versions of this function,
  *           decoding operation would still write complete sequences.
  *           Therefore, there was no guarantee that it would stop writing at exactly targetOutputSize,
- *           it could write more bytes, though only up to dstCapacity. 
- *           Some "margin" used to be required for this operation to work properly. 
+ *           it could write more bytes, though only up to dstCapacity.
+ *           Some "margin" used to be required for this operation to work properly.
  *           Thankfully, this is no longer necessary.
  *           The function nonetheless keeps the same signature, in an effort to preserve API compatibility.
  *
@@ -261,243 +261,243 @@ LZ4LIB_API int LZ4_compress_destSize (const char* src, char* dst, int* srcSizePt
  *  Note 5 : If srcSize is _larger_ than block's compressed size,
  *           then targetOutputSize **MUST** be <= block's decompressed size.
  *           Otherwise, *silent corruption will occur*.
- */ 
-LZ4LIB_API int LZ4_decompress_safe_partial (const char* src, char* dst, int srcSize, int targetOutputSize, int dstCapacity); 
+ */
+LZ4LIB_API int LZ4_decompress_safe_partial (const char* src, char* dst, int srcSize, int targetOutputSize, int dstCapacity);
 
 
 /*-*********************************************
 *  Streaming Compression Functions
 ***********************************************/
-typedef union LZ4_stream_u LZ4_stream_t;  /* incomplete type (defined later) */ 
+typedef union LZ4_stream_u LZ4_stream_t;  /* incomplete type (defined later) */
 
 LZ4LIB_API LZ4_stream_t* LZ4_createStream(void);
 LZ4LIB_API int           LZ4_freeStream (LZ4_stream_t* streamPtr);
 
-/*! LZ4_resetStream_fast() : v1.9.0+ 
- *  Use this to prepare an LZ4_stream_t for a new chain of dependent blocks 
- *  (e.g., LZ4_compress_fast_continue()). 
- * 
- *  An LZ4_stream_t must be initialized once before usage. 
- *  This is automatically done when created by LZ4_createStream(). 
- *  However, should the LZ4_stream_t be simply declared on stack (for example), 
- *  it's necessary to initialize it first, using LZ4_initStream(). 
- * 
- *  After init, start any new stream with LZ4_resetStream_fast(). 
- *  A same LZ4_stream_t can be re-used multiple times consecutively 
- *  and compress multiple streams, 
- *  provided that it starts each new stream with LZ4_resetStream_fast(). 
- * 
- *  LZ4_resetStream_fast() is much faster than LZ4_initStream(), 
- *  but is not compatible with memory regions containing garbage data. 
- * 
- *  Note: it's only useful to call LZ4_resetStream_fast() 
- *        in the context of streaming compression. 
- *        The *extState* functions perform their own resets. 
- *        Invoking LZ4_resetStream_fast() before is redundant, and even counterproductive. 
+/*! LZ4_resetStream_fast() : v1.9.0+
+ *  Use this to prepare an LZ4_stream_t for a new chain of dependent blocks
+ *  (e.g., LZ4_compress_fast_continue()).
+ *
+ *  An LZ4_stream_t must be initialized once before usage.
+ *  This is automatically done when created by LZ4_createStream().
+ *  However, should the LZ4_stream_t be simply declared on stack (for example),
+ *  it's necessary to initialize it first, using LZ4_initStream().
+ *
+ *  After init, start any new stream with LZ4_resetStream_fast().
+ *  A same LZ4_stream_t can be re-used multiple times consecutively
+ *  and compress multiple streams,
+ *  provided that it starts each new stream with LZ4_resetStream_fast().
+ *
+ *  LZ4_resetStream_fast() is much faster than LZ4_initStream(),
+ *  but is not compatible with memory regions containing garbage data.
+ *
+ *  Note: it's only useful to call LZ4_resetStream_fast()
+ *        in the context of streaming compression.
+ *        The *extState* functions perform their own resets.
+ *        Invoking LZ4_resetStream_fast() before is redundant, and even counterproductive.
  */
-LZ4LIB_API void LZ4_resetStream_fast (LZ4_stream_t* streamPtr); 
+LZ4LIB_API void LZ4_resetStream_fast (LZ4_stream_t* streamPtr);
 
 /*! LZ4_loadDict() :
- *  Use this function to reference a static dictionary into LZ4_stream_t. 
- *  The dictionary must remain available during compression. 
- *  LZ4_loadDict() triggers a reset, so any previous data will be forgotten. 
- *  The same dictionary will have to be loaded on decompression side for successful decoding. 
- *  Dictionary are useful for better compression of small data (KB range). 
- *  While LZ4 accept any input as dictionary, 
- *  results are generally better when using Zstandard's Dictionary Builder. 
- *  Loading a size of 0 is allowed, and is the same as reset. 
- * @return : loaded dictionary size, in bytes (necessarily <= 64 KB) 
+ *  Use this function to reference a static dictionary into LZ4_stream_t.
+ *  The dictionary must remain available during compression.
+ *  LZ4_loadDict() triggers a reset, so any previous data will be forgotten.
+ *  The same dictionary will have to be loaded on decompression side for successful decoding.
+ *  Dictionary are useful for better compression of small data (KB range).
+ *  While LZ4 accept any input as dictionary,
+ *  results are generally better when using Zstandard's Dictionary Builder.
+ *  Loading a size of 0 is allowed, and is the same as reset.
+ * @return : loaded dictionary size, in bytes (necessarily <= 64 KB)
  */
 LZ4LIB_API int LZ4_loadDict (LZ4_stream_t* streamPtr, const char* dictionary, int dictSize);
 
 /*! LZ4_compress_fast_continue() :
- *  Compress 'src' content using data from previously compressed blocks, for better compression ratio. 
- * 'dst' buffer must be already allocated. 
- *  If dstCapacity >= LZ4_compressBound(srcSize), compression is guaranteed to succeed, and runs faster. 
- * 
- * @return : size of compressed block 
- *           or 0 if there is an error (typically, cannot fit into 'dst'). 
- * 
- *  Note 1 : Each invocation to LZ4_compress_fast_continue() generates a new block. 
- *           Each block has precise boundaries. 
- *           Each block must be decompressed separately, calling LZ4_decompress_*() with relevant metadata. 
- *           It's not possible to append blocks together and expect a single invocation of LZ4_decompress_*() to decompress them together. 
- * 
- *  Note 2 : The previous 64KB of source data is __assumed__ to remain present, unmodified, at same address in memory ! 
- * 
- *  Note 3 : When input is structured as a double-buffer, each buffer can have any size, including < 64 KB. 
- *           Make sure that buffers are separated, by at least one byte. 
- *           This construction ensures that each block only depends on previous block. 
- * 
- *  Note 4 : If input buffer is a ring-buffer, it can have any size, including < 64 KB. 
- * 
- *  Note 5 : After an error, the stream status is undefined (invalid), it can only be reset or freed. 
+ *  Compress 'src' content using data from previously compressed blocks, for better compression ratio.
+ * 'dst' buffer must be already allocated.
+ *  If dstCapacity >= LZ4_compressBound(srcSize), compression is guaranteed to succeed, and runs faster.
+ *
+ * @return : size of compressed block
+ *           or 0 if there is an error (typically, cannot fit into 'dst').
+ *
+ *  Note 1 : Each invocation to LZ4_compress_fast_continue() generates a new block.
+ *           Each block has precise boundaries.
+ *           Each block must be decompressed separately, calling LZ4_decompress_*() with relevant metadata.
+ *           It's not possible to append blocks together and expect a single invocation of LZ4_decompress_*() to decompress them together.
+ *
+ *  Note 2 : The previous 64KB of source data is __assumed__ to remain present, unmodified, at same address in memory !
+ *
+ *  Note 3 : When input is structured as a double-buffer, each buffer can have any size, including < 64 KB.
+ *           Make sure that buffers are separated, by at least one byte.
+ *           This construction ensures that each block only depends on previous block.
+ *
+ *  Note 4 : If input buffer is a ring-buffer, it can have any size, including < 64 KB.
+ *
+ *  Note 5 : After an error, the stream status is undefined (invalid), it can only be reset or freed.
  */
-LZ4LIB_API int LZ4_compress_fast_continue (LZ4_stream_t* streamPtr, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration); 
+LZ4LIB_API int LZ4_compress_fast_continue (LZ4_stream_t* streamPtr, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
 
 /*! LZ4_saveDict() :
- *  If last 64KB data cannot be guaranteed to remain available at its current memory location, 
+ *  If last 64KB data cannot be guaranteed to remain available at its current memory location,
  *  save it into a safer place (char* safeBuffer).
- *  This is schematically equivalent to a memcpy() followed by LZ4_loadDict(), 
- *  but is much faster, because LZ4_saveDict() doesn't need to rebuild tables. 
- * @return : saved dictionary size in bytes (necessarily <= maxDictSize), or 0 if error. 
+ *  This is schematically equivalent to a memcpy() followed by LZ4_loadDict(),
+ *  but is much faster, because LZ4_saveDict() doesn't need to rebuild tables.
+ * @return : saved dictionary size in bytes (necessarily <= maxDictSize), or 0 if error.
  */
-LZ4LIB_API int LZ4_saveDict (LZ4_stream_t* streamPtr, char* safeBuffer, int maxDictSize); 
+LZ4LIB_API int LZ4_saveDict (LZ4_stream_t* streamPtr, char* safeBuffer, int maxDictSize);
 
 
 /*-**********************************************
 *  Streaming Decompression Functions
 *  Bufferless synchronous API
 ************************************************/
-typedef union LZ4_streamDecode_u LZ4_streamDecode_t;   /* tracking context */ 
+typedef union LZ4_streamDecode_u LZ4_streamDecode_t;   /* tracking context */
 
-/*! LZ4_createStreamDecode() and LZ4_freeStreamDecode() : 
- *  creation / destruction of streaming decompression tracking context. 
- *  A tracking context can be re-used multiple times. 
- */ 
+/*! LZ4_createStreamDecode() and LZ4_freeStreamDecode() :
+ *  creation / destruction of streaming decompression tracking context.
+ *  A tracking context can be re-used multiple times.
+ */
 LZ4LIB_API LZ4_streamDecode_t* LZ4_createStreamDecode(void);
 LZ4LIB_API int                 LZ4_freeStreamDecode (LZ4_streamDecode_t* LZ4_stream);
 
 /*! LZ4_setStreamDecode() :
- *  An LZ4_streamDecode_t context can be allocated once and re-used multiple times. 
- *  Use this function to start decompression of a new stream of blocks. 
- *  A dictionary can optionally be set. Use NULL or size 0 for a reset order. 
- *  Dictionary is presumed stable : it must remain accessible and unmodified during next decompression. 
- * @return : 1 if OK, 0 if error 
+ *  An LZ4_streamDecode_t context can be allocated once and re-used multiple times.
+ *  Use this function to start decompression of a new stream of blocks.
+ *  A dictionary can optionally be set. Use NULL or size 0 for a reset order.
+ *  Dictionary is presumed stable : it must remain accessible and unmodified during next decompression.
+ * @return : 1 if OK, 0 if error
  */
 LZ4LIB_API int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dictionary, int dictSize);
 
-/*! LZ4_decoderRingBufferSize() : v1.8.2+ 
- *  Note : in a ring buffer scenario (optional), 
- *  blocks are presumed decompressed next to each other 
- *  up to the moment there is not enough remaining space for next block (remainingSize < maxBlockSize), 
- *  at which stage it resumes from beginning of ring buffer. 
- *  When setting such a ring buffer for streaming decompression, 
- *  provides the minimum size of this ring buffer 
- *  to be compatible with any source respecting maxBlockSize condition. 
- * @return : minimum ring buffer size, 
- *           or 0 if there is an error (invalid maxBlockSize). 
- */ 
-LZ4LIB_API int LZ4_decoderRingBufferSize(int maxBlockSize); 
-#define LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize) (65536 + 14 + (maxBlockSize))  /* for static allocation; maxBlockSize presumed valid */ 
- 
-/*! LZ4_decompress_*_continue() : 
- *  These decoding functions allow decompression of consecutive blocks in "streaming" mode. 
- *  A block is an unsplittable entity, it must be presented entirely to a decompression function. 
- *  Decompression functions only accepts one block at a time. 
- *  The last 64KB of previously decoded data *must* remain available and unmodified at the memory position where they were decoded. 
- *  If less than 64KB of data has been decoded, all the data must be present. 
- * 
- *  Special : if decompression side sets a ring buffer, it must respect one of the following conditions : 
- *  - Decompression buffer size is _at least_ LZ4_decoderRingBufferSize(maxBlockSize). 
- *    maxBlockSize is the maximum size of any single block. It can have any value > 16 bytes. 
- *    In which case, encoding and decoding buffers do not need to be synchronized. 
- *    Actually, data can be produced by any source compliant with LZ4 format specification, and respecting maxBlockSize. 
- *  - Synchronized mode : 
- *    Decompression buffer size is _exactly_ the same as compression buffer size, 
- *    and follows exactly same update rule (block boundaries at same positions), 
- *    and decoding function is provided with exact decompressed size of each block (exception for last block of the stream), 
- *    _then_ decoding & encoding ring buffer can have any size, including small ones ( < 64 KB). 
- *  - Decompression buffer is larger than encoding buffer, by a minimum of maxBlockSize more bytes. 
- *    In which case, encoding and decoding buffers do not need to be synchronized, 
- *    and encoding ring buffer can have any size, including small ones ( < 64 KB). 
- * 
- *  Whenever these conditions are not possible, 
- *  save the last 64KB of decoded data into a safe buffer where it can't be modified during decompression, 
- *  then indicate where this data is saved using LZ4_setStreamDecode(), before decompressing next block. 
+/*! LZ4_decoderRingBufferSize() : v1.8.2+
+ *  Note : in a ring buffer scenario (optional),
+ *  blocks are presumed decompressed next to each other
+ *  up to the moment there is not enough remaining space for next block (remainingSize < maxBlockSize),
+ *  at which stage it resumes from beginning of ring buffer.
+ *  When setting such a ring buffer for streaming decompression,
+ *  provides the minimum size of this ring buffer
+ *  to be compatible with any source respecting maxBlockSize condition.
+ * @return : minimum ring buffer size,
+ *           or 0 if there is an error (invalid maxBlockSize).
+ */
+LZ4LIB_API int LZ4_decoderRingBufferSize(int maxBlockSize);
+#define LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize) (65536 + 14 + (maxBlockSize))  /* for static allocation; maxBlockSize presumed valid */
+
+/*! LZ4_decompress_*_continue() :
+ *  These decoding functions allow decompression of consecutive blocks in "streaming" mode.
+ *  A block is an unsplittable entity, it must be presented entirely to a decompression function.
+ *  Decompression functions only accepts one block at a time.
+ *  The last 64KB of previously decoded data *must* remain available and unmodified at the memory position where they were decoded.
+ *  If less than 64KB of data has been decoded, all the data must be present.
+ *
+ *  Special : if decompression side sets a ring buffer, it must respect one of the following conditions :
+ *  - Decompression buffer size is _at least_ LZ4_decoderRingBufferSize(maxBlockSize).
+ *    maxBlockSize is the maximum size of any single block. It can have any value > 16 bytes.
+ *    In which case, encoding and decoding buffers do not need to be synchronized.
+ *    Actually, data can be produced by any source compliant with LZ4 format specification, and respecting maxBlockSize.
+ *  - Synchronized mode :
+ *    Decompression buffer size is _exactly_ the same as compression buffer size,
+ *    and follows exactly same update rule (block boundaries at same positions),
+ *    and decoding function is provided with exact decompressed size of each block (exception for last block of the stream),
+ *    _then_ decoding & encoding ring buffer can have any size, including small ones ( < 64 KB).
+ *  - Decompression buffer is larger than encoding buffer, by a minimum of maxBlockSize more bytes.
+ *    In which case, encoding and decoding buffers do not need to be synchronized,
+ *    and encoding ring buffer can have any size, including small ones ( < 64 KB).
+ *
+ *  Whenever these conditions are not possible,
+ *  save the last 64KB of decoded data into a safe buffer where it can't be modified during decompression,
+ *  then indicate where this data is saved using LZ4_setStreamDecode(), before decompressing next block.
 */
-LZ4LIB_API int LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int srcSize, int dstCapacity); 
+LZ4LIB_API int LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int srcSize, int dstCapacity);
 
 
 /*! LZ4_decompress_*_usingDict() :
  *  These decoding functions work the same as
  *  a combination of LZ4_setStreamDecode() followed by LZ4_decompress_*_continue()
  *  They are stand-alone, and don't need an LZ4_streamDecode_t structure.
- *  Dictionary is presumed stable : it must remain accessible and unmodified during decompression. 
- *  Performance tip : Decompression speed can be substantially increased 
- *                    when dst == dictStart + dictSize. 
+ *  Dictionary is presumed stable : it must remain accessible and unmodified during decompression.
+ *  Performance tip : Decompression speed can be substantially increased
+ *                    when dst == dictStart + dictSize.
  */
-LZ4LIB_API int LZ4_decompress_safe_usingDict (const char* src, char* dst, int srcSize, int dstCapcity, const char* dictStart, int dictSize); 
+LZ4LIB_API int LZ4_decompress_safe_usingDict (const char* src, char* dst, int srcSize, int dstCapcity, const char* dictStart, int dictSize);
 
 #endif /* LZ4_H_2983827168210 */
 
 
-/*^************************************* 
+/*^*************************************
  * !!!!!!   STATIC LINKING ONLY   !!!!!!
- ***************************************/ 
- 
-/*-**************************************************************************** 
- * Experimental section 
- * 
- * Symbols declared in this section must be considered unstable. Their 
- * signatures or semantics may change, or they may be removed altogether in the 
- * future. They are therefore only safe to depend on when the caller is 
- * statically linked against the library. 
- * 
- * To protect against unsafe usage, not only are the declarations guarded, 
- * the definitions are hidden by default 
- * when building LZ4 as a shared/dynamic library. 
- * 
- * In order to access these declarations, 
- * define LZ4_STATIC_LINKING_ONLY in your application 
- * before including LZ4's headers. 
- * 
- * In order to make their implementations accessible dynamically, you must 
- * define LZ4_PUBLISH_STATIC_FUNCTIONS when building the LZ4 library. 
- ******************************************************************************/ 
- 
+ ***************************************/
+
+/*-****************************************************************************
+ * Experimental section
+ *
+ * Symbols declared in this section must be considered unstable. Their
+ * signatures or semantics may change, or they may be removed altogether in the
+ * future. They are therefore only safe to depend on when the caller is
+ * statically linked against the library.
+ *
+ * To protect against unsafe usage, not only are the declarations guarded,
+ * the definitions are hidden by default
+ * when building LZ4 as a shared/dynamic library.
+ *
+ * In order to access these declarations,
+ * define LZ4_STATIC_LINKING_ONLY in your application
+ * before including LZ4's headers.
+ *
+ * In order to make their implementations accessible dynamically, you must
+ * define LZ4_PUBLISH_STATIC_FUNCTIONS when building the LZ4 library.
+ ******************************************************************************/
+
 #ifdef LZ4_STATIC_LINKING_ONLY
 
 #ifndef LZ4_STATIC_3504398509
 #define LZ4_STATIC_3504398509
 
-#ifdef LZ4_PUBLISH_STATIC_FUNCTIONS 
-#define LZ4LIB_STATIC_API LZ4LIB_API 
-#else 
-#define LZ4LIB_STATIC_API 
-#endif 
- 
- 
-/*! LZ4_compress_fast_extState_fastReset() : 
- *  A variant of LZ4_compress_fast_extState(). 
- * 
- *  Using this variant avoids an expensive initialization step. 
- *  It is only safe to call if the state buffer is known to be correctly initialized already 
- *  (see above comment on LZ4_resetStream_fast() for a definition of "correctly initialized"). 
- *  From a high level, the difference is that 
- *  this function initializes the provided state with a call to something like LZ4_resetStream_fast() 
- *  while LZ4_compress_fast_extState() starts with a call to LZ4_resetStream(). 
- */ 
-LZ4LIB_STATIC_API int LZ4_compress_fast_extState_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration); 
- 
-/*! LZ4_attach_dictionary() : 
- *  This is an experimental API that allows 
- *  efficient use of a static dictionary many times. 
- * 
- *  Rather than re-loading the dictionary buffer into a working context before 
- *  each compression, or copying a pre-loaded dictionary's LZ4_stream_t into a 
- *  working LZ4_stream_t, this function introduces a no-copy setup mechanism, 
- *  in which the working stream references the dictionary stream in-place. 
- * 
- *  Several assumptions are made about the state of the dictionary stream. 
- *  Currently, only streams which have been prepared by LZ4_loadDict() should 
- *  be expected to work. 
- * 
- *  Alternatively, the provided dictionaryStream may be NULL, 
- *  in which case any existing dictionary stream is unset. 
- * 
- *  If a dictionary is provided, it replaces any pre-existing stream history. 
- *  The dictionary contents are the only history that can be referenced and 
- *  logically immediately precede the data compressed in the first subsequent 
- *  compression call. 
- * 
- *  The dictionary will only remain attached to the working stream through the 
- *  first compression call, at the end of which it is cleared. The dictionary 
- *  stream (and source buffer) must remain in-place / accessible / unchanged 
- *  through the completion of the first compression call on the stream. 
- */ 
-LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dictionaryStream); 
- 
+#ifdef LZ4_PUBLISH_STATIC_FUNCTIONS
+#define LZ4LIB_STATIC_API LZ4LIB_API
+#else
+#define LZ4LIB_STATIC_API
+#endif
+
+
+/*! LZ4_compress_fast_extState_fastReset() :
+ *  A variant of LZ4_compress_fast_extState().
+ *
+ *  Using this variant avoids an expensive initialization step.
+ *  It is only safe to call if the state buffer is known to be correctly initialized already
+ *  (see above comment on LZ4_resetStream_fast() for a definition of "correctly initialized").
+ *  From a high level, the difference is that
+ *  this function initializes the provided state with a call to something like LZ4_resetStream_fast()
+ *  while LZ4_compress_fast_extState() starts with a call to LZ4_resetStream().
+ */
+LZ4LIB_STATIC_API int LZ4_compress_fast_extState_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
+
+/*! LZ4_attach_dictionary() :
+ *  This is an experimental API that allows
+ *  efficient use of a static dictionary many times.
+ *
+ *  Rather than re-loading the dictionary buffer into a working context before
+ *  each compression, or copying a pre-loaded dictionary's LZ4_stream_t into a
+ *  working LZ4_stream_t, this function introduces a no-copy setup mechanism,
+ *  in which the working stream references the dictionary stream in-place.
+ *
+ *  Several assumptions are made about the state of the dictionary stream.
+ *  Currently, only streams which have been prepared by LZ4_loadDict() should
+ *  be expected to work.
+ *
+ *  Alternatively, the provided dictionaryStream may be NULL,
+ *  in which case any existing dictionary stream is unset.
+ *
+ *  If a dictionary is provided, it replaces any pre-existing stream history.
+ *  The dictionary contents are the only history that can be referenced and
+ *  logically immediately precede the data compressed in the first subsequent
+ *  compression call.
+ *
+ *  The dictionary will only remain attached to the working stream through the
+ *  first compression call, at the end of which it is cleared. The dictionary
+ *  stream (and source buffer) must remain in-place / accessible / unchanged
+ *  through the completion of the first compression call on the stream.
+ */
+LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dictionaryStream);
+
 
 /*! In-place compression and decompression
  *
@@ -555,11 +555,11 @@ LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const
 
 #ifndef LZ4_DISTANCE_MAX   /* history window size; can be user-defined at compile time */
 #  define LZ4_DISTANCE_MAX 65535   /* set to maximum value by default */
-#endif 
- 
+#endif
+
 #define LZ4_COMPRESS_INPLACE_MARGIN                           (LZ4_DISTANCE_MAX + 32)   /* LZ4_DISTANCE_MAX can be safely replaced by srcSize when it's smaller */
 #define LZ4_COMPRESS_INPLACE_BUFFER_SIZE(maxCompressedSize)   ((maxCompressedSize) + LZ4_COMPRESS_INPLACE_MARGIN)  /**< maxCompressedSize is generally LZ4_COMPRESSBOUND(inputSize), but can be set to any lower value, with the risk that compression can fail (return code 0(zero)) */
- 
+
 #endif   /* LZ4_STATIC_3504398509 */
 #endif   /* LZ4_STATIC_LINKING_ONLY */
 
@@ -568,13 +568,13 @@ LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const
 #ifndef LZ4_H_98237428734687
 #define LZ4_H_98237428734687
 
-/*-************************************************************ 
+/*-************************************************************
  *  Private Definitions
- ************************************************************** 
- * Do not use these definitions directly. 
- * They are only exposed to allow static allocation of `LZ4_stream_t` and `LZ4_streamDecode_t`. 
+ **************************************************************
+ * Do not use these definitions directly.
+ * They are only exposed to allow static allocation of `LZ4_stream_t` and `LZ4_streamDecode_t`.
  * Accessing members will expose user code to API and/or ABI break in future versions of the library.
- **************************************************************/ 
+ **************************************************************/
 #define LZ4_HASHLOG   (LZ4_MEMORY_USAGE-2)
 #define LZ4_HASHTABLESIZE (1 << LZ4_MEMORY_USAGE)
 #define LZ4_HASH_SIZE_U32 (1 << LZ4_HASHLOG)       /* required as macro for static allocation */
@@ -592,15 +592,15 @@ LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const
   typedef unsigned int   LZ4_u32;
 #endif
 
-typedef struct LZ4_stream_t_internal LZ4_stream_t_internal; 
-struct LZ4_stream_t_internal { 
+typedef struct LZ4_stream_t_internal LZ4_stream_t_internal;
+struct LZ4_stream_t_internal {
     LZ4_u32 hashTable[LZ4_HASH_SIZE_U32];
     LZ4_u32 currentOffset;
     LZ4_u32 tableType;
     const LZ4_byte* dictionary;
-    const LZ4_stream_t_internal* dictCtx; 
+    const LZ4_stream_t_internal* dictCtx;
     LZ4_u32 dictSize;
-}; 
+};
 
 typedef struct {
     const LZ4_byte* externalDict;
@@ -610,14 +610,14 @@ typedef struct {
 } LZ4_streamDecode_t_internal;
 
 
-/*! LZ4_stream_t : 
+/*! LZ4_stream_t :
  *  Do not use below internal definitions directly !
  *  Declare or allocate an LZ4_stream_t instead.
- *  LZ4_stream_t can also be created using LZ4_createStream(), which is recommended. 
- *  The structure definition can be convenient for static allocation 
- *  (on stack, or as part of larger structure). 
- *  Init this structure with LZ4_initStream() before first use. 
- *  note : only use this definition in association with static linking ! 
+ *  LZ4_stream_t can also be created using LZ4_createStream(), which is recommended.
+ *  The structure definition can be convenient for static allocation
+ *  (on stack, or as part of larger structure).
+ *  Init this structure with LZ4_initStream() before first use.
+ *  note : only use this definition in association with static linking !
  *  this definition is not API/ABI safe, and may change in future versions.
  */
 #define LZ4_STREAMSIZE       16416  /* static size, for inter-version compatibility */
@@ -628,31 +628,31 @@ union LZ4_stream_u {
 }; /* previously typedef'd to LZ4_stream_t */
 
 
-/*! LZ4_initStream() : v1.9.0+ 
- *  An LZ4_stream_t structure must be initialized at least once. 
- *  This is automatically done when invoking LZ4_createStream(), 
- *  but it's not when the structure is simply declared on stack (for example). 
- * 
- *  Use LZ4_initStream() to properly initialize a newly declared LZ4_stream_t. 
- *  It can also initialize any arbitrary buffer of sufficient size, 
- *  and will @return a pointer of proper type upon initialization. 
- * 
- *  Note : initialization fails if size and alignment conditions are not respected. 
- *         In which case, the function will @return NULL. 
- *  Note2: An LZ4_stream_t structure guarantees correct alignment and size. 
- *  Note3: Before v1.9.0, use LZ4_resetStream() instead 
- */ 
-LZ4LIB_API LZ4_stream_t* LZ4_initStream (void* buffer, size_t size); 
-
- 
-/*! LZ4_streamDecode_t : 
- *  information structure to track an LZ4 stream during decompression. 
- *  init this structure  using LZ4_setStreamDecode() before first use. 
- *  note : only use in association with static linking ! 
- *         this definition is not API/ABI safe, 
- *         and may change in a future version ! 
+/*! LZ4_initStream() : v1.9.0+
+ *  An LZ4_stream_t structure must be initialized at least once.
+ *  This is automatically done when invoking LZ4_createStream(),
+ *  but it's not when the structure is simply declared on stack (for example).
+ *
+ *  Use LZ4_initStream() to properly initialize a newly declared LZ4_stream_t.
+ *  It can also initialize any arbitrary buffer of sufficient size,
+ *  and will @return a pointer of proper type upon initialization.
+ *
+ *  Note : initialization fails if size and alignment conditions are not respected.
+ *         In which case, the function will @return NULL.
+ *  Note2: An LZ4_stream_t structure guarantees correct alignment and size.
+ *  Note3: Before v1.9.0, use LZ4_resetStream() instead
  */
-#define LZ4_STREAMDECODESIZE_U64 (4 + ((sizeof(void*)==16) ? 2 : 0) /*AS-400*/ ) 
+LZ4LIB_API LZ4_stream_t* LZ4_initStream (void* buffer, size_t size);
+
+
+/*! LZ4_streamDecode_t :
+ *  information structure to track an LZ4 stream during decompression.
+ *  init this structure  using LZ4_setStreamDecode() before first use.
+ *  note : only use in association with static linking !
+ *         this definition is not API/ABI safe,
+ *         and may change in a future version !
+ */
+#define LZ4_STREAMDECODESIZE_U64 (4 + ((sizeof(void*)==16) ? 2 : 0) /*AS-400*/ )
 #define LZ4_STREAMDECODESIZE     (LZ4_STREAMDECODESIZE_U64 * sizeof(unsigned long long))
 union LZ4_streamDecode_u {
     unsigned long long table[LZ4_STREAMDECODESIZE_U64];
@@ -661,22 +661,22 @@ union LZ4_streamDecode_u {
 
 
 
-/*-************************************ 
+/*-************************************
 *  Obsolete Functions
 **************************************/
- 
-/*! Deprecation warnings 
- * 
- *  Deprecated functions make the compiler generate a warning when invoked. 
- *  This is meant to invite users to update their source code. 
- *  Should deprecation warnings be a problem, it is generally possible to disable them, 
- *  typically with -Wno-deprecated-declarations for gcc 
- *  or _CRT_SECURE_NO_WARNINGS in Visual. 
- * 
- *  Another method is to define LZ4_DISABLE_DEPRECATE_WARNINGS 
- *  before including the header file. 
- */ 
- 
+
+/*! Deprecation warnings
+ *
+ *  Deprecated functions make the compiler generate a warning when invoked.
+ *  This is meant to invite users to update their source code.
+ *  Should deprecation warnings be a problem, it is generally possible to disable them,
+ *  typically with -Wno-deprecated-declarations for gcc
+ *  or _CRT_SECURE_NO_WARNINGS in Visual.
+ *
+ *  Another method is to define LZ4_DISABLE_DEPRECATE_WARNINGS
+ *  before including the header file.
+ */
+
 #ifndef LZ4_DISABLE_DEPRECATE_WARNINGS
 #  define LZ4_DISABLE_DEPRECATE_WARNINGS
 #endif
@@ -701,79 +701,79 @@ union LZ4_streamDecode_u {
 /*! Obsolete compression functions (since v1.7.3) */
 LZ4_DEPRECATED("use LZ4_compress_default() instead")       LZ4LIB_API int LZ4_compress               (const char* src, char* dest, int srcSize);
 LZ4_DEPRECATED("use LZ4_compress_default() instead")       LZ4LIB_API int LZ4_compress_limitedOutput (const char* src, char* dest, int srcSize, int maxOutputSize);
-LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_withState               (void* state, const char* source, char* dest, int inputSize); 
-LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_limitedOutput_withState (void* state, const char* source, char* dest, int inputSize, int maxOutputSize); 
-LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_continue                (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize); 
-LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_limitedOutput_continue  (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize, int maxOutputSize); 
+LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_withState               (void* state, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_limitedOutput_withState (void* state, const char* source, char* dest, int inputSize, int maxOutputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_continue                (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_limitedOutput_continue  (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize, int maxOutputSize);
 
 /*! Obsolete decompression functions (since v1.8.0) */
-LZ4_DEPRECATED("use LZ4_decompress_fast() instead") LZ4LIB_API int LZ4_uncompress (const char* source, char* dest, int outputSize); 
-LZ4_DEPRECATED("use LZ4_decompress_safe() instead") LZ4LIB_API int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize); 
+LZ4_DEPRECATED("use LZ4_decompress_fast() instead") LZ4LIB_API int LZ4_uncompress (const char* source, char* dest, int outputSize);
+LZ4_DEPRECATED("use LZ4_decompress_safe() instead") LZ4LIB_API int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize);
 
 /* Obsolete streaming functions (since v1.7.0)
  * degraded functionality; do not use!
- * 
- * In order to perform streaming compression, these functions depended on data 
- * that is no longer tracked in the state. They have been preserved as well as 
- * possible: using them will still produce a correct output. However, they don't 
- * actually retain any history between compression calls. The compression ratio 
- * achieved will therefore be no better than compressing each chunk 
- * independently. 
- */ 
-LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API void* LZ4_create (char* inputBuffer); 
-LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API int   LZ4_sizeofStreamState(void); 
-LZ4_DEPRECATED("Use LZ4_resetStream() instead")  LZ4LIB_API int   LZ4_resetStreamState(void* state, char* inputBuffer); 
-LZ4_DEPRECATED("Use LZ4_saveDict() instead")     LZ4LIB_API char* LZ4_slideInputBuffer (void* state); 
+ *
+ * In order to perform streaming compression, these functions depended on data
+ * that is no longer tracked in the state. They have been preserved as well as
+ * possible: using them will still produce a correct output. However, they don't
+ * actually retain any history between compression calls. The compression ratio
+ * achieved will therefore be no better than compressing each chunk
+ * independently.
+ */
+LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API void* LZ4_create (char* inputBuffer);
+LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API int   LZ4_sizeofStreamState(void);
+LZ4_DEPRECATED("Use LZ4_resetStream() instead")  LZ4LIB_API int   LZ4_resetStreamState(void* state, char* inputBuffer);
+LZ4_DEPRECATED("Use LZ4_saveDict() instead")     LZ4LIB_API char* LZ4_slideInputBuffer (void* state);
 
 /*! Obsolete streaming decoding functions (since v1.7.0) */
-LZ4_DEPRECATED("use LZ4_decompress_safe_usingDict() instead") LZ4LIB_API int LZ4_decompress_safe_withPrefix64k (const char* src, char* dst, int compressedSize, int maxDstSize); 
-LZ4_DEPRECATED("use LZ4_decompress_fast_usingDict() instead") LZ4LIB_API int LZ4_decompress_fast_withPrefix64k (const char* src, char* dst, int originalSize); 
+LZ4_DEPRECATED("use LZ4_decompress_safe_usingDict() instead") LZ4LIB_API int LZ4_decompress_safe_withPrefix64k (const char* src, char* dst, int compressedSize, int maxDstSize);
+LZ4_DEPRECATED("use LZ4_decompress_fast_usingDict() instead") LZ4LIB_API int LZ4_decompress_fast_withPrefix64k (const char* src, char* dst, int originalSize);
 
 /*! Obsolete LZ4_decompress_fast variants (since v1.9.0) :
- *  These functions used to be faster than LZ4_decompress_safe(), 
+ *  These functions used to be faster than LZ4_decompress_safe(),
  *  but this is no longer the case. They are now slower.
- *  This is because LZ4_decompress_fast() doesn't know the input size, 
+ *  This is because LZ4_decompress_fast() doesn't know the input size,
  *  and therefore must progress more cautiously into the input buffer to not read beyond the end of block.
- *  On top of that `LZ4_decompress_fast()` is not protected vs malformed or malicious inputs, making it a security liability. 
- *  As a consequence, LZ4_decompress_fast() is strongly discouraged, and deprecated. 
- * 
- *  The last remaining LZ4_decompress_fast() specificity is that 
- *  it can decompress a block without knowing its compressed size. 
+ *  On top of that `LZ4_decompress_fast()` is not protected vs malformed or malicious inputs, making it a security liability.
+ *  As a consequence, LZ4_decompress_fast() is strongly discouraged, and deprecated.
+ *
+ *  The last remaining LZ4_decompress_fast() specificity is that
+ *  it can decompress a block without knowing its compressed size.
  *  Such functionality can be achieved in a more secure manner
  *  by employing LZ4_decompress_safe_partial().
- * 
- *  Parameters: 
- *  originalSize : is the uncompressed size to regenerate. 
- *                 `dst` must be already allocated, its size must be >= 'originalSize' bytes. 
- * @return : number of bytes read from source buffer (== compressed size). 
- *           The function expects to finish at block's end exactly. 
- *           If the source stream is detected malformed, the function stops decoding and returns a negative result. 
- *  note : LZ4_decompress_fast*() requires originalSize. Thanks to this information, it never writes past the output buffer. 
- *         However, since it doesn't know its 'src' size, it may read an unknown amount of input, past input buffer bounds. 
- *         Also, since match offsets are not validated, match reads from 'src' may underflow too. 
- *         These issues never happen if input (compressed) data is correct. 
- *         But they may happen if input data is invalid (error or intentional tampering). 
- *         As a consequence, use these functions in trusted environments with trusted data **only**. 
- */ 
-LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe() instead") 
-LZ4LIB_API int LZ4_decompress_fast (const char* src, char* dst, int originalSize); 
-LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_continue() instead") 
-LZ4LIB_API int LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int originalSize); 
-LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_usingDict() instead") 
-LZ4LIB_API int LZ4_decompress_fast_usingDict (const char* src, char* dst, int originalSize, const char* dictStart, int dictSize); 
- 
-/*! LZ4_resetStream() : 
- *  An LZ4_stream_t structure must be initialized at least once. 
- *  This is done with LZ4_initStream(), or LZ4_resetStream(). 
- *  Consider switching to LZ4_initStream(), 
- *  invoking LZ4_resetStream() will trigger deprecation warnings in the future. 
- */ 
-LZ4LIB_API void LZ4_resetStream (LZ4_stream_t* streamPtr); 
- 
- 
+ *
+ *  Parameters:
+ *  originalSize : is the uncompressed size to regenerate.
+ *                 `dst` must be already allocated, its size must be >= 'originalSize' bytes.
+ * @return : number of bytes read from source buffer (== compressed size).
+ *           The function expects to finish at block's end exactly.
+ *           If the source stream is detected malformed, the function stops decoding and returns a negative result.
+ *  note : LZ4_decompress_fast*() requires originalSize. Thanks to this information, it never writes past the output buffer.
+ *         However, since it doesn't know its 'src' size, it may read an unknown amount of input, past input buffer bounds.
+ *         Also, since match offsets are not validated, match reads from 'src' may underflow too.
+ *         These issues never happen if input (compressed) data is correct.
+ *         But they may happen if input data is invalid (error or intentional tampering).
+ *         As a consequence, use these functions in trusted environments with trusted data **only**.
+ */
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe() instead")
+LZ4LIB_API int LZ4_decompress_fast (const char* src, char* dst, int originalSize);
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_continue() instead")
+LZ4LIB_API int LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int originalSize);
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_usingDict() instead")
+LZ4LIB_API int LZ4_decompress_fast_usingDict (const char* src, char* dst, int originalSize, const char* dictStart, int dictSize);
+
+/*! LZ4_resetStream() :
+ *  An LZ4_stream_t structure must be initialized at least once.
+ *  This is done with LZ4_initStream(), or LZ4_resetStream().
+ *  Consider switching to LZ4_initStream(),
+ *  invoking LZ4_resetStream() will trigger deprecation warnings in the future.
+ */
+LZ4LIB_API void LZ4_resetStream (LZ4_stream_t* streamPtr);
+
+
 #endif /* LZ4_H_98237428734687 */
- 
- 
+
+
 #if defined (__cplusplus) && !defined(LZ4_NAMESPACE)
 }
 #endif
diff --git a/contrib/libs/lz4/lz4frame.c b/contrib/libs/lz4/lz4frame.c
index 3de7bf5ea2..ec02c92f72 100644
--- a/contrib/libs/lz4/lz4frame.c
+++ b/contrib/libs/lz4/lz4frame.c
@@ -1,44 +1,44 @@
 /*
- * LZ4 auto-framing library 
- * Copyright (C) 2011-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 : 
- * - LZ4 homepage : http://www.lz4.org 
- * - LZ4 source repository : https://github.com/lz4/lz4 
- */ 
+ * LZ4 auto-framing library
+ * Copyright (C) 2011-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 :
+ * - LZ4 homepage : http://www.lz4.org
+ * - LZ4 source repository : https://github.com/lz4/lz4
+ */
 
 /* LZ4F is a stand-alone API to create LZ4-compressed Frames
- * in full conformance with specification v1.6.1 . 
- * This library rely upon memory management capabilities (malloc, free) 
- * provided either by <stdlib.h>, 
- * or redirected towards another library of user's choice 
- * (see Memory Routines below). 
- */ 
+ * in full conformance with specification v1.6.1 .
+ * This library rely upon memory management capabilities (malloc, free)
+ * provided either by <stdlib.h>,
+ * or redirected towards another library of user's choice
+ * (see Memory Routines below).
+ */
 
 
 /*-************************************
@@ -50,80 +50,80 @@
 
 
 /*-************************************
-*  Tuning parameters 
-**************************************/ 
-/* 
- * LZ4F_HEAPMODE : 
- * Select how default compression functions will allocate memory for their hash table, 
- * in memory stack (0:default, fastest), or in memory heap (1:requires malloc()). 
- */ 
-#ifndef LZ4F_HEAPMODE 
-#  define LZ4F_HEAPMODE 0 
-#endif 
- 
- 
-/*-************************************ 
+*  Tuning parameters
+**************************************/
+/*
+ * LZ4F_HEAPMODE :
+ * Select how default compression functions will allocate memory for their hash table,
+ * in memory stack (0:default, fastest), or in memory heap (1:requires malloc()).
+ */
+#ifndef LZ4F_HEAPMODE
+#  define LZ4F_HEAPMODE 0
+#endif
+
+
+/*-************************************
 *  Memory routines
 **************************************/
-/* 
- * User may redirect invocations of 
- * malloc(), calloc() and free() 
- * towards another library or solution of their choice 
- * by modifying below section. 
- */ 
-#ifndef LZ4_SRC_INCLUDED   /* avoid redefinition when sources are coalesced */ 
+/*
+ * User may redirect invocations of
+ * malloc(), calloc() and free()
+ * towards another library or solution of their choice
+ * by modifying below section.
+ */
+#ifndef LZ4_SRC_INCLUDED   /* avoid redefinition when sources are coalesced */
 #  include <stdlib.h>   /* malloc, calloc, free */
-#  define ALLOC(s)          malloc(s) 
-#  define ALLOC_AND_ZERO(s) calloc(1,(s)) 
-#  define FREEMEM(p)        free(p) 
-#endif 
- 
+#  define ALLOC(s)          malloc(s)
+#  define ALLOC_AND_ZERO(s) calloc(1,(s))
+#  define FREEMEM(p)        free(p)
+#endif
+
 #include <string.h>   /* memset, memcpy, memmove */
-#ifndef LZ4_SRC_INCLUDED  /* avoid redefinition when sources are coalesced */ 
-#  define MEM_INIT(p,v,s)   memset((p),(v),(s)) 
-#endif 
+#ifndef LZ4_SRC_INCLUDED  /* avoid redefinition when sources are coalesced */
+#  define MEM_INIT(p,v,s)   memset((p),(v),(s))
+#endif
 
 
 /*-************************************
-*  Library declarations 
+*  Library declarations
 **************************************/
-#define LZ4F_STATIC_LINKING_ONLY 
-#include "lz4frame.h" 
-#define LZ4_STATIC_LINKING_ONLY 
+#define LZ4F_STATIC_LINKING_ONLY
+#include "lz4frame.h"
+#define LZ4_STATIC_LINKING_ONLY
 #include "lz4.h"
-#define LZ4_HC_STATIC_LINKING_ONLY 
+#define LZ4_HC_STATIC_LINKING_ONLY
 #include "lz4hc.h"
 #define XXH_STATIC_LINKING_ONLY
 #include "xxhash.h"
 
 
 /*-************************************
-*  Debug 
+*  Debug
 **************************************/
-#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=1) 
-#  include <assert.h> 
-#else 
-#  ifndef assert 
-#    define assert(condition) ((void)0) 
-#  endif 
-#endif 
-
-#define LZ4F_STATIC_ASSERT(c)    { enum { LZ4F_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */ 
-
-#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=2) && !defined(DEBUGLOG) 
-#  include <stdio.h> 
-static int g_debuglog_enable = 1; 
-#  define DEBUGLOG(l, ...) {                                  \ 
-                if ((g_debuglog_enable) && (l<=LZ4_DEBUG)) {  \ 
-                    fprintf(stderr, __FILE__ ": ");           \ 
-                    fprintf(stderr, __VA_ARGS__);             \ 
-                    fprintf(stderr, " \n");                   \ 
-            }   } 
-#else 
-#  define DEBUGLOG(l, ...)      {}    /* disabled */ 
-#endif 
- 
- 
+#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=1)
+#  include <assert.h>
+#else
+#  ifndef assert
+#    define assert(condition) ((void)0)
+#  endif
+#endif
+
+#define LZ4F_STATIC_ASSERT(c)    { enum { LZ4F_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
+
+#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=2) && !defined(DEBUGLOG)
+#  include <stdio.h>
+static int g_debuglog_enable = 1;
+#  define DEBUGLOG(l, ...) {                                  \
+                if ((g_debuglog_enable) && (l<=LZ4_DEBUG)) {  \
+                    fprintf(stderr, __FILE__ ": ");           \
+                    fprintf(stderr, __VA_ARGS__);             \
+                    fprintf(stderr, " \n");                   \
+            }   }
+#else
+#  define DEBUGLOG(l, ...)      {}    /* disabled */
+#endif
+
+
 /*-************************************
 *  Basic Types
 **************************************/
@@ -148,8 +148,8 @@ static U32 LZ4F_readLE32 (const void* src)
 {
     const BYTE* const srcPtr = (const BYTE*)src;
     U32 value32 = srcPtr[0];
-    value32 += ((U32)srcPtr[1])<< 8; 
-    value32 += ((U32)srcPtr[2])<<16; 
+    value32 += ((U32)srcPtr[1])<< 8;
+    value32 += ((U32)srcPtr[2])<<16;
     value32 += ((U32)srcPtr[3])<<24;
     return value32;
 }
@@ -194,11 +194,11 @@ static void LZ4F_writeLE64 (void* dst, U64 value64)
 /*-************************************
 *  Constants
 **************************************/
-#ifndef LZ4_SRC_INCLUDED   /* avoid double definition */ 
-#  define KB *(1<<10) 
-#  define MB *(1<<20) 
-#  define GB *(1<<30) 
-#endif 
+#ifndef LZ4_SRC_INCLUDED   /* avoid double definition */
+#  define KB *(1<<10)
+#  define MB *(1<<20)
+#  define GB *(1<<30)
+#endif
 
 #define _1BIT  0x01
 #define _2BITS 0x03
@@ -211,8 +211,8 @@ static void LZ4F_writeLE64 (void* dst, U64 value64)
 #define LZ4F_BLOCKUNCOMPRESSED_FLAG 0x80000000U
 #define LZ4F_BLOCKSIZEID_DEFAULT LZ4F_max64KB
 
-static const size_t minFHSize = LZ4F_HEADER_SIZE_MIN;   /*  7 */ 
-static const size_t maxFHSize = LZ4F_HEADER_SIZE_MAX;   /* 19 */ 
+static const size_t minFHSize = LZ4F_HEADER_SIZE_MIN;   /*  7 */
+static const size_t maxFHSize = LZ4F_HEADER_SIZE_MAX;   /* 19 */
 static const size_t BHSize = LZ4F_BLOCK_HEADER_SIZE;  /* block header : size, and compress flag */
 static const size_t BFSize = LZ4F_BLOCK_CHECKSUM_SIZE;  /* block footer : checksum (optional) */
 
@@ -225,7 +225,7 @@ typedef struct LZ4F_cctx_s
     LZ4F_preferences_t prefs;
     U32    version;
     U32    cStage;
-    const LZ4F_CDict* cdict; 
+    const LZ4F_CDict* cdict;
     size_t maxBlockSize;
     size_t maxBufferSize;
     BYTE*  tmpBuff;
@@ -234,8 +234,8 @@ typedef struct LZ4F_cctx_s
     U64    totalInSize;
     XXH32_state_t xxh;
     void*  lz4CtxPtr;
-    U16    lz4CtxAlloc; /* sized for: 0 = none, 1 = lz4 ctx, 2 = lz4hc ctx */ 
-    U16    lz4CtxState; /* in use as: 0 = none, 1 = lz4 ctx, 2 = lz4hc ctx */ 
+    U16    lz4CtxAlloc; /* sized for: 0 = none, 1 = lz4 ctx, 2 = lz4hc ctx */
+    U16    lz4CtxState; /* in use as: 0 = none, 1 = lz4 ctx, 2 = lz4hc ctx */
 } LZ4F_cctx_t;
 
 
@@ -266,31 +266,31 @@ LZ4F_errorCodes LZ4F_getErrorCode(size_t functionResult)
 
 static LZ4F_errorCode_t err0r(LZ4F_errorCodes code)
 {
-    /* A compilation error here means sizeof(ptrdiff_t) is not large enough */ 
-    LZ4F_STATIC_ASSERT(sizeof(ptrdiff_t) >= sizeof(size_t)); 
+    /* A compilation error here means sizeof(ptrdiff_t) is not large enough */
+    LZ4F_STATIC_ASSERT(sizeof(ptrdiff_t) >= sizeof(size_t));
     return (LZ4F_errorCode_t)-(ptrdiff_t)code;
 }
 
 unsigned LZ4F_getVersion(void) { return LZ4F_VERSION; }
 
-int LZ4F_compressionLevel_max(void) { return LZ4HC_CLEVEL_MAX; } 
+int LZ4F_compressionLevel_max(void) { return LZ4HC_CLEVEL_MAX; }
 
-size_t LZ4F_getBlockSize(unsigned blockSizeID) 
+size_t LZ4F_getBlockSize(unsigned blockSizeID)
 {
     static const size_t blockSizes[4] = { 64 KB, 256 KB, 1 MB, 4 MB };
 
     if (blockSizeID == 0) blockSizeID = LZ4F_BLOCKSIZEID_DEFAULT;
-    if (blockSizeID < LZ4F_max64KB || blockSizeID > LZ4F_max4MB) 
-        return err0r(LZ4F_ERROR_maxBlockSize_invalid); 
-    blockSizeID -= LZ4F_max64KB; 
+    if (blockSizeID < LZ4F_max64KB || blockSizeID > LZ4F_max4MB)
+        return err0r(LZ4F_ERROR_maxBlockSize_invalid);
+    blockSizeID -= LZ4F_max64KB;
     return blockSizes[blockSizeID];
 }
 
-/*-************************************ 
-*  Private functions 
-**************************************/ 
-#define MIN(a,b)   ( (a) < (b) ? (a) : (b) ) 
- 
+/*-************************************
+*  Private functions
+**************************************/
+#define MIN(a,b)   ( (a) < (b) ? (a) : (b) )
+
 static BYTE LZ4F_headerChecksum (const void* header, size_t length)
 {
     U32 const xxh = XXH32(header, length, 0);
@@ -301,8 +301,8 @@ static BYTE LZ4F_headerChecksum (const void* header, size_t length)
 /*-************************************
 *  Simple-pass compression functions
 **************************************/
-static LZ4F_blockSizeID_t LZ4F_optimalBSID(const LZ4F_blockSizeID_t requestedBSID, 
-                                           const size_t srcSize) 
+static LZ4F_blockSizeID_t LZ4F_optimalBSID(const LZ4F_blockSizeID_t requestedBSID,
+                                           const size_t srcSize)
 {
     LZ4F_blockSizeID_t proposedBSID = LZ4F_max64KB;
     size_t maxBlockSize = 64 KB;
@@ -315,66 +315,66 @@ static LZ4F_blockSizeID_t LZ4F_optimalBSID(const LZ4F_blockSizeID_t requestedBSI
     return requestedBSID;
 }
 
-/*! LZ4F_compressBound_internal() : 
- *  Provides dstCapacity given a srcSize to guarantee operation success in worst case situations. 
- *  prefsPtr is optional : if NULL is provided, preferences will be set to cover worst case scenario. 
- * @return is always the same for a srcSize and prefsPtr, so it can be relied upon to size reusable buffers. 
- *  When srcSize==0, LZ4F_compressBound() provides an upper bound for LZ4F_flush() and LZ4F_compressEnd() operations. 
+/*! LZ4F_compressBound_internal() :
+ *  Provides dstCapacity given a srcSize to guarantee operation success in worst case situations.
+ *  prefsPtr is optional : if NULL is provided, preferences will be set to cover worst case scenario.
+ * @return is always the same for a srcSize and prefsPtr, so it can be relied upon to size reusable buffers.
+ *  When srcSize==0, LZ4F_compressBound() provides an upper bound for LZ4F_flush() and LZ4F_compressEnd() operations.
  */
-static size_t LZ4F_compressBound_internal(size_t srcSize, 
-                                    const LZ4F_preferences_t* preferencesPtr, 
-                                          size_t alreadyBuffered) 
+static size_t LZ4F_compressBound_internal(size_t srcSize,
+                                    const LZ4F_preferences_t* preferencesPtr,
+                                          size_t alreadyBuffered)
 {
     LZ4F_preferences_t prefsNull = LZ4F_INIT_PREFERENCES;
     prefsNull.frameInfo.contentChecksumFlag = LZ4F_contentChecksumEnabled;   /* worst case */
     prefsNull.frameInfo.blockChecksumFlag = LZ4F_blockChecksumEnabled;   /* worst case */
     {   const LZ4F_preferences_t* const prefsPtr = (preferencesPtr==NULL) ? &prefsNull : preferencesPtr;
         U32 const flush = prefsPtr->autoFlush | (srcSize==0);
-        LZ4F_blockSizeID_t const blockID = prefsPtr->frameInfo.blockSizeID; 
-        size_t const blockSize = LZ4F_getBlockSize(blockID); 
+        LZ4F_blockSizeID_t const blockID = prefsPtr->frameInfo.blockSizeID;
+        size_t const blockSize = LZ4F_getBlockSize(blockID);
         size_t const maxBuffered = blockSize - 1;
         size_t const bufferedSize = MIN(alreadyBuffered, maxBuffered);
         size_t const maxSrcSize = srcSize + bufferedSize;
         unsigned const nbFullBlocks = (unsigned)(maxSrcSize / blockSize);
-        size_t const partialBlockSize = maxSrcSize & (blockSize-1); 
+        size_t const partialBlockSize = maxSrcSize & (blockSize-1);
         size_t const lastBlockSize = flush ? partialBlockSize : 0;
         unsigned const nbBlocks = nbFullBlocks + (lastBlockSize>0);
 
-        size_t const blockCRCSize = BFSize * prefsPtr->frameInfo.blockChecksumFlag; 
-        size_t const frameEnd = BHSize + (prefsPtr->frameInfo.contentChecksumFlag*BFSize); 
+        size_t const blockCRCSize = BFSize * prefsPtr->frameInfo.blockChecksumFlag;
+        size_t const frameEnd = BHSize + (prefsPtr->frameInfo.contentChecksumFlag*BFSize);
 
-        return ((BHSize + blockCRCSize) * nbBlocks) + 
-               (blockSize * nbFullBlocks) + lastBlockSize + frameEnd; 
+        return ((BHSize + blockCRCSize) * nbBlocks) +
+               (blockSize * nbFullBlocks) + lastBlockSize + frameEnd;
     }
 }
 
 size_t LZ4F_compressFrameBound(size_t srcSize, const LZ4F_preferences_t* preferencesPtr)
 {
     LZ4F_preferences_t prefs;
-    size_t const headerSize = maxFHSize;      /* max header size, including optional fields */ 
+    size_t const headerSize = maxFHSize;      /* max header size, including optional fields */
 
     if (preferencesPtr!=NULL) prefs = *preferencesPtr;
-    else MEM_INIT(&prefs, 0, sizeof(prefs)); 
+    else MEM_INIT(&prefs, 0, sizeof(prefs));
     prefs.autoFlush = 1;
 
     return headerSize + LZ4F_compressBound_internal(srcSize, &prefs, 0);;
 }
 
 
-/*! LZ4F_compressFrame_usingCDict() : 
- *  Compress srcBuffer using a dictionary, in a single step. 
- *  cdict can be NULL, in which case, no dictionary is used. 
- *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr). 
- *  The LZ4F_preferences_t structure is optional : you may provide NULL as argument, 
- *  however, it's the only way to provide a dictID, so it's not recommended. 
- * @return : number of bytes written into dstBuffer, 
- *           or an error code if it fails (can be tested using LZ4F_isError()) 
- */ 
-size_t LZ4F_compressFrame_usingCDict(LZ4F_cctx* cctx, 
-                                     void* dstBuffer, size_t dstCapacity, 
-                               const void* srcBuffer, size_t srcSize, 
-                               const LZ4F_CDict* cdict, 
-                               const LZ4F_preferences_t* preferencesPtr) 
+/*! LZ4F_compressFrame_usingCDict() :
+ *  Compress srcBuffer using a dictionary, in a single step.
+ *  cdict can be NULL, in which case, no dictionary is used.
+ *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
+ *  The LZ4F_preferences_t structure is optional : you may provide NULL as argument,
+ *  however, it's the only way to provide a dictID, so it's not recommended.
+ * @return : number of bytes written into dstBuffer,
+ *           or an error code if it fails (can be tested using LZ4F_isError())
+ */
+size_t LZ4F_compressFrame_usingCDict(LZ4F_cctx* cctx,
+                                     void* dstBuffer, size_t dstCapacity,
+                               const void* srcBuffer, size_t srcSize,
+                               const LZ4F_CDict* cdict,
+                               const LZ4F_preferences_t* preferencesPtr)
 {
     LZ4F_preferences_t prefs;
     LZ4F_compressOptions_t options;
@@ -385,161 +385,161 @@ size_t LZ4F_compressFrame_usingCDict(LZ4F_cctx* cctx,
     if (preferencesPtr!=NULL)
         prefs = *preferencesPtr;
     else
-        MEM_INIT(&prefs, 0, sizeof(prefs)); 
+        MEM_INIT(&prefs, 0, sizeof(prefs));
     if (prefs.frameInfo.contentSize != 0)
         prefs.frameInfo.contentSize = (U64)srcSize;   /* auto-correct content size if selected (!=0) */
 
     prefs.frameInfo.blockSizeID = LZ4F_optimalBSID(prefs.frameInfo.blockSizeID, srcSize);
     prefs.autoFlush = 1;
     if (srcSize <= LZ4F_getBlockSize(prefs.frameInfo.blockSizeID))
-        prefs.frameInfo.blockMode = LZ4F_blockIndependent;   /* only one block => no need for inter-block link */ 
+        prefs.frameInfo.blockMode = LZ4F_blockIndependent;   /* only one block => no need for inter-block link */
 
-    MEM_INIT(&options, 0, sizeof(options)); 
+    MEM_INIT(&options, 0, sizeof(options));
     options.stableSrc = 1;
 
-    if (dstCapacity < LZ4F_compressFrameBound(srcSize, &prefs))  /* condition to guarantee success */ 
+    if (dstCapacity < LZ4F_compressFrameBound(srcSize, &prefs))  /* condition to guarantee success */
         return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
 
-    { size_t const headerSize = LZ4F_compressBegin_usingCDict(cctx, dstBuffer, dstCapacity, cdict, &prefs);  /* write header */ 
+    { size_t const headerSize = LZ4F_compressBegin_usingCDict(cctx, dstBuffer, dstCapacity, cdict, &prefs);  /* write header */
       if (LZ4F_isError(headerSize)) return headerSize;
       dstPtr += headerSize;   /* header size */ }
 
-    assert(dstEnd >= dstPtr); 
-    { size_t const cSize = LZ4F_compressUpdate(cctx, dstPtr, (size_t)(dstEnd-dstPtr), srcBuffer, srcSize, &options); 
+    assert(dstEnd >= dstPtr);
+    { size_t const cSize = LZ4F_compressUpdate(cctx, dstPtr, (size_t)(dstEnd-dstPtr), srcBuffer, srcSize, &options);
       if (LZ4F_isError(cSize)) return cSize;
       dstPtr += cSize; }
 
-    assert(dstEnd >= dstPtr); 
-    { size_t const tailSize = LZ4F_compressEnd(cctx, dstPtr, (size_t)(dstEnd-dstPtr), &options);   /* flush last block, and generate suffix */ 
+    assert(dstEnd >= dstPtr);
+    { size_t const tailSize = LZ4F_compressEnd(cctx, dstPtr, (size_t)(dstEnd-dstPtr), &options);   /* flush last block, and generate suffix */
       if (LZ4F_isError(tailSize)) return tailSize;
       dstPtr += tailSize; }
 
-    assert(dstEnd >= dstStart); 
-    return (size_t)(dstPtr - dstStart); 
-} 
-
- 
-/*! LZ4F_compressFrame() : 
- *  Compress an entire srcBuffer into a valid LZ4 frame, in a single step. 
- *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr). 
- *  The LZ4F_preferences_t structure is optional : you can provide NULL as argument. All preferences will be set to default. 
- * @return : number of bytes written into dstBuffer. 
- *           or an error code if it fails (can be tested using LZ4F_isError()) 
- */ 
-size_t LZ4F_compressFrame(void* dstBuffer, size_t dstCapacity, 
-                    const void* srcBuffer, size_t srcSize, 
-                    const LZ4F_preferences_t* preferencesPtr) 
-{ 
-    size_t result; 
-#if (LZ4F_HEAPMODE) 
-    LZ4F_cctx_t *cctxPtr; 
-    result = LZ4F_createCompressionContext(&cctxPtr, LZ4F_VERSION); 
-    if (LZ4F_isError(result)) return result; 
-#else 
-    LZ4F_cctx_t cctx; 
-    LZ4_stream_t lz4ctx; 
-    LZ4F_cctx_t *cctxPtr = &cctx; 
- 
-    DEBUGLOG(4, "LZ4F_compressFrame"); 
-    MEM_INIT(&cctx, 0, sizeof(cctx)); 
-    cctx.version = LZ4F_VERSION; 
-    cctx.maxBufferSize = 5 MB;   /* mess with real buffer size to prevent dynamic allocation; works only because autoflush==1 & stableSrc==1 */ 
-    if (preferencesPtr == NULL || 
-        preferencesPtr->compressionLevel < LZ4HC_CLEVEL_MIN) 
-    { 
-        LZ4_initStream(&lz4ctx, sizeof(lz4ctx)); 
-        cctxPtr->lz4CtxPtr = &lz4ctx; 
-        cctxPtr->lz4CtxAlloc = 1; 
-        cctxPtr->lz4CtxState = 1; 
-    } 
-#endif 
- 
-    result = LZ4F_compressFrame_usingCDict(cctxPtr, dstBuffer, dstCapacity, 
-                                           srcBuffer, srcSize, 
-                                           NULL, preferencesPtr); 
- 
-#if (LZ4F_HEAPMODE) 
-    LZ4F_freeCompressionContext(cctxPtr); 
-#else 
-    if (preferencesPtr != NULL && 
-        preferencesPtr->compressionLevel >= LZ4HC_CLEVEL_MIN) 
-    { 
-        FREEMEM(cctxPtr->lz4CtxPtr); 
-    } 
-#endif 
-    return result; 
+    assert(dstEnd >= dstStart);
+    return (size_t)(dstPtr - dstStart);
+}
+
+
+/*! LZ4F_compressFrame() :
+ *  Compress an entire srcBuffer into a valid LZ4 frame, in a single step.
+ *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
+ *  The LZ4F_preferences_t structure is optional : you can provide NULL as argument. All preferences will be set to default.
+ * @return : number of bytes written into dstBuffer.
+ *           or an error code if it fails (can be tested using LZ4F_isError())
+ */
+size_t LZ4F_compressFrame(void* dstBuffer, size_t dstCapacity,
+                    const void* srcBuffer, size_t srcSize,
+                    const LZ4F_preferences_t* preferencesPtr)
+{
+    size_t result;
+#if (LZ4F_HEAPMODE)
+    LZ4F_cctx_t *cctxPtr;
+    result = LZ4F_createCompressionContext(&cctxPtr, LZ4F_VERSION);
+    if (LZ4F_isError(result)) return result;
+#else
+    LZ4F_cctx_t cctx;
+    LZ4_stream_t lz4ctx;
+    LZ4F_cctx_t *cctxPtr = &cctx;
+
+    DEBUGLOG(4, "LZ4F_compressFrame");
+    MEM_INIT(&cctx, 0, sizeof(cctx));
+    cctx.version = LZ4F_VERSION;
+    cctx.maxBufferSize = 5 MB;   /* mess with real buffer size to prevent dynamic allocation; works only because autoflush==1 & stableSrc==1 */
+    if (preferencesPtr == NULL ||
+        preferencesPtr->compressionLevel < LZ4HC_CLEVEL_MIN)
+    {
+        LZ4_initStream(&lz4ctx, sizeof(lz4ctx));
+        cctxPtr->lz4CtxPtr = &lz4ctx;
+        cctxPtr->lz4CtxAlloc = 1;
+        cctxPtr->lz4CtxState = 1;
+    }
+#endif
+
+    result = LZ4F_compressFrame_usingCDict(cctxPtr, dstBuffer, dstCapacity,
+                                           srcBuffer, srcSize,
+                                           NULL, preferencesPtr);
+
+#if (LZ4F_HEAPMODE)
+    LZ4F_freeCompressionContext(cctxPtr);
+#else
+    if (preferencesPtr != NULL &&
+        preferencesPtr->compressionLevel >= LZ4HC_CLEVEL_MIN)
+    {
+        FREEMEM(cctxPtr->lz4CtxPtr);
+    }
+#endif
+    return result;
+}
+
+
+/*-***************************************************
+*   Dictionary compression
+*****************************************************/
+
+struct LZ4F_CDict_s {
+    void* dictContent;
+    LZ4_stream_t* fastCtx;
+    LZ4_streamHC_t* HCCtx;
+}; /* typedef'd to LZ4F_CDict within lz4frame_static.h */
+
+/*! LZ4F_createCDict() :
+ *  When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
+ *  LZ4F_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
+ *  LZ4F_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.
+ * `dictBuffer` can be released after LZ4F_CDict creation, since its content is copied within CDict
+ * @return : digested dictionary for compression, or NULL if failed */
+LZ4F_CDict* LZ4F_createCDict(const void* dictBuffer, size_t dictSize)
+{
+    const char* dictStart = (const char*)dictBuffer;
+    LZ4F_CDict* cdict = (LZ4F_CDict*) ALLOC(sizeof(*cdict));
+    DEBUGLOG(4, "LZ4F_createCDict");
+    if (!cdict) return NULL;
+    if (dictSize > 64 KB) {
+        dictStart += dictSize - 64 KB;
+        dictSize = 64 KB;
+    }
+    cdict->dictContent = ALLOC(dictSize);
+    cdict->fastCtx = LZ4_createStream();
+    cdict->HCCtx = LZ4_createStreamHC();
+    if (!cdict->dictContent || !cdict->fastCtx || !cdict->HCCtx) {
+        LZ4F_freeCDict(cdict);
+        return NULL;
+    }
+    memcpy(cdict->dictContent, dictStart, dictSize);
+    LZ4_loadDict (cdict->fastCtx, (const char*)cdict->dictContent, (int)dictSize);
+    LZ4_setCompressionLevel(cdict->HCCtx, LZ4HC_CLEVEL_DEFAULT);
+    LZ4_loadDictHC(cdict->HCCtx, (const char*)cdict->dictContent, (int)dictSize);
+    return cdict;
+}
+
+void LZ4F_freeCDict(LZ4F_CDict* cdict)
+{
+    if (cdict==NULL) return;  /* support free on NULL */
+    FREEMEM(cdict->dictContent);
+    LZ4_freeStream(cdict->fastCtx);
+    LZ4_freeStreamHC(cdict->HCCtx);
+    FREEMEM(cdict);
 }
 
 
-/*-*************************************************** 
-*   Dictionary compression 
-*****************************************************/ 
- 
-struct LZ4F_CDict_s { 
-    void* dictContent; 
-    LZ4_stream_t* fastCtx; 
-    LZ4_streamHC_t* HCCtx; 
-}; /* typedef'd to LZ4F_CDict within lz4frame_static.h */ 
- 
-/*! LZ4F_createCDict() : 
- *  When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once. 
- *  LZ4F_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay. 
- *  LZ4F_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only. 
- * `dictBuffer` can be released after LZ4F_CDict creation, since its content is copied within CDict 
- * @return : digested dictionary for compression, or NULL if failed */ 
-LZ4F_CDict* LZ4F_createCDict(const void* dictBuffer, size_t dictSize) 
-{ 
-    const char* dictStart = (const char*)dictBuffer; 
-    LZ4F_CDict* cdict = (LZ4F_CDict*) ALLOC(sizeof(*cdict)); 
-    DEBUGLOG(4, "LZ4F_createCDict"); 
-    if (!cdict) return NULL; 
-    if (dictSize > 64 KB) { 
-        dictStart += dictSize - 64 KB; 
-        dictSize = 64 KB; 
-    } 
-    cdict->dictContent = ALLOC(dictSize); 
-    cdict->fastCtx = LZ4_createStream(); 
-    cdict->HCCtx = LZ4_createStreamHC(); 
-    if (!cdict->dictContent || !cdict->fastCtx || !cdict->HCCtx) { 
-        LZ4F_freeCDict(cdict); 
-        return NULL; 
-    } 
-    memcpy(cdict->dictContent, dictStart, dictSize); 
-    LZ4_loadDict (cdict->fastCtx, (const char*)cdict->dictContent, (int)dictSize); 
-    LZ4_setCompressionLevel(cdict->HCCtx, LZ4HC_CLEVEL_DEFAULT); 
-    LZ4_loadDictHC(cdict->HCCtx, (const char*)cdict->dictContent, (int)dictSize); 
-    return cdict; 
-} 
- 
-void LZ4F_freeCDict(LZ4F_CDict* cdict) 
-{ 
-    if (cdict==NULL) return;  /* support free on NULL */ 
-    FREEMEM(cdict->dictContent); 
-    LZ4_freeStream(cdict->fastCtx); 
-    LZ4_freeStreamHC(cdict->HCCtx); 
-    FREEMEM(cdict); 
-} 
- 
- 
 /*-*********************************
 *  Advanced compression functions
 ***********************************/
 
 /*! LZ4F_createCompressionContext() :
- *  The first thing to do is to create a compressionContext object, which will be used in all compression operations. 
- *  This is achieved using LZ4F_createCompressionContext(), which takes as argument a version and an LZ4F_preferences_t structure. 
- *  The version provided MUST be LZ4F_VERSION. It is intended to track potential incompatible differences between different binaries. 
- *  The function will provide a pointer to an allocated LZ4F_compressionContext_t object. 
- *  If the result LZ4F_errorCode_t is not OK_NoError, there was an error during context creation. 
- *  Object can release its memory using LZ4F_freeCompressionContext(); 
+ *  The first thing to do is to create a compressionContext object, which will be used in all compression operations.
+ *  This is achieved using LZ4F_createCompressionContext(), which takes as argument a version and an LZ4F_preferences_t structure.
+ *  The version provided MUST be LZ4F_VERSION. It is intended to track potential incompatible differences between different binaries.
+ *  The function will provide a pointer to an allocated LZ4F_compressionContext_t object.
+ *  If the result LZ4F_errorCode_t is not OK_NoError, there was an error during context creation.
+ *  Object can release its memory using LZ4F_freeCompressionContext();
  */
 LZ4F_errorCode_t LZ4F_createCompressionContext(LZ4F_cctx** LZ4F_compressionContextPtr, unsigned version)
 {
-    LZ4F_cctx_t* const cctxPtr = (LZ4F_cctx_t*)ALLOC_AND_ZERO(sizeof(LZ4F_cctx_t)); 
+    LZ4F_cctx_t* const cctxPtr = (LZ4F_cctx_t*)ALLOC_AND_ZERO(sizeof(LZ4F_cctx_t));
     if (cctxPtr==NULL) return err0r(LZ4F_ERROR_allocation_failed);
 
     cctxPtr->version = version;
-    cctxPtr->cStage = 0;   /* Next stage : init stream */ 
+    cctxPtr->cStage = 0;   /* Next stage : init stream */
 
     *LZ4F_compressionContextPtr = cctxPtr;
 
@@ -549,7 +549,7 @@ LZ4F_errorCode_t LZ4F_createCompressionContext(LZ4F_cctx** LZ4F_compressionConte
 
 LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctxPtr)
 {
-    if (cctxPtr != NULL) {  /* support free on NULL */ 
+    if (cctxPtr != NULL) {  /* support free on NULL */
        FREEMEM(cctxPtr->lz4CtxPtr);  /* note: LZ4_streamHC_t and LZ4_stream_t are simple POD types */
        FREEMEM(cctxPtr->tmpBuff);
        FREEMEM(cctxPtr);
@@ -559,46 +559,46 @@ LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctxPtr)
 }
 
 
-/** 
- * This function prepares the internal LZ4(HC) stream for a new compression, 
- * resetting the context and attaching the dictionary, if there is one. 
- * 
- * It needs to be called at the beginning of each independent compression 
- * stream (i.e., at the beginning of a frame in blockLinked mode, or at the 
- * beginning of each block in blockIndependent mode). 
- */ 
-static void LZ4F_initStream(void* ctx, 
-                            const LZ4F_CDict* cdict, 
-                            int level, 
-                            LZ4F_blockMode_t blockMode) { 
-    if (level < LZ4HC_CLEVEL_MIN) { 
-        if (cdict != NULL || blockMode == LZ4F_blockLinked) { 
-            /* In these cases, we will call LZ4_compress_fast_continue(), 
-             * which needs an already reset context. Otherwise, we'll call a 
-             * one-shot API. The non-continued APIs internally perform their own 
-             * resets at the beginning of their calls, where they know what 
-             * tableType they need the context to be in. So in that case this 
-             * would be misguided / wasted work. */ 
-            LZ4_resetStream_fast((LZ4_stream_t*)ctx); 
-        } 
-        LZ4_attach_dictionary((LZ4_stream_t *)ctx, cdict ? cdict->fastCtx : NULL); 
-    } else { 
-        LZ4_resetStreamHC_fast((LZ4_streamHC_t*)ctx, level); 
-        LZ4_attach_HC_dictionary((LZ4_streamHC_t *)ctx, cdict ? cdict->HCCtx : NULL); 
-    } 
-} 
- 
- 
-/*! LZ4F_compressBegin_usingCDict() : 
- *  init streaming compression and writes frame header into dstBuffer. 
- *  dstBuffer must be >= LZ4F_HEADER_SIZE_MAX bytes. 
+/**
+ * This function prepares the internal LZ4(HC) stream for a new compression,
+ * resetting the context and attaching the dictionary, if there is one.
+ *
+ * It needs to be called at the beginning of each independent compression
+ * stream (i.e., at the beginning of a frame in blockLinked mode, or at the
+ * beginning of each block in blockIndependent mode).
+ */
+static void LZ4F_initStream(void* ctx,
+                            const LZ4F_CDict* cdict,
+                            int level,
+                            LZ4F_blockMode_t blockMode) {
+    if (level < LZ4HC_CLEVEL_MIN) {
+        if (cdict != NULL || blockMode == LZ4F_blockLinked) {
+            /* In these cases, we will call LZ4_compress_fast_continue(),
+             * which needs an already reset context. Otherwise, we'll call a
+             * one-shot API. The non-continued APIs internally perform their own
+             * resets at the beginning of their calls, where they know what
+             * tableType they need the context to be in. So in that case this
+             * would be misguided / wasted work. */
+            LZ4_resetStream_fast((LZ4_stream_t*)ctx);
+        }
+        LZ4_attach_dictionary((LZ4_stream_t *)ctx, cdict ? cdict->fastCtx : NULL);
+    } else {
+        LZ4_resetStreamHC_fast((LZ4_streamHC_t*)ctx, level);
+        LZ4_attach_HC_dictionary((LZ4_streamHC_t *)ctx, cdict ? cdict->HCCtx : NULL);
+    }
+}
+
+
+/*! LZ4F_compressBegin_usingCDict() :
+ *  init streaming compression and writes frame header into dstBuffer.
+ *  dstBuffer must be >= LZ4F_HEADER_SIZE_MAX bytes.
  * @return : number of bytes written into dstBuffer for the header
  *           or an error code (can be tested using LZ4F_isError())
  */
-size_t LZ4F_compressBegin_usingCDict(LZ4F_cctx* cctxPtr, 
-                          void* dstBuffer, size_t dstCapacity, 
-                          const LZ4F_CDict* cdict, 
-                          const LZ4F_preferences_t* preferencesPtr) 
+size_t LZ4F_compressBegin_usingCDict(LZ4F_cctx* cctxPtr,
+                          void* dstBuffer, size_t dstCapacity,
+                          const LZ4F_CDict* cdict,
+                          const LZ4F_preferences_t* preferencesPtr)
 {
     LZ4F_preferences_t prefNull;
     BYTE* const dstStart = (BYTE*)dstBuffer;
@@ -606,66 +606,66 @@ size_t LZ4F_compressBegin_usingCDict(LZ4F_cctx* cctxPtr,
     BYTE* headerStart;
 
     if (dstCapacity < maxFHSize) return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
-    MEM_INIT(&prefNull, 0, sizeof(prefNull)); 
+    MEM_INIT(&prefNull, 0, sizeof(prefNull));
     if (preferencesPtr == NULL) preferencesPtr = &prefNull;
     cctxPtr->prefs = *preferencesPtr;
 
-    /* Ctx Management */ 
-    {   U16 const ctxTypeID = (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) ? 1 : 2; 
-        if (cctxPtr->lz4CtxAlloc < ctxTypeID) { 
+    /* Ctx Management */
+    {   U16 const ctxTypeID = (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) ? 1 : 2;
+        if (cctxPtr->lz4CtxAlloc < ctxTypeID) {
             FREEMEM(cctxPtr->lz4CtxPtr);
-            if (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) { 
-                cctxPtr->lz4CtxPtr = LZ4_createStream(); 
-            } else { 
-                cctxPtr->lz4CtxPtr = LZ4_createStreamHC(); 
-            } 
-            if (cctxPtr->lz4CtxPtr == NULL) 
-                return err0r(LZ4F_ERROR_allocation_failed); 
-            cctxPtr->lz4CtxAlloc = ctxTypeID; 
-            cctxPtr->lz4CtxState = ctxTypeID; 
-        } else if (cctxPtr->lz4CtxState != ctxTypeID) { 
-            /* otherwise, a sufficient buffer is allocated, but we need to 
-             * reset it to the correct context type */ 
-            if (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) { 
-                LZ4_initStream((LZ4_stream_t *) cctxPtr->lz4CtxPtr, sizeof (LZ4_stream_t)); 
-            } else { 
-                LZ4_initStreamHC((LZ4_streamHC_t *) cctxPtr->lz4CtxPtr, sizeof(LZ4_streamHC_t)); 
-                LZ4_setCompressionLevel((LZ4_streamHC_t *) cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel); 
-            } 
-            cctxPtr->lz4CtxState = ctxTypeID; 
+            if (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) {
+                cctxPtr->lz4CtxPtr = LZ4_createStream();
+            } else {
+                cctxPtr->lz4CtxPtr = LZ4_createStreamHC();
+            }
+            if (cctxPtr->lz4CtxPtr == NULL)
+                return err0r(LZ4F_ERROR_allocation_failed);
+            cctxPtr->lz4CtxAlloc = ctxTypeID;
+            cctxPtr->lz4CtxState = ctxTypeID;
+        } else if (cctxPtr->lz4CtxState != ctxTypeID) {
+            /* otherwise, a sufficient buffer is allocated, but we need to
+             * reset it to the correct context type */
+            if (cctxPtr->prefs.compressionLevel < LZ4HC_CLEVEL_MIN) {
+                LZ4_initStream((LZ4_stream_t *) cctxPtr->lz4CtxPtr, sizeof (LZ4_stream_t));
+            } else {
+                LZ4_initStreamHC((LZ4_streamHC_t *) cctxPtr->lz4CtxPtr, sizeof(LZ4_streamHC_t));
+                LZ4_setCompressionLevel((LZ4_streamHC_t *) cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel);
+            }
+            cctxPtr->lz4CtxState = ctxTypeID;
         }
     }
 
     /* Buffer Management */
-    if (cctxPtr->prefs.frameInfo.blockSizeID == 0) 
-        cctxPtr->prefs.frameInfo.blockSizeID = LZ4F_BLOCKSIZEID_DEFAULT; 
+    if (cctxPtr->prefs.frameInfo.blockSizeID == 0)
+        cctxPtr->prefs.frameInfo.blockSizeID = LZ4F_BLOCKSIZEID_DEFAULT;
     cctxPtr->maxBlockSize = LZ4F_getBlockSize(cctxPtr->prefs.frameInfo.blockSizeID);
 
-    {   size_t const requiredBuffSize = preferencesPtr->autoFlush ? 
-                ((cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) ? 64 KB : 0) :  /* only needs past data up to window size */ 
-                cctxPtr->maxBlockSize + ((cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) ? 128 KB : 0); 
-
-        if (cctxPtr->maxBufferSize < requiredBuffSize) { 
-            cctxPtr->maxBufferSize = 0; 
-            FREEMEM(cctxPtr->tmpBuff); 
-            cctxPtr->tmpBuff = (BYTE*)ALLOC_AND_ZERO(requiredBuffSize); 
-            if (cctxPtr->tmpBuff == NULL) return err0r(LZ4F_ERROR_allocation_failed); 
-            cctxPtr->maxBufferSize = requiredBuffSize; 
-    }   } 
+    {   size_t const requiredBuffSize = preferencesPtr->autoFlush ?
+                ((cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) ? 64 KB : 0) :  /* only needs past data up to window size */
+                cctxPtr->maxBlockSize + ((cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) ? 128 KB : 0);
+
+        if (cctxPtr->maxBufferSize < requiredBuffSize) {
+            cctxPtr->maxBufferSize = 0;
+            FREEMEM(cctxPtr->tmpBuff);
+            cctxPtr->tmpBuff = (BYTE*)ALLOC_AND_ZERO(requiredBuffSize);
+            if (cctxPtr->tmpBuff == NULL) return err0r(LZ4F_ERROR_allocation_failed);
+            cctxPtr->maxBufferSize = requiredBuffSize;
+    }   }
     cctxPtr->tmpIn = cctxPtr->tmpBuff;
     cctxPtr->tmpInSize = 0;
-    (void)XXH32_reset(&(cctxPtr->xxh), 0); 
-
-    /* context init */ 
-    cctxPtr->cdict = cdict; 
-    if (cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) { 
-        /* frame init only for blockLinked : blockIndependent will be init at each block */ 
-        LZ4F_initStream(cctxPtr->lz4CtxPtr, cdict, cctxPtr->prefs.compressionLevel, LZ4F_blockLinked); 
-    } 
-    if (preferencesPtr->compressionLevel >= LZ4HC_CLEVEL_MIN) { 
-        LZ4_favorDecompressionSpeed((LZ4_streamHC_t*)cctxPtr->lz4CtxPtr, (int)preferencesPtr->favorDecSpeed); 
-    } 
- 
+    (void)XXH32_reset(&(cctxPtr->xxh), 0);
+
+    /* context init */
+    cctxPtr->cdict = cdict;
+    if (cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) {
+        /* frame init only for blockLinked : blockIndependent will be init at each block */
+        LZ4F_initStream(cctxPtr->lz4CtxPtr, cdict, cctxPtr->prefs.compressionLevel, LZ4F_blockLinked);
+    }
+    if (preferencesPtr->compressionLevel >= LZ4HC_CLEVEL_MIN) {
+        LZ4_favorDecompressionSpeed((LZ4_streamHC_t*)cctxPtr->lz4CtxPtr, (int)preferencesPtr->favorDecSpeed);
+    }
+
     /* Magic Number */
     LZ4F_writeLE32(dstPtr, LZ4F_MAGICNUMBER);
     dstPtr += 4;
@@ -673,11 +673,11 @@ size_t LZ4F_compressBegin_usingCDict(LZ4F_cctx* cctxPtr,
 
     /* FLG Byte */
     *dstPtr++ = (BYTE)(((1 & _2BITS) << 6)    /* Version('01') */
-        + ((cctxPtr->prefs.frameInfo.blockMode & _1BIT ) << 5) 
-        + ((cctxPtr->prefs.frameInfo.blockChecksumFlag & _1BIT ) << 4) 
-        + ((unsigned)(cctxPtr->prefs.frameInfo.contentSize > 0) << 3) 
-        + ((cctxPtr->prefs.frameInfo.contentChecksumFlag & _1BIT ) << 2) 
-        +  (cctxPtr->prefs.frameInfo.dictID > 0) ); 
+        + ((cctxPtr->prefs.frameInfo.blockMode & _1BIT ) << 5)
+        + ((cctxPtr->prefs.frameInfo.blockChecksumFlag & _1BIT ) << 4)
+        + ((unsigned)(cctxPtr->prefs.frameInfo.contentSize > 0) << 3)
+        + ((cctxPtr->prefs.frameInfo.contentChecksumFlag & _1BIT ) << 2)
+        +  (cctxPtr->prefs.frameInfo.dictID > 0) );
     /* BD Byte */
     *dstPtr++ = (BYTE)((cctxPtr->prefs.frameInfo.blockSizeID & _3BITS) << 4);
     /* Optional Frame content size field */
@@ -686,40 +686,40 @@ size_t LZ4F_compressBegin_usingCDict(LZ4F_cctx* cctxPtr,
         dstPtr += 8;
         cctxPtr->totalInSize = 0;
     }
-    /* Optional dictionary ID field */ 
-    if (cctxPtr->prefs.frameInfo.dictID) { 
-        LZ4F_writeLE32(dstPtr, cctxPtr->prefs.frameInfo.dictID); 
-        dstPtr += 4; 
-    } 
-    /* Header CRC Byte */ 
-    *dstPtr = LZ4F_headerChecksum(headerStart, (size_t)(dstPtr - headerStart)); 
+    /* Optional dictionary ID field */
+    if (cctxPtr->prefs.frameInfo.dictID) {
+        LZ4F_writeLE32(dstPtr, cctxPtr->prefs.frameInfo.dictID);
+        dstPtr += 4;
+    }
+    /* Header CRC Byte */
+    *dstPtr = LZ4F_headerChecksum(headerStart, (size_t)(dstPtr - headerStart));
     dstPtr++;
 
     cctxPtr->cStage = 1;   /* header written, now request input data block */
-    return (size_t)(dstPtr - dstStart); 
-} 
-
- 
-/*! LZ4F_compressBegin() : 
- *  init streaming compression and writes frame header into dstBuffer. 
- *  dstBuffer must be >= LZ4F_HEADER_SIZE_MAX bytes. 
- *  preferencesPtr can be NULL, in which case default parameters are selected. 
- * @return : number of bytes written into dstBuffer for the header 
- *        or an error code (can be tested using LZ4F_isError()) 
- */ 
-size_t LZ4F_compressBegin(LZ4F_cctx* cctxPtr, 
-                          void* dstBuffer, size_t dstCapacity, 
-                          const LZ4F_preferences_t* preferencesPtr) 
-{ 
-    return LZ4F_compressBegin_usingCDict(cctxPtr, dstBuffer, dstCapacity, 
-                                         NULL, preferencesPtr); 
+    return (size_t)(dstPtr - dstStart);
 }
 
 
-/*  LZ4F_compressBound() : 
- * @return minimum capacity of dstBuffer for a given srcSize to handle worst case scenario. 
- *  LZ4F_preferences_t structure is optional : if NULL, preferences will be set to cover worst case scenario. 
- *  This function cannot fail. 
+/*! LZ4F_compressBegin() :
+ *  init streaming compression and writes frame header into dstBuffer.
+ *  dstBuffer must be >= LZ4F_HEADER_SIZE_MAX bytes.
+ *  preferencesPtr can be NULL, in which case default parameters are selected.
+ * @return : number of bytes written into dstBuffer for the header
+ *        or an error code (can be tested using LZ4F_isError())
+ */
+size_t LZ4F_compressBegin(LZ4F_cctx* cctxPtr,
+                          void* dstBuffer, size_t dstCapacity,
+                          const LZ4F_preferences_t* preferencesPtr)
+{
+    return LZ4F_compressBegin_usingCDict(cctxPtr, dstBuffer, dstCapacity,
+                                         NULL, preferencesPtr);
+}
+
+
+/*  LZ4F_compressBound() :
+ * @return minimum capacity of dstBuffer for a given srcSize to handle worst case scenario.
+ *  LZ4F_preferences_t structure is optional : if NULL, preferences will be set to cover worst case scenario.
+ *  This function cannot fail.
  */
 size_t LZ4F_compressBound(size_t srcSize, const LZ4F_preferences_t* preferencesPtr)
 {
@@ -730,80 +730,80 @@ size_t LZ4F_compressBound(size_t srcSize, const LZ4F_preferences_t* preferencesP
 }
 
 
-typedef int (*compressFunc_t)(void* ctx, const char* src, char* dst, int srcSize, int dstSize, int level, const LZ4F_CDict* cdict); 
+typedef int (*compressFunc_t)(void* ctx, const char* src, char* dst, int srcSize, int dstSize, int level, const LZ4F_CDict* cdict);
+
 
- 
-/*! LZ4F_makeBlock(): 
- *  compress a single block, add header and optional checksum. 
- *  assumption : dst buffer capacity is >= BHSize + srcSize + crcSize 
- */ 
-static size_t LZ4F_makeBlock(void* dst, 
-                       const void* src, size_t srcSize, 
-                             compressFunc_t compress, void* lz4ctx, int level, 
-                       const LZ4F_CDict* cdict, 
-                             LZ4F_blockChecksum_t crcFlag) 
+/*! LZ4F_makeBlock():
+ *  compress a single block, add header and optional checksum.
+ *  assumption : dst buffer capacity is >= BHSize + srcSize + crcSize
+ */
+static size_t LZ4F_makeBlock(void* dst,
+                       const void* src, size_t srcSize,
+                             compressFunc_t compress, void* lz4ctx, int level,
+                       const LZ4F_CDict* cdict,
+                             LZ4F_blockChecksum_t crcFlag)
 {
     BYTE* const cSizePtr = (BYTE*)dst;
-    U32 cSize = (U32)compress(lz4ctx, (const char*)src, (char*)(cSizePtr+BHSize), 
-                                      (int)(srcSize), (int)(srcSize-1), 
-                                      level, cdict); 
+    U32 cSize = (U32)compress(lz4ctx, (const char*)src, (char*)(cSizePtr+BHSize),
+                                      (int)(srcSize), (int)(srcSize-1),
+                                      level, cdict);
     if (cSize == 0) {  /* compression failed */
         DEBUGLOG(5, "LZ4F_makeBlock: compression failed, creating a raw block (size %u)", (U32)srcSize);
         cSize = (U32)srcSize;
         LZ4F_writeLE32(cSizePtr, cSize | LZ4F_BLOCKUNCOMPRESSED_FLAG);
-        memcpy(cSizePtr+BHSize, src, srcSize); 
-    } else { 
-        LZ4F_writeLE32(cSizePtr, cSize); 
+        memcpy(cSizePtr+BHSize, src, srcSize);
+    } else {
+        LZ4F_writeLE32(cSizePtr, cSize);
+    }
+    if (crcFlag) {
+        U32 const crc32 = XXH32(cSizePtr+BHSize, cSize, 0);  /* checksum of compressed data */
+        LZ4F_writeLE32(cSizePtr+BHSize+cSize, crc32);
     }
-    if (crcFlag) { 
-        U32 const crc32 = XXH32(cSizePtr+BHSize, cSize, 0);  /* checksum of compressed data */ 
-        LZ4F_writeLE32(cSizePtr+BHSize+cSize, crc32); 
-    } 
-    return BHSize + cSize + ((U32)crcFlag)*BFSize; 
+    return BHSize + cSize + ((U32)crcFlag)*BFSize;
 }
 
 
-static int LZ4F_compressBlock(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict) 
+static int LZ4F_compressBlock(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict)
+{
+    int const acceleration = (level < 0) ? -level + 1 : 1;
+    LZ4F_initStream(ctx, cdict, level, LZ4F_blockIndependent);
+    if (cdict) {
+        return LZ4_compress_fast_continue((LZ4_stream_t*)ctx, src, dst, srcSize, dstCapacity, acceleration);
+    } else {
+        return LZ4_compress_fast_extState_fastReset(ctx, src, dst, srcSize, dstCapacity, acceleration);
+    }
+}
+
+static int LZ4F_compressBlock_continue(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict)
 {
-    int const acceleration = (level < 0) ? -level + 1 : 1; 
-    LZ4F_initStream(ctx, cdict, level, LZ4F_blockIndependent); 
-    if (cdict) { 
-        return LZ4_compress_fast_continue((LZ4_stream_t*)ctx, src, dst, srcSize, dstCapacity, acceleration); 
-    } else { 
-        return LZ4_compress_fast_extState_fastReset(ctx, src, dst, srcSize, dstCapacity, acceleration); 
-    } 
+    int const acceleration = (level < 0) ? -level + 1 : 1;
+    (void)cdict; /* init once at beginning of frame */
+    return LZ4_compress_fast_continue((LZ4_stream_t*)ctx, src, dst, srcSize, dstCapacity, acceleration);
 }
 
-static int LZ4F_compressBlock_continue(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict) 
+static int LZ4F_compressBlockHC(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict)
 {
-    int const acceleration = (level < 0) ? -level + 1 : 1; 
-    (void)cdict; /* init once at beginning of frame */ 
-    return LZ4_compress_fast_continue((LZ4_stream_t*)ctx, src, dst, srcSize, dstCapacity, acceleration); 
+    LZ4F_initStream(ctx, cdict, level, LZ4F_blockIndependent);
+    if (cdict) {
+        return LZ4_compress_HC_continue((LZ4_streamHC_t*)ctx, src, dst, srcSize, dstCapacity);
+    }
+    return LZ4_compress_HC_extStateHC_fastReset(ctx, src, dst, srcSize, dstCapacity, level);
 }
 
-static int LZ4F_compressBlockHC(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict) 
+static int LZ4F_compressBlockHC_continue(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict)
 {
-    LZ4F_initStream(ctx, cdict, level, LZ4F_blockIndependent); 
-    if (cdict) { 
-        return LZ4_compress_HC_continue((LZ4_streamHC_t*)ctx, src, dst, srcSize, dstCapacity); 
-    } 
-    return LZ4_compress_HC_extStateHC_fastReset(ctx, src, dst, srcSize, dstCapacity, level); 
+    (void)level; (void)cdict; /* init once at beginning of frame */
+    return LZ4_compress_HC_continue((LZ4_streamHC_t*)ctx, src, dst, srcSize, dstCapacity);
 }
 
-static int LZ4F_compressBlockHC_continue(void* ctx, const char* src, char* dst, int srcSize, int dstCapacity, int level, const LZ4F_CDict* cdict) 
-{ 
-    (void)level; (void)cdict; /* init once at beginning of frame */ 
-    return LZ4_compress_HC_continue((LZ4_streamHC_t*)ctx, src, dst, srcSize, dstCapacity); 
-} 
- 
 static compressFunc_t LZ4F_selectCompression(LZ4F_blockMode_t blockMode, int level)
 {
     if (level < LZ4HC_CLEVEL_MIN) {
-        if (blockMode == LZ4F_blockIndependent) return LZ4F_compressBlock; 
-        return LZ4F_compressBlock_continue; 
+        if (blockMode == LZ4F_blockIndependent) return LZ4F_compressBlock;
+        return LZ4F_compressBlock_continue;
     }
-    if (blockMode == LZ4F_blockIndependent) return LZ4F_compressBlockHC; 
-    return LZ4F_compressBlockHC_continue; 
+    if (blockMode == LZ4F_blockIndependent) return LZ4F_compressBlockHC;
+    return LZ4F_compressBlockHC_continue;
 }
 
 static int LZ4F_localSaveDict(LZ4F_cctx_t* cctxPtr)
@@ -816,16 +816,16 @@ static int LZ4F_localSaveDict(LZ4F_cctx_t* cctxPtr)
 typedef enum { notDone, fromTmpBuffer, fromSrcBuffer } LZ4F_lastBlockStatus;
 
 /*! LZ4F_compressUpdate() :
- *  LZ4F_compressUpdate() can be called repetitively to compress as much data as necessary. 
- *  dstBuffer MUST be >= LZ4F_compressBound(srcSize, preferencesPtr). 
- *  LZ4F_compressOptions_t structure is optional : you can provide NULL as argument. 
- * @return : the number of bytes written into dstBuffer. It can be zero, meaning input data was just buffered. 
- *           or an error code if it fails (which can be tested using LZ4F_isError()) 
- */ 
-size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr, 
-                           void* dstBuffer, size_t dstCapacity, 
-                     const void* srcBuffer, size_t srcSize, 
-                     const LZ4F_compressOptions_t* compressOptionsPtr) 
+ *  LZ4F_compressUpdate() can be called repetitively to compress as much data as necessary.
+ *  dstBuffer MUST be >= LZ4F_compressBound(srcSize, preferencesPtr).
+ *  LZ4F_compressOptions_t structure is optional : you can provide NULL as argument.
+ * @return : the number of bytes written into dstBuffer. It can be zero, meaning input data was just buffered.
+ *           or an error code if it fails (which can be tested using LZ4F_isError())
+ */
+size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
+                           void* dstBuffer, size_t dstCapacity,
+                     const void* srcBuffer, size_t srcSize,
+                     const LZ4F_compressOptions_t* compressOptionsPtr)
 {
     LZ4F_compressOptions_t cOptionsNull;
     size_t const blockSize = cctxPtr->maxBlockSize;
@@ -836,12 +836,12 @@ size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
     LZ4F_lastBlockStatus lastBlockCompressed = notDone;
     compressFunc_t const compress = LZ4F_selectCompression(cctxPtr->prefs.frameInfo.blockMode, cctxPtr->prefs.compressionLevel);
 
-    DEBUGLOG(4, "LZ4F_compressUpdate (srcSize=%zu)", srcSize); 
+    DEBUGLOG(4, "LZ4F_compressUpdate (srcSize=%zu)", srcSize);
 
     if (cctxPtr->cStage != 1) return err0r(LZ4F_ERROR_GENERIC);
-    if (dstCapacity < LZ4F_compressBound_internal(srcSize, &(cctxPtr->prefs), cctxPtr->tmpInSize)) 
-        return err0r(LZ4F_ERROR_dstMaxSize_tooSmall); 
-    MEM_INIT(&cOptionsNull, 0, sizeof(cOptionsNull)); 
+    if (dstCapacity < LZ4F_compressBound_internal(srcSize, &(cctxPtr->prefs), cctxPtr->tmpInSize))
+        return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
+    MEM_INIT(&cOptionsNull, 0, sizeof(cOptionsNull));
     if (compressOptionsPtr == NULL) compressOptionsPtr = &cOptionsNull;
 
     /* complete tmp buffer */
@@ -859,11 +859,11 @@ size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
             memcpy(cctxPtr->tmpIn + cctxPtr->tmpInSize, srcBuffer, sizeToCopy);
             srcPtr += sizeToCopy;
 
-            dstPtr += LZ4F_makeBlock(dstPtr, 
-                                     cctxPtr->tmpIn, blockSize, 
-                                     compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel, 
-                                     cctxPtr->cdict, 
-                                     cctxPtr->prefs.frameInfo.blockChecksumFlag); 
+            dstPtr += LZ4F_makeBlock(dstPtr,
+                                     cctxPtr->tmpIn, blockSize,
+                                     compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel,
+                                     cctxPtr->cdict,
+                                     cctxPtr->prefs.frameInfo.blockChecksumFlag);
 
             if (cctxPtr->prefs.frameInfo.blockMode==LZ4F_blockLinked) cctxPtr->tmpIn += blockSize;
             cctxPtr->tmpInSize = 0;
@@ -871,24 +871,24 @@ size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
     }
 
     while ((size_t)(srcEnd - srcPtr) >= blockSize) {
-        /* compress full blocks */ 
+        /* compress full blocks */
         lastBlockCompressed = fromSrcBuffer;
-        dstPtr += LZ4F_makeBlock(dstPtr, 
-                                 srcPtr, blockSize, 
-                                 compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel, 
-                                 cctxPtr->cdict, 
-                                 cctxPtr->prefs.frameInfo.blockChecksumFlag); 
+        dstPtr += LZ4F_makeBlock(dstPtr,
+                                 srcPtr, blockSize,
+                                 compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel,
+                                 cctxPtr->cdict,
+                                 cctxPtr->prefs.frameInfo.blockChecksumFlag);
         srcPtr += blockSize;
     }
 
     if ((cctxPtr->prefs.autoFlush) && (srcPtr < srcEnd)) {
         /* compress remaining input < blockSize */
         lastBlockCompressed = fromSrcBuffer;
-        dstPtr += LZ4F_makeBlock(dstPtr, 
-                                 srcPtr, (size_t)(srcEnd - srcPtr), 
-                                 compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel, 
-                                 cctxPtr->cdict, 
-                                 cctxPtr->prefs.frameInfo.blockChecksumFlag); 
+        dstPtr += LZ4F_makeBlock(dstPtr,
+                                 srcPtr, (size_t)(srcEnd - srcPtr),
+                                 compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel,
+                                 cctxPtr->cdict,
+                                 cctxPtr->prefs.frameInfo.blockChecksumFlag);
         srcPtr  = srcEnd;
     }
 
@@ -897,7 +897,7 @@ size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
         if (compressOptionsPtr->stableSrc) {
             cctxPtr->tmpIn = cctxPtr->tmpBuff;
         } else {
-            int const realDictSize = LZ4F_localSaveDict(cctxPtr); 
+            int const realDictSize = LZ4F_localSaveDict(cctxPtr);
             if (realDictSize==0) return err0r(LZ4F_ERROR_GENERIC);
             cctxPtr->tmpIn = cctxPtr->tmpBuff + realDictSize;
         }
@@ -907,37 +907,37 @@ size_t LZ4F_compressUpdate(LZ4F_cctx* cctxPtr,
     if ((cctxPtr->tmpIn + blockSize) > (cctxPtr->tmpBuff + cctxPtr->maxBufferSize)   /* necessarily LZ4F_blockLinked && lastBlockCompressed==fromTmpBuffer */
         && !(cctxPtr->prefs.autoFlush))
     {
-        int const realDictSize = LZ4F_localSaveDict(cctxPtr); 
+        int const realDictSize = LZ4F_localSaveDict(cctxPtr);
         cctxPtr->tmpIn = cctxPtr->tmpBuff + realDictSize;
     }
 
     /* some input data left, necessarily < blockSize */
     if (srcPtr < srcEnd) {
         /* fill tmp buffer */
-        size_t const sizeToCopy = (size_t)(srcEnd - srcPtr); 
+        size_t const sizeToCopy = (size_t)(srcEnd - srcPtr);
         memcpy(cctxPtr->tmpIn, srcPtr, sizeToCopy);
         cctxPtr->tmpInSize = sizeToCopy;
     }
 
     if (cctxPtr->prefs.frameInfo.contentChecksumFlag == LZ4F_contentChecksumEnabled)
-        (void)XXH32_update(&(cctxPtr->xxh), srcBuffer, srcSize); 
+        (void)XXH32_update(&(cctxPtr->xxh), srcBuffer, srcSize);
 
     cctxPtr->totalInSize += srcSize;
-    return (size_t)(dstPtr - dstStart); 
+    return (size_t)(dstPtr - dstStart);
 }
 
 
 /*! LZ4F_flush() :
- *  When compressed data must be sent immediately, without waiting for a block to be filled, 
- *  invoke LZ4_flush(), which will immediately compress any remaining data stored within LZ4F_cctx. 
- *  The result of the function is the number of bytes written into dstBuffer. 
- *  It can be zero, this means there was no data left within LZ4F_cctx. 
- *  The function outputs an error code if it fails (can be tested using LZ4F_isError()) 
- *  LZ4F_compressOptions_t* is optional. NULL is a valid argument. 
- */ 
-size_t LZ4F_flush(LZ4F_cctx* cctxPtr, 
-                  void* dstBuffer, size_t dstCapacity, 
-            const LZ4F_compressOptions_t* compressOptionsPtr) 
+ *  When compressed data must be sent immediately, without waiting for a block to be filled,
+ *  invoke LZ4_flush(), which will immediately compress any remaining data stored within LZ4F_cctx.
+ *  The result of the function is the number of bytes written into dstBuffer.
+ *  It can be zero, this means there was no data left within LZ4F_cctx.
+ *  The function outputs an error code if it fails (can be tested using LZ4F_isError())
+ *  LZ4F_compressOptions_t* is optional. NULL is a valid argument.
+ */
+size_t LZ4F_flush(LZ4F_cctx* cctxPtr,
+                  void* dstBuffer, size_t dstCapacity,
+            const LZ4F_compressOptions_t* compressOptionsPtr)
 {
     BYTE* const dstStart = (BYTE*)dstBuffer;
     BYTE* dstPtr = dstStart;
@@ -945,66 +945,66 @@ size_t LZ4F_flush(LZ4F_cctx* cctxPtr,
 
     if (cctxPtr->tmpInSize == 0) return 0;   /* nothing to flush */
     if (cctxPtr->cStage != 1) return err0r(LZ4F_ERROR_GENERIC);
-    if (dstCapacity < (cctxPtr->tmpInSize + BHSize + BFSize)) 
-        return err0r(LZ4F_ERROR_dstMaxSize_tooSmall); 
+    if (dstCapacity < (cctxPtr->tmpInSize + BHSize + BFSize))
+        return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
     (void)compressOptionsPtr;   /* not yet useful */
 
     /* select compression function */
     compress = LZ4F_selectCompression(cctxPtr->prefs.frameInfo.blockMode, cctxPtr->prefs.compressionLevel);
 
     /* compress tmp buffer */
-    dstPtr += LZ4F_makeBlock(dstPtr, 
-                             cctxPtr->tmpIn, cctxPtr->tmpInSize, 
-                             compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel, 
-                             cctxPtr->cdict, 
-                             cctxPtr->prefs.frameInfo.blockChecksumFlag); 
-    assert(((void)"flush overflows dstBuffer!", (size_t)(dstPtr - dstStart) <= dstCapacity)); 
- 
-    if (cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked) 
-        cctxPtr->tmpIn += cctxPtr->tmpInSize; 
+    dstPtr += LZ4F_makeBlock(dstPtr,
+                             cctxPtr->tmpIn, cctxPtr->tmpInSize,
+                             compress, cctxPtr->lz4CtxPtr, cctxPtr->prefs.compressionLevel,
+                             cctxPtr->cdict,
+                             cctxPtr->prefs.frameInfo.blockChecksumFlag);
+    assert(((void)"flush overflows dstBuffer!", (size_t)(dstPtr - dstStart) <= dstCapacity));
+
+    if (cctxPtr->prefs.frameInfo.blockMode == LZ4F_blockLinked)
+        cctxPtr->tmpIn += cctxPtr->tmpInSize;
     cctxPtr->tmpInSize = 0;
 
     /* keep tmpIn within limits */
     if ((cctxPtr->tmpIn + cctxPtr->maxBlockSize) > (cctxPtr->tmpBuff + cctxPtr->maxBufferSize)) {  /* necessarily LZ4F_blockLinked */
-        int const realDictSize = LZ4F_localSaveDict(cctxPtr); 
+        int const realDictSize = LZ4F_localSaveDict(cctxPtr);
         cctxPtr->tmpIn = cctxPtr->tmpBuff + realDictSize;
     }
 
-    return (size_t)(dstPtr - dstStart); 
+    return (size_t)(dstPtr - dstStart);
 }
 
 
 /*! LZ4F_compressEnd() :
- *  When you want to properly finish the compressed frame, just call LZ4F_compressEnd(). 
- *  It will flush whatever data remained within compressionContext (like LZ4_flush()) 
- *  but also properly finalize the frame, with an endMark and an (optional) checksum. 
- *  LZ4F_compressOptions_t structure is optional : you can provide NULL as argument. 
- * @return: the number of bytes written into dstBuffer (necessarily >= 4 (endMark size)) 
- *       or an error code if it fails (can be tested using LZ4F_isError()) 
- *  The context can then be used again to compress a new frame, starting with LZ4F_compressBegin(). 
- */ 
-size_t LZ4F_compressEnd(LZ4F_cctx* cctxPtr, 
-                        void* dstBuffer, size_t dstCapacity, 
-                  const LZ4F_compressOptions_t* compressOptionsPtr) 
+ *  When you want to properly finish the compressed frame, just call LZ4F_compressEnd().
+ *  It will flush whatever data remained within compressionContext (like LZ4_flush())
+ *  but also properly finalize the frame, with an endMark and an (optional) checksum.
+ *  LZ4F_compressOptions_t structure is optional : you can provide NULL as argument.
+ * @return: the number of bytes written into dstBuffer (necessarily >= 4 (endMark size))
+ *       or an error code if it fails (can be tested using LZ4F_isError())
+ *  The context can then be used again to compress a new frame, starting with LZ4F_compressBegin().
+ */
+size_t LZ4F_compressEnd(LZ4F_cctx* cctxPtr,
+                        void* dstBuffer, size_t dstCapacity,
+                  const LZ4F_compressOptions_t* compressOptionsPtr)
 {
     BYTE* const dstStart = (BYTE*)dstBuffer;
     BYTE* dstPtr = dstStart;
 
-    size_t const flushSize = LZ4F_flush(cctxPtr, dstBuffer, dstCapacity, compressOptionsPtr); 
+    size_t const flushSize = LZ4F_flush(cctxPtr, dstBuffer, dstCapacity, compressOptionsPtr);
     DEBUGLOG(5,"LZ4F_compressEnd: dstCapacity=%u", (unsigned)dstCapacity);
     if (LZ4F_isError(flushSize)) return flushSize;
     dstPtr += flushSize;
 
-    assert(flushSize <= dstCapacity); 
-    dstCapacity -= flushSize; 
- 
-    if (dstCapacity < 4) return err0r(LZ4F_ERROR_dstMaxSize_tooSmall); 
+    assert(flushSize <= dstCapacity);
+    dstCapacity -= flushSize;
+
+    if (dstCapacity < 4) return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
     LZ4F_writeLE32(dstPtr, 0);
-    dstPtr += 4;   /* endMark */ 
+    dstPtr += 4;   /* endMark */
 
     if (cctxPtr->prefs.frameInfo.contentChecksumFlag == LZ4F_contentChecksumEnabled) {
         U32 const xxh = XXH32_digest(&(cctxPtr->xxh));
-        if (dstCapacity < 8) return err0r(LZ4F_ERROR_dstMaxSize_tooSmall); 
+        if (dstCapacity < 8) return err0r(LZ4F_ERROR_dstMaxSize_tooSmall);
         DEBUGLOG(5,"Writing 32-bit content checksum");
         LZ4F_writeLE32(dstPtr, xxh);
         dstPtr+=4;   /* content Checksum */
@@ -1018,7 +1018,7 @@ size_t LZ4F_compressEnd(LZ4F_cctx* cctxPtr,
             return err0r(LZ4F_ERROR_frameSize_wrong);
     }
 
-    return (size_t)(dstPtr - dstStart); 
+    return (size_t)(dstPtr - dstStart);
 }
 
 
@@ -1026,22 +1026,22 @@ size_t LZ4F_compressEnd(LZ4F_cctx* cctxPtr,
 *   Frame Decompression
 *****************************************************/
 
-typedef enum { 
-    dstage_getFrameHeader=0, dstage_storeFrameHeader, 
-    dstage_init, 
-    dstage_getBlockHeader, dstage_storeBlockHeader, 
-    dstage_copyDirect, dstage_getBlockChecksum, 
-    dstage_getCBlock, dstage_storeCBlock, 
-    dstage_flushOut, 
-    dstage_getSuffix, dstage_storeSuffix, 
-    dstage_getSFrameSize, dstage_storeSFrameSize, 
-    dstage_skipSkippable 
-} dStage_t; 
- 
+typedef enum {
+    dstage_getFrameHeader=0, dstage_storeFrameHeader,
+    dstage_init,
+    dstage_getBlockHeader, dstage_storeBlockHeader,
+    dstage_copyDirect, dstage_getBlockChecksum,
+    dstage_getCBlock, dstage_storeCBlock,
+    dstage_flushOut,
+    dstage_getSuffix, dstage_storeSuffix,
+    dstage_getSFrameSize, dstage_storeSFrameSize,
+    dstage_skipSkippable
+} dStage_t;
+
 struct LZ4F_dctx_s {
     LZ4F_frameInfo_t frameInfo;
     U32    version;
-    dStage_t dStage; 
+    dStage_t dStage;
     U64    frameRemainingSize;
     size_t maxBlockSize;
     size_t maxBufferSize;
@@ -1049,44 +1049,44 @@ struct LZ4F_dctx_s {
     size_t tmpInSize;
     size_t tmpInTarget;
     BYTE*  tmpOutBuffer;
-    const BYTE* dict; 
+    const BYTE* dict;
     size_t dictSize;
     BYTE*  tmpOut;
     size_t tmpOutSize;
     size_t tmpOutStart;
     XXH32_state_t xxh;
-    XXH32_state_t blockChecksum; 
-    BYTE   header[LZ4F_HEADER_SIZE_MAX]; 
+    XXH32_state_t blockChecksum;
+    BYTE   header[LZ4F_HEADER_SIZE_MAX];
 };  /* typedef'd to LZ4F_dctx in lz4frame.h */
 
 
 /*! LZ4F_createDecompressionContext() :
- *  Create a decompressionContext object, which will track all decompression operations. 
- *  Provides a pointer to a fully allocated and initialized LZ4F_decompressionContext object. 
- *  Object can later be released using LZ4F_freeDecompressionContext(). 
- * @return : if != 0, there was an error during context creation. 
- */ 
+ *  Create a decompressionContext object, which will track all decompression operations.
+ *  Provides a pointer to a fully allocated and initialized LZ4F_decompressionContext object.
+ *  Object can later be released using LZ4F_freeDecompressionContext().
+ * @return : if != 0, there was an error during context creation.
+ */
 LZ4F_errorCode_t LZ4F_createDecompressionContext(LZ4F_dctx** LZ4F_decompressionContextPtr, unsigned versionNumber)
 {
-    LZ4F_dctx* const dctx = (LZ4F_dctx*)ALLOC_AND_ZERO(sizeof(LZ4F_dctx)); 
+    LZ4F_dctx* const dctx = (LZ4F_dctx*)ALLOC_AND_ZERO(sizeof(LZ4F_dctx));
     if (dctx == NULL) {  /* failed allocation */
         *LZ4F_decompressionContextPtr = NULL;
         return err0r(LZ4F_ERROR_allocation_failed);
     }
 
-    dctx->version = versionNumber; 
-    *LZ4F_decompressionContextPtr = dctx; 
+    dctx->version = versionNumber;
+    *LZ4F_decompressionContextPtr = dctx;
     return LZ4F_OK_NoError;
 }
 
-LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx) 
+LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx)
 {
     LZ4F_errorCode_t result = LZ4F_OK_NoError;
-    if (dctx != NULL) {   /* can accept NULL input, like free() */ 
-      result = (LZ4F_errorCode_t)dctx->dStage; 
-      FREEMEM(dctx->tmpIn); 
-      FREEMEM(dctx->tmpOutBuffer); 
-      FREEMEM(dctx); 
+    if (dctx != NULL) {   /* can accept NULL input, like free() */
+      result = (LZ4F_errorCode_t)dctx->dStage;
+      FREEMEM(dctx->tmpIn);
+      FREEMEM(dctx->tmpOutBuffer);
+      FREEMEM(dctx);
     }
     return result;
 }
@@ -1094,43 +1094,43 @@ LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx)
 
 /*==---   Streaming Decompression operations   ---==*/
 
-void LZ4F_resetDecompressionContext(LZ4F_dctx* dctx) 
+void LZ4F_resetDecompressionContext(LZ4F_dctx* dctx)
 {
-    dctx->dStage = dstage_getFrameHeader; 
-    dctx->dict = NULL; 
-    dctx->dictSize = 0; 
+    dctx->dStage = dstage_getFrameHeader;
+    dctx->dict = NULL;
+    dctx->dictSize = 0;
 }
 
 
 /*! LZ4F_decodeHeader() :
- *  input   : `src` points at the **beginning of the frame** 
- *  output  : set internal values of dctx, such as 
- *            dctx->frameInfo and dctx->dStage. 
- *            Also allocates internal buffers. 
- *  @return : nb Bytes read from src (necessarily <= srcSize) 
- *            or an error code (testable with LZ4F_isError()) 
- */ 
-static size_t LZ4F_decodeHeader(LZ4F_dctx* dctx, const void* src, size_t srcSize) 
+ *  input   : `src` points at the **beginning of the frame**
+ *  output  : set internal values of dctx, such as
+ *            dctx->frameInfo and dctx->dStage.
+ *            Also allocates internal buffers.
+ *  @return : nb Bytes read from src (necessarily <= srcSize)
+ *            or an error code (testable with LZ4F_isError())
+ */
+static size_t LZ4F_decodeHeader(LZ4F_dctx* dctx, const void* src, size_t srcSize)
 {
-    unsigned blockMode, blockChecksumFlag, contentSizeFlag, contentChecksumFlag, dictIDFlag, blockSizeID; 
+    unsigned blockMode, blockChecksumFlag, contentSizeFlag, contentChecksumFlag, dictIDFlag, blockSizeID;
     size_t frameHeaderSize;
     const BYTE* srcPtr = (const BYTE*)src;
 
     DEBUGLOG(5, "LZ4F_decodeHeader");
     /* need to decode header to get frameInfo */
     if (srcSize < minFHSize) return err0r(LZ4F_ERROR_frameHeader_incomplete);   /* minimal frame header size */
-    MEM_INIT(&(dctx->frameInfo), 0, sizeof(dctx->frameInfo)); 
+    MEM_INIT(&(dctx->frameInfo), 0, sizeof(dctx->frameInfo));
 
     /* special case : skippable frames */
     if ((LZ4F_readLE32(srcPtr) & 0xFFFFFFF0U) == LZ4F_MAGIC_SKIPPABLE_START) {
-        dctx->frameInfo.frameType = LZ4F_skippableFrame; 
-        if (src == (void*)(dctx->header)) { 
-            dctx->tmpInSize = srcSize; 
-            dctx->tmpInTarget = 8; 
-            dctx->dStage = dstage_storeSFrameSize; 
+        dctx->frameInfo.frameType = LZ4F_skippableFrame;
+        if (src == (void*)(dctx->header)) {
+            dctx->tmpInSize = srcSize;
+            dctx->tmpInTarget = 8;
+            dctx->dStage = dstage_storeSFrameSize;
             return srcSize;
         } else {
-            dctx->dStage = dstage_getSFrameSize; 
+            dctx->dStage = dstage_getSFrameSize;
             return 4;
         }
     }
@@ -1139,162 +1139,162 @@ static size_t LZ4F_decodeHeader(LZ4F_dctx* dctx, const void* src, size_t srcSize
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
     if (LZ4F_readLE32(srcPtr) != LZ4F_MAGICNUMBER) {
         DEBUGLOG(4, "frame header error : unknown magic number");
-        return err0r(LZ4F_ERROR_frameType_unknown); 
+        return err0r(LZ4F_ERROR_frameType_unknown);
     }
 #endif
-    dctx->frameInfo.frameType = LZ4F_frame; 
+    dctx->frameInfo.frameType = LZ4F_frame;
 
     /* Flags */
-    {   U32 const FLG = srcPtr[4]; 
-        U32 const version = (FLG>>6) & _2BITS; 
-        blockChecksumFlag = (FLG>>4) & _1BIT; 
-        blockMode = (FLG>>5) & _1BIT; 
-        contentSizeFlag = (FLG>>3) & _1BIT; 
-        contentChecksumFlag = (FLG>>2) & _1BIT; 
-        dictIDFlag = FLG & _1BIT; 
-        /* validate */ 
-        if (((FLG>>1)&_1BIT) != 0) return err0r(LZ4F_ERROR_reservedFlag_set); /* Reserved bit */ 
-        if (version != 1) return err0r(LZ4F_ERROR_headerVersion_wrong);        /* Version Number, only supported value */ 
-    } 
+    {   U32 const FLG = srcPtr[4];
+        U32 const version = (FLG>>6) & _2BITS;
+        blockChecksumFlag = (FLG>>4) & _1BIT;
+        blockMode = (FLG>>5) & _1BIT;
+        contentSizeFlag = (FLG>>3) & _1BIT;
+        contentChecksumFlag = (FLG>>2) & _1BIT;
+        dictIDFlag = FLG & _1BIT;
+        /* validate */
+        if (((FLG>>1)&_1BIT) != 0) return err0r(LZ4F_ERROR_reservedFlag_set); /* Reserved bit */
+        if (version != 1) return err0r(LZ4F_ERROR_headerVersion_wrong);        /* Version Number, only supported value */
+    }
 
     /* Frame Header Size */
-    frameHeaderSize = minFHSize + (contentSizeFlag?8:0) + (dictIDFlag?4:0); 
+    frameHeaderSize = minFHSize + (contentSizeFlag?8:0) + (dictIDFlag?4:0);
 
     if (srcSize < frameHeaderSize) {
         /* not enough input to fully decode frame header */
-        if (srcPtr != dctx->header) 
-            memcpy(dctx->header, srcPtr, srcSize); 
-        dctx->tmpInSize = srcSize; 
-        dctx->tmpInTarget = frameHeaderSize; 
-        dctx->dStage = dstage_storeFrameHeader; 
+        if (srcPtr != dctx->header)
+            memcpy(dctx->header, srcPtr, srcSize);
+        dctx->tmpInSize = srcSize;
+        dctx->tmpInTarget = frameHeaderSize;
+        dctx->dStage = dstage_storeFrameHeader;
         return srcSize;
     }
 
-    {   U32 const BD = srcPtr[5]; 
-        blockSizeID = (BD>>4) & _3BITS; 
-        /* validate */ 
-        if (((BD>>7)&_1BIT) != 0) return err0r(LZ4F_ERROR_reservedFlag_set);   /* Reserved bit */ 
-        if (blockSizeID < 4) return err0r(LZ4F_ERROR_maxBlockSize_invalid);    /* 4-7 only supported values for the time being */ 
-        if (((BD>>0)&_4BITS) != 0) return err0r(LZ4F_ERROR_reservedFlag_set);  /* Reserved bits */ 
-    } 
+    {   U32 const BD = srcPtr[5];
+        blockSizeID = (BD>>4) & _3BITS;
+        /* validate */
+        if (((BD>>7)&_1BIT) != 0) return err0r(LZ4F_ERROR_reservedFlag_set);   /* Reserved bit */
+        if (blockSizeID < 4) return err0r(LZ4F_ERROR_maxBlockSize_invalid);    /* 4-7 only supported values for the time being */
+        if (((BD>>0)&_4BITS) != 0) return err0r(LZ4F_ERROR_reservedFlag_set);  /* Reserved bits */
+    }
 
     /* check header */
-    assert(frameHeaderSize > 5); 
+    assert(frameHeaderSize > 5);
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
-    {   BYTE const HC = LZ4F_headerChecksum(srcPtr+4, frameHeaderSize-5); 
-        if (HC != srcPtr[frameHeaderSize-1]) 
-            return err0r(LZ4F_ERROR_headerChecksum_invalid); 
-    } 
+    {   BYTE const HC = LZ4F_headerChecksum(srcPtr+4, frameHeaderSize-5);
+        if (HC != srcPtr[frameHeaderSize-1])
+            return err0r(LZ4F_ERROR_headerChecksum_invalid);
+    }
 #endif
 
     /* save */
-    dctx->frameInfo.blockMode = (LZ4F_blockMode_t)blockMode; 
-    dctx->frameInfo.blockChecksumFlag = (LZ4F_blockChecksum_t)blockChecksumFlag; 
-    dctx->frameInfo.contentChecksumFlag = (LZ4F_contentChecksum_t)contentChecksumFlag; 
-    dctx->frameInfo.blockSizeID = (LZ4F_blockSizeID_t)blockSizeID; 
-    dctx->maxBlockSize = LZ4F_getBlockSize(blockSizeID); 
+    dctx->frameInfo.blockMode = (LZ4F_blockMode_t)blockMode;
+    dctx->frameInfo.blockChecksumFlag = (LZ4F_blockChecksum_t)blockChecksumFlag;
+    dctx->frameInfo.contentChecksumFlag = (LZ4F_contentChecksum_t)contentChecksumFlag;
+    dctx->frameInfo.blockSizeID = (LZ4F_blockSizeID_t)blockSizeID;
+    dctx->maxBlockSize = LZ4F_getBlockSize(blockSizeID);
     if (contentSizeFlag)
-        dctx->frameRemainingSize = 
-            dctx->frameInfo.contentSize = LZ4F_readLE64(srcPtr+6); 
-    if (dictIDFlag) 
-        dctx->frameInfo.dictID = LZ4F_readLE32(srcPtr + frameHeaderSize - 5); 
-
-    dctx->dStage = dstage_init; 
-
-    return frameHeaderSize; 
-} 
-
-
-/*! LZ4F_headerSize() : 
- * @return : size of frame header 
- *           or an error code, which can be tested using LZ4F_isError() 
- */ 
-size_t LZ4F_headerSize(const void* src, size_t srcSize) 
-{ 
-    if (src == NULL) return err0r(LZ4F_ERROR_srcPtr_wrong); 
- 
-    /* minimal srcSize to determine header size */ 
-    if (srcSize < LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH) 
-        return err0r(LZ4F_ERROR_frameHeader_incomplete); 
- 
-    /* special case : skippable frames */ 
-    if ((LZ4F_readLE32(src) & 0xFFFFFFF0U) == LZ4F_MAGIC_SKIPPABLE_START) 
-        return 8; 
- 
-    /* control magic number */ 
+        dctx->frameRemainingSize =
+            dctx->frameInfo.contentSize = LZ4F_readLE64(srcPtr+6);
+    if (dictIDFlag)
+        dctx->frameInfo.dictID = LZ4F_readLE32(srcPtr + frameHeaderSize - 5);
+
+    dctx->dStage = dstage_init;
+
+    return frameHeaderSize;
+}
+
+
+/*! LZ4F_headerSize() :
+ * @return : size of frame header
+ *           or an error code, which can be tested using LZ4F_isError()
+ */
+size_t LZ4F_headerSize(const void* src, size_t srcSize)
+{
+    if (src == NULL) return err0r(LZ4F_ERROR_srcPtr_wrong);
+
+    /* minimal srcSize to determine header size */
+    if (srcSize < LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH)
+        return err0r(LZ4F_ERROR_frameHeader_incomplete);
+
+    /* special case : skippable frames */
+    if ((LZ4F_readLE32(src) & 0xFFFFFFF0U) == LZ4F_MAGIC_SKIPPABLE_START)
+        return 8;
+
+    /* control magic number */
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
-    if (LZ4F_readLE32(src) != LZ4F_MAGICNUMBER) 
-        return err0r(LZ4F_ERROR_frameType_unknown); 
+    if (LZ4F_readLE32(src) != LZ4F_MAGICNUMBER)
+        return err0r(LZ4F_ERROR_frameType_unknown);
 #endif
- 
-    /* Frame Header Size */ 
-    {   BYTE const FLG = ((const BYTE*)src)[4]; 
-        U32 const contentSizeFlag = (FLG>>3) & _1BIT; 
-        U32 const dictIDFlag = FLG & _1BIT; 
-        return minFHSize + (contentSizeFlag?8:0) + (dictIDFlag?4:0); 
-    } 
+
+    /* Frame Header Size */
+    {   BYTE const FLG = ((const BYTE*)src)[4];
+        U32 const contentSizeFlag = (FLG>>3) & _1BIT;
+        U32 const dictIDFlag = FLG & _1BIT;
+        return minFHSize + (contentSizeFlag?8:0) + (dictIDFlag?4:0);
+    }
 }
 
 /*! LZ4F_getFrameInfo() :
- *  This function extracts frame parameters (max blockSize, frame checksum, etc.). 
- *  Usage is optional. Objective is to provide relevant information for allocation purposes. 
- *  This function works in 2 situations : 
- *   - At the beginning of a new frame, in which case it will decode this information from `srcBuffer`, and start the decoding process. 
- *     Amount of input data provided must be large enough to successfully decode the frame header. 
- *     A header size is variable, but is guaranteed to be <= LZ4F_HEADER_SIZE_MAX bytes. It's possible to provide more input data than this minimum. 
- *   - After decoding has been started. In which case, no input is read, frame parameters are extracted from dctx. 
- *  The number of bytes consumed from srcBuffer will be updated within *srcSizePtr (necessarily <= original value). 
- *  Decompression must resume from (srcBuffer + *srcSizePtr). 
- * @return : an hint about how many srcSize bytes LZ4F_decompress() expects for next call, 
- *           or an error code which can be tested using LZ4F_isError() 
- *  note 1 : in case of error, dctx is not modified. Decoding operations can resume from where they stopped. 
- *  note 2 : frame parameters are *copied into* an already allocated LZ4F_frameInfo_t structure. 
- */ 
-LZ4F_errorCode_t LZ4F_getFrameInfo(LZ4F_dctx* dctx, 
-                                   LZ4F_frameInfo_t* frameInfoPtr, 
-                             const void* srcBuffer, size_t* srcSizePtr) 
+ *  This function extracts frame parameters (max blockSize, frame checksum, etc.).
+ *  Usage is optional. Objective is to provide relevant information for allocation purposes.
+ *  This function works in 2 situations :
+ *   - At the beginning of a new frame, in which case it will decode this information from `srcBuffer`, and start the decoding process.
+ *     Amount of input data provided must be large enough to successfully decode the frame header.
+ *     A header size is variable, but is guaranteed to be <= LZ4F_HEADER_SIZE_MAX bytes. It's possible to provide more input data than this minimum.
+ *   - After decoding has been started. In which case, no input is read, frame parameters are extracted from dctx.
+ *  The number of bytes consumed from srcBuffer will be updated within *srcSizePtr (necessarily <= original value).
+ *  Decompression must resume from (srcBuffer + *srcSizePtr).
+ * @return : an hint about how many srcSize bytes LZ4F_decompress() expects for next call,
+ *           or an error code which can be tested using LZ4F_isError()
+ *  note 1 : in case of error, dctx is not modified. Decoding operations can resume from where they stopped.
+ *  note 2 : frame parameters are *copied into* an already allocated LZ4F_frameInfo_t structure.
+ */
+LZ4F_errorCode_t LZ4F_getFrameInfo(LZ4F_dctx* dctx,
+                                   LZ4F_frameInfo_t* frameInfoPtr,
+                             const void* srcBuffer, size_t* srcSizePtr)
 {
-    LZ4F_STATIC_ASSERT(dstage_getFrameHeader < dstage_storeFrameHeader); 
-    if (dctx->dStage > dstage_storeFrameHeader) { 
+    LZ4F_STATIC_ASSERT(dstage_getFrameHeader < dstage_storeFrameHeader);
+    if (dctx->dStage > dstage_storeFrameHeader) {
         /* frameInfo already decoded */
         size_t o=0, i=0;
         *srcSizePtr = 0;
-        *frameInfoPtr = dctx->frameInfo; 
-        /* returns : recommended nb of bytes for LZ4F_decompress() */ 
-        return LZ4F_decompress(dctx, NULL, &o, NULL, &i, NULL); 
+        *frameInfoPtr = dctx->frameInfo;
+        /* returns : recommended nb of bytes for LZ4F_decompress() */
+        return LZ4F_decompress(dctx, NULL, &o, NULL, &i, NULL);
     } else {
-        if (dctx->dStage == dstage_storeFrameHeader) { 
-            /* frame decoding already started, in the middle of header => automatic fail */ 
-            *srcSizePtr = 0; 
-            return err0r(LZ4F_ERROR_frameDecoding_alreadyStarted); 
-        } else { 
-            size_t const hSize = LZ4F_headerSize(srcBuffer, *srcSizePtr); 
-            if (LZ4F_isError(hSize)) { *srcSizePtr=0; return hSize; } 
-            if (*srcSizePtr < hSize) { 
-                *srcSizePtr=0; 
-                return err0r(LZ4F_ERROR_frameHeader_incomplete); 
-            } 
-
-            {   size_t decodeResult = LZ4F_decodeHeader(dctx, srcBuffer, hSize); 
-                if (LZ4F_isError(decodeResult)) { 
-                    *srcSizePtr = 0; 
-                } else { 
-                    *srcSizePtr = decodeResult; 
-                    decodeResult = BHSize;   /* block header size */ 
-                } 
-                *frameInfoPtr = dctx->frameInfo; 
-                return decodeResult; 
-    }   }   } 
+        if (dctx->dStage == dstage_storeFrameHeader) {
+            /* frame decoding already started, in the middle of header => automatic fail */
+            *srcSizePtr = 0;
+            return err0r(LZ4F_ERROR_frameDecoding_alreadyStarted);
+        } else {
+            size_t const hSize = LZ4F_headerSize(srcBuffer, *srcSizePtr);
+            if (LZ4F_isError(hSize)) { *srcSizePtr=0; return hSize; }
+            if (*srcSizePtr < hSize) {
+                *srcSizePtr=0;
+                return err0r(LZ4F_ERROR_frameHeader_incomplete);
+            }
+
+            {   size_t decodeResult = LZ4F_decodeHeader(dctx, srcBuffer, hSize);
+                if (LZ4F_isError(decodeResult)) {
+                    *srcSizePtr = 0;
+                } else {
+                    *srcSizePtr = decodeResult;
+                    decodeResult = BHSize;   /* block header size */
+                }
+                *frameInfoPtr = dctx->frameInfo;
+                return decodeResult;
+    }   }   }
 }
 
 
-/* LZ4F_updateDict() : 
+/* LZ4F_updateDict() :
  * only used for LZ4F_blockLinked mode
  * Condition : dstPtr != NULL
  */
-static void LZ4F_updateDict(LZ4F_dctx* dctx, 
-                      const BYTE* dstPtr, size_t dstSize, const BYTE* dstBufferStart, 
-                      unsigned withinTmp) 
+static void LZ4F_updateDict(LZ4F_dctx* dctx,
+                      const BYTE* dstPtr, size_t dstSize, const BYTE* dstBufferStart,
+                      unsigned withinTmp)
 {
     assert(dstPtr != NULL);
     if (dctx->dictSize==0) {
@@ -1303,85 +1303,85 @@ static void LZ4F_updateDict(LZ4F_dctx* dctx,
     assert(dctx->dict != NULL);
 
     if (dctx->dict + dctx->dictSize == dstPtr) {  /* prefix mode, everything within dstBuffer */
-        dctx->dictSize += dstSize; 
+        dctx->dictSize += dstSize;
         return;
     }
 
-    assert(dstPtr >= dstBufferStart); 
-    if ((size_t)(dstPtr - dstBufferStart) + dstSize >= 64 KB) {  /* history in dstBuffer becomes large enough to become dictionary */ 
-        dctx->dict = (const BYTE*)dstBufferStart; 
-        dctx->dictSize = (size_t)(dstPtr - dstBufferStart) + dstSize; 
+    assert(dstPtr >= dstBufferStart);
+    if ((size_t)(dstPtr - dstBufferStart) + dstSize >= 64 KB) {  /* history in dstBuffer becomes large enough to become dictionary */
+        dctx->dict = (const BYTE*)dstBufferStart;
+        dctx->dictSize = (size_t)(dstPtr - dstBufferStart) + dstSize;
         return;
     }
 
-    assert(dstSize < 64 KB);   /* if dstSize >= 64 KB, dictionary would be set into dstBuffer directly */ 
- 
+    assert(dstSize < 64 KB);   /* if dstSize >= 64 KB, dictionary would be set into dstBuffer directly */
+
     /* dstBuffer does not contain whole useful history (64 KB), so it must be saved within tmpOutBuffer */
     assert(dctx->tmpOutBuffer != NULL);
- 
+
     if (withinTmp && (dctx->dict == dctx->tmpOutBuffer)) {   /* continue history within tmpOutBuffer */
-        /* withinTmp expectation : content of [dstPtr,dstSize] is same as [dict+dictSize,dstSize], so we just extend it */ 
-        assert(dctx->dict + dctx->dictSize == dctx->tmpOut + dctx->tmpOutStart); 
-        dctx->dictSize += dstSize; 
+        /* withinTmp expectation : content of [dstPtr,dstSize] is same as [dict+dictSize,dstSize], so we just extend it */
+        assert(dctx->dict + dctx->dictSize == dctx->tmpOut + dctx->tmpOutStart);
+        dctx->dictSize += dstSize;
         return;
     }
 
     if (withinTmp) { /* copy relevant dict portion in front of tmpOut within tmpOutBuffer */
-        size_t const preserveSize = (size_t)(dctx->tmpOut - dctx->tmpOutBuffer); 
-        size_t copySize = 64 KB - dctx->tmpOutSize; 
-        const BYTE* const oldDictEnd = dctx->dict + dctx->dictSize - dctx->tmpOutStart; 
-        if (dctx->tmpOutSize > 64 KB) copySize = 0; 
+        size_t const preserveSize = (size_t)(dctx->tmpOut - dctx->tmpOutBuffer);
+        size_t copySize = 64 KB - dctx->tmpOutSize;
+        const BYTE* const oldDictEnd = dctx->dict + dctx->dictSize - dctx->tmpOutStart;
+        if (dctx->tmpOutSize > 64 KB) copySize = 0;
         if (copySize > preserveSize) copySize = preserveSize;
 
-        memcpy(dctx->tmpOutBuffer + preserveSize - copySize, oldDictEnd - copySize, copySize); 
+        memcpy(dctx->tmpOutBuffer + preserveSize - copySize, oldDictEnd - copySize, copySize);
 
-        dctx->dict = dctx->tmpOutBuffer; 
-        dctx->dictSize = preserveSize + dctx->tmpOutStart + dstSize; 
+        dctx->dict = dctx->tmpOutBuffer;
+        dctx->dictSize = preserveSize + dctx->tmpOutStart + dstSize;
         return;
     }
 
-    if (dctx->dict == dctx->tmpOutBuffer) {    /* copy dst into tmp to complete dict */ 
-        if (dctx->dictSize + dstSize > dctx->maxBufferSize) {  /* tmp buffer not large enough */ 
-            size_t const preserveSize = 64 KB - dstSize; 
-            memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - preserveSize, preserveSize); 
-            dctx->dictSize = preserveSize; 
+    if (dctx->dict == dctx->tmpOutBuffer) {    /* copy dst into tmp to complete dict */
+        if (dctx->dictSize + dstSize > dctx->maxBufferSize) {  /* tmp buffer not large enough */
+            size_t const preserveSize = 64 KB - dstSize;
+            memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - preserveSize, preserveSize);
+            dctx->dictSize = preserveSize;
         }
-        memcpy(dctx->tmpOutBuffer + dctx->dictSize, dstPtr, dstSize); 
-        dctx->dictSize += dstSize; 
+        memcpy(dctx->tmpOutBuffer + dctx->dictSize, dstPtr, dstSize);
+        dctx->dictSize += dstSize;
         return;
     }
 
     /* join dict & dest into tmp */
-    {   size_t preserveSize = 64 KB - dstSize; 
-        if (preserveSize > dctx->dictSize) preserveSize = dctx->dictSize; 
-        memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - preserveSize, preserveSize); 
-        memcpy(dctx->tmpOutBuffer + preserveSize, dstPtr, dstSize); 
-        dctx->dict = dctx->tmpOutBuffer; 
-        dctx->dictSize = preserveSize + dstSize; 
+    {   size_t preserveSize = 64 KB - dstSize;
+        if (preserveSize > dctx->dictSize) preserveSize = dctx->dictSize;
+        memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - preserveSize, preserveSize);
+        memcpy(dctx->tmpOutBuffer + preserveSize, dstPtr, dstSize);
+        dctx->dict = dctx->tmpOutBuffer;
+        dctx->dictSize = preserveSize + dstSize;
     }
 }
 
 
 
 /*! LZ4F_decompress() :
- *  Call this function repetitively to regenerate compressed data in srcBuffer. 
- *  The function will attempt to decode up to *srcSizePtr bytes from srcBuffer 
- *  into dstBuffer of capacity *dstSizePtr. 
- * 
- *  The number of bytes regenerated into dstBuffer will be provided within *dstSizePtr (necessarily <= original value). 
- * 
- *  The number of bytes effectively read from srcBuffer will be provided within *srcSizePtr (necessarily <= original value). 
- *  If number of bytes read is < number of bytes provided, then decompression operation is not complete. 
- *  Remaining data will have to be presented again in a subsequent invocation. 
- * 
- *  The function result is an hint of the better srcSize to use for next call to LZ4F_decompress. 
- *  Schematically, it's the size of the current (or remaining) compressed block + header of next block. 
- *  Respecting the hint provides a small boost to performance, since it allows less buffer shuffling. 
- *  Note that this is just a hint, and it's always possible to any srcSize value. 
- *  When a frame is fully decoded, @return will be 0. 
- *  If decompression failed, @return is an error code which can be tested using LZ4F_isError(). 
- */ 
-size_t LZ4F_decompress(LZ4F_dctx* dctx, 
+ *  Call this function repetitively to regenerate compressed data in srcBuffer.
+ *  The function will attempt to decode up to *srcSizePtr bytes from srcBuffer
+ *  into dstBuffer of capacity *dstSizePtr.
+ *
+ *  The number of bytes regenerated into dstBuffer will be provided within *dstSizePtr (necessarily <= original value).
+ *
+ *  The number of bytes effectively read from srcBuffer will be provided within *srcSizePtr (necessarily <= original value).
+ *  If number of bytes read is < number of bytes provided, then decompression operation is not complete.
+ *  Remaining data will have to be presented again in a subsequent invocation.
+ *
+ *  The function result is an hint of the better srcSize to use for next call to LZ4F_decompress.
+ *  Schematically, it's the size of the current (or remaining) compressed block + header of next block.
+ *  Respecting the hint provides a small boost to performance, since it allows less buffer shuffling.
+ *  Note that this is just a hint, and it's always possible to any srcSize value.
+ *  When a frame is fully decoded, @return will be 0.
+ *  If decompression failed, @return is an error code which can be tested using LZ4F_isError().
+ */
+size_t LZ4F_decompress(LZ4F_dctx* dctx,
                        void* dstBuffer, size_t* dstSizePtr,
                        const void* srcBuffer, size_t* srcSizePtr,
                        const LZ4F_decompressOptions_t* decompressOptionsPtr)
@@ -1401,131 +1401,131 @@ size_t LZ4F_decompress(LZ4F_dctx* dctx,
     DEBUGLOG(5, "LZ4F_decompress : %p,%u => %p,%u",
             srcBuffer, (unsigned)*srcSizePtr, dstBuffer, (unsigned)*dstSizePtr);
     if (dstBuffer == NULL) assert(*dstSizePtr == 0);
-    MEM_INIT(&optionsNull, 0, sizeof(optionsNull)); 
+    MEM_INIT(&optionsNull, 0, sizeof(optionsNull));
     if (decompressOptionsPtr==NULL) decompressOptionsPtr = &optionsNull;
     *srcSizePtr = 0;
     *dstSizePtr = 0;
     assert(dctx != NULL);
 
-    /* behaves as a state machine */ 
+    /* behaves as a state machine */
 
     while (doAnotherStage) {
 
-        switch(dctx->dStage) 
+        switch(dctx->dStage)
         {
 
-        case dstage_getFrameHeader: 
+        case dstage_getFrameHeader:
             DEBUGLOG(6, "dstage_getFrameHeader");
             if ((size_t)(srcEnd-srcPtr) >= maxFHSize) {  /* enough to decode - shortcut */
-                size_t const hSize = LZ4F_decodeHeader(dctx, srcPtr, (size_t)(srcEnd-srcPtr));  /* will update dStage appropriately */ 
+                size_t const hSize = LZ4F_decodeHeader(dctx, srcPtr, (size_t)(srcEnd-srcPtr));  /* will update dStage appropriately */
                 if (LZ4F_isError(hSize)) return hSize;
                 srcPtr += hSize;
                 break;
             }
-            dctx->tmpInSize = 0; 
-            if (srcEnd-srcPtr == 0) return minFHSize;   /* 0-size input */ 
-            dctx->tmpInTarget = minFHSize;   /* minimum size to decode header */ 
-            dctx->dStage = dstage_storeFrameHeader; 
-            /* fall-through */ 
+            dctx->tmpInSize = 0;
+            if (srcEnd-srcPtr == 0) return minFHSize;   /* 0-size input */
+            dctx->tmpInTarget = minFHSize;   /* minimum size to decode header */
+            dctx->dStage = dstage_storeFrameHeader;
+            /* fall-through */
 
-        case dstage_storeFrameHeader: 
+        case dstage_storeFrameHeader:
             DEBUGLOG(6, "dstage_storeFrameHeader");
-            {   size_t const sizeToCopy = MIN(dctx->tmpInTarget - dctx->tmpInSize, (size_t)(srcEnd - srcPtr)); 
-                memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy); 
-                dctx->tmpInSize += sizeToCopy; 
+            {   size_t const sizeToCopy = MIN(dctx->tmpInTarget - dctx->tmpInSize, (size_t)(srcEnd - srcPtr));
+                memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy);
+                dctx->tmpInSize += sizeToCopy;
                 srcPtr += sizeToCopy;
-            } 
-            if (dctx->tmpInSize < dctx->tmpInTarget) { 
-                nextSrcSizeHint = (dctx->tmpInTarget - dctx->tmpInSize) + BHSize;   /* rest of header + nextBlockHeader */ 
-                doAnotherStage = 0;   /* not enough src data, ask for some more */ 
+            }
+            if (dctx->tmpInSize < dctx->tmpInTarget) {
+                nextSrcSizeHint = (dctx->tmpInTarget - dctx->tmpInSize) + BHSize;   /* rest of header + nextBlockHeader */
+                doAnotherStage = 0;   /* not enough src data, ask for some more */
                 break;
             }
-            {   size_t const hSize = LZ4F_decodeHeader(dctx, dctx->header, dctx->tmpInTarget);  /* will update dStage appropriately */ 
-                if (LZ4F_isError(hSize)) return hSize; 
-            } 
-            break; 
+            {   size_t const hSize = LZ4F_decodeHeader(dctx, dctx->header, dctx->tmpInTarget);  /* will update dStage appropriately */
+                if (LZ4F_isError(hSize)) return hSize;
+            }
+            break;
 
-        case dstage_init: 
+        case dstage_init:
             DEBUGLOG(6, "dstage_init");
-            if (dctx->frameInfo.contentChecksumFlag) (void)XXH32_reset(&(dctx->xxh), 0); 
-            /* internal buffers allocation */ 
-            {   size_t const bufferNeeded = dctx->maxBlockSize 
-                    + ((dctx->frameInfo.blockMode==LZ4F_blockLinked) ? 128 KB : 0); 
-                if (bufferNeeded > dctx->maxBufferSize) {   /* tmp buffers too small */ 
-                    dctx->maxBufferSize = 0;   /* ensure allocation will be re-attempted on next entry*/ 
-                    FREEMEM(dctx->tmpIn); 
-                    dctx->tmpIn = (BYTE*)ALLOC(dctx->maxBlockSize + BFSize /* block checksum */); 
-                    if (dctx->tmpIn == NULL) 
-                        return err0r(LZ4F_ERROR_allocation_failed); 
-                    FREEMEM(dctx->tmpOutBuffer); 
-                    dctx->tmpOutBuffer= (BYTE*)ALLOC(bufferNeeded); 
-                    if (dctx->tmpOutBuffer== NULL) 
-                        return err0r(LZ4F_ERROR_allocation_failed); 
-                    dctx->maxBufferSize = bufferNeeded; 
-            }   } 
-            dctx->tmpInSize = 0; 
-            dctx->tmpInTarget = 0; 
-            dctx->tmpOut = dctx->tmpOutBuffer; 
-            dctx->tmpOutStart = 0; 
-            dctx->tmpOutSize = 0; 
- 
-            dctx->dStage = dstage_getBlockHeader; 
-            /* fall-through */ 
- 
-        case dstage_getBlockHeader: 
+            if (dctx->frameInfo.contentChecksumFlag) (void)XXH32_reset(&(dctx->xxh), 0);
+            /* internal buffers allocation */
+            {   size_t const bufferNeeded = dctx->maxBlockSize
+                    + ((dctx->frameInfo.blockMode==LZ4F_blockLinked) ? 128 KB : 0);
+                if (bufferNeeded > dctx->maxBufferSize) {   /* tmp buffers too small */
+                    dctx->maxBufferSize = 0;   /* ensure allocation will be re-attempted on next entry*/
+                    FREEMEM(dctx->tmpIn);
+                    dctx->tmpIn = (BYTE*)ALLOC(dctx->maxBlockSize + BFSize /* block checksum */);
+                    if (dctx->tmpIn == NULL)
+                        return err0r(LZ4F_ERROR_allocation_failed);
+                    FREEMEM(dctx->tmpOutBuffer);
+                    dctx->tmpOutBuffer= (BYTE*)ALLOC(bufferNeeded);
+                    if (dctx->tmpOutBuffer== NULL)
+                        return err0r(LZ4F_ERROR_allocation_failed);
+                    dctx->maxBufferSize = bufferNeeded;
+            }   }
+            dctx->tmpInSize = 0;
+            dctx->tmpInTarget = 0;
+            dctx->tmpOut = dctx->tmpOutBuffer;
+            dctx->tmpOutStart = 0;
+            dctx->tmpOutSize = 0;
+
+            dctx->dStage = dstage_getBlockHeader;
+            /* fall-through */
+
+        case dstage_getBlockHeader:
             if ((size_t)(srcEnd - srcPtr) >= BHSize) {
                 selectedIn = srcPtr;
                 srcPtr += BHSize;
             } else {
                 /* not enough input to read cBlockSize field */
-                dctx->tmpInSize = 0; 
-                dctx->dStage = dstage_storeBlockHeader; 
+                dctx->tmpInSize = 0;
+                dctx->dStage = dstage_storeBlockHeader;
             }
 
-            if (dctx->dStage == dstage_storeBlockHeader)   /* can be skipped */ 
-        case dstage_storeBlockHeader: 
-            {   size_t const remainingInput = (size_t)(srcEnd - srcPtr); 
-                size_t const wantedData = BHSize - dctx->tmpInSize; 
-                size_t const sizeToCopy = MIN(wantedData, remainingInput); 
-                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy); 
+            if (dctx->dStage == dstage_storeBlockHeader)   /* can be skipped */
+        case dstage_storeBlockHeader:
+            {   size_t const remainingInput = (size_t)(srcEnd - srcPtr);
+                size_t const wantedData = BHSize - dctx->tmpInSize;
+                size_t const sizeToCopy = MIN(wantedData, remainingInput);
+                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy);
                 srcPtr += sizeToCopy;
-                dctx->tmpInSize += sizeToCopy; 
- 
-                if (dctx->tmpInSize < BHSize) {   /* not enough input for cBlockSize */ 
-                    nextSrcSizeHint = BHSize - dctx->tmpInSize; 
+                dctx->tmpInSize += sizeToCopy;
+
+                if (dctx->tmpInSize < BHSize) {   /* not enough input for cBlockSize */
+                    nextSrcSizeHint = BHSize - dctx->tmpInSize;
                     doAnotherStage  = 0;
                     break;
                 }
-                selectedIn = dctx->tmpIn; 
-            }   /* if (dctx->dStage == dstage_storeBlockHeader) */ 
+                selectedIn = dctx->tmpIn;
+            }   /* if (dctx->dStage == dstage_storeBlockHeader) */
 
-        /* decode block header */ 
+        /* decode block header */
             {   U32 const blockHeader = LZ4F_readLE32(selectedIn);
                 size_t const nextCBlockSize = blockHeader & 0x7FFFFFFFU;
-                size_t const crcSize = dctx->frameInfo.blockChecksumFlag * BFSize; 
+                size_t const crcSize = dctx->frameInfo.blockChecksumFlag * BFSize;
                 if (blockHeader==0) {  /* frameEnd signal, no more block */
                     DEBUGLOG(5, "end of frame");
-                    dctx->dStage = dstage_getSuffix; 
+                    dctx->dStage = dstage_getSuffix;
                     break;
                 }
                 if (nextCBlockSize > dctx->maxBlockSize) {
-                    return err0r(LZ4F_ERROR_maxBlockSize_invalid); 
+                    return err0r(LZ4F_ERROR_maxBlockSize_invalid);
                 }
                 if (blockHeader & LZ4F_BLOCKUNCOMPRESSED_FLAG) {
-                    /* next block is uncompressed */ 
-                    dctx->tmpInTarget = nextCBlockSize; 
+                    /* next block is uncompressed */
+                    dctx->tmpInTarget = nextCBlockSize;
                     DEBUGLOG(5, "next block is uncompressed (size %u)", (U32)nextCBlockSize);
-                    if (dctx->frameInfo.blockChecksumFlag) { 
-                        (void)XXH32_reset(&dctx->blockChecksum, 0); 
-                    } 
-                    dctx->dStage = dstage_copyDirect; 
+                    if (dctx->frameInfo.blockChecksumFlag) {
+                        (void)XXH32_reset(&dctx->blockChecksum, 0);
+                    }
+                    dctx->dStage = dstage_copyDirect;
                     break;
                 }
-                /* next block is a compressed block */ 
-                dctx->tmpInTarget = nextCBlockSize + crcSize; 
-                dctx->dStage = dstage_getCBlock; 
+                /* next block is a compressed block */
+                dctx->tmpInTarget = nextCBlockSize + crcSize;
+                dctx->dStage = dstage_getCBlock;
                 if (dstPtr==dstEnd || srcPtr==srcEnd) {
-                    nextSrcSizeHint = BHSize + nextCBlockSize + crcSize; 
+                    nextSrcSizeHint = BHSize + nextCBlockSize + crcSize;
                     doAnotherStage = 0;
                 }
                 break;
@@ -1555,15 +1555,15 @@ size_t LZ4F_decompress(LZ4F_dctx* dctx,
 
                 srcPtr += sizeToCopy;
                 dstPtr += sizeToCopy;
-                if (sizeToCopy == dctx->tmpInTarget) {   /* all done */ 
-                    if (dctx->frameInfo.blockChecksumFlag) { 
-                        dctx->tmpInSize = 0; 
-                        dctx->dStage = dstage_getBlockChecksum; 
-                    } else 
-                        dctx->dStage = dstage_getBlockHeader;  /* new block */ 
+                if (sizeToCopy == dctx->tmpInTarget) {   /* all done */
+                    if (dctx->frameInfo.blockChecksumFlag) {
+                        dctx->tmpInSize = 0;
+                        dctx->dStage = dstage_getBlockChecksum;
+                    } else
+                        dctx->dStage = dstage_getBlockHeader;  /* new block */
                     break;
                 }
-                dctx->tmpInTarget -= sizeToCopy;  /* need to copy more */ 
+                dctx->tmpInTarget -= sizeToCopy;  /* need to copy more */
             }
             nextSrcSizeHint = dctx->tmpInTarget +
                             +(dctx->frameInfo.blockChecksumFlag ? BFSize : 0)
@@ -1571,167 +1571,167 @@ size_t LZ4F_decompress(LZ4F_dctx* dctx,
             doAnotherStage = 0;
             break;
 
-        /* check block checksum for recently transferred uncompressed block */ 
-        case dstage_getBlockChecksum: 
+        /* check block checksum for recently transferred uncompressed block */
+        case dstage_getBlockChecksum:
             DEBUGLOG(6, "dstage_getBlockChecksum");
-            {   const void* crcSrc; 
-                if ((srcEnd-srcPtr >= 4) && (dctx->tmpInSize==0)) { 
-                    crcSrc = srcPtr; 
-                    srcPtr += 4; 
-                } else { 
-                    size_t const stillToCopy = 4 - dctx->tmpInSize; 
-                    size_t const sizeToCopy = MIN(stillToCopy, (size_t)(srcEnd-srcPtr)); 
-                    memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy); 
-                    dctx->tmpInSize += sizeToCopy; 
-                    srcPtr += sizeToCopy; 
-                    if (dctx->tmpInSize < 4) {  /* all input consumed */ 
-                        doAnotherStage = 0; 
-                        break; 
-                    } 
-                    crcSrc = dctx->header; 
-                } 
-                {   U32 const readCRC = LZ4F_readLE32(crcSrc); 
-                    U32 const calcCRC = XXH32_digest(&dctx->blockChecksum); 
+            {   const void* crcSrc;
+                if ((srcEnd-srcPtr >= 4) && (dctx->tmpInSize==0)) {
+                    crcSrc = srcPtr;
+                    srcPtr += 4;
+                } else {
+                    size_t const stillToCopy = 4 - dctx->tmpInSize;
+                    size_t const sizeToCopy = MIN(stillToCopy, (size_t)(srcEnd-srcPtr));
+                    memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy);
+                    dctx->tmpInSize += sizeToCopy;
+                    srcPtr += sizeToCopy;
+                    if (dctx->tmpInSize < 4) {  /* all input consumed */
+                        doAnotherStage = 0;
+                        break;
+                    }
+                    crcSrc = dctx->header;
+                }
+                {   U32 const readCRC = LZ4F_readLE32(crcSrc);
+                    U32 const calcCRC = XXH32_digest(&dctx->blockChecksum);
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
                     DEBUGLOG(6, "compare block checksum");
                     if (readCRC != calcCRC) {
                         DEBUGLOG(4, "incorrect block checksum: %08X != %08X",
                                 readCRC, calcCRC);
-                        return err0r(LZ4F_ERROR_blockChecksum_invalid); 
+                        return err0r(LZ4F_ERROR_blockChecksum_invalid);
                     }
 #else
                     (void)readCRC;
                     (void)calcCRC;
 #endif
-            }   } 
-            dctx->dStage = dstage_getBlockHeader;  /* new block */ 
-            break; 
- 
-        case dstage_getCBlock: 
+            }   }
+            dctx->dStage = dstage_getBlockHeader;  /* new block */
+            break;
+
+        case dstage_getCBlock:
             DEBUGLOG(6, "dstage_getCBlock");
-            if ((size_t)(srcEnd-srcPtr) < dctx->tmpInTarget) { 
-                dctx->tmpInSize = 0; 
-                dctx->dStage = dstage_storeCBlock; 
+            if ((size_t)(srcEnd-srcPtr) < dctx->tmpInTarget) {
+                dctx->tmpInSize = 0;
+                dctx->dStage = dstage_storeCBlock;
                 break;
             }
-            /* input large enough to read full block directly */ 
+            /* input large enough to read full block directly */
             selectedIn = srcPtr;
-            srcPtr += dctx->tmpInTarget; 
+            srcPtr += dctx->tmpInTarget;
 
             if (0)  /* always jump over next block */
         case dstage_storeCBlock:
-            {   size_t const wantedData = dctx->tmpInTarget - dctx->tmpInSize; 
-                size_t const inputLeft = (size_t)(srcEnd-srcPtr); 
-                size_t const sizeToCopy = MIN(wantedData, inputLeft); 
-                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy); 
-                dctx->tmpInSize += sizeToCopy; 
+            {   size_t const wantedData = dctx->tmpInTarget - dctx->tmpInSize;
+                size_t const inputLeft = (size_t)(srcEnd-srcPtr);
+                size_t const sizeToCopy = MIN(wantedData, inputLeft);
+                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy);
+                dctx->tmpInSize += sizeToCopy;
                 srcPtr += sizeToCopy;
-                if (dctx->tmpInSize < dctx->tmpInTarget) { /* need more input */ 
-                    nextSrcSizeHint = (dctx->tmpInTarget - dctx->tmpInSize) 
-                                    + (dctx->frameInfo.blockChecksumFlag ? BFSize : 0) 
-                                    + BHSize /* next header size */; 
-                    doAnotherStage = 0; 
+                if (dctx->tmpInSize < dctx->tmpInTarget) { /* need more input */
+                    nextSrcSizeHint = (dctx->tmpInTarget - dctx->tmpInSize)
+                                    + (dctx->frameInfo.blockChecksumFlag ? BFSize : 0)
+                                    + BHSize /* next header size */;
+                    doAnotherStage = 0;
                     break;
                 }
-                selectedIn = dctx->tmpIn; 
+                selectedIn = dctx->tmpIn;
             }
 
-            /* At this stage, input is large enough to decode a block */ 
-            if (dctx->frameInfo.blockChecksumFlag) { 
-                dctx->tmpInTarget -= 4; 
-                assert(selectedIn != NULL);  /* selectedIn is defined at this stage (either srcPtr, or dctx->tmpIn) */ 
-                {   U32 const readBlockCrc = LZ4F_readLE32(selectedIn + dctx->tmpInTarget); 
-                    U32 const calcBlockCrc = XXH32(selectedIn, dctx->tmpInTarget, 0); 
+            /* At this stage, input is large enough to decode a block */
+            if (dctx->frameInfo.blockChecksumFlag) {
+                dctx->tmpInTarget -= 4;
+                assert(selectedIn != NULL);  /* selectedIn is defined at this stage (either srcPtr, or dctx->tmpIn) */
+                {   U32 const readBlockCrc = LZ4F_readLE32(selectedIn + dctx->tmpInTarget);
+                    U32 const calcBlockCrc = XXH32(selectedIn, dctx->tmpInTarget, 0);
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
-                    if (readBlockCrc != calcBlockCrc) 
-                        return err0r(LZ4F_ERROR_blockChecksum_invalid); 
+                    if (readBlockCrc != calcBlockCrc)
+                        return err0r(LZ4F_ERROR_blockChecksum_invalid);
 #else
                     (void)readBlockCrc;
                     (void)calcBlockCrc;
 #endif
-            }   } 
+            }   }
 
-            if ((size_t)(dstEnd-dstPtr) >= dctx->maxBlockSize) { 
-                const char* dict = (const char*)dctx->dict; 
-                size_t dictSize = dctx->dictSize; 
+            if ((size_t)(dstEnd-dstPtr) >= dctx->maxBlockSize) {
+                const char* dict = (const char*)dctx->dict;
+                size_t dictSize = dctx->dictSize;
                 int decodedSize;
                 assert(dstPtr != NULL);
-                if (dict && dictSize > 1 GB) { 
-                    /* the dictSize param is an int, avoid truncation / sign issues */ 
-                    dict += dictSize - 64 KB; 
-                    dictSize = 64 KB; 
-                } 
-                /* enough capacity in `dst` to decompress directly there */ 
-                decodedSize = LZ4_decompress_safe_usingDict( 
-                        (const char*)selectedIn, (char*)dstPtr, 
-                        (int)dctx->tmpInTarget, (int)dctx->maxBlockSize, 
-                        dict, (int)dictSize); 
+                if (dict && dictSize > 1 GB) {
+                    /* the dictSize param is an int, avoid truncation / sign issues */
+                    dict += dictSize - 64 KB;
+                    dictSize = 64 KB;
+                }
+                /* enough capacity in `dst` to decompress directly there */
+                decodedSize = LZ4_decompress_safe_usingDict(
+                        (const char*)selectedIn, (char*)dstPtr,
+                        (int)dctx->tmpInTarget, (int)dctx->maxBlockSize,
+                        dict, (int)dictSize);
                 if (decodedSize < 0) return err0r(LZ4F_ERROR_GENERIC);   /* decompression failed */
-                if (dctx->frameInfo.contentChecksumFlag) 
-                    XXH32_update(&(dctx->xxh), dstPtr, (size_t)decodedSize); 
-                if (dctx->frameInfo.contentSize) 
-                    dctx->frameRemainingSize -= (size_t)decodedSize; 
+                if (dctx->frameInfo.contentChecksumFlag)
+                    XXH32_update(&(dctx->xxh), dstPtr, (size_t)decodedSize);
+                if (dctx->frameInfo.contentSize)
+                    dctx->frameRemainingSize -= (size_t)decodedSize;
 
                 /* dictionary management */
                 if (dctx->frameInfo.blockMode==LZ4F_blockLinked) {
-                    LZ4F_updateDict(dctx, dstPtr, (size_t)decodedSize, dstStart, 0); 
+                    LZ4F_updateDict(dctx, dstPtr, (size_t)decodedSize, dstStart, 0);
                 }
 
                 dstPtr += decodedSize;
-                dctx->dStage = dstage_getBlockHeader; 
+                dctx->dStage = dstage_getBlockHeader;
                 break;
             }
 
             /* not enough place into dst : decode into tmpOut */
-            /* ensure enough place for tmpOut */ 
-            if (dctx->frameInfo.blockMode == LZ4F_blockLinked) { 
-                if (dctx->dict == dctx->tmpOutBuffer) { 
-                    if (dctx->dictSize > 128 KB) { 
-                        memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - 64 KB, 64 KB); 
-                        dctx->dictSize = 64 KB; 
-                    } 
-                    dctx->tmpOut = dctx->tmpOutBuffer + dctx->dictSize; 
-                } else {  /* dict not within tmp */ 
-                    size_t const reservedDictSpace = MIN(dctx->dictSize, 64 KB); 
-                    dctx->tmpOut = dctx->tmpOutBuffer + reservedDictSpace; 
-            }   } 
- 
-            /* Decode block */ 
-            {   const char* dict = (const char*)dctx->dict; 
-                size_t dictSize = dctx->dictSize; 
+            /* ensure enough place for tmpOut */
+            if (dctx->frameInfo.blockMode == LZ4F_blockLinked) {
+                if (dctx->dict == dctx->tmpOutBuffer) {
+                    if (dctx->dictSize > 128 KB) {
+                        memcpy(dctx->tmpOutBuffer, dctx->dict + dctx->dictSize - 64 KB, 64 KB);
+                        dctx->dictSize = 64 KB;
+                    }
+                    dctx->tmpOut = dctx->tmpOutBuffer + dctx->dictSize;
+                } else {  /* dict not within tmp */
+                    size_t const reservedDictSpace = MIN(dctx->dictSize, 64 KB);
+                    dctx->tmpOut = dctx->tmpOutBuffer + reservedDictSpace;
+            }   }
+
+            /* Decode block */
+            {   const char* dict = (const char*)dctx->dict;
+                size_t dictSize = dctx->dictSize;
                 int decodedSize;
-                if (dict && dictSize > 1 GB) { 
-                    /* the dictSize param is an int, avoid truncation / sign issues */ 
-                    dict += dictSize - 64 KB; 
-                    dictSize = 64 KB; 
+                if (dict && dictSize > 1 GB) {
+                    /* the dictSize param is an int, avoid truncation / sign issues */
+                    dict += dictSize - 64 KB;
+                    dictSize = 64 KB;
                 }
-                decodedSize = LZ4_decompress_safe_usingDict( 
-                        (const char*)selectedIn, (char*)dctx->tmpOut, 
-                        (int)dctx->tmpInTarget, (int)dctx->maxBlockSize, 
-                        dict, (int)dictSize); 
-                if (decodedSize < 0)  /* decompression failed */ 
-                    return err0r(LZ4F_ERROR_decompressionFailed); 
-                if (dctx->frameInfo.contentChecksumFlag) 
-                    XXH32_update(&(dctx->xxh), dctx->tmpOut, (size_t)decodedSize); 
-                if (dctx->frameInfo.contentSize) 
-                    dctx->frameRemainingSize -= (size_t)decodedSize; 
-                dctx->tmpOutSize = (size_t)decodedSize; 
-                dctx->tmpOutStart = 0; 
-                dctx->dStage = dstage_flushOut; 
+                decodedSize = LZ4_decompress_safe_usingDict(
+                        (const char*)selectedIn, (char*)dctx->tmpOut,
+                        (int)dctx->tmpInTarget, (int)dctx->maxBlockSize,
+                        dict, (int)dictSize);
+                if (decodedSize < 0)  /* decompression failed */
+                    return err0r(LZ4F_ERROR_decompressionFailed);
+                if (dctx->frameInfo.contentChecksumFlag)
+                    XXH32_update(&(dctx->xxh), dctx->tmpOut, (size_t)decodedSize);
+                if (dctx->frameInfo.contentSize)
+                    dctx->frameRemainingSize -= (size_t)decodedSize;
+                dctx->tmpOutSize = (size_t)decodedSize;
+                dctx->tmpOutStart = 0;
+                dctx->dStage = dstage_flushOut;
             }
-            /* fall-through */ 
+            /* fall-through */
 
         case dstage_flushOut:  /* flush decoded data from tmpOut to dstBuffer */
             DEBUGLOG(6, "dstage_flushOut");
             if (dstPtr != NULL) {
                 size_t const sizeToCopy = MIN(dctx->tmpOutSize - dctx->tmpOutStart, (size_t)(dstEnd-dstPtr));
-                memcpy(dstPtr, dctx->tmpOut + dctx->tmpOutStart, sizeToCopy); 
+                memcpy(dstPtr, dctx->tmpOut + dctx->tmpOutStart, sizeToCopy);
 
                 /* dictionary management */
-                if (dctx->frameInfo.blockMode == LZ4F_blockLinked) 
-                    LZ4F_updateDict(dctx, dstPtr, sizeToCopy, dstStart, 1 /*withinTmp*/); 
+                if (dctx->frameInfo.blockMode == LZ4F_blockLinked)
+                    LZ4F_updateDict(dctx, dstPtr, sizeToCopy, dstStart, 1 /*withinTmp*/);
 
-                dctx->tmpOutStart += sizeToCopy; 
+                dctx->tmpOutStart += sizeToCopy;
                 dstPtr += sizeToCopy;
             }
             if (dctx->tmpOutStart == dctx->tmpOutSize) { /* all flushed */
@@ -1744,50 +1744,50 @@ size_t LZ4F_decompress(LZ4F_dctx* dctx,
             break;
 
         case dstage_getSuffix:
-            if (dctx->frameRemainingSize) 
-                return err0r(LZ4F_ERROR_frameSize_wrong);   /* incorrect frame size decoded */ 
-            if (!dctx->frameInfo.contentChecksumFlag) {  /* no checksum, frame is completed */ 
-                nextSrcSizeHint = 0; 
-                LZ4F_resetDecompressionContext(dctx); 
-                doAnotherStage = 0; 
-                break; 
+            if (dctx->frameRemainingSize)
+                return err0r(LZ4F_ERROR_frameSize_wrong);   /* incorrect frame size decoded */
+            if (!dctx->frameInfo.contentChecksumFlag) {  /* no checksum, frame is completed */
+                nextSrcSizeHint = 0;
+                LZ4F_resetDecompressionContext(dctx);
+                doAnotherStage = 0;
+                break;
+            }
+            if ((srcEnd - srcPtr) < 4) {  /* not enough size for entire CRC */
+                dctx->tmpInSize = 0;
+                dctx->dStage = dstage_storeSuffix;
+            } else {
+                selectedIn = srcPtr;
+                srcPtr += 4;
             }
-            if ((srcEnd - srcPtr) < 4) {  /* not enough size for entire CRC */ 
-                dctx->tmpInSize = 0; 
-                dctx->dStage = dstage_storeSuffix; 
-            } else { 
-                selectedIn = srcPtr; 
-                srcPtr += 4; 
-            } 
-
-            if (dctx->dStage == dstage_storeSuffix)   /* can be skipped */ 
+
+            if (dctx->dStage == dstage_storeSuffix)   /* can be skipped */
         case dstage_storeSuffix:
-            {   size_t const remainingInput = (size_t)(srcEnd - srcPtr); 
-                size_t const wantedData = 4 - dctx->tmpInSize; 
-                size_t const sizeToCopy = MIN(wantedData, remainingInput); 
-                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy); 
+            {   size_t const remainingInput = (size_t)(srcEnd - srcPtr);
+                size_t const wantedData = 4 - dctx->tmpInSize;
+                size_t const sizeToCopy = MIN(wantedData, remainingInput);
+                memcpy(dctx->tmpIn + dctx->tmpInSize, srcPtr, sizeToCopy);
                 srcPtr += sizeToCopy;
-                dctx->tmpInSize += sizeToCopy; 
-                if (dctx->tmpInSize < 4) { /* not enough input to read complete suffix */ 
-                    nextSrcSizeHint = 4 - dctx->tmpInSize; 
+                dctx->tmpInSize += sizeToCopy;
+                if (dctx->tmpInSize < 4) { /* not enough input to read complete suffix */
+                    nextSrcSizeHint = 4 - dctx->tmpInSize;
                     doAnotherStage=0;
                     break;
                 }
-                selectedIn = dctx->tmpIn; 
-            }   /* if (dctx->dStage == dstage_storeSuffix) */ 
+                selectedIn = dctx->tmpIn;
+            }   /* if (dctx->dStage == dstage_storeSuffix) */
 
-        /* case dstage_checkSuffix: */   /* no direct entry, avoid initialization risks */ 
+        /* case dstage_checkSuffix: */   /* no direct entry, avoid initialization risks */
             {   U32 const readCRC = LZ4F_readLE32(selectedIn);
-                U32 const resultCRC = XXH32_digest(&(dctx->xxh)); 
+                U32 const resultCRC = XXH32_digest(&(dctx->xxh));
 #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
-                if (readCRC != resultCRC) 
-                    return err0r(LZ4F_ERROR_contentChecksum_invalid); 
+                if (readCRC != resultCRC)
+                    return err0r(LZ4F_ERROR_contentChecksum_invalid);
 #else
                 (void)readCRC;
                 (void)resultCRC;
 #endif
                 nextSrcSizeHint = 0;
-                LZ4F_resetDecompressionContext(dctx); 
+                LZ4F_resetDecompressionContext(dctx);
                 doAnotherStage = 0;
                 break;
             }
@@ -1798,102 +1798,102 @@ size_t LZ4F_decompress(LZ4F_dctx* dctx,
                 srcPtr += 4;
             } else {
                 /* not enough input to read cBlockSize field */
-                dctx->tmpInSize = 4; 
-                dctx->tmpInTarget = 8; 
-                dctx->dStage = dstage_storeSFrameSize; 
+                dctx->tmpInSize = 4;
+                dctx->tmpInTarget = 8;
+                dctx->dStage = dstage_storeSFrameSize;
             }
 
-            if (dctx->dStage == dstage_storeSFrameSize) 
+            if (dctx->dStage == dstage_storeSFrameSize)
         case dstage_storeSFrameSize:
-            {   size_t const sizeToCopy = MIN(dctx->tmpInTarget - dctx->tmpInSize, 
-                                             (size_t)(srcEnd - srcPtr) ); 
-                memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy); 
+            {   size_t const sizeToCopy = MIN(dctx->tmpInTarget - dctx->tmpInSize,
+                                             (size_t)(srcEnd - srcPtr) );
+                memcpy(dctx->header + dctx->tmpInSize, srcPtr, sizeToCopy);
                 srcPtr += sizeToCopy;
-                dctx->tmpInSize += sizeToCopy; 
-                if (dctx->tmpInSize < dctx->tmpInTarget) { 
-                    /* not enough input to get full sBlockSize; wait for more */ 
-                    nextSrcSizeHint = dctx->tmpInTarget - dctx->tmpInSize; 
+                dctx->tmpInSize += sizeToCopy;
+                if (dctx->tmpInSize < dctx->tmpInTarget) {
+                    /* not enough input to get full sBlockSize; wait for more */
+                    nextSrcSizeHint = dctx->tmpInTarget - dctx->tmpInSize;
                     doAnotherStage = 0;
                     break;
                 }
-                selectedIn = dctx->header + 4; 
-            }   /* if (dctx->dStage == dstage_storeSFrameSize) */ 
+                selectedIn = dctx->header + 4;
+            }   /* if (dctx->dStage == dstage_storeSFrameSize) */
 
-        /* case dstage_decodeSFrameSize: */   /* no direct entry */ 
+        /* case dstage_decodeSFrameSize: */   /* no direct entry */
             {   size_t const SFrameSize = LZ4F_readLE32(selectedIn);
-                dctx->frameInfo.contentSize = SFrameSize; 
-                dctx->tmpInTarget = SFrameSize; 
-                dctx->dStage = dstage_skipSkippable; 
+                dctx->frameInfo.contentSize = SFrameSize;
+                dctx->tmpInTarget = SFrameSize;
+                dctx->dStage = dstage_skipSkippable;
                 break;
             }
 
         case dstage_skipSkippable:
-            {   size_t const skipSize = MIN(dctx->tmpInTarget, (size_t)(srcEnd-srcPtr)); 
+            {   size_t const skipSize = MIN(dctx->tmpInTarget, (size_t)(srcEnd-srcPtr));
                 srcPtr += skipSize;
-                dctx->tmpInTarget -= skipSize; 
+                dctx->tmpInTarget -= skipSize;
                 doAnotherStage = 0;
-                nextSrcSizeHint = dctx->tmpInTarget; 
-                if (nextSrcSizeHint) break;  /* still more to skip */ 
-                /* frame fully skipped : prepare context for a new frame */ 
-                LZ4F_resetDecompressionContext(dctx); 
+                nextSrcSizeHint = dctx->tmpInTarget;
+                if (nextSrcSizeHint) break;  /* still more to skip */
+                /* frame fully skipped : prepare context for a new frame */
+                LZ4F_resetDecompressionContext(dctx);
                 break;
             }
-        }   /* switch (dctx->dStage) */ 
-    }   /* while (doAnotherStage) */ 
+        }   /* switch (dctx->dStage) */
+    }   /* while (doAnotherStage) */
 
-    /* preserve history within tmp whenever necessary */ 
-    LZ4F_STATIC_ASSERT((unsigned)dstage_init == 2); 
-    if ( (dctx->frameInfo.blockMode==LZ4F_blockLinked)  /* next block will use up to 64KB from previous ones */ 
-      && (dctx->dict != dctx->tmpOutBuffer)             /* dictionary is not already within tmp */ 
+    /* preserve history within tmp whenever necessary */
+    LZ4F_STATIC_ASSERT((unsigned)dstage_init == 2);
+    if ( (dctx->frameInfo.blockMode==LZ4F_blockLinked)  /* next block will use up to 64KB from previous ones */
+      && (dctx->dict != dctx->tmpOutBuffer)             /* dictionary is not already within tmp */
       && (dctx->dict != NULL)                           /* dictionary exists */
-      && (!decompressOptionsPtr->stableDst)             /* cannot rely on dst data to remain there for next call */ 
-      && ((unsigned)(dctx->dStage)-2 < (unsigned)(dstage_getSuffix)-2) )  /* valid stages : [init ... getSuffix[ */ 
+      && (!decompressOptionsPtr->stableDst)             /* cannot rely on dst data to remain there for next call */
+      && ((unsigned)(dctx->dStage)-2 < (unsigned)(dstage_getSuffix)-2) )  /* valid stages : [init ... getSuffix[ */
     {
-        if (dctx->dStage == dstage_flushOut) { 
-            size_t const preserveSize = (size_t)(dctx->tmpOut - dctx->tmpOutBuffer); 
-            size_t copySize = 64 KB - dctx->tmpOutSize; 
-            const BYTE* oldDictEnd = dctx->dict + dctx->dictSize - dctx->tmpOutStart; 
-            if (dctx->tmpOutSize > 64 KB) copySize = 0; 
+        if (dctx->dStage == dstage_flushOut) {
+            size_t const preserveSize = (size_t)(dctx->tmpOut - dctx->tmpOutBuffer);
+            size_t copySize = 64 KB - dctx->tmpOutSize;
+            const BYTE* oldDictEnd = dctx->dict + dctx->dictSize - dctx->tmpOutStart;
+            if (dctx->tmpOutSize > 64 KB) copySize = 0;
             if (copySize > preserveSize) copySize = preserveSize;
             assert(dctx->tmpOutBuffer != NULL);
 
             memcpy(dctx->tmpOutBuffer + preserveSize - copySize, oldDictEnd - copySize, copySize);
 
-            dctx->dict = dctx->tmpOutBuffer; 
-            dctx->dictSize = preserveSize + dctx->tmpOutStart; 
+            dctx->dict = dctx->tmpOutBuffer;
+            dctx->dictSize = preserveSize + dctx->tmpOutStart;
         } else {
-            const BYTE* const oldDictEnd = dctx->dict + dctx->dictSize; 
-            size_t const newDictSize = MIN(dctx->dictSize, 64 KB); 
+            const BYTE* const oldDictEnd = dctx->dict + dctx->dictSize;
+            size_t const newDictSize = MIN(dctx->dictSize, 64 KB);
 
             memcpy(dctx->tmpOutBuffer, oldDictEnd - newDictSize, newDictSize);
 
-            dctx->dict = dctx->tmpOutBuffer; 
-            dctx->dictSize = newDictSize; 
-            dctx->tmpOut = dctx->tmpOutBuffer + newDictSize; 
+            dctx->dict = dctx->tmpOutBuffer;
+            dctx->dictSize = newDictSize;
+            dctx->tmpOut = dctx->tmpOutBuffer + newDictSize;
         }
     }
 
-    *srcSizePtr = (size_t)(srcPtr - srcStart); 
-    *dstSizePtr = (size_t)(dstPtr - dstStart); 
+    *srcSizePtr = (size_t)(srcPtr - srcStart);
+    *dstSizePtr = (size_t)(dstPtr - dstStart);
     return nextSrcSizeHint;
 }
- 
-/*! LZ4F_decompress_usingDict() : 
- *  Same as LZ4F_decompress(), using a predefined dictionary. 
- *  Dictionary is used "in place", without any preprocessing. 
- *  It must remain accessible throughout the entire frame decoding. 
- */ 
-size_t LZ4F_decompress_usingDict(LZ4F_dctx* dctx, 
-                       void* dstBuffer, size_t* dstSizePtr, 
-                       const void* srcBuffer, size_t* srcSizePtr, 
-                       const void* dict, size_t dictSize, 
-                       const LZ4F_decompressOptions_t* decompressOptionsPtr) 
-{ 
-    if (dctx->dStage <= dstage_init) { 
-        dctx->dict = (const BYTE*)dict; 
-        dctx->dictSize = dictSize; 
-    } 
-    return LZ4F_decompress(dctx, dstBuffer, dstSizePtr, 
-                           srcBuffer, srcSizePtr, 
-                           decompressOptionsPtr); 
-} 
+
+/*! LZ4F_decompress_usingDict() :
+ *  Same as LZ4F_decompress(), using a predefined dictionary.
+ *  Dictionary is used "in place", without any preprocessing.
+ *  It must remain accessible throughout the entire frame decoding.
+ */
+size_t LZ4F_decompress_usingDict(LZ4F_dctx* dctx,
+                       void* dstBuffer, size_t* dstSizePtr,
+                       const void* srcBuffer, size_t* srcSizePtr,
+                       const void* dict, size_t dictSize,
+                       const LZ4F_decompressOptions_t* decompressOptionsPtr)
+{
+    if (dctx->dStage <= dstage_init) {
+        dctx->dict = (const BYTE*)dict;
+        dctx->dictSize = dictSize;
+    }
+    return LZ4F_decompress(dctx, dstBuffer, dstSizePtr,
+                           srcBuffer, srcSizePtr,
+                           decompressOptionsPtr);
+}
diff --git a/contrib/libs/lz4/lz4frame.h b/contrib/libs/lz4/lz4frame.h
index 956352df62..4573317ef2 100644
--- a/contrib/libs/lz4/lz4frame.h
+++ b/contrib/libs/lz4/lz4frame.h
@@ -1,7 +1,7 @@
 /*
    LZ4 auto-framing library
    Header File
-   Copyright (C) 2011-2017, Yann Collet. 
+   Copyright (C) 2011-2017, 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
@@ -32,14 +32,14 @@
    - LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
 */
 
-/* LZ4F is a stand-alone API able to create and decode LZ4 frames 
- * conformant with specification v1.6.1 in doc/lz4_Frame_format.md . 
- * Generated frames are compatible with `lz4` CLI. 
- * 
- * LZ4F also offers streaming capabilities. 
- * 
- * lz4.h is not required when using lz4frame.h, 
- * except to extract common constant such as LZ4_VERSION_NUMBER. 
+/* LZ4F is a stand-alone API able to create and decode LZ4 frames
+ * conformant with specification v1.6.1 in doc/lz4_Frame_format.md .
+ * Generated frames are compatible with `lz4` CLI.
+ *
+ * LZ4F also offers streaming capabilities.
+ *
+ * lz4.h is not required when using lz4frame.h,
+ * except to extract common constant such as LZ4_VERSION_NUMBER.
  * */
 
 #ifndef LZ4F_H_09782039843
@@ -52,23 +52,23 @@ extern "C" {
 /* ---   Dependency   --- */
 #include <stddef.h>   /* size_t */
 
- 
-/** 
-  Introduction 
- 
-  lz4frame.h implements LZ4 frame specification (doc/lz4_Frame_format.md). 
-  lz4frame.h provides frame compression functions that take care 
-  of encoding standard metadata alongside LZ4-compressed blocks. 
-*/ 
- 
+
+/**
+  Introduction
+
+  lz4frame.h implements LZ4 frame specification (doc/lz4_Frame_format.md).
+  lz4frame.h provides frame compression functions that take care
+  of encoding standard metadata alongside LZ4-compressed blocks.
+*/
+
 /*-***************************************************************
- *  Compiler specifics 
- *****************************************************************/ 
-/*  LZ4_DLL_EXPORT : 
- *  Enable exporting of functions when building a Windows DLL 
+ *  Compiler specifics
+ *****************************************************************/
+/*  LZ4_DLL_EXPORT :
+ *  Enable exporting of functions when building a Windows DLL
  *  LZ4FLIB_VISIBILITY :
- *  Control library symbols visibility. 
- */ 
+ *  Control library symbols visibility.
+ */
 #ifndef LZ4FLIB_VISIBILITY
 #  if defined(__GNUC__) && (__GNUC__ >= 4)
 #    define LZ4FLIB_VISIBILITY __attribute__ ((visibility ("default")))
@@ -84,40 +84,40 @@ extern "C" {
 #  define LZ4FLIB_API LZ4FLIB_VISIBILITY
 #endif
 
-#ifdef LZ4F_DISABLE_DEPRECATE_WARNINGS 
-#  define LZ4F_DEPRECATE(x) x 
+#ifdef LZ4F_DISABLE_DEPRECATE_WARNINGS
+#  define LZ4F_DEPRECATE(x) x
 #else
-#  if defined(_MSC_VER) 
-#    define LZ4F_DEPRECATE(x) x   /* __declspec(deprecated) x - only works with C++ */ 
-#  elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ >= 6)) 
-#    define LZ4F_DEPRECATE(x) x __attribute__((deprecated)) 
-#  else 
-#    define LZ4F_DEPRECATE(x) x   /* no deprecation warning for this compiler */ 
-#  endif 
+#  if defined(_MSC_VER)
+#    define LZ4F_DEPRECATE(x) x   /* __declspec(deprecated) x - only works with C++ */
+#  elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ >= 6))
+#    define LZ4F_DEPRECATE(x) x __attribute__((deprecated))
+#  else
+#    define LZ4F_DEPRECATE(x) x   /* no deprecation warning for this compiler */
+#  endif
 #endif
 
 
 /*-************************************
- *  Error management 
- **************************************/ 
+ *  Error management
+ **************************************/
 typedef size_t LZ4F_errorCode_t;
 
-LZ4FLIB_API unsigned    LZ4F_isError(LZ4F_errorCode_t code);   /**< tells when a function result is an error code */ 
-LZ4FLIB_API const char* LZ4F_getErrorName(LZ4F_errorCode_t code);   /**< return error code string; for debugging */ 
+LZ4FLIB_API unsigned    LZ4F_isError(LZ4F_errorCode_t code);   /**< tells when a function result is an error code */
+LZ4FLIB_API const char* LZ4F_getErrorName(LZ4F_errorCode_t code);   /**< return error code string; for debugging */
 
 
 /*-************************************
- *  Frame compression types 
+ *  Frame compression types
  ************************************* */
-/* #define LZ4F_ENABLE_OBSOLETE_ENUMS   // uncomment to enable obsolete enums */ 
-#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS 
+/* #define LZ4F_ENABLE_OBSOLETE_ENUMS   // uncomment to enable obsolete enums */
+#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS
 #  define LZ4F_OBSOLETE_ENUM(x) , LZ4F_DEPRECATE(x) = LZ4F_##x
 #else
 #  define LZ4F_OBSOLETE_ENUM(x)
 #endif
 
-/* The larger the block size, the (slightly) better the compression ratio, 
- * though there are diminishing returns. 
+/* The larger the block size, the (slightly) better the compression ratio,
+ * though there are diminishing returns.
  * Larger blocks also increase memory usage on both compression and decompression sides.
  */
 typedef enum {
@@ -132,9 +132,9 @@ typedef enum {
     LZ4F_OBSOLETE_ENUM(max4MB)
 } LZ4F_blockSizeID_t;
 
-/* Linked blocks sharply reduce inefficiencies when using small blocks, 
- * they compress better. 
- * However, some LZ4 decoders are only compatible with independent blocks */ 
+/* Linked blocks sharply reduce inefficiencies when using small blocks,
+ * they compress better.
+ * However, some LZ4 decoders are only compatible with independent blocks */
 typedef enum {
     LZ4F_blockLinked=0,
     LZ4F_blockIndependent
@@ -150,80 +150,80 @@ typedef enum {
 } LZ4F_contentChecksum_t;
 
 typedef enum {
-    LZ4F_noBlockChecksum=0, 
-    LZ4F_blockChecksumEnabled 
-} LZ4F_blockChecksum_t; 
- 
-typedef enum { 
+    LZ4F_noBlockChecksum=0,
+    LZ4F_blockChecksumEnabled
+} LZ4F_blockChecksum_t;
+
+typedef enum {
     LZ4F_frame=0,
     LZ4F_skippableFrame
     LZ4F_OBSOLETE_ENUM(skippableFrame)
 } LZ4F_frameType_t;
 
-#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS 
+#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS
 typedef LZ4F_blockSizeID_t blockSizeID_t;
 typedef LZ4F_blockMode_t blockMode_t;
 typedef LZ4F_frameType_t frameType_t;
 typedef LZ4F_contentChecksum_t contentChecksum_t;
 #endif
 
-/*! LZ4F_frameInfo_t : 
- *  makes it possible to set or read frame parameters. 
- *  Structure must be first init to 0, using memset() or LZ4F_INIT_FRAMEINFO, 
- *  setting all parameters to default. 
- *  It's then possible to update selectively some parameters */ 
+/*! LZ4F_frameInfo_t :
+ *  makes it possible to set or read frame parameters.
+ *  Structure must be first init to 0, using memset() or LZ4F_INIT_FRAMEINFO,
+ *  setting all parameters to default.
+ *  It's then possible to update selectively some parameters */
 typedef struct {
-  LZ4F_blockSizeID_t     blockSizeID;         /* max64KB, max256KB, max1MB, max4MB; 0 == default */ 
-  LZ4F_blockMode_t       blockMode;           /* LZ4F_blockLinked, LZ4F_blockIndependent; 0 == default */ 
-  LZ4F_contentChecksum_t contentChecksumFlag; /* 1: frame terminated with 32-bit checksum of decompressed data; 0: disabled (default) */ 
-  LZ4F_frameType_t       frameType;           /* read-only field : LZ4F_frame or LZ4F_skippableFrame */ 
-  unsigned long long     contentSize;         /* Size of uncompressed content ; 0 == unknown */ 
-  unsigned               dictID;              /* Dictionary ID, sent by compressor to help decoder select correct dictionary; 0 == no dictID provided */ 
-  LZ4F_blockChecksum_t   blockChecksumFlag;   /* 1: each block followed by a checksum of block's compressed data; 0: disabled (default) */ 
+  LZ4F_blockSizeID_t     blockSizeID;         /* max64KB, max256KB, max1MB, max4MB; 0 == default */
+  LZ4F_blockMode_t       blockMode;           /* LZ4F_blockLinked, LZ4F_blockIndependent; 0 == default */
+  LZ4F_contentChecksum_t contentChecksumFlag; /* 1: frame terminated with 32-bit checksum of decompressed data; 0: disabled (default) */
+  LZ4F_frameType_t       frameType;           /* read-only field : LZ4F_frame or LZ4F_skippableFrame */
+  unsigned long long     contentSize;         /* Size of uncompressed content ; 0 == unknown */
+  unsigned               dictID;              /* Dictionary ID, sent by compressor to help decoder select correct dictionary; 0 == no dictID provided */
+  LZ4F_blockChecksum_t   blockChecksumFlag;   /* 1: each block followed by a checksum of block's compressed data; 0: disabled (default) */
 } LZ4F_frameInfo_t;
 
 #define LZ4F_INIT_FRAMEINFO   { LZ4F_default, LZ4F_blockLinked, LZ4F_noContentChecksum, LZ4F_frame, 0ULL, 0U, LZ4F_noBlockChecksum }    /* v1.8.3+ */
- 
-/*! LZ4F_preferences_t : 
- *  makes it possible to supply advanced compression instructions to streaming interface. 
- *  Structure must be first init to 0, using memset() or LZ4F_INIT_PREFERENCES, 
- *  setting all parameters to default. 
- *  All reserved fields must be set to zero. */ 
+
+/*! LZ4F_preferences_t :
+ *  makes it possible to supply advanced compression instructions to streaming interface.
+ *  Structure must be first init to 0, using memset() or LZ4F_INIT_PREFERENCES,
+ *  setting all parameters to default.
+ *  All reserved fields must be set to zero. */
 typedef struct {
   LZ4F_frameInfo_t frameInfo;
-  int      compressionLevel;    /* 0: default (fast mode); values > LZ4HC_CLEVEL_MAX count as LZ4HC_CLEVEL_MAX; values < 0 trigger "fast acceleration" */ 
-  unsigned autoFlush;           /* 1: always flush; reduces usage of internal buffers */ 
-  unsigned favorDecSpeed;       /* 1: parser favors decompression speed vs compression ratio. Only works for high compression modes (>= LZ4HC_CLEVEL_OPT_MIN) */  /* v1.8.2+ */ 
-  unsigned reserved[3];         /* must be zero for forward compatibility */ 
+  int      compressionLevel;    /* 0: default (fast mode); values > LZ4HC_CLEVEL_MAX count as LZ4HC_CLEVEL_MAX; values < 0 trigger "fast acceleration" */
+  unsigned autoFlush;           /* 1: always flush; reduces usage of internal buffers */
+  unsigned favorDecSpeed;       /* 1: parser favors decompression speed vs compression ratio. Only works for high compression modes (>= LZ4HC_CLEVEL_OPT_MIN) */  /* v1.8.2+ */
+  unsigned reserved[3];         /* must be zero for forward compatibility */
 } LZ4F_preferences_t;
 
 #define LZ4F_INIT_PREFERENCES   { LZ4F_INIT_FRAMEINFO, 0, 0u, 0u, { 0u, 0u, 0u } }    /* v1.8.3+ */
 
- 
+
 /*-*********************************
 *  Simple compression function
 ***********************************/
- 
-LZ4FLIB_API int LZ4F_compressionLevel_max(void);   /* v1.8.0+ */ 
- 
-/*! LZ4F_compressFrameBound() : 
- *  Returns the maximum possible compressed size with LZ4F_compressFrame() given srcSize and preferences. 
- * `preferencesPtr` is optional. It can be replaced by NULL, in which case, the function will assume default preferences. 
- *  Note : this result is only usable with LZ4F_compressFrame(). 
- *         It may also be used with LZ4F_compressUpdate() _if no flush() operation_ is performed. 
+
+LZ4FLIB_API int LZ4F_compressionLevel_max(void);   /* v1.8.0+ */
+
+/*! LZ4F_compressFrameBound() :
+ *  Returns the maximum possible compressed size with LZ4F_compressFrame() given srcSize and preferences.
+ * `preferencesPtr` is optional. It can be replaced by NULL, in which case, the function will assume default preferences.
+ *  Note : this result is only usable with LZ4F_compressFrame().
+ *         It may also be used with LZ4F_compressUpdate() _if no flush() operation_ is performed.
  */
 LZ4FLIB_API size_t LZ4F_compressFrameBound(size_t srcSize, const LZ4F_preferences_t* preferencesPtr);
 
-/*! LZ4F_compressFrame() : 
- *  Compress an entire srcBuffer into a valid LZ4 frame. 
- *  dstCapacity MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr). 
- *  The LZ4F_preferences_t structure is optional : you can provide NULL as argument. All preferences will be set to default. 
+/*! LZ4F_compressFrame() :
+ *  Compress an entire srcBuffer into a valid LZ4 frame.
+ *  dstCapacity MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
+ *  The LZ4F_preferences_t structure is optional : you can provide NULL as argument. All preferences will be set to default.
  * @return : number of bytes written into dstBuffer.
  *           or an error code if it fails (can be tested using LZ4F_isError())
  */
-LZ4FLIB_API size_t LZ4F_compressFrame(void* dstBuffer, size_t dstCapacity, 
-                                const void* srcBuffer, size_t srcSize, 
-                                const LZ4F_preferences_t* preferencesPtr); 
+LZ4FLIB_API size_t LZ4F_compressFrame(void* dstBuffer, size_t dstCapacity,
+                                const void* srcBuffer, size_t srcSize,
+                                const LZ4F_preferences_t* preferencesPtr);
 
 
 /*-***********************************
@@ -237,28 +237,28 @@ typedef struct {
   unsigned reserved[3];
 } LZ4F_compressOptions_t;
 
-/*---   Resource Management   ---*/ 
+/*---   Resource Management   ---*/
 
-#define LZ4F_VERSION 100    /* This number can be used to check for an incompatible API breaking change */ 
+#define LZ4F_VERSION 100    /* This number can be used to check for an incompatible API breaking change */
 LZ4FLIB_API unsigned LZ4F_getVersion(void);
- 
-/*! LZ4F_createCompressionContext() : 
+
+/*! LZ4F_createCompressionContext() :
  * The first thing to do is to create a compressionContext object, which will be used in all compression operations.
- * This is achieved using LZ4F_createCompressionContext(), which takes as argument a version. 
+ * This is achieved using LZ4F_createCompressionContext(), which takes as argument a version.
  * The version provided MUST be LZ4F_VERSION. It is intended to track potential version mismatch, notably when using DLL.
  * The function will provide a pointer to a fully allocated LZ4F_cctx object.
  * If @return != zero, there was an error during context creation.
  * Object can release its memory using LZ4F_freeCompressionContext();
  */
-LZ4FLIB_API LZ4F_errorCode_t LZ4F_createCompressionContext(LZ4F_cctx** cctxPtr, unsigned version); 
-LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctx); 
+LZ4FLIB_API LZ4F_errorCode_t LZ4F_createCompressionContext(LZ4F_cctx** cctxPtr, unsigned version);
+LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctx);
 
 
-/*----    Compression    ----*/ 
+/*----    Compression    ----*/
+
+#define LZ4F_HEADER_SIZE_MIN  7   /* LZ4 Frame header size can vary, depending on selected paramaters */
+#define LZ4F_HEADER_SIZE_MAX 19
 
-#define LZ4F_HEADER_SIZE_MIN  7   /* LZ4 Frame header size can vary, depending on selected paramaters */ 
-#define LZ4F_HEADER_SIZE_MAX 19 
- 
 /* Size in bytes of a block header in little-endian format. Highest bit indicates if block data is uncompressed */
 #define LZ4F_BLOCK_HEADER_SIZE 4
 
@@ -268,76 +268,76 @@ LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctx);
 /* Size in bytes of the content checksum. */
 #define LZ4F_CONTENT_CHECKSUM_SIZE 4
 
-/*! LZ4F_compressBegin() : 
- *  will write the frame header into dstBuffer. 
- *  dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes. 
+/*! LZ4F_compressBegin() :
+ *  will write the frame header into dstBuffer.
+ *  dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes.
  * `prefsPtr` is optional : you can provide NULL as argument, all preferences will then be set to default.
  * @return : number of bytes written into dstBuffer for the header
  *           or an error code (which can be tested using LZ4F_isError())
  */
-LZ4FLIB_API size_t LZ4F_compressBegin(LZ4F_cctx* cctx, 
-                                      void* dstBuffer, size_t dstCapacity, 
-                                      const LZ4F_preferences_t* prefsPtr); 
-
-/*! LZ4F_compressBound() : 
- *  Provides minimum dstCapacity required to guarantee success of 
- *  LZ4F_compressUpdate(), given a srcSize and preferences, for a worst case scenario. 
- *  When srcSize==0, LZ4F_compressBound() provides an upper bound for LZ4F_flush() and LZ4F_compressEnd() instead. 
- *  Note that the result is only valid for a single invocation of LZ4F_compressUpdate(). 
- *  When invoking LZ4F_compressUpdate() multiple times, 
- *  if the output buffer is gradually filled up instead of emptied and re-used from its start, 
- *  one must check if there is enough remaining capacity before each invocation, using LZ4F_compressBound(). 
- * @return is always the same for a srcSize and prefsPtr. 
- *  prefsPtr is optional : when NULL is provided, preferences will be set to cover worst case scenario. 
- *  tech details : 
+LZ4FLIB_API size_t LZ4F_compressBegin(LZ4F_cctx* cctx,
+                                      void* dstBuffer, size_t dstCapacity,
+                                      const LZ4F_preferences_t* prefsPtr);
+
+/*! LZ4F_compressBound() :
+ *  Provides minimum dstCapacity required to guarantee success of
+ *  LZ4F_compressUpdate(), given a srcSize and preferences, for a worst case scenario.
+ *  When srcSize==0, LZ4F_compressBound() provides an upper bound for LZ4F_flush() and LZ4F_compressEnd() instead.
+ *  Note that the result is only valid for a single invocation of LZ4F_compressUpdate().
+ *  When invoking LZ4F_compressUpdate() multiple times,
+ *  if the output buffer is gradually filled up instead of emptied and re-used from its start,
+ *  one must check if there is enough remaining capacity before each invocation, using LZ4F_compressBound().
+ * @return is always the same for a srcSize and prefsPtr.
+ *  prefsPtr is optional : when NULL is provided, preferences will be set to cover worst case scenario.
+ *  tech details :
  * @return if automatic flushing is not enabled, includes the possibility that internal buffer might already be filled by up to (blockSize-1) bytes.
- *  It also includes frame footer (ending + checksum), since it might be generated by LZ4F_compressEnd(). 
- * @return doesn't include frame header, as it was already generated by LZ4F_compressBegin(). 
- */ 
+ *  It also includes frame footer (ending + checksum), since it might be generated by LZ4F_compressEnd().
+ * @return doesn't include frame header, as it was already generated by LZ4F_compressBegin().
+ */
 LZ4FLIB_API size_t LZ4F_compressBound(size_t srcSize, const LZ4F_preferences_t* prefsPtr);
 
-/*! LZ4F_compressUpdate() : 
- *  LZ4F_compressUpdate() can be called repetitively to compress as much data as necessary. 
- *  Important rule: dstCapacity MUST be large enough to ensure operation success even in worst case situations. 
- *  This value is provided by LZ4F_compressBound(). 
- *  If this condition is not respected, LZ4F_compress() will fail (result is an errorCode). 
- *  LZ4F_compressUpdate() doesn't guarantee error recovery. 
- *  When an error occurs, compression context must be freed or resized. 
+/*! LZ4F_compressUpdate() :
+ *  LZ4F_compressUpdate() can be called repetitively to compress as much data as necessary.
+ *  Important rule: dstCapacity MUST be large enough to ensure operation success even in worst case situations.
+ *  This value is provided by LZ4F_compressBound().
+ *  If this condition is not respected, LZ4F_compress() will fail (result is an errorCode).
+ *  LZ4F_compressUpdate() doesn't guarantee error recovery.
+ *  When an error occurs, compression context must be freed or resized.
  * `cOptPtr` is optional : NULL can be provided, in which case all options are set to default.
  * @return : number of bytes written into `dstBuffer` (it can be zero, meaning input data was just buffered).
  *           or an error code if it fails (which can be tested using LZ4F_isError())
  */
-LZ4FLIB_API size_t LZ4F_compressUpdate(LZ4F_cctx* cctx, 
-                                       void* dstBuffer, size_t dstCapacity, 
-                                 const void* srcBuffer, size_t srcSize, 
-                                 const LZ4F_compressOptions_t* cOptPtr); 
-
-/*! LZ4F_flush() : 
- *  When data must be generated and sent immediately, without waiting for a block to be completely filled, 
- *  it's possible to call LZ4_flush(). It will immediately compress any data buffered within cctx. 
+LZ4FLIB_API size_t LZ4F_compressUpdate(LZ4F_cctx* cctx,
+                                       void* dstBuffer, size_t dstCapacity,
+                                 const void* srcBuffer, size_t srcSize,
+                                 const LZ4F_compressOptions_t* cOptPtr);
+
+/*! LZ4F_flush() :
+ *  When data must be generated and sent immediately, without waiting for a block to be completely filled,
+ *  it's possible to call LZ4_flush(). It will immediately compress any data buffered within cctx.
  * `dstCapacity` must be large enough to ensure the operation will be successful.
  * `cOptPtr` is optional : it's possible to provide NULL, all options will be set to default.
- * @return : nb of bytes written into dstBuffer (can be zero, when there is no data stored within cctx) 
+ * @return : nb of bytes written into dstBuffer (can be zero, when there is no data stored within cctx)
  *           or an error code if it fails (which can be tested using LZ4F_isError())
- *  Note : LZ4F_flush() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr). 
+ *  Note : LZ4F_flush() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr).
  */
-LZ4FLIB_API size_t LZ4F_flush(LZ4F_cctx* cctx, 
-                              void* dstBuffer, size_t dstCapacity, 
-                        const LZ4F_compressOptions_t* cOptPtr); 
-
-/*! LZ4F_compressEnd() : 
- *  To properly finish an LZ4 frame, invoke LZ4F_compressEnd(). 
- *  It will flush whatever data remained within `cctx` (like LZ4_flush()) 
- *  and properly finalize the frame, with an endMark and a checksum. 
+LZ4FLIB_API size_t LZ4F_flush(LZ4F_cctx* cctx,
+                              void* dstBuffer, size_t dstCapacity,
+                        const LZ4F_compressOptions_t* cOptPtr);
+
+/*! LZ4F_compressEnd() :
+ *  To properly finish an LZ4 frame, invoke LZ4F_compressEnd().
+ *  It will flush whatever data remained within `cctx` (like LZ4_flush())
+ *  and properly finalize the frame, with an endMark and a checksum.
  * `cOptPtr` is optional : NULL can be provided, in which case all options will be set to default.
- * @return : nb of bytes written into dstBuffer, necessarily >= 4 (endMark), 
+ * @return : nb of bytes written into dstBuffer, necessarily >= 4 (endMark),
  *           or an error code if it fails (which can be tested using LZ4F_isError())
- *  Note : LZ4F_compressEnd() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr). 
- *  A successful call to LZ4F_compressEnd() makes `cctx` available again for another compression task. 
+ *  Note : LZ4F_compressEnd() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr).
+ *  A successful call to LZ4F_compressEnd() makes `cctx` available again for another compression task.
  */
-LZ4FLIB_API size_t LZ4F_compressEnd(LZ4F_cctx* cctx, 
-                                    void* dstBuffer, size_t dstCapacity, 
-                              const LZ4F_compressOptions_t* cOptPtr); 
+LZ4FLIB_API size_t LZ4F_compressEnd(LZ4F_cctx* cctx,
+                                    void* dstBuffer, size_t dstCapacity,
+                              const LZ4F_compressOptions_t* cOptPtr);
 
 
 /*-*********************************
@@ -347,120 +347,120 @@ typedef struct LZ4F_dctx_s LZ4F_dctx;   /* incomplete type */
 typedef LZ4F_dctx* LZ4F_decompressionContext_t;   /* compatibility with previous API versions */
 
 typedef struct {
-  unsigned stableDst;    /* pledges that last 64KB decompressed data will remain available unmodified. This optimization skips storage operations in tmp buffers. */ 
-  unsigned reserved[3];  /* must be set to zero for forward compatibility */ 
+  unsigned stableDst;    /* pledges that last 64KB decompressed data will remain available unmodified. This optimization skips storage operations in tmp buffers. */
+  unsigned reserved[3];  /* must be set to zero for forward compatibility */
 } LZ4F_decompressOptions_t;
 
 
 /* Resource management */
 
-/*! LZ4F_createDecompressionContext() : 
- *  Create an LZ4F_dctx object, to track all decompression operations. 
- *  The version provided MUST be LZ4F_VERSION. 
- *  The function provides a pointer to an allocated and initialized LZ4F_dctx object. 
- *  The result is an errorCode, which can be tested using LZ4F_isError(). 
- *  dctx memory can be released using LZ4F_freeDecompressionContext(); 
- *  Result of LZ4F_freeDecompressionContext() indicates current state of decompressionContext when being released. 
- *  That is, it should be == 0 if decompression has been completed fully and correctly. 
+/*! LZ4F_createDecompressionContext() :
+ *  Create an LZ4F_dctx object, to track all decompression operations.
+ *  The version provided MUST be LZ4F_VERSION.
+ *  The function provides a pointer to an allocated and initialized LZ4F_dctx object.
+ *  The result is an errorCode, which can be tested using LZ4F_isError().
+ *  dctx memory can be released using LZ4F_freeDecompressionContext();
+ *  Result of LZ4F_freeDecompressionContext() indicates current state of decompressionContext when being released.
+ *  That is, it should be == 0 if decompression has been completed fully and correctly.
  */
 LZ4FLIB_API LZ4F_errorCode_t LZ4F_createDecompressionContext(LZ4F_dctx** dctxPtr, unsigned version);
-LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx); 
-
-
-/*-*********************************** 
-*  Streaming decompression functions 
-*************************************/ 
-
-#define LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH 5 
- 
-/*! LZ4F_headerSize() : v1.9.0+ 
- *  Provide the header size of a frame starting at `src`. 
- * `srcSize` must be >= LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH, 
- *  which is enough to decode the header length. 
- * @return : size of frame header 
- *           or an error code, which can be tested using LZ4F_isError() 
- *  note : Frame header size is variable, but is guaranteed to be 
- *         >= LZ4F_HEADER_SIZE_MIN bytes, and <= LZ4F_HEADER_SIZE_MAX bytes. 
+LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx);
+
+
+/*-***********************************
+*  Streaming decompression functions
+*************************************/
+
+#define LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH 5
+
+/*! LZ4F_headerSize() : v1.9.0+
+ *  Provide the header size of a frame starting at `src`.
+ * `srcSize` must be >= LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH,
+ *  which is enough to decode the header length.
+ * @return : size of frame header
+ *           or an error code, which can be tested using LZ4F_isError()
+ *  note : Frame header size is variable, but is guaranteed to be
+ *         >= LZ4F_HEADER_SIZE_MIN bytes, and <= LZ4F_HEADER_SIZE_MAX bytes.
  */
 LZ4FLIB_API size_t LZ4F_headerSize(const void* src, size_t srcSize);
- 
-/*! LZ4F_getFrameInfo() : 
- *  This function extracts frame parameters (max blockSize, dictID, etc.). 
- *  Its usage is optional: user can call LZ4F_decompress() directly. 
- * 
- *  Extracted information will fill an existing LZ4F_frameInfo_t structure. 
- *  This can be useful for allocation and dictionary identification purposes. 
- * 
- *  LZ4F_getFrameInfo() can work in the following situations : 
- * 
- *  1) At the beginning of a new frame, before any invocation of LZ4F_decompress(). 
- *     It will decode header from `srcBuffer`, 
- *     consuming the header and starting the decoding process. 
- * 
- *     Input size must be large enough to contain the full frame header. 
- *     Frame header size can be known beforehand by LZ4F_headerSize(). 
- *     Frame header size is variable, but is guaranteed to be >= LZ4F_HEADER_SIZE_MIN bytes, 
- *     and not more than <= LZ4F_HEADER_SIZE_MAX bytes. 
- *     Hence, blindly providing LZ4F_HEADER_SIZE_MAX bytes or more will always work. 
- *     It's allowed to provide more input data than the header size, 
- *     LZ4F_getFrameInfo() will only consume the header. 
- * 
- *     If input size is not large enough, 
- *     aka if it's smaller than header size, 
- *     function will fail and return an error code. 
- * 
- *  2) After decoding has been started, 
- *     it's possible to invoke LZ4F_getFrameInfo() anytime 
- *     to extract already decoded frame parameters stored within dctx. 
- * 
- *     Note that, if decoding has barely started, 
- *     and not yet read enough information to decode the header, 
- *     LZ4F_getFrameInfo() will fail. 
- * 
- *  The number of bytes consumed from srcBuffer will be updated in *srcSizePtr (necessarily <= original value). 
- *  LZ4F_getFrameInfo() only consumes bytes when decoding has not yet started, 
- *  and when decoding the header has been successful. 
- *  Decompression must then resume from (srcBuffer + *srcSizePtr). 
- * 
- * @return : a hint about how many srcSize bytes LZ4F_decompress() expects for next call, 
- *           or an error code which can be tested using LZ4F_isError(). 
- *  note 1 : in case of error, dctx is not modified. Decoding operation can resume from beginning safely. 
- *  note 2 : frame parameters are *copied into* an already allocated LZ4F_frameInfo_t structure. 
- */ 
+
+/*! LZ4F_getFrameInfo() :
+ *  This function extracts frame parameters (max blockSize, dictID, etc.).
+ *  Its usage is optional: user can call LZ4F_decompress() directly.
+ *
+ *  Extracted information will fill an existing LZ4F_frameInfo_t structure.
+ *  This can be useful for allocation and dictionary identification purposes.
+ *
+ *  LZ4F_getFrameInfo() can work in the following situations :
+ *
+ *  1) At the beginning of a new frame, before any invocation of LZ4F_decompress().
+ *     It will decode header from `srcBuffer`,
+ *     consuming the header and starting the decoding process.
+ *
+ *     Input size must be large enough to contain the full frame header.
+ *     Frame header size can be known beforehand by LZ4F_headerSize().
+ *     Frame header size is variable, but is guaranteed to be >= LZ4F_HEADER_SIZE_MIN bytes,
+ *     and not more than <= LZ4F_HEADER_SIZE_MAX bytes.
+ *     Hence, blindly providing LZ4F_HEADER_SIZE_MAX bytes or more will always work.
+ *     It's allowed to provide more input data than the header size,
+ *     LZ4F_getFrameInfo() will only consume the header.
+ *
+ *     If input size is not large enough,
+ *     aka if it's smaller than header size,
+ *     function will fail and return an error code.
+ *
+ *  2) After decoding has been started,
+ *     it's possible to invoke LZ4F_getFrameInfo() anytime
+ *     to extract already decoded frame parameters stored within dctx.
+ *
+ *     Note that, if decoding has barely started,
+ *     and not yet read enough information to decode the header,
+ *     LZ4F_getFrameInfo() will fail.
+ *
+ *  The number of bytes consumed from srcBuffer will be updated in *srcSizePtr (necessarily <= original value).
+ *  LZ4F_getFrameInfo() only consumes bytes when decoding has not yet started,
+ *  and when decoding the header has been successful.
+ *  Decompression must then resume from (srcBuffer + *srcSizePtr).
+ *
+ * @return : a hint about how many srcSize bytes LZ4F_decompress() expects for next call,
+ *           or an error code which can be tested using LZ4F_isError().
+ *  note 1 : in case of error, dctx is not modified. Decoding operation can resume from beginning safely.
+ *  note 2 : frame parameters are *copied into* an already allocated LZ4F_frameInfo_t structure.
+ */
 LZ4FLIB_API size_t LZ4F_getFrameInfo(LZ4F_dctx* dctx,
                                      LZ4F_frameInfo_t* frameInfoPtr,
                                      const void* srcBuffer, size_t* srcSizePtr);
 
-/*! LZ4F_decompress() : 
+/*! LZ4F_decompress() :
  *  Call this function repetitively to regenerate data compressed in `srcBuffer`.
  *
  *  The function requires a valid dctx state.
  *  It will read up to *srcSizePtr bytes from srcBuffer,
- *  and decompress data into dstBuffer, of capacity *dstSizePtr. 
+ *  and decompress data into dstBuffer, of capacity *dstSizePtr.
  *
- *  The nb of bytes consumed from srcBuffer will be written into *srcSizePtr (necessarily <= original value). 
- *  The nb of bytes decompressed into dstBuffer will be written into *dstSizePtr (necessarily <= original value). 
+ *  The nb of bytes consumed from srcBuffer will be written into *srcSizePtr (necessarily <= original value).
+ *  The nb of bytes decompressed into dstBuffer will be written into *dstSizePtr (necessarily <= original value).
  *
- *  The function does not necessarily read all input bytes, so always check value in *srcSizePtr. 
- *  Unconsumed source data must be presented again in subsequent invocations. 
+ *  The function does not necessarily read all input bytes, so always check value in *srcSizePtr.
+ *  Unconsumed source data must be presented again in subsequent invocations.
  *
- * `dstBuffer` can freely change between each consecutive function invocation. 
- * `dstBuffer` content will be overwritten. 
+ * `dstBuffer` can freely change between each consecutive function invocation.
+ * `dstBuffer` content will be overwritten.
  *
- * @return : an hint of how many `srcSize` bytes LZ4F_decompress() expects for next call. 
- *  Schematically, it's the size of the current (or remaining) compressed block + header of next block. 
- *  Respecting the hint provides some small speed benefit, because it skips intermediate buffers. 
- *  This is just a hint though, it's always possible to provide any srcSize. 
+ * @return : an hint of how many `srcSize` bytes LZ4F_decompress() expects for next call.
+ *  Schematically, it's the size of the current (or remaining) compressed block + header of next block.
+ *  Respecting the hint provides some small speed benefit, because it skips intermediate buffers.
+ *  This is just a hint though, it's always possible to provide any srcSize.
  *
- *  When a frame is fully decoded, @return will be 0 (no more data expected). 
- *  When provided with more bytes than necessary to decode a frame, 
- *  LZ4F_decompress() will stop reading exactly at end of current frame, and @return 0. 
- * 
- *  If decompression failed, @return is an error code, which can be tested using LZ4F_isError(). 
- *  After a decompression error, the `dctx` context is not resumable. 
- *  Use LZ4F_resetDecompressionContext() to return to clean state. 
- * 
- *  After a frame is fully decoded, dctx can be used again to decompress another frame. 
+ *  When a frame is fully decoded, @return will be 0 (no more data expected).
+ *  When provided with more bytes than necessary to decode a frame,
+ *  LZ4F_decompress() will stop reading exactly at end of current frame, and @return 0.
+ *
+ *  If decompression failed, @return is an error code, which can be tested using LZ4F_isError().
+ *  After a decompression error, the `dctx` context is not resumable.
+ *  Use LZ4F_resetDecompressionContext() to return to clean state.
+ *
+ *  After a frame is fully decoded, dctx can be used again to decompress another frame.
  */
 LZ4FLIB_API size_t LZ4F_decompress(LZ4F_dctx* dctx,
                                    void* dstBuffer, size_t* dstSizePtr,
@@ -468,156 +468,156 @@ LZ4FLIB_API size_t LZ4F_decompress(LZ4F_dctx* dctx,
                                    const LZ4F_decompressOptions_t* dOptPtr);
 
 
-/*! LZ4F_resetDecompressionContext() : added in v1.8.0 
- *  In case of an error, the context is left in "undefined" state. 
- *  In which case, it's necessary to reset it, before re-using it. 
- *  This method can also be used to abruptly stop any unfinished decompression, 
- *  and start a new one using same context resources. */ 
-LZ4FLIB_API void LZ4F_resetDecompressionContext(LZ4F_dctx* dctx);   /* always successful */ 
+/*! LZ4F_resetDecompressionContext() : added in v1.8.0
+ *  In case of an error, the context is left in "undefined" state.
+ *  In which case, it's necessary to reset it, before re-using it.
+ *  This method can also be used to abruptly stop any unfinished decompression,
+ *  and start a new one using same context resources. */
+LZ4FLIB_API void LZ4F_resetDecompressionContext(LZ4F_dctx* dctx);   /* always successful */
+
+
 
- 
- 
 #if defined (__cplusplus)
 }
 #endif
 
 #endif  /* LZ4F_H_09782039843 */
- 
-#if defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843) 
-#define LZ4F_H_STATIC_09782039843 
- 
-#if defined (__cplusplus) 
-extern "C" { 
-#endif 
- 
-/* These declarations are not stable and may change in the future. 
- * They are therefore only safe to depend on 
- * when the caller is statically linked against the library. 
- * To access their declarations, define LZ4F_STATIC_LINKING_ONLY. 
- * 
- * By default, these symbols aren't published into shared/dynamic libraries. 
- * You can override this behavior and force them to be published 
- * by defining LZ4F_PUBLISH_STATIC_FUNCTIONS. 
- * Use at your own risk. 
- */ 
-#ifdef LZ4F_PUBLISH_STATIC_FUNCTIONS 
+
+#if defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843)
+#define LZ4F_H_STATIC_09782039843
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+/* These declarations are not stable and may change in the future.
+ * They are therefore only safe to depend on
+ * when the caller is statically linked against the library.
+ * To access their declarations, define LZ4F_STATIC_LINKING_ONLY.
+ *
+ * By default, these symbols aren't published into shared/dynamic libraries.
+ * You can override this behavior and force them to be published
+ * by defining LZ4F_PUBLISH_STATIC_FUNCTIONS.
+ * Use at your own risk.
+ */
+#ifdef LZ4F_PUBLISH_STATIC_FUNCTIONS
 # define LZ4FLIB_STATIC_API LZ4FLIB_API
-#else 
+#else
 # define LZ4FLIB_STATIC_API
-#endif 
- 
- 
-/* ---   Error List   --- */ 
-#define LZ4F_LIST_ERRORS(ITEM) \ 
-        ITEM(OK_NoError) \ 
-        ITEM(ERROR_GENERIC) \ 
-        ITEM(ERROR_maxBlockSize_invalid) \ 
-        ITEM(ERROR_blockMode_invalid) \ 
-        ITEM(ERROR_contentChecksumFlag_invalid) \ 
-        ITEM(ERROR_compressionLevel_invalid) \ 
-        ITEM(ERROR_headerVersion_wrong) \ 
-        ITEM(ERROR_blockChecksum_invalid) \ 
-        ITEM(ERROR_reservedFlag_set) \ 
-        ITEM(ERROR_allocation_failed) \ 
-        ITEM(ERROR_srcSize_tooLarge) \ 
-        ITEM(ERROR_dstMaxSize_tooSmall) \ 
-        ITEM(ERROR_frameHeader_incomplete) \ 
-        ITEM(ERROR_frameType_unknown) \ 
-        ITEM(ERROR_frameSize_wrong) \ 
-        ITEM(ERROR_srcPtr_wrong) \ 
-        ITEM(ERROR_decompressionFailed) \ 
-        ITEM(ERROR_headerChecksum_invalid) \ 
-        ITEM(ERROR_contentChecksum_invalid) \ 
-        ITEM(ERROR_frameDecoding_alreadyStarted) \ 
-        ITEM(ERROR_maxCode) 
- 
-#define LZ4F_GENERATE_ENUM(ENUM) LZ4F_##ENUM, 
- 
-/* enum list is exposed, to handle specific errors */ 
-typedef enum { LZ4F_LIST_ERRORS(LZ4F_GENERATE_ENUM) 
-              _LZ4F_dummy_error_enum_for_c89_never_used } LZ4F_errorCodes; 
- 
-LZ4FLIB_STATIC_API LZ4F_errorCodes LZ4F_getErrorCode(size_t functionResult); 
- 
-LZ4FLIB_STATIC_API size_t LZ4F_getBlockSize(unsigned); 
- 
-/********************************** 
- *  Bulk processing dictionary API 
- *********************************/ 
- 
-/* A Dictionary is useful for the compression of small messages (KB range). 
- * It dramatically improves compression efficiency. 
- * 
- * LZ4 can ingest any input as dictionary, though only the last 64 KB are useful. 
- * Best results are generally achieved by using Zstandard's Dictionary Builder 
- * to generate a high-quality dictionary from a set of samples. 
- * 
- * Loading a dictionary has a cost, since it involves construction of tables. 
- * The Bulk processing dictionary API makes it possible to share this cost 
- * over an arbitrary number of compression jobs, even concurrently, 
- * markedly improving compression latency for these cases. 
- * 
- * The same dictionary will have to be used on the decompression side 
- * for decoding to be successful. 
- * To help identify the correct dictionary at decoding stage, 
- * the frame header allows optional embedding of a dictID field. 
- */ 
-typedef struct LZ4F_CDict_s LZ4F_CDict; 
- 
-/*! LZ4_createCDict() : 
- *  When compressing multiple messages / blocks using the same dictionary, it's recommended to load it just once. 
- *  LZ4_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay. 
- *  LZ4_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only. 
- * `dictBuffer` can be released after LZ4_CDict creation, since its content is copied within CDict */ 
-LZ4FLIB_STATIC_API LZ4F_CDict* LZ4F_createCDict(const void* dictBuffer, size_t dictSize); 
-LZ4FLIB_STATIC_API void        LZ4F_freeCDict(LZ4F_CDict* CDict); 
- 
- 
-/*! LZ4_compressFrame_usingCDict() : 
- *  Compress an entire srcBuffer into a valid LZ4 frame using a digested Dictionary. 
- *  cctx must point to a context created by LZ4F_createCompressionContext(). 
- *  If cdict==NULL, compress without a dictionary. 
- *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr). 
- *  If this condition is not respected, function will fail (@return an errorCode). 
- *  The LZ4F_preferences_t structure is optional : you may provide NULL as argument, 
- *  but it's not recommended, as it's the only way to provide dictID in the frame header. 
- * @return : number of bytes written into dstBuffer. 
- *           or an error code if it fails (can be tested using LZ4F_isError()) */ 
-LZ4FLIB_STATIC_API size_t LZ4F_compressFrame_usingCDict( 
-    LZ4F_cctx* cctx, 
-    void* dst, size_t dstCapacity, 
-    const void* src, size_t srcSize, 
-    const LZ4F_CDict* cdict, 
-    const LZ4F_preferences_t* preferencesPtr); 
- 
- 
-/*! LZ4F_compressBegin_usingCDict() : 
- *  Inits streaming dictionary compression, and writes the frame header into dstBuffer. 
- *  dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes. 
- * `prefsPtr` is optional : you may provide NULL as argument, 
- *  however, it's the only way to provide dictID in the frame header. 
- * @return : number of bytes written into dstBuffer for the header, 
- *           or an error code (which can be tested using LZ4F_isError()) */ 
-LZ4FLIB_STATIC_API size_t LZ4F_compressBegin_usingCDict( 
-    LZ4F_cctx* cctx, 
-    void* dstBuffer, size_t dstCapacity, 
-    const LZ4F_CDict* cdict, 
-    const LZ4F_preferences_t* prefsPtr); 
- 
- 
-/*! LZ4F_decompress_usingDict() : 
- *  Same as LZ4F_decompress(), using a predefined dictionary. 
- *  Dictionary is used "in place", without any preprocessing. 
- *  It must remain accessible throughout the entire frame decoding. */ 
-LZ4FLIB_STATIC_API size_t LZ4F_decompress_usingDict( 
-    LZ4F_dctx* dctxPtr, 
-    void* dstBuffer, size_t* dstSizePtr, 
-    const void* srcBuffer, size_t* srcSizePtr, 
-    const void* dict, size_t dictSize, 
-    const LZ4F_decompressOptions_t* decompressOptionsPtr); 
- 
-#if defined (__cplusplus) 
-} 
-#endif 
- 
-#endif  /* defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843) */ 
+#endif
+
+
+/* ---   Error List   --- */
+#define LZ4F_LIST_ERRORS(ITEM) \
+        ITEM(OK_NoError) \
+        ITEM(ERROR_GENERIC) \
+        ITEM(ERROR_maxBlockSize_invalid) \
+        ITEM(ERROR_blockMode_invalid) \
+        ITEM(ERROR_contentChecksumFlag_invalid) \
+        ITEM(ERROR_compressionLevel_invalid) \
+        ITEM(ERROR_headerVersion_wrong) \
+        ITEM(ERROR_blockChecksum_invalid) \
+        ITEM(ERROR_reservedFlag_set) \
+        ITEM(ERROR_allocation_failed) \
+        ITEM(ERROR_srcSize_tooLarge) \
+        ITEM(ERROR_dstMaxSize_tooSmall) \
+        ITEM(ERROR_frameHeader_incomplete) \
+        ITEM(ERROR_frameType_unknown) \
+        ITEM(ERROR_frameSize_wrong) \
+        ITEM(ERROR_srcPtr_wrong) \
+        ITEM(ERROR_decompressionFailed) \
+        ITEM(ERROR_headerChecksum_invalid) \
+        ITEM(ERROR_contentChecksum_invalid) \
+        ITEM(ERROR_frameDecoding_alreadyStarted) \
+        ITEM(ERROR_maxCode)
+
+#define LZ4F_GENERATE_ENUM(ENUM) LZ4F_##ENUM,
+
+/* enum list is exposed, to handle specific errors */
+typedef enum { LZ4F_LIST_ERRORS(LZ4F_GENERATE_ENUM)
+              _LZ4F_dummy_error_enum_for_c89_never_used } LZ4F_errorCodes;
+
+LZ4FLIB_STATIC_API LZ4F_errorCodes LZ4F_getErrorCode(size_t functionResult);
+
+LZ4FLIB_STATIC_API size_t LZ4F_getBlockSize(unsigned);
+
+/**********************************
+ *  Bulk processing dictionary API
+ *********************************/
+
+/* A Dictionary is useful for the compression of small messages (KB range).
+ * It dramatically improves compression efficiency.
+ *
+ * LZ4 can ingest any input as dictionary, though only the last 64 KB are useful.
+ * Best results are generally achieved by using Zstandard's Dictionary Builder
+ * to generate a high-quality dictionary from a set of samples.
+ *
+ * Loading a dictionary has a cost, since it involves construction of tables.
+ * The Bulk processing dictionary API makes it possible to share this cost
+ * over an arbitrary number of compression jobs, even concurrently,
+ * markedly improving compression latency for these cases.
+ *
+ * The same dictionary will have to be used on the decompression side
+ * for decoding to be successful.
+ * To help identify the correct dictionary at decoding stage,
+ * the frame header allows optional embedding of a dictID field.
+ */
+typedef struct LZ4F_CDict_s LZ4F_CDict;
+
+/*! LZ4_createCDict() :
+ *  When compressing multiple messages / blocks using the same dictionary, it's recommended to load it just once.
+ *  LZ4_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
+ *  LZ4_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.
+ * `dictBuffer` can be released after LZ4_CDict creation, since its content is copied within CDict */
+LZ4FLIB_STATIC_API LZ4F_CDict* LZ4F_createCDict(const void* dictBuffer, size_t dictSize);
+LZ4FLIB_STATIC_API void        LZ4F_freeCDict(LZ4F_CDict* CDict);
+
+
+/*! LZ4_compressFrame_usingCDict() :
+ *  Compress an entire srcBuffer into a valid LZ4 frame using a digested Dictionary.
+ *  cctx must point to a context created by LZ4F_createCompressionContext().
+ *  If cdict==NULL, compress without a dictionary.
+ *  dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
+ *  If this condition is not respected, function will fail (@return an errorCode).
+ *  The LZ4F_preferences_t structure is optional : you may provide NULL as argument,
+ *  but it's not recommended, as it's the only way to provide dictID in the frame header.
+ * @return : number of bytes written into dstBuffer.
+ *           or an error code if it fails (can be tested using LZ4F_isError()) */
+LZ4FLIB_STATIC_API size_t LZ4F_compressFrame_usingCDict(
+    LZ4F_cctx* cctx,
+    void* dst, size_t dstCapacity,
+    const void* src, size_t srcSize,
+    const LZ4F_CDict* cdict,
+    const LZ4F_preferences_t* preferencesPtr);
+
+
+/*! LZ4F_compressBegin_usingCDict() :
+ *  Inits streaming dictionary compression, and writes the frame header into dstBuffer.
+ *  dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes.
+ * `prefsPtr` is optional : you may provide NULL as argument,
+ *  however, it's the only way to provide dictID in the frame header.
+ * @return : number of bytes written into dstBuffer for the header,
+ *           or an error code (which can be tested using LZ4F_isError()) */
+LZ4FLIB_STATIC_API size_t LZ4F_compressBegin_usingCDict(
+    LZ4F_cctx* cctx,
+    void* dstBuffer, size_t dstCapacity,
+    const LZ4F_CDict* cdict,
+    const LZ4F_preferences_t* prefsPtr);
+
+
+/*! LZ4F_decompress_usingDict() :
+ *  Same as LZ4F_decompress(), using a predefined dictionary.
+ *  Dictionary is used "in place", without any preprocessing.
+ *  It must remain accessible throughout the entire frame decoding. */
+LZ4FLIB_STATIC_API size_t LZ4F_decompress_usingDict(
+    LZ4F_dctx* dctxPtr,
+    void* dstBuffer, size_t* dstSizePtr,
+    const void* srcBuffer, size_t* srcSizePtr,
+    const void* dict, size_t dictSize,
+    const LZ4F_decompressOptions_t* decompressOptionsPtr);
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif  /* defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843) */
diff --git a/contrib/libs/lz4/lz4hc.c b/contrib/libs/lz4/lz4hc.c
index 6e5ea27f1d..a556d47920 100644
--- a/contrib/libs/lz4/lz4hc.c
+++ b/contrib/libs/lz4/lz4hc.c
@@ -1,6 +1,6 @@
 /*
     LZ4 HC - High Compression Mode of LZ4
-    Copyright (C) 2011-2017, Yann Collet. 
+    Copyright (C) 2011-2017, Yann Collet.
 
     BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
 
@@ -38,18 +38,18 @@
 *  Tuning Parameter
 ***************************************/
 
-/*! HEAPMODE : 
- *  Select how default compression function will allocate workplace memory, 
- *  in stack (0:fastest), or in heap (1:requires malloc()). 
- *  Since workplace is rather large, heap mode is recommended. 
+/*! HEAPMODE :
+ *  Select how default compression function will allocate workplace memory,
+ *  in stack (0:fastest), or in heap (1:requires malloc()).
+ *  Since workplace is rather large, heap mode is recommended.
  */
 #ifndef LZ4HC_HEAPMODE
 #  define LZ4HC_HEAPMODE 1
 #endif
 
 
-/*===    Dependency    ===*/ 
-#define LZ4_HC_STATIC_LINKING_ONLY 
+/*===    Dependency    ===*/
+#define LZ4_HC_STATIC_LINKING_ONLY
 #include "lz4hc.h"
 
 
@@ -62,28 +62,28 @@
 #endif
 
 #define LZ4_COMMONDEFS_ONLY
-#ifndef LZ4_SRC_INCLUDED 
-#include "lz4.c"   /* LZ4_count, constants, mem */ 
-#endif 
+#ifndef LZ4_SRC_INCLUDED
+#include "lz4.c"   /* LZ4_count, constants, mem */
+#endif
 
 
 /*===   Enums   ===*/
 typedef enum { noDictCtx, usingDictCtxHc } dictCtx_directive;
 
 
-/*===   Constants   ===*/ 
+/*===   Constants   ===*/
 #define OPTIMAL_ML (int)((ML_MASK-1)+MINMATCH)
-#define LZ4_OPT_NUM   (1<<12) 
+#define LZ4_OPT_NUM   (1<<12)
 
 
-/*===   Macros   ===*/ 
-#define MIN(a,b)   ( (a) < (b) ? (a) : (b) ) 
-#define MAX(a,b)   ( (a) > (b) ? (a) : (b) ) 
-#define HASH_FUNCTION(i)         (((i) * 2654435761U) >> ((MINMATCH*8)-LZ4HC_HASH_LOG)) 
-#define DELTANEXTMAXD(p)         chainTable[(p) & LZ4HC_MAXD_MASK]    /* flexible, LZ4HC_MAXD dependent */ 
-#define DELTANEXTU16(table, pos) table[(U16)(pos)]   /* faster */ 
-/* Make fields passed to, and updated by LZ4HC_encodeSequence explicit */ 
-#define UPDATABLE(ip, op, anchor) &ip, &op, &anchor 
+/*===   Macros   ===*/
+#define MIN(a,b)   ( (a) < (b) ? (a) : (b) )
+#define MAX(a,b)   ( (a) > (b) ? (a) : (b) )
+#define HASH_FUNCTION(i)         (((i) * 2654435761U) >> ((MINMATCH*8)-LZ4HC_HASH_LOG))
+#define DELTANEXTMAXD(p)         chainTable[(p) & LZ4HC_MAXD_MASK]    /* flexible, LZ4HC_MAXD dependent */
+#define DELTANEXTU16(table, pos) table[(U16)(pos)]   /* faster */
+/* Make fields passed to, and updated by LZ4HC_encodeSequence explicit */
+#define UPDATABLE(ip, op, anchor) &ip, &op, &anchor
 
 static U32 LZ4HC_hashPtr(const void* ptr) { return HASH_FUNCTION(LZ4_read32(ptr)); }
 
@@ -91,31 +91,31 @@ static U32 LZ4HC_hashPtr(const void* ptr) { return HASH_FUNCTION(LZ4_read32(ptr)
 /**************************************
 *  HC Compression
 **************************************/
-static void LZ4HC_clearTables (LZ4HC_CCtx_internal* hc4) 
+static void LZ4HC_clearTables (LZ4HC_CCtx_internal* hc4)
 {
     MEM_INIT(hc4->hashTable, 0, sizeof(hc4->hashTable));
     MEM_INIT(hc4->chainTable, 0xFF, sizeof(hc4->chainTable));
-} 
- 
-static void LZ4HC_init_internal (LZ4HC_CCtx_internal* hc4, const BYTE* start) 
-{ 
-    uptrval startingOffset = (uptrval)(hc4->end - hc4->base); 
-    if (startingOffset > 1 GB) { 
-        LZ4HC_clearTables(hc4); 
-        startingOffset = 0; 
-    } 
-    startingOffset += 64 KB; 
-    hc4->nextToUpdate = (U32) startingOffset; 
-    hc4->base = start - startingOffset; 
+}
+
+static void LZ4HC_init_internal (LZ4HC_CCtx_internal* hc4, const BYTE* start)
+{
+    uptrval startingOffset = (uptrval)(hc4->end - hc4->base);
+    if (startingOffset > 1 GB) {
+        LZ4HC_clearTables(hc4);
+        startingOffset = 0;
+    }
+    startingOffset += 64 KB;
+    hc4->nextToUpdate = (U32) startingOffset;
+    hc4->base = start - startingOffset;
     hc4->end = start;
-    hc4->dictBase = start - startingOffset; 
-    hc4->dictLimit = (U32) startingOffset; 
-    hc4->lowLimit = (U32) startingOffset; 
+    hc4->dictBase = start - startingOffset;
+    hc4->dictLimit = (U32) startingOffset;
+    hc4->lowLimit = (U32) startingOffset;
 }
 
 
 /* Update chains up to ip (excluded) */
-LZ4_FORCE_INLINE void LZ4HC_Insert (LZ4HC_CCtx_internal* hc4, const BYTE* ip) 
+LZ4_FORCE_INLINE void LZ4HC_Insert (LZ4HC_CCtx_internal* hc4, const BYTE* ip)
 {
     U16* const chainTable = hc4->chainTable;
     U32* const hashTable  = hc4->hashTable;
@@ -126,8 +126,8 @@ LZ4_FORCE_INLINE void LZ4HC_Insert (LZ4HC_CCtx_internal* hc4, const BYTE* ip)
     while (idx < target) {
         U32 const h = LZ4HC_hashPtr(base+idx);
         size_t delta = idx - hashTable[h];
-        if (delta>LZ4_DISTANCE_MAX) delta = LZ4_DISTANCE_MAX; 
-        DELTANEXTU16(chainTable, idx) = (U16)delta; 
+        if (delta>LZ4_DISTANCE_MAX) delta = LZ4_DISTANCE_MAX;
+        DELTANEXTU16(chainTable, idx) = (U16)delta;
         hashTable[h] = idx;
         idx++;
     }
@@ -135,22 +135,22 @@ LZ4_FORCE_INLINE void LZ4HC_Insert (LZ4HC_CCtx_internal* hc4, const BYTE* ip)
     hc4->nextToUpdate = target;
 }
 
-/** LZ4HC_countBack() : 
- * @return : negative value, nb of common bytes before ip/match */ 
-LZ4_FORCE_INLINE 
-int LZ4HC_countBack(const BYTE* const ip, const BYTE* const match, 
-                    const BYTE* const iMin, const BYTE* const mMin) 
-{ 
-    int back = 0; 
-    int const min = (int)MAX(iMin - ip, mMin - match); 
-    assert(min <= 0); 
-    assert(ip >= iMin); assert((size_t)(ip-iMin) < (1U<<31)); 
-    assert(match >= mMin); assert((size_t)(match - mMin) < (1U<<31)); 
-    while ( (back > min) 
-         && (ip[back-1] == match[back-1]) ) 
-            back--; 
-    return back; 
-} 
+/** LZ4HC_countBack() :
+ * @return : negative value, nb of common bytes before ip/match */
+LZ4_FORCE_INLINE
+int LZ4HC_countBack(const BYTE* const ip, const BYTE* const match,
+                    const BYTE* const iMin, const BYTE* const mMin)
+{
+    int back = 0;
+    int const min = (int)MAX(iMin - ip, mMin - match);
+    assert(min <= 0);
+    assert(ip >= iMin); assert((size_t)(ip-iMin) < (1U<<31));
+    assert(match >= mMin); assert((size_t)(match - mMin) < (1U<<31));
+    while ( (back > min)
+         && (ip[back-1] == match[back-1]) )
+            back--;
+    return back;
+}
 
 #if defined(_MSC_VER)
 #  define LZ4HC_rotl32(x,r) _rotl(x,r)
@@ -166,59 +166,59 @@ static U32 LZ4HC_rotatePattern(size_t const rotate, U32 const pattern)
     return LZ4HC_rotl32(pattern, (int)bitsToRotate);
 }
 
-/* LZ4HC_countPattern() : 
- * pattern32 must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!) */ 
-static unsigned 
-LZ4HC_countPattern(const BYTE* ip, const BYTE* const iEnd, U32 const pattern32) 
+/* LZ4HC_countPattern() :
+ * pattern32 must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!) */
+static unsigned
+LZ4HC_countPattern(const BYTE* ip, const BYTE* const iEnd, U32 const pattern32)
 {
-    const BYTE* const iStart = ip; 
+    const BYTE* const iStart = ip;
     reg_t const pattern = (sizeof(pattern)==8) ?
         (reg_t)pattern32 + (((reg_t)pattern32) << (sizeof(pattern)*4)) : pattern32;
 
-    while (likely(ip < iEnd-(sizeof(pattern)-1))) { 
-        reg_t const diff = LZ4_read_ARCH(ip) ^ pattern; 
-        if (!diff) { ip+=sizeof(pattern); continue; } 
-        ip += LZ4_NbCommonBytes(diff); 
-        return (unsigned)(ip - iStart); 
-    } 
-
-    if (LZ4_isLittleEndian()) { 
-        reg_t patternByte = pattern; 
-        while ((ip<iEnd) && (*ip == (BYTE)patternByte)) { 
-            ip++; patternByte >>= 8; 
+    while (likely(ip < iEnd-(sizeof(pattern)-1))) {
+        reg_t const diff = LZ4_read_ARCH(ip) ^ pattern;
+        if (!diff) { ip+=sizeof(pattern); continue; }
+        ip += LZ4_NbCommonBytes(diff);
+        return (unsigned)(ip - iStart);
+    }
+
+    if (LZ4_isLittleEndian()) {
+        reg_t patternByte = pattern;
+        while ((ip<iEnd) && (*ip == (BYTE)patternByte)) {
+            ip++; patternByte >>= 8;
+        }
+    } else {  /* big endian */
+        U32 bitOffset = (sizeof(pattern)*8) - 8;
+        while (ip < iEnd) {
+            BYTE const byte = (BYTE)(pattern >> bitOffset);
+            if (*ip != byte) break;
+            ip ++; bitOffset -= 8;
         }
-    } else {  /* big endian */ 
-        U32 bitOffset = (sizeof(pattern)*8) - 8; 
-        while (ip < iEnd) { 
-            BYTE const byte = (BYTE)(pattern >> bitOffset); 
-            if (*ip != byte) break; 
-            ip ++; bitOffset -= 8; 
-        } 
     }
 
-    return (unsigned)(ip - iStart); 
+    return (unsigned)(ip - iStart);
+}
+
+/* LZ4HC_reverseCountPattern() :
+ * pattern must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!)
+ * read using natural platform endianess */
+static unsigned
+LZ4HC_reverseCountPattern(const BYTE* ip, const BYTE* const iLow, U32 pattern)
+{
+    const BYTE* const iStart = ip;
+
+    while (likely(ip >= iLow+4)) {
+        if (LZ4_read32(ip-4) != pattern) break;
+        ip -= 4;
+    }
+    {   const BYTE* bytePtr = (const BYTE*)(&pattern) + 3; /* works for any endianess */
+        while (likely(ip>iLow)) {
+            if (ip[-1] != *bytePtr) break;
+            ip--; bytePtr--;
+    }   }
+    return (unsigned)(iStart - ip);
 }
 
-/* LZ4HC_reverseCountPattern() : 
- * pattern must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!) 
- * read using natural platform endianess */ 
-static unsigned 
-LZ4HC_reverseCountPattern(const BYTE* ip, const BYTE* const iLow, U32 pattern) 
-{ 
-    const BYTE* const iStart = ip; 
-
-    while (likely(ip >= iLow+4)) { 
-        if (LZ4_read32(ip-4) != pattern) break; 
-        ip -= 4; 
-    } 
-    {   const BYTE* bytePtr = (const BYTE*)(&pattern) + 3; /* works for any endianess */ 
-        while (likely(ip>iLow)) { 
-            if (ip[-1] != *bytePtr) break; 
-            ip--; bytePtr--; 
-    }   } 
-    return (unsigned)(iStart - ip); 
-} 
- 
 /* LZ4HC_protectDictEnd() :
  * Checks if the match is in the last 3 bytes of the dictionary, so reading the
  * 4 byte MINMATCH would overflow.
@@ -229,11 +229,11 @@ static int LZ4HC_protectDictEnd(U32 const dictLimit, U32 const matchIndex)
     return ((U32)((dictLimit - 1) - matchIndex) >= 3);
 }
 
-typedef enum { rep_untested, rep_not, rep_confirmed } repeat_state_e; 
-typedef enum { favorCompressionRatio=0, favorDecompressionSpeed } HCfavor_e; 
- 
-LZ4_FORCE_INLINE int 
-LZ4HC_InsertAndGetWiderMatch ( 
+typedef enum { rep_untested, rep_not, rep_confirmed } repeat_state_e;
+typedef enum { favorCompressionRatio=0, favorDecompressionSpeed } HCfavor_e;
+
+LZ4_FORCE_INLINE int
+LZ4HC_InsertAndGetWiderMatch (
     LZ4HC_CCtx_internal* hc4,
     const BYTE* const ip,
     const BYTE* const iLowLimit,
@@ -241,116 +241,116 @@ LZ4HC_InsertAndGetWiderMatch (
     int longest,
     const BYTE** matchpos,
     const BYTE** startpos,
-    const int maxNbAttempts, 
-    const int patternAnalysis, 
-    const int chainSwap, 
-    const dictCtx_directive dict, 
-    const HCfavor_e favorDecSpeed) 
+    const int maxNbAttempts,
+    const int patternAnalysis,
+    const int chainSwap,
+    const dictCtx_directive dict,
+    const HCfavor_e favorDecSpeed)
 {
     U16* const chainTable = hc4->chainTable;
     U32* const HashTable = hc4->hashTable;
-    const LZ4HC_CCtx_internal * const dictCtx = hc4->dictCtx; 
+    const LZ4HC_CCtx_internal * const dictCtx = hc4->dictCtx;
     const BYTE* const base = hc4->base;
     const U32 dictLimit = hc4->dictLimit;
     const BYTE* const lowPrefixPtr = base + dictLimit;
-    const U32 ipIndex = (U32)(ip - base); 
+    const U32 ipIndex = (U32)(ip - base);
     const U32 lowestMatchIndex = (hc4->lowLimit + (LZ4_DISTANCE_MAX + 1) > ipIndex) ? hc4->lowLimit : ipIndex - LZ4_DISTANCE_MAX;
     const BYTE* const dictBase = hc4->dictBase;
-    int const lookBackLength = (int)(ip-iLowLimit); 
+    int const lookBackLength = (int)(ip-iLowLimit);
     int nbAttempts = maxNbAttempts;
-    U32 matchChainPos = 0; 
-    U32 const pattern = LZ4_read32(ip); 
-    U32 matchIndex; 
-    repeat_state_e repeat = rep_untested; 
-    size_t srcPatternLength = 0; 
+    U32 matchChainPos = 0;
+    U32 const pattern = LZ4_read32(ip);
+    U32 matchIndex;
+    repeat_state_e repeat = rep_untested;
+    size_t srcPatternLength = 0;
 
-    DEBUGLOG(7, "LZ4HC_InsertAndGetWiderMatch"); 
+    DEBUGLOG(7, "LZ4HC_InsertAndGetWiderMatch");
     /* First Match */
     LZ4HC_Insert(hc4, ip);
     matchIndex = HashTable[LZ4HC_hashPtr(ip)];
-    DEBUGLOG(7, "First match at index %u / %u (lowestMatchIndex)", 
-                matchIndex, lowestMatchIndex); 
+    DEBUGLOG(7, "First match at index %u / %u (lowestMatchIndex)",
+                matchIndex, lowestMatchIndex);
 
     while ((matchIndex>=lowestMatchIndex) && (nbAttempts>0)) {
-        int matchLength=0; 
+        int matchLength=0;
         nbAttempts--;
-        assert(matchIndex < ipIndex); 
-        if (favorDecSpeed && (ipIndex - matchIndex < 8)) { 
-            /* do nothing */ 
-        } else if (matchIndex >= dictLimit) {   /* within current Prefix */ 
-            const BYTE* const matchPtr = base + matchIndex; 
-            assert(matchPtr >= lowPrefixPtr); 
-            assert(matchPtr < ip); 
-            assert(longest >= 1); 
-            if (LZ4_read16(iLowLimit + longest - 1) == LZ4_read16(matchPtr - lookBackLength + longest - 1)) { 
-                if (LZ4_read32(matchPtr) == pattern) { 
-                    int const back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, lowPrefixPtr) : 0; 
-                    matchLength = MINMATCH + (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, iHighLimit); 
-                    matchLength -= back; 
-                    if (matchLength > longest) { 
-                        longest = matchLength; 
-                        *matchpos = matchPtr + back; 
-                        *startpos = ip + back; 
-            }   }   } 
-        } else {   /* lowestMatchIndex <= matchIndex < dictLimit */ 
-            const BYTE* const matchPtr = dictBase + matchIndex; 
-            if (LZ4_read32(matchPtr) == pattern) { 
-                const BYTE* const dictStart = dictBase + hc4->lowLimit; 
-                int back = 0; 
-                const BYTE* vLimit = ip + (dictLimit - matchIndex); 
-                if (vLimit > iHighLimit) vLimit = iHighLimit; 
-                matchLength = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH; 
-                if ((ip+matchLength == vLimit) && (vLimit < iHighLimit)) 
-                    matchLength += LZ4_count(ip+matchLength, lowPrefixPtr, iHighLimit); 
-                back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, dictStart) : 0; 
-                matchLength -= back; 
-                if (matchLength > longest) { 
-                    longest = matchLength; 
-                    *matchpos = base + matchIndex + back;   /* virtual pos, relative to ip, to retrieve offset */ 
-                    *startpos = ip + back; 
-        }   }   } 
-
-        if (chainSwap && matchLength==longest) {    /* better match => select a better chain */ 
-            assert(lookBackLength==0);   /* search forward only */ 
-            if (matchIndex + (U32)longest <= ipIndex) { 
+        assert(matchIndex < ipIndex);
+        if (favorDecSpeed && (ipIndex - matchIndex < 8)) {
+            /* do nothing */
+        } else if (matchIndex >= dictLimit) {   /* within current Prefix */
+            const BYTE* const matchPtr = base + matchIndex;
+            assert(matchPtr >= lowPrefixPtr);
+            assert(matchPtr < ip);
+            assert(longest >= 1);
+            if (LZ4_read16(iLowLimit + longest - 1) == LZ4_read16(matchPtr - lookBackLength + longest - 1)) {
+                if (LZ4_read32(matchPtr) == pattern) {
+                    int const back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, lowPrefixPtr) : 0;
+                    matchLength = MINMATCH + (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, iHighLimit);
+                    matchLength -= back;
+                    if (matchLength > longest) {
+                        longest = matchLength;
+                        *matchpos = matchPtr + back;
+                        *startpos = ip + back;
+            }   }   }
+        } else {   /* lowestMatchIndex <= matchIndex < dictLimit */
+            const BYTE* const matchPtr = dictBase + matchIndex;
+            if (LZ4_read32(matchPtr) == pattern) {
+                const BYTE* const dictStart = dictBase + hc4->lowLimit;
+                int back = 0;
+                const BYTE* vLimit = ip + (dictLimit - matchIndex);
+                if (vLimit > iHighLimit) vLimit = iHighLimit;
+                matchLength = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH;
+                if ((ip+matchLength == vLimit) && (vLimit < iHighLimit))
+                    matchLength += LZ4_count(ip+matchLength, lowPrefixPtr, iHighLimit);
+                back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, dictStart) : 0;
+                matchLength -= back;
+                if (matchLength > longest) {
+                    longest = matchLength;
+                    *matchpos = base + matchIndex + back;   /* virtual pos, relative to ip, to retrieve offset */
+                    *startpos = ip + back;
+        }   }   }
+
+        if (chainSwap && matchLength==longest) {    /* better match => select a better chain */
+            assert(lookBackLength==0);   /* search forward only */
+            if (matchIndex + (U32)longest <= ipIndex) {
                 int const kTrigger = 4;
-                U32 distanceToNextMatch = 1; 
+                U32 distanceToNextMatch = 1;
                 int const end = longest - MINMATCH + 1;
                 int step = 1;
                 int accel = 1 << kTrigger;
-                int pos; 
+                int pos;
                 for (pos = 0; pos < end; pos += step) {
-                    U32 const candidateDist = DELTANEXTU16(chainTable, matchIndex + (U32)pos); 
+                    U32 const candidateDist = DELTANEXTU16(chainTable, matchIndex + (U32)pos);
                     step = (accel++ >> kTrigger);
-                    if (candidateDist > distanceToNextMatch) { 
-                        distanceToNextMatch = candidateDist; 
-                        matchChainPos = (U32)pos; 
+                    if (candidateDist > distanceToNextMatch) {
+                        distanceToNextMatch = candidateDist;
+                        matchChainPos = (U32)pos;
                         accel = 1 << kTrigger;
                     }
                 }
-                if (distanceToNextMatch > 1) { 
-                    if (distanceToNextMatch > matchIndex) break;   /* avoid overflow */ 
-                    matchIndex -= distanceToNextMatch; 
-                    continue; 
-        }   }   } 
-
-        {   U32 const distNextMatch = DELTANEXTU16(chainTable, matchIndex); 
-            if (patternAnalysis && distNextMatch==1 && matchChainPos==0) { 
-                U32 const matchCandidateIdx = matchIndex-1; 
-                /* may be a repeated pattern */ 
-                if (repeat == rep_untested) { 
-                    if ( ((pattern & 0xFFFF) == (pattern >> 16)) 
-                      &  ((pattern & 0xFF)   == (pattern >> 24)) ) { 
-                        repeat = rep_confirmed; 
-                        srcPatternLength = LZ4HC_countPattern(ip+sizeof(pattern), iHighLimit, pattern) + sizeof(pattern); 
-                    } else { 
-                        repeat = rep_not; 
-                }   } 
+                if (distanceToNextMatch > 1) {
+                    if (distanceToNextMatch > matchIndex) break;   /* avoid overflow */
+                    matchIndex -= distanceToNextMatch;
+                    continue;
+        }   }   }
+
+        {   U32 const distNextMatch = DELTANEXTU16(chainTable, matchIndex);
+            if (patternAnalysis && distNextMatch==1 && matchChainPos==0) {
+                U32 const matchCandidateIdx = matchIndex-1;
+                /* may be a repeated pattern */
+                if (repeat == rep_untested) {
+                    if ( ((pattern & 0xFFFF) == (pattern >> 16))
+                      &  ((pattern & 0xFF)   == (pattern >> 24)) ) {
+                        repeat = rep_confirmed;
+                        srcPatternLength = LZ4HC_countPattern(ip+sizeof(pattern), iHighLimit, pattern) + sizeof(pattern);
+                    } else {
+                        repeat = rep_not;
+                }   }
                 if ( (repeat == rep_confirmed) && (matchCandidateIdx >= lowestMatchIndex)
                   && LZ4HC_protectDictEnd(dictLimit, matchCandidateIdx) ) {
                     const int extDict = matchCandidateIdx < dictLimit;
                     const BYTE* const matchPtr = (extDict ? dictBase : base) + matchCandidateIdx;
-                    if (LZ4_read32(matchPtr) == pattern) {  /* good candidate */ 
+                    if (LZ4_read32(matchPtr) == pattern) {  /* good candidate */
                         const BYTE* const dictStart = dictBase + hc4->lowLimit;
                         const BYTE* const iLimit = extDict ? dictBase + dictLimit : iHighLimit;
                         size_t forwardPatternLength = LZ4HC_countPattern(matchPtr+sizeof(pattern), iLimit, pattern) + sizeof(pattern);
@@ -379,7 +379,7 @@ LZ4HC_InsertAndGetWiderMatch (
                                     /* Can only happen if started in the prefix */
                                     assert(newMatchIndex >= dictLimit - 3 && newMatchIndex < dictLimit && !extDict);
                                     matchIndex = dictLimit;
-                                } 
+                                }
                             } else {
                                 U32 const newMatchIndex = matchCandidateIdx - (U32)backLength;   /* farthest position in current segment, will find a match of length currentSegmentLength + maybe some back */
                                 if (!LZ4HC_protectDictEnd(dictLimit, newMatchIndex)) {
@@ -401,96 +401,96 @@ LZ4HC_InsertAndGetWiderMatch (
                                             if (distToNextPattern > matchIndex) break;  /* avoid overflow */
                                             matchIndex -= distToNextPattern;
                         }   }   }   }   }
-                        continue; 
-                }   } 
-        }   }   /* PA optimization */ 
- 
-        /* follow current chain */ 
-        matchIndex -= DELTANEXTU16(chainTable, matchIndex + matchChainPos); 
- 
-    }  /* while ((matchIndex>=lowestMatchIndex) && (nbAttempts)) */ 
- 
-    if ( dict == usingDictCtxHc 
+                        continue;
+                }   }
+        }   }   /* PA optimization */
+
+        /* follow current chain */
+        matchIndex -= DELTANEXTU16(chainTable, matchIndex + matchChainPos);
+
+    }  /* while ((matchIndex>=lowestMatchIndex) && (nbAttempts)) */
+
+    if ( dict == usingDictCtxHc
       && nbAttempts > 0
-      && ipIndex - lowestMatchIndex < LZ4_DISTANCE_MAX) { 
-        size_t const dictEndOffset = (size_t)(dictCtx->end - dictCtx->base); 
-        U32 dictMatchIndex = dictCtx->hashTable[LZ4HC_hashPtr(ip)]; 
-        assert(dictEndOffset <= 1 GB); 
-        matchIndex = dictMatchIndex + lowestMatchIndex - (U32)dictEndOffset; 
-        while (ipIndex - matchIndex <= LZ4_DISTANCE_MAX && nbAttempts--) { 
-            const BYTE* const matchPtr = dictCtx->base + dictMatchIndex; 
- 
-            if (LZ4_read32(matchPtr) == pattern) { 
-                int mlt; 
-                int back = 0; 
-                const BYTE* vLimit = ip + (dictEndOffset - dictMatchIndex); 
+      && ipIndex - lowestMatchIndex < LZ4_DISTANCE_MAX) {
+        size_t const dictEndOffset = (size_t)(dictCtx->end - dictCtx->base);
+        U32 dictMatchIndex = dictCtx->hashTable[LZ4HC_hashPtr(ip)];
+        assert(dictEndOffset <= 1 GB);
+        matchIndex = dictMatchIndex + lowestMatchIndex - (U32)dictEndOffset;
+        while (ipIndex - matchIndex <= LZ4_DISTANCE_MAX && nbAttempts--) {
+            const BYTE* const matchPtr = dictCtx->base + dictMatchIndex;
+
+            if (LZ4_read32(matchPtr) == pattern) {
+                int mlt;
+                int back = 0;
+                const BYTE* vLimit = ip + (dictEndOffset - dictMatchIndex);
                 if (vLimit > iHighLimit) vLimit = iHighLimit;
-                mlt = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH; 
-                back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, dictCtx->base + dictCtx->dictLimit) : 0; 
+                mlt = (int)LZ4_count(ip+MINMATCH, matchPtr+MINMATCH, vLimit) + MINMATCH;
+                back = lookBackLength ? LZ4HC_countBack(ip, matchPtr, iLowLimit, dictCtx->base + dictCtx->dictLimit) : 0;
                 mlt -= back;
-                if (mlt > longest) { 
-                    longest = mlt; 
-                    *matchpos = base + matchIndex + back; 
-                    *startpos = ip + back; 
-            }   } 
-
-            {   U32 const nextOffset = DELTANEXTU16(dictCtx->chainTable, dictMatchIndex); 
-                dictMatchIndex -= nextOffset; 
-                matchIndex -= nextOffset; 
-    }   }   } 
- 
+                if (mlt > longest) {
+                    longest = mlt;
+                    *matchpos = base + matchIndex + back;
+                    *startpos = ip + back;
+            }   }
+
+            {   U32 const nextOffset = DELTANEXTU16(dictCtx->chainTable, dictMatchIndex);
+                dictMatchIndex -= nextOffset;
+                matchIndex -= nextOffset;
+    }   }   }
+
     return longest;
 }
 
-LZ4_FORCE_INLINE 
-int LZ4HC_InsertAndFindBestMatch(LZ4HC_CCtx_internal* const hc4,   /* Index table will be updated */ 
-                                 const BYTE* const ip, const BYTE* const iLimit, 
-                                 const BYTE** matchpos, 
-                                 const int maxNbAttempts, 
-                                 const int patternAnalysis, 
-                                 const dictCtx_directive dict) 
-{ 
-    const BYTE* uselessPtr = ip; 
-    /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos), 
-     * but this won't be the case here, as we define iLowLimit==ip, 
-     * so LZ4HC_InsertAndGetWiderMatch() won't be allowed to search past ip */ 
-    return LZ4HC_InsertAndGetWiderMatch(hc4, ip, ip, iLimit, MINMATCH-1, matchpos, &uselessPtr, maxNbAttempts, patternAnalysis, 0 /*chainSwap*/, dict, favorCompressionRatio); 
-} 
-
-/* LZ4HC_encodeSequence() : 
- * @return : 0 if ok, 
- *           1 if buffer issue detected */ 
-LZ4_FORCE_INLINE int LZ4HC_encodeSequence ( 
+LZ4_FORCE_INLINE
+int LZ4HC_InsertAndFindBestMatch(LZ4HC_CCtx_internal* const hc4,   /* Index table will be updated */
+                                 const BYTE* const ip, const BYTE* const iLimit,
+                                 const BYTE** matchpos,
+                                 const int maxNbAttempts,
+                                 const int patternAnalysis,
+                                 const dictCtx_directive dict)
+{
+    const BYTE* uselessPtr = ip;
+    /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos),
+     * but this won't be the case here, as we define iLowLimit==ip,
+     * so LZ4HC_InsertAndGetWiderMatch() won't be allowed to search past ip */
+    return LZ4HC_InsertAndGetWiderMatch(hc4, ip, ip, iLimit, MINMATCH-1, matchpos, &uselessPtr, maxNbAttempts, patternAnalysis, 0 /*chainSwap*/, dict, favorCompressionRatio);
+}
+
+/* LZ4HC_encodeSequence() :
+ * @return : 0 if ok,
+ *           1 if buffer issue detected */
+LZ4_FORCE_INLINE int LZ4HC_encodeSequence (
     const BYTE** _ip,
     BYTE** _op,
     const BYTE** _anchor,
     int matchLength,
     const BYTE* const match,
-    limitedOutput_directive limit, 
+    limitedOutput_directive limit,
     BYTE* oend)
 {
 #define ip      (*_ip)
 #define op      (*_op)
 #define anchor  (*_anchor)
 
-    size_t length; 
+    size_t length;
     BYTE* const token = op++;
 
-#if defined(LZ4_DEBUG) && (LZ4_DEBUG >= 6) 
-    static const BYTE* start = NULL; 
-    static U32 totalCost = 0; 
+#if defined(LZ4_DEBUG) && (LZ4_DEBUG >= 6)
+    static const BYTE* start = NULL;
+    static U32 totalCost = 0;
     U32 const pos = (start==NULL) ? 0 : (U32)(anchor - start);
     U32 const ll = (U32)(ip - anchor);
-    U32 const llAdd = (ll>=15) ? ((ll-15) / 255) + 1 : 0; 
-    U32 const mlAdd = (matchLength>=19) ? ((matchLength-19) / 255) + 1 : 0; 
-    U32 const cost = 1 + llAdd + ll + 2 + mlAdd; 
+    U32 const llAdd = (ll>=15) ? ((ll-15) / 255) + 1 : 0;
+    U32 const mlAdd = (matchLength>=19) ? ((matchLength-19) / 255) + 1 : 0;
+    U32 const cost = 1 + llAdd + ll + 2 + mlAdd;
     if (start==NULL) start = anchor;  /* only works for single segment */
-    /* g_debuglog_enable = (pos >= 2228) & (pos <= 2262); */ 
+    /* g_debuglog_enable = (pos >= 2228) & (pos <= 2262); */
     DEBUGLOG(6, "pos:%7u -- literals:%4u, match:%4i, offset:%5u, cost:%4u + %5u",
-                pos, 
+                pos,
                 (U32)(ip - anchor), matchLength, (U32)(ip-match),
-                cost, totalCost); 
-    totalCost += cost; 
+                cost, totalCost);
+    totalCost += cost;
 #endif
 
     /* Encode Literal length */
@@ -502,14 +502,14 @@ LZ4_FORCE_INLINE int LZ4HC_encodeSequence (
                 (int)length, (int)(oend - op));
         return 1;
     }
-    if (length >= RUN_MASK) { 
-        size_t len = length - RUN_MASK; 
-        *token = (RUN_MASK << ML_BITS); 
+    if (length >= RUN_MASK) {
+        size_t len = length - RUN_MASK;
+        *token = (RUN_MASK << ML_BITS);
         for(; len >= 255 ; len -= 255) *op++ = 255;
         *op++ = (BYTE)len;
-    } else { 
-        *token = (BYTE)(length << ML_BITS); 
-    } 
+    } else {
+        *token = (BYTE)(length << ML_BITS);
+    }
 
     /* Copy Literals */
     LZ4_wildCopy8(op, anchor, op + length);
@@ -520,13 +520,13 @@ LZ4_FORCE_INLINE int LZ4HC_encodeSequence (
     LZ4_writeLE16(op, (U16)(ip - match)); op += 2;
 
     /* Encode MatchLength */
-    assert(matchLength >= MINMATCH); 
-    length = (size_t)matchLength - MINMATCH; 
+    assert(matchLength >= MINMATCH);
+    length = (size_t)matchLength - MINMATCH;
     if (limit && (op + (length / 255) + (1 + LASTLITERALS) > oend)) {
         DEBUGLOG(6, "Not enough room to write match length");
         return 1;   /* Check output limit */
     }
-    if (length >= ML_MASK) { 
+    if (length >= ML_MASK) {
         *token += ML_MASK;
         length -= ML_MASK;
         for(; length >= 510 ; length -= 510) { *op++ = 255; *op++ = 255; }
@@ -546,33 +546,33 @@ LZ4_FORCE_INLINE int LZ4HC_encodeSequence (
 #undef op
 #undef anchor
 
-LZ4_FORCE_INLINE int LZ4HC_compress_hashChain ( 
+LZ4_FORCE_INLINE int LZ4HC_compress_hashChain (
     LZ4HC_CCtx_internal* const ctx,
     const char* const source,
     char* const dest,
-    int* srcSizePtr, 
+    int* srcSizePtr,
     int const maxOutputSize,
     int maxNbAttempts,
-    const limitedOutput_directive limit, 
-    const dictCtx_directive dict 
+    const limitedOutput_directive limit,
+    const dictCtx_directive dict
     )
 {
-    const int inputSize = *srcSizePtr; 
-    const int patternAnalysis = (maxNbAttempts > 128);   /* levels 9+ */ 
- 
+    const int inputSize = *srcSizePtr;
+    const int patternAnalysis = (maxNbAttempts > 128);   /* levels 9+ */
+
     const BYTE* ip = (const BYTE*) source;
     const BYTE* anchor = ip;
     const BYTE* const iend = ip + inputSize;
     const BYTE* const mflimit = iend - MFLIMIT;
     const BYTE* const matchlimit = (iend - LASTLITERALS);
 
-    BYTE* optr = (BYTE*) dest; 
+    BYTE* optr = (BYTE*) dest;
     BYTE* op = (BYTE*) dest;
-    BYTE* oend = op + maxOutputSize; 
+    BYTE* oend = op + maxOutputSize;
 
-    int   ml0, ml, ml2, ml3; 
-    const BYTE* start0; 
-    const BYTE* ref0; 
+    int   ml0, ml, ml2, ml3;
+    const BYTE* start0;
+    const BYTE* ref0;
     const BYTE* ref = NULL;
     const BYTE* start2 = NULL;
     const BYTE* ref2 = NULL;
@@ -580,37 +580,37 @@ LZ4_FORCE_INLINE int LZ4HC_compress_hashChain (
     const BYTE* ref3 = NULL;
 
     /* init */
-    *srcSizePtr = 0; 
-    if (limit == fillOutput) oend -= LASTLITERALS;                  /* Hack for support LZ4 format restriction */ 
+    *srcSizePtr = 0;
+    if (limit == fillOutput) oend -= LASTLITERALS;                  /* Hack for support LZ4 format restriction */
     if (inputSize < LZ4_minLength) goto _last_literals;             /* Input too small, no compression (all literals) */
 
     /* Main Loop */
-    while (ip <= mflimit) { 
-        ml = LZ4HC_InsertAndFindBestMatch(ctx, ip, matchlimit, &ref, maxNbAttempts, patternAnalysis, dict); 
-        if (ml<MINMATCH) { ip++; continue; } 
+    while (ip <= mflimit) {
+        ml = LZ4HC_InsertAndFindBestMatch(ctx, ip, matchlimit, &ref, maxNbAttempts, patternAnalysis, dict);
+        if (ml<MINMATCH) { ip++; continue; }
 
         /* saved, in case we would skip too much */
-        start0 = ip; ref0 = ref; ml0 = ml; 
+        start0 = ip; ref0 = ref; ml0 = ml;
 
 _Search2:
-        if (ip+ml <= mflimit) { 
-            ml2 = LZ4HC_InsertAndGetWiderMatch(ctx, 
-                            ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2, 
-                            maxNbAttempts, patternAnalysis, 0, dict, favorCompressionRatio); 
-        } else { 
-            ml2 = ml; 
-        } 
-
-        if (ml2 == ml) { /* No better match => encode ML1 */ 
-            optr = op; 
-            if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; 
+        if (ip+ml <= mflimit) {
+            ml2 = LZ4HC_InsertAndGetWiderMatch(ctx,
+                            ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2,
+                            maxNbAttempts, patternAnalysis, 0, dict, favorCompressionRatio);
+        } else {
+            ml2 = ml;
+        }
+
+        if (ml2 == ml) { /* No better match => encode ML1 */
+            optr = op;
+            if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow;
             continue;
         }
 
-        if (start0 < ip) {   /* first match was skipped at least once */ 
-            if (start2 < ip + ml0) {  /* squeezing ML1 between ML0(original ML1) and ML2 */ 
-                ip = start0; ref = ref0; ml = ml0;  /* restore initial ML1 */ 
-        }   } 
+        if (start0 < ip) {   /* first match was skipped at least once */
+            if (start2 < ip + ml0) {  /* squeezing ML1 between ML0(original ML1) and ML2 */
+                ip = start0; ref = ref0; ml = ml0;  /* restore initial ML1 */
+        }   }
 
         /* Here, start0==ip */
         if ((start2 - ip) < 3) {  /* First Match too small : removed */
@@ -621,9 +621,9 @@ _Search2:
         }
 
 _Search3:
-        /* At this stage, we have : 
-        *  ml2 > ml1, and 
-        *  ip1+3 <= ip2 (usually < ip1+ml1) */ 
+        /* At this stage, we have :
+        *  ml2 > ml1, and
+        *  ip1+3 <= ip2 (usually < ip1+ml1) */
         if ((start2 - ip) < OPTIMAL_ML) {
             int correction;
             int new_ml = ml;
@@ -638,22 +638,22 @@ _Search3:
         }
         /* Now, we have start2 = ip+new_ml, with new_ml = min(ml, OPTIMAL_ML=18) */
 
-        if (start2 + ml2 <= mflimit) { 
-            ml3 = LZ4HC_InsertAndGetWiderMatch(ctx, 
-                            start2 + ml2 - 3, start2, matchlimit, ml2, &ref3, &start3, 
-                            maxNbAttempts, patternAnalysis, 0, dict, favorCompressionRatio); 
-        } else { 
-            ml3 = ml2; 
-        } 
+        if (start2 + ml2 <= mflimit) {
+            ml3 = LZ4HC_InsertAndGetWiderMatch(ctx,
+                            start2 + ml2 - 3, start2, matchlimit, ml2, &ref3, &start3,
+                            maxNbAttempts, patternAnalysis, 0, dict, favorCompressionRatio);
+        } else {
+            ml3 = ml2;
+        }
 
-        if (ml3 == ml2) {  /* No better match => encode ML1 and ML2 */ 
+        if (ml3 == ml2) {  /* No better match => encode ML1 and ML2 */
             /* ip & ref are known; Now for ml */
             if (start2 < ip+ml)  ml = (int)(start2 - ip);
             /* Now, encode 2 sequences */
-            optr = op; 
-            if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; 
+            optr = op;
+            if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow;
             ip = start2;
-            optr = op; 
+            optr = op;
             if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml2, ref2, limit, oend)) {
                 ml  = ml2;
                 ref = ref2;
@@ -676,8 +676,8 @@ _Search3:
                     }
                 }
 
-                optr = op; 
-                if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; 
+                optr = op;
+                if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow;
                 ip  = start3;
                 ref = ref3;
                 ml  = ml3;
@@ -695,12 +695,12 @@ _Search3:
         }
 
         /*
-        * OK, now we have 3 ascending matches; 
-        * let's write the first one ML1. 
-        * ip & ref are known; Now decide ml. 
+        * OK, now we have 3 ascending matches;
+        * let's write the first one ML1.
+        * ip & ref are known; Now decide ml.
         */
         if (start2 < ip+ml) {
-            if ((start2 - ip) < OPTIMAL_ML) { 
+            if ((start2 - ip) < OPTIMAL_ML) {
                 int correction;
                 if (ml > OPTIMAL_ML) ml = OPTIMAL_ML;
                 if (ip + ml > start2 + ml2 - MINMATCH) ml = (int)(start2 - ip) + ml2 - MINMATCH;
@@ -714,60 +714,60 @@ _Search3:
                 ml = (int)(start2 - ip);
             }
         }
-        optr = op; 
-        if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; 
+        optr = op;
+        if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow;
 
-        /* ML2 becomes ML1 */ 
-        ip = start2; ref = ref2; ml = ml2; 
+        /* ML2 becomes ML1 */
+        ip = start2; ref = ref2; ml = ml2;
 
-        /* ML3 becomes ML2 */ 
-        start2 = start3; ref2 = ref3; ml2 = ml3; 
+        /* ML3 becomes ML2 */
+        start2 = start3; ref2 = ref3; ml2 = ml3;
 
-        /* let's find a new ML3 */ 
+        /* let's find a new ML3 */
         goto _Search3;
     }
 
-_last_literals: 
+_last_literals:
     /* Encode Last Literals */
-    {   size_t lastRunSize = (size_t)(iend - anchor);  /* literals */ 
+    {   size_t lastRunSize = (size_t)(iend - anchor);  /* literals */
         size_t llAdd = (lastRunSize + 255 - RUN_MASK) / 255;
         size_t const totalSize = 1 + llAdd + lastRunSize;
-        if (limit == fillOutput) oend += LASTLITERALS;  /* restore correct value */ 
-        if (limit && (op + totalSize > oend)) { 
+        if (limit == fillOutput) oend += LASTLITERALS;  /* restore correct value */
+        if (limit && (op + totalSize > oend)) {
             if (limit == limitedOutput) return 0;
-            /* adapt lastRunSize to fill 'dest' */ 
+            /* adapt lastRunSize to fill 'dest' */
             lastRunSize  = (size_t)(oend - op) - 1 /*token*/;
             llAdd = (lastRunSize + 256 - RUN_MASK) / 256;
             lastRunSize -= llAdd;
-        } 
+        }
         DEBUGLOG(6, "Final literal run : %i literals", (int)lastRunSize);
         ip = anchor + lastRunSize;  /* can be != iend if limit==fillOutput */
- 
-        if (lastRunSize >= RUN_MASK) { 
-            size_t accumulator = lastRunSize - RUN_MASK; 
-            *op++ = (RUN_MASK << ML_BITS); 
-            for(; accumulator >= 255 ; accumulator -= 255) *op++ = 255; 
-            *op++ = (BYTE) accumulator; 
-        } else { 
-            *op++ = (BYTE)(lastRunSize << ML_BITS); 
-        } 
-        memcpy(op, anchor, lastRunSize); 
-        op += lastRunSize; 
+
+        if (lastRunSize >= RUN_MASK) {
+            size_t accumulator = lastRunSize - RUN_MASK;
+            *op++ = (RUN_MASK << ML_BITS);
+            for(; accumulator >= 255 ; accumulator -= 255) *op++ = 255;
+            *op++ = (BYTE) accumulator;
+        } else {
+            *op++ = (BYTE)(lastRunSize << ML_BITS);
+        }
+        memcpy(op, anchor, lastRunSize);
+        op += lastRunSize;
     }
 
     /* End */
-    *srcSizePtr = (int) (((const char*)ip) - source); 
+    *srcSizePtr = (int) (((const char*)ip) - source);
     return (int) (((char*)op)-dest);
 
-_dest_overflow: 
-    if (limit == fillOutput) { 
+_dest_overflow:
+    if (limit == fillOutput) {
         /* Assumption : ip, anchor, ml and ref must be set correctly */
         size_t const ll = (size_t)(ip - anchor);
         size_t const ll_addbytes = (ll + 240) / 255;
         size_t const ll_totalCost = 1 + ll_addbytes + ll;
         BYTE* const maxLitPos = oend - 3; /* 2 for offset, 1 for token */
         DEBUGLOG(6, "Last sequence overflowing");
-        op = optr;  /* restore correct out pointer */ 
+        op = optr;  /* restore correct out pointer */
         if (op + ll_totalCost <= maxLitPos) {
             /* ll validated; now adjust match length */
             size_t const bytesLeftForMl = (size_t)(maxLitPos - (op+ll_totalCost));
@@ -777,318 +777,318 @@ _dest_overflow:
             if ((oend + LASTLITERALS) - (op + ll_totalCost + 2) - 1 + ml >= MFLIMIT) {
                 LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, notLimited, oend);
         }   }
-        goto _last_literals; 
+        goto _last_literals;
     }
     /* compression failed */
-    return 0; 
+    return 0;
 }
 
- 
-static int LZ4HC_compress_optimal( LZ4HC_CCtx_internal* ctx, 
-    const char* const source, char* dst, 
-    int* srcSizePtr, int dstCapacity, 
-    int const nbSearches, size_t sufficient_len, 
-    const limitedOutput_directive limit, int const fullUpdate, 
-    const dictCtx_directive dict, 
+
+static int LZ4HC_compress_optimal( LZ4HC_CCtx_internal* ctx,
+    const char* const source, char* dst,
+    int* srcSizePtr, int dstCapacity,
+    int const nbSearches, size_t sufficient_len,
+    const limitedOutput_directive limit, int const fullUpdate,
+    const dictCtx_directive dict,
     const HCfavor_e favorDecSpeed);
- 
- 
-LZ4_FORCE_INLINE int LZ4HC_compress_generic_internal ( 
+
+
+LZ4_FORCE_INLINE int LZ4HC_compress_generic_internal (
     LZ4HC_CCtx_internal* const ctx,
-    const char* const src, 
-    char* const dst, 
-    int* const srcSizePtr, 
-    int const dstCapacity, 
-    int cLevel, 
-    const limitedOutput_directive limit, 
-    const dictCtx_directive dict 
+    const char* const src,
+    char* const dst,
+    int* const srcSizePtr,
+    int const dstCapacity,
+    int cLevel,
+    const limitedOutput_directive limit,
+    const dictCtx_directive dict
     )
 {
-    typedef enum { lz4hc, lz4opt } lz4hc_strat_e; 
-    typedef struct { 
-        lz4hc_strat_e strat; 
+    typedef enum { lz4hc, lz4opt } lz4hc_strat_e;
+    typedef struct {
+        lz4hc_strat_e strat;
         int nbSearches;
-        U32 targetLength; 
-    } cParams_t; 
-    static const cParams_t clTable[LZ4HC_CLEVEL_MAX+1] = { 
-        { lz4hc,     2, 16 },  /* 0, unused */ 
-        { lz4hc,     2, 16 },  /* 1, unused */ 
-        { lz4hc,     2, 16 },  /* 2, unused */ 
-        { lz4hc,     4, 16 },  /* 3 */ 
-        { lz4hc,     8, 16 },  /* 4 */ 
-        { lz4hc,    16, 16 },  /* 5 */ 
-        { lz4hc,    32, 16 },  /* 6 */ 
-        { lz4hc,    64, 16 },  /* 7 */ 
-        { lz4hc,   128, 16 },  /* 8 */ 
-        { lz4hc,   256, 16 },  /* 9 */ 
-        { lz4opt,   96, 64 },  /*10==LZ4HC_CLEVEL_OPT_MIN*/ 
-        { lz4opt,  512,128 },  /*11 */ 
-        { lz4opt,16384,LZ4_OPT_NUM },  /* 12==LZ4HC_CLEVEL_MAX */ 
-    }; 
- 
+        U32 targetLength;
+    } cParams_t;
+    static const cParams_t clTable[LZ4HC_CLEVEL_MAX+1] = {
+        { lz4hc,     2, 16 },  /* 0, unused */
+        { lz4hc,     2, 16 },  /* 1, unused */
+        { lz4hc,     2, 16 },  /* 2, unused */
+        { lz4hc,     4, 16 },  /* 3 */
+        { lz4hc,     8, 16 },  /* 4 */
+        { lz4hc,    16, 16 },  /* 5 */
+        { lz4hc,    32, 16 },  /* 6 */
+        { lz4hc,    64, 16 },  /* 7 */
+        { lz4hc,   128, 16 },  /* 8 */
+        { lz4hc,   256, 16 },  /* 9 */
+        { lz4opt,   96, 64 },  /*10==LZ4HC_CLEVEL_OPT_MIN*/
+        { lz4opt,  512,128 },  /*11 */
+        { lz4opt,16384,LZ4_OPT_NUM },  /* 12==LZ4HC_CLEVEL_MAX */
+    };
+
     DEBUGLOG(4, "LZ4HC_compress_generic(ctx=%p, src=%p, srcSize=%d, limit=%d)",
                 ctx, src, *srcSizePtr, limit);
- 
-    if (limit == fillOutput && dstCapacity < 1) return 0;   /* Impossible to store anything */ 
-    if ((U32)*srcSizePtr > (U32)LZ4_MAX_INPUT_SIZE) return 0;    /* Unsupported input size (too large or negative) */ 
- 
-    ctx->end += *srcSizePtr; 
-    if (cLevel < 1) cLevel = LZ4HC_CLEVEL_DEFAULT;   /* note : convention is different from lz4frame, maybe something to review */ 
-    cLevel = MIN(LZ4HC_CLEVEL_MAX, cLevel); 
-    {   cParams_t const cParam = clTable[cLevel]; 
-        HCfavor_e const favor = ctx->favorDecSpeed ? favorDecompressionSpeed : favorCompressionRatio; 
-        int result; 
- 
-        if (cParam.strat == lz4hc) { 
-            result = LZ4HC_compress_hashChain(ctx, 
-                                src, dst, srcSizePtr, dstCapacity, 
-                                cParam.nbSearches, limit, dict); 
-        } else { 
-            assert(cParam.strat == lz4opt); 
-            result = LZ4HC_compress_optimal(ctx, 
-                                src, dst, srcSizePtr, dstCapacity, 
+
+    if (limit == fillOutput && dstCapacity < 1) return 0;   /* Impossible to store anything */
+    if ((U32)*srcSizePtr > (U32)LZ4_MAX_INPUT_SIZE) return 0;    /* Unsupported input size (too large or negative) */
+
+    ctx->end += *srcSizePtr;
+    if (cLevel < 1) cLevel = LZ4HC_CLEVEL_DEFAULT;   /* note : convention is different from lz4frame, maybe something to review */
+    cLevel = MIN(LZ4HC_CLEVEL_MAX, cLevel);
+    {   cParams_t const cParam = clTable[cLevel];
+        HCfavor_e const favor = ctx->favorDecSpeed ? favorDecompressionSpeed : favorCompressionRatio;
+        int result;
+
+        if (cParam.strat == lz4hc) {
+            result = LZ4HC_compress_hashChain(ctx,
+                                src, dst, srcSizePtr, dstCapacity,
+                                cParam.nbSearches, limit, dict);
+        } else {
+            assert(cParam.strat == lz4opt);
+            result = LZ4HC_compress_optimal(ctx,
+                                src, dst, srcSizePtr, dstCapacity,
                                 cParam.nbSearches, cParam.targetLength, limit,
-                                cLevel == LZ4HC_CLEVEL_MAX,   /* ultra mode */ 
-                                dict, favor); 
+                                cLevel == LZ4HC_CLEVEL_MAX,   /* ultra mode */
+                                dict, favor);
         }
-        if (result <= 0) ctx->dirty = 1; 
-        return result; 
+        if (result <= 0) ctx->dirty = 1;
+        return result;
     }
 }
 
-static void LZ4HC_setExternalDict(LZ4HC_CCtx_internal* ctxPtr, const BYTE* newBlock); 
-
-static int 
-LZ4HC_compress_generic_noDictCtx ( 
-        LZ4HC_CCtx_internal* const ctx, 
-        const char* const src, 
-        char* const dst, 
-        int* const srcSizePtr, 
-        int const dstCapacity, 
-        int cLevel, 
-        limitedOutput_directive limit 
-        ) 
-{ 
-    assert(ctx->dictCtx == NULL); 
-    return LZ4HC_compress_generic_internal(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit, noDictCtx); 
-} 
-
-static int 
-LZ4HC_compress_generic_dictCtx ( 
-        LZ4HC_CCtx_internal* const ctx, 
-        const char* const src, 
-        char* const dst, 
-        int* const srcSizePtr, 
-        int const dstCapacity, 
-        int cLevel, 
-        limitedOutput_directive limit 
-        ) 
+static void LZ4HC_setExternalDict(LZ4HC_CCtx_internal* ctxPtr, const BYTE* newBlock);
+
+static int
+LZ4HC_compress_generic_noDictCtx (
+        LZ4HC_CCtx_internal* const ctx,
+        const char* const src,
+        char* const dst,
+        int* const srcSizePtr,
+        int const dstCapacity,
+        int cLevel,
+        limitedOutput_directive limit
+        )
+{
+    assert(ctx->dictCtx == NULL);
+    return LZ4HC_compress_generic_internal(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit, noDictCtx);
+}
+
+static int
+LZ4HC_compress_generic_dictCtx (
+        LZ4HC_CCtx_internal* const ctx,
+        const char* const src,
+        char* const dst,
+        int* const srcSizePtr,
+        int const dstCapacity,
+        int cLevel,
+        limitedOutput_directive limit
+        )
+{
+    const size_t position = (size_t)(ctx->end - ctx->base) - ctx->lowLimit;
+    assert(ctx->dictCtx != NULL);
+    if (position >= 64 KB) {
+        ctx->dictCtx = NULL;
+        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit);
+    } else if (position == 0 && *srcSizePtr > 4 KB) {
+        memcpy(ctx, ctx->dictCtx, sizeof(LZ4HC_CCtx_internal));
+        LZ4HC_setExternalDict(ctx, (const BYTE *)src);
+        ctx->compressionLevel = (short)cLevel;
+        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit);
+    } else {
+        return LZ4HC_compress_generic_internal(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit, usingDictCtxHc);
+    }
+}
+
+static int
+LZ4HC_compress_generic (
+        LZ4HC_CCtx_internal* const ctx,
+        const char* const src,
+        char* const dst,
+        int* const srcSizePtr,
+        int const dstCapacity,
+        int cLevel,
+        limitedOutput_directive limit
+        )
+{
+    if (ctx->dictCtx == NULL) {
+        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit);
+    } else {
+        return LZ4HC_compress_generic_dictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit);
+    }
+}
+
+
+int LZ4_sizeofStateHC(void) { return (int)sizeof(LZ4_streamHC_t); }
+
+static size_t LZ4_streamHC_t_alignment(void)
 {
-    const size_t position = (size_t)(ctx->end - ctx->base) - ctx->lowLimit; 
-    assert(ctx->dictCtx != NULL); 
-    if (position >= 64 KB) { 
-        ctx->dictCtx = NULL; 
-        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit); 
-    } else if (position == 0 && *srcSizePtr > 4 KB) { 
-        memcpy(ctx, ctx->dictCtx, sizeof(LZ4HC_CCtx_internal)); 
-        LZ4HC_setExternalDict(ctx, (const BYTE *)src); 
-        ctx->compressionLevel = (short)cLevel; 
-        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit); 
-    } else { 
-        return LZ4HC_compress_generic_internal(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit, usingDictCtxHc); 
-    } 
-} 
- 
-static int 
-LZ4HC_compress_generic ( 
-        LZ4HC_CCtx_internal* const ctx, 
-        const char* const src, 
-        char* const dst, 
-        int* const srcSizePtr, 
-        int const dstCapacity, 
-        int cLevel, 
-        limitedOutput_directive limit 
-        ) 
-{ 
-    if (ctx->dictCtx == NULL) { 
-        return LZ4HC_compress_generic_noDictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit); 
-    } else { 
-        return LZ4HC_compress_generic_dictCtx(ctx, src, dst, srcSizePtr, dstCapacity, cLevel, limit); 
-    } 
-} 
- 
- 
-int LZ4_sizeofStateHC(void) { return (int)sizeof(LZ4_streamHC_t); } 
- 
-static size_t LZ4_streamHC_t_alignment(void) 
-{ 
 #if LZ4_ALIGN_TEST
     typedef struct { char c; LZ4_streamHC_t t; } t_a;
     return sizeof(t_a) - sizeof(LZ4_streamHC_t);
 #else
     return 1;  /* effectively disabled */
 #endif
-} 
- 
-/* state is presumed correctly initialized, 
- * in which case its size and alignment have already been validate */ 
-int LZ4_compress_HC_extStateHC_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel) 
-{ 
-    LZ4HC_CCtx_internal* const ctx = &((LZ4_streamHC_t*)state)->internal_donotuse; 
+}
+
+/* state is presumed correctly initialized,
+ * in which case its size and alignment have already been validate */
+int LZ4_compress_HC_extStateHC_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel)
+{
+    LZ4HC_CCtx_internal* const ctx = &((LZ4_streamHC_t*)state)->internal_donotuse;
     if (!LZ4_isAligned(state, LZ4_streamHC_t_alignment())) return 0;
-    LZ4_resetStreamHC_fast((LZ4_streamHC_t*)state, compressionLevel); 
-    LZ4HC_init_internal (ctx, (const BYTE*)src); 
-    if (dstCapacity < LZ4_compressBound(srcSize)) 
-        return LZ4HC_compress_generic (ctx, src, dst, &srcSize, dstCapacity, compressionLevel, limitedOutput); 
+    LZ4_resetStreamHC_fast((LZ4_streamHC_t*)state, compressionLevel);
+    LZ4HC_init_internal (ctx, (const BYTE*)src);
+    if (dstCapacity < LZ4_compressBound(srcSize))
+        return LZ4HC_compress_generic (ctx, src, dst, &srcSize, dstCapacity, compressionLevel, limitedOutput);
     else
-        return LZ4HC_compress_generic (ctx, src, dst, &srcSize, dstCapacity, compressionLevel, notLimited); 
+        return LZ4HC_compress_generic (ctx, src, dst, &srcSize, dstCapacity, compressionLevel, notLimited);
+}
+
+int LZ4_compress_HC_extStateHC (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel)
+{
+    LZ4_streamHC_t* const ctx = LZ4_initStreamHC(state, sizeof(*ctx));
+    if (ctx==NULL) return 0;   /* init failure */
+    return LZ4_compress_HC_extStateHC_fastReset(state, src, dst, srcSize, dstCapacity, compressionLevel);
 }
 
-int LZ4_compress_HC_extStateHC (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel) 
+int LZ4_compress_HC(const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel)
 {
-    LZ4_streamHC_t* const ctx = LZ4_initStreamHC(state, sizeof(*ctx)); 
-    if (ctx==NULL) return 0;   /* init failure */ 
-    return LZ4_compress_HC_extStateHC_fastReset(state, src, dst, srcSize, dstCapacity, compressionLevel); 
-} 
- 
-int LZ4_compress_HC(const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel) 
-{ 
 #if defined(LZ4HC_HEAPMODE) && LZ4HC_HEAPMODE==1
-    LZ4_streamHC_t* const statePtr = (LZ4_streamHC_t*)ALLOC(sizeof(LZ4_streamHC_t)); 
+    LZ4_streamHC_t* const statePtr = (LZ4_streamHC_t*)ALLOC(sizeof(LZ4_streamHC_t));
 #else
     LZ4_streamHC_t state;
     LZ4_streamHC_t* const statePtr = &state;
 #endif
-    int const cSize = LZ4_compress_HC_extStateHC(statePtr, src, dst, srcSize, dstCapacity, compressionLevel); 
+    int const cSize = LZ4_compress_HC_extStateHC(statePtr, src, dst, srcSize, dstCapacity, compressionLevel);
 #if defined(LZ4HC_HEAPMODE) && LZ4HC_HEAPMODE==1
-    FREEMEM(statePtr); 
+    FREEMEM(statePtr);
 #endif
     return cSize;
 }
 
-/* state is presumed sized correctly (>= sizeof(LZ4_streamHC_t)) */ 
-int LZ4_compress_HC_destSize(void* state, const char* source, char* dest, int* sourceSizePtr, int targetDestSize, int cLevel) 
-{ 
-    LZ4_streamHC_t* const ctx = LZ4_initStreamHC(state, sizeof(*ctx)); 
-    if (ctx==NULL) return 0;   /* init failure */ 
-    LZ4HC_init_internal(&ctx->internal_donotuse, (const BYTE*) source); 
-    LZ4_setCompressionLevel(ctx, cLevel); 
-    return LZ4HC_compress_generic(&ctx->internal_donotuse, source, dest, sourceSizePtr, targetDestSize, cLevel, fillOutput); 
-} 
+/* state is presumed sized correctly (>= sizeof(LZ4_streamHC_t)) */
+int LZ4_compress_HC_destSize(void* state, const char* source, char* dest, int* sourceSizePtr, int targetDestSize, int cLevel)
+{
+    LZ4_streamHC_t* const ctx = LZ4_initStreamHC(state, sizeof(*ctx));
+    if (ctx==NULL) return 0;   /* init failure */
+    LZ4HC_init_internal(&ctx->internal_donotuse, (const BYTE*) source);
+    LZ4_setCompressionLevel(ctx, cLevel);
+    return LZ4HC_compress_generic(&ctx->internal_donotuse, source, dest, sourceSizePtr, targetDestSize, cLevel, fillOutput);
+}
+
 
 
- 
 /**************************************
 *  Streaming Functions
 **************************************/
 /* allocation */
-LZ4_streamHC_t* LZ4_createStreamHC(void) 
-{ 
+LZ4_streamHC_t* LZ4_createStreamHC(void)
+{
     LZ4_streamHC_t* const state =
         (LZ4_streamHC_t*)ALLOC_AND_ZERO(sizeof(LZ4_streamHC_t));
     if (state == NULL) return NULL;
     LZ4_setCompressionLevel(state, LZ4HC_CLEVEL_DEFAULT);
     return state;
-} 
-
-int LZ4_freeStreamHC (LZ4_streamHC_t* LZ4_streamHCPtr) 
-{ 
-    DEBUGLOG(4, "LZ4_freeStreamHC(%p)", LZ4_streamHCPtr); 
-    if (!LZ4_streamHCPtr) return 0;  /* support free on NULL */ 
-    FREEMEM(LZ4_streamHCPtr); 
-    return 0; 
-} 
-
- 
-LZ4_streamHC_t* LZ4_initStreamHC (void* buffer, size_t size) 
+}
+
+int LZ4_freeStreamHC (LZ4_streamHC_t* LZ4_streamHCPtr)
 {
-    LZ4_streamHC_t* const LZ4_streamHCPtr = (LZ4_streamHC_t*)buffer; 
+    DEBUGLOG(4, "LZ4_freeStreamHC(%p)", LZ4_streamHCPtr);
+    if (!LZ4_streamHCPtr) return 0;  /* support free on NULL */
+    FREEMEM(LZ4_streamHCPtr);
+    return 0;
+}
+
+
+LZ4_streamHC_t* LZ4_initStreamHC (void* buffer, size_t size)
+{
+    LZ4_streamHC_t* const LZ4_streamHCPtr = (LZ4_streamHC_t*)buffer;
     /* if compilation fails here, LZ4_STREAMHCSIZE must be increased */
     LZ4_STATIC_ASSERT(sizeof(LZ4HC_CCtx_internal) <= LZ4_STREAMHCSIZE);
     DEBUGLOG(4, "LZ4_initStreamHC(%p, %u)", buffer, (unsigned)size);
     /* check conditions */
-    if (buffer == NULL) return NULL; 
-    if (size < sizeof(LZ4_streamHC_t)) return NULL; 
+    if (buffer == NULL) return NULL;
+    if (size < sizeof(LZ4_streamHC_t)) return NULL;
     if (!LZ4_isAligned(buffer, LZ4_streamHC_t_alignment())) return NULL;
     /* init */
     { LZ4HC_CCtx_internal* const hcstate = &(LZ4_streamHCPtr->internal_donotuse);
       MEM_INIT(hcstate, 0, sizeof(*hcstate)); }
-    LZ4_setCompressionLevel(LZ4_streamHCPtr, LZ4HC_CLEVEL_DEFAULT); 
-    return LZ4_streamHCPtr; 
+    LZ4_setCompressionLevel(LZ4_streamHCPtr, LZ4HC_CLEVEL_DEFAULT);
+    return LZ4_streamHCPtr;
+}
+
+/* just a stub */
+void LZ4_resetStreamHC (LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel)
+{
+    LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr));
+    LZ4_setCompressionLevel(LZ4_streamHCPtr, compressionLevel);
 }
 
-/* just a stub */ 
-void LZ4_resetStreamHC (LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel) 
+void LZ4_resetStreamHC_fast (LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel)
 {
-    LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr)); 
-    LZ4_setCompressionLevel(LZ4_streamHCPtr, compressionLevel); 
-} 
- 
-void LZ4_resetStreamHC_fast (LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel) 
-{ 
-    DEBUGLOG(4, "LZ4_resetStreamHC_fast(%p, %d)", LZ4_streamHCPtr, compressionLevel); 
-    if (LZ4_streamHCPtr->internal_donotuse.dirty) { 
-        LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr)); 
-    } else { 
-        /* preserve end - base : can trigger clearTable's threshold */ 
+    DEBUGLOG(4, "LZ4_resetStreamHC_fast(%p, %d)", LZ4_streamHCPtr, compressionLevel);
+    if (LZ4_streamHCPtr->internal_donotuse.dirty) {
+        LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr));
+    } else {
+        /* preserve end - base : can trigger clearTable's threshold */
         if (LZ4_streamHCPtr->internal_donotuse.end != NULL) {
             LZ4_streamHCPtr->internal_donotuse.end -= (uptrval)LZ4_streamHCPtr->internal_donotuse.base;
         } else {
             assert(LZ4_streamHCPtr->internal_donotuse.base == NULL);
         }
-        LZ4_streamHCPtr->internal_donotuse.base = NULL; 
-        LZ4_streamHCPtr->internal_donotuse.dictCtx = NULL; 
-    } 
-    LZ4_setCompressionLevel(LZ4_streamHCPtr, compressionLevel); 
-} 
- 
-void LZ4_setCompressionLevel(LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel) 
-{ 
-    DEBUGLOG(5, "LZ4_setCompressionLevel(%p, %d)", LZ4_streamHCPtr, compressionLevel); 
-    if (compressionLevel < 1) compressionLevel = LZ4HC_CLEVEL_DEFAULT; 
-    if (compressionLevel > LZ4HC_CLEVEL_MAX) compressionLevel = LZ4HC_CLEVEL_MAX; 
-    LZ4_streamHCPtr->internal_donotuse.compressionLevel = (short)compressionLevel; 
-} 
- 
-void LZ4_favorDecompressionSpeed(LZ4_streamHC_t* LZ4_streamHCPtr, int favor) 
-{ 
-    LZ4_streamHCPtr->internal_donotuse.favorDecSpeed = (favor!=0); 
-} 
- 
-/* LZ4_loadDictHC() : 
- * LZ4_streamHCPtr is presumed properly initialized */ 
-int LZ4_loadDictHC (LZ4_streamHC_t* LZ4_streamHCPtr, 
-              const char* dictionary, int dictSize) 
-{ 
-    LZ4HC_CCtx_internal* const ctxPtr = &LZ4_streamHCPtr->internal_donotuse; 
+        LZ4_streamHCPtr->internal_donotuse.base = NULL;
+        LZ4_streamHCPtr->internal_donotuse.dictCtx = NULL;
+    }
+    LZ4_setCompressionLevel(LZ4_streamHCPtr, compressionLevel);
+}
+
+void LZ4_setCompressionLevel(LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel)
+{
+    DEBUGLOG(5, "LZ4_setCompressionLevel(%p, %d)", LZ4_streamHCPtr, compressionLevel);
+    if (compressionLevel < 1) compressionLevel = LZ4HC_CLEVEL_DEFAULT;
+    if (compressionLevel > LZ4HC_CLEVEL_MAX) compressionLevel = LZ4HC_CLEVEL_MAX;
+    LZ4_streamHCPtr->internal_donotuse.compressionLevel = (short)compressionLevel;
+}
+
+void LZ4_favorDecompressionSpeed(LZ4_streamHC_t* LZ4_streamHCPtr, int favor)
+{
+    LZ4_streamHCPtr->internal_donotuse.favorDecSpeed = (favor!=0);
+}
+
+/* LZ4_loadDictHC() :
+ * LZ4_streamHCPtr is presumed properly initialized */
+int LZ4_loadDictHC (LZ4_streamHC_t* LZ4_streamHCPtr,
+              const char* dictionary, int dictSize)
+{
+    LZ4HC_CCtx_internal* const ctxPtr = &LZ4_streamHCPtr->internal_donotuse;
     DEBUGLOG(4, "LZ4_loadDictHC(ctx:%p, dict:%p, dictSize:%d)", LZ4_streamHCPtr, dictionary, dictSize);
-    assert(LZ4_streamHCPtr != NULL); 
+    assert(LZ4_streamHCPtr != NULL);
     if (dictSize > 64 KB) {
-        dictionary += (size_t)dictSize - 64 KB; 
+        dictionary += (size_t)dictSize - 64 KB;
         dictSize = 64 KB;
     }
-    /* need a full initialization, there are bad side-effects when using resetFast() */ 
-    {   int const cLevel = ctxPtr->compressionLevel; 
-        LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr)); 
-        LZ4_setCompressionLevel(LZ4_streamHCPtr, cLevel); 
-    } 
-    LZ4HC_init_internal (ctxPtr, (const BYTE*)dictionary); 
+    /* need a full initialization, there are bad side-effects when using resetFast() */
+    {   int const cLevel = ctxPtr->compressionLevel;
+        LZ4_initStreamHC(LZ4_streamHCPtr, sizeof(*LZ4_streamHCPtr));
+        LZ4_setCompressionLevel(LZ4_streamHCPtr, cLevel);
+    }
+    LZ4HC_init_internal (ctxPtr, (const BYTE*)dictionary);
     ctxPtr->end = (const BYTE*)dictionary + dictSize;
-    if (dictSize >= 4) LZ4HC_Insert (ctxPtr, ctxPtr->end-3); 
+    if (dictSize >= 4) LZ4HC_Insert (ctxPtr, ctxPtr->end-3);
     return dictSize;
 }
 
-void LZ4_attach_HC_dictionary(LZ4_streamHC_t *working_stream, const LZ4_streamHC_t *dictionary_stream) { 
-    working_stream->internal_donotuse.dictCtx = dictionary_stream != NULL ? &(dictionary_stream->internal_donotuse) : NULL; 
-} 
+void LZ4_attach_HC_dictionary(LZ4_streamHC_t *working_stream, const LZ4_streamHC_t *dictionary_stream) {
+    working_stream->internal_donotuse.dictCtx = dictionary_stream != NULL ? &(dictionary_stream->internal_donotuse) : NULL;
+}
 
 /* compression */
 
 static void LZ4HC_setExternalDict(LZ4HC_CCtx_internal* ctxPtr, const BYTE* newBlock)
 {
-    DEBUGLOG(4, "LZ4HC_setExternalDict(%p, %p)", ctxPtr, newBlock); 
-    if (ctxPtr->end >= ctxPtr->base + ctxPtr->dictLimit + 4) 
-        LZ4HC_Insert (ctxPtr, ctxPtr->end-3);   /* Referencing remaining dictionary content */ 
+    DEBUGLOG(4, "LZ4HC_setExternalDict(%p, %p)", ctxPtr, newBlock);
+    if (ctxPtr->end >= ctxPtr->base + ctxPtr->dictLimit + 4)
+        LZ4HC_Insert (ctxPtr, ctxPtr->end-3);   /* Referencing remaining dictionary content */
 
     /* Only one memory segment for extDict, so any previous extDict is lost at this stage */
     ctxPtr->lowLimit  = ctxPtr->dictLimit;
@@ -1108,12 +1108,12 @@ LZ4_compressHC_continue_generic (LZ4_streamHC_t* LZ4_streamHCPtr,
                                  int* srcSizePtr, int dstCapacity,
                                  limitedOutput_directive limit)
 {
-    LZ4HC_CCtx_internal* const ctxPtr = &LZ4_streamHCPtr->internal_donotuse; 
+    LZ4HC_CCtx_internal* const ctxPtr = &LZ4_streamHCPtr->internal_donotuse;
     DEBUGLOG(5, "LZ4_compressHC_continue_generic(ctx=%p, src=%p, srcSize=%d, limit=%d)",
                 LZ4_streamHCPtr, src, *srcSizePtr, limit);
-    assert(ctxPtr != NULL); 
+    assert(ctxPtr != NULL);
     /* auto-init if forgotten */
-    if (ctxPtr->base == NULL) LZ4HC_init_internal (ctxPtr, (const BYTE*) src); 
+    if (ctxPtr->base == NULL) LZ4HC_init_internal (ctxPtr, (const BYTE*) src);
 
     /* Check overflow */
     if ((size_t)(ctxPtr->end - ctxPtr->base) > 2 GB) {
@@ -1123,37 +1123,37 @@ LZ4_compressHC_continue_generic (LZ4_streamHC_t* LZ4_streamHCPtr,
     }
 
     /* Check if blocks follow each other */
-    if ((const BYTE*)src != ctxPtr->end) 
-        LZ4HC_setExternalDict(ctxPtr, (const BYTE*)src); 
+    if ((const BYTE*)src != ctxPtr->end)
+        LZ4HC_setExternalDict(ctxPtr, (const BYTE*)src);
 
     /* Check overlapping input/dictionary space */
-    {   const BYTE* sourceEnd = (const BYTE*) src + *srcSizePtr; 
+    {   const BYTE* sourceEnd = (const BYTE*) src + *srcSizePtr;
         const BYTE* const dictBegin = ctxPtr->dictBase + ctxPtr->lowLimit;
         const BYTE* const dictEnd   = ctxPtr->dictBase + ctxPtr->dictLimit;
-        if ((sourceEnd > dictBegin) && ((const BYTE*)src < dictEnd)) { 
+        if ((sourceEnd > dictBegin) && ((const BYTE*)src < dictEnd)) {
             if (sourceEnd > dictEnd) sourceEnd = dictEnd;
             ctxPtr->lowLimit = (U32)(sourceEnd - ctxPtr->dictBase);
             if (ctxPtr->dictLimit - ctxPtr->lowLimit < 4) ctxPtr->lowLimit = ctxPtr->dictLimit;
     }   }
 
-    return LZ4HC_compress_generic (ctxPtr, src, dst, srcSizePtr, dstCapacity, ctxPtr->compressionLevel, limit); 
+    return LZ4HC_compress_generic (ctxPtr, src, dst, srcSizePtr, dstCapacity, ctxPtr->compressionLevel, limit);
 }
 
-int LZ4_compress_HC_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* src, char* dst, int srcSize, int dstCapacity) 
+int LZ4_compress_HC_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* src, char* dst, int srcSize, int dstCapacity)
 {
-    if (dstCapacity < LZ4_compressBound(srcSize)) 
-        return LZ4_compressHC_continue_generic (LZ4_streamHCPtr, src, dst, &srcSize, dstCapacity, limitedOutput); 
+    if (dstCapacity < LZ4_compressBound(srcSize))
+        return LZ4_compressHC_continue_generic (LZ4_streamHCPtr, src, dst, &srcSize, dstCapacity, limitedOutput);
     else
-        return LZ4_compressHC_continue_generic (LZ4_streamHCPtr, src, dst, &srcSize, dstCapacity, notLimited); 
+        return LZ4_compressHC_continue_generic (LZ4_streamHCPtr, src, dst, &srcSize, dstCapacity, notLimited);
+}
+
+int LZ4_compress_HC_continue_destSize (LZ4_streamHC_t* LZ4_streamHCPtr, const char* src, char* dst, int* srcSizePtr, int targetDestSize)
+{
+    return LZ4_compressHC_continue_generic(LZ4_streamHCPtr, src, dst, srcSizePtr, targetDestSize, fillOutput);
 }
 
-int LZ4_compress_HC_continue_destSize (LZ4_streamHC_t* LZ4_streamHCPtr, const char* src, char* dst, int* srcSizePtr, int targetDestSize) 
-{ 
-    return LZ4_compressHC_continue_generic(LZ4_streamHCPtr, src, dst, srcSizePtr, targetDestSize, fillOutput); 
-} 
 
- 
- 
+
 /* LZ4_saveDictHC :
  * save history content
  * into a user-provided buffer
@@ -1174,8 +1174,8 @@ int LZ4_saveDictHC (LZ4_streamHC_t* LZ4_streamHCPtr, char* safeBuffer, int dictS
     {   U32 const endIndex = (U32)(streamPtr->end - streamPtr->base);
         streamPtr->end = (const BYTE*)safeBuffer + dictSize;
         streamPtr->base = streamPtr->end - endIndex;
-        streamPtr->dictLimit = endIndex - (U32)dictSize; 
-        streamPtr->lowLimit = endIndex - (U32)dictSize; 
+        streamPtr->dictLimit = endIndex - (U32)dictSize;
+        streamPtr->lowLimit = endIndex - (U32)dictSize;
         if (streamPtr->nextToUpdate < streamPtr->dictLimit)
             streamPtr->nextToUpdate = streamPtr->dictLimit;
     }
@@ -1183,13 +1183,13 @@ int LZ4_saveDictHC (LZ4_streamHC_t* LZ4_streamHCPtr, char* safeBuffer, int dictS
 }
 
 
-/*************************************************** 
+/***************************************************
 *  Deprecated Functions
-***************************************************/ 
- 
+***************************************************/
+
 /* These functions currently generate deprecation warnings */
- 
-/* Wrappers for deprecated compression functions */ 
+
+/* Wrappers for deprecated compression functions */
 int LZ4_compressHC(const char* src, char* dst, int srcSize) { return LZ4_compress_HC (src, dst, srcSize, LZ4_compressBound(srcSize), 0); }
 int LZ4_compressHC_limitedOutput(const char* src, char* dst, int srcSize, int maxDstSize) { return LZ4_compress_HC(src, dst, srcSize, maxDstSize, 0); }
 int LZ4_compressHC2(const char* src, char* dst, int srcSize, int cLevel) { return LZ4_compress_HC (src, dst, srcSize, LZ4_compressBound(srcSize), cLevel); }
@@ -1205,389 +1205,389 @@ int LZ4_compressHC_limitedOutput_continue (LZ4_streamHC_t* ctx, const char* src,
 /* Deprecated streaming functions */
 int LZ4_sizeofStreamStateHC(void) { return LZ4_STREAMHCSIZE; }
 
-/* state is presumed correctly sized, aka >= sizeof(LZ4_streamHC_t) 
- * @return : 0 on success, !=0 if error */ 
+/* state is presumed correctly sized, aka >= sizeof(LZ4_streamHC_t)
+ * @return : 0 on success, !=0 if error */
 int LZ4_resetStreamStateHC(void* state, char* inputBuffer)
 {
-    LZ4_streamHC_t* const hc4 = LZ4_initStreamHC(state, sizeof(*hc4)); 
-    if (hc4 == NULL) return 1;   /* init failed */ 
-    LZ4HC_init_internal (&hc4->internal_donotuse, (const BYTE*)inputBuffer); 
+    LZ4_streamHC_t* const hc4 = LZ4_initStreamHC(state, sizeof(*hc4));
+    if (hc4 == NULL) return 1;   /* init failed */
+    LZ4HC_init_internal (&hc4->internal_donotuse, (const BYTE*)inputBuffer);
     return 0;
 }
 
-void* LZ4_createHC (const char* inputBuffer) 
+void* LZ4_createHC (const char* inputBuffer)
 {
-    LZ4_streamHC_t* const hc4 = LZ4_createStreamHC(); 
+    LZ4_streamHC_t* const hc4 = LZ4_createStreamHC();
     if (hc4 == NULL) return NULL;   /* not enough memory */
-    LZ4HC_init_internal (&hc4->internal_donotuse, (const BYTE*)inputBuffer); 
+    LZ4HC_init_internal (&hc4->internal_donotuse, (const BYTE*)inputBuffer);
     return hc4;
 }
 
-int LZ4_freeHC (void* LZ4HC_Data) 
-{ 
-    if (!LZ4HC_Data) return 0;  /* support free on NULL */ 
-    FREEMEM(LZ4HC_Data); 
-    return 0; 
-} 
+int LZ4_freeHC (void* LZ4HC_Data)
+{
+    if (!LZ4HC_Data) return 0;  /* support free on NULL */
+    FREEMEM(LZ4HC_Data);
+    return 0;
+}
 
-int LZ4_compressHC2_continue (void* LZ4HC_Data, const char* src, char* dst, int srcSize, int cLevel) 
+int LZ4_compressHC2_continue (void* LZ4HC_Data, const char* src, char* dst, int srcSize, int cLevel)
 {
-    return LZ4HC_compress_generic (&((LZ4_streamHC_t*)LZ4HC_Data)->internal_donotuse, src, dst, &srcSize, 0, cLevel, notLimited); 
+    return LZ4HC_compress_generic (&((LZ4_streamHC_t*)LZ4HC_Data)->internal_donotuse, src, dst, &srcSize, 0, cLevel, notLimited);
 }
 
-int LZ4_compressHC2_limitedOutput_continue (void* LZ4HC_Data, const char* src, char* dst, int srcSize, int dstCapacity, int cLevel) 
+int LZ4_compressHC2_limitedOutput_continue (void* LZ4HC_Data, const char* src, char* dst, int srcSize, int dstCapacity, int cLevel)
 {
-    return LZ4HC_compress_generic (&((LZ4_streamHC_t*)LZ4HC_Data)->internal_donotuse, src, dst, &srcSize, dstCapacity, cLevel, limitedOutput); 
+    return LZ4HC_compress_generic (&((LZ4_streamHC_t*)LZ4HC_Data)->internal_donotuse, src, dst, &srcSize, dstCapacity, cLevel, limitedOutput);
 }
 
 char* LZ4_slideInputBufferHC(void* LZ4HC_Data)
 {
-    LZ4_streamHC_t *ctx = (LZ4_streamHC_t*)LZ4HC_Data; 
-    const BYTE *bufferStart = ctx->internal_donotuse.base + ctx->internal_donotuse.lowLimit; 
-    LZ4_resetStreamHC_fast(ctx, ctx->internal_donotuse.compressionLevel); 
-    /* avoid const char * -> char * conversion warning :( */ 
-    return (char *)(uptrval)bufferStart; 
+    LZ4_streamHC_t *ctx = (LZ4_streamHC_t*)LZ4HC_Data;
+    const BYTE *bufferStart = ctx->internal_donotuse.base + ctx->internal_donotuse.lowLimit;
+    LZ4_resetStreamHC_fast(ctx, ctx->internal_donotuse.compressionLevel);
+    /* avoid const char * -> char * conversion warning :( */
+    return (char *)(uptrval)bufferStart;
 }
- 
- 
-/* ================================================ 
- *  LZ4 Optimal parser (levels [LZ4HC_CLEVEL_OPT_MIN - LZ4HC_CLEVEL_MAX]) 
- * ===============================================*/ 
-typedef struct { 
-    int price; 
-    int off; 
-    int mlen; 
-    int litlen; 
-} LZ4HC_optimal_t; 
- 
-/* price in bytes */ 
-LZ4_FORCE_INLINE int LZ4HC_literalsPrice(int const litlen) 
-{ 
-    int price = litlen; 
-    assert(litlen >= 0); 
-    if (litlen >= (int)RUN_MASK) 
-        price += 1 + ((litlen-(int)RUN_MASK) / 255); 
-    return price; 
-} 
- 
- 
-/* requires mlen >= MINMATCH */ 
-LZ4_FORCE_INLINE int LZ4HC_sequencePrice(int litlen, int mlen) 
-{ 
-    int price = 1 + 2 ; /* token + 16-bit offset */ 
-    assert(litlen >= 0); 
-    assert(mlen >= MINMATCH); 
- 
-    price += LZ4HC_literalsPrice(litlen); 
- 
-    if (mlen >= (int)(ML_MASK+MINMATCH)) 
-        price += 1 + ((mlen-(int)(ML_MASK+MINMATCH)) / 255); 
- 
-    return price; 
-} 
- 
- 
-typedef struct { 
-    int off; 
-    int len; 
-} LZ4HC_match_t; 
- 
-LZ4_FORCE_INLINE LZ4HC_match_t 
-LZ4HC_FindLongerMatch(LZ4HC_CCtx_internal* const ctx, 
-                      const BYTE* ip, const BYTE* const iHighLimit, 
-                      int minLen, int nbSearches, 
-                      const dictCtx_directive dict, 
-                      const HCfavor_e favorDecSpeed) 
-{ 
-    LZ4HC_match_t match = { 0 , 0 }; 
-    const BYTE* matchPtr = NULL; 
-    /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos), 
-     * but this won't be the case here, as we define iLowLimit==ip, 
-     * so LZ4HC_InsertAndGetWiderMatch() won't be allowed to search past ip */ 
-    int matchLength = LZ4HC_InsertAndGetWiderMatch(ctx, ip, ip, iHighLimit, minLen, &matchPtr, &ip, nbSearches, 1 /*patternAnalysis*/, 1 /*chainSwap*/, dict, favorDecSpeed); 
-    if (matchLength <= minLen) return match; 
-    if (favorDecSpeed) { 
-        if ((matchLength>18) & (matchLength<=36)) matchLength=18;   /* favor shortcut */ 
-    } 
-    match.len = matchLength; 
-    match.off = (int)(ip-matchPtr); 
-    return match; 
-} 
- 
- 
-static int LZ4HC_compress_optimal ( LZ4HC_CCtx_internal* ctx, 
-                                    const char* const source, 
-                                    char* dst, 
-                                    int* srcSizePtr, 
-                                    int dstCapacity, 
-                                    int const nbSearches, 
-                                    size_t sufficient_len, 
-                                    const limitedOutput_directive limit, 
-                                    int const fullUpdate, 
-                                    const dictCtx_directive dict, 
-                                    const HCfavor_e favorDecSpeed) 
-{ 
+
+
+/* ================================================
+ *  LZ4 Optimal parser (levels [LZ4HC_CLEVEL_OPT_MIN - LZ4HC_CLEVEL_MAX])
+ * ===============================================*/
+typedef struct {
+    int price;
+    int off;
+    int mlen;
+    int litlen;
+} LZ4HC_optimal_t;
+
+/* price in bytes */
+LZ4_FORCE_INLINE int LZ4HC_literalsPrice(int const litlen)
+{
+    int price = litlen;
+    assert(litlen >= 0);
+    if (litlen >= (int)RUN_MASK)
+        price += 1 + ((litlen-(int)RUN_MASK) / 255);
+    return price;
+}
+
+
+/* requires mlen >= MINMATCH */
+LZ4_FORCE_INLINE int LZ4HC_sequencePrice(int litlen, int mlen)
+{
+    int price = 1 + 2 ; /* token + 16-bit offset */
+    assert(litlen >= 0);
+    assert(mlen >= MINMATCH);
+
+    price += LZ4HC_literalsPrice(litlen);
+
+    if (mlen >= (int)(ML_MASK+MINMATCH))
+        price += 1 + ((mlen-(int)(ML_MASK+MINMATCH)) / 255);
+
+    return price;
+}
+
+
+typedef struct {
+    int off;
+    int len;
+} LZ4HC_match_t;
+
+LZ4_FORCE_INLINE LZ4HC_match_t
+LZ4HC_FindLongerMatch(LZ4HC_CCtx_internal* const ctx,
+                      const BYTE* ip, const BYTE* const iHighLimit,
+                      int minLen, int nbSearches,
+                      const dictCtx_directive dict,
+                      const HCfavor_e favorDecSpeed)
+{
+    LZ4HC_match_t match = { 0 , 0 };
+    const BYTE* matchPtr = NULL;
+    /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos),
+     * but this won't be the case here, as we define iLowLimit==ip,
+     * so LZ4HC_InsertAndGetWiderMatch() won't be allowed to search past ip */
+    int matchLength = LZ4HC_InsertAndGetWiderMatch(ctx, ip, ip, iHighLimit, minLen, &matchPtr, &ip, nbSearches, 1 /*patternAnalysis*/, 1 /*chainSwap*/, dict, favorDecSpeed);
+    if (matchLength <= minLen) return match;
+    if (favorDecSpeed) {
+        if ((matchLength>18) & (matchLength<=36)) matchLength=18;   /* favor shortcut */
+    }
+    match.len = matchLength;
+    match.off = (int)(ip-matchPtr);
+    return match;
+}
+
+
+static int LZ4HC_compress_optimal ( LZ4HC_CCtx_internal* ctx,
+                                    const char* const source,
+                                    char* dst,
+                                    int* srcSizePtr,
+                                    int dstCapacity,
+                                    int const nbSearches,
+                                    size_t sufficient_len,
+                                    const limitedOutput_directive limit,
+                                    int const fullUpdate,
+                                    const dictCtx_directive dict,
+                                    const HCfavor_e favorDecSpeed)
+{
     int retval = 0;
-#define TRAILING_LITERALS 3 
+#define TRAILING_LITERALS 3
 #ifdef LZ4HC_HEAPMODE
     LZ4HC_optimal_t* const opt = (LZ4HC_optimal_t*)ALLOC(sizeof(LZ4HC_optimal_t) * (LZ4_OPT_NUM + TRAILING_LITERALS));
 #else
-    LZ4HC_optimal_t opt[LZ4_OPT_NUM + TRAILING_LITERALS];   /* ~64 KB, which is a bit large for stack... */ 
+    LZ4HC_optimal_t opt[LZ4_OPT_NUM + TRAILING_LITERALS];   /* ~64 KB, which is a bit large for stack... */
 #endif
- 
-    const BYTE* ip = (const BYTE*) source; 
-    const BYTE* anchor = ip; 
-    const BYTE* const iend = ip + *srcSizePtr; 
-    const BYTE* const mflimit = iend - MFLIMIT; 
-    const BYTE* const matchlimit = iend - LASTLITERALS; 
-    BYTE* op = (BYTE*) dst; 
-    BYTE* opSaved = (BYTE*) dst; 
-    BYTE* oend = op + dstCapacity; 
+
+    const BYTE* ip = (const BYTE*) source;
+    const BYTE* anchor = ip;
+    const BYTE* const iend = ip + *srcSizePtr;
+    const BYTE* const mflimit = iend - MFLIMIT;
+    const BYTE* const matchlimit = iend - LASTLITERALS;
+    BYTE* op = (BYTE*) dst;
+    BYTE* opSaved = (BYTE*) dst;
+    BYTE* oend = op + dstCapacity;
     int ovml = MINMATCH;  /* overflow - last sequence */
     const BYTE* ovref = NULL;
- 
-    /* init */ 
+
+    /* init */
 #ifdef LZ4HC_HEAPMODE
     if (opt == NULL) goto _return_label;
 #endif
-    DEBUGLOG(5, "LZ4HC_compress_optimal(dst=%p, dstCapa=%u)", dst, (unsigned)dstCapacity); 
-    *srcSizePtr = 0; 
-    if (limit == fillOutput) oend -= LASTLITERALS;   /* Hack for support LZ4 format restriction */ 
-    if (sufficient_len >= LZ4_OPT_NUM) sufficient_len = LZ4_OPT_NUM-1; 
- 
-    /* Main Loop */ 
-    while (ip <= mflimit) { 
-         int const llen = (int)(ip - anchor); 
-         int best_mlen, best_off; 
-         int cur, last_match_pos = 0; 
- 
-         LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed); 
-         if (firstMatch.len==0) { ip++; continue; } 
- 
-         if ((size_t)firstMatch.len > sufficient_len) { 
-             /* good enough solution : immediate encoding */ 
-             int const firstML = firstMatch.len; 
-             const BYTE* const matchPos = ip - firstMatch.off; 
-             opSaved = op; 
+    DEBUGLOG(5, "LZ4HC_compress_optimal(dst=%p, dstCapa=%u)", dst, (unsigned)dstCapacity);
+    *srcSizePtr = 0;
+    if (limit == fillOutput) oend -= LASTLITERALS;   /* Hack for support LZ4 format restriction */
+    if (sufficient_len >= LZ4_OPT_NUM) sufficient_len = LZ4_OPT_NUM-1;
+
+    /* Main Loop */
+    while (ip <= mflimit) {
+         int const llen = (int)(ip - anchor);
+         int best_mlen, best_off;
+         int cur, last_match_pos = 0;
+
+         LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed);
+         if (firstMatch.len==0) { ip++; continue; }
+
+         if ((size_t)firstMatch.len > sufficient_len) {
+             /* good enough solution : immediate encoding */
+             int const firstML = firstMatch.len;
+             const BYTE* const matchPos = ip - firstMatch.off;
+             opSaved = op;
              if ( LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), firstML, matchPos, limit, oend) ) {  /* updates ip, op and anchor */
                  ovml = firstML;
                  ovref = matchPos;
-                 goto _dest_overflow; 
+                 goto _dest_overflow;
+             }
+             continue;
+         }
+
+         /* set prices for first positions (literals) */
+         {   int rPos;
+             for (rPos = 0 ; rPos < MINMATCH ; rPos++) {
+                 int const cost = LZ4HC_literalsPrice(llen + rPos);
+                 opt[rPos].mlen = 1;
+                 opt[rPos].off = 0;
+                 opt[rPos].litlen = llen + rPos;
+                 opt[rPos].price = cost;
+                 DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i) -- initial setup",
+                             rPos, cost, opt[rPos].litlen);
+         }   }
+         /* set prices using initial match */
+         {   int mlen = MINMATCH;
+             int const matchML = firstMatch.len;   /* necessarily < sufficient_len < LZ4_OPT_NUM */
+             int const offset = firstMatch.off;
+             assert(matchML < LZ4_OPT_NUM);
+             for ( ; mlen <= matchML ; mlen++) {
+                 int const cost = LZ4HC_sequencePrice(llen, mlen);
+                 opt[mlen].mlen = mlen;
+                 opt[mlen].off = offset;
+                 opt[mlen].litlen = llen;
+                 opt[mlen].price = cost;
+                 DEBUGLOG(7, "rPos:%3i => price:%3i (matchlen=%i) -- initial setup",
+                             mlen, cost, mlen);
+         }   }
+         last_match_pos = firstMatch.len;
+         {   int addLit;
+             for (addLit = 1; addLit <= TRAILING_LITERALS; addLit ++) {
+                 opt[last_match_pos+addLit].mlen = 1; /* literal */
+                 opt[last_match_pos+addLit].off = 0;
+                 opt[last_match_pos+addLit].litlen = addLit;
+                 opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit);
+                 DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i) -- initial setup",
+                             last_match_pos+addLit, opt[last_match_pos+addLit].price, addLit);
+         }   }
+
+         /* check further positions */
+         for (cur = 1; cur < last_match_pos; cur++) {
+             const BYTE* const curPtr = ip + cur;
+             LZ4HC_match_t newMatch;
+
+             if (curPtr > mflimit) break;
+             DEBUGLOG(7, "rPos:%u[%u] vs [%u]%u",
+                     cur, opt[cur].price, opt[cur+1].price, cur+1);
+             if (fullUpdate) {
+                 /* not useful to search here if next position has same (or lower) cost */
+                 if ( (opt[cur+1].price <= opt[cur].price)
+                   /* in some cases, next position has same cost, but cost rises sharply after, so a small match would still be beneficial */
+                   && (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/) )
+                     continue;
+             } else {
+                 /* not useful to search here if next position has same (or lower) cost */
+                 if (opt[cur+1].price <= opt[cur].price) continue;
              }
-             continue; 
-         } 
- 
-         /* set prices for first positions (literals) */ 
-         {   int rPos; 
-             for (rPos = 0 ; rPos < MINMATCH ; rPos++) { 
-                 int const cost = LZ4HC_literalsPrice(llen + rPos); 
-                 opt[rPos].mlen = 1; 
-                 opt[rPos].off = 0; 
-                 opt[rPos].litlen = llen + rPos; 
-                 opt[rPos].price = cost; 
-                 DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i) -- initial setup", 
-                             rPos, cost, opt[rPos].litlen); 
-         }   } 
-         /* set prices using initial match */ 
-         {   int mlen = MINMATCH; 
-             int const matchML = firstMatch.len;   /* necessarily < sufficient_len < LZ4_OPT_NUM */ 
-             int const offset = firstMatch.off; 
-             assert(matchML < LZ4_OPT_NUM); 
-             for ( ; mlen <= matchML ; mlen++) { 
-                 int const cost = LZ4HC_sequencePrice(llen, mlen); 
-                 opt[mlen].mlen = mlen; 
-                 opt[mlen].off = offset; 
-                 opt[mlen].litlen = llen; 
-                 opt[mlen].price = cost; 
-                 DEBUGLOG(7, "rPos:%3i => price:%3i (matchlen=%i) -- initial setup", 
-                             mlen, cost, mlen); 
-         }   } 
-         last_match_pos = firstMatch.len; 
-         {   int addLit; 
-             for (addLit = 1; addLit <= TRAILING_LITERALS; addLit ++) { 
-                 opt[last_match_pos+addLit].mlen = 1; /* literal */ 
-                 opt[last_match_pos+addLit].off = 0; 
-                 opt[last_match_pos+addLit].litlen = addLit; 
-                 opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit); 
-                 DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i) -- initial setup", 
-                             last_match_pos+addLit, opt[last_match_pos+addLit].price, addLit); 
-         }   } 
- 
-         /* check further positions */ 
-         for (cur = 1; cur < last_match_pos; cur++) { 
-             const BYTE* const curPtr = ip + cur; 
-             LZ4HC_match_t newMatch; 
- 
-             if (curPtr > mflimit) break; 
-             DEBUGLOG(7, "rPos:%u[%u] vs [%u]%u", 
-                     cur, opt[cur].price, opt[cur+1].price, cur+1); 
-             if (fullUpdate) { 
-                 /* not useful to search here if next position has same (or lower) cost */ 
-                 if ( (opt[cur+1].price <= opt[cur].price) 
-                   /* in some cases, next position has same cost, but cost rises sharply after, so a small match would still be beneficial */ 
-                   && (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/) ) 
-                     continue; 
-             } else { 
-                 /* not useful to search here if next position has same (or lower) cost */ 
-                 if (opt[cur+1].price <= opt[cur].price) continue; 
-             } 
- 
-             DEBUGLOG(7, "search at rPos:%u", cur); 
-             if (fullUpdate) 
-                 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed); 
-             else 
-                 /* only test matches of minimum length; slightly faster, but misses a few bytes */ 
-                 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dict, favorDecSpeed); 
-             if (!newMatch.len) continue; 
- 
-             if ( ((size_t)newMatch.len > sufficient_len) 
-               || (newMatch.len + cur >= LZ4_OPT_NUM) ) { 
-                 /* immediate encoding */ 
-                 best_mlen = newMatch.len; 
-                 best_off = newMatch.off; 
-                 last_match_pos = cur + 1; 
-                 goto encode; 
-             } 
- 
-             /* before match : set price with literals at beginning */ 
-             {   int const baseLitlen = opt[cur].litlen; 
-                 int litlen; 
-                 for (litlen = 1; litlen < MINMATCH; litlen++) { 
-                     int const price = opt[cur].price - LZ4HC_literalsPrice(baseLitlen) + LZ4HC_literalsPrice(baseLitlen+litlen); 
-                     int const pos = cur + litlen; 
-                     if (price < opt[pos].price) { 
-                         opt[pos].mlen = 1; /* literal */ 
-                         opt[pos].off = 0; 
-                         opt[pos].litlen = baseLitlen+litlen; 
-                         opt[pos].price = price; 
-                         DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i)", 
-                                     pos, price, opt[pos].litlen); 
-             }   }   } 
- 
-             /* set prices using match at position = cur */ 
-             {   int const matchML = newMatch.len; 
-                 int ml = MINMATCH; 
- 
-                 assert(cur + newMatch.len < LZ4_OPT_NUM); 
-                 for ( ; ml <= matchML ; ml++) { 
-                     int const pos = cur + ml; 
-                     int const offset = newMatch.off; 
-                     int price; 
-                     int ll; 
-                     DEBUGLOG(7, "testing price rPos %i (last_match_pos=%i)", 
-                                 pos, last_match_pos); 
-                     if (opt[cur].mlen == 1) { 
-                         ll = opt[cur].litlen; 
-                         price = ((cur > ll) ? opt[cur - ll].price : 0) 
-                               + LZ4HC_sequencePrice(ll, ml); 
-                     } else { 
-                         ll = 0; 
-                         price = opt[cur].price + LZ4HC_sequencePrice(0, ml); 
-                     } 
- 
-                    assert((U32)favorDecSpeed <= 1); 
-                     if (pos > last_match_pos+TRAILING_LITERALS 
-                      || price <= opt[pos].price - (int)favorDecSpeed) { 
-                         DEBUGLOG(7, "rPos:%3i => price:%3i (matchlen=%i)", 
-                                     pos, price, ml); 
-                         assert(pos < LZ4_OPT_NUM); 
-                         if ( (ml == matchML)  /* last pos of last match */ 
-                           && (last_match_pos < pos) ) 
-                             last_match_pos = pos; 
-                         opt[pos].mlen = ml; 
-                         opt[pos].off = offset; 
-                         opt[pos].litlen = ll; 
-                         opt[pos].price = price; 
-             }   }   } 
-             /* complete following positions with literals */ 
-             {   int addLit; 
-                 for (addLit = 1; addLit <= TRAILING_LITERALS; addLit ++) { 
-                     opt[last_match_pos+addLit].mlen = 1; /* literal */ 
-                     opt[last_match_pos+addLit].off = 0; 
-                     opt[last_match_pos+addLit].litlen = addLit; 
-                     opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit); 
-                     DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i)", last_match_pos+addLit, opt[last_match_pos+addLit].price, addLit); 
-             }   } 
-         }  /* for (cur = 1; cur <= last_match_pos; cur++) */ 
- 
-         assert(last_match_pos < LZ4_OPT_NUM + TRAILING_LITERALS); 
-         best_mlen = opt[last_match_pos].mlen; 
-         best_off = opt[last_match_pos].off; 
-         cur = last_match_pos - best_mlen; 
- 
+
+             DEBUGLOG(7, "search at rPos:%u", cur);
+             if (fullUpdate)
+                 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed);
+             else
+                 /* only test matches of minimum length; slightly faster, but misses a few bytes */
+                 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dict, favorDecSpeed);
+             if (!newMatch.len) continue;
+
+             if ( ((size_t)newMatch.len > sufficient_len)
+               || (newMatch.len + cur >= LZ4_OPT_NUM) ) {
+                 /* immediate encoding */
+                 best_mlen = newMatch.len;
+                 best_off = newMatch.off;
+                 last_match_pos = cur + 1;
+                 goto encode;
+             }
+
+             /* before match : set price with literals at beginning */
+             {   int const baseLitlen = opt[cur].litlen;
+                 int litlen;
+                 for (litlen = 1; litlen < MINMATCH; litlen++) {
+                     int const price = opt[cur].price - LZ4HC_literalsPrice(baseLitlen) + LZ4HC_literalsPrice(baseLitlen+litlen);
+                     int const pos = cur + litlen;
+                     if (price < opt[pos].price) {
+                         opt[pos].mlen = 1; /* literal */
+                         opt[pos].off = 0;
+                         opt[pos].litlen = baseLitlen+litlen;
+                         opt[pos].price = price;
+                         DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i)",
+                                     pos, price, opt[pos].litlen);
+             }   }   }
+
+             /* set prices using match at position = cur */
+             {   int const matchML = newMatch.len;
+                 int ml = MINMATCH;
+
+                 assert(cur + newMatch.len < LZ4_OPT_NUM);
+                 for ( ; ml <= matchML ; ml++) {
+                     int const pos = cur + ml;
+                     int const offset = newMatch.off;
+                     int price;
+                     int ll;
+                     DEBUGLOG(7, "testing price rPos %i (last_match_pos=%i)",
+                                 pos, last_match_pos);
+                     if (opt[cur].mlen == 1) {
+                         ll = opt[cur].litlen;
+                         price = ((cur > ll) ? opt[cur - ll].price : 0)
+                               + LZ4HC_sequencePrice(ll, ml);
+                     } else {
+                         ll = 0;
+                         price = opt[cur].price + LZ4HC_sequencePrice(0, ml);
+                     }
+
+                    assert((U32)favorDecSpeed <= 1);
+                     if (pos > last_match_pos+TRAILING_LITERALS
+                      || price <= opt[pos].price - (int)favorDecSpeed) {
+                         DEBUGLOG(7, "rPos:%3i => price:%3i (matchlen=%i)",
+                                     pos, price, ml);
+                         assert(pos < LZ4_OPT_NUM);
+                         if ( (ml == matchML)  /* last pos of last match */
+                           && (last_match_pos < pos) )
+                             last_match_pos = pos;
+                         opt[pos].mlen = ml;
+                         opt[pos].off = offset;
+                         opt[pos].litlen = ll;
+                         opt[pos].price = price;
+             }   }   }
+             /* complete following positions with literals */
+             {   int addLit;
+                 for (addLit = 1; addLit <= TRAILING_LITERALS; addLit ++) {
+                     opt[last_match_pos+addLit].mlen = 1; /* literal */
+                     opt[last_match_pos+addLit].off = 0;
+                     opt[last_match_pos+addLit].litlen = addLit;
+                     opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit);
+                     DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i)", last_match_pos+addLit, opt[last_match_pos+addLit].price, addLit);
+             }   }
+         }  /* for (cur = 1; cur <= last_match_pos; cur++) */
+
+         assert(last_match_pos < LZ4_OPT_NUM + TRAILING_LITERALS);
+         best_mlen = opt[last_match_pos].mlen;
+         best_off = opt[last_match_pos].off;
+         cur = last_match_pos - best_mlen;
+
 encode: /* cur, last_match_pos, best_mlen, best_off must be set */
-         assert(cur < LZ4_OPT_NUM); 
-         assert(last_match_pos >= 1);  /* == 1 when only one candidate */ 
-         DEBUGLOG(6, "reverse traversal, looking for shortest path (last_match_pos=%i)", last_match_pos); 
-         {   int candidate_pos = cur; 
-             int selected_matchLength = best_mlen; 
-             int selected_offset = best_off; 
-             while (1) {  /* from end to beginning */ 
-                 int const next_matchLength = opt[candidate_pos].mlen;  /* can be 1, means literal */ 
-                 int const next_offset = opt[candidate_pos].off; 
-                 DEBUGLOG(7, "pos %i: sequence length %i", candidate_pos, selected_matchLength); 
-                 opt[candidate_pos].mlen = selected_matchLength; 
-                 opt[candidate_pos].off = selected_offset; 
-                 selected_matchLength = next_matchLength; 
-                 selected_offset = next_offset; 
-                 if (next_matchLength > candidate_pos) break; /* last match elected, first match to encode */ 
-                 assert(next_matchLength > 0);  /* can be 1, means literal */ 
-                 candidate_pos -= next_matchLength; 
-         }   } 
- 
-         /* encode all recorded sequences in order */ 
-         {   int rPos = 0;  /* relative position (to ip) */ 
-             while (rPos < last_match_pos) { 
-                 int const ml = opt[rPos].mlen; 
-                 int const offset = opt[rPos].off; 
-                 if (ml == 1) { ip++; rPos++; continue; }  /* literal; note: can end up with several literals, in which case, skip them */ 
-                 rPos += ml; 
-                 assert(ml >= MINMATCH); 
-                 assert((offset >= 1) && (offset <= LZ4_DISTANCE_MAX)); 
-                 opSaved = op; 
+         assert(cur < LZ4_OPT_NUM);
+         assert(last_match_pos >= 1);  /* == 1 when only one candidate */
+         DEBUGLOG(6, "reverse traversal, looking for shortest path (last_match_pos=%i)", last_match_pos);
+         {   int candidate_pos = cur;
+             int selected_matchLength = best_mlen;
+             int selected_offset = best_off;
+             while (1) {  /* from end to beginning */
+                 int const next_matchLength = opt[candidate_pos].mlen;  /* can be 1, means literal */
+                 int const next_offset = opt[candidate_pos].off;
+                 DEBUGLOG(7, "pos %i: sequence length %i", candidate_pos, selected_matchLength);
+                 opt[candidate_pos].mlen = selected_matchLength;
+                 opt[candidate_pos].off = selected_offset;
+                 selected_matchLength = next_matchLength;
+                 selected_offset = next_offset;
+                 if (next_matchLength > candidate_pos) break; /* last match elected, first match to encode */
+                 assert(next_matchLength > 0);  /* can be 1, means literal */
+                 candidate_pos -= next_matchLength;
+         }   }
+
+         /* encode all recorded sequences in order */
+         {   int rPos = 0;  /* relative position (to ip) */
+             while (rPos < last_match_pos) {
+                 int const ml = opt[rPos].mlen;
+                 int const offset = opt[rPos].off;
+                 if (ml == 1) { ip++; rPos++; continue; }  /* literal; note: can end up with several literals, in which case, skip them */
+                 rPos += ml;
+                 assert(ml >= MINMATCH);
+                 assert((offset >= 1) && (offset <= LZ4_DISTANCE_MAX));
+                 opSaved = op;
                  if ( LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ip - offset, limit, oend) ) {  /* updates ip, op and anchor */
                      ovml = ml;
                      ovref = ip - offset;
-                     goto _dest_overflow; 
+                     goto _dest_overflow;
          }   }   }
-     }  /* while (ip <= mflimit) */ 
- 
+     }  /* while (ip <= mflimit) */
+
 _last_literals:
-     /* Encode Last Literals */ 
-     {   size_t lastRunSize = (size_t)(iend - anchor);  /* literals */ 
+     /* Encode Last Literals */
+     {   size_t lastRunSize = (size_t)(iend - anchor);  /* literals */
          size_t llAdd = (lastRunSize + 255 - RUN_MASK) / 255;
          size_t const totalSize = 1 + llAdd + lastRunSize;
-         if (limit == fillOutput) oend += LASTLITERALS;  /* restore correct value */ 
-         if (limit && (op + totalSize > oend)) { 
+         if (limit == fillOutput) oend += LASTLITERALS;  /* restore correct value */
+         if (limit && (op + totalSize > oend)) {
              if (limit == limitedOutput) { /* Check output limit */
                 retval = 0;
                 goto _return_label;
              }
-             /* adapt lastRunSize to fill 'dst' */ 
+             /* adapt lastRunSize to fill 'dst' */
              lastRunSize  = (size_t)(oend - op) - 1 /*token*/;
              llAdd = (lastRunSize + 256 - RUN_MASK) / 256;
              lastRunSize -= llAdd;
-         } 
+         }
          DEBUGLOG(6, "Final literal run : %i literals", (int)lastRunSize);
          ip = anchor + lastRunSize; /* can be != iend if limit==fillOutput */
- 
-         if (lastRunSize >= RUN_MASK) { 
-             size_t accumulator = lastRunSize - RUN_MASK; 
-             *op++ = (RUN_MASK << ML_BITS); 
-             for(; accumulator >= 255 ; accumulator -= 255) *op++ = 255; 
-             *op++ = (BYTE) accumulator; 
-         } else { 
-             *op++ = (BYTE)(lastRunSize << ML_BITS); 
-         } 
-         memcpy(op, anchor, lastRunSize); 
-         op += lastRunSize; 
-     } 
- 
-     /* End */ 
-     *srcSizePtr = (int) (((const char*)ip) - source); 
+
+         if (lastRunSize >= RUN_MASK) {
+             size_t accumulator = lastRunSize - RUN_MASK;
+             *op++ = (RUN_MASK << ML_BITS);
+             for(; accumulator >= 255 ; accumulator -= 255) *op++ = 255;
+             *op++ = (BYTE) accumulator;
+         } else {
+             *op++ = (BYTE)(lastRunSize << ML_BITS);
+         }
+         memcpy(op, anchor, lastRunSize);
+         op += lastRunSize;
+     }
+
+     /* End */
+     *srcSizePtr = (int) (((const char*)ip) - source);
      retval = (int) ((char*)op-dst);
      goto _return_label;
- 
+
 _dest_overflow:
 if (limit == fillOutput) {
      /* Assumption : ip, anchor, ovml and ovref must be set correctly */
diff --git a/contrib/libs/lz4/lz4hc.h b/contrib/libs/lz4/lz4hc.h
index 7c713ac2d7..3d441fb6fa 100644
--- a/contrib/libs/lz4/lz4hc.h
+++ b/contrib/libs/lz4/lz4hc.h
@@ -1,7 +1,7 @@
 /*
    LZ4 HC - High Compression Mode of LZ4
    Header File
-   Copyright (C) 2011-2017, Yann Collet. 
+   Copyright (C) 2011-2017, 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
@@ -39,14 +39,14 @@ extern "C" {
 #endif
 
 /* --- Dependency --- */
-/* note : lz4hc requires lz4.h/lz4.c for compilation */ 
+/* note : lz4hc requires lz4.h/lz4.c for compilation */
 #include "lz4.h"   /* stddef, LZ4LIB_API, LZ4_DEPRECATED */
 
 
 /* --- Useful constants --- */
 #define LZ4HC_CLEVEL_MIN         3
 #define LZ4HC_CLEVEL_DEFAULT     9
-#define LZ4HC_CLEVEL_OPT_MIN    10 
+#define LZ4HC_CLEVEL_OPT_MIN    10
 #define LZ4HC_CLEVEL_MAX        12
 
 
@@ -54,12 +54,12 @@ extern "C" {
  *  Block Compression
  **************************************/
 /*! LZ4_compress_HC() :
- *  Compress data from `src` into `dst`, using the powerful but slower "HC" algorithm. 
+ *  Compress data from `src` into `dst`, using the powerful but slower "HC" algorithm.
  * `dst` must be already allocated.
- *  Compression is guaranteed to succeed if `dstCapacity >= LZ4_compressBound(srcSize)` (see "lz4.h") 
- *  Max supported `srcSize` value is LZ4_MAX_INPUT_SIZE (see "lz4.h") 
- * `compressionLevel` : any value between 1 and LZ4HC_CLEVEL_MAX will work. 
- *                      Values > LZ4HC_CLEVEL_MAX behave the same as LZ4HC_CLEVEL_MAX. 
+ *  Compression is guaranteed to succeed if `dstCapacity >= LZ4_compressBound(srcSize)` (see "lz4.h")
+ *  Max supported `srcSize` value is LZ4_MAX_INPUT_SIZE (see "lz4.h")
+ * `compressionLevel` : any value between 1 and LZ4HC_CLEVEL_MAX will work.
+ *                      Values > LZ4HC_CLEVEL_MAX behave the same as LZ4HC_CLEVEL_MAX.
  * @return : the number of bytes written into 'dst'
  *           or 0 if compression fails.
  */
@@ -72,28 +72,28 @@ LZ4LIB_API int LZ4_compress_HC (const char* src, char* dst, int srcSize, int dst
 
 
 /*! LZ4_compress_HC_extStateHC() :
- *  Same as LZ4_compress_HC(), but using an externally allocated memory segment for `state`. 
+ *  Same as LZ4_compress_HC(), but using an externally allocated memory segment for `state`.
  * `state` size is provided by LZ4_sizeofStateHC().
- *  Memory segment must be aligned on 8-bytes boundaries (which a normal malloc() should do properly). 
+ *  Memory segment must be aligned on 8-bytes boundaries (which a normal malloc() should do properly).
  */
 LZ4LIB_API int LZ4_sizeofStateHC(void);
-LZ4LIB_API int LZ4_compress_HC_extStateHC(void* stateHC, const char* src, char* dst, int srcSize, int maxDstSize, int compressionLevel); 
-
-
-/*! LZ4_compress_HC_destSize() : v1.9.0+ 
- *  Will compress as much data as possible from `src` 
- *  to fit into `targetDstSize` budget. 
- *  Result is provided in 2 parts : 
- * @return : the number of bytes written into 'dst' (necessarily <= targetDstSize) 
- *           or 0 if compression fails. 
- * `srcSizePtr` : on success, *srcSizePtr is updated to indicate how much bytes were read from `src` 
- */ 
-LZ4LIB_API int LZ4_compress_HC_destSize(void* stateHC, 
-                                  const char* src, char* dst, 
-                                        int* srcSizePtr, int targetDstSize, 
-                                        int compressionLevel); 
- 
- 
+LZ4LIB_API int LZ4_compress_HC_extStateHC(void* stateHC, const char* src, char* dst, int srcSize, int maxDstSize, int compressionLevel);
+
+
+/*! LZ4_compress_HC_destSize() : v1.9.0+
+ *  Will compress as much data as possible from `src`
+ *  to fit into `targetDstSize` budget.
+ *  Result is provided in 2 parts :
+ * @return : the number of bytes written into 'dst' (necessarily <= targetDstSize)
+ *           or 0 if compression fails.
+ * `srcSizePtr` : on success, *srcSizePtr is updated to indicate how much bytes were read from `src`
+ */
+LZ4LIB_API int LZ4_compress_HC_destSize(void* stateHC,
+                                  const char* src, char* dst,
+                                        int* srcSizePtr, int targetDstSize,
+                                        int compressionLevel);
+
+
 /*-************************************
  *  Streaming Compression
  *  Bufferless synchronous API
@@ -101,95 +101,95 @@ LZ4LIB_API int LZ4_compress_HC_destSize(void* stateHC,
  typedef union LZ4_streamHC_u LZ4_streamHC_t;   /* incomplete type (defined later) */
 
 /*! LZ4_createStreamHC() and LZ4_freeStreamHC() :
- *  These functions create and release memory for LZ4 HC streaming state. 
- *  Newly created states are automatically initialized. 
- *  A same state can be used multiple times consecutively, 
- *  starting with LZ4_resetStreamHC_fast() to start a new stream of blocks. 
+ *  These functions create and release memory for LZ4 HC streaming state.
+ *  Newly created states are automatically initialized.
+ *  A same state can be used multiple times consecutively,
+ *  starting with LZ4_resetStreamHC_fast() to start a new stream of blocks.
  */
 LZ4LIB_API LZ4_streamHC_t* LZ4_createStreamHC(void);
 LZ4LIB_API int             LZ4_freeStreamHC (LZ4_streamHC_t* streamHCPtr);
 
 /*
-  These functions compress data in successive blocks of any size, 
-  using previous blocks as dictionary, to improve compression ratio. 
+  These functions compress data in successive blocks of any size,
+  using previous blocks as dictionary, to improve compression ratio.
   One key assumption is that previous blocks (up to 64 KB) remain read-accessible while compressing next blocks.
   There is an exception for ring buffers, which can be smaller than 64 KB.
-  Ring-buffer scenario is automatically detected and handled within LZ4_compress_HC_continue(). 
-
-  Before starting compression, state must be allocated and properly initialized. 
-  LZ4_createStreamHC() does both, though compression level is set to LZ4HC_CLEVEL_DEFAULT. 
-
-  Selecting the compression level can be done with LZ4_resetStreamHC_fast() (starts a new stream) 
-  or LZ4_setCompressionLevel() (anytime, between blocks in the same stream) (experimental). 
-  LZ4_resetStreamHC_fast() only works on states which have been properly initialized at least once, 
-  which is automatically the case when state is created using LZ4_createStreamHC(). 
-
-  After reset, a first "fictional block" can be designated as initial dictionary, 
-  using LZ4_loadDictHC() (Optional). 
- 
-  Invoke LZ4_compress_HC_continue() to compress each successive block. 
-  The number of blocks is unlimited. 
-  Previous input blocks, including initial dictionary when present, 
-  must remain accessible and unmodified during compression. 
- 
-  It's allowed to update compression level anytime between blocks, 
-  using LZ4_setCompressionLevel() (experimental). 
- 
-  'dst' buffer should be sized to handle worst case scenarios 
-  (see LZ4_compressBound(), it ensures compression success). 
-  In case of failure, the API does not guarantee recovery, 
-  so the state _must_ be reset. 
-  To ensure compression success 
-  whenever `dst` buffer size cannot be made >= LZ4_compressBound(), 
-  consider using LZ4_compress_HC_continue_destSize(). 
- 
-  Whenever previous input blocks can't be preserved unmodified in-place during compression of next blocks, 
-  it's possible to copy the last blocks into a more stable memory space, using LZ4_saveDictHC(). 
-  Return value of LZ4_saveDictHC() is the size of dictionary effectively saved into 'safeBuffer' (<= 64 KB) 
- 
-  After completing a streaming compression, 
-  it's possible to start a new stream of blocks, using the same LZ4_streamHC_t state, 
-  just by resetting it, using LZ4_resetStreamHC_fast(). 
+  Ring-buffer scenario is automatically detected and handled within LZ4_compress_HC_continue().
+
+  Before starting compression, state must be allocated and properly initialized.
+  LZ4_createStreamHC() does both, though compression level is set to LZ4HC_CLEVEL_DEFAULT.
+
+  Selecting the compression level can be done with LZ4_resetStreamHC_fast() (starts a new stream)
+  or LZ4_setCompressionLevel() (anytime, between blocks in the same stream) (experimental).
+  LZ4_resetStreamHC_fast() only works on states which have been properly initialized at least once,
+  which is automatically the case when state is created using LZ4_createStreamHC().
+
+  After reset, a first "fictional block" can be designated as initial dictionary,
+  using LZ4_loadDictHC() (Optional).
+
+  Invoke LZ4_compress_HC_continue() to compress each successive block.
+  The number of blocks is unlimited.
+  Previous input blocks, including initial dictionary when present,
+  must remain accessible and unmodified during compression.
+
+  It's allowed to update compression level anytime between blocks,
+  using LZ4_setCompressionLevel() (experimental).
+
+  'dst' buffer should be sized to handle worst case scenarios
+  (see LZ4_compressBound(), it ensures compression success).
+  In case of failure, the API does not guarantee recovery,
+  so the state _must_ be reset.
+  To ensure compression success
+  whenever `dst` buffer size cannot be made >= LZ4_compressBound(),
+  consider using LZ4_compress_HC_continue_destSize().
+
+  Whenever previous input blocks can't be preserved unmodified in-place during compression of next blocks,
+  it's possible to copy the last blocks into a more stable memory space, using LZ4_saveDictHC().
+  Return value of LZ4_saveDictHC() is the size of dictionary effectively saved into 'safeBuffer' (<= 64 KB)
+
+  After completing a streaming compression,
+  it's possible to start a new stream of blocks, using the same LZ4_streamHC_t state,
+  just by resetting it, using LZ4_resetStreamHC_fast().
 */
 
-LZ4LIB_API void LZ4_resetStreamHC_fast(LZ4_streamHC_t* streamHCPtr, int compressionLevel);   /* v1.9.0+ */ 
-LZ4LIB_API int  LZ4_loadDictHC (LZ4_streamHC_t* streamHCPtr, const char* dictionary, int dictSize); 
-
-LZ4LIB_API int LZ4_compress_HC_continue (LZ4_streamHC_t* streamHCPtr, 
-                                   const char* src, char* dst, 
-                                         int srcSize, int maxDstSize); 
-
-/*! LZ4_compress_HC_continue_destSize() : v1.9.0+ 
- *  Similar to LZ4_compress_HC_continue(), 
- *  but will read as much data as possible from `src` 
- *  to fit into `targetDstSize` budget. 
- *  Result is provided into 2 parts : 
- * @return : the number of bytes written into 'dst' (necessarily <= targetDstSize) 
- *           or 0 if compression fails. 
- * `srcSizePtr` : on success, *srcSizePtr will be updated to indicate how much bytes were read from `src`. 
- *           Note that this function may not consume the entire input. 
- */ 
-LZ4LIB_API int LZ4_compress_HC_continue_destSize(LZ4_streamHC_t* LZ4_streamHCPtr, 
-                                           const char* src, char* dst, 
-                                                 int* srcSizePtr, int targetDstSize); 
- 
-LZ4LIB_API int LZ4_saveDictHC (LZ4_streamHC_t* streamHCPtr, char* safeBuffer, int maxDictSize); 
- 
- 
- 
-/*^********************************************** 
- * !!!!!!   STATIC LINKING ONLY   !!!!!! 
- ***********************************************/ 
- 
-/*-****************************************************************** 
+LZ4LIB_API void LZ4_resetStreamHC_fast(LZ4_streamHC_t* streamHCPtr, int compressionLevel);   /* v1.9.0+ */
+LZ4LIB_API int  LZ4_loadDictHC (LZ4_streamHC_t* streamHCPtr, const char* dictionary, int dictSize);
+
+LZ4LIB_API int LZ4_compress_HC_continue (LZ4_streamHC_t* streamHCPtr,
+                                   const char* src, char* dst,
+                                         int srcSize, int maxDstSize);
+
+/*! LZ4_compress_HC_continue_destSize() : v1.9.0+
+ *  Similar to LZ4_compress_HC_continue(),
+ *  but will read as much data as possible from `src`
+ *  to fit into `targetDstSize` budget.
+ *  Result is provided into 2 parts :
+ * @return : the number of bytes written into 'dst' (necessarily <= targetDstSize)
+ *           or 0 if compression fails.
+ * `srcSizePtr` : on success, *srcSizePtr will be updated to indicate how much bytes were read from `src`.
+ *           Note that this function may not consume the entire input.
+ */
+LZ4LIB_API int LZ4_compress_HC_continue_destSize(LZ4_streamHC_t* LZ4_streamHCPtr,
+                                           const char* src, char* dst,
+                                                 int* srcSizePtr, int targetDstSize);
+
+LZ4LIB_API int LZ4_saveDictHC (LZ4_streamHC_t* streamHCPtr, char* safeBuffer, int maxDictSize);
+
+
+
+/*^**********************************************
+ * !!!!!!   STATIC LINKING ONLY   !!!!!!
+ ***********************************************/
+
+/*-******************************************************************
  * PRIVATE DEFINITIONS :
- * Do not use these definitions directly. 
- * They are merely exposed to allow static allocation of `LZ4_streamHC_t`. 
- * Declare an `LZ4_streamHC_t` directly, rather than any type below. 
- * Even then, only do so in the context of static linking, as definitions may change between versions. 
- ********************************************************************/ 
- 
-#define LZ4HC_DICTIONARY_LOGSIZE 16 
+ * Do not use these definitions directly.
+ * They are merely exposed to allow static allocation of `LZ4_streamHC_t`.
+ * Declare an `LZ4_streamHC_t` directly, rather than any type below.
+ * Even then, only do so in the context of static linking, as definitions may change between versions.
+ ********************************************************************/
+
+#define LZ4HC_DICTIONARY_LOGSIZE 16
 #define LZ4HC_MAXD (1<<LZ4HC_DICTIONARY_LOGSIZE)
 #define LZ4HC_MAXD_MASK (LZ4HC_MAXD - 1)
 
@@ -198,8 +198,8 @@ LZ4LIB_API int LZ4_saveDictHC (LZ4_streamHC_t* streamHCPtr, char* safeBuffer, in
 #define LZ4HC_HASH_MASK (LZ4HC_HASHTABLESIZE - 1)
 
 
-typedef struct LZ4HC_CCtx_internal LZ4HC_CCtx_internal; 
-struct LZ4HC_CCtx_internal 
+typedef struct LZ4HC_CCtx_internal LZ4HC_CCtx_internal;
+struct LZ4HC_CCtx_internal
 {
     LZ4_u32   hashTable[LZ4HC_HASHTABLESIZE];
     LZ4_u16   chainTable[LZ4HC_MAXD];
@@ -213,201 +213,201 @@ struct LZ4HC_CCtx_internal
     LZ4_i8    favorDecSpeed;   /* favor decompression speed if this flag set,
                                   otherwise, favor compression ratio */
     LZ4_i8    dirty;           /* stream has to be fully reset if this flag is set */
-    const LZ4HC_CCtx_internal* dictCtx; 
-}; 
+    const LZ4HC_CCtx_internal* dictCtx;
+};
 
 
-/* Do not use these definitions directly ! 
- * Declare or allocate an LZ4_streamHC_t instead. 
- */ 
+/* Do not use these definitions directly !
+ * Declare or allocate an LZ4_streamHC_t instead.
+ */
 #define LZ4_STREAMHCSIZE       262200  /* static size, for inter-version compatibility */
 #define LZ4_STREAMHCSIZE_VOIDP (LZ4_STREAMHCSIZE / sizeof(void*))
 union LZ4_streamHC_u {
     void* table[LZ4_STREAMHCSIZE_VOIDP];
     LZ4HC_CCtx_internal internal_donotuse;
-}; /* previously typedef'd to LZ4_streamHC_t */ 
-
-/* LZ4_streamHC_t : 
- * This structure allows static allocation of LZ4 HC streaming state. 
- * This can be used to allocate statically, on state, or as part of a larger structure. 
- * 
- * Such state **must** be initialized using LZ4_initStreamHC() before first use. 
- * 
- * Note that invoking LZ4_initStreamHC() is not required when 
- * the state was created using LZ4_createStreamHC() (which is recommended). 
- * Using the normal builder, a newly created state is automatically initialized. 
- * 
- * Static allocation shall only be used in combination with static linking. 
- */ 
-
-/* LZ4_initStreamHC() : v1.9.0+ 
- * Required before first use of a statically allocated LZ4_streamHC_t. 
- * Before v1.9.0 : use LZ4_resetStreamHC() instead 
- */ 
-LZ4LIB_API LZ4_streamHC_t* LZ4_initStreamHC (void* buffer, size_t size); 
-
- 
+}; /* previously typedef'd to LZ4_streamHC_t */
+
+/* LZ4_streamHC_t :
+ * This structure allows static allocation of LZ4 HC streaming state.
+ * This can be used to allocate statically, on state, or as part of a larger structure.
+ *
+ * Such state **must** be initialized using LZ4_initStreamHC() before first use.
+ *
+ * Note that invoking LZ4_initStreamHC() is not required when
+ * the state was created using LZ4_createStreamHC() (which is recommended).
+ * Using the normal builder, a newly created state is automatically initialized.
+ *
+ * Static allocation shall only be used in combination with static linking.
+ */
+
+/* LZ4_initStreamHC() : v1.9.0+
+ * Required before first use of a statically allocated LZ4_streamHC_t.
+ * Before v1.9.0 : use LZ4_resetStreamHC() instead
+ */
+LZ4LIB_API LZ4_streamHC_t* LZ4_initStreamHC (void* buffer, size_t size);
+
+
 /*-************************************
 *  Deprecated Functions
 **************************************/
 /* see lz4.h LZ4_DISABLE_DEPRECATE_WARNINGS to turn off deprecation warnings */
 
 /* deprecated compression functions */
-LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC               (const char* source, char* dest, int inputSize); 
-LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput (const char* source, char* dest, int inputSize, int maxOutputSize); 
-LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2              (const char* source, char* dest, int inputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_withStateHC               (void* state, const char* source, char* dest, int inputSize); 
-LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_withStateHC (void* state, const char* source, char* dest, int inputSize, int maxOutputSize); 
-LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_withStateHC              (void* state, const char* source, char* dest, int inputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_withStateHC(void* state, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_continue               (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize); 
-LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize, int maxOutputSize); 
-
-/* Obsolete streaming functions; degraded functionality; do not use! 
- * 
- * In order to perform streaming compression, these functions depended on data 
- * that is no longer tracked in the state. They have been preserved as well as 
- * possible: using them will still produce a correct output. However, use of 
- * LZ4_slideInputBufferHC() will truncate the history of the stream, rather 
- * than preserve a window-sized chunk of history. 
- */ 
-LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API void* LZ4_createHC (const char* inputBuffer); 
-LZ4_DEPRECATED("use LZ4_saveDictHC() instead") LZ4LIB_API     char* LZ4_slideInputBufferHC (void* LZ4HC_Data); 
-LZ4_DEPRECATED("use LZ4_freeStreamHC() instead") LZ4LIB_API   int   LZ4_freeHC (void* LZ4HC_Data); 
-LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_continue               (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_continue (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel); 
-LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API int   LZ4_sizeofStreamStateHC(void); 
-LZ4_DEPRECATED("use LZ4_initStreamHC() instead") LZ4LIB_API  int   LZ4_resetStreamStateHC(void* state, char* inputBuffer); 
-
-
-/* LZ4_resetStreamHC() is now replaced by LZ4_initStreamHC(). 
- * The intention is to emphasize the difference with LZ4_resetStreamHC_fast(), 
- * which is now the recommended function to start a new stream of blocks, 
- * but cannot be used to initialize a memory segment containing arbitrary garbage data. 
- * 
- * It is recommended to switch to LZ4_initStreamHC(). 
- * LZ4_resetStreamHC() will generate deprecation warnings in a future version. 
- */ 
-LZ4LIB_API void LZ4_resetStreamHC (LZ4_streamHC_t* streamHCPtr, int compressionLevel); 
- 
- 
+LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC               (const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput (const char* source, char* dest, int inputSize, int maxOutputSize);
+LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2              (const char* source, char* dest, int inputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_withStateHC               (void* state, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_withStateHC (void* state, const char* source, char* dest, int inputSize, int maxOutputSize);
+LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_withStateHC              (void* state, const char* source, char* dest, int inputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_withStateHC(void* state, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_continue               (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize, int maxOutputSize);
+
+/* Obsolete streaming functions; degraded functionality; do not use!
+ *
+ * In order to perform streaming compression, these functions depended on data
+ * that is no longer tracked in the state. They have been preserved as well as
+ * possible: using them will still produce a correct output. However, use of
+ * LZ4_slideInputBufferHC() will truncate the history of the stream, rather
+ * than preserve a window-sized chunk of history.
+ */
+LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API void* LZ4_createHC (const char* inputBuffer);
+LZ4_DEPRECATED("use LZ4_saveDictHC() instead") LZ4LIB_API     char* LZ4_slideInputBufferHC (void* LZ4HC_Data);
+LZ4_DEPRECATED("use LZ4_freeStreamHC() instead") LZ4LIB_API   int   LZ4_freeHC (void* LZ4HC_Data);
+LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_continue               (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_continue (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
+LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API int   LZ4_sizeofStreamStateHC(void);
+LZ4_DEPRECATED("use LZ4_initStreamHC() instead") LZ4LIB_API  int   LZ4_resetStreamStateHC(void* state, char* inputBuffer);
+
+
+/* LZ4_resetStreamHC() is now replaced by LZ4_initStreamHC().
+ * The intention is to emphasize the difference with LZ4_resetStreamHC_fast(),
+ * which is now the recommended function to start a new stream of blocks,
+ * but cannot be used to initialize a memory segment containing arbitrary garbage data.
+ *
+ * It is recommended to switch to LZ4_initStreamHC().
+ * LZ4_resetStreamHC() will generate deprecation warnings in a future version.
+ */
+LZ4LIB_API void LZ4_resetStreamHC (LZ4_streamHC_t* streamHCPtr, int compressionLevel);
+
+
 #if defined (__cplusplus)
 }
 #endif
 
 #endif /* LZ4_HC_H_19834876238432 */
- 
- 
-/*-************************************************** 
- * !!!!!     STATIC LINKING ONLY     !!!!! 
- * Following definitions are considered experimental. 
- * They should not be linked from DLL, 
- * as there is no guarantee of API stability yet. 
- * Prototypes will be promoted to "stable" status 
- * after successfull usage in real-life scenarios. 
- ***************************************************/ 
-#ifdef LZ4_HC_STATIC_LINKING_ONLY   /* protection macro */ 
-#ifndef LZ4_HC_SLO_098092834 
-#define LZ4_HC_SLO_098092834 
- 
+
+
+/*-**************************************************
+ * !!!!!     STATIC LINKING ONLY     !!!!!
+ * Following definitions are considered experimental.
+ * They should not be linked from DLL,
+ * as there is no guarantee of API stability yet.
+ * Prototypes will be promoted to "stable" status
+ * after successfull usage in real-life scenarios.
+ ***************************************************/
+#ifdef LZ4_HC_STATIC_LINKING_ONLY   /* protection macro */
+#ifndef LZ4_HC_SLO_098092834
+#define LZ4_HC_SLO_098092834
+
 #define LZ4_STATIC_LINKING_ONLY   /* LZ4LIB_STATIC_API */
 #include "lz4.h"
 
-#if defined (__cplusplus) 
-extern "C" { 
-#endif 
- 
-/*! LZ4_setCompressionLevel() : v1.8.0+ (experimental) 
- *  It's possible to change compression level 
- *  between successive invocations of LZ4_compress_HC_continue*() 
- *  for dynamic adaptation. 
- */ 
-LZ4LIB_STATIC_API void LZ4_setCompressionLevel( 
-    LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel); 
- 
-/*! LZ4_favorDecompressionSpeed() : v1.8.2+ (experimental) 
- *  Opt. Parser will favor decompression speed over compression ratio. 
- *  Only applicable to levels >= LZ4HC_CLEVEL_OPT_MIN. 
- */ 
-LZ4LIB_STATIC_API void LZ4_favorDecompressionSpeed( 
-    LZ4_streamHC_t* LZ4_streamHCPtr, int favor); 
- 
-/*! LZ4_resetStreamHC_fast() : v1.9.0+ 
- *  When an LZ4_streamHC_t is known to be in a internally coherent state, 
- *  it can often be prepared for a new compression with almost no work, only 
- *  sometimes falling back to the full, expensive reset that is always required 
- *  when the stream is in an indeterminate state (i.e., the reset performed by 
- *  LZ4_resetStreamHC()). 
- * 
- *  LZ4_streamHCs are guaranteed to be in a valid state when: 
- *  - returned from LZ4_createStreamHC() 
- *  - reset by LZ4_resetStreamHC() 
- *  - memset(stream, 0, sizeof(LZ4_streamHC_t)) 
- *  - the stream was in a valid state and was reset by LZ4_resetStreamHC_fast() 
- *  - the stream was in a valid state and was then used in any compression call 
- *    that returned success 
- *  - the stream was in an indeterminate state and was used in a compression 
- *    call that fully reset the state (LZ4_compress_HC_extStateHC()) and that 
- *    returned success 
- * 
- *  Note: 
- *  A stream that was last used in a compression call that returned an error 
- *  may be passed to this function. However, it will be fully reset, which will 
- *  clear any existing history and settings from the context. 
- */ 
-LZ4LIB_STATIC_API void LZ4_resetStreamHC_fast( 
-    LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel); 
- 
-/*! LZ4_compress_HC_extStateHC_fastReset() : 
- *  A variant of LZ4_compress_HC_extStateHC(). 
- * 
- *  Using this variant avoids an expensive initialization step. It is only safe 
- *  to call if the state buffer is known to be correctly initialized already 
- *  (see above comment on LZ4_resetStreamHC_fast() for a definition of 
- *  "correctly initialized"). From a high level, the difference is that this 
- *  function initializes the provided state with a call to 
- *  LZ4_resetStreamHC_fast() while LZ4_compress_HC_extStateHC() starts with a 
- *  call to LZ4_resetStreamHC(). 
- */ 
-LZ4LIB_STATIC_API int LZ4_compress_HC_extStateHC_fastReset ( 
-    void* state, 
-    const char* src, char* dst, 
-    int srcSize, int dstCapacity, 
-    int compressionLevel); 
- 
-/*! LZ4_attach_HC_dictionary() : 
- *  This is an experimental API that allows for the efficient use of a 
- *  static dictionary many times. 
- * 
- *  Rather than re-loading the dictionary buffer into a working context before 
- *  each compression, or copying a pre-loaded dictionary's LZ4_streamHC_t into a 
- *  working LZ4_streamHC_t, this function introduces a no-copy setup mechanism, 
- *  in which the working stream references the dictionary stream in-place. 
- * 
- *  Several assumptions are made about the state of the dictionary stream. 
- *  Currently, only streams which have been prepared by LZ4_loadDictHC() should 
- *  be expected to work. 
- * 
- *  Alternatively, the provided dictionary stream pointer may be NULL, in which 
- *  case any existing dictionary stream is unset. 
- * 
- *  A dictionary should only be attached to a stream without any history (i.e., 
- *  a stream that has just been reset). 
- * 
- *  The dictionary will remain attached to the working stream only for the 
- *  current stream session. Calls to LZ4_resetStreamHC(_fast) will remove the 
- *  dictionary context association from the working stream. The dictionary 
- *  stream (and source buffer) must remain in-place / accessible / unchanged 
- *  through the lifetime of the stream session. 
- */ 
-LZ4LIB_STATIC_API void LZ4_attach_HC_dictionary( 
-          LZ4_streamHC_t *working_stream, 
-    const LZ4_streamHC_t *dictionary_stream); 
- 
-#if defined (__cplusplus) 
-} 
-#endif 
- 
-#endif   /* LZ4_HC_SLO_098092834 */ 
-#endif   /* LZ4_HC_STATIC_LINKING_ONLY */ 
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+/*! LZ4_setCompressionLevel() : v1.8.0+ (experimental)
+ *  It's possible to change compression level
+ *  between successive invocations of LZ4_compress_HC_continue*()
+ *  for dynamic adaptation.
+ */
+LZ4LIB_STATIC_API void LZ4_setCompressionLevel(
+    LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel);
+
+/*! LZ4_favorDecompressionSpeed() : v1.8.2+ (experimental)
+ *  Opt. Parser will favor decompression speed over compression ratio.
+ *  Only applicable to levels >= LZ4HC_CLEVEL_OPT_MIN.
+ */
+LZ4LIB_STATIC_API void LZ4_favorDecompressionSpeed(
+    LZ4_streamHC_t* LZ4_streamHCPtr, int favor);
+
+/*! LZ4_resetStreamHC_fast() : v1.9.0+
+ *  When an LZ4_streamHC_t is known to be in a internally coherent state,
+ *  it can often be prepared for a new compression with almost no work, only
+ *  sometimes falling back to the full, expensive reset that is always required
+ *  when the stream is in an indeterminate state (i.e., the reset performed by
+ *  LZ4_resetStreamHC()).
+ *
+ *  LZ4_streamHCs are guaranteed to be in a valid state when:
+ *  - returned from LZ4_createStreamHC()
+ *  - reset by LZ4_resetStreamHC()
+ *  - memset(stream, 0, sizeof(LZ4_streamHC_t))
+ *  - the stream was in a valid state and was reset by LZ4_resetStreamHC_fast()
+ *  - the stream was in a valid state and was then used in any compression call
+ *    that returned success
+ *  - the stream was in an indeterminate state and was used in a compression
+ *    call that fully reset the state (LZ4_compress_HC_extStateHC()) and that
+ *    returned success
+ *
+ *  Note:
+ *  A stream that was last used in a compression call that returned an error
+ *  may be passed to this function. However, it will be fully reset, which will
+ *  clear any existing history and settings from the context.
+ */
+LZ4LIB_STATIC_API void LZ4_resetStreamHC_fast(
+    LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel);
+
+/*! LZ4_compress_HC_extStateHC_fastReset() :
+ *  A variant of LZ4_compress_HC_extStateHC().
+ *
+ *  Using this variant avoids an expensive initialization step. It is only safe
+ *  to call if the state buffer is known to be correctly initialized already
+ *  (see above comment on LZ4_resetStreamHC_fast() for a definition of
+ *  "correctly initialized"). From a high level, the difference is that this
+ *  function initializes the provided state with a call to
+ *  LZ4_resetStreamHC_fast() while LZ4_compress_HC_extStateHC() starts with a
+ *  call to LZ4_resetStreamHC().
+ */
+LZ4LIB_STATIC_API int LZ4_compress_HC_extStateHC_fastReset (
+    void* state,
+    const char* src, char* dst,
+    int srcSize, int dstCapacity,
+    int compressionLevel);
+
+/*! LZ4_attach_HC_dictionary() :
+ *  This is an experimental API that allows for the efficient use of a
+ *  static dictionary many times.
+ *
+ *  Rather than re-loading the dictionary buffer into a working context before
+ *  each compression, or copying a pre-loaded dictionary's LZ4_streamHC_t into a
+ *  working LZ4_streamHC_t, this function introduces a no-copy setup mechanism,
+ *  in which the working stream references the dictionary stream in-place.
+ *
+ *  Several assumptions are made about the state of the dictionary stream.
+ *  Currently, only streams which have been prepared by LZ4_loadDictHC() should
+ *  be expected to work.
+ *
+ *  Alternatively, the provided dictionary stream pointer may be NULL, in which
+ *  case any existing dictionary stream is unset.
+ *
+ *  A dictionary should only be attached to a stream without any history (i.e.,
+ *  a stream that has just been reset).
+ *
+ *  The dictionary will remain attached to the working stream only for the
+ *  current stream session. Calls to LZ4_resetStreamHC(_fast) will remove the
+ *  dictionary context association from the working stream. The dictionary
+ *  stream (and source buffer) must remain in-place / accessible / unchanged
+ *  through the lifetime of the stream session.
+ */
+LZ4LIB_STATIC_API void LZ4_attach_HC_dictionary(
+          LZ4_streamHC_t *working_stream,
+    const LZ4_streamHC_t *dictionary_stream);
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif   /* LZ4_HC_SLO_098092834 */
+#endif   /* LZ4_HC_STATIC_LINKING_ONLY */