{"header":{"message":"Version bump for ZStd + compilation","description":null,"timestamp":"2023-04-17T07:48:24.942909683Z","authors":[{}]},"hash":"GV7LUZ3G2NUVQFKZOMYBRGB6AWC667EXD27MGHXC4KAYERGEMAGAC","authors":[{"login":"pmeunier","key":"FZQ2g7VfnzLYM4mtTVDk9HAZjA8Jk9ndkwN1icgbtWUr"}],"deps":{"hashes":[["GV7LUZ3G2NUVQFKZOMYBRGB6AWC667EXD27MGHXC4KAYERGEMAGAC","Version bump for ZStd + compilation"],["AA",null],["ENGQNLDGWI4JFRTVOVXJYK2ZXXXDWZSWSDQORJIC65AKEIDORZOAC","Back to zstd 1.4.8, before the massive performance regression"],["SMODSZD3RKFNFHFPPGUFGAX6OAWTRA3RTKGYFNL2IXPX4FYEI32QC","Reboot, again"],["NPLNTM3BHNQ4KL57FGMLHEXTZIRZQLALKDC3OXCHH3QRWVTEMNNQC",""]],"deps":["ENGQNLDGWI4JFRTVOVXJYK2ZXXXDWZSWSDQORJIC65AKEIDORZOAC"],"known":["NPLNTM3BHNQ4KL57FGMLHEXTZIRZQLALKDC3OXCHH3QRWVTEMNNQC","SMODSZD3RKFNFHFPPGUFGAX6OAWTRA3RTKGYFNL2IXPX4FYEI32QC"]},"hunks":[{"FileDel":{"deleted_names":[{"basename":"libzstd-win64.lib","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1},"to":{"change":3,"start":3509401,"end":3509429},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":3509429},"to":{"change":3,"start":2454491,"end":2454491},"introduced_by":3}],"inode":{"change":3,"pos":2454491}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":2454491},"to":{"change":3,"start":2454492,"end":3509400},"introduced_by":3}],"inode":{"change":3,"pos":2454491}},"content":[]}},{"FileDel":{"deleted_names":[{"basename":"libzstd-win32.lib","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1},"to":{"change":3,"start":4444225,"end":4444253},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":4444253},"to":{"change":3,"start":3509431,"end":3509431},"introduced_by":3}],"inode":{"change":3,"pos":3509431}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":3509431},"to":{"change":3,"start":3509432,"end":4444224},"introduced_by":3}],"inode":{"change":3,"pos":3509431}},"content":[]}},{"FileDel":{"deleted_names":[{"basename":"legacy","metadata":576}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":19},"to":{"change":3,"start":140939,"end":140956},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":140956},"to":{"change":3,"start":140938,"end":140938},"introduced_by":3}],"inode":{"change":3,"pos":140938}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"zstd_legacy.h","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":140938},"to":{"change":3,"start":1154873,"end":1154910},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1154910},"to":{"change":3,"start":1140962,"end":1140962},"introduced_by":3}],"inode":{"change":3,"pos":1140962}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1140962},"to":{"change":3,"start":1140963,"end":1140966},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":2,"pos":2295},"to":{"change":3,"start":1141022,"end":1154872},"introduced_by":2},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1141022},"to":{"change":3,"start":1141022,"end":1154872},"introduced_by":3},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1140966},"to":{"change":2,"start":2239,"end":2295},"introduced_by":2}],"inode":{"change":3,"pos":1140962}},"content":[{"Del":"/*\n"},{"Del":" * All rights reserved.\n *\n * This source code is licensed under both the BSD-style license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n */\n\n#ifndef ZSTD_LEGACY_H\n#define ZSTD_LEGACY_H\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/* *************************************\n* Includes\n***************************************/\n#include \"../common/mem.h\" /* MEM_STATIC */\n#include \"../common/error_private.h\" /* ERROR */\n#include \"../common/zstd_internal.h\" /* ZSTD_inBuffer, ZSTD_outBuffer, ZSTD_frameSizeInfo */\n\n#if !defined (ZSTD_LEGACY_SUPPORT) || (ZSTD_LEGACY_SUPPORT == 0)\n# undef ZSTD_LEGACY_SUPPORT\n# define ZSTD_LEGACY_SUPPORT 8\n#endif\n\n#if (ZSTD_LEGACY_SUPPORT <= 1)\n# include \"zstd_v01.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 2)\n# include \"zstd_v02.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 3)\n# include \"zstd_v03.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n# include \"zstd_v04.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n# include \"zstd_v05.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n# include \"zstd_v06.h\"\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n# include \"zstd_v07.h\"\n#endif\n\n/** ZSTD_isLegacy() :\n @return : > 0 if supported by legacy decoder. 0 otherwise.\n return value is the version.\n*/\nMEM_STATIC unsigned ZSTD_isLegacy(const void* src, size_t srcSize)\n{\n U32 magicNumberLE;\n if (srcSize<4) return 0;\n magicNumberLE = MEM_readLE32(src);\n switch(magicNumberLE)\n {\n#if (ZSTD_LEGACY_SUPPORT <= 1)\n case ZSTDv01_magicNumberLE:return 1;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 2)\n case ZSTDv02_magicNumber : return 2;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 3)\n case ZSTDv03_magicNumber : return 3;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case ZSTDv04_magicNumber : return 4;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case ZSTDv05_MAGICNUMBER : return 5;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case ZSTDv06_MAGICNUMBER : return 6;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case ZSTDv07_MAGICNUMBER : return 7;\n#endif\n default : return 0;\n }\n}\n\n\nMEM_STATIC unsigned long long ZSTD_getDecompressedSize_legacy(const void* src, size_t srcSize)\n{\n U32 const version = ZSTD_isLegacy(src, srcSize);\n if (version < 5) return 0; /* no decompressed size in frame header, or not a legacy format */\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n if (version==5) {\n ZSTDv05_parameters fParams;\n size_t const frResult = ZSTDv05_getFrameParams(&fParams, src, srcSize);\n if (frResult != 0) return 0;\n return fParams.srcSize;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n if (version==6) {\n ZSTDv06_frameParams fParams;\n size_t const frResult = ZSTDv06_getFrameParams(&fParams, src, srcSize);\n if (frResult != 0) return 0;\n return fParams.frameContentSize;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n if (version==7) {\n ZSTDv07_frameParams fParams;\n size_t const frResult = ZSTDv07_getFrameParams(&fParams, src, srcSize);\n if (frResult != 0) return 0;\n return fParams.frameContentSize;\n }\n#endif\n return 0; /* should not be possible */\n}\n\n\nMEM_STATIC size_t ZSTD_decompressLegacy(\n void* dst, size_t dstCapacity,\n const void* src, size_t compressedSize,\n const void* dict,size_t dictSize)\n{\n U32 const version = ZSTD_isLegacy(src, compressedSize);\n (void)dst; (void)dstCapacity; (void)dict; (void)dictSize; /* unused when ZSTD_LEGACY_SUPPORT >= 8 */\n switch(version)\n {\n#if (ZSTD_LEGACY_SUPPORT <= 1)\n case 1 :\n return ZSTDv01_decompress(dst, dstCapacity, src, compressedSize);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 2)\n case 2 :\n return ZSTDv02_decompress(dst, dstCapacity, src, compressedSize);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 3)\n case 3 :\n return ZSTDv03_decompress(dst, dstCapacity, src, compressedSize);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case 4 :\n return ZSTDv04_decompress(dst, dstCapacity, src, compressedSize);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case 5 :\n { size_t result;\n ZSTDv05_DCtx* const zd = ZSTDv05_createDCtx();\n if (zd==NULL) return ERROR(memory_allocation);\n result = ZSTDv05_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);\n ZSTDv05_freeDCtx(zd);\n return result;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case 6 :\n { size_t result;\n ZSTDv06_DCtx* const zd = ZSTDv06_createDCtx();\n if (zd==NULL) return ERROR(memory_allocation);\n result = ZSTDv06_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);\n ZSTDv06_freeDCtx(zd);\n return result;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case 7 :\n { size_t result;\n ZSTDv07_DCtx* const zd = ZSTDv07_createDCtx();\n if (zd==NULL) return ERROR(memory_allocation);\n result = ZSTDv07_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);\n ZSTDv07_freeDCtx(zd);\n return result;\n }\n#endif\n default :\n return ERROR(prefix_unknown);\n }\n}\n\nMEM_STATIC ZSTD_frameSizeInfo ZSTD_findFrameSizeInfoLegacy(const void *src, size_t srcSize)\n{\n ZSTD_frameSizeInfo frameSizeInfo;\n U32 const version = ZSTD_isLegacy(src, srcSize);\n switch(version)\n {\n#if (ZSTD_LEGACY_SUPPORT <= 1)\n case 1 :\n ZSTDv01_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 2)\n case 2 :\n ZSTDv02_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 3)\n case 3 :\n ZSTDv03_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case 4 :\n ZSTDv04_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case 5 :\n ZSTDv05_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case 6 :\n ZSTDv06_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case 7 :\n ZSTDv07_findFrameSizeInfoLegacy(src, srcSize,\n &frameSizeInfo.compressedSize,\n &frameSizeInfo.decompressedBound);\n break;\n#endif\n default :\n frameSizeInfo.compressedSize = ERROR(prefix_unknown);\n frameSizeInfo.decompressedBound = ZSTD_CONTENTSIZE_ERROR;\n break;\n }\n if (!ZSTD_isError(frameSizeInfo.compressedSize) && frameSizeInfo.compressedSize > srcSize) {\n frameSizeInfo.compressedSize = ERROR(srcSize_wrong);\n frameSizeInfo.decompressedBound = ZSTD_CONTENTSIZE_ERROR;\n }\n return frameSizeInfo;\n}\n\nMEM_STATIC size_t ZSTD_findFrameCompressedSizeLegacy(const void *src, size_t srcSize)\n{\n ZSTD_frameSizeInfo frameSizeInfo = ZSTD_findFrameSizeInfoLegacy(src, srcSize);\n return frameSizeInfo.compressedSize;\n}\n\nMEM_STATIC size_t ZSTD_freeLegacyStreamContext(void* legacyContext, U32 version)\n{\n switch(version)\n {\n default :\n case 1 :\n case 2 :\n case 3 :\n (void)legacyContext;\n return ERROR(version_unsupported);\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case 4 : return ZBUFFv04_freeDCtx((ZBUFFv04_DCtx*)legacyContext);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case 5 : return ZBUFFv05_freeDCtx((ZBUFFv05_DCtx*)legacyContext);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case 6 : return ZBUFFv06_freeDCtx((ZBUFFv06_DCtx*)legacyContext);\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case 7 : return ZBUFFv07_freeDCtx((ZBUFFv07_DCtx*)legacyContext);\n#endif\n }\n}\n\n\nMEM_STATIC size_t ZSTD_initLegacyStream(void** legacyContext, U32 prevVersion, U32 newVersion,\n const void* dict, size_t dictSize)\n{\n DEBUGLOG(5, \"ZSTD_initLegacyStream for v0.%u\", newVersion);\n if (prevVersion != newVersion) ZSTD_freeLegacyStreamContext(*legacyContext, prevVersion);\n switch(newVersion)\n {\n default :\n case 1 :\n case 2 :\n case 3 :\n (void)dict; (void)dictSize;\n return 0;\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case 4 :\n {\n ZBUFFv04_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv04_createDCtx() : (ZBUFFv04_DCtx*)*legacyContext;\n if (dctx==NULL) return ERROR(memory_allocation);\n ZBUFFv04_decompressInit(dctx);\n ZBUFFv04_decompressWithDictionary(dctx, dict, dictSize);\n *legacyContext = dctx;\n return 0;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case 5 :\n {\n ZBUFFv05_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv05_createDCtx() : (ZBUFFv05_DCtx*)*legacyContext;\n if (dctx==NULL) return ERROR(memory_allocation);\n ZBUFFv05_decompressInitDictionary(dctx, dict, dictSize);\n *legacyContext = dctx;\n return 0;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case 6 :\n {\n ZBUFFv06_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv06_createDCtx() : (ZBUFFv06_DCtx*)*legacyContext;\n if (dctx==NULL) return ERROR(memory_allocation);\n ZBUFFv06_decompressInitDictionary(dctx, dict, dictSize);\n *legacyContext = dctx;\n return 0;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case 7 :\n {\n ZBUFFv07_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv07_createDCtx() : (ZBUFFv07_DCtx*)*legacyContext;\n if (dctx==NULL) return ERROR(memory_allocation);\n ZBUFFv07_decompressInitDictionary(dctx, dict, dictSize);\n *legacyContext = dctx;\n return 0;\n }\n#endif\n }\n}\n\n\n\nMEM_STATIC size_t ZSTD_decompressLegacyStream(void* legacyContext, U32 version,\n ZSTD_outBuffer* output, ZSTD_inBuffer* input)\n{\n DEBUGLOG(5, \"ZSTD_decompressLegacyStream for v0.%u\", version);\n switch(version)\n {\n default :\n case 1 :\n case 2 :\n case 3 :\n (void)legacyContext; (void)output; (void)input;\n return ERROR(version_unsupported);\n#if (ZSTD_LEGACY_SUPPORT <= 4)\n case 4 :\n {\n ZBUFFv04_DCtx* dctx = (ZBUFFv04_DCtx*) legacyContext;\n const void* src = (const char*)input->src + input->pos;\n size_t readSize = input->size - input->pos;\n void* dst = (char*)output->dst + output->pos;\n size_t decodedSize = output->size - output->pos;\n size_t const hintSize = ZBUFFv04_decompressContinue(dctx, dst, &decodedSize, src, &readSize);\n output->pos += decodedSize;\n input->pos += readSize;\n return hintSize;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 5)\n case 5 :\n {\n ZBUFFv05_DCtx* dctx = (ZBUFFv05_DCtx*) legacyContext;\n const void* src = (const char*)input->src + input->pos;\n size_t readSize = input->size - input->pos;\n void* dst = (char*)output->dst + output->pos;\n size_t decodedSize = output->size - output->pos;\n size_t const hintSize = ZBUFFv05_decompressContinue(dctx, dst, &decodedSize, src, &readSize);\n output->pos += decodedSize;\n input->pos += readSize;\n return hintSize;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 6)\n case 6 :\n {\n ZBUFFv06_DCtx* dctx = (ZBUFFv06_DCtx*) legacyContext;\n const void* src = (const char*)input->src + input->pos;\n size_t readSize = input->size - input->pos;\n void* dst = (char*)output->dst + output->pos;\n size_t decodedSize = output->size - output->pos;\n size_t const hintSize = ZBUFFv06_decompressContinue(dctx, dst, &decodedSize, src, &readSize);\n output->pos += decodedSize;\n input->pos += readSize;\n return hintSize;\n }\n#endif\n#if (ZSTD_LEGACY_SUPPORT <= 7)\n case 7 :\n {\n ZBUFFv07_DCtx* dctx = (ZBUFFv07_DCtx*) legacyContext;\n const void* src = (const char*)input->src + input->pos;\n size_t readSize = input->size - input->pos;\n void* dst = (char*)output->dst + output->pos;\n size_t decodedSize = output->size - output->pos;\n size_t const hintSize = ZBUFFv07_decompressContinue(dctx, dst, &decodedSize, src, &readSize);\n output->pos += decodedSize;\n input->pos += readSize;\n return hintSize;\n }\n#endif\n }\n}\n\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* ZSTD_LEGACY_H */\n"},{"Del":" * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstd_v01.c","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":140938},"to":{"change":3,"start":1140926,"end":1140960},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1140960},"to":{"change":3,"start":1069405,"end":1069405},"introduced_by":3}],"inode":{"change":3,"pos":1069405}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1069405},"to":{"change":3,"start":1069406,"end":1069409},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":2,"pos":2237},"to":{"change":3,"start":1069465,"end":1140925},"introduced_by":2},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1069465},"to":{"change":3,"start":1069465,"end":1140925},"introduced_by":3},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1069409},"to":{"change":2,"start":2181,"end":2237},"introduced_by":2}],"inode":{"change":3,"pos":1069405}},"content":[{"Del":"/*\n"},{"Del":" * All rights reserved.\n *\n * This source code is licensed under both the BSD-style license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n */\n\n\n/******************************************\n* Includes\n******************************************/\n#include /* size_t, ptrdiff_t */\n#include \"zstd_v01.h\"\n#include \"../common/error_private.h\"\n\n\n/******************************************\n* Static allocation\n******************************************/\n/* You can statically allocate FSE CTable/DTable as a table of unsigned using below macro */\n#define FSE_DTABLE_SIZE_U32(maxTableLog) (1 + (1<2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)\n* Increasing memory usage improves compression ratio\n* Reduced memory usage can improve speed, due to cache effect\n* Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */\n#define FSE_MAX_MEMORY_USAGE 14\n#define FSE_DEFAULT_MEMORY_USAGE 13\n\n/* FSE_MAX_SYMBOL_VALUE :\n* Maximum symbol value authorized.\n* Required for proper stack allocation */\n#define FSE_MAX_SYMBOL_VALUE 255\n\n\n/****************************************************************\n* template functions type & suffix\n****************************************************************/\n#define FSE_FUNCTION_TYPE BYTE\n#define FSE_FUNCTION_EXTENSION\n\n\n/****************************************************************\n* Byte symbol type\n****************************************************************/\ntypedef struct\n{\n unsigned short newState;\n unsigned char symbol;\n unsigned char nbBits;\n} FSE_decode_t; /* size == U32 */\n\n\n\n/****************************************************************\n* Compiler specifics\n****************************************************************/\n#ifdef _MSC_VER /* Visual Studio */\n# define FORCE_INLINE static __forceinline\n# include /* For Visual 2005 */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n# pragma warning(disable : 4214) /* disable: C4214: non-int bitfields */\n#else\n# define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)\n# if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */\n# ifdef __GNUC__\n# define FORCE_INLINE static inline __attribute__((always_inline))\n# else\n# define FORCE_INLINE static inline\n# endif\n# else\n# define FORCE_INLINE static\n# endif /* __STDC_VERSION__ */\n#endif\n\n\n/****************************************************************\n* Includes\n****************************************************************/\n#include /* malloc, free, qsort */\n#include /* memcpy, memset */\n#include /* printf (debug) */\n\n\n#ifndef MEM_ACCESS_MODULE\n#define MEM_ACCESS_MODULE\n/****************************************************************\n* Basic Types\n*****************************************************************/\n#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */\n# include \ntypedef uint8_t BYTE;\ntypedef uint16_t U16;\ntypedef int16_t S16;\ntypedef uint32_t U32;\ntypedef int32_t S32;\ntypedef uint64_t U64;\ntypedef int64_t S64;\n#else\ntypedef unsigned char BYTE;\ntypedef unsigned short U16;\ntypedef signed short S16;\ntypedef unsigned int U32;\ntypedef signed int S32;\ntypedef unsigned long long U64;\ntypedef signed long long S64;\n#endif\n\n#endif /* MEM_ACCESS_MODULE */\n\n/****************************************************************\n* Memory I/O\n*****************************************************************/\n/* FSE_FORCE_MEMORY_ACCESS\n * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.\n * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.\n * The below switch allow to select different access method for improved performance.\n * Method 0 (default) : use `memcpy()`. Safe and portable.\n * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).\n * This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.\n * Method 2 : direct access. This method is portable but violate C standard.\n * It can generate buggy code on targets generating assembly depending on alignment.\n * But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)\n * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.\n * Prefer these methods in priority order (0 > 1 > 2)\n */\n#ifndef FSE_FORCE_MEMORY_ACCESS /* can be defined externally, on command line for example */\n# 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__) )\n# define FSE_FORCE_MEMORY_ACCESS 2\n# elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \\\n (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))\n# define FSE_FORCE_MEMORY_ACCESS 1\n# endif\n#endif\n\n\nstatic unsigned FSE_32bits(void)\n{\n return sizeof(void*)==4;\n}\n\nstatic unsigned FSE_isLittleEndian(void)\n{\n const union { U32 i; BYTE c[4]; } one = { 1 }; /* don't use static : performance detrimental */\n return one.c[0];\n}\n\n#if defined(FSE_FORCE_MEMORY_ACCESS) && (FSE_FORCE_MEMORY_ACCESS==2)\n\nstatic U16 FSE_read16(const void* memPtr) { return *(const U16*) memPtr; }\nstatic U32 FSE_read32(const void* memPtr) { return *(const U32*) memPtr; }\nstatic U64 FSE_read64(const void* memPtr) { return *(const U64*) memPtr; }\n\n#elif defined(FSE_FORCE_MEMORY_ACCESS) && (FSE_FORCE_MEMORY_ACCESS==1)\n\n/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */\n/* currently only defined for gcc and icc */\ntypedef union { U16 u16; U32 u32; U64 u64; } __attribute__((packed)) unalign;\n\nstatic U16 FSE_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }\nstatic U32 FSE_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }\nstatic U64 FSE_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }\n\n#else\n\nstatic U16 FSE_read16(const void* memPtr)\n{\n U16 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\nstatic U32 FSE_read32(const void* memPtr)\n{\n U32 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\nstatic U64 FSE_read64(const void* memPtr)\n{\n U64 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\n#endif /* FSE_FORCE_MEMORY_ACCESS */\n\nstatic U16 FSE_readLE16(const void* memPtr)\n{\n if (FSE_isLittleEndian())\n return FSE_read16(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U16)(p[0] + (p[1]<<8));\n }\n}\n\nstatic U32 FSE_readLE32(const void* memPtr)\n{\n if (FSE_isLittleEndian())\n return FSE_read32(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U32)((U32)p[0] + ((U32)p[1]<<8) + ((U32)p[2]<<16) + ((U32)p[3]<<24));\n }\n}\n\n\nstatic U64 FSE_readLE64(const void* memPtr)\n{\n if (FSE_isLittleEndian())\n return FSE_read64(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U64)((U64)p[0] + ((U64)p[1]<<8) + ((U64)p[2]<<16) + ((U64)p[3]<<24)\n + ((U64)p[4]<<32) + ((U64)p[5]<<40) + ((U64)p[6]<<48) + ((U64)p[7]<<56));\n }\n}\n\nstatic size_t FSE_readLEST(const void* memPtr)\n{\n if (FSE_32bits())\n return (size_t)FSE_readLE32(memPtr);\n else\n return (size_t)FSE_readLE64(memPtr);\n}\n\n\n\n/****************************************************************\n* Constants\n*****************************************************************/\n#define FSE_MAX_TABLELOG (FSE_MAX_MEMORY_USAGE-2)\n#define FSE_MAX_TABLESIZE (1U< FSE_TABLELOG_ABSOLUTE_MAX\n#error \"FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported\"\n#endif\n\n\n/****************************************************************\n* Error Management\n****************************************************************/\n#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; } /* use only *after* variable declarations */\n\n\n/****************************************************************\n* Complex types\n****************************************************************/\ntypedef struct\n{\n int deltaFindState;\n U32 deltaNbBits;\n} FSE_symbolCompressionTransform; /* total 8 bytes */\n\ntypedef U32 DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];\n\n/****************************************************************\n* Internal functions\n****************************************************************/\nFORCE_INLINE unsigned FSE_highbit32 (U32 val)\n{\n# if defined(_MSC_VER) /* Visual */\n unsigned long r;\n _BitScanReverse ( &r, val );\n return (unsigned) r;\n# elif defined(__GNUC__) && (GCC_VERSION >= 304) /* GCC Intrinsic */\n return __builtin_clz (val) ^ 31;\n# else /* Software version */\n static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };\n U32 v = val;\n unsigned r;\n v |= v >> 1;\n v |= v >> 2;\n v |= v >> 4;\n v |= v >> 8;\n v |= v >> 16;\n r = DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];\n return r;\n# endif\n}\n\n\n/****************************************************************\n* Templates\n****************************************************************/\n/*\n designed to be included\n for type-specific functions (template emulation in C)\n Objective is to write these functions only once, for improved maintenance\n*/\n\n/* safety checks */\n#ifndef FSE_FUNCTION_EXTENSION\n# error \"FSE_FUNCTION_EXTENSION must be defined\"\n#endif\n#ifndef FSE_FUNCTION_TYPE\n# error \"FSE_FUNCTION_TYPE must be defined\"\n#endif\n\n/* Function names */\n#define FSE_CAT(X,Y) X##Y\n#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)\n#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)\n\n\n\nstatic U32 FSE_tableStep(U32 tableSize) { return (tableSize>>1) + (tableSize>>3) + 3; }\n\n#define FSE_DECODE_TYPE FSE_decode_t\n\n\ntypedef struct {\n U16 tableLog;\n U16 fastMode;\n} FSE_DTableHeader; /* sizeof U32 */\n\nstatic size_t FSE_buildDTable\n(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)\n{\n void* ptr = dt;\n FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;\n FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*)(ptr) + 1; /* because dt is unsigned, 32-bits aligned on 32-bits */\n const U32 tableSize = 1 << tableLog;\n const U32 tableMask = tableSize-1;\n const U32 step = FSE_tableStep(tableSize);\n U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];\n U32 position = 0;\n U32 highThreshold = tableSize-1;\n const S16 largeLimit= (S16)(1 << (tableLog-1));\n U32 noLarge = 1;\n U32 s;\n\n /* Sanity Checks */\n if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return (size_t)-FSE_ERROR_maxSymbolValue_tooLarge;\n if (tableLog > FSE_MAX_TABLELOG) return (size_t)-FSE_ERROR_tableLog_tooLarge;\n\n /* Init, lay down lowprob symbols */\n DTableH[0].tableLog = (U16)tableLog;\n for (s=0; s<=maxSymbolValue; s++)\n {\n if (normalizedCounter[s]==-1)\n {\n tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;\n symbolNext[s] = 1;\n }\n else\n {\n if (normalizedCounter[s] >= largeLimit) noLarge=0;\n symbolNext[s] = normalizedCounter[s];\n }\n }\n\n /* Spread symbols */\n for (s=0; s<=maxSymbolValue; s++)\n {\n int i;\n for (i=0; i highThreshold) position = (position + step) & tableMask; /* lowprob area */\n }\n }\n\n if (position!=0) return (size_t)-FSE_ERROR_GENERIC; /* position must reach all cells once, otherwise normalizedCounter is incorrect */\n\n /* Build Decoding table */\n {\n U32 i;\n for (i=0; ifastMode = (U16)noLarge;\n return 0;\n}\n\n\n/******************************************\n* FSE byte symbol\n******************************************/\n#ifndef FSE_COMMONDEFS_ONLY\n\nstatic unsigned FSE_isError(size_t code) { return (code > (size_t)(-FSE_ERROR_maxCode)); }\n\nstatic short FSE_abs(short a)\n{\n return a<0? -a : a;\n}\n\n\n/****************************************************************\n* Header bitstream management\n****************************************************************/\nstatic size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,\n const void* headerBuffer, size_t hbSize)\n{\n const BYTE* const istart = (const BYTE*) headerBuffer;\n const BYTE* const iend = istart + hbSize;\n const BYTE* ip = istart;\n int nbBits;\n int remaining;\n int threshold;\n U32 bitStream;\n int bitCount;\n unsigned charnum = 0;\n int previous0 = 0;\n\n if (hbSize < 4) return (size_t)-FSE_ERROR_srcSize_wrong;\n bitStream = FSE_readLE32(ip);\n nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG; /* extract tableLog */\n if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return (size_t)-FSE_ERROR_tableLog_tooLarge;\n bitStream >>= 4;\n bitCount = 4;\n *tableLogPtr = nbBits;\n remaining = (1<1) && (charnum<=*maxSVPtr))\n {\n if (previous0)\n {\n unsigned n0 = charnum;\n while ((bitStream & 0xFFFF) == 0xFFFF)\n {\n n0+=24;\n if (ip < iend-5)\n {\n ip+=2;\n bitStream = FSE_readLE32(ip) >> bitCount;\n }\n else\n {\n bitStream >>= 16;\n bitCount+=16;\n }\n }\n while ((bitStream & 3) == 3)\n {\n n0+=3;\n bitStream>>=2;\n bitCount+=2;\n }\n n0 += bitStream & 3;\n bitCount += 2;\n if (n0 > *maxSVPtr) return (size_t)-FSE_ERROR_maxSymbolValue_tooSmall;\n while (charnum < n0) normalizedCounter[charnum++] = 0;\n if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))\n {\n ip += bitCount>>3;\n bitCount &= 7;\n bitStream = FSE_readLE32(ip) >> bitCount;\n }\n else\n bitStream >>= 2;\n }\n {\n const short max = (short)((2*threshold-1)-remaining);\n short count;\n\n if ((bitStream & (threshold-1)) < (U32)max)\n {\n count = (short)(bitStream & (threshold-1));\n bitCount += nbBits-1;\n }\n else\n {\n count = (short)(bitStream & (2*threshold-1));\n if (count >= threshold) count -= max;\n bitCount += nbBits;\n }\n\n count--; /* extra accuracy */\n remaining -= FSE_abs(count);\n normalizedCounter[charnum++] = count;\n previous0 = !count;\n while (remaining < threshold)\n {\n nbBits--;\n threshold >>= 1;\n }\n\n {\n if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))\n {\n ip += bitCount>>3;\n bitCount &= 7;\n }\n else\n {\n bitCount -= (int)(8 * (iend - 4 - ip));\n ip = iend - 4;\n }\n bitStream = FSE_readLE32(ip) >> (bitCount & 31);\n }\n }\n }\n if (remaining != 1) return (size_t)-FSE_ERROR_GENERIC;\n *maxSVPtr = charnum-1;\n\n ip += (bitCount+7)>>3;\n if ((size_t)(ip-istart) > hbSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n return ip-istart;\n}\n\n\n/*********************************************************\n* Decompression (Byte symbols)\n*********************************************************/\nstatic size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)\n{\n void* ptr = dt;\n FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;\n FSE_decode_t* const cell = (FSE_decode_t*)(ptr) + 1; /* because dt is unsigned */\n\n DTableH->tableLog = 0;\n DTableH->fastMode = 0;\n\n cell->newState = 0;\n cell->symbol = symbolValue;\n cell->nbBits = 0;\n\n return 0;\n}\n\n\nstatic size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)\n{\n void* ptr = dt;\n FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;\n FSE_decode_t* const dinfo = (FSE_decode_t*)(ptr) + 1; /* because dt is unsigned */\n const unsigned tableSize = 1 << nbBits;\n const unsigned tableMask = tableSize - 1;\n const unsigned maxSymbolValue = tableMask;\n unsigned s;\n\n /* Sanity checks */\n if (nbBits < 1) return (size_t)-FSE_ERROR_GENERIC; /* min size */\n\n /* Build Decoding Table */\n DTableH->tableLog = (U16)nbBits;\n DTableH->fastMode = 1;\n for (s=0; s<=maxSymbolValue; s++)\n {\n dinfo[s].newState = 0;\n dinfo[s].symbol = (BYTE)s;\n dinfo[s].nbBits = (BYTE)nbBits;\n }\n\n return 0;\n}\n\n\n/* FSE_initDStream\n * Initialize a FSE_DStream_t.\n * srcBuffer must point at the beginning of an FSE block.\n * The function result is the size of the FSE_block (== srcSize).\n * If srcSize is too small, the function will return an errorCode;\n */\nstatic size_t FSE_initDStream(FSE_DStream_t* bitD, const void* srcBuffer, size_t srcSize)\n{\n if (srcSize < 1) return (size_t)-FSE_ERROR_srcSize_wrong;\n\n if (srcSize >= sizeof(size_t))\n {\n U32 contain32;\n bitD->start = (const char*)srcBuffer;\n bitD->ptr = (const char*)srcBuffer + srcSize - sizeof(size_t);\n bitD->bitContainer = FSE_readLEST(bitD->ptr);\n contain32 = ((const BYTE*)srcBuffer)[srcSize-1];\n if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC; /* stop bit not present */\n bitD->bitsConsumed = 8 - FSE_highbit32(contain32);\n }\n else\n {\n U32 contain32;\n bitD->start = (const char*)srcBuffer;\n bitD->ptr = bitD->start;\n bitD->bitContainer = *(const BYTE*)(bitD->start);\n switch(srcSize)\n {\n case 7: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[6]) << (sizeof(size_t)*8 - 16);\n /* fallthrough */\n case 6: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[5]) << (sizeof(size_t)*8 - 24);\n /* fallthrough */\n case 5: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[4]) << (sizeof(size_t)*8 - 32);\n /* fallthrough */\n case 4: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[3]) << 24;\n /* fallthrough */\n case 3: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[2]) << 16;\n /* fallthrough */\n case 2: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[1]) << 8;\n /* fallthrough */\n default:;\n }\n contain32 = ((const BYTE*)srcBuffer)[srcSize-1];\n if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC; /* stop bit not present */\n bitD->bitsConsumed = 8 - FSE_highbit32(contain32);\n bitD->bitsConsumed += (U32)(sizeof(size_t) - srcSize)*8;\n }\n\n return srcSize;\n}\n\n\n/*!FSE_lookBits\n * Provides next n bits from the bitContainer.\n * bitContainer is not modified (bits are still present for next read/look)\n * On 32-bits, maxNbBits==25\n * On 64-bits, maxNbBits==57\n * return : value extracted.\n */\nstatic size_t FSE_lookBits(FSE_DStream_t* bitD, U32 nbBits)\n{\n const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;\n return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);\n}\n\nstatic size_t FSE_lookBitsFast(FSE_DStream_t* bitD, U32 nbBits) /* only if nbBits >= 1 !! */\n{\n const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;\n return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);\n}\n\nstatic void FSE_skipBits(FSE_DStream_t* bitD, U32 nbBits)\n{\n bitD->bitsConsumed += nbBits;\n}\n\n\n/*!FSE_readBits\n * Read next n bits from the bitContainer.\n * On 32-bits, don't read more than maxNbBits==25\n * On 64-bits, don't read more than maxNbBits==57\n * Use the fast variant *only* if n >= 1.\n * return : value extracted.\n */\nstatic size_t FSE_readBits(FSE_DStream_t* bitD, U32 nbBits)\n{\n size_t value = FSE_lookBits(bitD, nbBits);\n FSE_skipBits(bitD, nbBits);\n return value;\n}\n\nstatic size_t FSE_readBitsFast(FSE_DStream_t* bitD, U32 nbBits) /* only if nbBits >= 1 !! */\n{\n size_t value = FSE_lookBitsFast(bitD, nbBits);\n FSE_skipBits(bitD, nbBits);\n return value;\n}\n\nstatic unsigned FSE_reloadDStream(FSE_DStream_t* bitD)\n{\n if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8)) /* should never happen */\n return FSE_DStream_tooFar;\n\n if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))\n {\n bitD->ptr -= bitD->bitsConsumed >> 3;\n bitD->bitsConsumed &= 7;\n bitD->bitContainer = FSE_readLEST(bitD->ptr);\n return FSE_DStream_unfinished;\n }\n if (bitD->ptr == bitD->start)\n {\n if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return FSE_DStream_endOfBuffer;\n return FSE_DStream_completed;\n }\n {\n U32 nbBytes = bitD->bitsConsumed >> 3;\n U32 result = FSE_DStream_unfinished;\n if (bitD->ptr - nbBytes < bitD->start)\n {\n nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */\n result = FSE_DStream_endOfBuffer;\n }\n bitD->ptr -= nbBytes;\n bitD->bitsConsumed -= nbBytes*8;\n bitD->bitContainer = FSE_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD) */\n return result;\n }\n}\n\n\nstatic void FSE_initDState(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD, const FSE_DTable* dt)\n{\n const void* ptr = dt;\n const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;\n DStatePtr->state = FSE_readBits(bitD, DTableH->tableLog);\n FSE_reloadDStream(bitD);\n DStatePtr->table = dt + 1;\n}\n\nstatic BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)\n{\n const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];\n const U32 nbBits = DInfo.nbBits;\n BYTE symbol = DInfo.symbol;\n size_t lowBits = FSE_readBits(bitD, nbBits);\n\n DStatePtr->state = DInfo.newState + lowBits;\n return symbol;\n}\n\nstatic BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)\n{\n const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];\n const U32 nbBits = DInfo.nbBits;\n BYTE symbol = DInfo.symbol;\n size_t lowBits = FSE_readBitsFast(bitD, nbBits);\n\n DStatePtr->state = DInfo.newState + lowBits;\n return symbol;\n}\n\n/* FSE_endOfDStream\n Tells if bitD has reached end of bitStream or not */\n\nstatic unsigned FSE_endOfDStream(const FSE_DStream_t* bitD)\n{\n return ((bitD->ptr == bitD->start) && (bitD->bitsConsumed == sizeof(bitD->bitContainer)*8));\n}\n\nstatic unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)\n{\n return DStatePtr->state == 0;\n}\n\n\nFORCE_INLINE size_t FSE_decompress_usingDTable_generic(\n void* dst, size_t maxDstSize,\n const void* cSrc, size_t cSrcSize,\n const FSE_DTable* dt, const unsigned fast)\n{\n BYTE* const ostart = (BYTE*) dst;\n BYTE* op = ostart;\n BYTE* const omax = op + maxDstSize;\n BYTE* const olimit = omax-3;\n\n FSE_DStream_t bitD;\n FSE_DState_t state1;\n FSE_DState_t state2;\n size_t errorCode;\n\n /* Init */\n errorCode = FSE_initDStream(&bitD, cSrc, cSrcSize); /* replaced last arg by maxCompressed Size */\n if (FSE_isError(errorCode)) return errorCode;\n\n FSE_initDState(&state1, &bitD, dt);\n FSE_initDState(&state2, &bitD, dt);\n\n#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)\n\n /* 4 symbols per loop */\n for ( ; (FSE_reloadDStream(&bitD)==FSE_DStream_unfinished) && (op sizeof(bitD.bitContainer)*8) /* This test must be static */\n FSE_reloadDStream(&bitD);\n\n op[1] = FSE_GETSYMBOL(&state2);\n\n if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8) /* This test must be static */\n { if (FSE_reloadDStream(&bitD) > FSE_DStream_unfinished) { op+=2; break; } }\n\n op[2] = FSE_GETSYMBOL(&state1);\n\n if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8) /* This test must be static */\n FSE_reloadDStream(&bitD);\n\n op[3] = FSE_GETSYMBOL(&state2);\n }\n\n /* tail */\n /* note : FSE_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly FSE_DStream_completed */\n while (1)\n {\n if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state1))) )\n break;\n\n *op++ = FSE_GETSYMBOL(&state1);\n\n if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state2))) )\n break;\n\n *op++ = FSE_GETSYMBOL(&state2);\n }\n\n /* end ? */\n if (FSE_endOfDStream(&bitD) && FSE_endOfDState(&state1) && FSE_endOfDState(&state2))\n return op-ostart;\n\n if (op==omax) return (size_t)-FSE_ERROR_dstSize_tooSmall; /* dst buffer is full, but cSrc unfinished */\n\n return (size_t)-FSE_ERROR_corruptionDetected;\n}\n\n\nstatic size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,\n const void* cSrc, size_t cSrcSize,\n const FSE_DTable* dt)\n{\n FSE_DTableHeader DTableH;\n memcpy(&DTableH, dt, sizeof(DTableH)); /* memcpy() into local variable, to avoid strict aliasing warning */\n\n /* select fast mode (static) */\n if (DTableH.fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);\n return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);\n}\n\n\nstatic size_t FSE_decompress(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)\n{\n const BYTE* const istart = (const BYTE*)cSrc;\n const BYTE* ip = istart;\n short counting[FSE_MAX_SYMBOL_VALUE+1];\n DTable_max_t dt; /* Static analyzer seems unable to understand this table will be properly initialized later */\n unsigned tableLog;\n unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;\n size_t errorCode;\n\n if (cSrcSize<2) return (size_t)-FSE_ERROR_srcSize_wrong; /* too small input size */\n\n /* normal FSE decoding mode */\n errorCode = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);\n if (FSE_isError(errorCode)) return errorCode;\n if (errorCode >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong; /* too small input size */\n ip += errorCode;\n cSrcSize -= errorCode;\n\n errorCode = FSE_buildDTable (dt, counting, maxSymbolValue, tableLog);\n if (FSE_isError(errorCode)) return errorCode;\n\n /* always return, even if it is an error code */\n return FSE_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, dt);\n}\n\n\n\n/* *******************************************************\n* Huff0 : Huffman block compression\n*********************************************************/\n#define HUF_MAX_SYMBOL_VALUE 255\n#define HUF_DEFAULT_TABLELOG 12 /* used by default, when not specified */\n#define HUF_MAX_TABLELOG 12 /* max possible tableLog; for allocation purpose; can be modified */\n#define HUF_ABSOLUTEMAX_TABLELOG 16 /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */\n#if (HUF_MAX_TABLELOG > HUF_ABSOLUTEMAX_TABLELOG)\n# error \"HUF_MAX_TABLELOG is too large !\"\n#endif\n\ntypedef struct HUF_CElt_s {\n U16 val;\n BYTE nbBits;\n} HUF_CElt ;\n\ntypedef struct nodeElt_s {\n U32 count;\n U16 parent;\n BYTE byte;\n BYTE nbBits;\n} nodeElt;\n\n\n/* *******************************************************\n* Huff0 : Huffman block decompression\n*********************************************************/\ntypedef struct {\n BYTE byte;\n BYTE nbBits;\n} HUF_DElt;\n\nstatic size_t HUF_readDTable (U16* DTable, const void* src, size_t srcSize)\n{\n BYTE huffWeight[HUF_MAX_SYMBOL_VALUE + 1];\n U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1]; /* large enough for values from 0 to 16 */\n U32 weightTotal;\n U32 maxBits;\n const BYTE* ip = (const BYTE*) src;\n size_t iSize;\n size_t oSize;\n U32 n;\n U32 nextRankStart;\n void* ptr = DTable+1;\n HUF_DElt* const dt = (HUF_DElt*)ptr;\n\n if (!srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n iSize = ip[0];\n\n FSE_STATIC_ASSERT(sizeof(HUF_DElt) == sizeof(U16)); /* if compilation fails here, assertion is false */\n //memset(huffWeight, 0, sizeof(huffWeight)); /* should not be necessary, but some analyzer complain ... */\n if (iSize >= 128) /* special header */\n {\n if (iSize >= (242)) /* RLE */\n {\n static int l[14] = { 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128 };\n oSize = l[iSize-242];\n memset(huffWeight, 1, sizeof(huffWeight));\n iSize = 0;\n }\n else /* Incompressible */\n {\n oSize = iSize - 127;\n iSize = ((oSize+1)/2);\n if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n ip += 1;\n for (n=0; n> 4;\n huffWeight[n+1] = ip[n/2] & 15;\n }\n }\n }\n else /* header compressed with FSE (normal case) */\n {\n if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n oSize = FSE_decompress(huffWeight, HUF_MAX_SYMBOL_VALUE, ip+1, iSize); /* max 255 values decoded, last one is implied */\n if (FSE_isError(oSize)) return oSize;\n }\n\n /* collect weight stats */\n memset(rankVal, 0, sizeof(rankVal));\n weightTotal = 0;\n for (n=0; n= HUF_ABSOLUTEMAX_TABLELOG) return (size_t)-FSE_ERROR_corruptionDetected;\n rankVal[huffWeight[n]]++;\n weightTotal += (1 << huffWeight[n]) >> 1;\n }\n if (weightTotal == 0) return (size_t)-FSE_ERROR_corruptionDetected;\n\n /* get last non-null symbol weight (implied, total must be 2^n) */\n maxBits = FSE_highbit32(weightTotal) + 1;\n if (maxBits > DTable[0]) return (size_t)-FSE_ERROR_tableLog_tooLarge; /* DTable is too small */\n DTable[0] = (U16)maxBits;\n {\n U32 total = 1 << maxBits;\n U32 rest = total - weightTotal;\n U32 verif = 1 << FSE_highbit32(rest);\n U32 lastWeight = FSE_highbit32(rest) + 1;\n if (verif != rest) return (size_t)-FSE_ERROR_corruptionDetected; /* last value must be a clean power of 2 */\n huffWeight[oSize] = (BYTE)lastWeight;\n rankVal[lastWeight]++;\n }\n\n /* check tree construction validity */\n if ((rankVal[1] < 2) || (rankVal[1] & 1)) return (size_t)-FSE_ERROR_corruptionDetected; /* by construction : at least 2 elts of rank 1, must be even */\n\n /* Prepare ranks */\n nextRankStart = 0;\n for (n=1; n<=maxBits; n++)\n {\n U32 current = nextRankStart;\n nextRankStart += (rankVal[n] << (n-1));\n rankVal[n] = current;\n }\n\n /* fill DTable */\n for (n=0; n<=oSize; n++)\n {\n const U32 w = huffWeight[n];\n const U32 length = (1 << w) >> 1;\n U32 i;\n HUF_DElt D;\n D.byte = (BYTE)n; D.nbBits = (BYTE)(maxBits + 1 - w);\n for (i = rankVal[w]; i < rankVal[w] + length; i++)\n dt[i] = D;\n rankVal[w] += length;\n }\n\n return iSize+1;\n}\n\n\nstatic BYTE HUF_decodeSymbol(FSE_DStream_t* Dstream, const HUF_DElt* dt, const U32 dtLog)\n{\n const size_t val = FSE_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */\n const BYTE c = dt[val].byte;\n FSE_skipBits(Dstream, dt[val].nbBits);\n return c;\n}\n\nstatic size_t HUF_decompress_usingDTable( /* -3% slower when non static */\n void* dst, size_t maxDstSize,\n const void* cSrc, size_t cSrcSize,\n const U16* DTable)\n{\n if (cSrcSize < 6) return (size_t)-FSE_ERROR_srcSize_wrong;\n {\n BYTE* const ostart = (BYTE*) dst;\n BYTE* op = ostart;\n BYTE* const omax = op + maxDstSize;\n BYTE* const olimit = maxDstSize < 15 ? op : omax-15;\n\n const void* ptr = DTable;\n const HUF_DElt* const dt = (const HUF_DElt*)(ptr)+1;\n const U32 dtLog = DTable[0];\n size_t errorCode;\n U32 reloadStatus;\n\n /* Init */\n\n const U16* jumpTable = (const U16*)cSrc;\n const size_t length1 = FSE_readLE16(jumpTable);\n const size_t length2 = FSE_readLE16(jumpTable+1);\n const size_t length3 = FSE_readLE16(jumpTable+2);\n const size_t length4 = cSrcSize - 6 - length1 - length2 - length3; /* check coherency !! */\n const char* const start1 = (const char*)(cSrc) + 6;\n const char* const start2 = start1 + length1;\n const char* const start3 = start2 + length2;\n const char* const start4 = start3 + length3;\n FSE_DStream_t bitD1, bitD2, bitD3, bitD4;\n\n if (length1+length2+length3+6 >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n\n errorCode = FSE_initDStream(&bitD1, start1, length1);\n if (FSE_isError(errorCode)) return errorCode;\n errorCode = FSE_initDStream(&bitD2, start2, length2);\n if (FSE_isError(errorCode)) return errorCode;\n errorCode = FSE_initDStream(&bitD3, start3, length3);\n if (FSE_isError(errorCode)) return errorCode;\n errorCode = FSE_initDStream(&bitD4, start4, length4);\n if (FSE_isError(errorCode)) return errorCode;\n\n reloadStatus=FSE_reloadDStream(&bitD2);\n\n /* 16 symbols per loop */\n for ( ; (reloadStatus12)) FSE_reloadDStream(&Dstream)\n\n #define HUF_DECODE_SYMBOL_2(n, Dstream) \\\n op[n] = HUF_decodeSymbol(&Dstream, dt, dtLog); \\\n if (FSE_32bits()) FSE_reloadDStream(&Dstream)\n\n HUF_DECODE_SYMBOL_1( 0, bitD1);\n HUF_DECODE_SYMBOL_1( 1, bitD2);\n HUF_DECODE_SYMBOL_1( 2, bitD3);\n HUF_DECODE_SYMBOL_1( 3, bitD4);\n HUF_DECODE_SYMBOL_2( 4, bitD1);\n HUF_DECODE_SYMBOL_2( 5, bitD2);\n HUF_DECODE_SYMBOL_2( 6, bitD3);\n HUF_DECODE_SYMBOL_2( 7, bitD4);\n HUF_DECODE_SYMBOL_1( 8, bitD1);\n HUF_DECODE_SYMBOL_1( 9, bitD2);\n HUF_DECODE_SYMBOL_1(10, bitD3);\n HUF_DECODE_SYMBOL_1(11, bitD4);\n HUF_DECODE_SYMBOL_0(12, bitD1);\n HUF_DECODE_SYMBOL_0(13, bitD2);\n HUF_DECODE_SYMBOL_0(14, bitD3);\n HUF_DECODE_SYMBOL_0(15, bitD4);\n }\n\n if (reloadStatus!=FSE_DStream_completed) /* not complete : some bitStream might be FSE_DStream_unfinished */\n return (size_t)-FSE_ERROR_corruptionDetected;\n\n /* tail */\n {\n /* bitTail = bitD1; */ /* *much* slower : -20% !??! */\n FSE_DStream_t bitTail;\n bitTail.ptr = bitD1.ptr;\n bitTail.bitsConsumed = bitD1.bitsConsumed;\n bitTail.bitContainer = bitD1.bitContainer; /* required in case of FSE_DStream_endOfBuffer */\n bitTail.start = start1;\n for ( ; (FSE_reloadDStream(&bitTail) < FSE_DStream_completed) && (op= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;\n ip += errorCode;\n cSrcSize -= errorCode;\n\n return HUF_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, DTable);\n}\n\n\n#endif /* FSE_COMMONDEFS_ONLY */\n\n/*\n zstd - standard compression library\n Copyright (C) 2014-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - zstd source repository : https://github.com/Cyan4973/zstd\n - ztsd public forum : https://groups.google.com/forum/#!forum/lz4c\n*/\n\n/****************************************************************\n* Tuning parameters\n*****************************************************************/\n/* MEMORY_USAGE :\n* Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)\n* Increasing memory usage improves compression ratio\n* Reduced memory usage can improve speed, due to cache effect */\n#define ZSTD_MEMORY_USAGE 17\n\n\n/**************************************\n CPU Feature Detection\n**************************************/\n/*\n * Automated efficient unaligned memory access detection\n * Based on known hardware architectures\n * This list will be updated thanks to feedbacks\n */\n#if defined(CPU_HAS_EFFICIENT_UNALIGNED_MEMORY_ACCESS) \\\n || defined(__ARM_FEATURE_UNALIGNED) \\\n || defined(__i386__) || defined(__x86_64__) \\\n || defined(_M_IX86) || defined(_M_X64) \\\n || defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_8__) \\\n || (defined(_M_ARM) && (_M_ARM >= 7))\n# define ZSTD_UNALIGNED_ACCESS 1\n#else\n# define ZSTD_UNALIGNED_ACCESS 0\n#endif\n\n\n/********************************************************\n* Includes\n*********************************************************/\n#include /* calloc */\n#include /* memcpy, memmove */\n#include /* debug : printf */\n\n\n/********************************************************\n* Compiler specifics\n*********************************************************/\n#ifdef __AVX2__\n# include /* AVX2 intrinsics */\n#endif\n\n#ifdef _MSC_VER /* Visual Studio */\n# include /* For Visual 2005 */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n# pragma warning(disable : 4324) /* disable: C4324: padded structure */\n#endif\n\n\n#ifndef MEM_ACCESS_MODULE\n#define MEM_ACCESS_MODULE\n/********************************************************\n* Basic Types\n*********************************************************/\n#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */\n# if defined(_AIX)\n# include \n# else\n# include /* intptr_t */\n# endif\ntypedef uint8_t BYTE;\ntypedef uint16_t U16;\ntypedef int16_t S16;\ntypedef uint32_t U32;\ntypedef int32_t S32;\ntypedef uint64_t U64;\n#else\ntypedef unsigned char BYTE;\ntypedef unsigned short U16;\ntypedef signed short S16;\ntypedef unsigned int U32;\ntypedef signed int S32;\ntypedef unsigned long long U64;\n#endif\n\n#endif /* MEM_ACCESS_MODULE */\n\n\n/********************************************************\n* Constants\n*********************************************************/\nstatic const U32 ZSTD_magicNumber = 0xFD2FB51E; /* 3rd version : seqNb header */\n\n#define HASH_LOG (ZSTD_MEMORY_USAGE - 2)\n#define HASH_TABLESIZE (1 << HASH_LOG)\n#define HASH_MASK (HASH_TABLESIZE - 1)\n\n#define KNUTH 2654435761\n\n#define BIT7 128\n#define BIT6 64\n#define BIT5 32\n#define BIT4 16\n\n#define KB *(1 <<10)\n#define MB *(1 <<20)\n#define GB *(1U<<30)\n\n#define BLOCKSIZE (128 KB) /* define, for static allocation */\n\n#define WORKPLACESIZE (BLOCKSIZE*3)\n#define MINMATCH 4\n#define MLbits 7\n#define LLbits 6\n#define Offbits 5\n#define MaxML ((1<>3];\n#else\n U32 hashTable[HASH_TABLESIZE];\n#endif\n BYTE buffer[WORKPLACESIZE];\n} cctxi_t;\n\n\n\n\n/**************************************\n* Error Management\n**************************************/\n/* published entry point */\nunsigned ZSTDv01_isError(size_t code) { return ERR_isError(code); }\n\n\n/**************************************\n* Tool functions\n**************************************/\n#define ZSTD_VERSION_MAJOR 0 /* for breaking interface changes */\n#define ZSTD_VERSION_MINOR 1 /* for new (non-breaking) interface capabilities */\n#define ZSTD_VERSION_RELEASE 3 /* for tweaks, bug-fixes, or development */\n#define ZSTD_VERSION_NUMBER (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)\n\n/**************************************************************\n* Decompression code\n**************************************************************/\n\nstatic size_t ZSTDv01_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)\n{\n const BYTE* const in = (const BYTE* const)src;\n BYTE headerFlags;\n U32 cSize;\n\n if (srcSize < 3) return ERROR(srcSize_wrong);\n\n headerFlags = *in;\n cSize = in[2] + (in[1]<<8) + ((in[0] & 7)<<16);\n\n bpPtr->blockType = (blockType_t)(headerFlags >> 6);\n bpPtr->origSize = (bpPtr->blockType == bt_rle) ? cSize : 0;\n\n if (bpPtr->blockType == bt_end) return 0;\n if (bpPtr->blockType == bt_rle) return 1;\n return cSize;\n}\n\n\nstatic size_t ZSTD_copyUncompressedBlock(void* dst, size_t maxDstSize, const void* src, size_t srcSize)\n{\n if (srcSize > maxDstSize) return ERROR(dstSize_tooSmall);\n if (srcSize > 0) {\n memcpy(dst, src, srcSize);\n }\n return srcSize;\n}\n\n\nstatic size_t ZSTD_decompressLiterals(void* ctx,\n void* dst, size_t maxDstSize,\n const void* src, size_t srcSize)\n{\n BYTE* op = (BYTE*)dst;\n BYTE* const oend = op + maxDstSize;\n const BYTE* ip = (const BYTE*)src;\n size_t errorCode;\n size_t litSize;\n\n /* check : minimum 2, for litSize, +1, for content */\n if (srcSize <= 3) return ERROR(corruption_detected);\n\n litSize = ip[1] + (ip[0]<<8);\n litSize += ((ip[-3] >> 3) & 7) << 16; /* mmmmh.... */\n op = oend - litSize;\n\n (void)ctx;\n if (litSize > maxDstSize) return ERROR(dstSize_tooSmall);\n errorCode = HUF_decompress(op, litSize, ip+2, srcSize-2);\n if (FSE_isError(errorCode)) return ERROR(GENERIC);\n return litSize;\n}\n\n\nstatic size_t ZSTDv01_decodeLiteralsBlock(void* ctx,\n void* dst, size_t maxDstSize,\n const BYTE** litStart, size_t* litSize,\n const void* src, size_t srcSize)\n{\n const BYTE* const istart = (const BYTE* const)src;\n const BYTE* ip = istart;\n BYTE* const ostart = (BYTE* const)dst;\n BYTE* const oend = ostart + maxDstSize;\n blockProperties_t litbp;\n\n size_t litcSize = ZSTDv01_getcBlockSize(src, srcSize, &litbp);\n if (ZSTDv01_isError(litcSize)) return litcSize;\n if (litcSize > srcSize - ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);\n ip += ZSTD_blockHeaderSize;\n\n switch(litbp.blockType)\n {\n case bt_raw:\n *litStart = ip;\n ip += litcSize;\n *litSize = litcSize;\n break;\n case bt_rle:\n {\n size_t rleSize = litbp.origSize;\n if (rleSize>maxDstSize) return ERROR(dstSize_tooSmall);\n if (!srcSize) return ERROR(srcSize_wrong);\n if (rleSize > 0) {\n memset(oend - rleSize, *ip, rleSize);\n }\n *litStart = oend - rleSize;\n *litSize = rleSize;\n ip++;\n break;\n }\n case bt_compressed:\n {\n size_t decodedLitSize = ZSTD_decompressLiterals(ctx, dst, maxDstSize, ip, litcSize);\n if (ZSTDv01_isError(decodedLitSize)) return decodedLitSize;\n *litStart = oend - decodedLitSize;\n *litSize = decodedLitSize;\n ip += litcSize;\n break;\n }\n case bt_end:\n default:\n return ERROR(GENERIC);\n }\n\n return ip-istart;\n}\n\n\nstatic size_t ZSTDv01_decodeSeqHeaders(int* nbSeq, const BYTE** dumpsPtr, size_t* dumpsLengthPtr,\n FSE_DTable* DTableLL, FSE_DTable* DTableML, FSE_DTable* DTableOffb,\n const void* src, size_t srcSize)\n{\n const BYTE* const istart = (const BYTE* const)src;\n const BYTE* ip = istart;\n const BYTE* const iend = istart + srcSize;\n U32 LLtype, Offtype, MLtype;\n U32 LLlog, Offlog, MLlog;\n size_t dumpsLength;\n\n /* check */\n if (srcSize < 5) return ERROR(srcSize_wrong);\n\n /* SeqHead */\n *nbSeq = ZSTD_readLE16(ip); ip+=2;\n LLtype = *ip >> 6;\n Offtype = (*ip >> 4) & 3;\n MLtype = (*ip >> 2) & 3;\n if (*ip & 2)\n {\n dumpsLength = ip[2];\n dumpsLength += ip[1] << 8;\n ip += 3;\n }\n else\n {\n dumpsLength = ip[1];\n dumpsLength += (ip[0] & 1) << 8;\n ip += 2;\n }\n *dumpsPtr = ip;\n ip += dumpsLength;\n *dumpsLengthPtr = dumpsLength;\n\n /* check */\n if (ip > iend-3) return ERROR(srcSize_wrong); /* min : all 3 are \"raw\", hence no header, but at least xxLog bits per type */\n\n /* sequences */\n {\n S16 norm[MaxML+1]; /* assumption : MaxML >= MaxLL and MaxOff */\n size_t headerSize;\n\n /* Build DTables */\n switch(LLtype)\n {\n case bt_rle :\n LLlog = 0;\n FSE_buildDTable_rle(DTableLL, *ip++); break;\n case bt_raw :\n LLlog = LLbits;\n FSE_buildDTable_raw(DTableLL, LLbits); break;\n default :\n { U32 max = MaxLL;\n headerSize = FSE_readNCount(norm, &max, &LLlog, ip, iend-ip);\n if (FSE_isError(headerSize)) return ERROR(GENERIC);\n if (LLlog > LLFSELog) return ERROR(corruption_detected);\n ip += headerSize;\n FSE_buildDTable(DTableLL, norm, max, LLlog);\n } }\n\n switch(Offtype)\n {\n case bt_rle :\n Offlog = 0;\n if (ip > iend-2) return ERROR(srcSize_wrong); /* min : \"raw\", hence no header, but at least xxLog bits */\n FSE_buildDTable_rle(DTableOffb, *ip++); break;\n case bt_raw :\n Offlog = Offbits;\n FSE_buildDTable_raw(DTableOffb, Offbits); break;\n default :\n { U32 max = MaxOff;\n headerSize = FSE_readNCount(norm, &max, &Offlog, ip, iend-ip);\n if (FSE_isError(headerSize)) return ERROR(GENERIC);\n if (Offlog > OffFSELog) return ERROR(corruption_detected);\n ip += headerSize;\n FSE_buildDTable(DTableOffb, norm, max, Offlog);\n } }\n\n switch(MLtype)\n {\n case bt_rle :\n MLlog = 0;\n if (ip > iend-2) return ERROR(srcSize_wrong); /* min : \"raw\", hence no header, but at least xxLog bits */\n FSE_buildDTable_rle(DTableML, *ip++); break;\n case bt_raw :\n MLlog = MLbits;\n FSE_buildDTable_raw(DTableML, MLbits); break;\n default :\n { U32 max = MaxML;\n headerSize = FSE_readNCount(norm, &max, &MLlog, ip, iend-ip);\n if (FSE_isError(headerSize)) return ERROR(GENERIC);\n if (MLlog > MLFSELog) return ERROR(corruption_detected);\n ip += headerSize;\n FSE_buildDTable(DTableML, norm, max, MLlog);\n } } }\n\n return ip-istart;\n}\n\n\ntypedef struct {\n size_t litLength;\n size_t offset;\n size_t matchLength;\n} seq_t;\n\ntypedef struct {\n FSE_DStream_t DStream;\n FSE_DState_t stateLL;\n FSE_DState_t stateOffb;\n FSE_DState_t stateML;\n size_t prevOffset;\n const BYTE* dumps;\n const BYTE* dumpsEnd;\n} seqState_t;\n\n\nstatic void ZSTD_decodeSequence(seq_t* seq, seqState_t* seqState)\n{\n size_t litLength;\n size_t prevOffset;\n size_t offset;\n size_t matchLength;\n const BYTE* dumps = seqState->dumps;\n const BYTE* const de = seqState->dumpsEnd;\n\n /* Literal length */\n litLength = FSE_decodeSymbol(&(seqState->stateLL), &(seqState->DStream));\n prevOffset = litLength ? seq->offset : seqState->prevOffset;\n seqState->prevOffset = seq->offset;\n if (litLength == MaxLL)\n {\n const U32 add = dumpsstateOffb), &(seqState->DStream));\n if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));\n nbBits = offsetCode - 1;\n if (offsetCode==0) nbBits = 0; /* cmove */\n offset = ((size_t)1 << (nbBits & ((sizeof(offset)*8)-1))) + FSE_readBits(&(seqState->DStream), nbBits);\n if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));\n if (offsetCode==0) offset = prevOffset;\n }\n\n /* MatchLength */\n matchLength = FSE_decodeSymbol(&(seqState->stateML), &(seqState->DStream));\n if (matchLength == MaxML)\n {\n const U32 add = dumpslitLength = litLength;\n seq->offset = offset;\n seq->matchLength = matchLength;\n seqState->dumps = dumps;\n}\n\n\nstatic size_t ZSTD_execSequence(BYTE* op,\n seq_t sequence,\n const BYTE** litPtr, const BYTE* const litLimit,\n BYTE* const base, BYTE* const oend)\n{\n static const int dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4}; /* added */\n static const int dec64table[] = {8, 8, 8, 7, 8, 9,10,11}; /* subtracted */\n const BYTE* const ostart = op;\n const size_t litLength = sequence.litLength;\n BYTE* const endMatch = op + litLength + sequence.matchLength; /* risk : address space overflow (32-bits) */\n const BYTE* const litEnd = *litPtr + litLength;\n\n /* check */\n if (endMatch > oend) return ERROR(dstSize_tooSmall); /* overwrite beyond dst buffer */\n if (litEnd > litLimit) return ERROR(corruption_detected);\n if (sequence.matchLength > (size_t)(*litPtr-op)) return ERROR(dstSize_tooSmall); /* overwrite literal segment */\n\n /* copy Literals */\n if (((size_t)(*litPtr - op) < 8) || ((size_t)(oend-litEnd) < 8) || (op+litLength > oend-8))\n memmove(op, *litPtr, litLength); /* overwrite risk */\n else\n ZSTD_wildcopy(op, *litPtr, litLength);\n op += litLength;\n *litPtr = litEnd; /* update for next sequence */\n\n /* check : last match must be at a minimum distance of 8 from end of dest buffer */\n if (oend-op < 8) return ERROR(dstSize_tooSmall);\n\n /* copy Match */\n {\n const U32 overlapRisk = (((size_t)(litEnd - endMatch)) < 12);\n const BYTE* match = op - sequence.offset; /* possible underflow at op - offset ? */\n size_t qutt = 12;\n U64 saved[2];\n\n /* check */\n if (match < base) return ERROR(corruption_detected);\n if (sequence.offset > (size_t)base) return ERROR(corruption_detected);\n\n /* save beginning of literal sequence, in case of write overlap */\n if (overlapRisk)\n {\n if ((endMatch + qutt) > oend) qutt = oend-endMatch;\n memcpy(saved, endMatch, qutt);\n }\n\n if (sequence.offset < 8)\n {\n const int dec64 = dec64table[sequence.offset];\n op[0] = match[0];\n op[1] = match[1];\n op[2] = match[2];\n op[3] = match[3];\n match += dec32table[sequence.offset];\n ZSTD_copy4(op+4, match);\n match -= dec64;\n } else { ZSTD_copy8(op, match); }\n op += 8; match += 8;\n\n if (endMatch > oend-(16-MINMATCH))\n {\n if (op < oend-8)\n {\n ZSTD_wildcopy(op, match, (oend-8) - op);\n match += (oend-8) - op;\n op = oend-8;\n }\n while (opLLTable;\n U32* DTableML = dctx->MLTable;\n U32* DTableOffb = dctx->OffTable;\n BYTE* const base = (BYTE*) (dctx->base);\n\n /* Build Decoding Tables */\n errorCode = ZSTDv01_decodeSeqHeaders(&nbSeq, &dumps, &dumpsLength,\n DTableLL, DTableML, DTableOffb,\n ip, iend-ip);\n if (ZSTDv01_isError(errorCode)) return errorCode;\n ip += errorCode;\n\n /* Regen sequences */\n {\n seq_t sequence;\n seqState_t seqState;\n\n memset(&sequence, 0, sizeof(sequence));\n seqState.dumps = dumps;\n seqState.dumpsEnd = dumps + dumpsLength;\n seqState.prevOffset = 1;\n errorCode = FSE_initDStream(&(seqState.DStream), ip, iend-ip);\n if (FSE_isError(errorCode)) return ERROR(corruption_detected);\n FSE_initDState(&(seqState.stateLL), &(seqState.DStream), DTableLL);\n FSE_initDState(&(seqState.stateOffb), &(seqState.DStream), DTableOffb);\n FSE_initDState(&(seqState.stateML), &(seqState.DStream), DTableML);\n\n for ( ; (FSE_reloadDStream(&(seqState.DStream)) <= FSE_DStream_completed) && (nbSeq>0) ; )\n {\n size_t oneSeqSize;\n nbSeq--;\n ZSTD_decodeSequence(&sequence, &seqState);\n oneSeqSize = ZSTD_execSequence(op, sequence, &litPtr, litEnd, base, oend);\n if (ZSTDv01_isError(oneSeqSize)) return oneSeqSize;\n op += oneSeqSize;\n }\n\n /* check if reached exact end */\n if ( !FSE_endOfDStream(&(seqState.DStream)) ) return ERROR(corruption_detected); /* requested too much : data is corrupted */\n if (nbSeq<0) return ERROR(corruption_detected); /* requested too many sequences : data is corrupted */\n\n /* last literal segment */\n {\n size_t lastLLSize = litEnd - litPtr;\n if (op+lastLLSize > oend) return ERROR(dstSize_tooSmall);\n if (lastLLSize > 0) {\n if (op != litPtr) memmove(op, litPtr, lastLLSize);\n op += lastLLSize;\n }\n }\n }\n\n return op-ostart;\n}\n\n\nstatic size_t ZSTD_decompressBlock(\n void* ctx,\n void* dst, size_t maxDstSize,\n const void* src, size_t srcSize)\n{\n /* blockType == blockCompressed, srcSize is trusted */\n const BYTE* ip = (const BYTE*)src;\n const BYTE* litPtr = NULL;\n size_t litSize = 0;\n size_t errorCode;\n\n /* Decode literals sub-block */\n errorCode = ZSTDv01_decodeLiteralsBlock(ctx, dst, maxDstSize, &litPtr, &litSize, src, srcSize);\n if (ZSTDv01_isError(errorCode)) return errorCode;\n ip += errorCode;\n srcSize -= errorCode;\n\n return ZSTD_decompressSequences(ctx, dst, maxDstSize, ip, srcSize, litPtr, litSize);\n}\n\n\nsize_t ZSTDv01_decompressDCtx(void* ctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)\n{\n const BYTE* ip = (const BYTE*)src;\n const BYTE* iend = ip + srcSize;\n BYTE* const ostart = (BYTE* const)dst;\n BYTE* op = ostart;\n BYTE* const oend = ostart + maxDstSize;\n size_t remainingSize = srcSize;\n U32 magicNumber;\n size_t errorCode=0;\n blockProperties_t blockProperties;\n\n /* Frame Header */\n if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);\n magicNumber = ZSTD_readBE32(src);\n if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);\n ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;\n\n /* Loop on each block */\n while (1)\n {\n size_t blockSize = ZSTDv01_getcBlockSize(ip, iend-ip, &blockProperties);\n if (ZSTDv01_isError(blockSize)) return blockSize;\n\n ip += ZSTD_blockHeaderSize;\n remainingSize -= ZSTD_blockHeaderSize;\n if (blockSize > remainingSize) return ERROR(srcSize_wrong);\n\n switch(blockProperties.blockType)\n {\n case bt_compressed:\n errorCode = ZSTD_decompressBlock(ctx, op, oend-op, ip, blockSize);\n break;\n case bt_raw :\n errorCode = ZSTD_copyUncompressedBlock(op, oend-op, ip, blockSize);\n break;\n case bt_rle :\n return ERROR(GENERIC); /* not yet supported */\n break;\n case bt_end :\n /* end of frame */\n if (remainingSize) return ERROR(srcSize_wrong);\n break;\n default:\n return ERROR(GENERIC);\n }\n if (blockSize == 0) break; /* bt_end */\n\n if (ZSTDv01_isError(errorCode)) return errorCode;\n op += errorCode;\n ip += blockSize;\n remainingSize -= blockSize;\n }\n\n return op-ostart;\n}\n\nsize_t ZSTDv01_decompress(void* dst, size_t maxDstSize, const void* src, size_t srcSize)\n{\n dctx_t ctx;\n ctx.base = dst;\n return ZSTDv01_decompressDCtx(&ctx, dst, maxDstSize, src, srcSize);\n}\n\n/* ZSTD_errorFrameSizeInfoLegacy() :\n assumes `cSize` and `dBound` are _not_ NULL */\nstatic void ZSTD_errorFrameSizeInfoLegacy(size_t* cSize, unsigned long long* dBound, size_t ret)\n{\n *cSize = ret;\n *dBound = ZSTD_CONTENTSIZE_ERROR;\n}\n\nvoid ZSTDv01_findFrameSizeInfoLegacy(const void *src, size_t srcSize, size_t* cSize, unsigned long long* dBound)\n{\n const BYTE* ip = (const BYTE*)src;\n size_t remainingSize = srcSize;\n size_t nbBlocks = 0;\n U32 magicNumber;\n blockProperties_t blockProperties;\n\n /* Frame Header */\n if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) {\n ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(srcSize_wrong));\n return;\n }\n magicNumber = ZSTD_readBE32(src);\n if (magicNumber != ZSTD_magicNumber) {\n ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(prefix_unknown));\n return;\n }\n ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;\n\n /* Loop on each block */\n while (1)\n {\n size_t blockSize = ZSTDv01_getcBlockSize(ip, remainingSize, &blockProperties);\n if (ZSTDv01_isError(blockSize)) {\n ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, blockSize);\n return;\n }\n\n ip += ZSTD_blockHeaderSize;\n remainingSize -= ZSTD_blockHeaderSize;\n if (blockSize > remainingSize) {\n ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(srcSize_wrong));\n return;\n }\n\n if (blockSize == 0) break; /* bt_end */\n\n ip += blockSize;\n remainingSize -= blockSize;\n nbBlocks++;\n }\n\n *cSize = ip - (const BYTE*)src;\n *dBound = nbBlocks * BLOCKSIZE;\n}\n\n/*******************************\n* Streaming Decompression API\n*******************************/\n\nsize_t ZSTDv01_resetDCtx(ZSTDv01_Dctx* dctx)\n{\n dctx->expected = ZSTD_frameHeaderSize;\n dctx->phase = 0;\n dctx->previousDstEnd = NULL;\n dctx->base = NULL;\n return 0;\n}\n\nZSTDv01_Dctx* ZSTDv01_createDCtx(void)\n{\n ZSTDv01_Dctx* dctx = (ZSTDv01_Dctx*)malloc(sizeof(ZSTDv01_Dctx));\n if (dctx==NULL) return NULL;\n ZSTDv01_resetDCtx(dctx);\n return dctx;\n}\n\nsize_t ZSTDv01_freeDCtx(ZSTDv01_Dctx* dctx)\n{\n free(dctx);\n return 0;\n}\n\nsize_t ZSTDv01_nextSrcSizeToDecompress(ZSTDv01_Dctx* dctx)\n{\n return ((dctx_t*)dctx)->expected;\n}\n\nsize_t ZSTDv01_decompressContinue(ZSTDv01_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)\n{\n dctx_t* ctx = (dctx_t*)dctx;\n\n /* Sanity check */\n if (srcSize != ctx->expected) return ERROR(srcSize_wrong);\n if (dst != ctx->previousDstEnd) /* not contiguous */\n ctx->base = dst;\n\n /* Decompress : frame header */\n if (ctx->phase == 0)\n {\n /* Check frame magic header */\n U32 magicNumber = ZSTD_readBE32(src);\n if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);\n ctx->phase = 1;\n ctx->expected = ZSTD_blockHeaderSize;\n return 0;\n }\n\n /* Decompress : block header */\n if (ctx->phase == 1)\n {\n blockProperties_t bp;\n size_t blockSize = ZSTDv01_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);\n if (ZSTDv01_isError(blockSize)) return blockSize;\n if (bp.blockType == bt_end)\n {\n ctx->expected = 0;\n ctx->phase = 0;\n }\n else\n {\n ctx->expected = blockSize;\n ctx->bType = bp.blockType;\n ctx->phase = 2;\n }\n\n return 0;\n }\n\n /* Decompress : block content */\n {\n size_t rSize;\n switch(ctx->bType)\n {\n case bt_compressed:\n rSize = ZSTD_decompressBlock(ctx, dst, maxDstSize, src, srcSize);\n break;\n case bt_raw :\n rSize = ZSTD_copyUncompressedBlock(dst, maxDstSize, src, srcSize);\n break;\n case bt_rle :\n return ERROR(GENERIC); /* not yet handled */\n break;\n case bt_end : /* should never happen (filtered at phase 1) */\n rSize = 0;\n break;\n default:\n return ERROR(GENERIC);\n }\n ctx->phase = 1;\n ctx->expected = ZSTD_blockHeaderSize;\n ctx->previousDstEnd = (void*)( ((char*)dst) + rSize);\n return rSize;\n }\n\n}\n"},{"Del":" * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstd_v01.h","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":140938},"to":{"change":3,"start":1069369,"end":1069403},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1069403},"to":{"change":3,"start":1065563,"end":1065563},"introduced_by":3}],"inode":{"change":3,"pos":1065563}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1065563},"to":{"change":3,"start":1065564,"end":1065567},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":2,"pos":2179},"to":{"change":3,"start":1065623,"end":1069368},"introduced_by":2},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1065623},"to":{"change":3,"start":1065623,"end":1069368},"introduced_by":3},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1065567},"to":{"change":2,"start":2123,"end":2179},"introduced_by":2}],"inode":{"change":3,"pos":1065563}},"content":[{"Del":"/*\n"},{"Del":" * All rights reserved.\n *\n * This source code is licensed under both the BSD-style license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n */\n\n#ifndef ZSTD_V01_H_28739879432\n#define ZSTD_V01_H_28739879432\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/* *************************************\n* Includes\n***************************************/\n#include /* size_t */\n\n\n/* *************************************\n* Simple one-step function\n***************************************/\n/**\nZSTDv01_decompress() : decompress ZSTD frames compliant with v0.1.x format\n compressedSize : is the exact source size\n maxOriginalSize : is the size of the 'dst' buffer, which must be already allocated.\n It must be equal or larger than originalSize, otherwise decompression will fail.\n return : the number of bytes decompressed into destination buffer (originalSize)\n or an errorCode if it fails (which can be tested using ZSTDv01_isError())\n*/\nsize_t ZSTDv01_decompress( void* dst, size_t maxOriginalSize,\n const void* src, size_t compressedSize);\n\n /**\n ZSTDv01_findFrameSizeInfoLegacy() : get the source length and decompressed bound of a ZSTD frame compliant with v0.1.x format\n srcSize : The size of the 'src' buffer, at least as large as the frame pointed to by 'src'\n cSize (output parameter) : the number of bytes that would be read to decompress this frame\n or an error code if it fails (which can be tested using ZSTDv01_isError())\n dBound (output parameter) : an upper-bound for the decompressed size of the data in the frame\n or ZSTD_CONTENTSIZE_ERROR if an error occurs\n\n note : assumes `cSize` and `dBound` are _not_ NULL.\n */\nvoid ZSTDv01_findFrameSizeInfoLegacy(const void *src, size_t srcSize,\n size_t* cSize, unsigned long long* dBound);\n\n/**\nZSTDv01_isError() : tells if the result of ZSTDv01_decompress() is an error\n*/\nunsigned ZSTDv01_isError(size_t code);\n\n\n/* *************************************\n* Advanced functions\n***************************************/\ntypedef struct ZSTDv01_Dctx_s ZSTDv01_Dctx;\nZSTDv01_Dctx* ZSTDv01_createDCtx(void);\nsize_t ZSTDv01_freeDCtx(ZSTDv01_Dctx* dctx);\n\nsize_t ZSTDv01_decompressDCtx(void* ctx,\n void* dst, size_t maxOriginalSize,\n const void* src, size_t compressedSize);\n\n/* *************************************\n* Streaming functions\n***************************************/\nsize_t ZSTDv01_resetDCtx(ZSTDv01_Dctx* dctx);\n\nsize_t ZSTDv01_nextSrcSizeToDecompress(ZSTDv01_Dctx* dctx);\nsize_t ZSTDv01_decompressContinue(ZSTDv01_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize);\n/**\n Use above functions alternatively.\n ZSTD_nextSrcSizeToDecompress() tells how much bytes to provide as 'srcSize' to ZSTD_decompressContinue().\n ZSTD_decompressContinue() will use previous data blocks to improve compression if they are located prior to current block.\n Result is the number of bytes regenerated within 'dst'.\n It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some header.\n*/\n\n/* *************************************\n* Prefix - version detection\n***************************************/\n#define ZSTDv01_magicNumber 0xFD2FB51E /* Big Endian version */\n#define ZSTDv01_magicNumberLE 0x1EB52FFD /* Little Endian version */\n\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* ZSTD_V01_H_28739879432 */\n"},{"Del":" * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstd_v02.c","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":140938},"to":{"change":3,"start":1065527,"end":1065561},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1065561},"to":{"change":3,"start":937333,"end":937333},"introduced_by":3}],"inode":{"change":3,"pos":937333}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":937333},"to":{"change":3,"start":937334,"end":937337},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":2,"pos":2121},"to":{"change":3,"start":937393,"end":1065526},"introduced_by":2},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":937393},"to":{"change":3,"start":937393,"end":1065526},"introduced_by":3},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":937337},"to":{"change":2,"start":2065,"end":2121},"introduced_by":2}],"inode":{"change":3,"pos":937333}},"content":[{"Del":"/*\n"},{"Del":" * All rights reserved.\n *\n * This source code is licensed under both the BSD-style license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n */\n\n\n#include /* size_t, ptrdiff_t */\n#include \"zstd_v02.h\"\n#include \"../common/error_private.h\"\n\n\n/******************************************\n* Compiler-specific\n******************************************/\n#if defined(_MSC_VER) /* Visual Studio */\n# include /* _byteswap_ulong */\n# include /* _byteswap_* */\n#endif\n\n\n/* ******************************************************************\n mem.h\n low-level memory access routines\n Copyright (C) 2013-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n#ifndef MEM_H_MODULE\n#define MEM_H_MODULE\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/******************************************\n* Includes\n******************************************/\n#include /* size_t, ptrdiff_t */\n#include /* memcpy */\n\n\n/******************************************\n* Compiler-specific\n******************************************/\n#if defined(__GNUC__)\n# define MEM_STATIC static __attribute__((unused))\n#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n# define MEM_STATIC static inline\n#elif defined(_MSC_VER)\n# define MEM_STATIC static __inline\n#else\n# define MEM_STATIC static /* this version may generate warnings for unused static functions; disable the relevant warning */\n#endif\n\n\n/****************************************************************\n* Basic Types\n*****************************************************************/\n#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n# if defined(_AIX)\n# include \n# else\n# include /* intptr_t */\n# endif\n typedef uint8_t BYTE;\n typedef uint16_t U16;\n typedef int16_t S16;\n typedef uint32_t U32;\n typedef int32_t S32;\n typedef uint64_t U64;\n typedef int64_t S64;\n#else\n typedef unsigned char BYTE;\n typedef unsigned short U16;\n typedef signed short S16;\n typedef unsigned int U32;\n typedef signed int S32;\n typedef unsigned long long U64;\n typedef signed long long S64;\n#endif\n\n\n/****************************************************************\n* Memory I/O\n*****************************************************************/\n/* MEM_FORCE_MEMORY_ACCESS\n * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.\n * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.\n * The below switch allow to select different access method for improved performance.\n * Method 0 (default) : use `memcpy()`. Safe and portable.\n * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).\n * This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.\n * Method 2 : direct access. This method is portable but violate C standard.\n * It can generate buggy code on targets generating assembly depending on alignment.\n * But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)\n * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.\n * Prefer these methods in priority order (0 > 1 > 2)\n */\n#ifndef MEM_FORCE_MEMORY_ACCESS /* can be defined externally, on command line for example */\n# 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__) )\n# define MEM_FORCE_MEMORY_ACCESS 2\n# elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \\\n (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))\n# define MEM_FORCE_MEMORY_ACCESS 1\n# endif\n#endif\n\nMEM_STATIC unsigned MEM_32bits(void) { return sizeof(void*)==4; }\nMEM_STATIC unsigned MEM_64bits(void) { return sizeof(void*)==8; }\n\nMEM_STATIC unsigned MEM_isLittleEndian(void)\n{\n const union { U32 u; BYTE c[4]; } one = { 1 }; /* don't use static : performance detrimental */\n return one.c[0];\n}\n\n#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)\n\n/* violates C standard on structure alignment.\nOnly use if no other choice to achieve best performance on target platform */\nMEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }\nMEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }\nMEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }\n\nMEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }\n\n#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)\n\n/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */\n/* currently only defined for gcc and icc */\ntypedef union { U16 u16; U32 u32; U64 u64; } __attribute__((packed)) unalign;\n\nMEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }\nMEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }\nMEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }\n\nMEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign*)memPtr)->u16 = value; }\n\n#else\n\n/* default method, safe and standard.\n can sometimes prove slower */\n\nMEM_STATIC U16 MEM_read16(const void* memPtr)\n{\n U16 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\nMEM_STATIC U32 MEM_read32(const void* memPtr)\n{\n U32 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\nMEM_STATIC U64 MEM_read64(const void* memPtr)\n{\n U64 val; memcpy(&val, memPtr, sizeof(val)); return val;\n}\n\nMEM_STATIC void MEM_write16(void* memPtr, U16 value)\n{\n memcpy(memPtr, &value, sizeof(value));\n}\n\n#endif /* MEM_FORCE_MEMORY_ACCESS */\n\n\nMEM_STATIC U16 MEM_readLE16(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read16(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U16)(p[0] + (p[1]<<8));\n }\n}\n\nMEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)\n{\n if (MEM_isLittleEndian())\n {\n MEM_write16(memPtr, val);\n }\n else\n {\n BYTE* p = (BYTE*)memPtr;\n p[0] = (BYTE)val;\n p[1] = (BYTE)(val>>8);\n }\n}\n\nMEM_STATIC U32 MEM_readLE24(const void* memPtr)\n{\n return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);\n}\n\nMEM_STATIC U32 MEM_readLE32(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read32(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U32)((U32)p[0] + ((U32)p[1]<<8) + ((U32)p[2]<<16) + ((U32)p[3]<<24));\n }\n}\n\n\nMEM_STATIC U64 MEM_readLE64(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read64(memPtr);\n else\n {\n const BYTE* p = (const BYTE*)memPtr;\n return (U64)((U64)p[0] + ((U64)p[1]<<8) + ((U64)p[2]<<16) + ((U64)p[3]<<24)\n + ((U64)p[4]<<32) + ((U64)p[5]<<40) + ((U64)p[6]<<48) + ((U64)p[7]<<56));\n }\n}\n\n\nMEM_STATIC size_t MEM_readLEST(const void* memPtr)\n{\n if (MEM_32bits())\n return (size_t)MEM_readLE32(memPtr);\n else\n return (size_t)MEM_readLE64(memPtr);\n}\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* MEM_H_MODULE */\n\n\n/* ******************************************************************\n bitstream\n Part of NewGen Entropy library\n header file (to include)\n Copyright (C) 2013-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - Source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n#ifndef BITSTREAM_H_MODULE\n#define BITSTREAM_H_MODULE\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n\n/*\n* This API consists of small unitary functions, which highly benefit from being inlined.\n* Since link-time-optimization is not available for all compilers,\n* these functions are defined into a .h to be included.\n*/\n\n\n/**********************************************\n* bitStream decompression API (read backward)\n**********************************************/\ntypedef struct\n{\n size_t bitContainer;\n unsigned bitsConsumed;\n const char* ptr;\n const char* start;\n} BIT_DStream_t;\n\ntypedef enum { BIT_DStream_unfinished = 0,\n BIT_DStream_endOfBuffer = 1,\n BIT_DStream_completed = 2,\n BIT_DStream_overflow = 3 } BIT_DStream_status; /* result of BIT_reloadDStream() */\n /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */\n\nMEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);\nMEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);\nMEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);\nMEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);\n\n\n/******************************************\n* unsafe API\n******************************************/\nMEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);\n/* faster, but works only if nbBits >= 1 */\n\n\n\n/****************************************************************\n* Helper functions\n****************************************************************/\nMEM_STATIC unsigned BIT_highbit32 (U32 val)\n{\n# if defined(_MSC_VER) /* Visual */\n unsigned long r=0;\n _BitScanReverse ( &r, val );\n return (unsigned) r;\n# elif defined(__GNUC__) && (__GNUC__ >= 3) /* Use GCC Intrinsic */\n return __builtin_clz (val) ^ 31;\n# else /* Software version */\n static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };\n U32 v = val;\n unsigned r;\n v |= v >> 1;\n v |= v >> 2;\n v |= v >> 4;\n v |= v >> 8;\n v |= v >> 16;\n r = DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];\n return r;\n# endif\n}\n\n\n\n/**********************************************************\n* bitStream decoding\n**********************************************************/\n\n/*!BIT_initDStream\n* Initialize a BIT_DStream_t.\n* @bitD : a pointer to an already allocated BIT_DStream_t structure\n* @srcBuffer must point at the beginning of a bitStream\n* @srcSize must be the exact size of the bitStream\n* @result : size of stream (== srcSize) or an errorCode if a problem is detected\n*/\nMEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)\n{\n if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }\n\n if (srcSize >= sizeof(size_t)) /* normal case */\n {\n U32 contain32;\n bitD->start = (const char*)srcBuffer;\n bitD->ptr = (const char*)srcBuffer + srcSize - sizeof(size_t);\n bitD->bitContainer = MEM_readLEST(bitD->ptr);\n contain32 = ((const BYTE*)srcBuffer)[srcSize-1];\n if (contain32 == 0) return ERROR(GENERIC); /* endMark not present */\n bitD->bitsConsumed = 8 - BIT_highbit32(contain32);\n }\n else\n {\n U32 contain32;\n bitD->start = (const char*)srcBuffer;\n bitD->ptr = bitD->start;\n bitD->bitContainer = *(const BYTE*)(bitD->start);\n switch(srcSize)\n {\n case 7: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[6]) << (sizeof(size_t)*8 - 16);\n /* fallthrough */\n case 6: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[5]) << (sizeof(size_t)*8 - 24);\n /* fallthrough */\n case 5: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[4]) << (sizeof(size_t)*8 - 32);\n /* fallthrough */\n case 4: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[3]) << 24;\n /* fallthrough */\n case 3: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[2]) << 16;\n /* fallthrough */\n case 2: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[1]) << 8;\n /* fallthrough */\n default:;\n }\n contain32 = ((const BYTE*)srcBuffer)[srcSize-1];\n if (contain32 == 0) return ERROR(GENERIC); /* endMark not present */\n bitD->bitsConsumed = 8 - BIT_highbit32(contain32);\n bitD->bitsConsumed += (U32)(sizeof(size_t) - srcSize)*8;\n }\n\n return srcSize;\n}\n\nMEM_STATIC size_t BIT_lookBits(BIT_DStream_t* bitD, U32 nbBits)\n{\n const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;\n return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);\n}\n\n/*! BIT_lookBitsFast :\n* unsafe version; only works only if nbBits >= 1 */\nMEM_STATIC size_t BIT_lookBitsFast(BIT_DStream_t* bitD, U32 nbBits)\n{\n const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;\n return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);\n}\n\nMEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)\n{\n bitD->bitsConsumed += nbBits;\n}\n\nMEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)\n{\n size_t value = BIT_lookBits(bitD, nbBits);\n BIT_skipBits(bitD, nbBits);\n return value;\n}\n\n/*!BIT_readBitsFast :\n* unsafe version; only works only if nbBits >= 1 */\nMEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)\n{\n size_t value = BIT_lookBitsFast(bitD, nbBits);\n BIT_skipBits(bitD, nbBits);\n return value;\n}\n\nMEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)\n{\n if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8)) /* should never happen */\n return BIT_DStream_overflow;\n\n if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))\n {\n bitD->ptr -= bitD->bitsConsumed >> 3;\n bitD->bitsConsumed &= 7;\n bitD->bitContainer = MEM_readLEST(bitD->ptr);\n return BIT_DStream_unfinished;\n }\n if (bitD->ptr == bitD->start)\n {\n if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;\n return BIT_DStream_completed;\n }\n {\n U32 nbBytes = bitD->bitsConsumed >> 3;\n BIT_DStream_status result = BIT_DStream_unfinished;\n if (bitD->ptr - nbBytes < bitD->start)\n {\n nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */\n result = BIT_DStream_endOfBuffer;\n }\n bitD->ptr -= nbBytes;\n bitD->bitsConsumed -= nbBytes*8;\n bitD->bitContainer = MEM_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD) */\n return result;\n }\n}\n\n/*! BIT_endOfDStream\n* @return Tells if DStream has reached its exact end\n*/\nMEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)\n{\n return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));\n}\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* BITSTREAM_H_MODULE */\n/* ******************************************************************\n Error codes and messages\n Copyright (C) 2013-2015, Yann Collet\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - Source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n#ifndef ERROR_H_MODULE\n#define ERROR_H_MODULE\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n\n/******************************************\n* Compiler-specific\n******************************************/\n#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n# define ERR_STATIC static inline\n#elif defined(_MSC_VER)\n# define ERR_STATIC static __inline\n#elif defined(__GNUC__)\n# define ERR_STATIC static __attribute__((unused))\n#else\n# define ERR_STATIC static /* this version may generate warnings for unused static functions; disable the relevant warning */\n#endif\n\n\n/******************************************\n* Error Management\n******************************************/\n#define PREFIX(name) ZSTD_error_##name\n\n#define ERROR(name) (size_t)-PREFIX(name)\n\n#define ERROR_LIST(ITEM) \\\n ITEM(PREFIX(No_Error)) ITEM(PREFIX(GENERIC)) \\\n ITEM(PREFIX(dstSize_tooSmall)) ITEM(PREFIX(srcSize_wrong)) \\\n ITEM(PREFIX(prefix_unknown)) ITEM(PREFIX(corruption_detected)) \\\n ITEM(PREFIX(tableLog_tooLarge)) ITEM(PREFIX(maxSymbolValue_tooLarge)) ITEM(PREFIX(maxSymbolValue_tooSmall)) \\\n ITEM(PREFIX(maxCode))\n\n#define ERROR_GENERATE_ENUM(ENUM) ENUM,\ntypedef enum { ERROR_LIST(ERROR_GENERATE_ENUM) } ERR_codes; /* enum is exposed, to detect & handle specific errors; compare function result to -enum value */\n\n#define ERROR_CONVERTTOSTRING(STRING) #STRING,\n#define ERROR_GENERATE_STRING(EXPR) ERROR_CONVERTTOSTRING(EXPR)\nstatic const char* ERR_strings[] = { ERROR_LIST(ERROR_GENERATE_STRING) };\n\nERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }\n\nERR_STATIC const char* ERR_getErrorName(size_t code)\n{\n static const char* codeError = \"Unspecified error code\";\n if (ERR_isError(code)) return ERR_strings[-(int)(code)];\n return codeError;\n}\n\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* ERROR_H_MODULE */\n/*\nConstructor and Destructor of type FSE_CTable\n Note that its size depends on 'tableLog' and 'maxSymbolValue' */\ntypedef unsigned FSE_CTable; /* don't allocate that. It's just a way to be more restrictive than void* */\ntypedef unsigned FSE_DTable; /* don't allocate that. It's just a way to be more restrictive than void* */\n\n\n/* ******************************************************************\n FSE : Finite State Entropy coder\n header file for static linking (only)\n Copyright (C) 2013-2015, Yann Collet\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - Source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n\n/******************************************\n* Static allocation\n******************************************/\n/* FSE buffer bounds */\n#define FSE_NCOUNTBOUND 512\n#define FSE_BLOCKBOUND(size) (size + (size>>7))\n#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size)) /* Macro version, useful for static allocation */\n\n/* You can statically allocate FSE CTable/DTable as a table of unsigned using below macro */\n#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))\n#define FSE_DTABLE_SIZE_U32(maxTableLog) (1 + (1<= 1 (otherwise, result will be corrupted) */\n\n\n/******************************************\n* Implementation of inline functions\n******************************************/\n\n/* decompression */\n\ntypedef struct {\n U16 tableLog;\n U16 fastMode;\n} FSE_DTableHeader; /* sizeof U32 */\n\ntypedef struct\n{\n unsigned short newState;\n unsigned char symbol;\n unsigned char nbBits;\n} FSE_decode_t; /* size == U32 */\n\nMEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)\n{\n FSE_DTableHeader DTableH;\n memcpy(&DTableH, dt, sizeof(DTableH));\n DStatePtr->state = BIT_readBits(bitD, DTableH.tableLog);\n BIT_reloadDStream(bitD);\n DStatePtr->table = dt + 1;\n}\n\nMEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)\n{\n const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];\n const U32 nbBits = DInfo.nbBits;\n BYTE symbol = DInfo.symbol;\n size_t lowBits = BIT_readBits(bitD, nbBits);\n\n DStatePtr->state = DInfo.newState + lowBits;\n return symbol;\n}\n\nMEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)\n{\n const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];\n const U32 nbBits = DInfo.nbBits;\n BYTE symbol = DInfo.symbol;\n size_t lowBits = BIT_readBitsFast(bitD, nbBits);\n\n DStatePtr->state = DInfo.newState + lowBits;\n return symbol;\n}\n\nMEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)\n{\n return DStatePtr->state == 0;\n}\n\n\n#if defined (__cplusplus)\n}\n#endif\n/* ******************************************************************\n Huff0 : Huffman coder, part of New Generation Entropy library\n header file for static linking (only)\n Copyright (C) 2013-2015, Yann Collet\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - Source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/******************************************\n* Static allocation macros\n******************************************/\n/* Huff0 buffer bounds */\n#define HUF_CTABLEBOUND 129\n#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8) /* only true if incompressible pre-filtered with fast heuristic */\n#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size)) /* Macro version, useful for static allocation */\n\n/* static allocation of Huff0's DTable */\n#define HUF_DTABLE_SIZE(maxTableLog) (1 + (1< /* size_t */\n\n\n/* *************************************\n* Version\n***************************************/\n#define ZSTD_VERSION_MAJOR 0 /* for breaking interface changes */\n#define ZSTD_VERSION_MINOR 2 /* for new (non-breaking) interface capabilities */\n#define ZSTD_VERSION_RELEASE 2 /* for tweaks, bug-fixes, or development */\n#define ZSTD_VERSION_NUMBER (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)\n\n\n/* *************************************\n* Advanced functions\n***************************************/\ntypedef struct ZSTD_CCtx_s ZSTD_CCtx; /* incomplete type */\n\n#if defined (__cplusplus)\n}\n#endif\n/*\n zstd - standard compression library\n Header File for static linking only\n Copyright (C) 2014-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - zstd source repository : https://github.com/Cyan4973/zstd\n - ztsd public forum : https://groups.google.com/forum/#!forum/lz4c\n*/\n\n/* The objects defined into this file should be considered experimental.\n * They are not labelled stable, as their prototype may change in the future.\n * You can use them for tests, provide feedback, or if you can endure risk of future changes.\n */\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/* *************************************\n* Streaming functions\n***************************************/\n\ntypedef struct ZSTD_DCtx_s ZSTD_DCtx;\n\n/*\n Use above functions alternatively.\n ZSTD_nextSrcSizeToDecompress() tells how much bytes to provide as 'srcSize' to ZSTD_decompressContinue().\n ZSTD_decompressContinue() will use previous data blocks to improve compression if they are located prior to current block.\n Result is the number of bytes regenerated within 'dst'.\n It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some header.\n*/\n\n/* *************************************\n* Prefix - version detection\n***************************************/\n#define ZSTD_magicNumber 0xFD2FB522 /* v0.2 (current)*/\n\n\n#if defined (__cplusplus)\n}\n#endif\n/* ******************************************************************\n FSE : Finite State Entropy coder\n Copyright (C) 2013-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n\n#ifndef FSE_COMMONDEFS_ONLY\n\n/****************************************************************\n* Tuning parameters\n****************************************************************/\n/* MEMORY_USAGE :\n* Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)\n* Increasing memory usage improves compression ratio\n* Reduced memory usage can improve speed, due to cache effect\n* Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */\n#define FSE_MAX_MEMORY_USAGE 14\n#define FSE_DEFAULT_MEMORY_USAGE 13\n\n/* FSE_MAX_SYMBOL_VALUE :\n* Maximum symbol value authorized.\n* Required for proper stack allocation */\n#define FSE_MAX_SYMBOL_VALUE 255\n\n\n/****************************************************************\n* template functions type & suffix\n****************************************************************/\n#define FSE_FUNCTION_TYPE BYTE\n#define FSE_FUNCTION_EXTENSION\n\n\n/****************************************************************\n* Byte symbol type\n****************************************************************/\n#endif /* !FSE_COMMONDEFS_ONLY */\n\n\n/****************************************************************\n* Compiler specifics\n****************************************************************/\n#ifdef _MSC_VER /* Visual Studio */\n# define FORCE_INLINE static __forceinline\n# include /* For Visual 2005 */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n# pragma warning(disable : 4214) /* disable: C4214: non-int bitfields */\n#else\n# if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */\n# ifdef __GNUC__\n# define FORCE_INLINE static inline __attribute__((always_inline))\n# else\n# define FORCE_INLINE static inline\n# endif\n# else\n# define FORCE_INLINE static\n# endif /* __STDC_VERSION__ */\n#endif\n\n\n/****************************************************************\n* Includes\n****************************************************************/\n#include /* malloc, free, qsort */\n#include /* memcpy, memset */\n#include /* printf (debug) */\n\n/****************************************************************\n* Constants\n*****************************************************************/\n#define FSE_MAX_TABLELOG (FSE_MAX_MEMORY_USAGE-2)\n#define FSE_MAX_TABLESIZE (1U< FSE_TABLELOG_ABSOLUTE_MAX\n#error \"FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported\"\n#endif\n\n\n/****************************************************************\n* Error Management\n****************************************************************/\n#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; } /* use only *after* variable declarations */\n\n\n/****************************************************************\n* Complex types\n****************************************************************/\ntypedef U32 DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];\n\n\n/****************************************************************\n* Templates\n****************************************************************/\n/*\n designed to be included\n for type-specific functions (template emulation in C)\n Objective is to write these functions only once, for improved maintenance\n*/\n\n/* safety checks */\n#ifndef FSE_FUNCTION_EXTENSION\n# error \"FSE_FUNCTION_EXTENSION must be defined\"\n#endif\n#ifndef FSE_FUNCTION_TYPE\n# error \"FSE_FUNCTION_TYPE must be defined\"\n#endif\n\n/* Function names */\n#define FSE_CAT(X,Y) X##Y\n#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)\n#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)\n\n\n/* Function templates */\n\n#define FSE_DECODE_TYPE FSE_decode_t\n\nstatic U32 FSE_tableStep(U32 tableSize) { return (tableSize>>1) + (tableSize>>3) + 3; }\n\nstatic size_t FSE_buildDTable\n(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)\n{\n void* ptr = dt+1;\n FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*)ptr;\n FSE_DTableHeader DTableH;\n const U32 tableSize = 1 << tableLog;\n const U32 tableMask = tableSize-1;\n const U32 step = FSE_tableStep(tableSize);\n U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];\n U32 position = 0;\n U32 highThreshold = tableSize-1;\n const S16 largeLimit= (S16)(1 << (tableLog-1));\n U32 noLarge = 1;\n U32 s;\n\n /* Sanity Checks */\n if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);\n if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);\n\n /* Init, lay down lowprob symbols */\n DTableH.tableLog = (U16)tableLog;\n for (s=0; s<=maxSymbolValue; s++)\n {\n if (normalizedCounter[s]==-1)\n {\n tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;\n symbolNext[s] = 1;\n }\n else\n {\n if (normalizedCounter[s] >= largeLimit) noLarge=0;\n symbolNext[s] = normalizedCounter[s];\n }\n }\n\n /* Spread symbols */\n for (s=0; s<=maxSymbolValue; s++)\n {\n int i;\n for (i=0; i highThreshold) position = (position + step) & tableMask; /* lowprob area */\n }\n }\n\n if (position!=0) return ERROR(GENERIC); /* position must reach all cells once, otherwise normalizedCounter is incorrect */\n\n /* Build Decoding table */\n {\n U32 i;\n for (i=0; i FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);\n bitStream >>= 4;\n bitCount = 4;\n *tableLogPtr = nbBits;\n remaining = (1<1) && (charnum<=*maxSVPtr))\n {\n if (previous0)\n {\n unsigned n0 = charnum;\n while ((bitStream & 0xFFFF) == 0xFFFF)\n {\n n0+=24;\n if (ip < iend-5)\n {\n ip+=2;\n bitStream = MEM_readLE32(ip) >> bitCount;\n }\n else\n {\n bitStream >>= 16;\n bitCount+=16;\n }\n }\n while ((bitStream & 3) == 3)\n {\n n0+=3;\n bitStream>>=2;\n bitCount+=2;\n }\n n0 += bitStream & 3;\n bitCount += 2;\n if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);\n while (charnum < n0) normalizedCounter[charnum++] = 0;\n if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))\n {\n ip += bitCount>>3;\n bitCount &= 7;\n bitStream = MEM_readLE32(ip) >> bitCount;\n }\n else\n bitStream >>= 2;\n }\n {\n const short max = (short)((2*threshold-1)-remaining);\n short count;\n\n if ((bitStream & (threshold-1)) < (U32)max)\n {\n count = (short)(bitStream & (threshold-1));\n bitCount += nbBits-1;\n }\n else\n {\n count = (short)(bitStream & (2*threshold-1));\n if (count >= threshold) count -= max;\n bitCount += nbBits;\n }\n\n count--; /* extra accuracy */\n remaining -= FSE_abs(count);\n normalizedCounter[charnum++] = count;\n previous0 = !count;\n while (remaining < threshold)\n {\n nbBits--;\n threshold >>= 1;\n }\n\n {\n if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))\n {\n ip += bitCount>>3;\n bitCount &= 7;\n }\n else\n {\n bitCount -= (int)(8 * (iend - 4 - ip));\n ip = iend - 4;\n }\n bitStream = MEM_readLE32(ip) >> (bitCount & 31);\n }\n }\n }\n if (remaining != 1) return ERROR(GENERIC);\n *maxSVPtr = charnum-1;\n\n ip += (bitCount+7)>>3;\n if ((size_t)(ip-istart) > hbSize) return ERROR(srcSize_wrong);\n return ip-istart;\n}\n\n\n/*********************************************************\n* Decompression (Byte symbols)\n*********************************************************/\nstatic size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)\n{\n void* ptr = dt;\n FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;\n FSE_decode_t* const cell = (FSE_decode_t*)(ptr) + 1; /* because dt is unsigned */\n\n DTableH->tableLog = 0;\n DTableH->fastMode = 0;\n\n cell->newState = 0;\n cell->symbol = symbolValue;\n cell->nbBits = 0;\n\n return 0;\n}\n\n\nstatic size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)\n{\n void* ptr = dt;\n FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;\n FSE_decode_t* const dinfo = (FSE_decode_t*)(ptr) + 1; /* because dt is unsigned */\n const unsigned tableSize = 1 << nbBits;\n const unsigned tableMask = tableSize - 1;\n const unsigned maxSymbolValue = tableMask;\n unsigned s;\n\n /* Sanity checks */\n if (nbBits < 1) return ERROR(GENERIC); /* min size */\n\n /* Build Decoding Table */\n DTableH->tableLog = (U16)nbBits;\n DTableH->fastMode = 1;\n for (s=0; s<=maxSymbolValue; s++)\n {\n dinfo[s].newState = 0;\n dinfo[s].symbol = (BYTE)s;\n dinfo[s].nbBits = (BYTE)nbBits;\n }\n\n return 0;\n}\n\nFORCE_INLINE size_t FSE_decompress_usingDTable_generic(\n void* dst, size_t maxDstSize,\n const void* cSrc, size_t cSrcSize,\n const FSE_DTable* dt, const unsigned fast)\n{\n BYTE* const ostart = (BYTE*) dst;\n BYTE* op = ostart;\n BYTE* const omax = op + maxDstSize;\n BYTE* const olimit = omax-3;\n\n BIT_DStream_t bitD;\n FSE_DState_t state1;\n FSE_DState_t state2;\n size_t errorCode;\n\n /* Init */\n errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize); /* replaced last arg by maxCompressed Size */\n if (FSE_isError(errorCode)) return errorCode;\n\n FSE_initDState(&state1, &bitD, dt);\n FSE_initDState(&state2, &bitD, dt);\n\n#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)\n\n /* 4 symbols per loop */\n for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) && (op sizeof(bitD.bitContainer)*8) /* This test must be static */\n BIT_reloadDStream(&bitD);\n\n op[1] = FSE_GETSYMBOL(&state2);\n\n if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8) /* This test must be static */\n { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }\n\n op[2] = FSE_GETSYMBOL(&state1);\n\n if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8) /* This test must be static */\n BIT_reloadDStream(&bitD);\n\n op[3] = FSE_GETSYMBOL(&state2);\n }\n\n /* tail */\n /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */\n while (1)\n {\n if ( (BIT_reloadDStream(&bitD)>BIT_DStream_completed) || (op==omax) || (BIT_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state1))) )\n break;\n\n *op++ = FSE_GETSYMBOL(&state1);\n\n if ( (BIT_reloadDStream(&bitD)>BIT_DStream_completed) || (op==omax) || (BIT_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state2))) )\n break;\n\n *op++ = FSE_GETSYMBOL(&state2);\n }\n\n /* end ? */\n if (BIT_endOfDStream(&bitD) && FSE_endOfDState(&state1) && FSE_endOfDState(&state2))\n return op-ostart;\n\n if (op==omax) return ERROR(dstSize_tooSmall); /* dst buffer is full, but cSrc unfinished */\n\n return ERROR(corruption_detected);\n}\n\n\nstatic size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,\n const void* cSrc, size_t cSrcSize,\n const FSE_DTable* dt)\n{\n FSE_DTableHeader DTableH;\n memcpy(&DTableH, dt, sizeof(DTableH));\n\n /* select fast mode (static) */\n if (DTableH.fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);\n return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);\n}\n\n\nstatic size_t FSE_decompress(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)\n{\n const BYTE* const istart = (const BYTE*)cSrc;\n const BYTE* ip = istart;\n short counting[FSE_MAX_SYMBOL_VALUE+1];\n DTable_max_t dt; /* Static analyzer seems unable to understand this table will be properly initialized later */\n unsigned tableLog;\n unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;\n size_t errorCode;\n\n if (cSrcSize<2) return ERROR(srcSize_wrong); /* too small input size */\n\n /* normal FSE decoding mode */\n errorCode = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);\n if (FSE_isError(errorCode)) return errorCode;\n if (errorCode >= cSrcSize) return ERROR(srcSize_wrong); /* too small input size */\n ip += errorCode;\n cSrcSize -= errorCode;\n\n errorCode = FSE_buildDTable (dt, counting, maxSymbolValue, tableLog);\n if (FSE_isError(errorCode)) return errorCode;\n\n /* always return, even if it is an error code */\n return FSE_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, dt);\n}\n\n\n\n#endif /* FSE_COMMONDEFS_ONLY */\n/* ******************************************************************\n Huff0 : Huffman coder, part of New Generation Entropy library\n Copyright (C) 2013-2015, Yann Collet.\n\n BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following disclaimer\n in the documentation and/or other materials provided with the\n distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n You can contact the author at :\n - FSE+Huff0 source repository : https://github.com/Cyan4973/FiniteStateEntropy\n - Public forum : https://groups.google.com/forum/#!forum/lz4c\n****************************************************************** */\n\n/****************************************************************\n* Compiler specifics\n****************************************************************/\n#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n/* inline is defined */\n#elif defined(_MSC_VER)\n# define inline __inline\n#else\n# define inline /* disable inline */\n#endif\n\n\n#ifdef _MSC_VER /* Visual Studio */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n#endif\n\n\n/****************************************************************\n* Includes\n****************************************************************/\n#include /* malloc, free, qsort */\n#include /* memcpy, memset */\n#include /* printf (debug) */\n\n/****************************************************************\n* Error Management\n****************************************************************/\n#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; } /* use only *after* variable declarations */\n\n\n/******************************************\n* Helper functions\n******************************************/\nstatic unsigned HUF_isError(size_t code) { return ERR_isError(code); }\n\n#define HUF_ABSOLUTEMAX_TABLELOG 16 /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */\n#define HUF_MAX_TABLELOG 12 /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */\n#define HUF_DEFAULT_TABLELOG HUF_MAX_TABLELOG /* tableLog by default, when not specified */\n#define HUF_MAX_SYMBOL_VALUE 255\n#if (HUF_MAX_TABLELOG > HUF_ABSOLUTEMAX_TABLELOG)\n# error \"HUF_MAX_TABLELOG is too large !\"\n#endif\n\n\n\n/*********************************************************\n* Huff0 : Huffman block decompression\n*********************************************************/\ntypedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX2; /* single-symbol decoding */\n\ntypedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX4; /* double-symbols decoding */\n\ntypedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;\n\n/*! HUF_readStats\n Read compact Huffman tree, saved by HUF_writeCTable\n @huffWeight : destination buffer\n @return : size read from `src`\n*/\nstatic size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,\n U32* nbSymbolsPtr, U32* tableLogPtr,\n const void* src, size_t srcSize)\n{\n U32 weightTotal;\n U32 tableLog;\n const BYTE* ip = (const BYTE*) src;\n size_t iSize;\n size_t oSize;\n U32 n;\n\n if (!srcSize) return ERROR(srcSize_wrong);\n iSize = ip[0];\n //memset(huffWeight, 0, hwSize); /* is not necessary, even though some analyzer complain ... */\n\n if (iSize >= 128) /* special header */\n {\n if (iSize >= (242)) /* RLE */\n {\n static int l[14] = { 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128 };\n oSize = l[iSize-242];\n memset(huffWeight, 1, hwSize);\n iSize = 0;\n }\n else /* Incompressible */\n {\n oSize = iSize - 127;\n iSize = ((oSize+1)/2);\n if (iSize+1 > srcSize) return ERROR(srcSize_wrong);\n if (oSize >= hwSize) return ERROR(corruption_detected);\n ip += 1;\n for (n=0; n> 4;\n huffWeight[n+1] = ip[n/2] & 15;\n }\n }\n }\n else /* header compressed with FSE (normal case) */\n {\n if (iSize+1 > srcSize) return ERROR(srcSize_wrong);\n oSize = FSE_decompress(huffWeight, hwSize-1, ip+1, iSize); /* max (hwSize-1) values decoded, as last one is implied */\n if (FSE_isError(oSize)) return oSize;\n }\n\n /* collect weight stats */\n memset(rankStats, 0, (HUF_ABSOLUTEMAX_TABLELOG + 1) * sizeof(U32));\n weightTotal = 0;\n for (n=0; n= HUF_ABSOLUTEMAX_TABLELOG) return ERROR(corruption_detected);\n rankStats[huffWeight[n]]++;\n weightTotal += (1 << huffWeight[n]) >> 1;\n }\n if (weightTotal == 0) return ERROR(corruption_detected);\n\n /* get last non-null symbol weight (implied, total must be 2^n) */\n tableLog = BIT_highbit32(weightTotal) + 1;\n if (tableLog > HUF_ABSOLUTEMAX_TABLELOG) return ERROR(corruption_detected);\n {\n U32 total = 1 << tableLog;\n U32 rest = total - weightTotal;\n U32 verif = 1 << BIT_highbit32(rest);\n U32 lastWeight = BIT_highbit32(rest) + 1;\n if (verif != rest) return ERROR(corruption_detected); /* last value must be a clean power of 2 */\n huffWeight[oSize] = (BYTE)lastWeight;\n rankStats[lastWeight]++;\n }\n\n /* check tree construction validity */\n if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected); /* by construction : at least 2 elts of rank 1, must be even */\n\n /* results */\n *nbSymbolsPtr = (U32)(oSize+1);\n *tableLogPtr = tableLog;\n return iSize+1;\n}\n\n\n/**************************/\n/* single-symbol decoding */\n/**************************/\n\nstatic size_t HUF_readDTableX2 (U16* DTable, const void* src, size_t srcSize)\n{\n BYTE huffWeight[HUF_MAX_SYMBOL_VALUE + 1];\n U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1]; /* large enough for values from 0 to 16 */\n U32 tableLog = 0;\n const BYTE* ip = (const BYTE*) src;\n size_t iSize = ip[0];\n U32 nbSymbols = 0;\n U32 n;\n U32 nextRankStart;\n void* ptr = DTable+1;\n HUF_DEltX2* const dt = (HUF_DEltX2*)ptr;\n\n HUF_STATIC_ASSERT(sizeof(HUF_DEltX2) == sizeof(U16)); /* if compilation fails here, assertion is false */\n //memset(huffWeight, 0, sizeof(huffWeight)); /* is not necessary, even though some analyzer complain ... */\n\n iSize = HUF_readStats(huffWeight, HUF_MAX_SYMBOL_VALUE + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);\n if (HUF_isError(iSize)) return iSize;\n\n /* check result */\n if (tableLog > DTable[0]) return ERROR(tableLog_tooLarge); /* DTable is too small */\n DTable[0] = (U16)tableLog; /* maybe should separate sizeof DTable, as allocated, from used size of DTable, in case of DTable re-use */\n\n /* Prepare ranks */\n nextRankStart = 0;\n for (n=1; n<=tableLog; n++)\n {\n U32 current = nextRankStart;\n nextRankStart += (rankVal[n] << (n-1));\n rankVal[n] = current;\n }\n\n /* fill DTable */\n for (n=0; n> 1;\n U32 i;\n HUF_DEltX2 D;\n D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);\n for (i = rankVal[w]; i < rankVal[w] + length; i++)\n dt[i] = D;\n rankVal[w] += length;\n }\n\n return iSize;\n}\n\nstatic BYTE HUF_decodeSymbolX2(BIT_DStream_t* Dstream, const HUF_DEltX2* dt, const U32 dtLog)\n{\n const size_t val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */\n const BYTE c = dt[val].byte;\n BIT_skipBits(Dstream, dt[val].nbBits);\n return c;\n}\n\n#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \\\n *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)\n\n#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \\\n if (MEM_64bits() || (HUF_MAX_TABLELOG<=12)) \\\n HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)\n\n#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \\\n if (MEM_64bits()) \\\n HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)\n\nstatic inline size_t HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX2* const dt, const U32 dtLog)\n{\n BYTE* const pStart = p;\n\n /* up to 4 symbols at a time */\n while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4))\n {\n HUF_DECODE_SYMBOLX2_2(p, bitDPtr);\n HUF_DECODE_SYMBOLX2_1(p, bitDPtr);\n HUF_DECODE_SYMBOLX2_2(p, bitDPtr);\n HUF_DECODE_SYMBOLX2_0(p, bitDPtr);\n }\n\n /* closer to the end */\n while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))\n HUF_DECODE_SYMBOLX2_0(p, bitDPtr);\n\n /* no more data to retrieve from bitstream, hence no need to reload */\n while (p < pEnd)\n HUF_DECODE_SYMBOLX2_0(p, bitDPtr);\n\n return pEnd-pStart;\n}\n\n\nstatic size_t HUF_decompress4X2_usingDTable(\n void* dst, size_t dstSize,\n const void* cSrc, size_t cSrcSize,\n const U16* DTable)\n{\n if (cSrcSize < 10) return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */\n\n {\n const BYTE* const istart = (const BYTE*) cSrc;\n BYTE* const ostart = (BYTE*) dst;\n BYTE* const oend = ostart + dstSize;\n\n const void* ptr = DTable;\n const HUF_DEltX2* const dt = ((const HUF_DEltX2*)ptr) +1;\n const U32 dtLog = DTable[0];\n size_t errorCode;\n\n /* Init */\n BIT_DStream_t bitD1;\n BIT_DStream_t bitD2;\n BIT_DStream_t bitD3;\n BIT_DStream_t bitD4;\n const size_t length1 = MEM_readLE16(istart);\n const size_t length2 = MEM_readLE16(istart+2);\n const size_t length3 = MEM_readLE16(istart+4);\n size_t length4;\n const BYTE* const istart1 = istart + 6; /* jumpTable */\n const BYTE* const istart2 = istart1 + length1;\n const BYTE* const istart3 = istart2 + length2;\n const BYTE* const istart4 = istart3 + length3;\n const size_t segmentSize = (dstSize+3) / 4;\n BYTE* const opStart2 = ostart + segmentSize;\n BYTE* const opStart3 = opStart2 + segmentSize;\n BYTE* const opStart4 = opStart3 + segmentSize;\n BYTE* op1 = ostart;\n BYTE* op2 = opStart2;\n BYTE* op3 = opStart3;\n BYTE* op4 = opStart4;\n U32 endSignal;\n\n length4 = cSrcSize - (length1 + length2 + length3 + 6);\n if (length4 > cSrcSize) return ERROR(corruption_detected); /* overflow */\n errorCode = BIT_initDStream(&bitD1, istart1, length1);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD2, istart2, length2);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD3, istart3, length3);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD4, istart4, length4);\n if (HUF_isError(errorCode)) return errorCode;\n\n /* 16-32 symbols per loop (4-8 symbols per stream) */\n endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);\n for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; )\n {\n HUF_DECODE_SYMBOLX2_2(op1, &bitD1);\n HUF_DECODE_SYMBOLX2_2(op2, &bitD2);\n HUF_DECODE_SYMBOLX2_2(op3, &bitD3);\n HUF_DECODE_SYMBOLX2_2(op4, &bitD4);\n HUF_DECODE_SYMBOLX2_1(op1, &bitD1);\n HUF_DECODE_SYMBOLX2_1(op2, &bitD2);\n HUF_DECODE_SYMBOLX2_1(op3, &bitD3);\n HUF_DECODE_SYMBOLX2_1(op4, &bitD4);\n HUF_DECODE_SYMBOLX2_2(op1, &bitD1);\n HUF_DECODE_SYMBOLX2_2(op2, &bitD2);\n HUF_DECODE_SYMBOLX2_2(op3, &bitD3);\n HUF_DECODE_SYMBOLX2_2(op4, &bitD4);\n HUF_DECODE_SYMBOLX2_0(op1, &bitD1);\n HUF_DECODE_SYMBOLX2_0(op2, &bitD2);\n HUF_DECODE_SYMBOLX2_0(op3, &bitD3);\n HUF_DECODE_SYMBOLX2_0(op4, &bitD4);\n\n endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);\n }\n\n /* check corruption */\n if (op1 > opStart2) return ERROR(corruption_detected);\n if (op2 > opStart3) return ERROR(corruption_detected);\n if (op3 > opStart4) return ERROR(corruption_detected);\n /* note : op4 supposed already verified within main loop */\n\n /* finish bitStreams one by one */\n HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);\n HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);\n HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);\n HUF_decodeStreamX2(op4, &bitD4, oend, dt, dtLog);\n\n /* check */\n endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);\n if (!endSignal) return ERROR(corruption_detected);\n\n /* decoded size */\n return dstSize;\n }\n}\n\n\nstatic size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)\n{\n HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_MAX_TABLELOG);\n const BYTE* ip = (const BYTE*) cSrc;\n size_t errorCode;\n\n errorCode = HUF_readDTableX2 (DTable, cSrc, cSrcSize);\n if (HUF_isError(errorCode)) return errorCode;\n if (errorCode >= cSrcSize) return ERROR(srcSize_wrong);\n ip += errorCode;\n cSrcSize -= errorCode;\n\n return HUF_decompress4X2_usingDTable (dst, dstSize, ip, cSrcSize, DTable);\n}\n\n\n/***************************/\n/* double-symbols decoding */\n/***************************/\n\nstatic void HUF_fillDTableX4Level2(HUF_DEltX4* DTable, U32 sizeLog, const U32 consumed,\n const U32* rankValOrigin, const int minWeight,\n const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,\n U32 nbBitsBaseline, U16 baseSeq)\n{\n HUF_DEltX4 DElt;\n U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];\n U32 s;\n\n /* get pre-calculated rankVal */\n memcpy(rankVal, rankValOrigin, sizeof(rankVal));\n\n /* fill skipped values */\n if (minWeight>1)\n {\n U32 i, skipSize = rankVal[minWeight];\n MEM_writeLE16(&(DElt.sequence), baseSeq);\n DElt.nbBits = (BYTE)(consumed);\n DElt.length = 1;\n for (i = 0; i < skipSize; i++)\n DTable[i] = DElt;\n }\n\n /* fill DTable */\n for (s=0; s= 1 */\n\n rankVal[weight] += length;\n }\n}\n\ntypedef U32 rankVal_t[HUF_ABSOLUTEMAX_TABLELOG][HUF_ABSOLUTEMAX_TABLELOG + 1];\n\nstatic void HUF_fillDTableX4(HUF_DEltX4* DTable, const U32 targetLog,\n const sortedSymbol_t* sortedList, const U32 sortedListSize,\n const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,\n const U32 nbBitsBaseline)\n{\n U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];\n const int scaleLog = nbBitsBaseline - targetLog; /* note : targetLog >= srcLog, hence scaleLog <= 1 */\n const U32 minBits = nbBitsBaseline - maxWeight;\n U32 s;\n\n memcpy(rankVal, rankValOrigin, sizeof(rankVal));\n\n /* fill DTable */\n for (s=0; s= minBits) /* enough room for a second symbol */\n {\n U32 sortedRank;\n int minWeight = nbBits + scaleLog;\n if (minWeight < 1) minWeight = 1;\n sortedRank = rankStart[minWeight];\n HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,\n rankValOrigin[nbBits], minWeight,\n sortedList+sortedRank, sortedListSize-sortedRank,\n nbBitsBaseline, symbol);\n }\n else\n {\n U32 i;\n const U32 end = start + length;\n HUF_DEltX4 DElt;\n\n MEM_writeLE16(&(DElt.sequence), symbol);\n DElt.nbBits = (BYTE)(nbBits);\n DElt.length = 1;\n for (i = start; i < end; i++)\n DTable[i] = DElt;\n }\n rankVal[weight] += length;\n }\n}\n\nstatic size_t HUF_readDTableX4 (U32* DTable, const void* src, size_t srcSize)\n{\n BYTE weightList[HUF_MAX_SYMBOL_VALUE + 1];\n sortedSymbol_t sortedSymbol[HUF_MAX_SYMBOL_VALUE + 1];\n U32 rankStats[HUF_ABSOLUTEMAX_TABLELOG + 1] = { 0 };\n U32 rankStart0[HUF_ABSOLUTEMAX_TABLELOG + 2] = { 0 };\n U32* const rankStart = rankStart0+1;\n rankVal_t rankVal;\n U32 tableLog, maxW, sizeOfSort, nbSymbols;\n const U32 memLog = DTable[0];\n const BYTE* ip = (const BYTE*) src;\n size_t iSize = ip[0];\n void* ptr = DTable;\n HUF_DEltX4* const dt = ((HUF_DEltX4*)ptr) + 1;\n\n HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(U32)); /* if compilation fails here, assertion is false */\n if (memLog > HUF_ABSOLUTEMAX_TABLELOG) return ERROR(tableLog_tooLarge);\n //memset(weightList, 0, sizeof(weightList)); /* is not necessary, even though some analyzer complain ... */\n\n iSize = HUF_readStats(weightList, HUF_MAX_SYMBOL_VALUE + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);\n if (HUF_isError(iSize)) return iSize;\n\n /* check result */\n if (tableLog > memLog) return ERROR(tableLog_tooLarge); /* DTable can't fit code depth */\n\n /* find maxWeight */\n for (maxW = tableLog; rankStats[maxW]==0; maxW--)\n {if (!maxW) return ERROR(GENERIC); } /* necessarily finds a solution before maxW==0 */\n\n /* Get start index of each weight */\n {\n U32 w, nextRankStart = 0;\n for (w=1; w<=maxW; w++)\n {\n U32 current = nextRankStart;\n nextRankStart += rankStats[w];\n rankStart[w] = current;\n }\n rankStart[0] = nextRankStart; /* put all 0w symbols at the end of sorted list*/\n sizeOfSort = nextRankStart;\n }\n\n /* sort symbols by weight */\n {\n U32 s;\n for (s=0; s> consumed;\n }\n }\n }\n\n HUF_fillDTableX4(dt, memLog,\n sortedSymbol, sizeOfSort,\n rankStart0, rankVal, maxW,\n tableLog+1);\n\n return iSize;\n}\n\n\nstatic U32 HUF_decodeSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)\n{\n const size_t val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */\n memcpy(op, dt+val, 2);\n BIT_skipBits(DStream, dt[val].nbBits);\n return dt[val].length;\n}\n\nstatic U32 HUF_decodeLastSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)\n{\n const size_t val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */\n memcpy(op, dt+val, 1);\n if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);\n else\n {\n if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8))\n {\n BIT_skipBits(DStream, dt[val].nbBits);\n if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))\n DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8); /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */\n }\n }\n return 1;\n}\n\n\n#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) \\\n ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)\n\n#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr) \\\n if (MEM_64bits() || (HUF_MAX_TABLELOG<=12)) \\\n ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)\n\n#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \\\n if (MEM_64bits()) \\\n ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)\n\nstatic inline size_t HUF_decodeStreamX4(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd, const HUF_DEltX4* const dt, const U32 dtLog)\n{\n BYTE* const pStart = p;\n\n /* up to 8 symbols at a time */\n while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd-7))\n {\n HUF_DECODE_SYMBOLX4_2(p, bitDPtr);\n HUF_DECODE_SYMBOLX4_1(p, bitDPtr);\n HUF_DECODE_SYMBOLX4_2(p, bitDPtr);\n HUF_DECODE_SYMBOLX4_0(p, bitDPtr);\n }\n\n /* closer to the end */\n while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-2))\n HUF_DECODE_SYMBOLX4_0(p, bitDPtr);\n\n while (p <= pEnd-2)\n HUF_DECODE_SYMBOLX4_0(p, bitDPtr); /* no need to reload : reached the end of DStream */\n\n if (p < pEnd)\n p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);\n\n return p-pStart;\n}\n\n\n\nstatic size_t HUF_decompress4X4_usingDTable(\n void* dst, size_t dstSize,\n const void* cSrc, size_t cSrcSize,\n const U32* DTable)\n{\n if (cSrcSize < 10) return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */\n\n {\n const BYTE* const istart = (const BYTE*) cSrc;\n BYTE* const ostart = (BYTE*) dst;\n BYTE* const oend = ostart + dstSize;\n\n const void* ptr = DTable;\n const HUF_DEltX4* const dt = ((const HUF_DEltX4*)ptr) +1;\n const U32 dtLog = DTable[0];\n size_t errorCode;\n\n /* Init */\n BIT_DStream_t bitD1;\n BIT_DStream_t bitD2;\n BIT_DStream_t bitD3;\n BIT_DStream_t bitD4;\n const size_t length1 = MEM_readLE16(istart);\n const size_t length2 = MEM_readLE16(istart+2);\n const size_t length3 = MEM_readLE16(istart+4);\n size_t length4;\n const BYTE* const istart1 = istart + 6; /* jumpTable */\n const BYTE* const istart2 = istart1 + length1;\n const BYTE* const istart3 = istart2 + length2;\n const BYTE* const istart4 = istart3 + length3;\n const size_t segmentSize = (dstSize+3) / 4;\n BYTE* const opStart2 = ostart + segmentSize;\n BYTE* const opStart3 = opStart2 + segmentSize;\n BYTE* const opStart4 = opStart3 + segmentSize;\n BYTE* op1 = ostart;\n BYTE* op2 = opStart2;\n BYTE* op3 = opStart3;\n BYTE* op4 = opStart4;\n U32 endSignal;\n\n length4 = cSrcSize - (length1 + length2 + length3 + 6);\n if (length4 > cSrcSize) return ERROR(corruption_detected); /* overflow */\n errorCode = BIT_initDStream(&bitD1, istart1, length1);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD2, istart2, length2);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD3, istart3, length3);\n if (HUF_isError(errorCode)) return errorCode;\n errorCode = BIT_initDStream(&bitD4, istart4, length4);\n if (HUF_isError(errorCode)) return errorCode;\n\n /* 16-32 symbols per loop (4-8 symbols per stream) */\n endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);\n for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; )\n {\n HUF_DECODE_SYMBOLX4_2(op1, &bitD1);\n HUF_DECODE_SYMBOLX4_2(op2, &bitD2);\n HUF_DECODE_SYMBOLX4_2(op3, &bitD3);\n HUF_DECODE_SYMBOLX4_2(op4, &bitD4);\n HUF_DECODE_SYMBOLX4_1(op1, &bitD1);\n HUF_DECODE_SYMBOLX4_1(op2, &bitD2);\n HUF_DECODE_SYMBOLX4_1(op3, &bitD3);\n HUF_DECODE_SYMBOLX4_1(op4, &bitD4);\n HUF_DECODE_SYMBOLX4_2(op1, &bitD1);\n HUF_DECODE_SYMBOLX4_2(op2, &bitD2);\n HUF_DECODE_SYMBOLX4_2(op3, &bitD3);\n HUF_DECODE_SYMBOLX4_2(op4, &bitD4);\n HUF_DECODE_SYMBOLX4_0(op1, &bitD1);\n HUF_DECODE_SYMBOLX4_0(op2, &bitD2);\n HUF_DECODE_SYMBOLX4_0(op3, &bitD3);\n HUF_DECODE_SYMBOLX4_0(op4, &bitD4);\n\n endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);\n }\n\n /* check corruption */\n if (op1 > opStart2) return ERROR(corruption_detected);\n if (op2 > opStart3) return ERROR(corruption_detected);\n if (op3 > opStart4) return ERROR(corruption_detected);\n /* note : op4 supposed already verified within main loop */\n\n /* finish bitStreams one by one */\n HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);\n HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);\n HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);\n HUF_decodeStreamX4(op4, &bitD4, oend, dt, dtLog);\n\n /* check */\n endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);\n if (!endSignal) return ERROR(corruption_detected);\n\n /* decoded size */\n return dstSize;\n }\n}\n\n\nstatic size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)\n{\n HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_MAX_TABLELOG);\n const BYTE* ip = (const BYTE*) cSrc;\n\n size_t hSize = HUF_readDTableX4 (DTable, cSrc, cSrcSize);\n if (HUF_isError(hSize)) return hSize;\n if (hSize >= cSrcSize) return ERROR(srcSize_wrong);\n ip += hSize;\n cSrcSize -= hSize;\n\n return HUF_decompress4X4_usingDTable (dst, dstSize, ip, cSrcSize, DTable);\n}\n\n\n/**********************************/\n/* quad-symbol decoding */\n/**********************************/\ntypedef struct { BYTE nbBits; BYTE nbBytes; } HUF_DDescX6;\ntypedef union { BYTE byte[4]; U32 sequence; } HUF_DSeqX6;\n\n/* recursive, up to level 3; may benefit from

…

Dependencies

Change contents