{"header":{"message":"Reorganising the files","description":null,"timestamp":"2021-09-05T15:33:06.303241274Z","authors":[{}]},"hash":"MHZGMWJEW5YBHXSK77U5TCCGETWCTCQFPFC32H4URMLBTG5WMTAQC","authors":[{"login":"pmeunier","key":"FZQ2g7VfnzLYM4mtTVDk9HAZjA8Jk9ndkwN1icgbtWUr"}],"deps":{"hashes":[["MHZGMWJEW5YBHXSK77U5TCCGETWCTCQFPFC32H4URMLBTG5WMTAQC","Reorganising the files"],["AA",null],["TTRHEUTNPNRDUV6333ODAX4HTAQJ5GP6VEZHDOZLLJPRT7IQQITQC","Changing permissions"],["57ARVVZEGNKP7DI5QGQWSZ22Q5T3YXXVDX2EC7PS5ITAZTLLC7HQC","Adding one more test"],["ZA3236E56J2OSKXR4AWHFBTQTA64RCWMTXVZH65AIC5TK4E3DALQC","Fixing warnings"],["7C44WWMYZJSTATQOQKCS3VXOTUHSJHZPBXPWWLP7S7GWONJBZTJQC","Cleanup + compatibility with previous versions"],["2T5FQPPAY43APQPUMLXCUIT2VOCMDNYZ26OHSGNEZR3KWWXJXXXQC","make_seekable was dereferencing a null pointer"],["HA3ODU4GEQ4X55UDTY3QZUTD557DHTIHH2B5CSMY7YNHOBYQARBQC","Fixing compilation"],["K6L5F26WJMIYPP3Y3CBBUYMAK7C5SVR7NYFNU45NGU5NMDCSJJIQC","Fixing sequential test."],["HEFGMMUMJ2GGJGF2BEKF7EUL24AO53WJTXKBJSEGT64AV3Y4TBZQC","Start oxidizing 1/N"],["6XB4RDRQIINYARVQUO3U3ZG7652UIUXBUF33U7JEJ7ASRI47EKHAC","Adding changes from original impl"],["HELRYMZKHZW4S2IEYXA4IE7VOYYL7FH6TVHGFHJ4J3KRBBLHPQPAC","Manual bindings (Windows and Clang aren't very good friends), and getting rid of anyhow"],["GKNZUJV6XUPOHKZEOOPOWMCYRBTMR36WTLOBEIPWZ55DX6SRUAVAC","Removing unecessary unsafe blocks"],["IB4L4N5M765IYALNZENJRKOGUPBRK2AMAB6IRNWPDCKNKKRMOB5AC","Fixing the lifetimes for `Seekable`"],["SO7DQK4GHRPVOMZ2YKWHUWTZ3XUYKVV5OSIEQSHFX6VTUAPJYKFQC","Minor changes"],["IH334Q5ACWE4TNQYYOOF6GWV6CRXOEM6542NVNPA6HRIZ3CBFKEAC","Reboot"],["UPRY2FELRWZCL5FGUS3EKS2RXEY7D2FGXYGLJWDNJT23PHITRWMAC","Remove bindgen dependency"],["L7S3YSSMT6JCK4A7MCXZDMDEFBP7XJITHFRDMDKJ5L2RDVHI4AHAC","Clippy + rustfmt"],["NOSZA4ZMMICEZS4NPOE66REH2V5AWQLIUIQC7GGIKDWPNBSQFIXQC","Fixing tests"]],"deps":["TTRHEUTNPNRDUV6333ODAX4HTAQJ5GP6VEZHDOZLLJPRT7IQQITQC","57ARVVZEGNKP7DI5QGQWSZ22Q5T3YXXVDX2EC7PS5ITAZTLLC7HQC","ZA3236E56J2OSKXR4AWHFBTQTA64RCWMTXVZH65AIC5TK4E3DALQC","7C44WWMYZJSTATQOQKCS3VXOTUHSJHZPBXPWWLP7S7GWONJBZTJQC","2T5FQPPAY43APQPUMLXCUIT2VOCMDNYZ26OHSGNEZR3KWWXJXXXQC"],"known":["IH334Q5ACWE4TNQYYOOF6GWV6CRXOEM6542NVNPA6HRIZ3CBFKEAC","UPRY2FELRWZCL5FGUS3EKS2RXEY7D2FGXYGLJWDNJT23PHITRWMAC","HELRYMZKHZW4S2IEYXA4IE7VOYYL7FH6TVHGFHJ4J3KRBBLHPQPAC","HEFGMMUMJ2GGJGF2BEKF7EUL24AO53WJTXKBJSEGT64AV3Y4TBZQC","IB4L4N5M765IYALNZENJRKOGUPBRK2AMAB6IRNWPDCKNKKRMOB5AC","HA3ODU4GEQ4X55UDTY3QZUTD557DHTIHH2B5CSMY7YNHOBYQARBQC","K6L5F26WJMIYPP3Y3CBBUYMAK7C5SVR7NYFNU45NGU5NMDCSJJIQC","GKNZUJV6XUPOHKZEOOPOWMCYRBTMR36WTLOBEIPWZ55DX6SRUAVAC","L7S3YSSMT6JCK4A7MCXZDMDEFBP7XJITHFRDMDKJ5L2RDVHI4AHAC","6XB4RDRQIINYARVQUO3U3ZG7652UIUXBUF33U7JEJ7ASRI47EKHAC","NOSZA4ZMMICEZS4NPOE66REH2V5AWQLIUIQC7GGIKDWPNBSQFIXQC","SO7DQK4GHRPVOMZ2YKWHUWTZ3XUYKVV5OSIEQSHFX6VTUAPJYKFQC"]},"hunks":[{"FileDel":{"deleted_names":[{"basename":"zstd","metadata":1005},{"basename":"zstd","metadata":576}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":1,"pos":0},"to":{"change":7,"start":0,"end":6},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":6},"to":{"change":7,"start":7,"end":7},"introduced_by":7},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":1,"pos":0},"to":{"change":2,"start":0,"end":15},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":15},"to":{"change":7,"start":7,"end":7},"introduced_by":2}],"inode":{"change":7,"pos":7}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"contrib","metadata":576},{"basename":"contrib","metadata":1005}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":7},"to":{"change":2,"start":129,"end":147},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":147},"to":{"change":7,"start":204649,"end":204649},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":7},"to":{"change":7,"start":204639,"end":204648},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204648},"to":{"change":7,"start":204649,"end":204649},"introduced_by":7}],"inode":{"change":7,"pos":204649}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"seekable_format","metadata":576},{"basename":"seekable_format","metadata":1005}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204649},"to":{"change":2,"start":148,"end":174},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":174},"to":{"change":7,"start":204668,"end":204668},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204649},"to":{"change":7,"start":204650,"end":204667},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204667},"to":{"change":7,"start":204668,"end":204668},"introduced_by":7}],"inode":{"change":7,"pos":204668}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"zstd_seekable.h","metadata":0},{"basename":"zstd_seekable.h","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":2,"start":239,"end":265},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":265},"to":{"change":7,"start":231272,"end":231272},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":7,"start":231254,"end":231271},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":231271},"to":{"change":7,"start":231272,"end":231272},"introduced_by":7}],"inode":{"change":7,"pos":231272}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":231272},"to":{"change":7,"start":231273,"end":241228},"introduced_by":7}],"inode":{"change":7,"pos":231272}},"content":[{"Del":"#ifndef SEEKABLE_H\n#define SEEKABLE_H\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n#include \n#include \"zstd.h\" /* ZSTDLIB_API */\n\n\n#define ZSTD_seekTableFooterSize 9\n\n#define ZSTD_SEEKABLE_MAGICNUMBER 0x8F92EAB1\n\n#define ZSTD_SEEKABLE_MAXFRAMES 0x8000000U\n\n/* Limit the maximum size to avoid any potential issues storing the compressed size */\n#define ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE 0x80000000U\n\n/*-****************************************************************************\n* Seekable Format\n*\n* The seekable format splits the compressed data into a series of \"frames\",\n* each compressed individually so that decompression of a section in the\n* middle of an archive only requires zstd to decompress at most a frame's\n* worth of extra data, instead of the entire archive.\n******************************************************************************/\n\ntypedef struct ZSTD_seekable_CStream_s ZSTD_seekable_CStream;\ntypedef struct ZSTD_seekable_s ZSTD_seekable;\n\n/*-****************************************************************************\n* Seekable compression - HowTo\n* A ZSTD_seekable_CStream object is required to tracking streaming operation.\n* Use ZSTD_seekable_createCStream() and ZSTD_seekable_freeCStream() to create/\n* release resources.\n*\n* Streaming objects are reusable to avoid allocation and deallocation,\n* to start a new compression operation call ZSTD_seekable_initCStream() on the\n* compressor.\n*\n* Data streamed to the seekable compressor will automatically be split into\n* frames of size `maxFrameSize` (provided in ZSTD_seekable_initCStream()),\n* or if none is provided, will be cut off whenever ZSTD_seekable_endFrame() is\n* called or when the default maximum frame size (2GB) is reached.\n*\n* Use ZSTD_seekable_initCStream() to initialize a ZSTD_seekable_CStream object\n* for a new compression operation.\n* `maxFrameSize` indicates the size at which to automatically start a new\n* seekable frame. `maxFrameSize == 0` implies the default maximum size.\n* `checksumFlag` indicates whether or not the seek table should include frame\n* checksums on the uncompressed data for verification.\n* @return : a size hint for input to provide for compression, or an error code\n* checkable with ZSTD_isError()\n*\n* Use ZSTD_seekable_compressStream() repetitively to consume input stream.\n* The function will automatically update both `pos` fields.\n* Note that it may not consume the entire input, in which case `pos < size`,\n* and it's up to the caller to present again remaining data.\n* @return : a size hint, preferred nb of bytes to use as input for next\n* function call or an error code, which can be tested using\n* ZSTD_isError().\n* Note 1 : it's just a hint, to help latency a little, any other\n* value will work fine.\n*\n* At any time, call ZSTD_seekable_endFrame() to end the current frame and\n* start a new one.\n*\n* ZSTD_seekable_endStream() will end the current frame, and then write the seek\n* table so that decompressors can efficiently find compressed frames.\n* ZSTD_seekable_endStream() may return a number > 0 if it was unable to flush\n* all the necessary data to `output`. In this case, it should be called again\n* until all remaining data is flushed out and 0 is returned.\n******************************************************************************/\n\n/*===== Seekable compressor management =====*/\nZSTDLIB_API ZSTD_seekable_CStream* ZSTD_seekable_createCStream(void);\nZSTDLIB_API size_t ZSTD_seekable_freeCStream(ZSTD_seekable_CStream* zcs);\n\n/*===== Seekable compression functions =====*/\nZSTDLIB_API size_t ZSTD_seekable_initCStream(ZSTD_seekable_CStream* zcs, int compressionLevel, int checksumFlag, unsigned maxFrameSize);\nZSTDLIB_API size_t ZSTD_seekable_compressStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);\nZSTDLIB_API size_t ZSTD_seekable_endFrame(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output);\nZSTDLIB_API size_t ZSTD_seekable_endStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output);\n\n/*= Raw seek table API\n * These functions allow for the seek table to be constructed directly.\n * This table can then be appended to a file of concatenated frames.\n * This allows the frames to be compressed independently, even in parallel,\n * and compiled together afterward into a seekable archive.\n *\n * Use ZSTD_seekable_createFrameLog() to allocate and initialize a tracking\n * structure.\n *\n * Call ZSTD_seekable_logFrame() once for each frame in the archive.\n * checksum is optional, and will not be used if checksumFlag was 0 when the\n * frame log was created. If present, it should be the least significant 32\n * bits of the XXH64 hash of the uncompressed data.\n *\n * Call ZSTD_seekable_writeSeekTable to serialize the data into a seek table.\n * If the entire table was written, the return value will be 0. Otherwise,\n * it will be equal to the number of bytes left to write. */\ntypedef struct ZSTD_frameLog_s ZSTD_frameLog;\nZSTDLIB_API ZSTD_frameLog* ZSTD_seekable_createFrameLog(int checksumFlag);\nZSTDLIB_API size_t ZSTD_seekable_freeFrameLog(ZSTD_frameLog* fl);\nZSTDLIB_API size_t ZSTD_seekable_logFrame(ZSTD_frameLog* fl, unsigned compressedSize, unsigned decompressedSize, unsigned checksum);\nZSTDLIB_API size_t ZSTD_seekable_writeSeekTable(ZSTD_frameLog* fl, ZSTD_outBuffer* output);\n\n/*-****************************************************************************\n* Seekable decompression - HowTo\n* A ZSTD_seekable object is required to tracking the seekTable.\n*\n* Call ZSTD_seekable_init* to initialize a ZSTD_seekable object with the\n* the seek table provided in the input.\n* There are three modes for ZSTD_seekable_init:\n* - ZSTD_seekable_initBuff() : An in-memory API. The data contained in\n* `src` should be the entire seekable file, including the seek table.\n* `src` should be kept alive and unmodified until the ZSTD_seekable object\n* is freed or reset.\n* - ZSTD_seekable_initFile() : A simplified file API using stdio. fread and\n* fseek will be used to access the required data for building the seek\n* table and doing decompression operations. `src` should not be closed\n* or modified until the ZSTD_seekable object is freed or reset.\n* - ZSTD_seekable_initAdvanced() : A general API allowing the client to\n* provide its own read and seek callbacks.\n* + ZSTD_seekable_read() : read exactly `n` bytes into `buffer`.\n* Premature EOF should be treated as an error.\n* + ZSTD_seekable_seek() : seek the read head to `offset` from `origin`,\n* where origin is either SEEK_SET (beginning of\n* file), or SEEK_END (end of file).\n* Both functions should return a non-negative value in case of success, and a\n* negative value in case of failure. If implementing using this API and\n* stdio, be careful with files larger than 4GB and fseek. All of these\n* functions return an error code checkable with ZSTD_isError().\n*\n* Call ZSTD_seekable_decompress to decompress `dstSize` bytes at decompressed\n* offset `offset`. ZSTD_seekable_decompress may have to decompress the entire\n* prefix of the frame before the desired data if it has not already processed\n* this section. If ZSTD_seekable_decompress is called multiple times for a\n* consecutive range of data, it will efficiently retain the decompressor object\n* and avoid redecompressing frame prefixes. The return value is the number of\n* bytes decompressed, or an error code checkable with ZSTD_isError().\n*\n* The seek table access functions can be used to obtain the data contained\n* in the seek table. If frameIndex is larger than the value returned by\n* ZSTD_seekable_getNumFrames(), they will return error codes checkable with\n* ZSTD_isError(). Note that since the offset access functions return\n* unsigned long long instead of size_t, in this case they will instead return\n* the value ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE.\n******************************************************************************/\n\n/*===== Seekable decompressor management =====*/\nZSTDLIB_API ZSTD_seekable* ZSTD_seekable_create(void);\nZSTDLIB_API size_t ZSTD_seekable_free(ZSTD_seekable* zs);\n\n/*===== Seekable decompression functions =====*/\nZSTDLIB_API size_t ZSTD_seekable_initBuff(ZSTD_seekable* zs, const void* src, size_t srcSize);\nZSTDLIB_API size_t ZSTD_seekable_initFile(ZSTD_seekable* zs, FILE* src);\nZSTDLIB_API size_t ZSTD_seekable_decompress(ZSTD_seekable* zs, void* dst, size_t dstSize, unsigned long long offset);\nZSTDLIB_API size_t ZSTD_seekable_decompressFrame(ZSTD_seekable* zs, void* dst, size_t dstSize, unsigned frameIndex);\n\n#define ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE (0ULL-2)\n/*===== Seek Table access functions =====*/\nZSTDLIB_API unsigned ZSTD_seekable_getNumFrames(ZSTD_seekable* const zs);\nZSTDLIB_API unsigned long long ZSTD_seekable_getFrameCompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex);\nZSTDLIB_API unsigned long long ZSTD_seekable_getFrameDecompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex);\nZSTDLIB_API size_t ZSTD_seekable_getFrameCompressedSize(ZSTD_seekable* const zs, unsigned frameIndex);\nZSTDLIB_API size_t ZSTD_seekable_getFrameDecompressedSize(ZSTD_seekable* const zs, unsigned frameIndex);\nZSTDLIB_API unsigned ZSTD_seekable_offsetToFrameIndex(ZSTD_seekable* const zs, unsigned long long offset);\n\n/*===== Seekable advanced I/O API =====*/\ntypedef int(ZSTD_seekable_read)(void* opaque, void* buffer, size_t n);\ntypedef int(ZSTD_seekable_seek)(void* opaque, long long offset, int origin);\ntypedef struct {\n void* opaque;\n ZSTD_seekable_read* read;\n ZSTD_seekable_seek* seek;\n} ZSTD_seekable_customFile;\nZSTDLIB_API size_t ZSTD_seekable_initAdvanced(ZSTD_seekable* zs, ZSTD_seekable_customFile src);\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstdseek_compress.c","metadata":0},{"basename":"zstdseek_compress.c","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":2,"start":208,"end":238},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":238},"to":{"change":7,"start":220433,"end":220433},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":7,"start":220411,"end":220432},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":220432},"to":{"change":7,"start":220433,"end":220433},"introduced_by":7}],"inode":{"change":7,"pos":220433}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":220433},"to":{"change":7,"start":220434,"end":231253},"introduced_by":7}],"inode":{"change":7,"pos":220433}},"content":[{"Del":"/*\n * Copyright (c) 2017-present, Facebook, Inc.\n * 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 */\n\n#include /* malloc, free */\n#include /* UINT_MAX */\n#include \n\n#define XXH_STATIC_LINKING_ONLY\n// #define XXH_NAMESPACE ZSTD_\n#include \"xxhash.h\"\n\n#define ZSTD_STATIC_LINKING_ONLY\n#include \"zstd.h\"\n#include \"zstd_errors.h\"\n#include \"mem.h\"\n#include \"zstd_seekable.h\"\n\n#define CHECK_Z(f) { size_t const ret = (f); if (ret != 0) return ret; }\n\n#undef ERROR\n#define ERROR(name) ((size_t)-ZSTD_error_##name)\n\n#undef MIN\n#undef MAX\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n\ntypedef struct {\n U32 cSize;\n U32 dSize;\n U32 checksum;\n} framelogEntry_t;\n\nstruct ZSTD_frameLog_s {\n framelogEntry_t* entries;\n U32 size;\n U32 capacity;\n\n int checksumFlag;\n\n /* for use when streaming out the seek table */\n U32 seekTablePos;\n U32 seekTableIndex;\n} framelog_t;\n\nstruct ZSTD_seekable_CStream_s {\n ZSTD_CStream* cstream;\n ZSTD_frameLog framelog;\n\n U32 frameCSize;\n U32 frameDSize;\n\n XXH64_state_t xxhState;\n\n U32 maxFrameSize;\n\n int writingSeekTable;\n};\n\nsize_t ZSTD_seekable_frameLog_allocVec(ZSTD_frameLog* fl)\n{\n /* allocate some initial space */\n size_t const FRAMELOG_STARTING_CAPACITY = 16;\n fl->entries = (framelogEntry_t*)malloc(\n sizeof(framelogEntry_t) * FRAMELOG_STARTING_CAPACITY);\n if (fl->entries == NULL) return ERROR(memory_allocation);\n fl->capacity = FRAMELOG_STARTING_CAPACITY;\n\n return 0;\n}\n\nsize_t ZSTD_seekable_frameLog_freeVec(ZSTD_frameLog* fl)\n{\n if (fl != NULL) free(fl->entries);\n return 0;\n}\n\nZSTD_frameLog* ZSTD_seekable_createFrameLog(int checksumFlag)\n{\n ZSTD_frameLog* fl = malloc(sizeof(ZSTD_frameLog));\n if (fl == NULL) return NULL;\n\n if (ZSTD_isError(ZSTD_seekable_frameLog_allocVec(fl))) {\n free(fl);\n return NULL;\n }\n\n fl->checksumFlag = checksumFlag;\n fl->seekTablePos = 0;\n fl->seekTableIndex = 0;\n fl->size = 0;\n\n return fl;\n}\n\nsize_t ZSTD_seekable_freeFrameLog(ZSTD_frameLog* fl)\n{\n ZSTD_seekable_frameLog_freeVec(fl);\n free(fl);\n return 0;\n}\n\nZSTD_seekable_CStream* ZSTD_seekable_createCStream()\n{\n ZSTD_seekable_CStream* zcs = malloc(sizeof(ZSTD_seekable_CStream));\n\n if (zcs == NULL) return NULL;\n\n memset(zcs, 0, sizeof(*zcs));\n\n zcs->cstream = ZSTD_createCStream();\n if (zcs->cstream == NULL) goto failed1;\n\n if (ZSTD_isError(ZSTD_seekable_frameLog_allocVec(&zcs->framelog))) goto failed2;\n\n return zcs;\n\nfailed2:\n ZSTD_freeCStream(zcs->cstream);\nfailed1:\n free(zcs);\n return NULL;\n}\n\nsize_t ZSTD_seekable_freeCStream(ZSTD_seekable_CStream* zcs)\n{\n if (zcs == NULL) return 0; /* support free on null */\n ZSTD_freeCStream(zcs->cstream);\n ZSTD_seekable_frameLog_freeVec(&zcs->framelog);\n free(zcs);\n\n return 0;\n}\n\nsize_t ZSTD_seekable_initCStream(ZSTD_seekable_CStream* zcs,\n int compressionLevel,\n int checksumFlag,\n unsigned maxFrameSize)\n{\n zcs->framelog.size = 0;\n zcs->frameCSize = 0;\n zcs->frameDSize = 0;\n\n /* make sure maxFrameSize has a reasonable value */\n if (maxFrameSize > ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE) {\n return ERROR(frameParameter_unsupported);\n }\n\n zcs->maxFrameSize = maxFrameSize\n ? maxFrameSize\n : ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE;\n\n zcs->framelog.checksumFlag = checksumFlag;\n if (zcs->framelog.checksumFlag) {\n XXH64_reset(&zcs->xxhState, 0);\n }\n\n zcs->framelog.seekTablePos = 0;\n zcs->framelog.seekTableIndex = 0;\n zcs->writingSeekTable = 0;\n\n return ZSTD_initCStream(zcs->cstream, compressionLevel);\n}\n\nsize_t ZSTD_seekable_logFrame(ZSTD_frameLog* fl,\n unsigned compressedSize,\n unsigned decompressedSize,\n unsigned checksum)\n{\n if (fl->size == ZSTD_SEEKABLE_MAXFRAMES)\n return ERROR(frameIndex_tooLarge);\n\n /* grow the buffer if required */\n if (fl->size == fl->capacity) {\n /* exponential size increase for constant amortized runtime */\n size_t const newCapacity = fl->capacity * 2;\n framelogEntry_t* const newEntries = realloc(fl->entries,\n sizeof(framelogEntry_t) * newCapacity);\n\n if (newEntries == NULL) return ERROR(memory_allocation);\n\n fl->entries = newEntries;\n assert(newCapacity <= UINT_MAX);\n fl->capacity = (U32)newCapacity;\n }\n\n fl->entries[fl->size] = (framelogEntry_t){\n compressedSize, decompressedSize, checksum\n };\n fl->size++;\n\n return 0;\n}\n\nsize_t ZSTD_seekable_endFrame(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output)\n{\n size_t const prevOutPos = output->pos;\n /* end the frame */\n size_t ret = ZSTD_endStream(zcs->cstream, output);\n\n zcs->frameCSize += output->pos - prevOutPos;\n\n /* need to flush before doing the rest */\n if (ret) return ret;\n\n /* frame done */\n\n /* store the frame data for later */\n ret = ZSTD_seekable_logFrame(\n &zcs->framelog, zcs->frameCSize, zcs->frameDSize,\n zcs->framelog.checksumFlag\n ? XXH64_digest(&zcs->xxhState) & 0xFFFFFFFFU\n : 0);\n if (ret) return ret;\n\n /* reset for the next frame */\n zcs->frameCSize = 0;\n zcs->frameDSize = 0;\n\n ZSTD_resetCStream(zcs->cstream, 0);\n if (zcs->framelog.checksumFlag)\n XXH64_reset(&zcs->xxhState, 0);\n\n return 0;\n}\n\nsize_t ZSTD_seekable_compressStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)\n{\n const BYTE* const inBase = (const BYTE*) input->src + input->pos;\n size_t inLen = input->size - input->pos;\n\n inLen = MIN(inLen, (size_t)(zcs->maxFrameSize - zcs->frameDSize));\n\n /* if we haven't finished flushing the last frame, don't start writing a new one */\n if (inLen > 0) {\n ZSTD_inBuffer inTmp = { inBase, inLen, 0 };\n size_t const prevOutPos = output->pos;\n\n size_t const ret = ZSTD_compressStream(zcs->cstream, output, &inTmp);\n\n if (zcs->framelog.checksumFlag) {\n XXH64_update(&zcs->xxhState, inBase, inTmp.pos);\n }\n\n zcs->frameCSize += output->pos - prevOutPos;\n zcs->frameDSize += inTmp.pos;\n\n input->pos += inTmp.pos;\n\n if (ZSTD_isError(ret)) return ret;\n }\n\n if (zcs->maxFrameSize == zcs->frameDSize) {\n /* log the frame and start over */\n size_t const ret = ZSTD_seekable_endFrame(zcs, output);\n if (ZSTD_isError(ret)) return ret;\n\n /* get the client ready for the next frame */\n return (size_t)zcs->maxFrameSize;\n }\n\n return (size_t)(zcs->maxFrameSize - zcs->frameDSize);\n}\n\nstatic inline size_t ZSTD_seekable_seekTableSize(const ZSTD_frameLog* fl)\n{\n size_t const sizePerFrame = 8 + (fl->checksumFlag?4:0);\n size_t const seekTableLen = ZSTD_SKIPPABLEHEADERSIZE +\n sizePerFrame * fl->size +\n ZSTD_seekTableFooterSize;\n\n return seekTableLen;\n}\n\nstatic inline size_t ZSTD_stwrite32(ZSTD_frameLog* fl,\n ZSTD_outBuffer* output, U32 const value,\n U32 const offset)\n{\n if (fl->seekTablePos < offset + 4) {\n BYTE tmp[4]; /* so that we can work with buffers too small to write a whole word to */\n size_t const lenWrite =\n MIN(output->size - output->pos, offset + 4 - fl->seekTablePos);\n MEM_writeLE32(tmp, value);\n memcpy((BYTE*)output->dst + output->pos,\n tmp + (fl->seekTablePos - offset), lenWrite);\n output->pos += lenWrite;\n fl->seekTablePos += lenWrite;\n\n if (lenWrite < 4) return ZSTD_seekable_seekTableSize(fl) - fl->seekTablePos;\n }\n return 0;\n}\n\nsize_t ZSTD_seekable_writeSeekTable(ZSTD_frameLog* fl, ZSTD_outBuffer* output)\n{\n /* seekTableIndex: the current index in the table and\n * seekTableSize: the amount of the table written so far\n *\n * This function is written this way so that if it has to return early\n * because of a small buffer, it can keep going where it left off.\n */\n\n size_t const sizePerFrame = 8 + (fl->checksumFlag?4:0);\n size_t const seekTableLen = ZSTD_seekable_seekTableSize(fl);\n\n CHECK_Z(ZSTD_stwrite32(fl, output, ZSTD_MAGIC_SKIPPABLE_START | 0xE, 0));\n assert(seekTableLen <= (size_t)UINT_MAX);\n CHECK_Z(ZSTD_stwrite32(fl, output, (U32)seekTableLen - ZSTD_SKIPPABLEHEADERSIZE, 4));\n\n while (fl->seekTableIndex < fl->size) {\n unsigned long long const start = ZSTD_SKIPPABLEHEADERSIZE + sizePerFrame * fl->seekTableIndex;\n assert(start + 8 <= UINT_MAX);\n CHECK_Z(ZSTD_stwrite32(fl, output,\n fl->entries[fl->seekTableIndex].cSize,\n (U32)start + 0));\n\n CHECK_Z(ZSTD_stwrite32(fl, output,\n fl->entries[fl->seekTableIndex].dSize,\n (U32)start + 4));\n\n if (fl->checksumFlag) {\n CHECK_Z(ZSTD_stwrite32(\n fl, output, fl->entries[fl->seekTableIndex].checksum,\n (U32)start + 8));\n }\n\n fl->seekTableIndex++;\n }\n\n assert(seekTableLen <= UINT_MAX);\n CHECK_Z(ZSTD_stwrite32(fl, output, fl->size,\n (U32)seekTableLen - ZSTD_seekTableFooterSize));\n\n if (output->size - output->pos < 1) return seekTableLen - fl->seekTablePos;\n if (fl->seekTablePos < seekTableLen - 4) {\n BYTE sfd = 0;\n sfd |= (fl->checksumFlag) << 7;\n\n ((BYTE*)output->dst)[output->pos] = sfd;\n output->pos++;\n fl->seekTablePos++;\n }\n\n CHECK_Z(ZSTD_stwrite32(fl, output, ZSTD_SEEKABLE_MAGICNUMBER,\n (U32)seekTableLen - 4));\n\n if (fl->seekTablePos != seekTableLen) return ERROR(GENERIC);\n return 0;\n}\n\nsize_t ZSTD_seekable_endStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output)\n{\n if (!zcs->writingSeekTable && zcs->frameDSize) {\n const size_t endFrame = ZSTD_seekable_endFrame(zcs, output);\n if (ZSTD_isError(endFrame)) return endFrame;\n /* return an accurate size hint */\n if (endFrame) return endFrame + ZSTD_seekable_seekTableSize(&zcs->framelog);\n }\n\n zcs->writingSeekTable = 1;\n\n return ZSTD_seekable_writeSeekTable(&zcs->framelog, output);\n}\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstdseek_decompress.c","metadata":0},{"basename":"zstdseek_decompress.c","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":2,"start":175,"end":207},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":207},"to":{"change":7,"start":204693,"end":204693},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204668},"to":{"change":7,"start":204669,"end":204692},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":204692},"to":{"change":7,"start":204693,"end":204693},"introduced_by":7}],"inode":{"change":7,"pos":204693}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":204693},"to":{"change":7,"start":204694,"end":220410},"introduced_by":7}],"inode":{"change":7,"pos":204693}},"content":[{"Del":"/*\n * Copyright (c) 2017-present, Facebook, Inc.\n * 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* Turn on Large Files support (>4GB) for 32-bit Linux/Unix\n***********************************************************/\n#if !defined(__64BIT__) || defined(__MINGW32__) /* No point defining Large file for 64 bit but MinGW-w64 requires it */\n# if !defined(_FILE_OFFSET_BITS)\n# define _FILE_OFFSET_BITS 64 /* turn off_t into a 64-bit type for ftello, fseeko */\n# endif\n# if !defined(_LARGEFILE_SOURCE) /* obsolete macro, replaced with _FILE_OFFSET_BITS */\n# define _LARGEFILE_SOURCE 1 /* Large File Support extension (LFS) - fseeko, ftello */\n# endif\n# if defined(_AIX) || defined(__hpux)\n# define _LARGE_FILES /* Large file support on 32-bits AIX and HP-UX */\n# endif\n#endif\n\n/* ************************************************************\n* Avoid fseek()'s 2GiB barrier with MSVC, macOS, *BSD, MinGW\n***************************************************************/\n#if defined(_MSC_VER) && _MSC_VER >= 1400\n# define LONG_SEEK _fseeki64\n#elif !defined(__64BIT__) && (PLATFORM_POSIX_VERSION >= 200112L) /* No point defining Large file for 64 bit */\n# define LONG_SEEK fseeko\n#elif defined(__MINGW32__) && !defined(__STRICT_ANSI__) && !defined(__NO_MINGW_LFS) && defined(__MSVCRT__)\n# define LONG_SEEK fseeko64\n#elif defined(_WIN32) && !defined(__DJGPP__)\n# include \n static int LONG_SEEK(FILE* file, __int64 offset, int origin) {\n LARGE_INTEGER off;\n DWORD method;\n off.QuadPart = offset;\n if (origin == SEEK_END)\n method = FILE_END;\n else if (origin == SEEK_CUR)\n method = FILE_CURRENT;\n else\n method = FILE_BEGIN;\n\n if (SetFilePointerEx((HANDLE) _get_osfhandle(_fileno(file)), off, NULL, method))\n return 0;\n else\n return -1;\n }\n#else\n# define LONG_SEEK fseek\n#endif\n\n#include /* malloc, free */\n#include /* FILE* */\n#include /* UNIT_MAX */\n#include \n\n#define XXH_STATIC_LINKING_ONLY\n// #define XXH_NAMESPACE ZSTD_\n#include \"xxhash.h\"\n\n#define ZSTD_STATIC_LINKING_ONLY\n#include \"zstd.h\"\n#include \"zstd_errors.h\"\n#include \"mem.h\"\n#include \"zstd_seekable.h\"\n\n#undef ERROR\n#define ERROR(name) ((size_t)-ZSTD_error_##name)\n\n#define CHECK_IO(f) { int const errcod = (f); if (errcod < 0) return ERROR(seekableIO); }\n\n#undef MIN\n#undef MAX\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n\n/* Special-case callbacks for FILE* and in-memory modes, so that we can treat\n * them the same way as the advanced API */\nstatic int ZSTD_seekable_read_FILE(void* opaque, void* buffer, size_t n)\n{\n size_t const result = fread(buffer, 1, n, (FILE*)opaque);\n if (result != n) {\n return -1;\n }\n return 0;\n}\n\nstatic int ZSTD_seekable_seek_FILE(void* opaque, long long offset, int origin)\n{\n int const ret = LONG_SEEK((FILE*)opaque, offset, origin);\n if (ret) return ret;\n return fflush((FILE*)opaque);\n}\n\ntypedef struct {\n const void *ptr;\n size_t size;\n size_t pos;\n} buffWrapper_t;\n\nstatic int ZSTD_seekable_read_buff(void* opaque, void* buffer, size_t n)\n{\n buffWrapper_t* buff = (buffWrapper_t*) opaque;\n if (buff->pos + n > buff->size) return -1;\n memcpy(buffer, (const BYTE*)buff->ptr + buff->pos, n);\n buff->pos += n;\n return 0;\n}\n\nstatic int ZSTD_seekable_seek_buff(void* opaque, long long offset, int origin)\n{\n buffWrapper_t* const buff = (buffWrapper_t*) opaque;\n unsigned long long newOffset;\n switch (origin) {\n case SEEK_SET:\n newOffset = offset;\n break;\n case SEEK_CUR:\n newOffset = (unsigned long long)buff->pos + offset;\n break;\n case SEEK_END:\n newOffset = (unsigned long long)buff->size + offset;\n break;\n default:\n assert(0); /* not possible */\n }\n if (newOffset > buff->size) {\n return -1;\n }\n buff->pos = newOffset;\n return 0;\n}\n\ntypedef struct {\n U64 cOffset;\n U64 dOffset;\n U32 checksum;\n} seekEntry_t;\n\ntypedef struct {\n seekEntry_t* entries;\n size_t tableLen;\n\n int checksumFlag;\n} seekTable_t;\n\n#define SEEKABLE_BUFF_SIZE ZSTD_BLOCKSIZE_MAX\n\nstruct ZSTD_seekable_s {\n ZSTD_DStream* dstream;\n seekTable_t seekTable;\n ZSTD_seekable_customFile src;\n\n U64 decompressedOffset;\n U32 curFrame;\n\n BYTE inBuff[SEEKABLE_BUFF_SIZE]; /* need to do our own input buffering */\n BYTE outBuff[SEEKABLE_BUFF_SIZE]; /* so we can efficiently decompress the\n starts of chunks before we get to the\n desired section */\n ZSTD_inBuffer in; /* maintain continuity across ZSTD_seekable_decompress operations */\n buffWrapper_t buffWrapper; /* for `src.opaque` in in-memory mode */\n\n XXH64_state_t xxhState;\n};\n\nZSTD_seekable* ZSTD_seekable_create(void)\n{\n ZSTD_seekable* zs = malloc(sizeof(ZSTD_seekable));\n\n if (zs == NULL) return NULL;\n\n /* also initializes stage to zsds_init */\n memset(zs, 0, sizeof(*zs));\n\n zs->dstream = ZSTD_createDStream();\n if (zs->dstream == NULL) {\n free(zs);\n return NULL;\n }\n\n return zs;\n}\n\nsize_t ZSTD_seekable_free(ZSTD_seekable* zs)\n{\n if (zs == NULL) return 0; /* support free on null */\n ZSTD_freeDStream(zs->dstream);\n free(zs->seekTable.entries);\n free(zs);\n\n return 0;\n}\n\n/** ZSTD_seekable_offsetToFrameIndex() :\n * Performs a binary search to find the last frame with a decompressed offset\n * <= pos\n * @return : the frame's index */\nunsigned ZSTD_seekable_offsetToFrameIndex(ZSTD_seekable* const zs, unsigned long long pos)\n{\n U32 lo = 0;\n U32 hi = (U32)zs->seekTable.tableLen;\n assert(zs->seekTable.tableLen <= UINT_MAX);\n\n if (pos >= zs->seekTable.entries[zs->seekTable.tableLen].dOffset) {\n return (U32)zs->seekTable.tableLen;\n }\n\n while (lo + 1 < hi) {\n U32 const mid = lo + ((hi - lo) >> 1);\n if (zs->seekTable.entries[mid].dOffset <= pos) {\n lo = mid;\n } else {\n hi = mid;\n }\n }\n return lo;\n}\n\nunsigned ZSTD_seekable_getNumFrames(ZSTD_seekable* const zs)\n{\n assert(zs->seekTable.tableLen <= UINT_MAX);\n return (unsigned)zs->seekTable.tableLen;\n}\n\nunsigned long long ZSTD_seekable_getFrameCompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex)\n{\n if (frameIndex >= zs->seekTable.tableLen) return ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE;\n return zs->seekTable.entries[frameIndex].cOffset;\n}\n\nunsigned long long ZSTD_seekable_getFrameDecompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex)\n{\n if (frameIndex >= zs->seekTable.tableLen) return ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE;\n return zs->seekTable.entries[frameIndex].dOffset;\n}\n\nsize_t ZSTD_seekable_getFrameCompressedSize(ZSTD_seekable* const zs, unsigned frameIndex)\n{\n if (frameIndex >= zs->seekTable.tableLen) return ERROR(frameIndex_tooLarge);\n return zs->seekTable.entries[frameIndex + 1].cOffset -\n zs->seekTable.entries[frameIndex].cOffset;\n}\n\nsize_t ZSTD_seekable_getFrameDecompressedSize(ZSTD_seekable* const zs, unsigned frameIndex)\n{\n if (frameIndex > zs->seekTable.tableLen) return ERROR(frameIndex_tooLarge);\n return zs->seekTable.entries[frameIndex + 1].dOffset -\n zs->seekTable.entries[frameIndex].dOffset;\n}\n\nstatic size_t ZSTD_seekable_loadSeekTable(ZSTD_seekable* zs)\n{\n int checksumFlag;\n ZSTD_seekable_customFile src = zs->src;\n /* read the footer, fixed size */\n CHECK_IO(src.seek(src.opaque, -(int)ZSTD_seekTableFooterSize, SEEK_END));\n CHECK_IO(src.read(src.opaque, zs->inBuff, ZSTD_seekTableFooterSize));\n\n if (MEM_readLE32(zs->inBuff + 5) != ZSTD_SEEKABLE_MAGICNUMBER) {\n return ERROR(prefix_unknown);\n }\n\n { BYTE const sfd = zs->inBuff[4];\n checksumFlag = sfd >> 7;\n\n /* check reserved bits */\n if ((checksumFlag >> 2) & 0x1f) {\n return ERROR(corruption_detected);\n }\n }\n\n { U32 const numFrames = MEM_readLE32(zs->inBuff);\n U32 const sizePerEntry = 8 + (checksumFlag?4:0);\n U32 const tableSize = sizePerEntry * numFrames;\n U32 const frameSize = tableSize + ZSTD_seekTableFooterSize + ZSTD_SKIPPABLEHEADERSIZE;\n\n U32 remaining = frameSize - ZSTD_seekTableFooterSize; /* don't need to re-read footer */\n {\n U32 const toRead = MIN(remaining, SEEKABLE_BUFF_SIZE);\n\n CHECK_IO(src.seek(src.opaque, -(S64)frameSize, SEEK_END));\n CHECK_IO(src.read(src.opaque, zs->inBuff, toRead));\n\n remaining -= toRead;\n }\n\n if (MEM_readLE32(zs->inBuff) != (ZSTD_MAGIC_SKIPPABLE_START | 0xE)) {\n return ERROR(prefix_unknown);\n }\n if (MEM_readLE32(zs->inBuff+4) + ZSTD_SKIPPABLEHEADERSIZE != frameSize) {\n return ERROR(prefix_unknown);\n }\n\n { /* Allocate an extra entry at the end so that we can do size\n * computations on the last element without special case */\n seekEntry_t* entries = (seekEntry_t*)malloc(sizeof(seekEntry_t) * (numFrames + 1));\n\n U32 idx = 0;\n U32 pos = 8;\n\n\n U64 cOffset = 0;\n U64 dOffset = 0;\n\n if (!entries) {\n free(entries);\n return ERROR(memory_allocation);\n }\n\n /* compute cumulative positions */\n for (; idx < numFrames; idx++) {\n if (pos + sizePerEntry > SEEKABLE_BUFF_SIZE) {\n U32 const offset = SEEKABLE_BUFF_SIZE - pos;\n U32 const toRead = MIN(remaining, SEEKABLE_BUFF_SIZE - offset);\n memmove(zs->inBuff, zs->inBuff + pos, offset); /* move any data we haven't read yet */\n CHECK_IO(src.read(src.opaque, zs->inBuff+offset, toRead));\n remaining -= toRead;\n pos = 0;\n }\n entries[idx].cOffset = cOffset;\n entries[idx].dOffset = dOffset;\n\n cOffset += MEM_readLE32(zs->inBuff + pos);\n pos += 4;\n dOffset += MEM_readLE32(zs->inBuff + pos);\n pos += 4;\n if (checksumFlag) {\n entries[idx].checksum = MEM_readLE32(zs->inBuff + pos);\n pos += 4;\n }\n }\n entries[numFrames].cOffset = cOffset;\n entries[numFrames].dOffset = dOffset;\n\n zs->seekTable.entries = entries;\n zs->seekTable.tableLen = numFrames;\n zs->seekTable.checksumFlag = checksumFlag;\n return 0;\n }\n }\n}\n\nsize_t ZSTD_seekable_initBuff(ZSTD_seekable* zs, const void* src, size_t srcSize)\n{\n zs->buffWrapper = (buffWrapper_t){src, srcSize, 0};\n { ZSTD_seekable_customFile srcFile = {&zs->buffWrapper,\n &ZSTD_seekable_read_buff,\n &ZSTD_seekable_seek_buff};\n return ZSTD_seekable_initAdvanced(zs, srcFile); }\n}\n\nsize_t ZSTD_seekable_initFile(ZSTD_seekable* zs, FILE* src)\n{\n ZSTD_seekable_customFile srcFile = {src, &ZSTD_seekable_read_FILE,\n &ZSTD_seekable_seek_FILE};\n return ZSTD_seekable_initAdvanced(zs, srcFile);\n}\n\nsize_t ZSTD_seekable_initAdvanced(ZSTD_seekable* zs, ZSTD_seekable_customFile src)\n{\n zs->src = src;\n\n { const size_t seekTableInit = ZSTD_seekable_loadSeekTable(zs);\n if (ZSTD_isError(seekTableInit)) return seekTableInit; }\n\n zs->decompressedOffset = (U64)-1;\n zs->curFrame = (U32)-1;\n\n { const size_t dstreamInit = ZSTD_initDStream(zs->dstream);\n if (ZSTD_isError(dstreamInit)) return dstreamInit; }\n return 0;\n}\n\nsize_t ZSTD_seekable_decompress(ZSTD_seekable* zs, void* dst, size_t len, unsigned long long offset)\n{\n U32 targetFrame = ZSTD_seekable_offsetToFrameIndex(zs, offset);\n do {\n /* check if we can continue from a previous decompress job */\n if (targetFrame != zs->curFrame || offset != zs->decompressedOffset) {\n zs->decompressedOffset = zs->seekTable.entries[targetFrame].dOffset;\n zs->curFrame = targetFrame;\n\n CHECK_IO(zs->src.seek(zs->src.opaque,\n zs->seekTable.entries[targetFrame].cOffset,\n SEEK_SET));\n zs->in = (ZSTD_inBuffer){zs->inBuff, 0, 0};\n XXH64_reset(&zs->xxhState, 0);\n ZSTD_resetDStream(zs->dstream);\n }\n\n while (zs->decompressedOffset < offset + len) {\n size_t toRead;\n ZSTD_outBuffer outTmp;\n size_t prevOutPos;\n if (zs->decompressedOffset < offset) {\n /* dummy decompressions until we get to the target offset */\n outTmp = (ZSTD_outBuffer){zs->outBuff, MIN(SEEKABLE_BUFF_SIZE, offset - zs->decompressedOffset), 0};\n } else {\n outTmp = (ZSTD_outBuffer){dst, len, zs->decompressedOffset - offset};\n }\n\n prevOutPos = outTmp.pos;\n toRead = ZSTD_decompressStream(zs->dstream, &outTmp, &zs->in);\n if (ZSTD_isError(toRead)) {\n return toRead;\n }\n\n if (zs->seekTable.checksumFlag) {\n XXH64_update(&zs->xxhState, (BYTE*)outTmp.dst + prevOutPos,\n outTmp.pos - prevOutPos);\n }\n zs->decompressedOffset += outTmp.pos - prevOutPos;\n\n if (toRead == 0) {\n /* frame complete */\n\n /* verify checksum */\n if (zs->seekTable.checksumFlag &&\n (XXH64_digest(&zs->xxhState) & 0xFFFFFFFFU) !=\n zs->seekTable.entries[targetFrame].checksum) {\n return ERROR(corruption_detected);\n }\n\n if (zs->decompressedOffset < offset + len) {\n /* go back to the start and force a reset of the stream */\n targetFrame = ZSTD_seekable_offsetToFrameIndex(zs, zs->decompressedOffset);\n }\n break;\n }\n\n /* read in more data if we're done with this buffer */\n if (zs->in.pos == zs->in.size) {\n toRead = MIN(toRead, SEEKABLE_BUFF_SIZE);\n CHECK_IO(zs->src.read(zs->src.opaque, zs->inBuff, toRead));\n zs->in.size = toRead;\n zs->in.pos = 0;\n }\n }\n } while (zs->decompressedOffset != offset + len);\n\n return len;\n}\n\nsize_t ZSTD_seekable_decompressFrame(ZSTD_seekable* zs, void* dst, size_t dstSize, unsigned frameIndex)\n{\n if (frameIndex >= zs->seekTable.tableLen) {\n return ERROR(frameIndex_tooLarge);\n }\n\n {\n size_t const decompressedSize =\n zs->seekTable.entries[frameIndex + 1].dOffset -\n zs->seekTable.entries[frameIndex].dOffset;\n if (dstSize < decompressedSize) {\n return ERROR(dstSize_tooSmall);\n }\n return ZSTD_seekable_decompress(\n zs, dst, decompressedSize,\n zs->seekTable.entries[frameIndex].dOffset);\n }\n}\n"}]}},{"FileDel":{"deleted_names":[{"basename":"lib","metadata":1005},{"basename":"lib","metadata":576}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":7},"to":{"change":7,"start":8,"end":13},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":13},"to":{"change":7,"start":14,"end":14},"introduced_by":7},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":7},"to":{"change":2,"start":16,"end":30},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":30},"to":{"change":7,"start":14,"end":14},"introduced_by":2}],"inode":{"change":7,"pos":14}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"common","metadata":576},{"basename":"common","metadata":1005}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":14},"to":{"change":2,"start":49,"end":66},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":66},"to":{"change":7,"start":120007,"end":120007},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":14},"to":{"change":7,"start":119998,"end":120006},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120006},"to":{"change":7,"start":120007,"end":120007},"introduced_by":7}],"inode":{"change":7,"pos":120007}}},"content_edges":null,"content":[]}},{"FileDel":{"deleted_names":[{"basename":"mem.h","metadata":0},{"basename":"mem.h","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":2,"start":112,"end":128},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":128},"to":{"change":7,"start":192551,"end":192551},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":7,"start":192543,"end":192550},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":192550},"to":{"change":7,"start":192551,"end":192551},"introduced_by":7}],"inode":{"change":7,"pos":192551}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":192551},"to":{"change":7,"start":192552,"end":204638},"introduced_by":7}],"inode":{"change":7,"pos":192551}},"content":[{"Del":"/*\n * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.\n * 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 MEM_H_MODULE\n#define MEM_H_MODULE\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/*-****************************************\n* Dependencies\n******************************************/\n#include /* size_t, ptrdiff_t */\n#include /* memcpy */\n\n\n/*-****************************************\n* Compiler specifics\n******************************************/\n#if defined(_MSC_VER) /* Visual Studio */\n# include /* _byteswap_ulong */\n# include /* _byteswap_* */\n#endif\n#if defined(__GNUC__)\n# define MEM_STATIC static __inline __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#ifndef __has_builtin\n# define __has_builtin(x) 0 /* compat. with non-clang compilers */\n#endif\n\n/* code only tested on 32 and 64 bits systems */\n#define MEM_STATIC_ASSERT(c) { enum { MEM_static_assert = 1/(int)(!!(c)) }; }\nMEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (sizeof(size_t)==8)); }\n\n\n/*-**************************************************************\n* Basic Types\n*****************************************************************/\n#if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# include \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# include \n#if CHAR_BIT != 8\n# error \"this implementation requires char to be exactly 8-bit type\"\n#endif\n typedef unsigned char BYTE;\n#if USHRT_MAX != 65535\n# error \"this implementation requires short to be exactly 16-bit type\"\n#endif\n typedef unsigned short U16;\n typedef signed short S16;\n#if UINT_MAX != 4294967295\n# error \"this implementation requires int to be exactly 32-bit type\"\n#endif\n typedef unsigned int U32;\n typedef signed int S32;\n/* note : there are no limits defined for long long type in C90.\n * limits exist in C99, however, in such case, is preferred */\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 (i.e., 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 depending on alignment.\n * In some circumstances, it's the only known way to get the most performance (i.e. 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(__GNUC__)\n# define MEM_FORCE_MEMORY_ACCESS 1\n# endif\n#endif\n\nMEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }\nMEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==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, by lying 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; }\nMEM_STATIC size_t MEM_readST(const void* memPtr) { return *(const size_t*) memPtr; }\n\nMEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }\nMEM_STATIC void MEM_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }\nMEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)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 */\n#if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))\n __pragma( pack(push, 1) )\n typedef struct { U16 v; } unalign16;\n typedef struct { U32 v; } unalign32;\n typedef struct { U64 v; } unalign64;\n typedef struct { size_t v; } unalignArch;\n __pragma( pack(pop) )\n#else\n typedef struct { U16 v; } __attribute__((packed)) unalign16;\n typedef struct { U32 v; } __attribute__((packed)) unalign32;\n typedef struct { U64 v; } __attribute__((packed)) unalign64;\n typedef struct { size_t v; } __attribute__((packed)) unalignArch;\n#endif\n\nMEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign16*)ptr)->v; }\nMEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign32*)ptr)->v; }\nMEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign64*)ptr)->v; }\nMEM_STATIC size_t MEM_readST(const void* ptr) { return ((const unalignArch*)ptr)->v; }\n\nMEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign16*)memPtr)->v = value; }\nMEM_STATIC void MEM_write32(void* memPtr, U32 value) { ((unalign32*)memPtr)->v = value; }\nMEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign64*)memPtr)->v = 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 size_t MEM_readST(const void* memPtr)\n{\n size_t 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\nMEM_STATIC void MEM_write32(void* memPtr, U32 value)\n{\n memcpy(memPtr, &value, sizeof(value));\n}\n\nMEM_STATIC void MEM_write64(void* memPtr, U64 value)\n{\n memcpy(memPtr, &value, sizeof(value));\n}\n\n#endif /* MEM_FORCE_MEMORY_ACCESS */\n\nMEM_STATIC U32 MEM_swap32(U32 in)\n{\n#if defined(_MSC_VER) /* Visual Studio */\n return _byteswap_ulong(in);\n#elif (defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)) \\\n || (defined(__clang__) && __has_builtin(__builtin_bswap32))\n return __builtin_bswap32(in);\n#else\n return ((in << 24) & 0xff000000 ) |\n ((in << 8) & 0x00ff0000 ) |\n ((in >> 8) & 0x0000ff00 ) |\n ((in >> 24) & 0x000000ff );\n#endif\n}\n\nMEM_STATIC U64 MEM_swap64(U64 in)\n{\n#if defined(_MSC_VER) /* Visual Studio */\n return _byteswap_uint64(in);\n#elif (defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)) \\\n || (defined(__clang__) && __has_builtin(__builtin_bswap64))\n return __builtin_bswap64(in);\n#else\n return ((in << 56) & 0xff00000000000000ULL) |\n ((in << 40) & 0x00ff000000000000ULL) |\n ((in << 24) & 0x0000ff0000000000ULL) |\n ((in << 8) & 0x000000ff00000000ULL) |\n ((in >> 8) & 0x00000000ff000000ULL) |\n ((in >> 24) & 0x0000000000ff0000ULL) |\n ((in >> 40) & 0x000000000000ff00ULL) |\n ((in >> 56) & 0x00000000000000ffULL);\n#endif\n}\n\nMEM_STATIC size_t MEM_swapST(size_t in)\n{\n if (MEM_32bits())\n return (size_t)MEM_swap32((U32)in);\n else\n return (size_t)MEM_swap64((U64)in);\n}\n\n/*=== Little endian r/w ===*/\n\nMEM_STATIC U16 MEM_readLE16(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read16(memPtr);\n else {\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 MEM_write16(memPtr, val);\n } else {\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 void MEM_writeLE24(void* memPtr, U32 val)\n{\n MEM_writeLE16(memPtr, (U16)val);\n ((BYTE*)memPtr)[2] = (BYTE)(val>>16);\n}\n\nMEM_STATIC U32 MEM_readLE32(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read32(memPtr);\n else\n return MEM_swap32(MEM_read32(memPtr));\n}\n\nMEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)\n{\n if (MEM_isLittleEndian())\n MEM_write32(memPtr, val32);\n else\n MEM_write32(memPtr, MEM_swap32(val32));\n}\n\nMEM_STATIC U64 MEM_readLE64(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_read64(memPtr);\n else\n return MEM_swap64(MEM_read64(memPtr));\n}\n\nMEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)\n{\n if (MEM_isLittleEndian())\n MEM_write64(memPtr, val64);\n else\n MEM_write64(memPtr, MEM_swap64(val64));\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\nMEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)\n{\n if (MEM_32bits())\n MEM_writeLE32(memPtr, (U32)val);\n else\n MEM_writeLE64(memPtr, (U64)val);\n}\n\n/*=== Big endian r/w ===*/\n\nMEM_STATIC U32 MEM_readBE32(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_swap32(MEM_read32(memPtr));\n else\n return MEM_read32(memPtr);\n}\n\nMEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)\n{\n if (MEM_isLittleEndian())\n MEM_write32(memPtr, MEM_swap32(val32));\n else\n MEM_write32(memPtr, val32);\n}\n\nMEM_STATIC U64 MEM_readBE64(const void* memPtr)\n{\n if (MEM_isLittleEndian())\n return MEM_swap64(MEM_read64(memPtr));\n else\n return MEM_read64(memPtr);\n}\n\nMEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)\n{\n if (MEM_isLittleEndian())\n MEM_write64(memPtr, MEM_swap64(val64));\n else\n MEM_write64(memPtr, val64);\n}\n\nMEM_STATIC size_t MEM_readBEST(const void* memPtr)\n{\n if (MEM_32bits())\n return (size_t)MEM_readBE32(memPtr);\n else\n return (size_t)MEM_readBE64(memPtr);\n}\n\nMEM_STATIC void MEM_writeBEST(void* memPtr, size_t val)\n{\n if (MEM_32bits())\n MEM_writeBE32(memPtr, (U32)val);\n else\n MEM_writeBE64(memPtr, (U64)val);\n}\n\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* MEM_H_MODULE */\n"}]}},{"FileDel":{"deleted_names":[{"basename":"xxhash.h","metadata":0},{"basename":"xxhash.h","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":2,"start":92,"end":111},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":111},"to":{"change":7,"start":123788,"end":123788},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":7,"start":123777,"end":123787},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":123787},"to":{"change":7,"start":123788,"end":123788},"introduced_by":7}],"inode":{"change":7,"pos":123788}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":123788},"to":{"change":7,"start":123789,"end":192542},"introduced_by":7}],"inode":{"change":7,"pos":123788}},"content":[{"Del":"/*\n * xxHash - Extremely Fast Hash algorithm\n * Header File\n * Copyright (C) 2012-present, Yann Collet.\n *\n * BSD 2-Clause License (https://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 * - xxHash homepage: https://www.xxhash.com\n * - xxHash source repository: https://github.com/Cyan4973/xxHash\n */\n\n/* TODO: update */\n/* Notice extracted from xxHash homepage:\n\nxxHash is an extremely fast hash algorithm, running at RAM speed limits.\nIt also successfully passes all tests from the SMHasher suite.\n\nComparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)\n\nName Speed Q.Score Author\nxxHash 5.4 GB/s 10\nCrapWow 3.2 GB/s 2 Andrew\nMumurHash 3a 2.7 GB/s 10 Austin Appleby\nSpookyHash 2.0 GB/s 10 Bob Jenkins\nSBox 1.4 GB/s 9 Bret Mulvey\nLookup3 1.2 GB/s 9 Bob Jenkins\nSuperFastHash 1.2 GB/s 1 Paul Hsieh\nCityHash64 1.05 GB/s 10 Pike & Alakuijala\nFNV 0.55 GB/s 5 Fowler, Noll, Vo\nCRC32 0.43 GB/s 9\nMD5-32 0.33 GB/s 10 Ronald L. Rivest\nSHA1-32 0.28 GB/s 10\n\nQ.Score is a measure of quality of the hash function.\nIt depends on successfully passing SMHasher test set.\n10 is a perfect score.\n\nNote: SMHasher's CRC32 implementation is not the fastest one.\nOther speed-oriented implementations can be faster,\nespecially in combination with PCLMUL instruction:\nhttps://fastcompression.blogspot.com/2019/03/presenting-xxh3.html?showComment=1552696407071#c3490092340461170735\n\nA 64-bit version, named XXH64, is available since r35.\nIt offers much better speed, but for 64-bit applications only.\nName Speed on 64 bits Speed on 32 bits\nXXH64 13.8 GB/s 1.9 GB/s\nXXH32 6.8 GB/s 6.0 GB/s\n*/\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/* ****************************\n * INLINE mode\n ******************************/\n/*!\n * XXH_INLINE_ALL (and XXH_PRIVATE_API)\n * Use these build macros to inline xxhash into the target unit.\n * Inlining improves performance on small inputs, especially when the length is\n * expressed as a compile-time constant:\n *\n * https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power.html\n *\n * It also keeps xxHash symbols private to the unit, so they are not exported.\n *\n * Usage:\n * #define XXH_INLINE_ALL\n * #include \"xxhash.h\"\n *\n * Do not compile and link xxhash.o as a separate object, as it is not useful.\n */\n#if (defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)) \\\n && !defined(XXH_INLINE_ALL_31684351384)\n /* this section should be traversed only once */\n# define XXH_INLINE_ALL_31684351384\n /* give access to the advanced API, required to compile implementations */\n# undef XXH_STATIC_LINKING_ONLY /* avoid macro redef */\n# define XXH_STATIC_LINKING_ONLY\n /* make all functions private */\n# undef XXH_PUBLIC_API\n# if defined(__GNUC__)\n# define XXH_PUBLIC_API static __inline __attribute__((unused))\n# elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n# define XXH_PUBLIC_API static inline\n# elif defined(_MSC_VER)\n# define XXH_PUBLIC_API static __inline\n# else\n /* note: this version may generate warnings for unused static functions */\n# define XXH_PUBLIC_API static\n# endif\n\n /*\n * This part deals with the special case where a unit wants to inline xxHash,\n * but \"xxhash.h\" has previously been included without XXH_INLINE_ALL, such\n * as part of some previously included *.h header file.\n * Without further action, the new include would just be ignored,\n * and functions would effectively _not_ be inlined (silent failure).\n * The following macros solve this situation by prefixing all inlined names,\n * avoiding naming collision with previous inclusions.\n */\n# ifdef XXH_NAMESPACE\n# error \"XXH_INLINE_ALL with XXH_NAMESPACE is not supported\"\n /*\n * Note: Alternative: #undef all symbols (it's a pretty large list).\n * Without #error: it compiles, but functions are actually not inlined.\n */\n# endif\n# define XXH_NAMESPACE XXH_INLINE_\n /*\n * Some identifiers (enums, type names) are not symbols, but they must\n * still be renamed to avoid redeclaration.\n * Alternative solution: do not redeclare them.\n * However, this requires some #ifdefs, and is a more dispersed action.\n * Meanwhile, renaming can be achieved in a single block\n */\n# define XXH_IPREF(Id) XXH_INLINE_ ## Id\n# define XXH_OK XXH_IPREF(XXH_OK)\n# define XXH_ERROR XXH_IPREF(XXH_ERROR)\n# define XXH_errorcode XXH_IPREF(XXH_errorcode)\n# define XXH32_canonical_t XXH_IPREF(XXH32_canonical_t)\n# define XXH64_canonical_t XXH_IPREF(XXH64_canonical_t)\n# define XXH128_canonical_t XXH_IPREF(XXH128_canonical_t)\n# define XXH32_state_s XXH_IPREF(XXH32_state_s)\n# define XXH32_state_t XXH_IPREF(XXH32_state_t)\n# define XXH64_state_s XXH_IPREF(XXH64_state_s)\n# define XXH64_state_t XXH_IPREF(XXH64_state_t)\n# define XXH3_state_s XXH_IPREF(XXH3_state_s)\n# define XXH3_state_t XXH_IPREF(XXH3_state_t)\n# define XXH128_hash_t XXH_IPREF(XXH128_hash_t)\n /* Ensure the header is parsed again, even if it was previously included */\n# undef XXHASH_H_5627135585666179\n# undef XXHASH_H_STATIC_13879238742\n#endif /* XXH_INLINE_ALL || XXH_PRIVATE_API */\n\n\n\n/* ****************************************************************\n * Stable API\n *****************************************************************/\n#ifndef XXHASH_H_5627135585666179\n#define XXHASH_H_5627135585666179 1\n\n/* specific declaration modes for Windows */\n#if !defined(XXH_INLINE_ALL) && !defined(XXH_PRIVATE_API)\n# if defined(WIN32) && defined(_MSC_VER) && (defined(XXH_IMPORT) || defined(XXH_EXPORT))\n# ifdef XXH_EXPORT\n# define XXH_PUBLIC_API __declspec(dllexport)\n# elif XXH_IMPORT\n# define XXH_PUBLIC_API __declspec(dllimport)\n# endif\n# else\n# define XXH_PUBLIC_API /* do nothing */\n# endif\n#endif\n\n/*!\n * XXH_NAMESPACE, aka Namespace Emulation:\n *\n * If you want to include _and expose_ xxHash functions from within your own\n * library, but also want to avoid symbol collisions with other libraries which\n * may also include xxHash, you can use XXH_NAMESPACE to automatically prefix\n * any public symbol from xxhash library with the value of XXH_NAMESPACE\n * (therefore, avoid empty or numeric values).\n *\n * Note that no change is required within the calling program as long as it\n * includes `xxhash.h`: Regular symbol names will be automatically translated\n * by this header.\n */\n#ifdef XXH_NAMESPACE\n# define XXH_CAT(A,B) A##B\n# define XXH_NAME2(A,B) XXH_CAT(A,B)\n# define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)\n# define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)\n# define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)\n# define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)\n# define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)\n# define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)\n# define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)\n# define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)\n# define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)\n# define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)\n# define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)\n# define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)\n# define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)\n# define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)\n# define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)\n# define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)\n# define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)\n# define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)\n# define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)\n#endif\n\n\n/* *************************************\n* Version\n***************************************/\n#define XXH_VERSION_MAJOR 0\n#define XXH_VERSION_MINOR 7\n#define XXH_VERSION_RELEASE 3\n#define XXH_VERSION_NUMBER (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)\nXXH_PUBLIC_API unsigned XXH_versionNumber (void);\n\n\n/* ****************************\n* Definitions\n******************************/\n#include /* size_t */\ntypedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;\n\n\n/*-**********************************************************************\n* 32-bit hash\n************************************************************************/\n#if !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# include \n typedef uint32_t XXH32_hash_t;\n#else\n# include \n# if UINT_MAX == 0xFFFFFFFFUL\n typedef unsigned int XXH32_hash_t;\n# else\n# if ULONG_MAX == 0xFFFFFFFFUL\n typedef unsigned long XXH32_hash_t;\n# else\n# error \"unsupported platform: need a 32-bit type\"\n# endif\n# endif\n#endif\n\n/*!\n * XXH32():\n * Calculate the 32-bit hash of sequence \"length\" bytes stored at memory address \"input\".\n * The memory between input & input+length must be valid (allocated and read-accessible).\n * \"seed\" can be used to alter the result predictably.\n * Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark): 5.4 GB/s\n */\nXXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, XXH32_hash_t seed);\n\n/******* Streaming *******/\n\n/*\n * Streaming functions generate the xxHash value from an incrememtal input.\n * This method is slower than single-call functions, due to state management.\n * For small inputs, prefer `XXH32()` and `XXH64()`, which are better optimized.\n *\n * An XXH state must first be allocated using `XXH*_createState()`.\n *\n * Start a new hash by initializing the state with a seed using `XXH*_reset()`.\n *\n * Then, feed the hash state by calling `XXH*_update()` as many times as necessary.\n *\n * The function returns an error code, with 0 meaning OK, and any other value\n * meaning there is an error.\n *\n * Finally, a hash value can be produced anytime, by using `XXH*_digest()`.\n * This function returns the nn-bits hash as an int or long long.\n *\n * It's still possible to continue inserting input into the hash state after a\n * digest, and generate new hash values later on by invoking `XXH*_digest()`.\n *\n * When done, release the state using `XXH*_freeState()`.\n */\n\ntypedef struct XXH32_state_s XXH32_state_t; /* incomplete type */\nXXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);\nXXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr);\nXXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dst_state, const XXH32_state_t* src_state);\n\nXXH_PUBLIC_API XXH_errorcode XXH32_reset (XXH32_state_t* statePtr, XXH32_hash_t seed);\nXXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);\nXXH_PUBLIC_API XXH32_hash_t XXH32_digest (const XXH32_state_t* statePtr);\n\n/******* Canonical representation *******/\n\n/*\n * The default return values from XXH functions are unsigned 32 and 64 bit\n * integers.\n * This the simplest and fastest format for further post-processing.\n *\n * However, this leaves open the question of what is the order on the byte level,\n * since little and big endian conventions will store the same number differently.\n *\n * The canonical representation settles this issue by mandating big-endian\n * convention, the same convention as human-readable numbers (large digits first).\n *\n * When writing hash values to storage, sending them over a network, or printing\n * them, it's highly recommended to use the canonical representation to ensure\n * portability across a wider range of systems, present and future.\n *\n * The following functions allow transformation of hash values to and from\n * canonical format.\n */\n\ntypedef struct { unsigned char digest[4]; } XXH32_canonical_t;\nXXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);\nXXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);\n\n\n#ifndef XXH_NO_LONG_LONG\n/*-**********************************************************************\n* 64-bit hash\n************************************************************************/\n#if !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# include \n typedef uint64_t XXH64_hash_t;\n#else\n /* the following type must have a width of 64-bit */\n typedef unsigned long long XXH64_hash_t;\n#endif\n\n/*!\n * XXH64():\n * Returns the 64-bit hash of sequence of length @length stored at memory\n * address @input.\n * @seed can be used to alter the result predictably.\n * This function usually runs faster on 64-bit systems, but slower on 32-bit\n * systems (see benchmark).\n */\nXXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, XXH64_hash_t seed);\n\n/******* Streaming *******/\ntypedef struct XXH64_state_s XXH64_state_t; /* incomplete type */\nXXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);\nXXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr);\nXXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* dst_state, const XXH64_state_t* src_state);\n\nXXH_PUBLIC_API XXH_errorcode XXH64_reset (XXH64_state_t* statePtr, XXH64_hash_t seed);\nXXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);\nXXH_PUBLIC_API XXH64_hash_t XXH64_digest (const XXH64_state_t* statePtr);\n\n/******* Canonical representation *******/\ntypedef struct { unsigned char digest[8]; } XXH64_canonical_t;\nXXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);\nXXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);\n\n\n#endif /* XXH_NO_LONG_LONG */\n\n#endif /* XXHASH_H_5627135585666179 */\n\n\n\n#if defined(XXH_STATIC_LINKING_ONLY) && !defined(XXHASH_H_STATIC_13879238742)\n#define XXHASH_H_STATIC_13879238742\n/* ****************************************************************************\n * This section contains declarations which are not guaranteed to remain stable.\n * They may change in future versions, becoming incompatible with a different\n * version of the library.\n * These declarations should only be used with static linking.\n * Never use them in association with dynamic linking!\n ***************************************************************************** */\n\n/*\n * These definitions are only present to allow static allocation of an XXH\n * state, for example, on the stack or in a struct.\n * Never **ever** access members directly.\n */\n\nstruct XXH32_state_s {\n XXH32_hash_t total_len_32;\n XXH32_hash_t large_len;\n XXH32_hash_t v1;\n XXH32_hash_t v2;\n XXH32_hash_t v3;\n XXH32_hash_t v4;\n XXH32_hash_t mem32[4];\n XXH32_hash_t memsize;\n XXH32_hash_t reserved; /* never read nor write, might be removed in a future version */\n}; /* typedef'd to XXH32_state_t */\n\n\n#ifndef XXH_NO_LONG_LONG /* defined when there is no 64-bit support */\n\nstruct XXH64_state_s {\n XXH64_hash_t total_len;\n XXH64_hash_t v1;\n XXH64_hash_t v2;\n XXH64_hash_t v3;\n XXH64_hash_t v4;\n XXH64_hash_t mem64[4];\n XXH32_hash_t memsize;\n XXH32_hash_t reserved32; /* required for padding anyway */\n XXH64_hash_t reserved64; /* never read nor write, might be removed in a future version */\n}; /* typedef'd to XXH64_state_t */\n\n\n/*-**********************************************************************\n* XXH3\n* New experimental hash\n************************************************************************/\n\n/* ************************************************************************\n * XXH3 is a new hash algorithm featuring:\n * - Improved speed for both small and large inputs\n * - True 64-bit and 128-bit outputs\n * - SIMD acceleration\n * - Improved 32-bit viability\n *\n * Speed analysis methodology is explained here:\n *\n * https://fastcompression.blogspot.com/2019/03/presenting-xxh3.html\n *\n * In general, expect XXH3 to run about ~2x faster on large inputs and >3x\n * faster on small ones compared to XXH64, though exact differences depend on\n * the platform.\n *\n * The algorithm is portable: Like XXH32 and XXH64, it generates the same hash\n * on all platforms.\n *\n * It benefits greatly from SIMD and 64-bit arithmetic, but does not require it.\n *\n * Almost all 32-bit and 64-bit targets that can run XXH32 smoothly can run\n * XXH3 at usable speeds, even if XXH64 runs slowly. Further details are\n * explained in the implementation.\n *\n * Optimized implementations are provided for AVX2, SSE2, NEON, POWER8, ZVector,\n * and scalar targets. This can be controlled with the XXH_VECTOR macro.\n *\n * XXH3 offers 2 variants, _64bits and _128bits.\n * When only 64 bits are needed, prefer calling the _64bits variant, as it\n * reduces the amount of mixing, resulting in faster speed on small inputs.\n *\n * It's also generally simpler to manipulate a scalar return type than a struct.\n *\n * The 128-bit version adds additional strength, but it is slightly slower.\n *\n * The XXH3 algorithm is still in development.\n * The results it produces may still change in future versions.\n *\n * Results produced by v0.7.x are not comparable with results from v0.7.y.\n * However, the API is completely stable, and it can safely be used for\n * ephemeral data (local sessions).\n *\n * Avoid storing values in long-term storage until the algorithm is finalized.\n *\n * The API supports one-shot hashing, streaming mode, and custom secrets.\n */\n\n#ifdef XXH_NAMESPACE\n# define XXH3_64bits XXH_NAME2(XXH_NAMESPACE, XXH3_64bits)\n# define XXH3_64bits_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_withSecret)\n# define XXH3_64bits_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_withSeed)\n\n# define XXH3_createState XXH_NAME2(XXH_NAMESPACE, XXH3_createState)\n# define XXH3_freeState XXH_NAME2(XXH_NAMESPACE, XXH3_freeState)\n# define XXH3_copyState XXH_NAME2(XXH_NAMESPACE, XXH3_copyState)\n\n# define XXH3_64bits_reset XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset)\n# define XXH3_64bits_reset_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset_withSeed)\n# define XXH3_64bits_reset_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset_withSecret)\n# define XXH3_64bits_update XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_update)\n# define XXH3_64bits_digest XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_digest)\n#endif\n\n/* XXH3_64bits():\n * default 64-bit variant, using default secret and default seed of 0.\n * It's the fastest variant. */\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits(const void* data, size_t len);\n\n/*\n * XXH3_64bits_withSecret():\n * It's possible to provide any blob of bytes as a \"secret\" to generate the hash.\n * This makes it more difficult for an external actor to prepare an intentional\n * collision.\n * The secret *must* be large enough (>= XXH3_SECRET_SIZE_MIN).\n * It should consist of random bytes.\n * Avoid trivial sequences, such as repeating sequences and especially '\\0',\n * as this can cancel out itself.\n * Failure to respect these conditions will result in a poor quality hash.\n */\n#define XXH3_SECRET_SIZE_MIN 136\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits_withSecret(const void* data, size_t len, const void* secret, size_t secretSize);\n\n/*\n * XXH3_64bits_withSeed():\n * This variant generates a custom secret on the fly based on the default\n * secret, altered using the `seed` value.\n * While this operation is decently fast, note that it's not completely free.\n * Note: seed==0 produces the same results as XXH3_64bits().\n */\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits_withSeed(const void* data, size_t len, XXH64_hash_t seed);\n\n\n/* streaming 64-bit */\n\n#if defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) /* C11+ */\n# include \n# define XXH_ALIGN(n) alignas(n)\n#elif defined(__GNUC__)\n# define XXH_ALIGN(n) __attribute__ ((aligned(n)))\n#elif defined(_MSC_VER)\n# define XXH_ALIGN(n) __declspec(align(n))\n#else\n# define XXH_ALIGN(n) /* disabled */\n#endif\n\n/* Old GCC versions only accept the attribute after the type in structures. */\n#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)) /* C11+ */ \\\n && defined(__GNUC__)\n# define XXH_ALIGN_MEMBER(align, type) type XXH_ALIGN(align)\n#else\n# define XXH_ALIGN_MEMBER(align, type) XXH_ALIGN(align) type\n#endif\n\ntypedef struct XXH3_state_s XXH3_state_t;\n\n#define XXH3_SECRET_DEFAULT_SIZE 192 /* minimum XXH3_SECRET_SIZE_MIN */\n#define XXH3_INTERNALBUFFER_SIZE 256\nstruct XXH3_state_s {\n XXH_ALIGN_MEMBER(64, XXH64_hash_t acc[8]);\n /* used to store a custom secret generated from the seed. Makes state larger.\n * Design might change */\n XXH_ALIGN_MEMBER(64, unsigned char customSecret[XXH3_SECRET_DEFAULT_SIZE]);\n XXH_ALIGN_MEMBER(64, unsigned char buffer[XXH3_INTERNALBUFFER_SIZE]);\n XXH32_hash_t bufferedSize;\n XXH32_hash_t nbStripesPerBlock;\n XXH32_hash_t nbStripesSoFar;\n XXH32_hash_t secretLimit;\n XXH32_hash_t reserved32;\n XXH32_hash_t reserved32_2;\n XXH64_hash_t totalLen;\n XXH64_hash_t seed;\n XXH64_hash_t reserved64;\n /* note: there is some padding after due to alignment on 64 bytes */\n const unsigned char* secret;\n}; /* typedef'd to XXH3_state_t */\n\n#undef XXH_ALIGN_MEMBER\n\n/*\n * Streaming requires state maintenance.\n * This operation costs memory and CPU.\n * As a consequence, streaming is slower than one-shot hashing.\n * For better performance, prefer one-shot functions whenever possible.\n */\nXXH_PUBLIC_API XXH3_state_t* XXH3_createState(void);\nXXH_PUBLIC_API XXH_errorcode XXH3_freeState(XXH3_state_t* statePtr);\nXXH_PUBLIC_API void XXH3_copyState(XXH3_state_t* dst_state, const XXH3_state_t* src_state);\n\n\n/*\n * XXH3_64bits_reset():\n * Initialize with the default parameters.\n * The result will be equivalent to `XXH3_64bits()`.\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset(XXH3_state_t* statePtr);\n/*\n * XXH3_64bits_reset_withSeed():\n * Generate a custom secret from `seed`, and store it into `statePtr`.\n * digest will be equivalent to `XXH3_64bits_withSeed()`.\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset_withSeed(XXH3_state_t* statePtr, XXH64_hash_t seed);\n/*\n * XXH3_64bits_reset_withSecret():\n * `secret` is referenced, and must outlive the hash streaming session, so\n * be careful when using stack arrays.\n * `secretSize` must be >= `XXH3_SECRET_SIZE_MIN`.\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset_withSecret(XXH3_state_t* statePtr, const void* secret, size_t secretSize);\n\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_update (XXH3_state_t* statePtr, const void* input, size_t length);\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits_digest (const XXH3_state_t* statePtr);\n\n\n/* 128-bit */\n\n#ifdef XXH_NAMESPACE\n# define XXH128 XXH_NAME2(XXH_NAMESPACE, XXH128)\n# define XXH3_128bits XXH_NAME2(XXH_NAMESPACE, XXH3_128bits)\n# define XXH3_128bits_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_withSeed)\n# define XXH3_128bits_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_withSecret)\n\n# define XXH3_128bits_reset XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset)\n# define XXH3_128bits_reset_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset_withSeed)\n# define XXH3_128bits_reset_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset_withSecret)\n# define XXH3_128bits_update XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_update)\n# define XXH3_128bits_digest XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_digest)\n\n# define XXH128_isEqual XXH_NAME2(XXH_NAMESPACE, XXH128_isEqual)\n# define XXH128_cmp XXH_NAME2(XXH_NAMESPACE, XXH128_cmp)\n# define XXH128_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH128_canonicalFromHash)\n# define XXH128_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH128_hashFromCanonical)\n#endif\n\ntypedef struct {\n XXH64_hash_t low64;\n XXH64_hash_t high64;\n} XXH128_hash_t;\n\nXXH_PUBLIC_API XXH128_hash_t XXH128(const void* data, size_t len, XXH64_hash_t seed);\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits(const void* data, size_t len);\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits_withSeed(const void* data, size_t len, XXH64_hash_t seed); /* == XXH128() */\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits_withSecret(const void* data, size_t len, const void* secret, size_t secretSize);\n\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset(XXH3_state_t* statePtr);\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset_withSeed(XXH3_state_t* statePtr, XXH64_hash_t seed);\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset_withSecret(XXH3_state_t* statePtr, const void* secret, size_t secretSize);\n\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_update (XXH3_state_t* statePtr, const void* input, size_t length);\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits_digest (const XXH3_state_t* statePtr);\n\n\n/* Note: For better performance, these functions can be inlined using XXH_INLINE_ALL */\n\n/*!\n * XXH128_isEqual():\n * Return: 1 if `h1` and `h2` are equal, 0 if they are not.\n */\nXXH_PUBLIC_API int XXH128_isEqual(XXH128_hash_t h1, XXH128_hash_t h2);\n\n/*!\n * XXH128_cmp():\n *\n * This comparator is compatible with stdlib's `qsort()`/`bsearch()`.\n *\n * return: >0 if *h128_1 > *h128_2\n * <0 if *h128_1 < *h128_2\n * =0 if *h128_1 == *h128_2\n */\nXXH_PUBLIC_API int XXH128_cmp(const void* h128_1, const void* h128_2);\n\n\n/******* Canonical representation *******/\ntypedef struct { unsigned char digest[16]; } XXH128_canonical_t;\nXXH_PUBLIC_API void XXH128_canonicalFromHash(XXH128_canonical_t* dst, XXH128_hash_t hash);\nXXH_PUBLIC_API XXH128_hash_t XXH128_hashFromCanonical(const XXH128_canonical_t* src);\n\n\n#endif /* XXH_NO_LONG_LONG */\n\n#if defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)\n# define XXH_IMPLEMENTATION\n#endif\n\n#endif /* defined(XXH_STATIC_LINKING_ONLY) && !defined(XXHASH_H_STATIC_13879238742) */\n\n\n/* ======================================================================== */\n/* ======================================================================== */\n/* ======================================================================== */\n\n\n/*-**********************************************************************\n * xxHash implementation\n *-**********************************************************************\n * xxHash's implementation used to be found in xxhash.c.\n *\n * However, code inlining requires the implementation to be visible to the\n * compiler, usually within the header.\n *\n * As a workaround, xxhash.c used to be included within xxhash.h. This caused\n * some issues with some build systems, especially ones which treat .c files\n * as source files.\n *\n * Therefore, the implementation is now directly integrated within xxhash.h.\n * Another small advantage is that xxhash.c is no longer needed in /include.\n ************************************************************************/\n\n#if ( defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API) \\\n || defined(XXH_IMPLEMENTATION) ) && !defined(XXH_IMPLEM_13a8737387)\n# define XXH_IMPLEM_13a8737387\n\n/* *************************************\n* Tuning parameters\n***************************************/\n/*!\n * XXH_FORCE_MEMORY_ACCESS:\n * By default, access to unaligned memory is controlled by `memcpy()`, which is\n * safe and portable.\n *\n * Unfortunately, on some target/compiler combinations, the generated assembly\n * is sub-optimal.\n *\n * The below switch allow to select a different access method for improved\n * performance.\n * Method 0 (default):\n * Use `memcpy()`. Safe and portable.\n * Method 1:\n * `__attribute__((packed))` statement. It depends on compiler extensions\n * and is therefore not portable.\n * This method is safe if your compiler supports it, and *generally* as\n * fast or faster than `memcpy`.\n * Method 2:\n * Direct access via cast. This method doesn't depend on the compiler but\n * violates the C standard.\n * It can generate buggy code on targets which do not support unaligned\n * memory accesses.\n * But in some circumstances, it's the only known way to get the most\n * performance (ie GCC + ARMv6)\n * Method 3:\n * Byteshift. This can generate the best code on old compilers which don't\n * inline small `memcpy()` calls, and it might also be faster on big-endian\n * systems which lack a native byteswap instruction.\n * See https://stackoverflow.com/a/32095106/646947 for details.\n * Prefer these methods in priority order (0 > 1 > 2 > 3)\n */\n#ifndef XXH_FORCE_MEMORY_ACCESS /* can be defined externally, on command line for example */\n# if !defined(__clang__) && defined(__GNUC__) && defined(__ARM_FEATURE_UNALIGNED) && defined(__ARM_ARCH) && (__ARM_ARCH == 6)\n# define XXH_FORCE_MEMORY_ACCESS 2\n# elif !defined(__clang__) && ((defined(__INTEL_COMPILER) && !defined(_WIN32)) || \\\n (defined(__GNUC__) && (defined(__ARM_ARCH) && __ARM_ARCH >= 7)))\n# define XXH_FORCE_MEMORY_ACCESS 1\n# endif\n#endif\n\n/*!\n *XXH_ACCEPT_NULL_INPUT_POINTER:\n * If the input pointer is NULL, xxHash's default behavior is to dereference it,\n * triggering a segfault.\n * When this macro is enabled, xxHash actively checks the input for a null pointer.\n * If it is, the result for null input pointers is the same as a zero-length input.\n */\n#ifndef XXH_ACCEPT_NULL_INPUT_POINTER /* can be defined externally */\n# define XXH_ACCEPT_NULL_INPUT_POINTER 0\n#endif\n\n/*!\n * XXH_FORCE_ALIGN_CHECK:\n * This is a minor performance trick, only useful with lots of very small keys.\n * It means: check for aligned/unaligned input.\n * The check costs one initial branch per hash;\n * Set it to 0 when the input is guaranteed to be aligned or when alignment\n * doesn't matter for performance.\n *\n * This option does not affect XXH3.\n */\n#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */\n# if defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)\n# define XXH_FORCE_ALIGN_CHECK 0\n# else\n# define XXH_FORCE_ALIGN_CHECK 1\n# endif\n#endif\n\n/*!\n * XXH_NO_INLINE_HINTS:\n *\n * By default, xxHash tries to force the compiler to inline almost all internal\n * functions.\n *\n * This can usually improve performance due to reduced jumping and improved\n * constant folding, but significantly increases the size of the binary which\n * might not be favorable.\n *\n * Additionally, sometimes the forced inlining can be detrimental to performance,\n * depending on the architecture.\n *\n * XXH_NO_INLINE_HINTS marks all internal functions as static, giving the\n * compiler full control on whether to inline or not.\n *\n * When not optimizing (-O0), optimizing for size (-Os, -Oz), or using\n * -fno-inline with GCC or Clang, this will automatically be defined.\n */\n#ifndef XXH_NO_INLINE_HINTS\n# if defined(__OPTIMIZE_SIZE__) /* -Os, -Oz */ \\\n || defined(__NO_INLINE__) /* -O0, -fno-inline */\n# define XXH_NO_INLINE_HINTS 1\n# else\n# define XXH_NO_INLINE_HINTS 0\n# endif\n#endif\n\n/*!\n * XXH_REROLL:\n * Whether to reroll XXH32_finalize, and XXH64_finalize,\n * instead of using an unrolled jump table/if statement loop.\n *\n * This is automatically defined on -Os/-Oz on GCC and Clang.\n */\n#ifndef XXH_REROLL\n# if defined(__OPTIMIZE_SIZE__)\n# define XXH_REROLL 1\n# else\n# define XXH_REROLL 0\n# endif\n#endif\n\n\n/* *************************************\n* Includes & Memory related functions\n***************************************/\n/*!\n * Modify the local functions below should you wish to use some other memory\n * routines for malloc() and free()\n */\n#include \nstatic void* XXH_malloc(size_t s) { return malloc(s); }\nstatic void XXH_free (void* p) { free(p); }\n/*! and for memcpy() */\n#include \nstatic void* XXH_memcpy(void* dest, const void* src, size_t size)\n{\n return memcpy(dest,src,size);\n}\n\n#include /* ULLONG_MAX */\n\n\n/* *************************************\n* Compiler Specific Options\n***************************************/\n#ifdef _MSC_VER /* Visual Studio warning fix */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n#endif\n\n#if XXH_NO_INLINE_HINTS /* disable inlining hints */\n# define XXH_FORCE_INLINE static\n# define XXH_NO_INLINE static\n#elif defined(_MSC_VER) /* Visual Studio */\n# define XXH_FORCE_INLINE static __forceinline\n# define XXH_NO_INLINE static __declspec(noinline)\n#else\n# if defined (__cplusplus) \\\n || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */\n# ifdef __GNUC__\n# define XXH_FORCE_INLINE static inline __attribute__((always_inline))\n# define XXH_NO_INLINE static __attribute__((noinline))\n# else\n# define XXH_FORCE_INLINE static inline\n# define XXH_NO_INLINE static\n# endif\n# else\n# define XXH_FORCE_INLINE static\n# define XXH_NO_INLINE static\n# endif /* __STDC_VERSION__ */\n#endif\n\n\n\n/* *************************************\n* Debug\n***************************************/\n/*\n * DEBUGLEVEL is expected to be defined externally, typically via the compiler's\n * command line options. The value must be a number.\n */\n#ifndef DEBUGLEVEL\n# define DEBUGLEVEL 0\n#endif\n\n#if (DEBUGLEVEL>=1)\n# include /* note: can still be disabled with NDEBUG */\n# define XXH_ASSERT(c) assert(c)\n#else\n# define XXH_ASSERT(c) ((void)0)\n#endif\n\n/* note: use after variable declarations */\n#define XXH_STATIC_ASSERT(c) { enum { XXH_sa = 1/(int)(!!(c)) }; }\n\n\n/* *************************************\n* Basic Types\n***************************************/\n#if !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# include \n typedef uint8_t xxh_u8;\n#else\n typedef unsigned char xxh_u8;\n#endif\ntypedef XXH32_hash_t xxh_u32;\n\n\n/* *** Memory access *** */\n\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n/*\n * Manual byteshift. Best for old compilers which don't inline memcpy.\n * We actually directly use XXH_readLE32 and XXH_readBE32.\n */\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))\n\n/*\n * Force direct memory access. Only works on CPU which support unaligned memory\n * access in hardware.\n */\nstatic xxh_u32 XXH_read32(const void* memPtr) { return *(const xxh_u32*) memPtr; }\n\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))\n\n/*\n * __pack instructions are safer but compiler specific, hence potentially\n * problematic for some compilers.\n *\n * Currently only defined for GCC and ICC.\n */\ntypedef union { xxh_u32 u32; } __attribute__((packed)) unalign;\nstatic xxh_u32 XXH_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }\n\n#else\n\n/*\n * Portable and safe solution. Generally efficient.\n * see: https://stackoverflow.com/a/32095106/646947\n */\nstatic xxh_u32 XXH_read32(const void* memPtr)\n{\n xxh_u32 val;\n memcpy(&val, memPtr, sizeof(val));\n return val;\n}\n\n#endif /* XXH_FORCE_DIRECT_MEMORY_ACCESS */\n\n\n/* *** Endianess *** */\ntypedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;\n\n/*!\n * XXH_CPU_LITTLE_ENDIAN:\n * Defined to 1 if the target is little endian, or 0 if it is big endian.\n * It can be defined externally, for example on the compiler command line.\n *\n * If it is not defined, a runtime check (which is usually constant folded)\n * is used instead.\n */\n#ifndef XXH_CPU_LITTLE_ENDIAN\n/*\n * Try to detect endianness automatically, to avoid the nonstandard behavior\n * in `XXH_isLittleEndian()`\n */\n# if defined(_WIN32) /* Windows is always little endian */ \\\n || defined(__LITTLE_ENDIAN__) \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)\n# define XXH_CPU_LITTLE_ENDIAN 1\n# elif defined(__BIG_ENDIAN__) \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)\n# define XXH_CPU_LITTLE_ENDIAN 0\n# else\nstatic int XXH_isLittleEndian(void)\n{\n /*\n * Nonstandard, but well-defined behavior in practice.\n * Don't use static: it is detrimental to performance.\n */\n const union { xxh_u32 u; xxh_u8 c[4]; } one = { 1 };\n return one.c[0];\n}\n# define XXH_CPU_LITTLE_ENDIAN XXH_isLittleEndian()\n# endif\n#endif\n\n\n\n\n/* ****************************************\n* Compiler-specific Functions and Macros\n******************************************/\n#define XXH_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)\n\n#ifndef __has_builtin\n# define __has_builtin(x) 0\n#endif\n\n#if !defined(NO_CLANG_BUILTIN) && __has_builtin(__builtin_rotateleft32) \\\n && __has_builtin(__builtin_rotateleft64)\n# define XXH_rotl32 __builtin_rotateleft32\n# define XXH_rotl64 __builtin_rotateleft64\n/* Note: although _rotl exists for minGW (GCC under windows), performance seems poor */\n#elif defined(_MSC_VER)\n# define XXH_rotl32(x,r) _rotl(x,r)\n# define XXH_rotl64(x,r) _rotl64(x,r)\n#else\n# define XXH_rotl32(x,r) (((x) << (r)) | ((x) >> (32 - (r))))\n# define XXH_rotl64(x,r) (((x) << (r)) | ((x) >> (64 - (r))))\n#endif\n\n#if defined(_MSC_VER) /* Visual Studio */\n# define XXH_swap32 _byteswap_ulong\n#elif XXH_GCC_VERSION >= 403\n# define XXH_swap32 __builtin_bswap32\n#else\nstatic xxh_u32 XXH_swap32 (xxh_u32 x)\n{\n return ((x << 24) & 0xff000000 ) |\n ((x << 8) & 0x00ff0000 ) |\n ((x >> 8) & 0x0000ff00 ) |\n ((x >> 24) & 0x000000ff );\n}\n#endif\n\n\n/* ***************************\n* Memory reads\n*****************************/\ntypedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;\n\n/*\n * XXH_FORCE_MEMORY_ACCESS==3 is an endian-independent byteshift load.\n *\n * This is ideal for older compilers which don't inline memcpy.\n */\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n\nXXH_FORCE_INLINE xxh_u32 XXH_readLE32(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[0]\n | ((xxh_u32)bytePtr[1] << 8)\n | ((xxh_u32)bytePtr[2] << 16)\n | ((xxh_u32)bytePtr[3] << 24);\n}\n\nXXH_FORCE_INLINE xxh_u32 XXH_readBE32(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[3]\n | ((xxh_u32)bytePtr[2] << 8)\n | ((xxh_u32)bytePtr[1] << 16)\n | ((xxh_u32)bytePtr[0] << 24);\n}\n\n#else\nXXH_FORCE_INLINE xxh_u32 XXH_readLE32(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));\n}\n\nstatic xxh_u32 XXH_readBE32(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);\n}\n#endif\n\nXXH_FORCE_INLINE xxh_u32\nXXH_readLE32_align(const void* ptr, XXH_alignment align)\n{\n if (align==XXH_unaligned) {\n return XXH_readLE32(ptr);\n } else {\n return XXH_CPU_LITTLE_ENDIAN ? *(const xxh_u32*)ptr : XXH_swap32(*(const xxh_u32*)ptr);\n }\n}\n\n\n/* *************************************\n* Misc\n***************************************/\nXXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }\n\n\n/* *******************************************************************\n* 32-bit hash functions\n*********************************************************************/\nstatic const xxh_u32 PRIME32_1 = 0x9E3779B1U; /* 0b10011110001101110111100110110001 */\nstatic const xxh_u32 PRIME32_2 = 0x85EBCA77U; /* 0b10000101111010111100101001110111 */\nstatic const xxh_u32 PRIME32_3 = 0xC2B2AE3DU; /* 0b11000010101100101010111000111101 */\nstatic const xxh_u32 PRIME32_4 = 0x27D4EB2FU; /* 0b00100111110101001110101100101111 */\nstatic const xxh_u32 PRIME32_5 = 0x165667B1U; /* 0b00010110010101100110011110110001 */\n\nstatic xxh_u32 XXH32_round(xxh_u32 acc, xxh_u32 input)\n{\n acc += input * PRIME32_2;\n acc = XXH_rotl32(acc, 13);\n acc *= PRIME32_1;\n#if defined(__GNUC__) && defined(__SSE4_1__) && !defined(XXH_ENABLE_AUTOVECTORIZE)\n /*\n * UGLY HACK:\n * This inline assembly hack forces acc into a normal register. This is the\n * only thing that prevents GCC and Clang from autovectorizing the XXH32\n * loop (pragmas and attributes don't work for some resason) without globally\n * disabling SSE4.1.\n *\n * The reason we want to avoid vectorization is because despite working on\n * 4 integers at a time, there are multiple factors slowing XXH32 down on\n * SSE4:\n * - There's a ridiculous amount of lag from pmulld (10 cycles of latency on\n * newer chips!) making it slightly slower to multiply four integers at\n * once compared to four integers independently. Even when pmulld was\n * fastest, Sandy/Ivy Bridge, it is still not worth it to go into SSE\n * just to multiply unless doing a long operation.\n *\n * - Four instructions are required to rotate,\n * movqda tmp, v // not required with VEX encoding\n * pslld tmp, 13 // tmp <<= 13\n * psrld v, 19 // x >>= 19\n * por v, tmp // x |= tmp\n * compared to one for scalar:\n * roll v, 13 // reliably fast across the board\n * shldl v, v, 13 // Sandy Bridge and later prefer this for some reason\n *\n * - Instruction level parallelism is actually more beneficial here because\n * the SIMD actually serializes this operation: While v1 is rotating, v2\n * can load data, while v3 can multiply. SSE forces them to operate\n * together.\n *\n * How this hack works:\n * __asm__(\"\" // Declare an assembly block but don't declare any instructions\n * : // However, as an Input/Output Operand,\n * \"+r\" // constrain a read/write operand (+) as a general purpose register (r).\n * (acc) // and set acc as the operand\n * );\n *\n * Because of the 'r', the compiler has promised that seed will be in a\n * general purpose register and the '+' says that it will be 'read/write',\n * so it has to assume it has changed. It is like volatile without all the\n * loads and stores.\n *\n * Since the argument has to be in a normal register (not an SSE register),\n * each time XXH32_round is called, it is impossible to vectorize.\n */\n __asm__(\"\" : \"+r\" (acc));\n#endif\n return acc;\n}\n\n/* mix all bits */\nstatic xxh_u32 XXH32_avalanche(xxh_u32 h32)\n{\n h32 ^= h32 >> 15;\n h32 *= PRIME32_2;\n h32 ^= h32 >> 13;\n h32 *= PRIME32_3;\n h32 ^= h32 >> 16;\n return(h32);\n}\n\n#define XXH_get32bits(p) XXH_readLE32_align(p, align)\n\nstatic xxh_u32\nXXH32_finalize(xxh_u32 h32, const xxh_u8* ptr, size_t len, XXH_alignment align)\n{\n#define PROCESS1 \\\n h32 += (*ptr++) * PRIME32_5; \\\n h32 = XXH_rotl32(h32, 11) * PRIME32_1 ;\n\n#define PROCESS4 \\\n h32 += XXH_get32bits(ptr) * PRIME32_3; \\\n ptr+=4; \\\n h32 = XXH_rotl32(h32, 17) * PRIME32_4 ;\n\n /* Compact rerolled version */\n if (XXH_REROLL) {\n len &= 15;\n while (len >= 4) {\n PROCESS4;\n len -= 4;\n }\n while (len > 0) {\n PROCESS1;\n --len;\n }\n return XXH32_avalanche(h32);\n } else {\n switch(len&15) /* or switch(bEnd - p) */ {\n case 12: PROCESS4;\n /* fallthrough */\n case 8: PROCESS4;\n /* fallthrough */\n case 4: PROCESS4;\n return XXH32_avalanche(h32);\n\n case 13: PROCESS4;\n /* fallthrough */\n case 9: PROCESS4;\n /* fallthrough */\n case 5: PROCESS4;\n PROCESS1;\n return XXH32_avalanche(h32);\n\n case 14: PROCESS4;\n /* fallthrough */\n case 10: PROCESS4;\n /* fallthrough */\n case 6: PROCESS4;\n PROCESS1;\n PROCESS1;\n return XXH32_avalanche(h32);\n\n case 15: PROCESS4;\n /* fallthrough */\n case 11: PROCESS4;\n /* fallthrough */\n case 7: PROCESS4;\n /* fallthrough */\n case 3: PROCESS1;\n /* fallthrough */\n case 2: PROCESS1;\n /* fallthrough */\n case 1: PROCESS1;\n /* fallthrough */\n case 0: return XXH32_avalanche(h32);\n }\n XXH_ASSERT(0);\n return h32; /* reaching this point is deemed impossible */\n }\n}\n\nXXH_FORCE_INLINE xxh_u32\nXXH32_endian_align(const xxh_u8* input, size_t len, xxh_u32 seed, XXH_alignment align)\n{\n const xxh_u8* bEnd = input + len;\n xxh_u32 h32;\n\n#if defined(XXH_ACCEPT_NULL_INPUT_POINTER) && (XXH_ACCEPT_NULL_INPUT_POINTER>=1)\n if (input==NULL) {\n len=0;\n bEnd=input=(const xxh_u8*)(size_t)16;\n }\n#endif\n\n if (len>=16) {\n const xxh_u8* const limit = bEnd - 15;\n xxh_u32 v1 = seed + PRIME32_1 + PRIME32_2;\n xxh_u32 v2 = seed + PRIME32_2;\n xxh_u32 v3 = seed + 0;\n xxh_u32 v4 = seed - PRIME32_1;\n\n do {\n v1 = XXH32_round(v1, XXH_get32bits(input)); input += 4;\n v2 = XXH32_round(v2, XXH_get32bits(input)); input += 4;\n v3 = XXH32_round(v3, XXH_get32bits(input)); input += 4;\n v4 = XXH32_round(v4, XXH_get32bits(input)); input += 4;\n } while (input < limit);\n\n h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7)\n + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);\n } else {\n h32 = seed + PRIME32_5;\n }\n\n h32 += (xxh_u32)len;\n\n return XXH32_finalize(h32, input, len&15, align);\n}\n\n\nXXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t len, XXH32_hash_t seed)\n{\n#if 0\n /* Simple version, good for code maintenance, but unfortunately slow for small inputs */\n XXH32_state_t state;\n XXH32_reset(&state, seed);\n XXH32_update(&state, (const xxh_u8*)input, len);\n return XXH32_digest(&state);\n\n#else\n\n if (XXH_FORCE_ALIGN_CHECK) {\n if ((((size_t)input) & 3) == 0) { /* Input is 4-bytes aligned, leverage the speed benefit */\n return XXH32_endian_align((const xxh_u8*)input, len, seed, XXH_aligned);\n } }\n\n return XXH32_endian_align((const xxh_u8*)input, len, seed, XXH_unaligned);\n#endif\n}\n\n\n\n/******* Hash streaming *******/\n\nXXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)\n{\n return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));\n}\nXXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)\n{\n XXH_free(statePtr);\n return XXH_OK;\n}\n\nXXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dstState, const XXH32_state_t* srcState)\n{\n memcpy(dstState, srcState, sizeof(*dstState));\n}\n\nXXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, XXH32_hash_t seed)\n{\n XXH32_state_t state; /* using a local state to memcpy() in order to avoid strict-aliasing warnings */\n memset(&state, 0, sizeof(state));\n state.v1 = seed + PRIME32_1 + PRIME32_2;\n state.v2 = seed + PRIME32_2;\n state.v3 = seed + 0;\n state.v4 = seed - PRIME32_1;\n /* do not write into reserved, planned to be removed in a future version */\n memcpy(statePtr, &state, sizeof(state) - sizeof(state.reserved));\n return XXH_OK;\n}\n\n\nXXH_PUBLIC_API XXH_errorcode\nXXH32_update(XXH32_state_t* state, const void* input, size_t len)\n{\n if (input==NULL)\n#if defined(XXH_ACCEPT_NULL_INPUT_POINTER) && (XXH_ACCEPT_NULL_INPUT_POINTER>=1)\n return XXH_OK;\n#else\n return XXH_ERROR;\n#endif\n\n { const xxh_u8* p = (const xxh_u8*)input;\n const xxh_u8* const bEnd = p + len;\n\n state->total_len_32 += (XXH32_hash_t)len;\n state->large_len |= (XXH32_hash_t)((len>=16) | (state->total_len_32>=16));\n\n if (state->memsize + len < 16) { /* fill in tmp buffer */\n XXH_memcpy((xxh_u8*)(state->mem32) + state->memsize, input, len);\n state->memsize += (XXH32_hash_t)len;\n return XXH_OK;\n }\n\n if (state->memsize) { /* some data left from previous update */\n XXH_memcpy((xxh_u8*)(state->mem32) + state->memsize, input, 16-state->memsize);\n { const xxh_u32* p32 = state->mem32;\n state->v1 = XXH32_round(state->v1, XXH_readLE32(p32)); p32++;\n state->v2 = XXH32_round(state->v2, XXH_readLE32(p32)); p32++;\n state->v3 = XXH32_round(state->v3, XXH_readLE32(p32)); p32++;\n state->v4 = XXH32_round(state->v4, XXH_readLE32(p32));\n }\n p += 16-state->memsize;\n state->memsize = 0;\n }\n\n if (p <= bEnd-16) {\n const xxh_u8* const limit = bEnd - 16;\n xxh_u32 v1 = state->v1;\n xxh_u32 v2 = state->v2;\n xxh_u32 v3 = state->v3;\n xxh_u32 v4 = state->v4;\n\n do {\n v1 = XXH32_round(v1, XXH_readLE32(p)); p+=4;\n v2 = XXH32_round(v2, XXH_readLE32(p)); p+=4;\n v3 = XXH32_round(v3, XXH_readLE32(p)); p+=4;\n v4 = XXH32_round(v4, XXH_readLE32(p)); p+=4;\n } while (p<=limit);\n\n state->v1 = v1;\n state->v2 = v2;\n state->v3 = v3;\n state->v4 = v4;\n }\n\n if (p < bEnd) {\n XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));\n state->memsize = (unsigned)(bEnd-p);\n }\n }\n\n return XXH_OK;\n}\n\n\nXXH_PUBLIC_API XXH32_hash_t XXH32_digest (const XXH32_state_t* state)\n{\n xxh_u32 h32;\n\n if (state->large_len) {\n h32 = XXH_rotl32(state->v1, 1)\n + XXH_rotl32(state->v2, 7)\n + XXH_rotl32(state->v3, 12)\n + XXH_rotl32(state->v4, 18);\n } else {\n h32 = state->v3 /* == seed */ + PRIME32_5;\n }\n\n h32 += state->total_len_32;\n\n return XXH32_finalize(h32, (const xxh_u8*)state->mem32, state->memsize, XXH_aligned);\n}\n\n\n/******* Canonical representation *******/\n\n/*\n * The default return values from XXH functions are unsigned 32 and 64 bit\n * integers.\n *\n * The canonical representation uses big endian convention, the same convention\n * as human-readable numbers (large digits first).\n *\n * This way, hash values can be written into a file or buffer, remaining\n * comparable across different systems.\n *\n * The following functions allow transformation of hash values to and from their\n * canonical format.\n */\nXXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)\n{\n XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));\n if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);\n memcpy(dst, &hash, sizeof(*dst));\n}\n\nXXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)\n{\n return XXH_readBE32(src);\n}\n\n\n#ifndef XXH_NO_LONG_LONG\n\n/* *******************************************************************\n* 64-bit hash functions\n*********************************************************************/\n\n/******* Memory access *******/\n\ntypedef XXH64_hash_t xxh_u64;\n\n\n/*!\n * XXH_REROLL_XXH64:\n * Whether to reroll the XXH64_finalize() loop.\n *\n * Just like XXH32, we can unroll the XXH64_finalize() loop. This can be a\n * performance gain on 64-bit hosts, as only one jump is required.\n *\n * However, on 32-bit hosts, because arithmetic needs to be done with two 32-bit\n * registers, and 64-bit arithmetic needs to be simulated, it isn't beneficial\n * to unroll. The code becomes ridiculously large (the largest function in the\n * binary on i386!), and rerolling it saves anywhere from 3kB to 20kB. It is\n * also slightly faster because it fits into cache better and is more likely\n * to be inlined by the compiler.\n *\n * If XXH_REROLL is defined, this is ignored and the loop is always rerolled.\n */\n#ifndef XXH_REROLL_XXH64\n# if (defined(__ILP32__) || defined(_ILP32)) /* ILP32 is often defined on 32-bit GCC family */ \\\n || !(defined(__x86_64__) || defined(_M_X64) || defined(_M_AMD64) /* x86-64 */ \\\n || defined(_M_ARM64) || defined(__aarch64__) || defined(__arm64__) /* aarch64 */ \\\n || defined(__PPC64__) || defined(__PPC64LE__) || defined(__ppc64__) || defined(__powerpc64__) /* ppc64 */ \\\n || defined(__mips64__) || defined(__mips64)) /* mips64 */ \\\n || (!defined(SIZE_MAX) || SIZE_MAX < ULLONG_MAX) /* check limits */\n# define XXH_REROLL_XXH64 1\n# else\n# define XXH_REROLL_XXH64 0\n# endif\n#endif /* !defined(XXH_REROLL_XXH64) */\n\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n/*\n * Manual byteshift. Best for old compilers which don't inline memcpy.\n * We actually directly use XXH_readLE64 and XXH_readBE64.\n */\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))\n\n/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */\nstatic xxh_u64 XXH_read64(const void* memPtr) { return *(const xxh_u64*) memPtr; }\n\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))\n\n/*\n * __pack instructions are safer, but compiler specific, hence potentially\n * problematic for some compilers.\n *\n * Currently only defined for GCC and ICC.\n */\ntypedef union { xxh_u32 u32; xxh_u64 u64; } __attribute__((packed)) unalign64;\nstatic xxh_u64 XXH_read64(const void* ptr) { return ((const unalign64*)ptr)->u64; }\n\n#else\n\n/*\n * Portable and safe solution. Generally efficient.\n * see: https://stackoverflow.com/a/32095106/646947\n */\nstatic xxh_u64 XXH_read64(const void* memPtr)\n{\n xxh_u64 val;\n memcpy(&val, memPtr, sizeof(val));\n return val;\n}\n\n#endif /* XXH_FORCE_DIRECT_MEMORY_ACCESS */\n\n#if defined(_MSC_VER) /* Visual Studio */\n# define XXH_swap64 _byteswap_uint64\n#elif XXH_GCC_VERSION >= 403\n# define XXH_swap64 __builtin_bswap64\n#else\nstatic xxh_u64 XXH_swap64 (xxh_u64 x)\n{\n return ((x << 56) & 0xff00000000000000ULL) |\n ((x << 40) & 0x00ff000000000000ULL) |\n ((x << 24) & 0x0000ff0000000000ULL) |\n ((x << 8) & 0x000000ff00000000ULL) |\n ((x >> 8) & 0x00000000ff000000ULL) |\n ((x >> 24) & 0x0000000000ff0000ULL) |\n ((x >> 40) & 0x000000000000ff00ULL) |\n ((x >> 56) & 0x00000000000000ffULL);\n}\n#endif\n\n\n/* XXH_FORCE_MEMORY_ACCESS==3 is an endian-independent byteshift load. */\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n\nXXH_FORCE_INLINE xxh_u64 XXH_readLE64(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[0]\n | ((xxh_u64)bytePtr[1] << 8)\n | ((xxh_u64)bytePtr[2] << 16)\n | ((xxh_u64)bytePtr[3] << 24)\n | ((xxh_u64)bytePtr[4] << 32)\n | ((xxh_u64)bytePtr[5] << 40)\n | ((xxh_u64)bytePtr[6] << 48)\n | ((xxh_u64)bytePtr[7] << 56);\n}\n\nXXH_FORCE_INLINE xxh_u64 XXH_readBE64(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[7]\n | ((xxh_u64)bytePtr[6] << 8)\n | ((xxh_u64)bytePtr[5] << 16)\n | ((xxh_u64)bytePtr[4] << 24)\n | ((xxh_u64)bytePtr[3] << 32)\n | ((xxh_u64)bytePtr[2] << 40)\n | ((xxh_u64)bytePtr[1] << 48)\n | ((xxh_u64)bytePtr[0] << 56);\n}\n\n#else\nXXH_FORCE_INLINE xxh_u64 XXH_readLE64(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));\n}\n\nstatic xxh_u64 XXH_readBE64(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);\n}\n#endif\n\nXXH_FORCE_INLINE xxh_u64\nXXH_readLE64_align(const void* ptr, XXH_alignment align)\n{\n if (align==XXH_unaligned)\n return XXH_readLE64(ptr);\n else\n return XXH_CPU_LITTLE_ENDIAN ? *(const xxh_u64*)ptr : XXH_swap64(*(const xxh_u64*)ptr);\n}\n\n\n/******* xxh64 *******/\n\nstatic const xxh_u64 PRIME64_1 = 0x9E3779B185EBCA87ULL; /* 0b1001111000110111011110011011000110000101111010111100101010000111 */\nstatic const xxh_u64 PRIME64_2 = 0xC2B2AE3D27D4EB4FULL; /* 0b1100001010110010101011100011110100100111110101001110101101001111 */\nstatic const xxh_u64 PRIME64_3 = 0x165667B19E3779F9ULL; /* 0b0001011001010110011001111011000110011110001101110111100111111001 */\nstatic const xxh_u64 PRIME64_4 = 0x85EBCA77C2B2AE63ULL; /* 0b1000010111101011110010100111011111000010101100101010111001100011 */\nstatic const xxh_u64 PRIME64_5 = 0x27D4EB2F165667C5ULL; /* 0b0010011111010100111010110010111100010110010101100110011111000101 */\n\nstatic xxh_u64 XXH64_round(xxh_u64 acc, xxh_u64 input)\n{\n acc += input * PRIME64_2;\n acc = XXH_rotl64(acc, 31);\n acc *= PRIME64_1;\n return acc;\n}\n\nstatic xxh_u64 XXH64_mergeRound(xxh_u64 acc, xxh_u64 val)\n{\n val = XXH64_round(0, val);\n acc ^= val;\n acc = acc * PRIME64_1 + PRIME64_4;\n return acc;\n}\n\nstatic xxh_u64 XXH64_avalanche(xxh_u64 h64)\n{\n h64 ^= h64 >> 33;\n h64 *= PRIME64_2;\n h64 ^= h64 >> 29;\n h64 *= PRIME64_3;\n h64 ^= h64 >> 32;\n return h64;\n}\n\n\n#define XXH_get64bits(p) XXH_readLE64_align(p, align)\n\nstatic xxh_u64\nXXH64_finalize(xxh_u64 h64, const xxh_u8* ptr, size_t len, XXH_alignment align)\n{\n#define PROCESS1_64 \\\n h64 ^= (*ptr++) * PRIME64_5; \\\n h64 = XXH_rotl64(h64, 11) * PRIME64_1;\n\n#define PROCESS4_64 \\\n h64 ^= (xxh_u64)(XXH_get32bits(ptr)) * PRIME64_1; \\\n ptr+=4; \\\n h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;\n\n#define PROCESS8_64 { \\\n xxh_u64 const k1 = XXH64_round(0, XXH_get64bits(ptr)); \\\n ptr+=8; \\\n h64 ^= k1; \\\n h64 = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4; \\\n}\n\n /* Rerolled version for 32-bit targets is faster and much smaller. */\n if (XXH_REROLL || XXH_REROLL_XXH64) {\n len &= 31;\n while (len >= 8) {\n PROCESS8_64;\n len -= 8;\n }\n if (len >= 4) {\n PROCESS4_64;\n len -= 4;\n }\n while (len > 0) {\n PROCESS1_64;\n --len;\n }\n return XXH64_avalanche(h64);\n } else {\n switch(len & 31) {\n case 24: PROCESS8_64;\n /* fallthrough */\n case 16: PROCESS8_64;\n /* fallthrough */\n case 8: PROCESS8_64;\n return XXH64_avalanche(h64);\n\n case 28: PROCESS8_64;\n /* fallthrough */\n case 20: PROCESS8_64;\n /* fallthrough */\n case 12: PROCESS8_64;\n /* fallthrough */\n case 4: PROCESS4_64;\n return XXH64_avalanche(h64);\n\n case 25: PROCESS8_64;\n /* fallthrough */\n case 17: PROCESS8_64;\n /* fallthrough */\n case 9: PROCESS8_64;\n PROCESS1_64;\n return XXH64_avalanche(h64);\n\n case 29: PROCESS8_64;\n /* fallthrough */\n case 21: PROCESS8_64;\n /* fallthrough */\n case 13: PROCESS8_64;\n /* fallthrough */\n case 5: PROCESS4_64;\n PROCESS1_64;\n return XXH64_avalanche(h64);\n\n case 26: PROCESS8_64;\n /* fallthrough */\n case 18: PROCESS8_64;\n /* fallthrough */\n case 10: PROCESS8_64;\n PROCESS1_64;\n PROCESS1_64;\n return XXH64_avalanche(h64);\n\n case 30: PROCESS8_64;\n /* fallthrough */\n case 22: PROCESS8_64;\n /* fallthrough */\n case 14: PROCESS8_64;\n /* fallthrough */\n case 6: PROCESS4_64;\n PROCESS1_64;\n PROCESS1_64;\n return XXH64_avalanche(h64);\n\n case 27: PROCESS8_64;\n /* fallthrough */\n case 19: PROCESS8_64;\n /* fallthrough */\n case 11: PROCESS8_64;\n PROCESS1_64;\n PROCESS1_64;\n PROCESS1_64;\n return XXH64_avalanche(h64);\n\n case 31: PROCESS8_64;\n /* fallthrough */\n case 23: PROCESS8_64;\n /* fallthrough */\n case 15: PROCESS8_64;\n /* fallthrough */\n case 7: PROCESS4_64;\n /* fallthrough */\n case 3: PROCESS1_64;\n /* fallthrough */\n case 2: PROCESS1_64;\n /* fallthrough */\n case 1: PROCESS1_64;\n /* fallthrough */\n case 0: return XXH64_avalanche(h64);\n }\n }\n /* impossible to reach */\n XXH_ASSERT(0);\n return 0; /* unreachable, but some compilers complain without it */\n}\n\nXXH_FORCE_INLINE xxh_u64\nXXH64_endian_align(const xxh_u8* input, size_t len, xxh_u64 seed, XXH_alignment align)\n{\n const xxh_u8* bEnd = input + len;\n xxh_u64 h64;\n\n#if defined(XXH_ACCEPT_NULL_INPUT_POINTER) && (XXH_ACCEPT_NULL_INPUT_POINTER>=1)\n if (input==NULL) {\n len=0;\n bEnd=input=(const xxh_u8*)(size_t)32;\n }\n#endif\n\n if (len>=32) {\n const xxh_u8* const limit = bEnd - 32;\n xxh_u64 v1 = seed + PRIME64_1 + PRIME64_2;\n xxh_u64 v2 = seed + PRIME64_2;\n xxh_u64 v3 = seed + 0;\n xxh_u64 v4 = seed - PRIME64_1;\n\n do {\n v1 = XXH64_round(v1, XXH_get64bits(input)); input+=8;\n v2 = XXH64_round(v2, XXH_get64bits(input)); input+=8;\n v3 = XXH64_round(v3, XXH_get64bits(input)); input+=8;\n v4 = XXH64_round(v4, XXH_get64bits(input)); input+=8;\n } while (input<=limit);\n\n h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);\n h64 = XXH64_mergeRound(h64, v1);\n h64 = XXH64_mergeRound(h64, v2);\n h64 = XXH64_mergeRound(h64, v3);\n h64 = XXH64_mergeRound(h64, v4);\n\n } else {\n h64 = seed + PRIME64_5;\n }\n\n h64 += (xxh_u64) len;\n\n return XXH64_finalize(h64, input, len, align);\n}\n\n\nXXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t len, XXH64_hash_t seed)\n{\n#if 0\n /* Simple version, good for code maintenance, but unfortunately slow for small inputs */\n XXH64_state_t state;\n XXH64_reset(&state, seed);\n XXH64_update(&state, (const xxh_u8*)input, len);\n return XXH64_digest(&state);\n\n#else\n\n if (XXH_FORCE_ALIGN_CHECK) {\n if ((((size_t)input) & 7)==0) { /* Input is aligned, let's leverage the speed advantage */\n return XXH64_endian_align((const xxh_u8*)input, len, seed, XXH_aligned);\n } }\n\n return XXH64_endian_align((const xxh_u8*)input, len, seed, XXH_unaligned);\n\n#endif\n}\n\n/******* Hash Streaming *******/\n\nXXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)\n{\n return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));\n}\nXXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)\n{\n XXH_free(statePtr);\n return XXH_OK;\n}\n\nXXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* dstState, const XXH64_state_t* srcState)\n{\n memcpy(dstState, srcState, sizeof(*dstState));\n}\n\nXXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH64_state_t* statePtr, XXH64_hash_t seed)\n{\n XXH64_state_t state; /* use a local state to memcpy() in order to avoid strict-aliasing warnings */\n memset(&state, 0, sizeof(state));\n state.v1 = seed + PRIME64_1 + PRIME64_2;\n state.v2 = seed + PRIME64_2;\n state.v3 = seed + 0;\n state.v4 = seed - PRIME64_1;\n /* do not write into reserved64, might be removed in a future version */\n memcpy(statePtr, &state, sizeof(state) - sizeof(state.reserved64));\n return XXH_OK;\n}\n\nXXH_PUBLIC_API XXH_errorcode\nXXH64_update (XXH64_state_t* state, const void* input, size_t len)\n{\n if (input==NULL)\n#if defined(XXH_ACCEPT_NULL_INPUT_POINTER) && (XXH_ACCEPT_NULL_INPUT_POINTER>=1)\n return XXH_OK;\n#else\n return XXH_ERROR;\n#endif\n\n { const xxh_u8* p = (const xxh_u8*)input;\n const xxh_u8* const bEnd = p + len;\n\n state->total_len += len;\n\n if (state->memsize + len < 32) { /* fill in tmp buffer */\n XXH_memcpy(((xxh_u8*)state->mem64) + state->memsize, input, len);\n state->memsize += (xxh_u32)len;\n return XXH_OK;\n }\n\n if (state->memsize) { /* tmp buffer is full */\n XXH_memcpy(((xxh_u8*)state->mem64) + state->memsize, input, 32-state->memsize);\n state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0));\n state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1));\n state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2));\n state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3));\n p += 32-state->memsize;\n state->memsize = 0;\n }\n\n if (p+32 <= bEnd) {\n const xxh_u8* const limit = bEnd - 32;\n xxh_u64 v1 = state->v1;\n xxh_u64 v2 = state->v2;\n xxh_u64 v3 = state->v3;\n xxh_u64 v4 = state->v4;\n\n do {\n v1 = XXH64_round(v1, XXH_readLE64(p)); p+=8;\n v2 = XXH64_round(v2, XXH_readLE64(p)); p+=8;\n v3 = XXH64_round(v3, XXH_readLE64(p)); p+=8;\n v4 = XXH64_round(v4, XXH_readLE64(p)); p+=8;\n } while (p<=limit);\n\n state->v1 = v1;\n state->v2 = v2;\n state->v3 = v3;\n state->v4 = v4;\n }\n\n if (p < bEnd) {\n XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));\n state->memsize = (unsigned)(bEnd-p);\n }\n }\n\n return XXH_OK;\n}\n\n\nXXH_PUBLIC_API XXH64_hash_t XXH64_digest (const XXH64_state_t* state)\n{\n xxh_u64 h64;\n\n if (state->total_len >= 32) {\n xxh_u64 const v1 = state->v1;\n xxh_u64 const v2 = state->v2;\n xxh_u64 const v3 = state->v3;\n xxh_u64 const v4 = state->v4;\n\n h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);\n h64 = XXH64_mergeRound(h64, v1);\n h64 = XXH64_mergeRound(h64, v2);\n h64 = XXH64_mergeRound(h64, v3);\n h64 = XXH64_mergeRound(h64, v4);\n } else {\n h64 = state->v3 /*seed*/ + PRIME64_5;\n }\n\n h64 += (xxh_u64) state->total_len;\n\n return XXH64_finalize(h64, (const xxh_u8*)state->mem64, (size_t)state->total_len, XXH_aligned);\n}\n\n\n/******* Canonical representation *******/\n\nXXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)\n{\n XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));\n if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);\n memcpy(dst, &hash, sizeof(*dst));\n}\n\nXXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src)\n{\n return XXH_readBE64(src);\n}\n\n\n\n/* *********************************************************************\n* XXH3\n* New generation hash designed for speed on small keys and vectorization\n************************************************************************ */\n\n#include \"xxh3.h\"\n\n\n#endif /* XXH_NO_LONG_LONG */\n\n\n#endif /* XXH_IMPLEMENTATION */\n\n\n#if defined (__cplusplus)\n}\n#endif\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstd_errors.h","metadata":0},{"basename":"zstd_errors.h","metadata":420}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":2,"start":67,"end":91},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":91},"to":{"change":7,"start":120024,"end":120024},"introduced_by":2},{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120007},"to":{"change":7,"start":120008,"end":120023},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":120023},"to":{"change":7,"start":120024,"end":120024},"introduced_by":7}],"inode":{"change":7,"pos":120024}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":120024},"to":{"change":7,"start":120025,"end":123776},"introduced_by":7}],"inode":{"change":7,"pos":120024}},"content":[{"Del":"/*\n * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.\n * 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_ERRORS_H_398273423\n#define ZSTD_ERRORS_H_398273423\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/*===== dependency =====*/\n#include /* size_t */\n\n\n/* ===== ZSTDERRORLIB_API : control library symbols visibility ===== */\n#ifndef ZSTDERRORLIB_VISIBILITY\n# if defined(__GNUC__) && (__GNUC__ >= 4)\n# define ZSTDERRORLIB_VISIBILITY __attribute__ ((visibility (\"default\")))\n# else\n# define ZSTDERRORLIB_VISIBILITY\n# endif\n#endif\n#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)\n# define ZSTDERRORLIB_API __declspec(dllexport) ZSTDERRORLIB_VISIBILITY\n#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)\n# define ZSTDERRORLIB_API __declspec(dllimport) ZSTDERRORLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/\n#else\n# define ZSTDERRORLIB_API ZSTDERRORLIB_VISIBILITY\n#endif\n\n/*-*********************************************\n * Error codes list\n *-*********************************************\n * Error codes _values_ are pinned down since v1.3.1 only.\n * Therefore, don't rely on values if you may link to any version < v1.3.1.\n *\n * Only values < 100 are considered stable.\n *\n * note 1 : this API shall be used with static linking only.\n * dynamic linking is not yet officially supported.\n * note 2 : Prefer relying on the enum than on its value whenever possible\n * This is the only supported way to use the error list < v1.3.1\n * note 3 : ZSTD_isError() is always correct, whatever the library version.\n **********************************************/\ntypedef enum {\n ZSTD_error_no_error = 0,\n ZSTD_error_GENERIC = 1,\n ZSTD_error_prefix_unknown = 10,\n ZSTD_error_version_unsupported = 12,\n ZSTD_error_frameParameter_unsupported = 14,\n ZSTD_error_frameParameter_windowTooLarge = 16,\n ZSTD_error_corruption_detected = 20,\n ZSTD_error_checksum_wrong = 22,\n ZSTD_error_dictionary_corrupted = 30,\n ZSTD_error_dictionary_wrong = 32,\n ZSTD_error_dictionaryCreation_failed = 34,\n ZSTD_error_parameter_unsupported = 40,\n ZSTD_error_parameter_outOfBound = 42,\n ZSTD_error_tableLog_tooLarge = 44,\n ZSTD_error_maxSymbolValue_tooLarge = 46,\n ZSTD_error_maxSymbolValue_tooSmall = 48,\n ZSTD_error_stage_wrong = 60,\n ZSTD_error_init_missing = 62,\n ZSTD_error_memory_allocation = 64,\n ZSTD_error_workSpace_tooSmall= 66,\n ZSTD_error_dstSize_tooSmall = 70,\n ZSTD_error_srcSize_wrong = 72,\n ZSTD_error_dstBuffer_null = 74,\n /* following error codes are __NOT STABLE__, they can be removed or changed in future versions */\n ZSTD_error_frameIndex_tooLarge = 100,\n ZSTD_error_seekableIO = 102,\n ZSTD_error_maxCode = 120 /* never EVER use this value directly, it can change in future versions! Use ZSTD_isError() instead */\n} ZSTD_ErrorCode;\n\n/*! ZSTD_getErrorCode() :\n convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,\n which can be used to compare with enum list published above */\nZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);\nZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code); /**< Same as ZSTD_getErrorName, but using a `ZSTD_ErrorCode` enum argument */\n\n\n#if defined (__cplusplus)\n}\n#endif\n\n#endif /* ZSTD_ERRORS_H_398273423 */\n"}]}},{"FileDel":{"deleted_names":[{"basename":"zstd.h","metadata":420},{"basename":"zstd.h","metadata":0}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER | DELETED","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":14},"to":{"change":7,"start":15,"end":23},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":23},"to":{"change":7,"start":24,"end":24},"introduced_by":7},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":7,"pos":14},"to":{"change":2,"start":31,"end":48},"introduced_by":2},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":2,"pos":48},"to":{"change":7,"start":24,"end":24},"introduced_by":2}],"inode":{"change":7,"pos":24}}},"content_edges":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24},"to":{"change":7,"start":25,"end":119997},"introduced_by":7}],"inode":{"change":7,"pos":24}},"content":[{"Del":"/*\n * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.\n * 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#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n#ifndef ZSTD_H_235446\n#define ZSTD_H_235446\n\n/* ====== Dependency ======*/\n#include /* INT_MAX */\n#include /* size_t */\n\n\n/* ===== ZSTDLIB_API : control library symbols visibility ===== */\n#ifndef ZSTDLIB_VISIBILITY\n# if defined(__GNUC__) && (__GNUC__ >= 4)\n# define ZSTDLIB_VISIBILITY __attribute__ ((visibility (\"default\")))\n# else\n# define ZSTDLIB_VISIBILITY\n# endif\n#endif\n#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)\n# define ZSTDLIB_API __declspec(dllexport) ZSTDLIB_VISIBILITY\n#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)\n# define ZSTDLIB_API __declspec(dllimport) ZSTDLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/\n#else\n# define ZSTDLIB_API ZSTDLIB_VISIBILITY\n#endif\n\n\n/*******************************************************************************\n Introduction\n\n zstd, short for Zstandard, is a fast lossless compression algorithm, targeting\n real-time compression scenarios at zlib-level and better compression ratios.\n The zstd compression library provides in-memory compression and decompression\n functions.\n\n The library supports regular compression levels from 1 up to ZSTD_maxCLevel(),\n which is currently 22. Levels >= 20, labeled `--ultra`, should be used with\n caution, as they require more memory. The library also offers negative\n compression levels, which extend the range of speed vs. ratio preferences.\n The lower the level, the faster the speed (at the cost of compression).\n\n Compression can be done in:\n - a single step (described as Simple API)\n - a single step, reusing a context (described as Explicit context)\n - unbounded multiple steps (described as Streaming compression)\n\n The compression ratio achievable on small data can be highly improved using\n a dictionary. Dictionary compression can be performed in:\n - a single step (described as Simple dictionary API)\n - a single step, reusing a dictionary (described as Bulk-processing\n dictionary API)\n\n Advanced experimental functions can be accessed using\n `#define ZSTD_STATIC_LINKING_ONLY` before including zstd.h.\n\n Advanced experimental APIs should never be used with a dynamically-linked\n library. They are not \"stable\"; their definitions or signatures may change in\n the future. Only static linking is allowed.\n*******************************************************************************/\n\n/*------ Version ------*/\n#define ZSTD_VERSION_MAJOR 1\n#define ZSTD_VERSION_MINOR 4\n#define ZSTD_VERSION_RELEASE 4\n\n#define ZSTD_VERSION_NUMBER (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)\nZSTDLIB_API unsigned ZSTD_versionNumber(void); /**< to check runtime library version */\n\n#define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE\n#define ZSTD_QUOTE(str) #str\n#define ZSTD_EXPAND_AND_QUOTE(str) ZSTD_QUOTE(str)\n#define ZSTD_VERSION_STRING ZSTD_EXPAND_AND_QUOTE(ZSTD_LIB_VERSION)\nZSTDLIB_API const char* ZSTD_versionString(void); /* requires v1.3.0+ */\n\n/* *************************************\n * Default constant\n ***************************************/\n#ifndef ZSTD_CLEVEL_DEFAULT\n# define ZSTD_CLEVEL_DEFAULT 3\n#endif\n\n/* *************************************\n * Constants\n ***************************************/\n\n/* All magic numbers are supposed read/written to/from files/memory using little-endian convention */\n#define ZSTD_MAGICNUMBER 0xFD2FB528 /* valid since v0.8.0 */\n#define ZSTD_MAGIC_DICTIONARY 0xEC30A437 /* valid since v0.7.0 */\n#define ZSTD_MAGIC_SKIPPABLE_START 0x184D2A50 /* all 16 values, from 0x184D2A50 to 0x184D2A5F, signal the beginning of a skippable frame */\n#define ZSTD_MAGIC_SKIPPABLE_MASK 0xFFFFFFF0\n\n#define ZSTD_BLOCKSIZELOG_MAX 17\n#define ZSTD_BLOCKSIZE_MAX (1<= `ZSTD_compressBound(srcSize)`.\n * @return : compressed size written into `dst` (<= `dstCapacity),\n * or an error code if it fails (which can be tested using ZSTD_isError()). */\nZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n int compressionLevel);\n\n/*! ZSTD_decompress() :\n * `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.\n * `dstCapacity` is an upper bound of originalSize to regenerate.\n * If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.\n * @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),\n * or an errorCode if it fails (which can be tested using ZSTD_isError()). */\nZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,\n const void* src, size_t compressedSize);\n\n/*! ZSTD_getFrameContentSize() : requires v1.3.0+\n * `src` should point to the start of a ZSTD encoded frame.\n * `srcSize` must be at least as large as the frame header.\n * hint : any size >= `ZSTD_frameHeaderSize_max` is large enough.\n * @return : - decompressed size of `src` frame content, if known\n * - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined\n * - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small)\n * note 1 : a 0 return value means the frame is valid but \"empty\".\n * note 2 : decompressed size is an optional field, it may not be present, typically in streaming mode.\n * When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.\n * In which case, it's necessary to use streaming mode to decompress data.\n * Optionally, application can rely on some implicit limit,\n * as ZSTD_decompress() only needs an upper bound of decompressed size.\n * (For example, data could be necessarily cut into blocks <= 16 KB).\n * note 3 : decompressed size is always present when compression is completed using single-pass functions,\n * such as ZSTD_compress(), ZSTD_compressCCtx() ZSTD_compress_usingDict() or ZSTD_compress_usingCDict().\n * note 4 : decompressed size can be very large (64-bits value),\n * potentially larger than what local system can handle as a single memory segment.\n * In which case, it's necessary to use streaming mode to decompress data.\n * note 5 : If source is untrusted, decompressed size could be wrong or intentionally modified.\n * Always ensure return value fits within application's authorized limits.\n * Each application can set its own limits.\n * note 6 : This function replaces ZSTD_getDecompressedSize() */\n#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)\n#define ZSTD_CONTENTSIZE_ERROR (0ULL - 2)\nZSTDLIB_API unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);\n\n/*! ZSTD_getDecompressedSize() :\n * NOTE: This function is now obsolete, in favor of ZSTD_getFrameContentSize().\n * Both functions work the same way, but ZSTD_getDecompressedSize() blends\n * \"empty\", \"unknown\" and \"error\" results to the same return value (0),\n * while ZSTD_getFrameContentSize() gives them separate return values.\n * @return : decompressed size of `src` frame content _if known and not empty_, 0 otherwise. */\nZSTDLIB_API unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);\n\n/*! ZSTD_findFrameCompressedSize() :\n * `src` should point to the start of a ZSTD frame or skippable frame.\n * `srcSize` must be >= first frame size\n * @return : the compressed size of the first frame starting at `src`,\n * suitable to pass as `srcSize` to `ZSTD_decompress` or similar,\n * or an error code if input is invalid */\nZSTDLIB_API size_t ZSTD_findFrameCompressedSize(const void* src, size_t srcSize);\n\n\n/*====== Helper functions ======*/\n#define ZSTD_COMPRESSBOUND(srcSize) ((srcSize) + ((srcSize)>>8) + (((srcSize) < (128<<10)) ? (((128<<10) - (srcSize)) >> 11) /* margin, from 64 to 0 */ : 0)) /* this formula ensures that bound(A) + bound(B) <= bound(A+B) as long as A and B >= 128 KB */\nZSTDLIB_API size_t ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case single-pass scenario */\nZSTDLIB_API unsigned ZSTD_isError(size_t code); /*!< tells if a `size_t` function result is an error code */\nZSTDLIB_API const char* ZSTD_getErrorName(size_t code); /*!< provides readable string from an error code */\nZSTDLIB_API int ZSTD_minCLevel(void); /*!< minimum negative compression level allowed */\nZSTDLIB_API int ZSTD_maxCLevel(void); /*!< maximum compression level available */\n\n\n/***************************************\n* Explicit context\n***************************************/\n/*= Compression context\n * When compressing many times,\n * it is recommended to allocate a context just once,\n * and re-use it for each successive compression operation.\n * This will make workload friendlier for system's memory.\n * Note : re-using context is just a speed / resource optimization.\n * It doesn't change the compression ratio, which remains identical.\n * Note 2 : In multi-threaded environments,\n * use one different context per thread for parallel execution.\n */\ntypedef struct ZSTD_CCtx_s ZSTD_CCtx;\nZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);\nZSTDLIB_API size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx);\n\n/*! ZSTD_compressCCtx() :\n * Same as ZSTD_compress(), using an explicit ZSTD_CCtx.\n * Important : in order to behave similarly to `ZSTD_compress()`,\n * this function compresses at requested compression level,\n * __ignoring any other parameter__ .\n * If any advanced parameter was set using the advanced API,\n * they will all be reset. Only `compressionLevel` remains.\n */\nZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n int compressionLevel);\n\n/*= Decompression context\n * When decompressing many times,\n * it is recommended to allocate a context only once,\n * and re-use it for each successive compression operation.\n * This will make workload friendlier for system's memory.\n * Use one context per thread for parallel execution. */\ntypedef struct ZSTD_DCtx_s ZSTD_DCtx;\nZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void);\nZSTDLIB_API size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx);\n\n/*! ZSTD_decompressDCtx() :\n * Same as ZSTD_decompress(),\n * requires an allocated ZSTD_DCtx.\n * Compatible with sticky parameters.\n */\nZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize);\n\n\n/***************************************\n* Advanced compression API\n***************************************/\n\n/* API design :\n * Parameters are pushed one by one into an existing context,\n * using ZSTD_CCtx_set*() functions.\n * Pushed parameters are sticky : they are valid for next compressed frame, and any subsequent frame.\n * \"sticky\" parameters are applicable to `ZSTD_compress2()` and `ZSTD_compressStream*()` !\n * __They do not apply to \"simple\" one-shot variants such as ZSTD_compressCCtx()__ .\n *\n * It's possible to reset all parameters to \"default\" using ZSTD_CCtx_reset().\n *\n * This API supercedes all other \"advanced\" API entry points in the experimental section.\n * In the future, we expect to remove from experimental API entry points which are redundant with this API.\n */\n\n\n/* Compression strategies, listed from fastest to strongest */\ntypedef enum { ZSTD_fast=1,\n ZSTD_dfast=2,\n ZSTD_greedy=3,\n ZSTD_lazy=4,\n ZSTD_lazy2=5,\n ZSTD_btlazy2=6,\n ZSTD_btopt=7,\n ZSTD_btultra=8,\n ZSTD_btultra2=9\n /* note : new strategies _might_ be added in the future.\n Only the order (from fast to strong) is guaranteed */\n} ZSTD_strategy;\n\n\ntypedef enum {\n\n /* compression parameters\n * Note: When compressing with a ZSTD_CDict these parameters are superseded\n * by the parameters used to construct the ZSTD_CDict.\n * See ZSTD_CCtx_refCDict() for more info (superseded-by-cdict). */\n ZSTD_c_compressionLevel=100, /* Set compression parameters according to pre-defined cLevel table.\n * Note that exact compression parameters are dynamically determined,\n * depending on both compression level and srcSize (when known).\n * Default level is ZSTD_CLEVEL_DEFAULT==3.\n * Special: value 0 means default, which is controlled by ZSTD_CLEVEL_DEFAULT.\n * Note 1 : it's possible to pass a negative compression level.\n * Note 2 : setting a level resets all other compression parameters to default */\n /* Advanced compression parameters :\n * It's possible to pin down compression parameters to some specific values.\n * In which case, these values are no longer dynamically selected by the compressor */\n ZSTD_c_windowLog=101, /* Maximum allowed back-reference distance, expressed as power of 2.\n * This will set a memory budget for streaming decompression,\n * with larger values requiring more memory\n * and typically compressing more.\n * Must be clamped between ZSTD_WINDOWLOG_MIN and ZSTD_WINDOWLOG_MAX.\n * Special: value 0 means \"use default windowLog\".\n * Note: Using a windowLog greater than ZSTD_WINDOWLOG_LIMIT_DEFAULT\n * requires explicitly allowing such size at streaming decompression stage. */\n ZSTD_c_hashLog=102, /* Size of the initial probe table, as a power of 2.\n * Resulting memory usage is (1 << (hashLog+2)).\n * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX.\n * Larger tables improve compression ratio of strategies <= dFast,\n * and improve speed of strategies > dFast.\n * Special: value 0 means \"use default hashLog\". */\n ZSTD_c_chainLog=103, /* Size of the multi-probe search table, as a power of 2.\n * Resulting memory usage is (1 << (chainLog+2)).\n * Must be clamped between ZSTD_CHAINLOG_MIN and ZSTD_CHAINLOG_MAX.\n * Larger tables result in better and slower compression.\n * This parameter is useless for \"fast\" strategy.\n * It's still useful when using \"dfast\" strategy,\n * in which case it defines a secondary probe table.\n * Special: value 0 means \"use default chainLog\". */\n ZSTD_c_searchLog=104, /* Number of search attempts, as a power of 2.\n * More attempts result in better and slower compression.\n * This parameter is useless for \"fast\" and \"dFast\" strategies.\n * Special: value 0 means \"use default searchLog\". */\n ZSTD_c_minMatch=105, /* Minimum size of searched matches.\n * Note that Zstandard can still find matches of smaller size,\n * it just tweaks its search algorithm to look for this size and larger.\n * Larger values increase compression and decompression speed, but decrease ratio.\n * Must be clamped between ZSTD_MINMATCH_MIN and ZSTD_MINMATCH_MAX.\n * Note that currently, for all strategies < btopt, effective minimum is 4.\n * , for all strategies > fast, effective maximum is 6.\n * Special: value 0 means \"use default minMatchLength\". */\n ZSTD_c_targetLength=106, /* Impact of this field depends on strategy.\n * For strategies btopt, btultra & btultra2:\n * Length of Match considered \"good enough\" to stop search.\n * Larger values make compression stronger, and slower.\n * For strategy fast:\n * Distance between match sampling.\n * Larger values make compression faster, and weaker.\n * Special: value 0 means \"use default targetLength\". */\n ZSTD_c_strategy=107, /* See ZSTD_strategy enum definition.\n * The higher the value of selected strategy, the more complex it is,\n * resulting in stronger and slower compression.\n * Special: value 0 means \"use default strategy\". */\n\n /* LDM mode parameters */\n ZSTD_c_enableLongDistanceMatching=160, /* Enable long distance matching.\n * This parameter is designed to improve compression ratio\n * for large inputs, by finding large matches at long distance.\n * It increases memory usage and window size.\n * Note: enabling this parameter increases default ZSTD_c_windowLog to 128 MB\n * except when expressly set to a different value. */\n ZSTD_c_ldmHashLog=161, /* Size of the table for long distance matching, as a power of 2.\n * Larger values increase memory usage and compression ratio,\n * but decrease compression speed.\n * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX\n * default: windowlog - 7.\n * Special: value 0 means \"automatically determine hashlog\". */\n ZSTD_c_ldmMinMatch=162, /* Minimum match size for long distance matcher.\n * Larger/too small values usually decrease compression ratio.\n * Must be clamped between ZSTD_LDM_MINMATCH_MIN and ZSTD_LDM_MINMATCH_MAX.\n * Special: value 0 means \"use default value\" (default: 64). */\n ZSTD_c_ldmBucketSizeLog=163, /* Log size of each bucket in the LDM hash table for collision resolution.\n * Larger values improve collision resolution but decrease compression speed.\n * The maximum value is ZSTD_LDM_BUCKETSIZELOG_MAX.\n * Special: value 0 means \"use default value\" (default: 3). */\n ZSTD_c_ldmHashRateLog=164, /* Frequency of inserting/looking up entries into the LDM hash table.\n * Must be clamped between 0 and (ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN).\n * Default is MAX(0, (windowLog - ldmHashLog)), optimizing hash table usage.\n * Larger values improve compression speed.\n * Deviating far from default value will likely result in a compression ratio decrease.\n * Special: value 0 means \"automatically determine hashRateLog\". */\n\n /* frame parameters */\n ZSTD_c_contentSizeFlag=200, /* Content size will be written into frame header _whenever known_ (default:1)\n * Content size must be known at the beginning of compression.\n * This is automatically the case when using ZSTD_compress2(),\n * For streaming scenarios, content size must be provided with ZSTD_CCtx_setPledgedSrcSize() */\n ZSTD_c_checksumFlag=201, /* A 32-bits checksum of content is written at end of frame (default:0) */\n ZSTD_c_dictIDFlag=202, /* When applicable, dictionary's ID is written into frame header (default:1) */\n\n /* multi-threading parameters */\n /* These parameters are only useful if multi-threading is enabled (compiled with build macro ZSTD_MULTITHREAD).\n * They return an error otherwise. */\n ZSTD_c_nbWorkers=400, /* Select how many threads will be spawned to compress in parallel.\n * When nbWorkers >= 1, triggers asynchronous mode when used with ZSTD_compressStream*() :\n * ZSTD_compressStream*() consumes input and flush output if possible, but immediately gives back control to caller,\n * while compression work is performed in parallel, within worker threads.\n * (note : a strong exception to this rule is when first invocation of ZSTD_compressStream2() sets ZSTD_e_end :\n * in which case, ZSTD_compressStream2() delegates to ZSTD_compress2(), which is always a blocking call).\n * More workers improve speed, but also increase memory usage.\n * Default value is `0`, aka \"single-threaded mode\" : no worker is spawned, compression is performed inside Caller's thread, all invocations are blocking */\n ZSTD_c_jobSize=401, /* Size of a compression job. This value is enforced only when nbWorkers >= 1.\n * Each compression job is completed in parallel, so this value can indirectly impact the nb of active threads.\n * 0 means default, which is dynamically determined based on compression parameters.\n * Job size must be a minimum of overlap size, or 1 MB, whichever is largest.\n * The minimum size is automatically and transparently enforced. */\n ZSTD_c_overlapLog=402, /* Control the overlap size, as a fraction of window size.\n * The overlap size is an amount of data reloaded from previous job at the beginning of a new job.\n * It helps preserve compression ratio, while each job is compressed in parallel.\n * This value is enforced only when nbWorkers >= 1.\n * Larger values increase compression ratio, but decrease speed.\n * Possible values range from 0 to 9 :\n * - 0 means \"default\" : value will be determined by the library, depending on strategy\n * - 1 means \"no overlap\"\n * - 9 means \"full overlap\", using a full window size.\n * Each intermediate rank increases/decreases load size by a factor 2 :\n * 9: full window; 8: w/2; 7: w/4; 6: w/8; 5:w/16; 4: w/32; 3:w/64; 2:w/128; 1:no overlap; 0:default\n * default value varies between 6 and 9, depending on strategy */\n\n /* note : additional experimental parameters are also available\n * within the experimental section of the API.\n * At the time of this writing, they include :\n * ZSTD_c_rsyncable\n * ZSTD_c_format\n * ZSTD_c_forceMaxWindow\n * ZSTD_c_forceAttachDict\n * ZSTD_c_literalCompressionMode\n * ZSTD_c_targetCBlockSize\n * ZSTD_c_srcSizeHint\n * Because they are not stable, it's necessary to define ZSTD_STATIC_LINKING_ONLY to access them.\n * note : never ever use experimentalParam? names directly;\n * also, the enums values themselves are unstable and can still change.\n */\n ZSTD_c_experimentalParam1=500,\n ZSTD_c_experimentalParam2=10,\n ZSTD_c_experimentalParam3=1000,\n ZSTD_c_experimentalParam4=1001,\n ZSTD_c_experimentalParam5=1002,\n ZSTD_c_experimentalParam6=1003,\n ZSTD_c_experimentalParam7=1004\n} ZSTD_cParameter;\n\ntypedef struct {\n size_t error;\n int lowerBound;\n int upperBound;\n} ZSTD_bounds;\n\n/*! ZSTD_cParam_getBounds() :\n * All parameters must belong to an interval with lower and upper bounds,\n * otherwise they will either trigger an error or be automatically clamped.\n * @return : a structure, ZSTD_bounds, which contains\n * - an error status field, which must be tested using ZSTD_isError()\n * - lower and upper bounds, both inclusive\n */\nZSTDLIB_API ZSTD_bounds ZSTD_cParam_getBounds(ZSTD_cParameter cParam);\n\n/*! ZSTD_CCtx_setParameter() :\n * Set one compression parameter, selected by enum ZSTD_cParameter.\n * All parameters have valid bounds. Bounds can be queried using ZSTD_cParam_getBounds().\n * Providing a value beyond bound will either clamp it, or trigger an error (depending on parameter).\n * Setting a parameter is generally only possible during frame initialization (before starting compression).\n * Exception : when using multi-threading mode (nbWorkers >= 1),\n * the following parameters can be updated _during_ compression (within same frame):\n * => compressionLevel, hashLog, chainLog, searchLog, minMatch, targetLength and strategy.\n * new parameters will be active for next job only (after a flush()).\n * @return : an error code (which can be tested using ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_CCtx_setParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int value);\n\n/*! ZSTD_CCtx_setPledgedSrcSize() :\n * Total input data size to be compressed as a single frame.\n * Value will be written in frame header, unless if explicitly forbidden using ZSTD_c_contentSizeFlag.\n * This value will also be controlled at end of frame, and trigger an error if not respected.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Note 1 : pledgedSrcSize==0 actually means zero, aka an empty frame.\n * In order to mean \"unknown content size\", pass constant ZSTD_CONTENTSIZE_UNKNOWN.\n * ZSTD_CONTENTSIZE_UNKNOWN is default value for any new frame.\n * Note 2 : pledgedSrcSize is only valid once, for the next frame.\n * It's discarded at the end of the frame, and replaced by ZSTD_CONTENTSIZE_UNKNOWN.\n * Note 3 : Whenever all input data is provided and consumed in a single round,\n * for example with ZSTD_compress2(),\n * or invoking immediately ZSTD_compressStream2(,,,ZSTD_e_end),\n * this value is automatically overridden by srcSize instead.\n */\nZSTDLIB_API size_t ZSTD_CCtx_setPledgedSrcSize(ZSTD_CCtx* cctx, unsigned long long pledgedSrcSize);\n\ntypedef enum {\n ZSTD_reset_session_only = 1,\n ZSTD_reset_parameters = 2,\n ZSTD_reset_session_and_parameters = 3\n} ZSTD_ResetDirective;\n\n/*! ZSTD_CCtx_reset() :\n * There are 2 different things that can be reset, independently or jointly :\n * - The session : will stop compressing current frame, and make CCtx ready to start a new one.\n * Useful after an error, or to interrupt any ongoing compression.\n * Any internal data not yet flushed is cancelled.\n * Compression parameters and dictionary remain unchanged.\n * They will be used to compress next frame.\n * Resetting session never fails.\n * - The parameters : changes all parameters back to \"default\".\n * This removes any reference to any dictionary too.\n * Parameters can only be changed between 2 sessions (i.e. no compression is currently ongoing)\n * otherwise the reset fails, and function returns an error value (which can be tested using ZSTD_isError())\n * - Both : similar to resetting the session, followed by resetting parameters.\n */\nZSTDLIB_API size_t ZSTD_CCtx_reset(ZSTD_CCtx* cctx, ZSTD_ResetDirective reset);\n\n/*! ZSTD_compress2() :\n * Behave the same as ZSTD_compressCCtx(), but compression parameters are set using the advanced API.\n * ZSTD_compress2() always starts a new frame.\n * Should cctx hold data from a previously unfinished frame, everything about it is forgotten.\n * - Compression parameters are pushed into CCtx before starting compression, using ZSTD_CCtx_set*()\n * - The function is always blocking, returns when compression is completed.\n * Hint : compression runs faster if `dstCapacity` >= `ZSTD_compressBound(srcSize)`.\n * @return : compressed size written into `dst` (<= `dstCapacity),\n * or an error code if it fails (which can be tested using ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_compress2( ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize);\n\n\n/***************************************\n* Advanced decompression API\n***************************************/\n\n/* The advanced API pushes parameters one by one into an existing DCtx context.\n * Parameters are sticky, and remain valid for all following frames\n * using the same DCtx context.\n * It's possible to reset parameters to default values using ZSTD_DCtx_reset().\n * Note : This API is compatible with existing ZSTD_decompressDCtx() and ZSTD_decompressStream().\n * Therefore, no new decompression function is necessary.\n */\n\ntypedef enum {\n\n ZSTD_d_windowLogMax=100, /* Select a size limit (in power of 2) beyond which\n * the streaming API will refuse to allocate memory buffer\n * in order to protect the host from unreasonable memory requirements.\n * This parameter is only useful in streaming mode, since no internal buffer is allocated in single-pass mode.\n * By default, a decompression context accepts window sizes <= (1 << ZSTD_WINDOWLOG_LIMIT_DEFAULT).\n * Special: value 0 means \"use default maximum windowLog\". */\n\n /* note : additional experimental parameters are also available\n * within the experimental section of the API.\n * At the time of this writing, they include :\n * ZSTD_c_format\n * Because they are not stable, it's necessary to define ZSTD_STATIC_LINKING_ONLY to access them.\n * note : never ever use experimentalParam? names directly\n */\n ZSTD_d_experimentalParam1=1000\n\n} ZSTD_dParameter;\n\n/*! ZSTD_dParam_getBounds() :\n * All parameters must belong to an interval with lower and upper bounds,\n * otherwise they will either trigger an error or be automatically clamped.\n * @return : a structure, ZSTD_bounds, which contains\n * - an error status field, which must be tested using ZSTD_isError()\n * - both lower and upper bounds, inclusive\n */\nZSTDLIB_API ZSTD_bounds ZSTD_dParam_getBounds(ZSTD_dParameter dParam);\n\n/*! ZSTD_DCtx_setParameter() :\n * Set one compression parameter, selected by enum ZSTD_dParameter.\n * All parameters have valid bounds. Bounds can be queried using ZSTD_dParam_getBounds().\n * Providing a value beyond bound will either clamp it, or trigger an error (depending on parameter).\n * Setting a parameter is only possible during frame initialization (before starting decompression).\n * @return : 0, or an error code (which can be tested using ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_DCtx_setParameter(ZSTD_DCtx* dctx, ZSTD_dParameter param, int value);\n\n/*! ZSTD_DCtx_reset() :\n * Return a DCtx to clean state.\n * Session and parameters can be reset jointly or separately.\n * Parameters can only be reset when no active frame is being decompressed.\n * @return : 0, or an error code, which can be tested with ZSTD_isError()\n */\nZSTDLIB_API size_t ZSTD_DCtx_reset(ZSTD_DCtx* dctx, ZSTD_ResetDirective reset);\n\n\n/****************************\n* Streaming\n****************************/\n\ntypedef struct ZSTD_inBuffer_s {\n const void* src; /**< start of input buffer */\n size_t size; /**< size of input buffer */\n size_t pos; /**< position where reading stopped. Will be updated. Necessarily 0 <= pos <= size */\n} ZSTD_inBuffer;\n\ntypedef struct ZSTD_outBuffer_s {\n void* dst; /**< start of output buffer */\n size_t size; /**< size of output buffer */\n size_t pos; /**< position where writing stopped. Will be updated. Necessarily 0 <= pos <= size */\n} ZSTD_outBuffer;\n\n\n\n/*-***********************************************************************\n* Streaming compression - HowTo\n*\n* A ZSTD_CStream object is required to track streaming operation.\n* Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.\n* ZSTD_CStream objects can be reused multiple times on consecutive compression operations.\n* It is recommended to re-use ZSTD_CStream since it will play nicer with system's memory, by re-using already allocated memory.\n*\n* For parallel execution, use one separate ZSTD_CStream per thread.\n*\n* note : since v1.3.0, ZSTD_CStream and ZSTD_CCtx are the same thing.\n*\n* Parameters are sticky : when starting a new compression on the same context,\n* it will re-use the same sticky parameters as previous compression session.\n* When in doubt, it's recommended to fully initialize the context before usage.\n* Use ZSTD_CCtx_reset() to reset the context and ZSTD_CCtx_setParameter(),\n* ZSTD_CCtx_setPledgedSrcSize(), or ZSTD_CCtx_loadDictionary() and friends to\n* set more specific parameters, the pledged source size, or load a dictionary.\n*\n* Use ZSTD_compressStream2() with ZSTD_e_continue as many times as necessary to\n* consume input stream. The function will automatically update both `pos`\n* fields within `input` and `output`.\n* Note that the function may not consume the entire input, for example, because\n* the output buffer is already full, in which case `input.pos < input.size`.\n* The caller must check if input has been entirely consumed.\n* If not, the caller must make some room to receive more compressed data,\n* and then present again remaining input data.\n* note: ZSTD_e_continue is guaranteed to make some forward progress when called,\n* but doesn't guarantee maximal forward progress. This is especially relevant\n* when compressing with multiple threads. The call won't block if it can\n* consume some input, but if it can't it will wait for some, but not all,\n* output to be flushed.\n* @return : provides a minimum amount of data remaining to be flushed from internal buffers\n* or an error code, which can be tested using ZSTD_isError().\n*\n* At any moment, it's possible to flush whatever data might remain stuck within internal buffer,\n* using ZSTD_compressStream2() with ZSTD_e_flush. `output->pos` will be updated.\n* Note that, if `output->size` is too small, a single invocation with ZSTD_e_flush might not be enough (return code > 0).\n* In which case, make some room to receive more compressed data, and call again ZSTD_compressStream2() with ZSTD_e_flush.\n* You must continue calling ZSTD_compressStream2() with ZSTD_e_flush until it returns 0, at which point you can change the\n* operation.\n* note: ZSTD_e_flush will flush as much output as possible, meaning when compressing with multiple threads, it will\n* block until the flush is complete or the output buffer is full.\n* @return : 0 if internal buffers are entirely flushed,\n* >0 if some data still present within internal buffer (the value is minimal estimation of remaining size),\n* or an error code, which can be tested using ZSTD_isError().\n*\n* Calling ZSTD_compressStream2() with ZSTD_e_end instructs to finish a frame.\n* It will perform a flush and write frame epilogue.\n* The epilogue is required for decoders to consider a frame completed.\n* flush operation is the same, and follows same rules as calling ZSTD_compressStream2() with ZSTD_e_flush.\n* You must continue calling ZSTD_compressStream2() with ZSTD_e_end until it returns 0, at which point you are free to\n* start a new frame.\n* note: ZSTD_e_end will flush as much output as possible, meaning when compressing with multiple threads, it will\n* block until the flush is complete or the output buffer is full.\n* @return : 0 if frame fully completed and fully flushed,\n* >0 if some data still present within internal buffer (the value is minimal estimation of remaining size),\n* or an error code, which can be tested using ZSTD_isError().\n*\n* *******************************************************************/\n\ntypedef ZSTD_CCtx ZSTD_CStream; /**< CCtx and CStream are now effectively same object (>= v1.3.0) */\n /* Continue to distinguish them for compatibility with older versions <= v1.2.0 */\n/*===== ZSTD_CStream management functions =====*/\nZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void);\nZSTDLIB_API size_t ZSTD_freeCStream(ZSTD_CStream* zcs);\n\n/*===== Streaming compression functions =====*/\ntypedef enum {\n ZSTD_e_continue=0, /* collect more data, encoder decides when to output compressed result, for optimal compression ratio */\n ZSTD_e_flush=1, /* flush any data provided so far,\n * it creates (at least) one new block, that can be decoded immediately on reception;\n * frame will continue: any future data can still reference previously compressed data, improving compression.\n * note : multithreaded compression will block to flush as much output as possible. */\n ZSTD_e_end=2 /* flush any remaining data _and_ close current frame.\n * note that frame is only closed after compressed data is fully flushed (return value == 0).\n * After that point, any additional data starts a new frame.\n * note : each frame is independent (does not reference any content from previous frame).\n : note : multithreaded compression will block to flush as much output as possible. */\n} ZSTD_EndDirective;\n\n/*! ZSTD_compressStream2() :\n * Behaves about the same as ZSTD_compressStream, with additional control on end directive.\n * - Compression parameters are pushed into CCtx before starting compression, using ZSTD_CCtx_set*()\n * - Compression parameters cannot be changed once compression is started (save a list of exceptions in multi-threading mode)\n * - output->pos must be <= dstCapacity, input->pos must be <= srcSize\n * - output->pos and input->pos will be updated. They are guaranteed to remain below their respective limit.\n * - When nbWorkers==0 (default), function is blocking : it completes its job before returning to caller.\n * - When nbWorkers>=1, function is non-blocking : it just acquires a copy of input, and distributes jobs to internal worker threads, flush whatever is available,\n * and then immediately returns, just indicating that there is some data remaining to be flushed.\n * The function nonetheless guarantees forward progress : it will return only after it reads or write at least 1+ byte.\n * - Exception : if the first call requests a ZSTD_e_end directive and provides enough dstCapacity, the function delegates to ZSTD_compress2() which is always blocking.\n * - @return provides a minimum amount of data remaining to be flushed from internal buffers\n * or an error code, which can be tested using ZSTD_isError().\n * if @return != 0, flush is not fully completed, there is still some data left within internal buffers.\n * This is useful for ZSTD_e_flush, since in this case more flushes are necessary to empty all buffers.\n * For ZSTD_e_end, @return == 0 when internal buffers are fully flushed and frame is completed.\n * - after a ZSTD_e_end directive, if internal buffer is not fully flushed (@return != 0),\n * only ZSTD_e_end or ZSTD_e_flush operations are allowed.\n * Before starting a new compression job, or changing compression parameters,\n * it is required to fully flush internal buffers.\n */\nZSTDLIB_API size_t ZSTD_compressStream2( ZSTD_CCtx* cctx,\n ZSTD_outBuffer* output,\n ZSTD_inBuffer* input,\n ZSTD_EndDirective endOp);\n\n\n/* These buffer sizes are softly recommended.\n * They are not required : ZSTD_compressStream*() happily accepts any buffer size, for both input and output.\n * Respecting the recommended size just makes it a bit easier for ZSTD_compressStream*(),\n * reducing the amount of memory shuffling and buffering, resulting in minor performance savings.\n *\n * However, note that these recommendations are from the perspective of a C caller program.\n * If the streaming interface is invoked from some other language,\n * especially managed ones such as Java or Go, through a foreign function interface such as jni or cgo,\n * a major performance rule is to reduce crossing such interface to an absolute minimum.\n * It's not rare that performance ends being spent more into the interface, rather than compression itself.\n * In which cases, prefer using large buffers, as large as practical,\n * for both input and output, to reduce the nb of roundtrips.\n */\nZSTDLIB_API size_t ZSTD_CStreamInSize(void); /**< recommended size for input buffer */\nZSTDLIB_API size_t ZSTD_CStreamOutSize(void); /**< recommended size for output buffer. Guarantee to successfully flush at least one complete compressed block. */\n\n\n/* *****************************************************************************\n * This following is a legacy streaming API.\n * It can be replaced by ZSTD_CCtx_reset() and ZSTD_compressStream2().\n * It is redundant, but remains fully supported.\n * Advanced parameters and dictionary compression can only be used through the\n * new API.\n ******************************************************************************/\n\n/*!\n * Equivalent to:\n *\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * ZSTD_CCtx_refCDict(zcs, NULL); // clear the dictionary (if any)\n * ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);\n */\nZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel);\n/*!\n * Alternative for ZSTD_compressStream2(zcs, output, input, ZSTD_e_continue).\n * NOTE: The return value is different. ZSTD_compressStream() returns a hint for\n * the next read size (if non-zero and not an error). ZSTD_compressStream2()\n * returns the minimum nb of bytes left to flush (if non-zero and not an error).\n */\nZSTDLIB_API size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);\n/*! Equivalent to ZSTD_compressStream2(zcs, output, &emptyInput, ZSTD_e_flush). */\nZSTDLIB_API size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);\n/*! Equivalent to ZSTD_compressStream2(zcs, output, &emptyInput, ZSTD_e_end). */\nZSTDLIB_API size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);\n\n\n/*-***************************************************************************\n* Streaming decompression - HowTo\n*\n* A ZSTD_DStream object is required to track streaming operations.\n* Use ZSTD_createDStream() and ZSTD_freeDStream() to create/release resources.\n* ZSTD_DStream objects can be re-used multiple times.\n*\n* Use ZSTD_initDStream() to start a new decompression operation.\n* @return : recommended first input size\n* Alternatively, use advanced API to set specific properties.\n*\n* Use ZSTD_decompressStream() repetitively to consume your input.\n* The function will update both `pos` fields.\n* If `input.pos < input.size`, some input has not been consumed.\n* It's up to the caller to present again remaining data.\n* The function tries to flush all data decoded immediately, respecting output buffer size.\n* If `output.pos < output.size`, decoder has flushed everything it could.\n* But if `output.pos == output.size`, there might be some data left within internal buffers.,\n* In which case, call ZSTD_decompressStream() again to flush whatever remains in the buffer.\n* Note : with no additional input provided, amount of data flushed is necessarily <= ZSTD_BLOCKSIZE_MAX.\n* @return : 0 when a frame is completely decoded and fully flushed,\n* or an error code, which can be tested using ZSTD_isError(),\n* or any other value > 0, which means there is still some decoding or flushing to do to complete current frame :\n* the return value is a suggested next input size (just a hint for better latency)\n* that will never request more than the remaining frame size.\n* *******************************************************************************/\n\ntypedef ZSTD_DCtx ZSTD_DStream; /**< DCtx and DStream are now effectively same object (>= v1.3.0) */\n /* For compatibility with versions <= v1.2.0, prefer differentiating them. */\n/*===== ZSTD_DStream management functions =====*/\nZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void);\nZSTDLIB_API size_t ZSTD_freeDStream(ZSTD_DStream* zds);\n\n/*===== Streaming decompression functions =====*/\n\n/* This function is redundant with the advanced API and equivalent to:\n *\n * ZSTD_DCtx_reset(zds);\n * ZSTD_DCtx_refDDict(zds, NULL);\n */\nZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds);\n\nZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);\n\nZSTDLIB_API size_t ZSTD_DStreamInSize(void); /*!< recommended size for input buffer */\nZSTDLIB_API size_t ZSTD_DStreamOutSize(void); /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */\n\n\n/**************************\n* Simple dictionary API\n***************************/\n/*! ZSTD_compress_usingDict() :\n * Compression at an explicit compression level using a Dictionary.\n * A dictionary can be any arbitrary data segment (also called a prefix),\n * or a buffer with specified information (see dictBuilder/zdict.h).\n * Note : This function loads the dictionary, resulting in significant startup delay.\n * It's intended for a dictionary used only once.\n * Note 2 : When `dict == NULL || dictSize < 8` no dictionary is used. */\nZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const void* dict,size_t dictSize,\n int compressionLevel);\n\n/*! ZSTD_decompress_usingDict() :\n * Decompression using a known Dictionary.\n * Dictionary must be identical to the one used during compression.\n * Note : This function loads the dictionary, resulting in significant startup delay.\n * It's intended for a dictionary used only once.\n * Note : When `dict == NULL || dictSize < 8` no dictionary is used. */\nZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const void* dict,size_t dictSize);\n\n\n/***********************************\n * Bulk processing dictionary API\n **********************************/\ntypedef struct ZSTD_CDict_s ZSTD_CDict;\n\n/*! ZSTD_createCDict() :\n * When compressing multiple messages or blocks using the same dictionary,\n * it's recommended to digest the dictionary only once, since it's a costly operation.\n * ZSTD_createCDict() will create a state from digesting a dictionary.\n * The resulting state can be used for future compression operations with very limited startup cost.\n * ZSTD_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.\n * @dictBuffer can be released after ZSTD_CDict creation, because its content is copied within CDict.\n * Note 1 : Consider experimental function `ZSTD_createCDict_byReference()` if you prefer to not duplicate @dictBuffer content.\n * Note 2 : A ZSTD_CDict can be created from an empty @dictBuffer,\n * in which case the only thing that it transports is the @compressionLevel.\n * This can be useful in a pipeline featuring ZSTD_compress_usingCDict() exclusively,\n * expecting a ZSTD_CDict parameter with any data, including those without a known dictionary. */\nZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize,\n int compressionLevel);\n\n/*! ZSTD_freeCDict() :\n * Function frees memory allocated by ZSTD_createCDict(). */\nZSTDLIB_API size_t ZSTD_freeCDict(ZSTD_CDict* CDict);\n\n/*! ZSTD_compress_usingCDict() :\n * Compression using a digested Dictionary.\n * Recommended when same dictionary is used multiple times.\n * Note : compression level is _decided at dictionary creation time_,\n * and frame parameters are hardcoded (dictID=yes, contentSize=yes, checksum=no) */\nZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const ZSTD_CDict* cdict);\n\n\ntypedef struct ZSTD_DDict_s ZSTD_DDict;\n\n/*! ZSTD_createDDict() :\n * Create a digested dictionary, ready to start decompression operation without startup delay.\n * dictBuffer can be released after DDict creation, as its content is copied inside DDict. */\nZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);\n\n/*! ZSTD_freeDDict() :\n * Function frees memory allocated with ZSTD_createDDict() */\nZSTDLIB_API size_t ZSTD_freeDDict(ZSTD_DDict* ddict);\n\n/*! ZSTD_decompress_usingDDict() :\n * Decompression using a digested Dictionary.\n * Recommended when same dictionary is used multiple times. */\nZSTDLIB_API size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const ZSTD_DDict* ddict);\n\n\n/********************************\n * Dictionary helper functions\n *******************************/\n\n/*! ZSTD_getDictID_fromDict() :\n * Provides the dictID stored within dictionary.\n * if @return == 0, the dictionary is not conformant with Zstandard specification.\n * It can still be loaded, but as a content-only dictionary. */\nZSTDLIB_API unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize);\n\n/*! ZSTD_getDictID_fromDDict() :\n * Provides the dictID of the dictionary loaded into `ddict`.\n * If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.\n * Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */\nZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);\n\n/*! ZSTD_getDictID_fromFrame() :\n * Provides the dictID required to decompressed the frame stored within `src`.\n * If @return == 0, the dictID could not be decoded.\n * This could for one of the following reasons :\n * - The frame does not require a dictionary to be decoded (most common case).\n * - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.\n * Note : this use case also happens when using a non-conformant dictionary.\n * - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).\n * - This is not a Zstandard frame.\n * When identifying the exact failure cause, it's possible to use ZSTD_getFrameHeader(), which will provide a more precise error code. */\nZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);\n\n\n/*******************************************************************************\n * Advanced dictionary and prefix API\n *\n * This API allows dictionaries to be used with ZSTD_compress2(),\n * ZSTD_compressStream2(), and ZSTD_decompress(). Dictionaries are sticky, and\n * only reset with the context is reset with ZSTD_reset_parameters or\n * ZSTD_reset_session_and_parameters. Prefixes are single-use.\n ******************************************************************************/\n\n\n/*! ZSTD_CCtx_loadDictionary() :\n * Create an internal CDict from `dict` buffer.\n * Decompression will have to use same dictionary.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Special: Loading a NULL (or 0-size) dictionary invalidates previous dictionary,\n * meaning \"return to no-dictionary mode\".\n * Note 1 : Dictionary is sticky, it will be used for all future compressed frames.\n * To return to \"no-dictionary\" situation, load a NULL dictionary (or reset parameters).\n * Note 2 : Loading a dictionary involves building tables.\n * It's also a CPU consuming operation, with non-negligible impact on latency.\n * Tables are dependent on compression parameters, and for this reason,\n * compression parameters can no longer be changed after loading a dictionary.\n * Note 3 :`dict` content will be copied internally.\n * Use experimental ZSTD_CCtx_loadDictionary_byReference() to reference content instead.\n * In such a case, dictionary buffer must outlive its users.\n * Note 4 : Use ZSTD_CCtx_loadDictionary_advanced()\n * to precisely select how dictionary content must be interpreted. */\nZSTDLIB_API size_t ZSTD_CCtx_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);\n\n/*! ZSTD_CCtx_refCDict() :\n * Reference a prepared dictionary, to be used for all next compressed frames.\n * Note that compression parameters are enforced from within CDict,\n * and supersede any compression parameter previously set within CCtx.\n * The parameters ignored are labled as \"superseded-by-cdict\" in the ZSTD_cParameter enum docs.\n * The ignored parameters will be used again if the CCtx is returned to no-dictionary mode.\n * The dictionary will remain valid for future compressed frames using same CCtx.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Special : Referencing a NULL CDict means \"return to no-dictionary mode\".\n * Note 1 : Currently, only one dictionary can be managed.\n * Referencing a new dictionary effectively \"discards\" any previous one.\n * Note 2 : CDict is just referenced, its lifetime must outlive its usage within CCtx. */\nZSTDLIB_API size_t ZSTD_CCtx_refCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict);\n\n/*! ZSTD_CCtx_refPrefix() :\n * Reference a prefix (single-usage dictionary) for next compressed frame.\n * A prefix is **only used once**. Tables are discarded at end of frame (ZSTD_e_end).\n * Decompression will need same prefix to properly regenerate data.\n * Compressing with a prefix is similar in outcome as performing a diff and compressing it,\n * but performs much faster, especially during decompression (compression speed is tunable with compression level).\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Special: Adding any prefix (including NULL) invalidates any previous prefix or dictionary\n * Note 1 : Prefix buffer is referenced. It **must** outlive compression.\n * Its content must remain unmodified during compression.\n * Note 2 : If the intention is to diff some large src data blob with some prior version of itself,\n * ensure that the window size is large enough to contain the entire source.\n * See ZSTD_c_windowLog.\n * Note 3 : Referencing a prefix involves building tables, which are dependent on compression parameters.\n * It's a CPU consuming operation, with non-negligible impact on latency.\n * If there is a need to use the same prefix multiple times, consider loadDictionary instead.\n * Note 4 : By default, the prefix is interpreted as raw content (ZSTD_dct_rawContent).\n * Use experimental ZSTD_CCtx_refPrefix_advanced() to alter dictionary interpretation. */\nZSTDLIB_API size_t ZSTD_CCtx_refPrefix(ZSTD_CCtx* cctx,\n const void* prefix, size_t prefixSize);\n\n/*! ZSTD_DCtx_loadDictionary() :\n * Create an internal DDict from dict buffer,\n * to be used to decompress next frames.\n * The dictionary remains valid for all future frames, until explicitly invalidated.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Special : Adding a NULL (or 0-size) dictionary invalidates any previous dictionary,\n * meaning \"return to no-dictionary mode\".\n * Note 1 : Loading a dictionary involves building tables,\n * which has a non-negligible impact on CPU usage and latency.\n * It's recommended to \"load once, use many times\", to amortize the cost\n * Note 2 :`dict` content will be copied internally, so `dict` can be released after loading.\n * Use ZSTD_DCtx_loadDictionary_byReference() to reference dictionary content instead.\n * Note 3 : Use ZSTD_DCtx_loadDictionary_advanced() to take control of\n * how dictionary content is loaded and interpreted.\n */\nZSTDLIB_API size_t ZSTD_DCtx_loadDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);\n\n/*! ZSTD_DCtx_refDDict() :\n * Reference a prepared dictionary, to be used to decompress next frames.\n * The dictionary remains active for decompression of future frames using same DCtx.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Note 1 : Currently, only one dictionary can be managed.\n * Referencing a new dictionary effectively \"discards\" any previous one.\n * Special: referencing a NULL DDict means \"return to no-dictionary mode\".\n * Note 2 : DDict is just referenced, its lifetime must outlive its usage from DCtx.\n */\nZSTDLIB_API size_t ZSTD_DCtx_refDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);\n\n/*! ZSTD_DCtx_refPrefix() :\n * Reference a prefix (single-usage dictionary) to decompress next frame.\n * This is the reverse operation of ZSTD_CCtx_refPrefix(),\n * and must use the same prefix as the one used during compression.\n * Prefix is **only used once**. Reference is discarded at end of frame.\n * End of frame is reached when ZSTD_decompressStream() returns 0.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n * Note 1 : Adding any prefix (including NULL) invalidates any previously set prefix or dictionary\n * Note 2 : Prefix buffer is referenced. It **must** outlive decompression.\n * Prefix buffer must remain unmodified up to the end of frame,\n * reached when ZSTD_decompressStream() returns 0.\n * Note 3 : By default, the prefix is treated as raw content (ZSTD_dct_rawContent).\n * Use ZSTD_CCtx_refPrefix_advanced() to alter dictMode (Experimental section)\n * Note 4 : Referencing a raw content prefix has almost no cpu nor memory cost.\n * A full dictionary is more costly, as it requires building tables.\n */\nZSTDLIB_API size_t ZSTD_DCtx_refPrefix(ZSTD_DCtx* dctx,\n const void* prefix, size_t prefixSize);\n\n/* === Memory management === */\n\n/*! ZSTD_sizeof_*() :\n * These functions give the _current_ memory usage of selected object.\n * Note that object memory usage can evolve (increase or decrease) over time. */\nZSTDLIB_API size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);\nZSTDLIB_API size_t ZSTD_sizeof_DCtx(const ZSTD_DCtx* dctx);\nZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);\nZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);\nZSTDLIB_API size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict);\nZSTDLIB_API size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict);\n\n#endif /* ZSTD_H_235446 */\n\n\n/* **************************************************************************************\n * ADVANCED AND EXPERIMENTAL FUNCTIONS\n ****************************************************************************************\n * The definitions in the following section are considered experimental.\n * They are provided for advanced scenarios.\n * They should never be used with a dynamic library, as prototypes may change in the future.\n * Use them only in association with static linking.\n * ***************************************************************************************/\n\n#if defined(ZSTD_STATIC_LINKING_ONLY) && !defined(ZSTD_H_ZSTD_STATIC_LINKING_ONLY)\n#define ZSTD_H_ZSTD_STATIC_LINKING_ONLY\n\n/****************************************************************************************\n * experimental API (static linking only)\n ****************************************************************************************\n * The following symbols and constants\n * are not planned to join \"stable API\" status in the near future.\n * They can still change in future versions.\n * Some of them are planned to remain in the static_only section indefinitely.\n * Some of them might be removed in the future (especially when redundant with existing stable functions)\n * ***************************************************************************************/\n\n#define ZSTD_FRAMEHEADERSIZE_PREFIX(format) ((format) == ZSTD_f_zstd1 ? 5 : 1) /* minimum input size required to query frame header size */\n#define ZSTD_FRAMEHEADERSIZE_MIN(format) ((format) == ZSTD_f_zstd1 ? 6 : 2)\n#define ZSTD_FRAMEHEADERSIZE_MAX 18 /* can be useful for static allocation */\n#define ZSTD_SKIPPABLEHEADERSIZE 8\n\n/* compression parameter bounds */\n#define ZSTD_WINDOWLOG_MAX_32 30\n#define ZSTD_WINDOWLOG_MAX_64 31\n#define ZSTD_WINDOWLOG_MAX ((int)(sizeof(size_t) == 4 ? ZSTD_WINDOWLOG_MAX_32 : ZSTD_WINDOWLOG_MAX_64))\n#define ZSTD_WINDOWLOG_MIN 10\n#define ZSTD_HASHLOG_MAX ((ZSTD_WINDOWLOG_MAX < 30) ? ZSTD_WINDOWLOG_MAX : 30)\n#define ZSTD_HASHLOG_MIN 6\n#define ZSTD_CHAINLOG_MAX_32 29\n#define ZSTD_CHAINLOG_MAX_64 30\n#define ZSTD_CHAINLOG_MAX ((int)(sizeof(size_t) == 4 ? ZSTD_CHAINLOG_MAX_32 : ZSTD_CHAINLOG_MAX_64))\n#define ZSTD_CHAINLOG_MIN ZSTD_HASHLOG_MIN\n#define ZSTD_SEARCHLOG_MAX (ZSTD_WINDOWLOG_MAX-1)\n#define ZSTD_SEARCHLOG_MIN 1\n#define ZSTD_MINMATCH_MAX 7 /* only for ZSTD_fast, other strategies are limited to 6 */\n#define ZSTD_MINMATCH_MIN 3 /* only for ZSTD_btopt+, faster strategies are limited to 4 */\n#define ZSTD_TARGETLENGTH_MAX ZSTD_BLOCKSIZE_MAX\n#define ZSTD_TARGETLENGTH_MIN 0 /* note : comparing this constant to an unsigned results in a tautological test */\n#define ZSTD_STRATEGY_MIN ZSTD_fast\n#define ZSTD_STRATEGY_MAX ZSTD_btultra2\n\n\n#define ZSTD_OVERLAPLOG_MIN 0\n#define ZSTD_OVERLAPLOG_MAX 9\n\n#define ZSTD_WINDOWLOG_LIMIT_DEFAULT 27 /* by default, the streaming decoder will refuse any frame\n * requiring larger than (1< 3, then this is seqDef.offset - 3\n * If seqDef.offset < 3, then this is the corresponding repeat offset\n * But if seqDef.offset < 3 and litLength == 0, this is the\n * repeat offset before the corresponding repeat offset\n * And if seqDef.offset == 3 and litLength == 0, this is the\n * most recent repeat offset - 1\n */\n unsigned int offset;\n unsigned int litLength; /* Literal length */\n unsigned int matchLength; /* Match length */\n /* 0 when seq not rep and seqDef.offset otherwise\n * when litLength == 0 this will be <= 4, otherwise <= 3 like normal\n */\n unsigned int rep;\n} ZSTD_Sequence;\n\ntypedef struct {\n unsigned windowLog; /**< largest match distance : larger == more compression, more memory needed during decompression */\n unsigned chainLog; /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */\n unsigned hashLog; /**< dispatch table : larger == faster, more memory */\n unsigned searchLog; /**< nb of searches : larger == more compression, slower */\n unsigned minMatch; /**< match length searched : larger == faster decompression, sometimes less compression */\n unsigned targetLength; /**< acceptable match size for optimal parser (only) : larger == more compression, slower */\n ZSTD_strategy strategy; /**< see ZSTD_strategy definition above */\n} ZSTD_compressionParameters;\n\ntypedef struct {\n int contentSizeFlag; /**< 1: content size will be in frame header (when known) */\n int checksumFlag; /**< 1: generate a 32-bits checksum using XXH64 algorithm at end of frame, for error detection */\n int noDictIDFlag; /**< 1: no dictID will be saved into frame header (dictID is only useful for dictionary compression) */\n} ZSTD_frameParameters;\n\ntypedef struct {\n ZSTD_compressionParameters cParams;\n ZSTD_frameParameters fParams;\n} ZSTD_parameters;\n\ntypedef enum {\n ZSTD_dct_auto = 0, /* dictionary is \"full\" when starting with ZSTD_MAGIC_DICTIONARY, otherwise it is \"rawContent\" */\n ZSTD_dct_rawContent = 1, /* ensures dictionary is always loaded as rawContent, even if it starts with ZSTD_MAGIC_DICTIONARY */\n ZSTD_dct_fullDict = 2 /* refuses to load a dictionary if it does not respect Zstandard's specification, starting with ZSTD_MAGIC_DICTIONARY */\n} ZSTD_dictContentType_e;\n\ntypedef enum {\n ZSTD_dlm_byCopy = 0, /**< Copy dictionary content internally */\n ZSTD_dlm_byRef = 1 /**< Reference dictionary content -- the dictionary buffer must outlive its users. */\n} ZSTD_dictLoadMethod_e;\n\ntypedef enum {\n ZSTD_f_zstd1 = 0, /* zstd frame format, specified in zstd_compression_format.md (default) */\n ZSTD_f_zstd1_magicless = 1 /* Variant of zstd frame format, without initial 4-bytes magic number.\n * Useful to save 4 bytes per generated frame.\n * Decoder cannot recognise automatically this format, requiring this instruction. */\n} ZSTD_format_e;\n\ntypedef enum {\n /* Note: this enum and the behavior it controls are effectively internal\n * implementation details of the compressor. They are expected to continue\n * to evolve and should be considered only in the context of extremely\n * advanced performance tuning.\n *\n * Zstd currently supports the use of a CDict in three ways:\n *\n * - The contents of the CDict can be copied into the working context. This\n * means that the compression can search both the dictionary and input\n * while operating on a single set of internal tables. This makes\n * the compression faster per-byte of input. However, the initial copy of\n * the CDict's tables incurs a fixed cost at the beginning of the\n * compression. For small compressions (< 8 KB), that copy can dominate\n * the cost of the compression.\n *\n * - The CDict's tables can be used in-place. In this model, compression is\n * slower per input byte, because the compressor has to search two sets of\n * tables. However, this model incurs no start-up cost (as long as the\n * working context's tables can be reused). For small inputs, this can be\n * faster than copying the CDict's tables.\n *\n * - The CDict's tables are not used at all, and instead we use the working\n * context alone to reload the dictionary and use params based on the source\n * size. See ZSTD_compress_insertDictionary() and ZSTD_compress_usingDict().\n * This method is effective when the dictionary sizes are very small relative\n * to the input size, and the input size is fairly large to begin with.\n *\n * Zstd has a simple internal heuristic that selects which strategy to use\n * at the beginning of a compression. However, if experimentation shows that\n * Zstd is making poor choices, it is possible to override that choice with\n * this enum.\n */\n ZSTD_dictDefaultAttach = 0, /* Use the default heuristic. */\n ZSTD_dictForceAttach = 1, /* Never copy the dictionary. */\n ZSTD_dictForceCopy = 2, /* Always copy the dictionary. */\n ZSTD_dictForceLoad = 3 /* Always reload the dictionary */\n} ZSTD_dictAttachPref_e;\n\ntypedef enum {\n ZSTD_lcm_auto = 0, /**< Automatically determine the compression mode based on the compression level.\n * Negative compression levels will be uncompressed, and positive compression\n * levels will be compressed. */\n ZSTD_lcm_huffman = 1, /**< Always attempt Huffman compression. Uncompressed literals will still be\n * emitted if Huffman compression is not profitable. */\n ZSTD_lcm_uncompressed = 2 /**< Always emit uncompressed literals. */\n} ZSTD_literalCompressionMode_e;\n\n\n/***************************************\n* Frame size functions\n***************************************/\n\n/*! ZSTD_findDecompressedSize() :\n * `src` should point to the start of a series of ZSTD encoded and/or skippable frames\n * `srcSize` must be the _exact_ size of this series\n * (i.e. there should be a frame boundary at `src + srcSize`)\n * @return : - decompressed size of all data in all successive frames\n * - if the decompressed size cannot be determined: ZSTD_CONTENTSIZE_UNKNOWN\n * - if an error occurred: ZSTD_CONTENTSIZE_ERROR\n *\n * note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.\n * When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.\n * In which case, it's necessary to use streaming mode to decompress data.\n * note 2 : decompressed size is always present when compression is done with ZSTD_compress()\n * note 3 : decompressed size can be very large (64-bits value),\n * potentially larger than what local system can handle as a single memory segment.\n * In which case, it's necessary to use streaming mode to decompress data.\n * note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.\n * Always ensure result fits within application's authorized limits.\n * Each application can set its own limits.\n * note 5 : ZSTD_findDecompressedSize handles multiple frames, and so it must traverse the input to\n * read each contained frame header. This is fast as most of the data is skipped,\n * however it does mean that all frame data must be present and valid. */\nZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);\n\n/*! ZSTD_decompressBound() :\n * `src` should point to the start of a series of ZSTD encoded and/or skippable frames\n * `srcSize` must be the _exact_ size of this series\n * (i.e. there should be a frame boundary at `src + srcSize`)\n * @return : - upper-bound for the decompressed size of all data in all successive frames\n * - if an error occured: ZSTD_CONTENTSIZE_ERROR\n *\n * note 1 : an error can occur if `src` contains an invalid or incorrectly formatted frame.\n * note 2 : the upper-bound is exact when the decompressed size field is available in every ZSTD encoded frame of `src`.\n * in this case, `ZSTD_findDecompressedSize` and `ZSTD_decompressBound` return the same value.\n * note 3 : when the decompressed size field isn't available, the upper-bound for that frame is calculated by:\n * upper-bound = # blocks * min(128 KB, Window_Size)\n */\nZSTDLIB_API unsigned long long ZSTD_decompressBound(const void* src, size_t srcSize);\n\n/*! ZSTD_frameHeaderSize() :\n * srcSize must be >= ZSTD_FRAMEHEADERSIZE_PREFIX.\n * @return : size of the Frame Header,\n * or an error code (if srcSize is too small) */\nZSTDLIB_API size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize);\n\n/*! ZSTD_getSequences() :\n * Extract sequences from the sequence store\n * zc can be used to insert custom compression params.\n * This function invokes ZSTD_compress2\n * @return : number of sequences extracted\n */\nZSTDLIB_API size_t ZSTD_getSequences(ZSTD_CCtx* zc, ZSTD_Sequence* outSeqs,\n size_t outSeqsSize, const void* src, size_t srcSize);\n\n\n/***************************************\n* Memory management\n***************************************/\n\n/*! ZSTD_estimate*() :\n * These functions make it possible to estimate memory usage of a future\n * {D,C}Ctx, before its creation.\n *\n * ZSTD_estimateCCtxSize() will provide a budget large enough for any\n * compression level up to selected one. Unlike ZSTD_estimateCStreamSize*(),\n * this estimate does not include space for a window buffer, so this estimate\n * is guaranteed to be enough for single-shot compressions, but not streaming\n * compressions. It will however assume the input may be arbitrarily large,\n * which is the worst case. If srcSize is known to always be small,\n * ZSTD_estimateCCtxSize_usingCParams() can provide a tighter estimation.\n * ZSTD_estimateCCtxSize_usingCParams() can be used in tandem with\n * ZSTD_getCParams() to create cParams from compressionLevel.\n * ZSTD_estimateCCtxSize_usingCCtxParams() can be used in tandem with\n * ZSTD_CCtxParams_setParameter().\n *\n * Note: only single-threaded compression is supported. This function will\n * return an error code if ZSTD_c_nbWorkers is >= 1. */\nZSTDLIB_API size_t ZSTD_estimateCCtxSize(int compressionLevel);\nZSTDLIB_API size_t ZSTD_estimateCCtxSize_usingCParams(ZSTD_compressionParameters cParams);\nZSTDLIB_API size_t ZSTD_estimateCCtxSize_usingCCtxParams(const ZSTD_CCtx_params* params);\nZSTDLIB_API size_t ZSTD_estimateDCtxSize(void);\n\n/*! ZSTD_estimateCStreamSize() :\n * ZSTD_estimateCStreamSize() will provide a budget large enough for any compression level up to selected one.\n * It will also consider src size to be arbitrarily \"large\", which is worst case.\n * If srcSize is known to always be small, ZSTD_estimateCStreamSize_usingCParams() can provide a tighter estimation.\n * ZSTD_estimateCStreamSize_usingCParams() can be used in tandem with ZSTD_getCParams() to create cParams from compressionLevel.\n * ZSTD_estimateCStreamSize_usingCCtxParams() can be used in tandem with ZSTD_CCtxParams_setParameter(). Only single-threaded compression is supported. This function will return an error code if ZSTD_c_nbWorkers is >= 1.\n * Note : CStream size estimation is only correct for single-threaded compression.\n * ZSTD_DStream memory budget depends on window Size.\n * This information can be passed manually, using ZSTD_estimateDStreamSize,\n * or deducted from a valid frame Header, using ZSTD_estimateDStreamSize_fromFrame();\n * Note : if streaming is init with function ZSTD_init?Stream_usingDict(),\n * an internal ?Dict will be created, which additional size is not estimated here.\n * In this case, get total size by adding ZSTD_estimate?DictSize */\nZSTDLIB_API size_t ZSTD_estimateCStreamSize(int compressionLevel);\nZSTDLIB_API size_t ZSTD_estimateCStreamSize_usingCParams(ZSTD_compressionParameters cParams);\nZSTDLIB_API size_t ZSTD_estimateCStreamSize_usingCCtxParams(const ZSTD_CCtx_params* params);\nZSTDLIB_API size_t ZSTD_estimateDStreamSize(size_t windowSize);\nZSTDLIB_API size_t ZSTD_estimateDStreamSize_fromFrame(const void* src, size_t srcSize);\n\n/*! ZSTD_estimate?DictSize() :\n * ZSTD_estimateCDictSize() will bet that src size is relatively \"small\", and content is copied, like ZSTD_createCDict().\n * ZSTD_estimateCDictSize_advanced() makes it possible to control compression parameters precisely, like ZSTD_createCDict_advanced().\n * Note : dictionaries created by reference (`ZSTD_dlm_byRef`) are logically smaller.\n */\nZSTDLIB_API size_t ZSTD_estimateCDictSize(size_t dictSize, int compressionLevel);\nZSTDLIB_API size_t ZSTD_estimateCDictSize_advanced(size_t dictSize, ZSTD_compressionParameters cParams, ZSTD_dictLoadMethod_e dictLoadMethod);\nZSTDLIB_API size_t ZSTD_estimateDDictSize(size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod);\n\n/*! ZSTD_initStatic*() :\n * Initialize an object using a pre-allocated fixed-size buffer.\n * workspace: The memory area to emplace the object into.\n * Provided pointer *must be 8-bytes aligned*.\n * Buffer must outlive object.\n * workspaceSize: Use ZSTD_estimate*Size() to determine\n * how large workspace must be to support target scenario.\n * @return : pointer to object (same address as workspace, just different type),\n * or NULL if error (size too small, incorrect alignment, etc.)\n * Note : zstd will never resize nor malloc() when using a static buffer.\n * If the object requires more memory than available,\n * zstd will just error out (typically ZSTD_error_memory_allocation).\n * Note 2 : there is no corresponding \"free\" function.\n * Since workspace is allocated externally, it must be freed externally too.\n * Note 3 : cParams : use ZSTD_getCParams() to convert a compression level\n * into its associated cParams.\n * Limitation 1 : currently not compatible with internal dictionary creation, triggered by\n * ZSTD_CCtx_loadDictionary(), ZSTD_initCStream_usingDict() or ZSTD_initDStream_usingDict().\n * Limitation 2 : static cctx currently not compatible with multi-threading.\n * Limitation 3 : static dctx is incompatible with legacy support.\n */\nZSTDLIB_API ZSTD_CCtx* ZSTD_initStaticCCtx(void* workspace, size_t workspaceSize);\nZSTDLIB_API ZSTD_CStream* ZSTD_initStaticCStream(void* workspace, size_t workspaceSize); /**< same as ZSTD_initStaticCCtx() */\n\nZSTDLIB_API ZSTD_DCtx* ZSTD_initStaticDCtx(void* workspace, size_t workspaceSize);\nZSTDLIB_API ZSTD_DStream* ZSTD_initStaticDStream(void* workspace, size_t workspaceSize); /**< same as ZSTD_initStaticDCtx() */\n\nZSTDLIB_API const ZSTD_CDict* ZSTD_initStaticCDict(\n void* workspace, size_t workspaceSize,\n const void* dict, size_t dictSize,\n ZSTD_dictLoadMethod_e dictLoadMethod,\n ZSTD_dictContentType_e dictContentType,\n ZSTD_compressionParameters cParams);\n\nZSTDLIB_API const ZSTD_DDict* ZSTD_initStaticDDict(\n void* workspace, size_t workspaceSize,\n const void* dict, size_t dictSize,\n ZSTD_dictLoadMethod_e dictLoadMethod,\n ZSTD_dictContentType_e dictContentType);\n\n\n/*! Custom memory allocation :\n * These prototypes make it possible to pass your own allocation/free functions.\n * ZSTD_customMem is provided at creation time, using ZSTD_create*_advanced() variants listed below.\n * All allocation/free operations will be completed using these custom variants instead of regular ones.\n */\ntypedef void* (*ZSTD_allocFunction) (void* opaque, size_t size);\ntypedef void (*ZSTD_freeFunction) (void* opaque, void* address);\ntypedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;\nstatic ZSTD_customMem const ZSTD_defaultCMem = { NULL, NULL, NULL }; /**< this constant defers to stdlib's functions */\n\nZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem);\nZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);\nZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem);\nZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);\n\nZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize,\n ZSTD_dictLoadMethod_e dictLoadMethod,\n ZSTD_dictContentType_e dictContentType,\n ZSTD_compressionParameters cParams,\n ZSTD_customMem customMem);\n\nZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,\n ZSTD_dictLoadMethod_e dictLoadMethod,\n ZSTD_dictContentType_e dictContentType,\n ZSTD_customMem customMem);\n\n\n\n/***************************************\n* Advanced compression functions\n***************************************/\n\n/*! ZSTD_createCDict_byReference() :\n * Create a digested dictionary for compression\n * Dictionary content is just referenced, not duplicated.\n * As a consequence, `dictBuffer` **must** outlive CDict,\n * and its content must remain unmodified throughout the lifetime of CDict.\n * note: equivalent to ZSTD_createCDict_advanced(), with dictLoadMethod==ZSTD_dlm_byRef */\nZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, size_t dictSize, int compressionLevel);\n\n/*! ZSTD_getCParams() :\n * @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.\n * `estimatedSrcSize` value is optional, select 0 if not known */\nZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);\n\n/*! ZSTD_getParams() :\n * same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.\n * All fields of `ZSTD_frameParameters` are set to default : contentSize=1, checksum=0, noDictID=0 */\nZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);\n\n/*! ZSTD_checkCParams() :\n * Ensure param values remain within authorized range.\n * @return 0 on success, or an error code (can be checked with ZSTD_isError()) */\nZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);\n\n/*! ZSTD_adjustCParams() :\n * optimize params for a given `srcSize` and `dictSize`.\n * `srcSize` can be unknown, in which case use ZSTD_CONTENTSIZE_UNKNOWN.\n * `dictSize` must be `0` when there is no dictionary.\n * cPar can be invalid : all parameters will be clamped within valid range in the @return struct.\n * This function never fails (wide contract) */\nZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);\n\n/*! ZSTD_compress_advanced() :\n * Note : this function is now DEPRECATED.\n * It can be replaced by ZSTD_compress2(), in combination with ZSTD_CCtx_setParameter() and other parameter setters.\n * This prototype will be marked as deprecated and generate compilation warning on reaching v1.5.x */\nZSTDLIB_API size_t ZSTD_compress_advanced(ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const void* dict,size_t dictSize,\n ZSTD_parameters params);\n\n/*! ZSTD_compress_usingCDict_advanced() :\n * Note : this function is now REDUNDANT.\n * It can be replaced by ZSTD_compress2(), in combination with ZSTD_CCtx_loadDictionary() and other parameter setters.\n * This prototype will be marked as deprecated and generate compilation warning in some future version */\nZSTDLIB_API size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity,\n const void* src, size_t srcSize,\n const ZSTD_CDict* cdict,\n ZSTD_frameParameters fParams);\n\n\n/*! ZSTD_CCtx_loadDictionary_byReference() :\n * Same as ZSTD_CCtx_loadDictionary(), but dictionary content is referenced, instead of being copied into CCtx.\n * It saves some memory, but also requires that `dict` outlives its usage within `cctx` */\nZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_byReference(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);\n\n/*! ZSTD_CCtx_loadDictionary_advanced() :\n * Same as ZSTD_CCtx_loadDictionary(), but gives finer control over\n * how to load the dictionary (by copy ? by reference ?)\n * and how to interpret it (automatic ? force raw mode ? full mode only ?) */\nZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictContentType_e dictContentType);\n\n/*! ZSTD_CCtx_refPrefix_advanced() :\n * Same as ZSTD_CCtx_refPrefix(), but gives finer control over\n * how to interpret prefix content (automatic ? force raw mode (default) ? full mode only ?) */\nZSTDLIB_API size_t ZSTD_CCtx_refPrefix_advanced(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType);\n\n/* === experimental parameters === */\n/* these parameters can be used with ZSTD_setParameter()\n * they are not guaranteed to remain supported in the future */\n\n /* Enables rsyncable mode,\n * which makes compressed files more rsync friendly\n * by adding periodic synchronization points to the compressed data.\n * The target average block size is ZSTD_c_jobSize / 2.\n * It's possible to modify the job size to increase or decrease\n * the granularity of the synchronization point.\n * Once the jobSize is smaller than the window size,\n * it will result in compression ratio degradation.\n * NOTE 1: rsyncable mode only works when multithreading is enabled.\n * NOTE 2: rsyncable performs poorly in combination with long range mode,\n * since it will decrease the effectiveness of synchronization points,\n * though mileage may vary.\n * NOTE 3: Rsyncable mode limits maximum compression speed to ~400 MB/s.\n * If the selected compression level is already running significantly slower,\n * the overall speed won't be significantly impacted.\n */\n #define ZSTD_c_rsyncable ZSTD_c_experimentalParam1\n\n/* Select a compression format.\n * The value must be of type ZSTD_format_e.\n * See ZSTD_format_e enum definition for details */\n#define ZSTD_c_format ZSTD_c_experimentalParam2\n\n/* Force back-reference distances to remain < windowSize,\n * even when referencing into Dictionary content (default:0) */\n#define ZSTD_c_forceMaxWindow ZSTD_c_experimentalParam3\n\n/* Controls whether the contents of a CDict\n * are used in place, or copied into the working context.\n * Accepts values from the ZSTD_dictAttachPref_e enum.\n * See the comments on that enum for an explanation of the feature. */\n#define ZSTD_c_forceAttachDict ZSTD_c_experimentalParam4\n\n/* Controls how the literals are compressed (default is auto).\n * The value must be of type ZSTD_literalCompressionMode_e.\n * See ZSTD_literalCompressionMode_t enum definition for details.\n */\n#define ZSTD_c_literalCompressionMode ZSTD_c_experimentalParam5\n\n/* Tries to fit compressed block size to be around targetCBlockSize.\n * No target when targetCBlockSize == 0.\n * There is no guarantee on compressed block size (default:0) */\n#define ZSTD_c_targetCBlockSize ZSTD_c_experimentalParam6\n\n/* User's best guess of source size.\n * Hint is not valid when srcSizeHint == 0.\n * There is no guarantee that hint is close to actual source size,\n * but compression ratio may regress significantly if guess considerably underestimates */\n#define ZSTD_c_srcSizeHint ZSTD_c_experimentalParam7\n\n/*! ZSTD_CCtx_getParameter() :\n * Get the requested compression parameter value, selected by enum ZSTD_cParameter,\n * and store it into int* value.\n * @return : 0, or an error code (which can be tested with ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_CCtx_getParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int* value);\n\n\n/*! ZSTD_CCtx_params :\n * Quick howto :\n * - ZSTD_createCCtxParams() : Create a ZSTD_CCtx_params structure\n * - ZSTD_CCtxParams_setParameter() : Push parameters one by one into\n * an existing ZSTD_CCtx_params structure.\n * This is similar to\n * ZSTD_CCtx_setParameter().\n * - ZSTD_CCtx_setParametersUsingCCtxParams() : Apply parameters to\n * an existing CCtx.\n * These parameters will be applied to\n * all subsequent frames.\n * - ZSTD_compressStream2() : Do compression using the CCtx.\n * - ZSTD_freeCCtxParams() : Free the memory.\n *\n * This can be used with ZSTD_estimateCCtxSize_advanced_usingCCtxParams()\n * for static allocation of CCtx for single-threaded compression.\n */\nZSTDLIB_API ZSTD_CCtx_params* ZSTD_createCCtxParams(void);\nZSTDLIB_API size_t ZSTD_freeCCtxParams(ZSTD_CCtx_params* params);\n\n/*! ZSTD_CCtxParams_reset() :\n * Reset params to default values.\n */\nZSTDLIB_API size_t ZSTD_CCtxParams_reset(ZSTD_CCtx_params* params);\n\n/*! ZSTD_CCtxParams_init() :\n * Initializes the compression parameters of cctxParams according to\n * compression level. All other parameters are reset to their default values.\n */\nZSTDLIB_API size_t ZSTD_CCtxParams_init(ZSTD_CCtx_params* cctxParams, int compressionLevel);\n\n/*! ZSTD_CCtxParams_init_advanced() :\n * Initializes the compression and frame parameters of cctxParams according to\n * params. All other parameters are reset to their default values.\n */\nZSTDLIB_API size_t ZSTD_CCtxParams_init_advanced(ZSTD_CCtx_params* cctxParams, ZSTD_parameters params);\n\n/*! ZSTD_CCtxParams_setParameter() :\n * Similar to ZSTD_CCtx_setParameter.\n * Set one compression parameter, selected by enum ZSTD_cParameter.\n * Parameters must be applied to a ZSTD_CCtx using ZSTD_CCtx_setParametersUsingCCtxParams().\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_CCtxParams_setParameter(ZSTD_CCtx_params* params, ZSTD_cParameter param, int value);\n\n/*! ZSTD_CCtxParams_getParameter() :\n * Similar to ZSTD_CCtx_getParameter.\n * Get the requested value of one compression parameter, selected by enum ZSTD_cParameter.\n * @result : 0, or an error code (which can be tested with ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_CCtxParams_getParameter(ZSTD_CCtx_params* params, ZSTD_cParameter param, int* value);\n\n/*! ZSTD_CCtx_setParametersUsingCCtxParams() :\n * Apply a set of ZSTD_CCtx_params to the compression context.\n * This can be done even after compression is started,\n * if nbWorkers==0, this will have no impact until a new compression is started.\n * if nbWorkers>=1, new parameters will be picked up at next job,\n * with a few restrictions (windowLog, pledgedSrcSize, nbWorkers, jobSize, and overlapLog are not updated).\n */\nZSTDLIB_API size_t ZSTD_CCtx_setParametersUsingCCtxParams(\n ZSTD_CCtx* cctx, const ZSTD_CCtx_params* params);\n\n/*! ZSTD_compressStream2_simpleArgs() :\n * Same as ZSTD_compressStream2(),\n * but using only integral types as arguments.\n * This variant might be helpful for binders from dynamic languages\n * which have troubles handling structures containing memory pointers.\n */\nZSTDLIB_API size_t ZSTD_compressStream2_simpleArgs (\n ZSTD_CCtx* cctx,\n void* dst, size_t dstCapacity, size_t* dstPos,\n const void* src, size_t srcSize, size_t* srcPos,\n ZSTD_EndDirective endOp);\n\n\n/***************************************\n* Advanced decompression functions\n***************************************/\n\n/*! ZSTD_isFrame() :\n * Tells if the content of `buffer` starts with a valid Frame Identifier.\n * Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.\n * Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.\n * Note 3 : Skippable Frame Identifiers are considered valid. */\nZSTDLIB_API unsigned ZSTD_isFrame(const void* buffer, size_t size);\n\n/*! ZSTD_createDDict_byReference() :\n * Create a digested dictionary, ready to start decompression operation without startup delay.\n * Dictionary content is referenced, and therefore stays in dictBuffer.\n * It is important that dictBuffer outlives DDict,\n * it must remain read accessible throughout the lifetime of DDict */\nZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize);\n\n/*! ZSTD_DCtx_loadDictionary_byReference() :\n * Same as ZSTD_DCtx_loadDictionary(),\n * but references `dict` content instead of copying it into `dctx`.\n * This saves memory if `dict` remains around.,\n * However, it's imperative that `dict` remains accessible (and unmodified) while being used, so it must outlive decompression. */\nZSTDLIB_API size_t ZSTD_DCtx_loadDictionary_byReference(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);\n\n/*! ZSTD_DCtx_loadDictionary_advanced() :\n * Same as ZSTD_DCtx_loadDictionary(),\n * but gives direct control over\n * how to load the dictionary (by copy ? by reference ?)\n * and how to interpret it (automatic ? force raw mode ? full mode only ?). */\nZSTDLIB_API size_t ZSTD_DCtx_loadDictionary_advanced(ZSTD_DCtx* dctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictContentType_e dictContentType);\n\n/*! ZSTD_DCtx_refPrefix_advanced() :\n * Same as ZSTD_DCtx_refPrefix(), but gives finer control over\n * how to interpret prefix content (automatic ? force raw mode (default) ? full mode only ?) */\nZSTDLIB_API size_t ZSTD_DCtx_refPrefix_advanced(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType);\n\n/*! ZSTD_DCtx_setMaxWindowSize() :\n * Refuses allocating internal buffers for frames requiring a window size larger than provided limit.\n * This protects a decoder context from reserving too much memory for itself (potential attack scenario).\n * This parameter is only useful in streaming mode, since no internal buffer is allocated in single-pass mode.\n * By default, a decompression context accepts all window sizes <= (1 << ZSTD_WINDOWLOG_LIMIT_DEFAULT)\n * @return : 0, or an error code (which can be tested using ZSTD_isError()).\n */\nZSTDLIB_API size_t ZSTD_DCtx_setMaxWindowSize(ZSTD_DCtx* dctx, size_t maxWindowSize);\n\n/* ZSTD_d_format\n * experimental parameter,\n * allowing selection between ZSTD_format_e input compression formats\n */\n#define ZSTD_d_format ZSTD_d_experimentalParam1\n\n/*! ZSTD_DCtx_setFormat() :\n * Instruct the decoder context about what kind of data to decode next.\n * This instruction is mandatory to decode data without a fully-formed header,\n * such ZSTD_f_zstd1_magicless for example.\n * @return : 0, or an error code (which can be tested using ZSTD_isError()). */\nZSTDLIB_API size_t ZSTD_DCtx_setFormat(ZSTD_DCtx* dctx, ZSTD_format_e format);\n\n/*! ZSTD_decompressStream_simpleArgs() :\n * Same as ZSTD_decompressStream(),\n * but using only integral types as arguments.\n * This can be helpful for binders from dynamic languages\n * which have troubles handling structures containing memory pointers.\n */\nZSTDLIB_API size_t ZSTD_decompressStream_simpleArgs (\n ZSTD_DCtx* dctx,\n void* dst, size_t dstCapacity, size_t* dstPos,\n const void* src, size_t srcSize, size_t* srcPos);\n\n\n/********************************************************************\n* Advanced streaming functions\n* Warning : most of these functions are now redundant with the Advanced API.\n* Once Advanced API reaches \"stable\" status,\n* redundant functions will be deprecated, and then at some point removed.\n********************************************************************/\n\n/*===== Advanced Streaming compression functions =====*/\n/**! ZSTD_initCStream_srcSize() :\n * This function is deprecated, and equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * ZSTD_CCtx_refCDict(zcs, NULL); // clear the dictionary (if any)\n * ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);\n * ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);\n *\n * pledgedSrcSize must be correct. If it is not known at init time, use\n * ZSTD_CONTENTSIZE_UNKNOWN. Note that, for compatibility with older programs,\n * \"0\" also disables frame content size field. It may be enabled in the future.\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t\nZSTD_initCStream_srcSize(ZSTD_CStream* zcs,\n int compressionLevel,\n unsigned long long pledgedSrcSize);\n\n/**! ZSTD_initCStream_usingDict() :\n * This function is deprecated, and is equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);\n * ZSTD_CCtx_loadDictionary(zcs, dict, dictSize);\n *\n * Creates of an internal CDict (incompatible with static CCtx), except if\n * dict == NULL or dictSize < 8, in which case no dict is used.\n * Note: dict is loaded with ZSTD_dct_auto (treated as a full zstd dictionary if\n * it begins with ZSTD_MAGIC_DICTIONARY, else as raw content) and ZSTD_dlm_byCopy.\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t\nZSTD_initCStream_usingDict(ZSTD_CStream* zcs,\n const void* dict, size_t dictSize,\n int compressionLevel);\n\n/**! ZSTD_initCStream_advanced() :\n * This function is deprecated, and is approximately equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * // Pseudocode: Set each zstd parameter and leave the rest as-is.\n * for ((param, value) : params) {\n * ZSTD_CCtx_setParameter(zcs, param, value);\n * }\n * ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);\n * ZSTD_CCtx_loadDictionary(zcs, dict, dictSize);\n *\n * dict is loaded with ZSTD_dct_auto and ZSTD_dlm_byCopy.\n * pledgedSrcSize must be correct.\n * If srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN.\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t\nZSTD_initCStream_advanced(ZSTD_CStream* zcs,\n const void* dict, size_t dictSize,\n ZSTD_parameters params,\n unsigned long long pledgedSrcSize);\n\n/**! ZSTD_initCStream_usingCDict() :\n * This function is deprecated, and equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * ZSTD_CCtx_refCDict(zcs, cdict);\n *\n * note : cdict will just be referenced, and must outlive compression session\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);\n\n/**! ZSTD_initCStream_usingCDict_advanced() :\n * This function is DEPRECATED, and is approximately equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * // Pseudocode: Set each zstd frame parameter and leave the rest as-is.\n * for ((fParam, value) : fParams) {\n * ZSTD_CCtx_setParameter(zcs, fParam, value);\n * }\n * ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);\n * ZSTD_CCtx_refCDict(zcs, cdict);\n *\n * same as ZSTD_initCStream_usingCDict(), with control over frame parameters.\n * pledgedSrcSize must be correct. If srcSize is not known at init time, use\n * value ZSTD_CONTENTSIZE_UNKNOWN.\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t\nZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs,\n const ZSTD_CDict* cdict,\n ZSTD_frameParameters fParams,\n unsigned long long pledgedSrcSize);\n\n/*! ZSTD_resetCStream() :\n * This function is deprecated, and is equivalent to:\n * ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);\n * ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);\n *\n * start a new frame, using same parameters from previous frame.\n * This is typically useful to skip dictionary loading stage, since it will re-use it in-place.\n * Note that zcs must be init at least once before using ZSTD_resetCStream().\n * If pledgedSrcSize is not known at reset time, use macro ZSTD_CONTENTSIZE_UNKNOWN.\n * If pledgedSrcSize > 0, its value must be correct, as it will be written in header, and controlled at the end.\n * For the time being, pledgedSrcSize==0 is interpreted as \"srcSize unknown\" for compatibility with older programs,\n * but it will change to mean \"empty\" in future version, so use macro ZSTD_CONTENTSIZE_UNKNOWN instead.\n * @return : 0, or an error code (which can be tested using ZSTD_isError())\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);\n\n\ntypedef struct {\n unsigned long long ingested; /* nb input bytes read and buffered */\n unsigned long long consumed; /* nb input bytes actually compressed */\n unsigned long long produced; /* nb of compressed bytes generated and buffered */\n unsigned long long flushed; /* nb of compressed bytes flushed : not provided; can be tracked from caller side */\n unsigned currentJobID; /* MT only : latest started job nb */\n unsigned nbActiveWorkers; /* MT only : nb of workers actively compressing at probe time */\n} ZSTD_frameProgression;\n\n/* ZSTD_getFrameProgression() :\n * tells how much data has been ingested (read from input)\n * consumed (input actually compressed) and produced (output) for current frame.\n * Note : (ingested - consumed) is amount of input data buffered internally, not yet compressed.\n * Aggregates progression inside active worker threads.\n */\nZSTDLIB_API ZSTD_frameProgression ZSTD_getFrameProgression(const ZSTD_CCtx* cctx);\n\n/*! ZSTD_toFlushNow() :\n * Tell how many bytes are ready to be flushed immediately.\n * Useful for multithreading scenarios (nbWorkers >= 1).\n * Probe the oldest active job, defined as oldest job not yet entirely flushed,\n * and check its output buffer.\n * @return : amount of data stored in oldest job and ready to be flushed immediately.\n * if @return == 0, it means either :\n * + there is no active job (could be checked with ZSTD_frameProgression()), or\n * + oldest job is still actively compressing data,\n * but everything it has produced has also been flushed so far,\n * therefore flush speed is limited by production speed of oldest job\n * irrespective of the speed of concurrent (and newer) jobs.\n */\nZSTDLIB_API size_t ZSTD_toFlushNow(ZSTD_CCtx* cctx);\n\n\n/*===== Advanced Streaming decompression functions =====*/\n/**\n * This function is deprecated, and is equivalent to:\n *\n * ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);\n * ZSTD_DCtx_loadDictionary(zds, dict, dictSize);\n *\n * note: no dictionary will be used if dict == NULL or dictSize < 8\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize);\n\n/**\n * This function is deprecated, and is equivalent to:\n *\n * ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);\n * ZSTD_DCtx_refDDict(zds, ddict);\n *\n * note : ddict is referenced, it must outlive decompression session\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict);\n\n/**\n * This function is deprecated, and is equivalent to:\n *\n * ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);\n *\n * re-use decompression parameters from previous init; saves dictionary loading\n * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x\n */\nZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);\n\n\n/*********************************************************************\n* Buffer-less and synchronous inner streaming functions\n*\n* This is an advanced API, giving full control over buffer management, for users which need direct control over memory.\n* But it's also a complex one, with several restrictions, documented below.\n* Prefer normal streaming API for an easier experience.\n********************************************************************* */\n\n/**\n Buffer-less streaming compression (synchronous mode)\n\n A ZSTD_CCtx object is required to track streaming operations.\n Use ZSTD_createCCtx() / ZSTD_freeCCtx() to manage resource.\n ZSTD_CCtx object can be re-used multiple times within successive compression operations.\n\n Start by initializing a context.\n Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary compression,\n or ZSTD_compressBegin_advanced(), for finer parameter control.\n It's also possible to duplicate a reference context which has already been initialized, using ZSTD_copyCCtx()\n\n Then, consume your input using ZSTD_compressContinue().\n There are some important considerations to keep in mind when using this advanced function :\n - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffers only.\n - Interface is synchronous : input is consumed entirely and produces 1+ compressed blocks.\n - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.\n Worst case evaluation is provided by ZSTD_compressBound().\n ZSTD_compressContinue() doesn't guarantee recover after a failed compression.\n - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).\n It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)\n - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.\n In which case, it will \"discard\" the relevant memory section from its history.\n\n Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.\n It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.\n Without last block mark, frames are considered unfinished (hence corrupted) by compliant decoders.\n\n `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress again.\n*/\n\n/*===== Buffer-less streaming compression functions =====*/\nZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);\nZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);\nZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize : If srcSize is not known at init time, use ZSTD_CONTENTSIZE_UNKNOWN */\nZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict); /**< note: fails if cdict==NULL */\nZSTDLIB_API size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize); /* compression parameters are already set within cdict. pledgedSrcSize must be correct. If srcSize is not known, use macro ZSTD_CONTENTSIZE_UNKNOWN */\nZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**< note: if pledgedSrcSize is not known, use ZSTD_CONTENTSIZE_UNKNOWN */\n\nZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);\nZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);\n\n\n/*-\n Buffer-less streaming decompression (synchronous mode)\n\n A ZSTD_DCtx object is required to track streaming operations.\n Use ZSTD_createDCtx() / ZSTD_freeDCtx() to manage it.\n A ZSTD_DCtx object can be re-used multiple times.\n\n First typical operation is to retrieve frame parameters, using ZSTD_getFrameHeader().\n Frame header is extracted from the beginning of compressed frame, so providing only the frame's beginning is enough.\n Data fragment must be large enough to ensure successful decoding.\n `ZSTD_frameHeaderSize_max` bytes is guaranteed to always be large enough.\n @result : 0 : successful decoding, the `ZSTD_frameHeader` structure is correctly filled.\n >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.\n errorCode, which can be tested using ZSTD_isError().\n\n It fills a ZSTD_frameHeader structure with important information to correctly decode the frame,\n such as the dictionary ID, content size, or maximum back-reference distance (`windowSize`).\n Note that these values could be wrong, either because of data corruption, or because a 3rd party deliberately spoofs false information.\n As a consequence, check that values remain within valid application range.\n For example, do not allocate memory blindly, check that `windowSize` is within expectation.\n Each application can set its own limits, depending on local restrictions.\n For extended interoperability, it is recommended to support `windowSize` of at least 8 MB.\n\n ZSTD_decompressContinue() needs previous data blocks during decompression, up to `windowSize` bytes.\n ZSTD_decompressContinue() is very sensitive to contiguity,\n if 2 blocks don't follow each other, make sure that either the compressor breaks contiguity at the same place,\n or that previous contiguous segment is large enough to properly handle maximum back-reference distance.\n There are multiple ways to guarantee this condition.\n\n The most memory efficient way is to use a round buffer of sufficient size.\n Sufficient size is determined by invoking ZSTD_decodingBufferSize_min(),\n which can @return an error code if required value is too large for current system (in 32-bits mode).\n In a round buffer methodology, ZSTD_decompressContinue() decompresses each block next to previous one,\n up to the moment there is not enough room left in the buffer to guarantee decoding another full block,\n which maximum size is provided in `ZSTD_frameHeader` structure, field `blockSizeMax`.\n At which point, decoding can resume from the beginning of the buffer.\n Note that already decoded data stored in the buffer should be flushed before being overwritten.\n\n There are alternatives possible, for example using two or more buffers of size `windowSize` each, though they consume more memory.\n\n Finally, if you control the compression process, you can also ignore all buffer size rules,\n as long as the encoder and decoder progress in \"lock-step\",\n aka use exactly the same buffer sizes, break contiguity at the same place, etc.\n\n Once buffers are setup, start decompression, with ZSTD_decompressBegin().\n If decompression requires a dictionary, use ZSTD_decompressBegin_usingDict() or ZSTD_decompressBegin_usingDDict().\n\n Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue() alternatively.\n ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize' to ZSTD_decompressContinue().\n ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will fail.\n\n @result of ZSTD_decompressContinue() is the number of bytes regenerated within 'dst' (necessarily <= dstCapacity).\n It can be zero : it just means ZSTD_decompressContinue() has decoded some metadata item.\n It can also be an error code, which can be tested with ZSTD_isError().\n\n A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.\n Context can then be reset to start a new decompression.\n\n Note : it's possible to know if next input to present is a header or a block, using ZSTD_nextInputType().\n This information is not required to properly decode a frame.\n\n == Special case : skippable frames ==\n\n Skippable frames allow integration of user-defined data into a flow of concatenated frames.\n Skippable frames will be ignored (skipped) by decompressor.\n The format of skippable frames is as follows :\n a) Skippable frame ID - 4 Bytes, Little endian format, any value from 0x184D2A50 to 0x184D2A5F\n b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits\n c) Frame Content - any content (User Data) of length equal to Frame Size\n For skippable frames ZSTD_getFrameHeader() returns zfhPtr->frameType==ZSTD_skippableFrame.\n For skippable frames ZSTD_decompressContinue() always returns 0 : it only skips the content.\n*/\n\n/*===== Buffer-less streaming decompression functions =====*/\ntypedef enum { ZSTD_frame, ZSTD_skippableFrame } ZSTD_frameType_e;\ntypedef struct {\n unsigned long long frameContentSize; /* if == ZSTD_CONTENTSIZE_UNKNOWN, it means this field is not available. 0 means \"empty\" */\n unsigned long long windowSize; /* can be very large, up to <= frameContentSize */\n unsigned blockSizeMax;\n ZSTD_frameType_e frameType; /* if == ZSTD_skippableFrame, frameContentSize is the size of skippable content */\n unsigned headerSize;\n unsigned dictID;\n unsigned checksumFlag;\n} ZSTD_frameHeader;\n\n/*! ZSTD_getFrameHeader() :\n * decode Frame Header, or requires larger `srcSize`.\n * @return : 0, `zfhPtr` is correctly filled,\n * >0, `srcSize` is too small, value is wanted `srcSize` amount,\n * or an error code, which can be tested using ZSTD_isError() */\nZSTDLIB_API size_t ZSTD_getFrameHeader(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize); /**< doesn't consume input */\n/*! ZSTD_getFrameHeader_advanced() :\n * same as ZSTD_getFrameHeader(),\n * with added capability to select a format (like ZSTD_f_zstd1_magicless) */\nZSTDLIB_API size_t ZSTD_getFrameHeader_advanced(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize, ZSTD_format_e format);\nZSTDLIB_API size_t ZSTD_decodingBufferSize_min(unsigned long long windowSize, unsigned long long frameContentSize); /**< when frame content size is not known, pass in frameContentSize == ZSTD_CONTENTSIZE_UNKNOWN */\n\nZSTDLIB_API size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx);\nZSTDLIB_API size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);\nZSTDLIB_API size_t ZSTD_decompressBegin_usingDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);\n\nZSTDLIB_API size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx);\nZSTDLIB_API size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);\n\n/* misc */\nZSTDLIB_API void ZSTD_copyDCtx(ZSTD_DCtx* dctx, const ZSTD_DCtx* preparedDCtx);\ntypedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_lastBlock, ZSTDnit_checksum, ZSTDnit_skippableFrame } ZSTD_nextInputType_e;\nZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);\n\n\n\n\n/* ============================ */\n/** Block level API */\n/* ============================ */\n\n/*!\n Block functions produce and decode raw zstd blocks, without frame metadata.\n Frame metadata cost is typically ~12 bytes, which can be non-negligible for very small blocks (< 100 bytes).\n But users will have to take in charge needed metadata to regenerate data, such as compressed and content sizes.\n\n A few rules to respect :\n - Compressing and decompressing require a context structure\n + Use ZSTD_createCCtx() and ZSTD_createDCtx()\n - It is necessary to init context before starting\n + compression : any ZSTD_compressBegin*() variant, including with dictionary\n + decompression : any ZSTD_decompressBegin*() variant, including with dictionary\n + copyCCtx() and copyDCtx() can be used too\n - Block size is limited, it must be <= ZSTD_getBlockSize() <= ZSTD_BLOCKSIZE_MAX == 128 KB\n + If input is larger than a block size, it's necessary to split input data into multiple blocks\n + For inputs larger than a single block, consider using regular ZSTD_compress() instead.\n Frame metadata is not that costly, and quickly becomes negligible as source size grows larger than a block.\n - When a block is considered not compressible enough, ZSTD_compressBlock() result will be 0 (zero) !\n ===> In which case, nothing is produced into `dst` !\n + User __must__ test for such outcome and deal directly with uncompressed data\n + A block cannot be declared incompressible if ZSTD_compressBlock() return value was != 0.\n Doing so would mess up with statistics history, leading to potential data corruption.\n + ZSTD_decompressBlock() _doesn't accept uncompressed data as input_ !!\n + In case of multiple successive blocks, should some of them be uncompressed,\n decoder must be informed of their existence in order to follow proper history.\n Use ZSTD_insertBlock() for such a case.\n*/\n\n/*===== Raw zstd block functions =====*/\nZSTDLIB_API size_t ZSTD_getBlockSize (const ZSTD_CCtx* cctx);\nZSTDLIB_API size_t ZSTD_compressBlock (ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);\nZSTDLIB_API size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);\nZSTDLIB_API size_t ZSTD_insertBlock (ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize); /**< insert uncompressed block into `dctx` history. Useful for multi-blocks decompression. */\n\n\n#endif /* ZSTD_H_ZSTD_STATIC_LINKING_ONLY */\n\n#if defined (__cplusplus)\n}\n#endif\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":10,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241440},"to":{"change":7,"start":25,"end":52},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"use std::convert::TryInto;\n"}]}},{"Replacement":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":11,"ins":{"up_context":[{"change":7,"pos":72}],"down_context":[{"change":7,"pos":174}],"flag":"BLOCK","start":0,"end":25,"inode":{"change":7,"pos":241245}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":72},"to":{"change":7,"start":72,"end":114},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":114},"to":{"change":4,"start":0,"end":47},"introduced_by":4}],"inode":{"change":7,"pos":241245}},"ins_contents":[{"Add":"use std::{fmt, io, ptr};"}],"del_contents":[{"Del":"use std::hash::Hasher;\nuse std::io::Read;\n"},{"Del":"use std::{cmp, fmt, fs, io, ptr, slice, sync};\n"}]}},{"Replacement":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":13,"ins":{"up_context":[{"change":7,"pos":175}],"down_context":[{"change":7,"pos":216}],"flag":"BLOCK","start":26,"end":101,"inode":{"change":7,"pos":241245}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":175},"to":{"change":7,"start":0,"end":39},"introduced_by":7}],"inode":{"change":7,"pos":241245}},"ins_contents":[{"Add":"mod compress;"},{"Add":"pub use compress::*;"},{"Add":""},{"Add":"mod decompress;"},{"Add":"pub use decompress::*;"}],"del_contents":[{"Del":"use twox_hash::xxh3::{hash64, Hash64};\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":21,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":119},"to":{"change":7,"start":119,"end":215},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"const SEEKABLE_BUFF_SIZE: usize = BLOCK_SIZE_MAX;\nconst SEEKABLE_MAX_FRAMES: usize = 0x8000000;\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":22,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":400},"to":{"change":7,"start":0,"end":49},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":49},"to":{"change":7,"start":0,"end":97},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":400},"to":{"change":7,"start":0,"end":97},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":97},"to":{"change":7,"start":489,"end":529},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":489},"to":{"change":7,"start":489,"end":529},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"const SEEKABLE_NO_OUTPUT_PROGRESS_MAX: u32 = 16;\n"},{"Del":"const MAX_FRAME_DECOMPR_SIZE: usize = 0x80000000;\nconst MAGIC_SKIPPABLE_START: u32 = 0x184D2A50;\n"},{"Del":"const SKIPPABLE_HEADER_SIZE: usize = 8;\n"}]}},{"Replacement":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":24,"ins":{"up_context":[{"change":7,"pos":145}],"down_context":[{"change":7,"pos":51}],"flag":"BLOCK","start":102,"end":189,"inode":{"change":7,"pos":241245}},"del":{"edges":[{"previous":"","flag":"DELETED","from":{"change":7,"pos":145},"to":{"change":7,"start":619,"end":665},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":619},"to":{"change":7,"start":619,"end":665},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":665},"to":{"change":7,"start":50,"end":51},"introduced_by":7}],"inode":{"change":7,"pos":241245}},"ins_contents":[{"Add":"const SKIPPABLE_HEADER_SIZE: usize = 8;"},{"Add":"const MAGIC_SKIPPABLE_START: u32 = 0x184D2A50;"}],"del_contents":[{"Del":"const FRAMELOG_STARTING_CAPACITY: usize = 16;\n"},{"Del":"\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":27,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241541},"to":{"change":7,"start":241541,"end":241542},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241542},"to":{"change":7,"start":666,"end":744},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":744},"to":{"change":7,"start":216,"end":235},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":235},"to":{"change":7,"start":763,"end":765},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":763},"to":{"change":7,"start":763,"end":765},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"\n"},{"Del":"#[derive(Clone)]\npub struct FrameLogEntry {\n c_size: u32,\n d_size: u32,\n"},{"Del":" checksum: u32,\n"},{"Del":"}\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":28,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":766},"to":{"change":7,"start":766,"end":850},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":850},"to":{"change":7,"start":236,"end":260},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":260},"to":{"change":7,"start":874,"end":926},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":874},"to":{"change":7,"start":874,"end":926},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":66},"to":{"change":7,"start":241646,"end":241648},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":926},"to":{"change":7,"start":241646,"end":241648},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241646},"to":{"change":7,"start":241646,"end":241648},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"/// The type of compressors.\npub struct FrameLog {\n entries: Vec,\n"},{"Del":" checksum_flag: u32,\n"},{"Del":" seek_table_pos: u32,\n seek_table_index: u32,\n"},{"Del":"}\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":32,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241725},"to":{"change":7,"start":241725,"end":241728},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241728},"to":{"change":7,"start":927,"end":1086},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1086},"to":{"change":7,"start":40,"end":63},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":63},"to":{"change":7,"start":146,"end":173},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1111},"to":{"change":7,"start":146,"end":173},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":173},"to":{"change":7,"start":1136,"end":1192},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1136},"to":{"change":7,"start":1136,"end":1192},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1192},"to":{"change":7,"start":95,"end":133},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":133},"to":{"change":7,"start":261,"end":280},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"}\n\n"},{"Del":"/// The type of seekable compressors.\npub struct SeekableCStream {\n cstream: CStream,\n framelog: FrameLog,\n frame_c_size: u32,\n frame_d_size: u32,\n"},{"Del":" xxh_state: Hash64,\n"},{"Del":" max_frame_size: usize,\n"},{"Del":" writing_seek_table: bool,\n}\n\npub struct SeekEntry {\n"},{"Del":" c_offset: u64,\n d_offset: u64,\n"},{"Del":" checksum: u32,\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":34,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241809},"to":{"change":7,"start":1254,"end":1306},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1306},"to":{"change":7,"start":281,"end":305},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":305},"to":{"change":7,"start":1330,"end":1332},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1330},"to":{"change":7,"start":1330,"end":1332},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"pub struct SeekTable {\n entries: Vec,\n"},{"Del":" checksum_flag: u32,\n"},{"Del":"}\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":35,"atom":{"EdgeMap":{"edges":[{"previous":"","flag":"DELETED","from":{"change":7,"pos":1333},"to":{"change":7,"start":241809,"end":241840},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241809},"to":{"change":7,"start":241809,"end":241840},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241840},"to":{"change":7,"start":53,"end":78},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":78},"to":{"change":7,"start":1334,"end":1393},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241869},"to":{"change":7,"start":1334,"end":1393},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1393},"to":{"change":7,"start":79,"end":91},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":91},"to":{"change":7,"start":134,"end":169},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":91},"to":{"change":7,"start":1413,"end":1542},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":169},"to":{"change":7,"start":1413,"end":1542},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1413},"to":{"change":7,"start":1413,"end":1542},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1542},"to":{"change":7,"start":64,"end":87},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":87},"to":{"change":7,"start":241980,"end":241983},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1666},"to":{"change":7,"start":241980,"end":241983},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241980},"to":{"change":7,"start":241980,"end":241983},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":241983},"to":{"change":7,"start":92,"end":131},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":131},"to":{"change":7,"start":242031,"end":242156},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":242031},"to":{"change":7,"start":242031,"end":242156},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"/// The type of decompressors.\n"},{"Del":"pub struct Seekable {\n"},{"Del":" dstream: *mut ZSTD_DStream,\n seek_table: SeekTable,\n"},{"Del":" src: R,\n"},{"Del":" inner_buf_size: Option,\n"},{"Del":" decompressed_offset: u64,\n cur_frame: u32,\n in_buff: [u8; SEEKABLE_BUFF_SIZE],\n out_buff: [u8; SEEKABLE_BUFF_SIZE],\n"},{"Del":" xxh_state: Hash64,\n"},{"Del":"}\n\n"},{"Del":"unsafe impl Send for Seekable {}\n"},{"Del":"unsafe impl Send for SeekableCStream {}\nunsafe impl Send for FrameLog {}\nunsafe impl Send for CompressedFrame {}\n\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":101,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":243307},"to":{"change":7,"start":243307,"end":243308},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":243308},"to":{"change":7,"start":132,"end":163},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":163},"to":{"change":7,"start":243347,"end":243372},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2091},"to":{"change":7,"start":243347,"end":243372},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":243347},"to":{"change":7,"start":243347,"end":243372},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":243372},"to":{"change":7,"start":2092,"end":2246},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2246},"to":{"change":7,"start":243829,"end":243859},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":243829},"to":{"change":7,"start":243829,"end":243859},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":244478},"to":{"change":7,"start":244478,"end":244480},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2594},"to":{"change":7,"start":2594,"end":2665},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2665},"to":{"change":7,"start":1503,"end":1601},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1601},"to":{"change":7,"start":245043,"end":245046},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2798},"to":{"change":7,"start":245043,"end":245046},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245043},"to":{"change":7,"start":245043,"end":245046},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245046},"to":{"change":5,"start":0,"end":23},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":23},"to":{"change":7,"start":245069,"end":245280},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2826},"to":{"change":7,"start":245069,"end":245280},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245069},"to":{"change":7,"start":245069,"end":245280},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245280},"to":{"change":7,"start":1602,"end":1675},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1675},"to":{"change":7,"start":2898,"end":3082},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2898},"to":{"change":7,"start":2898,"end":3082},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3082},"to":{"change":7,"start":1676,"end":1754},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":59},"to":{"change":7,"start":3149,"end":3322},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1754},"to":{"change":7,"start":3149,"end":3322},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3149},"to":{"change":7,"start":3149,"end":3322},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3322},"to":{"change":7,"start":1755,"end":1981},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1981},"to":{"change":7,"start":3457,"end":3857},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245707},"to":{"change":7,"start":3457,"end":3857},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3857},"to":{"change":7,"start":88,"end":137},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":137},"to":{"change":7,"start":3908,"end":3998},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3908},"to":{"change":7,"start":3908,"end":3998},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3998},"to":{"change":7,"start":245745,"end":246170},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":245745},"to":{"change":7,"start":245745,"end":246170},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246170},"to":{"change":7,"start":3999,"end":4168},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4168},"to":{"change":7,"start":1982,"end":2108},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2108},"to":{"change":7,"start":4257,"end":4349},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4257},"to":{"change":7,"start":4257,"end":4349},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4349},"to":{"change":7,"start":2109,"end":2132},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2132},"to":{"change":7,"start":4390,"end":4961},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4390},"to":{"change":7,"start":4390,"end":4961},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4961},"to":{"change":7,"start":2133,"end":2248},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2248},"to":{"change":7,"start":5068,"end":5166},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5068},"to":{"change":7,"start":5068,"end":5166},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":5166},"to":{"change":7,"start":246737,"end":246751},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246737},"to":{"change":7,"start":246737,"end":246751},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246751},"to":{"change":7,"start":5167,"end":5240},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5240},"to":{"change":7,"start":2249,"end":2332},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2332},"to":{"change":7,"start":5322,"end":5361},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5322},"to":{"change":7,"start":5322,"end":5361},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5361},"to":{"change":7,"start":2333,"end":2402},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2402},"to":{"change":7,"start":5435,"end":5624},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5435},"to":{"change":7,"start":5435,"end":5624},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5624},"to":{"change":3,"start":0,"end":43},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":3,"pos":43},"to":{"change":7,"start":5676,"end":5878},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":7,"pos":366},"to":{"change":7,"start":5676,"end":5878},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5676},"to":{"change":7,"start":5676,"end":5878},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5878},"to":{"change":7,"start":772,"end":974},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":974},"to":{"change":7,"start":5935,"end":5982},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5935},"to":{"change":7,"start":5935,"end":5982},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5982},"to":{"change":7,"start":138,"end":189},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":189},"to":{"change":7,"start":246809,"end":246819},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6035},"to":{"change":7,"start":246809,"end":246819},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246809},"to":{"change":7,"start":246809,"end":246819},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246819},"to":{"change":7,"start":6036,"end":6051},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6051},"to":{"change":7,"start":246819,"end":246902},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246819},"to":{"change":7,"start":246819,"end":246902},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":246902},"to":{"change":7,"start":2403,"end":2651},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2651},"to":{"change":7,"start":6140,"end":6204},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6140},"to":{"change":7,"start":6140,"end":6204},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6204},"to":{"change":7,"start":2652,"end":2711},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2711},"to":{"change":7,"start":6258,"end":6368},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6258},"to":{"change":7,"start":6258,"end":6368},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6368},"to":{"change":7,"start":2712,"end":2759},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2759},"to":{"change":7,"start":6407,"end":6479},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6407},"to":{"change":7,"start":6407,"end":6479},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6479},"to":{"change":7,"start":247348,"end":247362},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":247348},"to":{"change":7,"start":247348,"end":247362},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":247398},"to":{"change":7,"start":247398,"end":247408},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":247408},"to":{"change":7,"start":6480,"end":6521},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":6521},"to":{"change":7,"start":0,"end":80},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"\n"},{"Del":"impl Drop for Seekable {\n"},{"Del":" fn drop(&mut self) {\n"},{"Del":" if !self.dstream.is_null() {\n unsafe {\n ZSTD_freeDStream(self.dstream);\n self.dstream = ptr::null_mut();\n"},{"Del":" }\n }\n }\n"},{"Del":"}\n"},{"Del":"#[inline(always)]\nfn slice_to_num(buff: &[u8]) -> Result {\n"},{"Del":" Ok(u32::from_ne_bytes(\n buff.try_into().map_err(|_| Error::InvalidConversion)?,\n ))\n"},{"Del":"}\n\n"},{"Del":"impl SeekableCStream {\n"},{"Del":" /// Create a compressor with the given level and frame size. When seeking in the file, frames are decompressed one by one, so this should be chosen of a size similar to the chunks that will be decompressed.\n"},{"Del":" pub fn new(level: usize, frame_size: usize) -> Result {\n"},{"Del":" let cstream = unsafe { ZSTD_createCStream() };\n\n if cstream.is_null() {\n return Err(Error::Null);\n }\n\n if frame_size > MAX_FRAME_DECOMPR_SIZE {\n"},{"Del":" Err(Error::FParamUnsupported(frame_size, MAX_FRAME_DECOMPR_SIZE))\n"},{"Del":" } else {\n let max_frame_size = if frame_size > 0 {\n frame_size\n } else {\n MAX_FRAME_DECOMPR_SIZE\n };\n\n"},{"Del":" unsafe {\n let result = ZSTD_initCStream(cstream, level as c_int);\n if ZSTD_isError(result) != 0 {\n return Err(Error::ZSTD(result));\n }\n };\n"},{"Del":"\n Ok(SeekableCStream {\n cstream: CStream { p: cstream },\n framelog: FrameLog {\n entries: Vec::with_capacity(FRAMELOG_STARTING_CAPACITY),\n checksum_flag: 1,\n seek_table_pos: 0,\n seek_table_index: 0,\n },\n frame_c_size: 0,\n frame_d_size: 0,\n"},{"Del":" xxh_state: Hash64::with_seed(0),\n"},{"Del":" max_frame_size,\n writing_seek_table: false,\n })\n"},{"Del":" }\n }\n /// Compress one chunk of input, and write it into the output. The `output` array must be large enough to hold the result. If successful, this function returns two integers `(out_pos, in_pos)`, where `out_pos` is the number of bytes written in `output`, and `in_pos` is the number of input bytes consumed.\n pub fn compress(&mut self, output: &mut [u8], input: &[u8]) -> Result<(usize, usize), Error> {\n"},{"Del":" let mut output = ZSTD_outBuffer {\n dst: output.as_mut_ptr() as *mut c_void,\n size: output.len() as size_t,\n pos: 0,\n };\n\n"},{"Del":" let len = cmp::min(\n input.len(),\n self.max_frame_size - self.frame_d_size as usize,\n );\n"},{"Del":"\n let mut in_tmp = ZSTD_inBuffer {\n src: input.as_ptr() as *const c_void,\n"},{"Del":" size: len,\n"},{"Del":" pos: 0,\n };\n\n if len > 0 {\n let ret = unsafe { ZSTD_compressStream(self.cstream.p, &mut output, &mut in_tmp) };\n\n if self.framelog.checksum_flag != 0 {\n self.xxh_state\n .write(unsafe { slice::from_raw_parts(in_tmp.src as *const _, in_tmp.pos) });\n }\n\n self.frame_c_size += output.pos as u32;\n self.frame_d_size += in_tmp.pos as u32;\n\n if unsafe { ZSTD_isError(ret) } != 0 {\n return Err(Error::ZSTD(ret));\n }\n }\n\n"},{"Del":" if self.max_frame_size == self.frame_d_size as usize {\n let ret = self.end_frame(&mut output)?;\n"},{"Del":"\n if unsafe { ZSTD_isError(ret) } != 0 {\n return Err(Error::ZSTD(ret));\n"},{"Del":" }\n"},{"Del":" }\n\n Ok((output.pos as usize, in_tmp.pos as usize))\n }\n\n"},{"Del":" fn end_frame(&mut self, output: &mut ZSTD_outBuffer) -> Result {\n"},{"Del":" let prev_out_pos = output.pos;\n"},{"Del":" let ret = unsafe { ZSTD_endStream(self.cstream.p, output) };\n"},{"Del":"\n self.frame_c_size += (output.pos - prev_out_pos) as u32;\n\n if ret != 0 {\n return Ok(ret);\n }\n\n let checksum = if self.framelog.checksum_flag != 0 {\n"},{"Del":" self.xxh_state.finish() as u32\n"},{"Del":" } else {\n 0\n };\n\n self.framelog\n .log_frame(self.frame_c_size, self.frame_d_size, checksum)?;\n\n self.frame_c_size = 0;\n self.frame_d_size = 0;\n\n"},{"Del":" unsafe {\n let r = ZSTD_CCtx_reset(self.cstream.p, ZSTD_reset_session_only);\n if ZSTD_isError(r) != 0 {\n return Err(Error::ZSTD(r));\n }\n };\n"},{"Del":"\n if self.framelog.checksum_flag != 0 {\n"},{"Del":" self.xxh_state = Hash64::with_seed(0);\n"},{"Del":" }\n"},{"Del":"\n Ok(0)\n"},{"Del":" }\n\n /// Finish writing the message, i.e. write the remaining pending block.\n"},{"Del":" pub fn end_stream(&mut self, output: &mut [u8]) -> Result {\n let mut output_ = ZSTD_outBuffer {\n dst: output.as_mut_ptr() as *mut c_void,\n size: output.len() as size_t,\n pos: 0,\n };\n\n"},{"Del":" if !self.writing_seek_table && self.frame_d_size != 0 {\n"},{"Del":" let end_frame = self.end_frame(&mut output_)?;\n"},{"Del":"\n if unsafe { ZSTD_isError(end_frame) } != 0 {\n return Err(Error::ZSTD(end_frame));\n"},{"Del":" }\n\n if end_frame != 0 {\n"},{"Del":" return Ok(end_frame + self.framelog.seek_table_size());\n"},{"Del":" }\n"},{"Del":" }\n"},{"Del":"\n self.writing_seek_table = true;\n"},{"Del":" let result = self.framelog.write_seek_table(output, &mut output_.pos)?;\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":102,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2829},"to":{"change":7,"start":2829,"end":2968},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":107},"to":{"change":7,"start":247408,"end":247416},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2968},"to":{"change":7,"start":247408,"end":247416},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6576},"to":{"change":7,"start":247408,"end":247416},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":247408},"to":{"change":7,"start":247408,"end":247416},"introduced_by":7}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":" if unsafe { ZSTD_isError(result) } != 0 {\n return Err(Error::ZSTD(result));\n }\n\n Ok(output_.pos as usize)\n"},{"Del":" }\n}\n"}]}},{"Replacement":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":126,"ins":{"up_context":[{"change":7,"pos":248022}],"down_context":[{"change":7,"pos":248401}],"flag":"BLOCK","start":190,"end":617,"inode":{"change":7,"pos":241245}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":248022},"to":{"change":7,"start":248022,"end":248401},"introduced_by":7}],"inode":{"change":7,"pos":241245}},"ins_contents":[{"Add":" /// Compress one chunk of input, and write it into the output. The"},{"Add":" /// `output` array must be large enough to hold the result. If"},{"Add":" /// successful, this function returns three integers `(out_pos,"},{"Add":" /// in_pos, next_read_size)`, where `out_pos` is the number of"},{"Add":" /// bytes written in `output`, `in_pos` is the number of input"},{"Add":" /// bytes consumed, and `next_read_size` is a hint for the next"},{"Add":" /// read size."}],"del_contents":[{"Del":" /// Compress one chunk of input, and write it into the output. The `output` array must be large enough to hold the result. If successful, this function returns three integers `(out_pos, in_pos, next_read_size)`, where `out_pos` is the number of bytes written in `output`, `in_pos` is the number of input bytes consumed, and `next_read_size` is a hint for the next read size.\n"}]}},{"Edit":{"inode":{"change":7,"pos":241245},"path":"src/lib.rs","line":262,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":8818},"to":{"change":7,"start":8818,"end":8819},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":8819},"to":{"change":7,"start":164,"end":207},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":207},"to":{"change":7,"start":391,"end":464},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":464},"to":{"change":6,"start":0,"end":63},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":6,"pos":63},"to":{"change":7,"start":3587,"end":3650},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":7,"pos":543},"to":{"change":7,"start":3587,"end":3650},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1054},"to":{"change":7,"start":3587,"end":3650},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3587},"to":{"change":7,"start":3587,"end":3650},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3650},"to":{"change":7,"start":544,"end":642},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":642},"to":{"change":6,"start":64,"end":297},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":6,"pos":297},"to":{"change":7,"start":8967,"end":9135},"introduced_by":6},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":8967},"to":{"change":7,"start":8967,"end":9135},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9135},"to":{"change":7,"start":1147,"end":1181},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1181},"to":{"change":7,"start":9135,"end":9290},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9135},"to":{"change":7,"start":9135,"end":9290},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9290},"to":{"change":7,"start":190,"end":235},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":235},"to":{"change":6,"start":298,"end":309},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":6,"pos":309},"to":{"change":7,"start":252005,"end":252011},"introduced_by":6},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252005},"to":{"change":7,"start":252005,"end":252011},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252011},"to":{"change":7,"start":9507,"end":9565},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9565},"to":{"change":7,"start":236,"end":346},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":346},"to":{"change":7,"start":9565,"end":9582},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9565},"to":{"change":7,"start":9565,"end":9582},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9582},"to":{"change":7,"start":108,"end":181},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":181},"to":{"change":7,"start":252013,"end":252014},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":9654},"to":{"change":7,"start":252013,"end":252014},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252013},"to":{"change":7,"start":252013,"end":252014},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252014},"to":{"change":7,"start":278,"end":356},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":356},"to":{"change":7,"start":3651,"end":3692},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":229},"to":{"change":7,"start":9766,"end":9767},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3692},"to":{"change":7,"start":9766,"end":9767},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9766},"to":{"change":7,"start":9766,"end":9767},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9767},"to":{"change":7,"start":3693,"end":3849},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3849},"to":{"change":7,"start":9904,"end":9915},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9904},"to":{"change":7,"start":9904,"end":9915},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":9915},"to":{"change":7,"start":1182,"end":1305},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1305},"to":{"change":7,"start":3898,"end":3975},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3898},"to":{"change":7,"start":3898,"end":3975},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3975},"to":{"change":7,"start":252727,"end":252737},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":10084},"to":{"change":7,"start":252727,"end":252737},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252727},"to":{"change":7,"start":252727,"end":252737},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252737},"to":{"change":7,"start":10085,"end":10371},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":10371},"to":{"change":7,"start":252743,"end":252744},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252743},"to":{"change":7,"start":252743,"end":252744},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":252744},"to":{"change":7,"start":10372,"end":10510},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10510},"to":{"change":7,"start":230,"end":295},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":295},"to":{"change":7,"start":10574,"end":10575},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10574},"to":{"change":7,"start":10574,"end":10575},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10575},"to":{"change":7,"start":357,"end":412},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":412},"to":{"change":7,"start":3976,"end":4018},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":343},"to":{"change":7,"start":10664,"end":10695},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4018},"to":{"change":7,"start":10664,"end":10695},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10664},"to":{"change":7,"start":10664,"end":10695},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10695},"to":{"change":7,"start":4019,"end":4186},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4186},"to":{"change":7,"start":10839,"end":10849},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10839},"to":{"change":7,"start":10839,"end":10849},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10849},"to":{"change":7,"start":4187,"end":4362},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4362},"to":{"change":7,"start":10999,"end":11099},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":10999},"to":{"change":7,"start":10999,"end":11099},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11099},"to":{"change":4,"start":48,"end":78},"introduced_by":4},{"previous":"","flag":"DELETED","from":{"change":4,"pos":78},"to":{"change":7,"start":11150,"end":11201},"introduced_by":4},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11150},"to":{"change":7,"start":11150,"end":11201},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11261},"to":{"change":7,"start":11261,"end":11262},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11262},"to":{"change":7,"start":347,"end":382},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":382},"to":{"change":7,"start":11295,"end":11352},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11295},"to":{"change":7,"start":11295,"end":11352},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11352},"to":{"change":7,"start":4363,"end":4418},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4418},"to":{"change":7,"start":11401,"end":11482},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11401},"to":{"change":7,"start":11401,"end":11482},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11482},"to":{"change":7,"start":0,"end":73},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":73},"to":{"change":7,"start":11639,"end":11640},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":151},"to":{"change":7,"start":11639,"end":11640},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11639},"to":{"change":7,"start":11639,"end":11640},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11640},"to":{"change":7,"start":413,"end":476},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":476},"to":{"change":7,"start":74,"end":149},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":149},"to":{"change":7,"start":11896,"end":11959},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":225},"to":{"change":7,"start":11896,"end":11959},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":487},"to":{"change":7,"start":11896,"end":11959},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4631},"to":{"change":7,"start":11896,"end":11959},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11896},"to":{"change":7,"start":11896,"end":11959},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":11959},"to":{"change":7,"start":253325,"end":253339},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253325},"to":{"change":7,"start":253325,"end":253339},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253339},"to":{"change":7,"start":11960,"end":11961},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":11961},"to":{"change":7,"start":4632,"end":4766},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":4766},"to":{"change":7,"start":150,"end":151},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":151},"to":{"change":7,"start":643,"end":718},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":718},"to":{"change":7,"start":12131,"end":12153},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4879},"to":{"change":7,"start":12131,"end":12153},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12131},"to":{"change":7,"start":12131,"end":12153},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12153},"to":{"change":7,"start":1378,"end":1453},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1453},"to":{"change":7,"start":12230,"end":12289},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12230},"to":{"change":7,"start":12230,"end":12289},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12289},"to":{"change":7,"start":719,"end":803},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":803},"to":{"change":7,"start":12380,"end":12406},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12380},"to":{"change":7,"start":12380,"end":12406},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":12406},"to":{"change":7,"start":253499,"end":253513},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253499},"to":{"change":7,"start":253499,"end":253513},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":12430},"to":{"change":7,"start":253683,"end":253693},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253683},"to":{"change":7,"start":253683,"end":253693},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253693},"to":{"change":7,"start":4880,"end":4995},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4995},"to":{"change":7,"start":12529,"end":12572},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12529},"to":{"change":7,"start":12529,"end":12572},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12572},"to":{"change":7,"start":804,"end":866},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":866},"to":{"change":7,"start":12634,"end":12650},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12634},"to":{"change":7,"start":12634,"end":12650},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":12650},"to":{"change":7,"start":253693,"end":253699},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253693},"to":{"change":7,"start":253693,"end":253699},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253701},"to":{"change":7,"start":253701,"end":253702},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":253702},"to":{"change":7,"start":12651,"end":12821},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":12821},"to":{"change":7,"start":4996,"end":5125},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5125},"to":{"change":7,"start":1454,"end":1501},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":200},"to":{"change":7,"start":5180,"end":5238},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1501},"to":{"change":7,"start":5180,"end":5238},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5180},"to":{"change":7,"start":5180,"end":5238},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":5238},"to":{"change":7,"start":254705,"end":254722},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":13026},"to":{"change":7,"start":254705,"end":254722},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254705},"to":{"change":7,"start":254705,"end":254722},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254722},"to":{"change":5,"start":56,"end":213},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":213},"to":{"change":7,"start":13168,"end":13330},"introduced_by":5},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13168},"to":{"change":7,"start":13168,"end":13330},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13330},"to":{"change":7,"start":1502,"end":1613},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1613},"to":{"change":7,"start":5299,"end":5316},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5299},"to":{"change":7,"start":5299,"end":5316},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5316},"to":{"change":5,"start":214,"end":289},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":289},"to":{"change":7,"start":13430,"end":13440},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1699},"to":{"change":7,"start":13430,"end":13440},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":5471},"to":{"change":7,"start":13430,"end":13440},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13430},"to":{"change":7,"start":13430,"end":13440},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":13576},"to":{"change":7,"start":254803,"end":254809},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254803},"to":{"change":7,"start":254803,"end":254809},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254811},"to":{"change":7,"start":254811,"end":254812},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254842},"to":{"change":7,"start":254842,"end":254911},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254911},"to":{"change":5,"start":290,"end":347},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":347},"to":{"change":7,"start":254967,"end":255102},"introduced_by":5},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":254967},"to":{"change":7,"start":254967,"end":255102},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255102},"to":{"change":5,"start":348,"end":436},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":436},"to":{"change":7,"start":383,"end":451},"introduced_by":5},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1798},"to":{"change":7,"start":383,"end":451},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":451},"to":{"change":5,"start":437,"end":473},"introduced_by":5},{"previous":"","flag":"DELETED","from":{"change":5,"pos":473},"to":{"change":7,"start":1886,"end":1998},"introduced_by":5},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1886},"to":{"change":7,"start":1886,"end":1998},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":588},"to":{"change":7,"start":13716,"end":13789},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1998},"to":{"change":7,"start":13716,"end":13789},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13716},"to":{"change":7,"start":13716,"end":13789},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13789},"to":{"change":7,"start":1999,"end":2085},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2085},"to":{"change":7,"start":452,"end":590},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":590},"to":{"change":7,"start":13825,"end":13942},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2085},"to":{"change":7,"start":13825,"end":13942},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13825},"to":{"change":7,"start":13825,"end":13942},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":13942},"to":{"change":7,"start":2086,"end":2174},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2174},"to":{"change":7,"start":14037,"end":14140},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14037},"to":{"change":7,"start":14037,"end":14140},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14140},"to":{"change":7,"start":2175,"end":2240},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2240},"to":{"change":7,"start":589,"end":610},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14212},"to":{"change":7,"start":589,"end":610},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":610},"to":{"change":7,"start":14232,"end":14233},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14232},"to":{"change":7,"start":14232,"end":14233},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14233},"to":{"change":7,"start":591,"end":669},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":669},"to":{"change":7,"start":2241,"end":2242},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14429},"to":{"change":7,"start":2241,"end":2242},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":2242},"to":{"change":7,"start":670,"end":725},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":725},"to":{"change":7,"start":2243,"end":2694},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14486},"to":{"change":7,"start":2243,"end":2694},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2694},"to":{"change":7,"start":255499,"end":255513},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":14546},"to":{"change":7,"start":255499,"end":255513},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255499},"to":{"change":7,"start":255499,"end":255513},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255513},"to":{"change":7,"start":14547,"end":14615},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":14615},"to":{"change":7,"start":226,"end":416},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":416},"to":{"change":7,"start":201,"end":682},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":505},"to":{"change":7,"start":15041,"end":15066},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":682},"to":{"change":7,"start":15041,"end":15066},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15041},"to":{"change":7,"start":15041,"end":15066},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15066},"to":{"change":7,"start":683,"end":812},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":812},"to":{"change":7,"start":2695,"end":2743},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2743},"to":{"change":7,"start":851,"end":1011},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":851},"to":{"change":7,"start":851,"end":1011},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":575},"to":{"change":7,"start":15285,"end":15305},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1011},"to":{"change":7,"start":15285,"end":15305},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15285},"to":{"change":7,"start":15285,"end":15305},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15305},"to":{"change":7,"start":726,"end":800},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":800},"to":{"change":7,"start":5535,"end":5594},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":2823},"to":{"change":7,"start":5535,"end":5594},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15353},"to":{"change":7,"start":5535,"end":5594},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5594},"to":{"change":7,"start":801,"end":892},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":892},"to":{"change":7,"start":5690,"end":5842},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5690},"to":{"change":7,"start":5690,"end":5842},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":5842},"to":{"change":7,"start":15615,"end":15672},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15615},"to":{"change":7,"start":15615,"end":15672},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":15672},"to":{"change":7,"start":1012,"end":1172},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":687},"to":{"change":7,"start":16075,"end":16094},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1172},"to":{"change":7,"start":16075,"end":16094},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16075},"to":{"change":7,"start":16075,"end":16094},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16094},"to":{"change":7,"start":2824,"end":3299},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3299},"to":{"change":7,"start":893,"end":950},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":950},"to":{"change":7,"start":3361,"end":3362},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":3361},"to":{"change":7,"start":3361,"end":3362},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3362},"to":{"change":7,"start":16175,"end":16267},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16175},"to":{"change":7,"start":16175,"end":16267},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16267},"to":{"change":3,"start":44,"end":102},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":3,"pos":102},"to":{"change":7,"start":16336,"end":16433},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":7,"pos":943},"to":{"change":7,"start":16336,"end":16433},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16336},"to":{"change":7,"start":16336,"end":16433},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16433},"to":{"change":7,"start":5843,"end":5922},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":5922},"to":{"change":7,"start":16505,"end":16699},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16505},"to":{"change":7,"start":16505,"end":16699},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16699},"to":{"change":7,"start":3363,"end":3443},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3443},"to":{"change":7,"start":16699,"end":16768},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16699},"to":{"change":7,"start":16699,"end":16768},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16768},"to":{"change":7,"start":951,"end":992},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":992},"to":{"change":7,"start":16819,"end":16888},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16819},"to":{"change":7,"start":16819,"end":16888},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":16888},"to":{"change":7,"start":477,"end":552},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":552},"to":{"change":7,"start":5923,"end":5976},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":5976},"to":{"change":7,"start":993,"end":1066},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1066},"to":{"change":7,"start":17194,"end":17227},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17194},"to":{"change":7,"start":17194,"end":17227},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17227},"to":{"change":7,"start":5977,"end":6042},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6042},"to":{"change":7,"start":17292,"end":17340},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17292},"to":{"change":7,"start":17292,"end":17340},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17340},"to":{"change":7,"start":3444,"end":3469},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3469},"to":{"change":7,"start":17356,"end":17365},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17356},"to":{"change":7,"start":17356,"end":17365},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17365},"to":{"change":7,"start":553,"end":599},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":599},"to":{"change":7,"start":17415,"end":17537},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17415},"to":{"change":7,"start":17415,"end":17537},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17662},"to":{"change":3,"start":103,"end":135},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":3,"pos":135},"to":{"change":7,"start":600,"end":645},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3505},"to":{"change":7,"start":600,"end":645},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17662},"to":{"change":7,"start":600,"end":645},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":645},"to":{"change":6,"start":310,"end":383},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":6,"pos":383},"to":{"change":7,"start":17785,"end":17850},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":7,"pos":714},"to":{"change":7,"start":17785,"end":17850},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3587},"to":{"change":7,"start":17785,"end":17850},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17785},"to":{"change":7,"start":17785,"end":17850},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17850},"to":{"change":7,"start":715,"end":741},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":741},"to":{"change":7,"start":17884,"end":18014},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":17884},"to":{"change":7,"start":17884,"end":18014},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":18014},"to":{"change":7,"start":742,"end":846},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":846},"to":{"change":6,"start":384,"end":451},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":6,"pos":451},"to":{"change":7,"start":18635,"end":18691},"introduced_by":6},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3671},"to":{"change":7,"start":18635,"end":18691},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":18635},"to":{"change":7,"start":18635,"end":18691},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":18691},"to":{"change":7,"start":255555,"end":255561},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255555},"to":{"change":7,"start":255555,"end":255561},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":18803},"to":{"change":7,"start":18803,"end":18805},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":18805},"to":{"change":7,"start":255561,"end":255562},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255561},"to":{"change":7,"start":255561,"end":255562},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255562},"to":{"change":7,"start":1021,"end":1043},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1043},"to":{"change":7,"start":255562,"end":255603},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":18836},"to":{"change":7,"start":255562,"end":255603},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255562},"to":{"change":7,"start":255562,"end":255603},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255603},"to":{"change":7,"start":18837,"end":18859},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":18859},"to":{"change":7,"start":255603,"end":255647},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255603},"to":{"change":7,"start":255603,"end":255647},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255647},"to":{"change":7,"start":6043,"end":6085},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6085},"to":{"change":7,"start":255710,"end":255716},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":18898},"to":{"change":7,"start":255710,"end":255716},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255710},"to":{"change":7,"start":255710,"end":255716},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255716},"to":{"change":7,"start":3672,"end":3776},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3776},"to":{"change":7,"start":6086,"end":6237},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":18991},"to":{"change":7,"start":6086,"end":6237},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6237},"to":{"change":7,"start":19093,"end":19110},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":19093},"to":{"change":7,"start":19093,"end":19110},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":19110},"to":{"change":7,"start":3777,"end":3831},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":3831},"to":{"change":7,"start":19172,"end":19182},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":19172},"to":{"change":7,"start":19172,"end":19182},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":19182},"to":{"change":7,"start":3832,"end":4031},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4031},"to":{"change":7,"start":255935,"end":255991},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":19182},"to":{"change":7,"start":255935,"end":255991},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255935},"to":{"change":7,"start":255935,"end":255991},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":255991},"to":{"change":7,"start":4032,"end":4249},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4249},"to":{"change":7,"start":256162,"end":256222},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":19532},"to":{"change":7,"start":256162,"end":256222},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":256162},"to":{"change":7,"start":256162,"end":256222},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":256222},"to":{"change":7,"start":4250,"end":4392},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4392},"to":{"change":7,"start":256390,"end":256448},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":19818},"to":{"change":7,"start":256390,"end":256448},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":256390},"to":{"change":7,"start":256390,"end":256448},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":256448},"to":{"change":7,"start":4393,"end":4612},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4612},"to":{"change":7,"start":257089,"end":257168},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257089},"to":{"change":7,"start":257089,"end":257168},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257168},"to":{"change":7,"start":20160,"end":20233},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20233},"to":{"change":7,"start":1067,"end":1270},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1270},"to":{"change":7,"start":20361,"end":20372},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20361},"to":{"change":7,"start":20361,"end":20372},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20372},"to":{"change":7,"start":1271,"end":1317},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1317},"to":{"change":7,"start":20431,"end":20505},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20431},"to":{"change":7,"start":20431,"end":20505},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20505},"to":{"change":7,"start":4693,"end":4758},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":4758},"to":{"change":7,"start":20577,"end":20685},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20577},"to":{"change":7,"start":20577,"end":20685},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20685},"to":{"change":7,"start":257322,"end":257480},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257322},"to":{"change":7,"start":257322,"end":257480},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257480},"to":{"change":7,"start":20686,"end":20725},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20725},"to":{"change":7,"start":257505,"end":257679},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257505},"to":{"change":7,"start":257505,"end":257679},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257679},"to":{"change":7,"start":20726,"end":20736},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20736},"to":{"change":7,"start":257691,"end":257793},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":257691},"to":{"change":7,"start":257691,"end":257793},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259051},"to":{"change":7,"start":259051,"end":259089},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259089},"to":{"change":7,"start":20737,"end":20775},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20775},"to":{"change":7,"start":944,"end":963},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":963},"to":{"change":7,"start":259155,"end":259302},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20794},"to":{"change":7,"start":259155,"end":259302},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259155},"to":{"change":7,"start":259155,"end":259302},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259302},"to":{"change":7,"start":20795,"end":20914},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20914},"to":{"change":7,"start":259369,"end":259370},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259369},"to":{"change":7,"start":259369,"end":259370},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259370},"to":{"change":7,"start":20915,"end":20938},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":20938},"to":{"change":7,"start":6844,"end":6877},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6877},"to":{"change":7,"start":259636,"end":259681},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":20961},"to":{"change":7,"start":259636,"end":259681},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259636},"to":{"change":7,"start":259636,"end":259681},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259681},"to":{"change":7,"start":1126,"end":1159},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1159},"to":{"change":7,"start":20962,"end":21038},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":21038},"to":{"change":7,"start":259773,"end":259801},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259773},"to":{"change":7,"start":259773,"end":259801},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":259801},"to":{"change":7,"start":6878,"end":6889},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6889},"to":{"change":7,"start":21056,"end":21057},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21056},"to":{"change":7,"start":21056,"end":21057},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21057},"to":{"change":7,"start":6890,"end":6978},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6978},"to":{"change":7,"start":21139,"end":21140},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260085},"to":{"change":7,"start":21139,"end":21140},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21140},"to":{"change":7,"start":6979,"end":6998},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":6998},"to":{"change":7,"start":21178,"end":21179},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21178},"to":{"change":7,"start":21178,"end":21179},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21179},"to":{"change":7,"start":1318,"end":1357},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1075},"to":{"change":7,"start":1239,"end":1240},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1357},"to":{"change":7,"start":1239,"end":1240},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21211},"to":{"change":7,"start":1239,"end":1240},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1240},"to":{"change":7,"start":21212,"end":21341},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7004},"to":{"change":7,"start":21212,"end":21341},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21212},"to":{"change":7,"start":21212,"end":21341},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":21341},"to":{"change":7,"start":260085,"end":260131},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260085},"to":{"change":7,"start":260085,"end":260131},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260131},"to":{"change":7,"start":21342,"end":21505},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21505},"to":{"change":7,"start":1076,"end":1172},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1172},"to":{"change":7,"start":7005,"end":7044},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21601},"to":{"change":7,"start":7005,"end":7044},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":7044},"to":{"change":7,"start":1173,"end":1297},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1297},"to":{"change":7,"start":21715,"end":22008},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7166},"to":{"change":7,"start":21715,"end":22008},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":21715},"to":{"change":7,"start":21715,"end":22008},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22008},"to":{"change":7,"start":747,"end":838},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":838},"to":{"change":7,"start":260245,"end":260251},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":22107},"to":{"change":7,"start":260245,"end":260251},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260245},"to":{"change":7,"start":260245,"end":260251},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260251},"to":{"change":7,"start":22108,"end":22109},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22109},"to":{"change":7,"start":1241,"end":1392},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":792},"to":{"change":7,"start":7264,"end":7310},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1392},"to":{"change":7,"start":7264,"end":7310},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":7264},"to":{"change":7,"start":7264,"end":7310},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7310},"to":{"change":7,"start":22306,"end":22344},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22306},"to":{"change":7,"start":22306,"end":22344},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22344},"to":{"change":7,"start":793,"end":830},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":830},"to":{"change":7,"start":7311,"end":7372},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22386},"to":{"change":7,"start":7311,"end":7372},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7372},"to":{"change":7,"start":22445,"end":22460},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22445},"to":{"change":7,"start":22445,"end":22460},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":22460},"to":{"change":7,"start":260251,"end":260252},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260251},"to":{"change":7,"start":260251,"end":260252},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260252},"to":{"change":7,"start":1393,"end":1475},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":911},"to":{"change":7,"start":22818,"end":22819},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1475},"to":{"change":7,"start":22818,"end":22819},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7525},"to":{"change":7,"start":22818,"end":22819},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22818},"to":{"change":7,"start":22818,"end":22819},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22819},"to":{"change":7,"start":912,"end":943},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":943},"to":{"change":7,"start":7526,"end":7579},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22856},"to":{"change":7,"start":7526,"end":7579},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7579},"to":{"change":7,"start":22856,"end":23019},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":22856},"to":{"change":7,"start":22856,"end":23019},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23019},"to":{"change":7,"start":260547,"end":260557},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260547},"to":{"change":7,"start":260547,"end":260557},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260557},"to":{"change":7,"start":23020,"end":23030},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23030},"to":{"change":7,"start":260557,"end":260564},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260557},"to":{"change":7,"start":260557,"end":260564},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260564},"to":{"change":7,"start":23031,"end":23114},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23114},"to":{"change":7,"start":260653,"end":260840},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260653},"to":{"change":7,"start":260653,"end":260840},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":260840},"to":{"change":7,"start":23115,"end":23116},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23116},"to":{"change":7,"start":944,"end":1027},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1027},"to":{"change":7,"start":23182,"end":23231},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23182},"to":{"change":7,"start":23182,"end":23231},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23231},"to":{"change":7,"start":261029,"end":261043},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261029},"to":{"change":7,"start":261029,"end":261043},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261043},"to":{"change":7,"start":23232,"end":23233},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23233},"to":{"change":7,"start":261043,"end":261102},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261043},"to":{"change":7,"start":261043,"end":261102},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261102},"to":{"change":7,"start":23234,"end":23263},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23263},"to":{"change":7,"start":261102,"end":261112},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261102},"to":{"change":7,"start":261102,"end":261112},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261112},"to":{"change":7,"start":23264,"end":23320},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":23320},"to":{"change":7,"start":261112,"end":261133},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261112},"to":{"change":7,"start":261112,"end":261133},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261133},"to":{"change":7,"start":23321,"end":23322},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23322},"to":{"change":7,"start":1028,"end":1129},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1129},"to":{"change":7,"start":23416,"end":23541},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23416},"to":{"change":7,"start":23416,"end":23541},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23541},"to":{"change":7,"start":1130,"end":1220},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1220},"to":{"change":7,"start":23626,"end":23734},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23626},"to":{"change":7,"start":23626,"end":23734},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23734},"to":{"change":7,"start":1221,"end":1311},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1311},"to":{"change":7,"start":23810,"end":23964},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7665},"to":{"change":7,"start":23810,"end":23964},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23810},"to":{"change":7,"start":23810,"end":23964},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":23964},"to":{"change":7,"start":7666,"end":7741},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7741},"to":{"change":7,"start":24030,"end":24080},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24030},"to":{"change":7,"start":24030,"end":24080},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24080},"to":{"change":7,"start":1312,"end":1390},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1390},"to":{"change":7,"start":24162,"end":24236},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7815},"to":{"change":7,"start":24162,"end":24236},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24162},"to":{"change":7,"start":24162,"end":24236},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24236},"to":{"change":7,"start":1391,"end":1473},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1473},"to":{"change":7,"start":24322,"end":24437},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7893},"to":{"change":7,"start":24322,"end":24437},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24322},"to":{"change":7,"start":24322,"end":24437},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24437},"to":{"change":7,"start":1298,"end":1386},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1386},"to":{"change":7,"start":24529,"end":24628},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1569},"to":{"change":7,"start":24529,"end":24628},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":7984},"to":{"change":7,"start":24529,"end":24628},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24529},"to":{"change":7,"start":24529,"end":24628},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":24628},"to":{"change":7,"start":261135,"end":261136},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261135},"to":{"change":7,"start":261135,"end":261136},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261136},"to":{"change":7,"start":24629,"end":24659},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":24659},"to":{"change":7,"start":261188,"end":261189},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261188},"to":{"change":7,"start":261188,"end":261189},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261189},"to":{"change":7,"start":24660,"end":24747},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":24747},"to":{"change":7,"start":261219,"end":261220},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261219},"to":{"change":7,"start":261219,"end":261220},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261220},"to":{"change":7,"start":24748,"end":24798},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24798},"to":{"change":7,"start":7985,"end":8081},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":8081},"to":{"change":7,"start":1476,"end":1493},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1493},"to":{"change":7,"start":24878,"end":24951},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1586},"to":{"change":7,"start":24878,"end":24951},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8081},"to":{"change":7,"start":24878,"end":24951},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24878},"to":{"change":7,"start":24878,"end":24951},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24951},"to":{"change":7,"start":1587,"end":1624},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1624},"to":{"change":7,"start":24993,"end":25068},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":24993},"to":{"change":7,"start":24993,"end":25068},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25068},"to":{"change":7,"start":8082,"end":8144},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8144},"to":{"change":7,"start":25124,"end":25180},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25124},"to":{"change":7,"start":25124,"end":25180},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25180},"to":{"change":7,"start":1625,"end":1680},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1680},"to":{"change":7,"start":8183,"end":8221},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25473},"to":{"change":7,"start":8183,"end":8221},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8221},"to":{"change":7,"start":25473,"end":25484},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25473},"to":{"change":7,"start":25473,"end":25484},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25484},"to":{"change":7,"start":1681,"end":1771},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1771},"to":{"change":7,"start":25560,"end":25622},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8307},"to":{"change":7,"start":25560,"end":25622},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25560},"to":{"change":7,"start":25560,"end":25622},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25622},"to":{"change":7,"start":8308,"end":8397},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8397},"to":{"change":7,"start":25734,"end":25870},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":25734},"to":{"change":7,"start":25734,"end":25870},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":25870},"to":{"change":7,"start":261299,"end":261353},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261299},"to":{"change":7,"start":261299,"end":261353},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261353},"to":{"change":7,"start":1387,"end":1410},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1410},"to":{"change":7,"start":1178,"end":1203},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261353},"to":{"change":7,"start":1178,"end":1203},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":1203},"to":{"change":7,"start":25871,"end":25900},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":25900},"to":{"change":7,"start":261420,"end":261453},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261420},"to":{"change":7,"start":261420,"end":261453},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261453},"to":{"change":7,"start":1411,"end":1497},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1497},"to":{"change":7,"start":261558,"end":261627},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261558},"to":{"change":7,"start":261558,"end":261627},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1567},"to":{"change":7,"start":261627,"end":261715},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261627},"to":{"change":7,"start":261627,"end":261715},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261825},"to":{"change":7,"start":261825,"end":261856},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261856},"to":{"change":7,"start":25901,"end":25955},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":25955},"to":{"change":7,"start":261932,"end":262053},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":261932},"to":{"change":7,"start":261932,"end":262053},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262053},"to":{"change":3,"start":136,"end":137},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":3,"pos":137},"to":{"change":7,"start":25956,"end":26025},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1573},"to":{"change":7,"start":25956,"end":26025},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262054},"to":{"change":7,"start":25956,"end":26025},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":26025},"to":{"change":3,"start":138,"end":172},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":3,"pos":172},"to":{"change":7,"start":26059,"end":26101},"introduced_by":3},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1606},"to":{"change":7,"start":26059,"end":26101},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":26059},"to":{"change":7,"start":26059,"end":26101},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":26101},"to":{"change":7,"start":26101,"end":26129},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":26129},"to":{"change":7,"start":26129,"end":26135},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":26135},"to":{"change":7,"start":26135,"end":26136},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":26136},"to":{"change":7,"start":262288,"end":262356},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262288},"to":{"change":7,"start":262288,"end":262356},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262356},"to":{"change":7,"start":1607,"end":1652},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":1652},"to":{"change":7,"start":8462,"end":8534},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":8462},"to":{"change":7,"start":8462,"end":8534},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":8534},"to":{"change":7,"start":262431,"end":262481},"introduced_by":7},{"previous":"","flag":"DELETED","from":{"change":7,"pos":26209},"to":{"change":7,"start":262431,"end":262481},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262431},"to":{"change":7,"start":262431,"end":262481},"introduced_by":7},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":7,"pos":262481},"to":{"change":3,"start":173,"end":175},"introduced_by":3}],"inode":{"change":7,"pos":241245}}},"contents":[{"Del":"\n"},{"Del":"impl Seekable {\n"},{"Del":" pub fn init(source: R, size: Option) -> Result {\n"},{"Del":" let mut seekable = Self::make_seekable(source, size)?;\n"},{"Del":" seekable.init_advanced()?;\n Ok(seekable)\n }\n\n"},{"Del":" // The parameter size is the size of a buffer. So if the source is not one, the size is None.\n"},{"Del":" fn make_seekable(source: R, size: Option) -> Result {\n let dstream = unsafe { ZSTD_createDStream() };\n if dstream.is_null() {\n return Err(Error::Null);\n }\n Ok(Seekable {\n"},{"Del":" dstream,\n seek_table: SeekTable {\n entries: Vec::new(),\n checksum_flag: 1,\n },\n src: source,\n"},{"Del":" inner_buf_size: size,\n"},{"Del":" decompressed_offset: 0,\n cur_frame: 0,\n in_buff: [0; SEEKABLE_BUFF_SIZE],\n out_buff: [0; SEEKABLE_BUFF_SIZE],\n"},{"Del":" xxh_state: Hash64::with_seed(0),\n"},{"Del":" })\n"},{"Del":" }\n"},{"Del":"\n fn load_seek_table(&mut self) -> Result<(), Error> {\n"},{"Del":" // Help the compiler to see it's inbounds\n assert!(self.in_buff.len() == SEEKABLE_BUFF_SIZE);\n\n"},{"Del":" self.src\n"},{"Del":" .seek(io::SeekFrom::End(-(SEEK_TABLE_FOOTER_SIZE as i64)))?;\n"},{"Del":"\n"},{"Del":" let mut handle = (&mut self.src).take(SEEK_TABLE_FOOTER_SIZE as u64);\n"},{"Del":" handle.read(&mut self.in_buff)?;\n"},{"Del":"\n"},{"Del":" let prefix = slice_to_num(&self.in_buff[5..9])?;\n if prefix != SEEKABLE_MAGIC_NUMBER {\n return Err(Error::PrefixUnknown(prefix));\n"},{"Del":" }\n\n"},{"Del":" let sfd = self.in_buff[4];\n let checksum_flag = (sfd >> 7) as usize;\n\n if ((sfd >> 2) & 0x1f) != 0 {\n"},{"Del":" return Err(Error::Corruption(\"when looking the checksum flag\"));\n"},{"Del":" }\n"},{"Del":"\n let num_frames = slice_to_num(&self.in_buff[..4])? as usize;\n let size_p_entry: usize = 8 + if checksum_flag != 0 { 4 } else { 0 };\n let table_size = size_p_entry * num_frames;\n let frame_size = table_size + SEEK_TABLE_FOOTER_SIZE + SKIPPABLE_HEADER_SIZE;\n"},{"Del":"\n"},{"Del":" let mut remaining = frame_size as usize - SEEK_TABLE_FOOTER_SIZE;\n let to_read = cmp::min(remaining, SEEKABLE_BUFF_SIZE);\n\n"},{"Del":" self.src.seek(io::SeekFrom::End(-(frame_size as i64)))?;\n"},{"Del":"\n"},{"Del":" handle = (&mut self.src).take(to_read as u64);\n"},{"Del":" handle.read(&mut self.in_buff)?;\n\n"},{"Del":" remaining -= to_read;\n\n"},{"Del":" let mut prefix = slice_to_num(&self.in_buff[..4])?;\n if prefix != (MAGIC_SKIPPABLE_START | 0xE) {\n return Err(Error::PrefixUnknown(prefix));\n"},{"Del":" }\n"},{"Del":"\n prefix = slice_to_num(&self.in_buff[4..8])?;\n if prefix as usize + SKIPPABLE_HEADER_SIZE != frame_size {\n return Err(Error::PrefixUnknown(prefix));\n"},{"Del":" }\n\n let mut entries: Vec = Vec::with_capacity((num_frames + 1) as usize);\n"},{"Del":" let mut pos = 0usize;\n"},{"Del":" let (mut c_offset, mut d_offset) = (0, 0);\n"},{"Del":"\n"},{"Del":" for idx in 0..num_frames {\n"},{"Del":" if pos + size_p_entry > SEEKABLE_BUFF_SIZE {\n"},{"Del":" let offset = SEEKABLE_BUFF_SIZE - pos;\n"},{"Del":" let to_read = cmp::min(remaining, SEEKABLE_BUFF_SIZE - offset);\n\n"},{"Del":" self.in_buff.copy_within(offset..offset + to_read, pos);\n"},{"Del":"\n"},{"Del":" handle = (&mut self.src).take(to_read as u64);\n"},{"Del":" handle.read(&mut self.in_buff[offset..offset + to_read])?;\n"},{"Del":" remaining -= to_read;\n pos = 0;\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" entries.push(SeekEntry {\n c_offset,\n d_offset,\n checksum: 0,\n });\n"},{"Del":"\n"},{"Del":" c_offset += slice_to_num(&self.in_buff[pos..pos + 4])? as u64;\n"},{"Del":" pos += 4;\n"},{"Del":" d_offset += slice_to_num(&self.in_buff[pos..pos + 4])? as u64;\n"},{"Del":" pos += 4;\n\n if checksum_flag != 0 {\n"},{"Del":" entries[idx].checksum = slice_to_num(&self.in_buff[pos..pos + 4])?;\n"},{"Del":" pos += 4;\n"},{"Del":" }\n"},{"Del":" }\n"},{"Del":" entries.push(SeekEntry {\n c_offset,\n d_offset,\n checksum: 0,\n });\n\n"},{"Del":" self.seek_table.entries = entries;\n"},{"Del":" self.seek_table.checksum_flag = checksum_flag as u32;\n"},{"Del":"\n Ok(())\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" fn init_advanced(&mut self) -> Result<(), Error> {\n self.load_seek_table()?;\n\n self.decompressed_offset = u64::MAX;\n self.cur_frame = u32::MAX;\n\n"},{"Del":" unsafe {\n let dstream_init = ZSTD_initDStream(self.dstream);\n if ZSTD_isError(dstream_init) != 0 {\n"},{"Del":" Err(Error::ZSTD(dstream_init))\n"},{"Del":" } else {\n Ok(())\n }\n"},{"Del":" }\n }\n\n"},{"Del":" /// Decompress a single frame. This method internally calls\n /// `decompress`, and `dest` must be exactly the size of the\n /// uncompressed frame.\n"},{"Del":" pub fn decompress_frame(&mut self, dest: &mut [u8], index: usize) -> Result {\n let dec_size = self.get_frame_decompressed_size(index)?;\n\n"},{"Del":" if (dest.len() as u64) < dec_size {\n Err(Error::DSizeTooSmall(dest.len() as u64, dec_size))\n"},{"Del":" } else {\n"},{"Del":" self.decompress(dest, self.seek_table.entries[index].d_offset)\n"},{"Del":" }\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" /// Decompress starting from an offset. The length of `out` must\n"},{"Del":" /// be at least the size of the decompressed output.\n"},{"Del":" ///\n /// This function finds the correct frame to start with, and takes\n /// care of decompressing multiple frames in a row.\n"},{"Del":" pub fn decompress(&mut self, out: &mut [u8], offset: u64) -> Result {\n"},{"Del":" let eos = self.seek_table.entries.last().unwrap().d_offset;\n"},{"Del":" let len = out.len() as u64;\n"},{"Del":" let len = if offset + len > eos {\n eos - offset\n } else {\n len\n };\n\n"},{"Del":" let mut tgt_frame = self.seekable_offset_to_frame_index(offset);\n"},{"Del":" let mut no_output_progress_c = 0u32;\n let mut src_bytes_read = 0usize;\n"},{"Del":"\n let mut inn = ZSTD_inBuffer {\n src: ptr::null() as *const c_void,\n size: 0,\n pos: 0,\n };\n"},{"Del":"\n loop {\n if tgt_frame as usize != self.cur_frame as usize || offset != self.decompressed_offset {\n"},{"Del":" self.decompressed_offset = self.seek_table.entries[tgt_frame].d_offset;\n"},{"Del":" self.cur_frame = tgt_frame as u32;\n\n self.src.seek(io::SeekFrom::Start(\n"},{"Del":" self.seek_table.entries[tgt_frame].c_offset,\n"},{"Del":" ))?;\n"},{"Del":"\n"},{"Del":" inn.src = self.in_buff.as_ptr() as *const _ as *const c_void;\n"},{"Del":"\n"},{"Del":" self.xxh_state = Hash64::with_seed(0);\n"},{"Del":"\n unsafe {\n let r = ZSTD_DCtx_reset(self.dstream, ZSTD_reset_session_only);\n if ZSTD_isError(r) != 0 {\n return Err(Error::ZSTD(r));\n }\n }\n\n if let Some(size) = &self.inner_buf_size {\n if src_bytes_read > *size {\n return Err(Error::SeekableIo);\n }\n }\n"},{"Del":" }\n"},{"Del":"\n while self.decompressed_offset < offset + len as u64 {\n"},{"Del":" // here slice_tmp is a [u8] helper so we avoid using unsafe pointer arithmetic later on\n let (mut out_tmp, slice_tmp) = if self.decompressed_offset < offset {\n"},{"Del":" (\n ZSTD_outBuffer {\n dst: self.out_buff.as_mut_ptr() as *mut c_void,\n size: cmp::min(\n SEEKABLE_BUFF_SIZE,\n (offset - self.decompressed_offset) as size_t,\n ),\n pos: 0,\n },\n (&self.out_buff).as_ref(),\n )\n"},{"Del":" } else {\n"},{"Del":" (\n ZSTD_outBuffer {\n dst: out.as_mut_ptr() as *mut c_void,\n"},{"Del":" size: len as usize,\n"},{"Del":" pos: (self.decompressed_offset - offset) as size_t,\n },\n &*out,\n )\n"},{"Del":" };\n\n"},{"Del":" let (prev_out_pos, prev_in_pos) = (out_tmp.pos, inn.pos);\n"},{"Del":" let mut to_read;\n\n unsafe {\n"},{"Del":" to_read = ZSTD_decompressStream(self.dstream, &mut out_tmp, &mut inn);\n"},{"Del":"\n if ZSTD_isError(to_read) != 0 {\n return Err(Error::ZSTD(to_read));\n }\n };\n"},{"Del":"\n if self.seek_table.checksum_flag != 0 {\n"},{"Del":" self.xxh_state.write(\n &slice_tmp[prev_out_pos..prev_out_pos + (out_tmp.pos - prev_out_pos)],\n );\n"},{"Del":" }\n\n"},{"Del":" let forward_progress = (out_tmp.pos - prev_out_pos) as u64;\n\n if forward_progress == 0 {\n no_output_progress_c += 1;\n if no_output_progress_c > SEEKABLE_NO_OUTPUT_PROGRESS_MAX {\n return Err(Error::SeekableIo);\n }\n } else {\n no_output_progress_c = 0;\n }\n self.decompressed_offset += forward_progress;\n"},{"Del":" src_bytes_read += inn.pos - prev_in_pos;\n"},{"Del":"\n"},{"Del":" if to_read == 0 {\n if self.seek_table.checksum_flag != 0\n"},{"Del":" && self.xxh_state.finish() as u32\n"},{"Del":" != self.seek_table.entries[tgt_frame].checksum\n {\n"},{"Del":" return Err(Error::Corruption(\"during decompression\"));\n"},{"Del":" }\n\n if self.decompressed_offset < offset + len as u64 {\n tgt_frame = self.seekable_offset_to_frame_index(self.decompressed_offset);\n"},{"Del":" // assert!(tgt_frame != self.seek_table.entries.len());\n"},{"Del":" }\n\n break;\n }\n\n"},{"Del":" if inn.pos == inn.size {\n"},{"Del":" to_read = cmp::min(to_read, SEEKABLE_BUFF_SIZE);\n"},{"Del":" let mut handle = (&mut self.src).take(to_read as u64);\n"},{"Del":" handle.read(&mut self.in_buff)?;\n"},{"Del":" inn.size = to_read;\n inn.pos = 0;\n"},{"Del":" }\n }\n\n"},{"Del":" if self.decompressed_offset == offset + len as u64 {\n"},{"Del":" break;\n }\n }\n\n"},{"Del":" Ok(len as usize)\n"},{"Del":" }\n}\n\n"},{"Del":"impl<'a> Seekable> {\n"},{"Del":" /// Initialise a decompressor with an input buffer.\n pub fn init_buf(input: &'a mut [u8]) -> Result {\n"},{"Del":" let size = input.len();\n"},{"Del":" let source = io::Cursor::new(input);\n"},{"Del":" let mut seekable = Seekable::make_seekable(source, Some(size))?;\n"},{"Del":" seekable.init_advanced()?;\n Ok(seekable)\n }\n}\n\n"},{"Del":"impl Seekable {\n"},{"Del":" /// Initialise a decompressor with a file. This method opens the file, and dropping the resulting `Seekable` closes the file.\n"},{"Del":" pub fn init_file(name: &str) -> Result {\n let source = fs::File::create(name)?;\n"},{"Del":" let mut seekable = Seekable::make_seekable(source, None)?;\n"},{"Del":" seekable.init_advanced()?;\n Ok(seekable)\n"},{"Del":" }\n"},{"Del":"}\n"},{"Del":"\n"},{"Del":"impl Seekable {\n"},{"Del":" /// Number of frames in the message.\n"},{"Del":" #[inline(always)]\n"},{"Del":" pub fn get_num_frames(&self) -> usize {\n"},{"Del":" self.seek_table.entries.len() - 1\n"},{"Del":" }\n"},{"Del":"\n #[inline(always)]\n fn get_frame(&'_ self, frame_index: usize) -> Result<&'_ SeekEntry, Error> {\n"},{"Del":" let max_frames = self.get_num_frames();\n if frame_index >= max_frames {\n Err(Error::FIndexTooLarge(frame_index, max_frames))\n"},{"Del":" } else {\n"},{"Del":" Ok(&self.seek_table.entries[frame_index])\n"},{"Del":" }\n"},{"Del":" }\n\n /// Offset of the frame in the compressed data.\n pub fn get_frame_compressed_offset(&self, frame_index: usize) -> Result {\n Ok(self.get_frame(frame_index)?.c_offset)\n"},{"Del":" }\n /// Size of the frame in the compressed data.\n"},{"Del":" pub fn get_frame_compressed_size(&self, frame_index: usize) -> Result {\n let entry = self.get_frame(frame_index)?;\n Ok(self.seek_table.entries[frame_index + 1].c_offset - entry.c_offset)\n"},{"Del":" }\n /// Offset of the frame in the decompressed data.\n"},{"Del":" pub fn get_frame_decompressed_offset(&self, frame_index: usize) -> Result {\n Ok(self.get_frame(frame_index)?.d_offset)\n"},{"Del":" }\n /// Size of the frame in the decompressed data.\n"},{"Del":" pub fn get_frame_decompressed_size(&self, frame_index: usize) -> Result {\n let entry = self.get_frame(frame_index)?;\n Ok(self.seek_table.entries[frame_index + 1].d_offset - entry.d_offset)\n"},{"Del":" }\n /// Perform a binary search to find the frame containing the offset.\n"},{"Del":" pub fn seekable_offset_to_frame_index(&self, offset: u64) -> usize {\n"},{"Del":" let n_frames = self.get_num_frames();\n\n assert!(self.seek_table.entries.len() >= n_frames);\n\n if offset >= self.seek_table.entries[n_frames].d_offset {\n return n_frames;\n"},{"Del":" }\n\n"},{"Del":" let (mut lo, mut hi) = (0, n_frames);\n"},{"Del":"\n while lo + 1 < hi {\n let mid = lo + ((hi - lo) >> 1);\n"},{"Del":" if self.seek_table.entries[mid].d_offset <= offset {\n"},{"Del":" lo = mid\n } else {\n hi = mid;\n }\n }\n\n lo\n"},{"Del":" }\n}\n\npub trait Dst: Send {\n fn as_mut_ptr(&mut self) -> *mut u8;\n fn as_slice(&self) -> &[u8];\n fn len(&self) -> usize;\n fn new() -> Self;\n}\n\n"},{"Del":"impl Dst for [u8; N] {\n"},{"Del":" fn as_mut_ptr(&mut self) -> *mut u8 {\n self.as_mut().as_mut_ptr()\n }\n fn as_slice(&self) -> &[u8] {\n self.as_ref()\n }\n fn len(&self) -> usize {\n"},{"Del":" N\n"},{"Del":" }\n fn new() -> Self {\n unsafe { std::mem::MaybeUninit::uninit().assume_init() }\n }\n}\n"},{"Del":"\npub struct CompressedFrame {\n"},{"Del":" src_size: u32,\n dst_size: u32,\n"},{"Del":" checksum: u32,\n"},{"Del":" dst: D,\n}\n\nimpl CompressedFrame {\n fn as_slice(&self) -> &[u8] {\n &self.dst.as_slice()[..self.dst_size as usize]\n }\n}\n\n"},{"Del":"fn compress_frame(src: &[u8], level: usize) -> Result, Error> {\n let mut dst = D::new();\n"},{"Del":"\n"},{"Del":" let ret = unsafe {\n"},{"Del":" let ret = ZSTD_compress(\n"},{"Del":" dst.as_mut_ptr() as *mut c_void,\n"},{"Del":" dst.len() as size_t,\n"},{"Del":" src.as_ptr() as *const c_void,\n src.len() as size_t,\n"},{"Del":" level as c_int,\n"},{"Del":" );\n"},{"Del":"\n"},{"Del":" if ZSTD_isError(ret) != 0 {\n return Err(Error::ZSTD(ret));\n }\n"},{"Del":"\n"},{"Del":" ret\n };\n"},{"Del":"\n"},{"Del":" let checksum = hash64(src) as u32;\n"},{"Del":"\n"},{"Del":" Ok(CompressedFrame {\n src_size: src.len() as u32,\n dst_size: ret as u32,\n checksum,\n dst,\n })\n"},{"Del":"}\n\nimpl FrameLog {\n pub fn new() -> Self {\n"},{"Del":" FrameLog {\n entries: Vec::new(),\n checksum_flag: 1,\n seek_table_pos: 0,\n seek_table_index: 0,\n }\n }\n\n"},{"Del":" pub fn log_frame(&mut self, c_size: u32, d_size: u32, checksum: u32) -> Result<(), Error> {\n"},{"Del":" let size = self.entries.len();\n"},{"Del":" if size == SEEKABLE_MAX_FRAMES {\n return Err(Error::FIndexTooLarge(size, SEEKABLE_MAX_FRAMES as usize));\n"},{"Del":" }\n\n self.entries.push(FrameLogEntry {\n c_size,\n d_size,\n checksum,\n });\n\n Ok(())\n }\n\n #[inline(always)]\n pub fn seek_table_size(&self) -> usize {\n let size_p_frame = 8 + if self.checksum_flag != 0 { 4 } else { 0 };\n"},{"Del":" SKIPPABLE_HEADER_SIZE + size_p_frame * self.entries.len() + SEEK_TABLE_FOOTER_SIZE\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" pub fn stwrite32(\n &mut self,\n output: &mut [u8],\n value: u32,\n offset: u32,\n pos: &mut usize,\n ) -> usize {\n"},{"Del":" if self.seek_table_pos < offset + 4 {\n"},{"Del":" let len_write = cmp::min(\n"},{"Del":" output.len() - *pos,\n"},{"Del":" (offset + 4 - self.seek_table_pos) as usize,\n"},{"Del":" );\n"},{"Del":"\n"},{"Del":" output[*pos..*pos + len_write].copy_from_slice(&value.to_ne_bytes());\n"},{"Del":"\n"},{"Del":" *pos += len_write;\n"},{"Del":" self.seek_table_pos += len_write as u32;\n"},{"Del":"\n return if len_write < 4 {\n self.seek_table_size() - self.seek_table_pos as usize\n } else {\n 0\n };\n"},{"Del":" }\n"},{"Del":" 0\n"},{"Del":" }\n\n"},{"Del":" pub fn write_all(&mut self, mut w: W) -> Result<(), io::Error> {\n"},{"Del":" let mut output = [0; 1024];\n let mut output_ = ZSTD_outBuffer {\n dst: output.as_mut_ptr() as *mut c_void,\n size: 1024,\n pos: 0,\n };\n"},{"Del":"\n"},{"Del":" while let Ok(ret) = self.write_seek_table(&mut output, &mut output_.pos) {\n"},{"Del":" if ret == 0 {\n break;\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" w.write_all(&output[..output_.pos as usize])?;\n"},{"Del":" output_.pos = 0;\n"},{"Del":" }\n"},{"Del":"\n w.write_all(&output[..output_.pos as usize])?;\n"},{"Del":" Ok(())\n }\n"},{"Del":"\n"},{"Del":" pub fn write_seek_table(&mut self, output: &mut [u8], pos: &mut usize) -> Result {\n"},{"Del":" let size_p_frame = 8 + if self.checksum_flag != 0 { 4 } else { 0 };\n let table_len = self.seek_table_size();\n\n"},{"Del":" let mut ret: usize = self.stwrite32(output, MAGIC_SKIPPABLE_START | 0xE, 0, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n\n // assert!(table_len <= usize::MAX);\n\n"},{"Del":" ret = self.stwrite32(output, (table_len - SKIPPABLE_HEADER_SIZE) as u32, 4, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n\n let mut i = self.seek_table_index as usize;\n\n while i < self.entries.len() {\n"},{"Del":" let start = (SKIPPABLE_HEADER_SIZE + size_p_frame * i) as u32;\n"},{"Del":" // assert!(start + 8 <= usize::MAX);\n\n"},{"Del":" ret = self.stwrite32(output, self.entries[i].c_size, start, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n\n"},{"Del":" ret = self.stwrite32(output, self.entries[i].d_size, start + 4, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n\n if self.checksum_flag != 0 {\n"},{"Del":" ret = self.stwrite32(output, self.entries[i].checksum, start + 8, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n }\n"},{"Del":"\n"},{"Del":" i += 1;\n }\n"},{"Del":"\n"},{"Del":" self.seek_table_index = i as u32;\n // assert!(table_len <= usize::MAX);\n"},{"Del":"\n"},{"Del":" ret = self.stwrite32(\n output,\n"},{"Del":" self.entries.len() as u32,\n (table_len - SEEK_TABLE_FOOTER_SIZE) as u32,\n"},{"Del":" pos,\n"},{"Del":" );\n if ret != 0 {\n return Ok(ret);\n };\n\n"},{"Del":" if output.len() - *pos < 1 {\n"},{"Del":" return Ok(table_len - self.seek_table_pos as usize);\n }\n"},{"Del":" if (self.seek_table_pos as usize) < (table_len - 4) {\n"},{"Del":" let sfd = (self.checksum_flag << 7) as u8;\n\n"},{"Del":" output[*pos] = sfd;\n *pos += 1;\n"},{"Del":" self.seek_table_pos += 1;\n"},{"Del":" }\n\n"},{"Del":" ret = self.stwrite32(output, SEEKABLE_MAGIC_NUMBER, (table_len - 4) as u32, pos);\n"},{"Del":" if ret != 0 {\n return Ok(ret);\n };\n\n"},{"Del":" if (self.seek_table_pos as usize) != table_len {\n Err(Error::Generic)\n"},{"Del":" } else {\n Ok(0)\n }\n }\n}\n\npub fn parallel_compress(\n src: &'static [u8],\n"},{"Del":" mut output: W,\n level: usize,\n jobs: usize,\n"},{"Del":" chunk_size: usize,\n"},{"Del":") -> Result<(), Error> {\n"},{"Del":" use sync::mpsc::channel;\n"},{"Del":" use threadpool::ThreadPool;\n\n"},{"Del":" let n = src.len() / chunk_size + if src.len() % chunk_size == 0 { 0 } else { 1 };\n"},{"Del":" let pool = ThreadPool::new(jobs);\n\n let (tx, rx) = channel();\n"},{"Del":" for (i, chunk) in src.chunks(chunk_size).enumerate() {\n let tx = tx.clone();\n"},{"Del":" pool.execute(move || {\n"},{"Del":" let frame = compress_frame(chunk, level);\n"},{"Del":" tx.send((i, frame))\n .expect(\"channel will be there waiting for the pool\");\n });\n }\n"},{"Del":"\n"},{"Del":" let mut frames: Vec> = Vec::with_capacity(n);\n"},{"Del":" unsafe { frames.set_len(n) };\n"},{"Del":" for (i, frame) in rx.iter().take(n) {\n"},{"Del":" frames[i] = frame?;\n"},{"Del":" }\n"},{"Del":"\n"},{"Del":" let mut log = FrameLog::new();\n for frame in frames.iter() {\n"},{"Del":" output.write_all(frame.as_slice())?;\n"},{"Del":" log.log_frame(frame.dst_size, frame.src_size, frame.checksum)?;\n"},{"Del":" }\n log.write_all(&mut output)?;\n Ok(())\n"},{"Del":"}\n"}]}},{"FileAdd":{"meta":{"basename":"decompress","metadata":576},"context":[{"change":7,"pos":241235}],"contents":[]}},{"FileAdd":{"meta":{"basename":"mod.rs","metadata":0},"context":[{"change":0,"pos":640}],"contents":[{"Add":"use crate::bindings::*;"},{"Add":"use crate::{"},{"Add":" Error, ZSTD_DStream, ZSTD_reset_session_only, BLOCK_SIZE_MAX, MAGIC_SKIPPABLE_START,"},{"Add":" SEEKABLE_MAGIC_NUMBER, SEEK_TABLE_FOOTER_SIZE, SKIPPABLE_HEADER_SIZE,"},{"Add":"};"},{"Add":"use libc::*;"},{"Add":"use std::hash::Hasher;"},{"Add":"use std::io::Read;"},{"Add":"use twox_hash::xxh3::Hash64;"},{"Add":""},{"Add":"const SEEKABLE_BUFF_SIZE: usize = BLOCK_SIZE_MAX;"},{"Add":"const SEEKABLE_NO_OUTPUT_PROGRESS_MAX: u32 = 16;"},{"Add":""},{"Add":"#[inline(always)]"},{"Add":"fn slice_to_num(buff: &[u8]) -> Result {"},{"Add":" let mut b = [0; 4];"},{"Add":" b.clone_from_slice(buff);"},{"Add":" Ok(u32::from_ne_bytes(b))"},{"Add":"}"},{"Add":""},{"Add":"/// The type of decompressors."},{"Add":"pub struct Seekable {"},{"Add":" dstream: *mut ZSTD_DStream,"},{"Add":" seek_table: SeekTable,"},{"Add":" src: R,"},{"Add":" inner_buf_size: Option,"},{"Add":" decompressed_offset: u64,"},{"Add":" cur_frame: u32,"},{"Add":" in_buff: [u8; SEEKABLE_BUFF_SIZE],"},{"Add":" out_buff: [u8; SEEKABLE_BUFF_SIZE],"},{"Add":" xxh_state: Hash64,"},{"Add":"}"},{"Add":""},{"Add":"unsafe impl Send for Seekable {}"},{"Add":""},{"Add":"impl Drop for Seekable {"},{"Add":" fn drop(&mut self) {"},{"Add":" if !self.dstream.is_null() {"},{"Add":" unsafe {"},{"Add":" ZSTD_freeDStream(self.dstream);"},{"Add":" self.dstream = std::ptr::null_mut();"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"struct SeekEntry {"},{"Add":" c_offset: u64,"},{"Add":" d_offset: u64,"},{"Add":" checksum: u32,"},{"Add":"}"},{"Add":""},{"Add":"struct SeekTable {"},{"Add":" entries: Vec,"},{"Add":" checksum_flag: u32,"},{"Add":"}"},{"Add":""},{"Add":"impl SeekTable {"},{"Add":" fn new() -> Self {"},{"Add":" SeekTable {"},{"Add":" entries: Vec::new(),"},{"Add":" checksum_flag: 1,"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl Seekable {"},{"Add":" pub fn init(source: R, size: Option) -> Result {"},{"Add":" let mut seekable = Self::make_seekable(source, size)?;"},{"Add":" seekable.init_advanced()?;"},{"Add":" Ok(seekable)"},{"Add":" }"},{"Add":""},{"Add":" // The parameter size is the size of a buffer. So if the source is not one, the size is None."},{"Add":" fn make_seekable(source: R, size: Option) -> Result {"},{"Add":" let dstream = unsafe { ZSTD_createDStream() };"},{"Add":" if dstream.is_null() {"},{"Add":" return Err(Error::Null);"},{"Add":" }"},{"Add":" Ok(Seekable {"},{"Add":" dstream,"},{"Add":" seek_table: SeekTable::new(),"},{"Add":" src: source,"},{"Add":" inner_buf_size: size,"},{"Add":" decompressed_offset: 0,"},{"Add":" cur_frame: 0,"},{"Add":" in_buff: [0; SEEKABLE_BUFF_SIZE],"},{"Add":" out_buff: [0; SEEKABLE_BUFF_SIZE],"},{"Add":" xxh_state: Hash64::with_seed(0),"},{"Add":" })"},{"Add":" }"},{"Add":""},{"Add":" fn load_seek_table(&mut self) -> Result<(), Error> {"},{"Add":" // Help the compiler to see it's inbounds"},{"Add":" assert!(self.in_buff.len() == SEEKABLE_BUFF_SIZE);"},{"Add":""},{"Add":" self.src"},{"Add":" .seek(std::io::SeekFrom::End(-(SEEK_TABLE_FOOTER_SIZE as i64)))?;"},{"Add":""},{"Add":" let mut handle = (&mut self.src).take(SEEK_TABLE_FOOTER_SIZE as u64);"},{"Add":" handle.read(&mut self.in_buff)?;"},{"Add":""},{"Add":" let prefix = slice_to_num(&self.in_buff[5..9])?;"},{"Add":" if prefix != SEEKABLE_MAGIC_NUMBER {"},{"Add":" return Err(Error::PrefixUnknown(prefix));"},{"Add":" }"},{"Add":""},{"Add":" let sfd = self.in_buff[4];"},{"Add":" let checksum_flag = (sfd >> 7) as usize;"},{"Add":""},{"Add":" if ((sfd >> 2) & 0x1f) != 0 {"},{"Add":" return Err(Error::Corruption(\"when looking the checksum flag\"));"},{"Add":" }"},{"Add":""},{"Add":" let num_frames = slice_to_num(&self.in_buff[..4])? as usize;"},{"Add":" let size_p_entry: usize = 8 + if checksum_flag != 0 { 4 } else { 0 };"},{"Add":" let table_size = size_p_entry * num_frames;"},{"Add":" let frame_size = table_size + SEEK_TABLE_FOOTER_SIZE + SKIPPABLE_HEADER_SIZE;"},{"Add":""},{"Add":" let mut remaining = frame_size as usize - SEEK_TABLE_FOOTER_SIZE;"},{"Add":" let to_read = std::cmp::min(remaining, SEEKABLE_BUFF_SIZE);"},{"Add":""},{"Add":" self.src"},{"Add":" .seek(std::io::SeekFrom::End(-(frame_size as i64)))?;"},{"Add":""},{"Add":" handle = (&mut self.src).take(to_read as u64);"},{"Add":" handle.read(&mut self.in_buff)?;"},{"Add":""},{"Add":" remaining -= to_read;"},{"Add":""},{"Add":" let mut prefix = slice_to_num(&self.in_buff[..4])?;"},{"Add":" if prefix != (MAGIC_SKIPPABLE_START | 0xE) {"},{"Add":" return Err(Error::PrefixUnknown(prefix));"},{"Add":" }"},{"Add":""},{"Add":" prefix = slice_to_num(&self.in_buff[4..8])?;"},{"Add":" if prefix as usize + SKIPPABLE_HEADER_SIZE != frame_size {"},{"Add":" return Err(Error::PrefixUnknown(prefix));"},{"Add":" }"},{"Add":""},{"Add":" let mut entries: Vec = Vec::with_capacity((num_frames + 1) as usize);"},{"Add":" let mut pos = 0usize;"},{"Add":" let (mut c_offset, mut d_offset) = (0, 0);"},{"Add":""},{"Add":" for idx in 0..num_frames {"},{"Add":" if pos + size_p_entry > SEEKABLE_BUFF_SIZE {"},{"Add":" let offset = SEEKABLE_BUFF_SIZE - pos;"},{"Add":" let to_read = std::cmp::min(remaining, SEEKABLE_BUFF_SIZE - offset);"},{"Add":""},{"Add":" self.in_buff.copy_within(offset..offset + to_read, pos);"},{"Add":""},{"Add":" handle = (&mut self.src).take(to_read as u64);"},{"Add":" handle.read(&mut self.in_buff[offset..offset + to_read])?;"},{"Add":" remaining -= to_read;"},{"Add":" pos = 0;"},{"Add":" }"},{"Add":""},{"Add":" entries.push(SeekEntry {"},{"Add":" c_offset,"},{"Add":" d_offset,"},{"Add":" checksum: 0,"},{"Add":" });"},{"Add":""},{"Add":" c_offset += slice_to_num(&self.in_buff[pos..pos + 4])? as u64;"},{"Add":" pos += 4;"},{"Add":" d_offset += slice_to_num(&self.in_buff[pos..pos + 4])? as u64;"},{"Add":" pos += 4;"},{"Add":""},{"Add":" if checksum_flag != 0 {"},{"Add":" entries[idx].checksum = slice_to_num(&self.in_buff[pos..pos + 4])?;"},{"Add":" pos += 4;"},{"Add":" }"},{"Add":" }"},{"Add":" entries.push(SeekEntry {"},{"Add":" c_offset,"},{"Add":" d_offset,"},{"Add":" checksum: 0,"},{"Add":" });"},{"Add":""},{"Add":" self.seek_table.entries = entries;"},{"Add":" self.seek_table.checksum_flag = checksum_flag as u32;"},{"Add":""},{"Add":" Ok(())"},{"Add":" }"},{"Add":""},{"Add":" fn init_advanced(&mut self) -> Result<(), Error> {"},{"Add":" self.load_seek_table()?;"},{"Add":""},{"Add":" self.decompressed_offset = u64::MAX;"},{"Add":" self.cur_frame = u32::MAX;"},{"Add":""},{"Add":" unsafe {"},{"Add":" let dstream_init = ZSTD_initDStream(self.dstream);"},{"Add":" if ZSTD_isError(dstream_init) != 0 {"},{"Add":" Err(Error::ZSTD(dstream_init))"},{"Add":" } else {"},{"Add":" Ok(())"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" /// Decompress a single frame. This method internally calls"},{"Add":" /// `decompress`, and `dest` must be exactly the size of the"},{"Add":" /// uncompressed frame."},{"Add":" pub fn decompress_frame(&mut self, dest: &mut [u8], index: usize) -> Result {"},{"Add":" let dec_size = self.get_frame_decompressed_size(index)?;"},{"Add":""},{"Add":" if (dest.len() as u64) < dec_size {"},{"Add":" Err(Error::DSizeTooSmall(dest.len() as u64, dec_size))"},{"Add":" } else {"},{"Add":" self.decompress(dest, self.seek_table.entries[index].d_offset)"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" /// Decompress starting from an offset. The length of `out` must"},{"Add":" /// be at least the size of the decompressed output."},{"Add":" ///"},{"Add":" /// This function finds the correct frame to start with, and takes"},{"Add":" /// care of decompressing multiple frames in a row."},{"Add":" pub fn decompress(&mut self, out: &mut [u8], offset: u64) -> Result {"},{"Add":" let eos = self.seek_table.entries.last().unwrap().d_offset;"},{"Add":" let len = out.len() as u64;"},{"Add":" let len = if offset + len > eos {"},{"Add":" eos - offset"},{"Add":" } else {"},{"Add":" len"},{"Add":" };"},{"Add":""},{"Add":" let mut tgt_frame = self.seekable_offset_to_frame_index(offset);"},{"Add":" let mut no_output_progress_c = 0u32;"},{"Add":" let mut src_bytes_read = 0usize;"},{"Add":""},{"Add":" let mut inn = ZSTD_inBuffer {"},{"Add":" src: std::ptr::null() as *const c_void,"},{"Add":" size: 0,"},{"Add":" pos: 0,"},{"Add":" };"},{"Add":""},{"Add":" loop {"},{"Add":" if tgt_frame as usize != self.cur_frame as usize || offset != self.decompressed_offset {"},{"Add":" self.decompressed_offset = self.seek_table.entries[tgt_frame].d_offset;"},{"Add":" self.cur_frame = tgt_frame as u32;"},{"Add":""},{"Add":" self.src.seek(std::io::SeekFrom::Start("},{"Add":" self.seek_table.entries[tgt_frame].c_offset,"},{"Add":" ))?;"},{"Add":""},{"Add":" inn.src = self.in_buff.as_ptr() as *const _ as *const c_void;"},{"Add":""},{"Add":" self.xxh_state = Hash64::with_seed(0);"},{"Add":""},{"Add":" unsafe {"},{"Add":" let r = ZSTD_DCtx_reset(self.dstream, ZSTD_reset_session_only);"},{"Add":" if ZSTD_isError(r) != 0 {"},{"Add":" return Err(Error::ZSTD(r));"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if let Some(size) = &self.inner_buf_size {"},{"Add":" if src_bytes_read > *size {"},{"Add":" return Err(Error::SeekableIo);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" while self.decompressed_offset < offset + len as u64 {"},{"Add":" // here slice_tmp is a [u8] helper so we avoid using unsafe pointer arithmetic later on"},{"Add":" let (mut out_tmp, slice_tmp) = if self.decompressed_offset < offset {"},{"Add":" ("},{"Add":" ZSTD_outBuffer {"},{"Add":" dst: self.out_buff.as_mut_ptr() as *mut c_void,"},{"Add":" size: std::cmp::min("},{"Add":" SEEKABLE_BUFF_SIZE,"},{"Add":" (offset - self.decompressed_offset) as size_t,"},{"Add":" ),"},{"Add":" pos: 0,"},{"Add":" },"},{"Add":" (&self.out_buff).as_ref(),"},{"Add":" )"},{"Add":" } else {"},{"Add":" ("},{"Add":" ZSTD_outBuffer {"},{"Add":" dst: out.as_mut_ptr() as *mut c_void,"},{"Add":" size: len as usize,"},{"Add":" pos: (self.decompressed_offset - offset) as size_t,"},{"Add":" },"},{"Add":" &*out,"},{"Add":" )"},{"Add":" };"},{"Add":""},{"Add":" let (prev_out_pos, prev_in_pos) = (out_tmp.pos, inn.pos);"},{"Add":" let mut to_read;"},{"Add":""},{"Add":" unsafe {"},{"Add":" to_read = ZSTD_decompressStream(self.dstream, &mut out_tmp, &mut inn);"},{"Add":""},{"Add":" if ZSTD_isError(to_read) != 0 {"},{"Add":" return Err(Error::ZSTD(to_read));"},{"Add":" }"},{"Add":" };"},{"Add":""},{"Add":" if self.seek_table.checksum_flag != 0 {"},{"Add":" self.xxh_state.write("},{"Add":" &slice_tmp[prev_out_pos..prev_out_pos + (out_tmp.pos - prev_out_pos)],"},{"Add":" );"},{"Add":" }"},{"Add":""},{"Add":" let forward_progress = (out_tmp.pos - prev_out_pos) as u64;"},{"Add":""},{"Add":" if forward_progress == 0 {"},{"Add":" no_output_progress_c += 1;"},{"Add":" if no_output_progress_c > SEEKABLE_NO_OUTPUT_PROGRESS_MAX {"},{"Add":" return Err(Error::SeekableIo);"},{"Add":" }"},{"Add":" } else {"},{"Add":" no_output_progress_c = 0;"},{"Add":" }"},{"Add":" self.decompressed_offset += forward_progress;"},{"Add":" src_bytes_read += inn.pos - prev_in_pos;"},{"Add":""},{"Add":" if to_read == 0 {"},{"Add":" if self.seek_table.checksum_flag != 0"},{"Add":" && self.xxh_state.finish() as u32"},{"Add":" != self.seek_table.entries[tgt_frame].checksum"},{"Add":" {"},{"Add":" return Err(Error::Corruption(\"during decompression\"));"},{"Add":" }"},{"Add":""},{"Add":" if self.decompressed_offset < offset + len as u64 {"},{"Add":" tgt_frame = self.seekable_offset_to_frame_index(self.decompressed_offset);"},{"Add":" // assert!(tgt_frame != self.seek_table.entries.len());"},{"Add":" }"},{"Add":""},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if inn.pos == inn.size {"},{"Add":" to_read = std::cmp::min(to_read, SEEKABLE_BUFF_SIZE);"},{"Add":" let mut handle = (&mut self.src).take(to_read as u64);"},{"Add":" handle.read(&mut self.in_buff)?;"},{"Add":" inn.size = to_read;"},{"Add":" inn.pos = 0;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if self.decompressed_offset == offset + len as u64 {"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" Ok(len as usize)"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl Seekable {"},{"Add":" /// Number of frames in the message."},{"Add":" #[inline(always)]"},{"Add":" pub fn get_num_frames(&self) -> usize {"},{"Add":" self.seek_table.entries.len() - 1"},{"Add":" }"},{"Add":""},{"Add":" #[inline(always)]"},{"Add":" fn get_frame(&'_ self, frame_index: usize) -> Result<&'_ SeekEntry, Error> {"},{"Add":" let max_frames = self.get_num_frames();"},{"Add":" if frame_index >= max_frames {"},{"Add":" Err(Error::FIndexTooLarge(frame_index, max_frames))"},{"Add":" } else {"},{"Add":" Ok(&self.seek_table.entries[frame_index])"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" /// Offset of the frame in the compressed data."},{"Add":" pub fn get_frame_compressed_offset(&self, frame_index: usize) -> Result {"},{"Add":" Ok(self.get_frame(frame_index)?.c_offset)"},{"Add":" }"},{"Add":" /// Size of the frame in the compressed data."},{"Add":" pub fn get_frame_compressed_size(&self, frame_index: usize) -> Result {"},{"Add":" let entry = self.get_frame(frame_index)?;"},{"Add":" Ok(self.seek_table.entries[frame_index + 1].c_offset - entry.c_offset)"},{"Add":" }"},{"Add":" /// Offset of the frame in the decompressed data."},{"Add":" pub fn get_frame_decompressed_offset(&self, frame_index: usize) -> Result {"},{"Add":" Ok(self.get_frame(frame_index)?.d_offset)"},{"Add":" }"},{"Add":" /// Size of the frame in the decompressed data."},{"Add":" pub fn get_frame_decompressed_size(&self, frame_index: usize) -> Result {"},{"Add":" let entry = self.get_frame(frame_index)?;"},{"Add":" Ok(self.seek_table.entries[frame_index + 1].d_offset - entry.d_offset)"},{"Add":" }"},{"Add":" /// Perform a binary search to find the frame containing the offset."},{"Add":" pub fn seekable_offset_to_frame_index(&self, offset: u64) -> usize {"},{"Add":" let n_frames = self.get_num_frames();"},{"Add":""},{"Add":" assert!(self.seek_table.entries.len() >= n_frames);"},{"Add":""},{"Add":" if offset >= self.seek_table.entries[n_frames].d_offset {"},{"Add":" return n_frames;"},{"Add":" }"},{"Add":""},{"Add":" let (mut lo, mut hi) = (0, n_frames);"},{"Add":""},{"Add":" while lo + 1 < hi {"},{"Add":" let mid = lo + ((hi - lo) >> 1);"},{"Add":" if self.seek_table.entries[mid].d_offset <= offset {"},{"Add":" lo = mid"},{"Add":" } else {"},{"Add":" hi = mid;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" lo"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl<'a> Seekable> {"},{"Add":" /// Initialise a decompressor with an input buffer."},{"Add":" pub fn init_buf(input: &'a mut [u8]) -> Result {"},{"Add":" let size = input.len();"},{"Add":" let source = std::io::Cursor::new(input);"},{"Add":" let mut seekable = Seekable::make_seekable(source, Some(size))?;"},{"Add":" seekable.init_advanced()?;"},{"Add":" Ok(seekable)"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl Seekable {"},{"Add":" /// Initialise a decompressor with a file. This method opens the file, and dropping the resulting `Seekable` closes the file."},{"Add":" pub fn init_file(name: &str) -> Result {"},{"Add":" let source = std::fs::File::create(name)?;"},{"Add":" let mut seekable = Seekable::make_seekable(source, None)?;"},{"Add":" seekable.init_advanced()?;"},{"Add":" Ok(seekable)"},{"Add":" }"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"compress","metadata":576},"context":[{"change":7,"pos":241235}],"contents":[]}},{"FileAdd":{"meta":{"basename":"mod.rs","metadata":0},"context":[{"change":0,"pos":15454}],"contents":[{"Add":"use super::{CStream, Error, ZSTD_reset_session_only};"},{"Add":"use crate::bindings::*;"},{"Add":"use libc::*;"},{"Add":"use std::hash::Hasher;"},{"Add":"use std::{cmp, slice};"},{"Add":"use twox_hash::xxh3::{hash64, Hash64};"},{"Add":""},{"Add":"mod framelog;"},{"Add":"use framelog::*;"},{"Add":""},{"Add":"const MAX_FRAME_DECOMPR_SIZE: usize = 0x80000000;"},{"Add":"const FRAMELOG_STARTING_CAPACITY: usize = 16;"},{"Add":""},{"Add":"/// The type of seekable compressors."},{"Add":"pub struct SeekableCStream {"},{"Add":" cstream: CStream,"},{"Add":" framelog: FrameLog,"},{"Add":" frame_c_size: u32,"},{"Add":" frame_d_size: u32,"},{"Add":" xxh_state: Hash64,"},{"Add":" max_frame_size: usize,"},{"Add":" writing_seek_table: bool,"},{"Add":"}"},{"Add":""},{"Add":"unsafe impl Send for SeekableCStream {}"},{"Add":""},{"Add":"impl SeekableCStream {"},{"Add":" /// Create a compressor with the given level and frame size. When"},{"Add":" /// seeking in the file, frames are decompressed one by one, so"},{"Add":" /// this should be chosen of a size similar to the chunks that"},{"Add":" /// will be decompressed."},{"Add":" pub fn new(level: usize, frame_size: usize) -> Result {"},{"Add":" let cstream = unsafe { ZSTD_createCStream() };"},{"Add":""},{"Add":" if cstream.is_null() {"},{"Add":" return Err(Error::Null);"},{"Add":" }"},{"Add":""},{"Add":" if frame_size > MAX_FRAME_DECOMPR_SIZE {"},{"Add":" Err(Error::FParamUnsupported(frame_size, MAX_FRAME_DECOMPR_SIZE))"},{"Add":" } else {"},{"Add":" let max_frame_size = if frame_size > 0 {"},{"Add":" frame_size"},{"Add":" } else {"},{"Add":" MAX_FRAME_DECOMPR_SIZE"},{"Add":" };"},{"Add":""},{"Add":" unsafe {"},{"Add":" let result = ZSTD_initCStream(cstream, level as c_int);"},{"Add":" if ZSTD_isError(result) != 0 {"},{"Add":" return Err(Error::ZSTD(result));"},{"Add":" }"},{"Add":" };"},{"Add":""},{"Add":" Ok(SeekableCStream {"},{"Add":" cstream: CStream { p: cstream },"},{"Add":" framelog: FrameLog::with_capacity(FRAMELOG_STARTING_CAPACITY),"},{"Add":" frame_c_size: 0,"},{"Add":" frame_d_size: 0,"},{"Add":" xxh_state: Hash64::with_seed(0),"},{"Add":" max_frame_size,"},{"Add":" writing_seek_table: false,"},{"Add":" })"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" fn end_frame(&mut self, output: &mut ZSTD_outBuffer) -> Result {"},{"Add":" let prev_out_pos = output.pos;"},{"Add":" let ret = unsafe { ZSTD_endStream(self.cstream.p, output) };"},{"Add":""},{"Add":" self.frame_c_size += (output.pos - prev_out_pos) as u32;"},{"Add":""},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" }"},{"Add":""},{"Add":" let checksum = if self.framelog.checksum_flag != 0 {"},{"Add":" self.xxh_state.finish() as u32"},{"Add":" } else {"},{"Add":" 0"},{"Add":" };"},{"Add":""},{"Add":" self.framelog"},{"Add":" .log_frame(self.frame_c_size, self.frame_d_size, checksum)?;"},{"Add":""},{"Add":" self.frame_c_size = 0;"},{"Add":" self.frame_d_size = 0;"},{"Add":""},{"Add":" unsafe {"},{"Add":" let r = ZSTD_CCtx_reset(self.cstream.p, ZSTD_reset_session_only);"},{"Add":" if ZSTD_isError(r) != 0 {"},{"Add":" return Err(Error::ZSTD(r));"},{"Add":" }"},{"Add":" };"},{"Add":""},{"Add":" if self.framelog.checksum_flag != 0 {"},{"Add":" self.xxh_state = Hash64::with_seed(0);"},{"Add":" }"},{"Add":""},{"Add":" Ok(0)"},{"Add":" }"},{"Add":""},{"Add":" /// Compress one chunk of input, and write it into the output. The"},{"Add":" /// `output` array must be large enough to hold the result. If"},{"Add":" /// successful, this function returns two integers `(out_pos,"},{"Add":" /// in_pos)`, where `out_pos` is the number of bytes written in"},{"Add":" /// `output`, and `in_pos` is the number of input bytes consumed."},{"Add":" pub fn compress(&mut self, output: &mut [u8], input: &[u8]) -> Result<(usize, usize), Error> {"},{"Add":" let mut output = ZSTD_outBuffer {"},{"Add":" dst: output.as_mut_ptr() as *mut c_void,"},{"Add":" size: output.len() as size_t,"},{"Add":" pos: 0,"},{"Add":" };"},{"Add":""},{"Add":" let len = cmp::min("},{"Add":" input.len(),"},{"Add":" self.max_frame_size - self.frame_d_size as usize,"},{"Add":" );"},{"Add":""},{"Add":" let mut in_tmp = ZSTD_inBuffer {"},{"Add":" src: input.as_ptr() as *const c_void,"},{"Add":" size: len,"},{"Add":" pos: 0,"},{"Add":" };"},{"Add":""},{"Add":" if len > 0 {"},{"Add":" let ret = unsafe { ZSTD_compressStream(self.cstream.p, &mut output, &mut in_tmp) };"},{"Add":""},{"Add":" if self.framelog.checksum_flag != 0 {"},{"Add":" self.xxh_state"},{"Add":" .write(unsafe { slice::from_raw_parts(in_tmp.src as *const _, in_tmp.pos) });"},{"Add":" }"},{"Add":""},{"Add":" self.frame_c_size += output.pos as u32;"},{"Add":" self.frame_d_size += in_tmp.pos as u32;"},{"Add":""},{"Add":" if unsafe { ZSTD_isError(ret) } != 0 {"},{"Add":" return Err(Error::ZSTD(ret));"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if self.max_frame_size == self.frame_d_size as usize {"},{"Add":" let ret = self.end_frame(&mut output)?;"},{"Add":""},{"Add":" if unsafe { ZSTD_isError(ret) } != 0 {"},{"Add":" return Err(Error::ZSTD(ret));"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" Ok((output.pos as usize, in_tmp.pos as usize))"},{"Add":" }"},{"Add":""},{"Add":" /// Finish writing the message, i.e. write the remaining pending block."},{"Add":" pub fn end_stream(&mut self, output: &mut [u8]) -> Result {"},{"Add":" let mut output_ = ZSTD_outBuffer {"},{"Add":" dst: output.as_mut_ptr() as *mut c_void,"},{"Add":" size: output.len() as size_t,"},{"Add":" pos: 0,"},{"Add":" };"},{"Add":""},{"Add":" if !self.writing_seek_table && self.frame_d_size != 0 {"},{"Add":" let end_frame = self.end_frame(&mut output_)?;"},{"Add":""},{"Add":" if unsafe { ZSTD_isError(end_frame) } != 0 {"},{"Add":" return Err(Error::ZSTD(end_frame));"},{"Add":" }"},{"Add":""},{"Add":" if end_frame != 0 {"},{"Add":" return Ok(end_frame + self.framelog.seek_table_size());"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" self.writing_seek_table = true;"},{"Add":" let result = self.framelog.write_seek_table(output, &mut output_.pos)?;"},{"Add":""},{"Add":" if unsafe { ZSTD_isError(result) } != 0 {"},{"Add":" return Err(Error::ZSTD(result));"},{"Add":" }"},{"Add":""},{"Add":" Ok(output_.pos as usize)"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"pub trait Dst: Send {"},{"Add":" fn as_mut_ptr(&mut self) -> *mut u8;"},{"Add":" fn as_slice(&self) -> &[u8];"},{"Add":" fn len(&self) -> usize;"},{"Add":" fn new() -> Self;"},{"Add":"}"},{"Add":""},{"Add":"impl Dst for [u8; N] {"},{"Add":" fn as_mut_ptr(&mut self) -> *mut u8 {"},{"Add":" self.as_mut().as_mut_ptr()"},{"Add":" }"},{"Add":" fn as_slice(&self) -> &[u8] {"},{"Add":" self.as_ref()"},{"Add":" }"},{"Add":" fn len(&self) -> usize {"},{"Add":" N"},{"Add":" }"},{"Add":" fn new() -> Self {"},{"Add":" unsafe { std::mem::MaybeUninit::uninit().assume_init() }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"struct CompressedFrame {"},{"Add":" src_size: u32,"},{"Add":" dst_size: u32,"},{"Add":" checksum: u32,"},{"Add":" dst: D,"},{"Add":"}"},{"Add":""},{"Add":"impl CompressedFrame {"},{"Add":" fn as_slice(&self) -> &[u8] {"},{"Add":" &self.dst.as_slice()[..self.dst_size as usize]"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"unsafe impl Send for CompressedFrame {}"},{"Add":""},{"Add":"fn compress_frame(src: &[u8], level: usize) -> Result, Error> {"},{"Add":" let mut dst = D::new();"},{"Add":""},{"Add":" let ret = unsafe {"},{"Add":" let ret = ZSTD_compress("},{"Add":" dst.as_mut_ptr() as *mut c_void,"},{"Add":" dst.len() as size_t,"},{"Add":" src.as_ptr() as *const c_void,"},{"Add":" src.len() as size_t,"},{"Add":" level as c_int,"},{"Add":" );"},{"Add":""},{"Add":" if ZSTD_isError(ret) != 0 {"},{"Add":" return Err(Error::ZSTD(ret));"},{"Add":" }"},{"Add":""},{"Add":" ret"},{"Add":" };"},{"Add":""},{"Add":" let checksum = hash64(src) as u32;"},{"Add":""},{"Add":" Ok(CompressedFrame {"},{"Add":" src_size: src.len() as u32,"},{"Add":" dst_size: ret as u32,"},{"Add":" checksum,"},{"Add":" dst,"},{"Add":" })"},{"Add":"}"},{"Add":""},{"Add":"pub fn parallel_compress("},{"Add":" src: &'static [u8],"},{"Add":" mut output: W,"},{"Add":" level: usize,"},{"Add":" jobs: usize,"},{"Add":" chunk_size: usize,"},{"Add":") -> Result<(), Error> {"},{"Add":" use std::sync::mpsc::channel;"},{"Add":" use threadpool::ThreadPool;"},{"Add":""},{"Add":" let n = src.len() / chunk_size + if src.len() % chunk_size == 0 { 0 } else { 1 };"},{"Add":" let pool = ThreadPool::new(jobs);"},{"Add":""},{"Add":" let (tx, rx) = channel();"},{"Add":" for (i, chunk) in src.chunks(chunk_size).enumerate() {"},{"Add":" let tx = tx.clone();"},{"Add":" pool.execute(move || {"},{"Add":" let frame = compress_frame(chunk, level);"},{"Add":" tx.send((i, frame))"},{"Add":" .expect(\"channel will be there waiting for the pool\");"},{"Add":" });"},{"Add":" }"},{"Add":""},{"Add":" let mut frames: Vec> = Vec::with_capacity(n);"},{"Add":" unsafe { frames.set_len(n) };"},{"Add":" for (i, frame) in rx.iter().take(n) {"},{"Add":" frames[i] = frame?;"},{"Add":" }"},{"Add":""},{"Add":" let mut log = FrameLog::new();"},{"Add":" for frame in frames.iter() {"},{"Add":" output.write_all(frame.as_slice())?;"},{"Add":" log.log_frame(frame.dst_size, frame.src_size, frame.checksum)?;"},{"Add":" }"},{"Add":" log.write_all(&mut output)?;"},{"Add":" Ok(())"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"framelog.rs","metadata":0},"context":[{"change":0,"pos":15454}],"contents":[{"Add":"use crate::{"},{"Add":" Error, ZSTD_outBuffer,"},{"Add":" SKIPPABLE_HEADER_SIZE,"},{"Add":" SEEK_TABLE_FOOTER_SIZE,"},{"Add":" MAGIC_SKIPPABLE_START,"},{"Add":" SEEKABLE_MAGIC_NUMBER,"},{"Add":"};"},{"Add":"use libc::*;"},{"Add":""},{"Add":"const SEEKABLE_MAX_FRAMES: usize = 0x8000000;"},{"Add":""},{"Add":"#[derive(Clone)]"},{"Add":"struct FrameLogEntry {"},{"Add":" c_size: u32,"},{"Add":" d_size: u32,"},{"Add":" checksum: u32,"},{"Add":"}"},{"Add":""},{"Add":"/// The type of compressors."},{"Add":"pub struct FrameLog {"},{"Add":" entries: Vec,"},{"Add":" pub checksum_flag: u32,"},{"Add":" seek_table_pos: u32,"},{"Add":" seek_table_index: u32,"},{"Add":"}"},{"Add":""},{"Add":"unsafe impl Send for FrameLog {}"},{"Add":""},{"Add":"impl FrameLog {"},{"Add":""},{"Add":" pub fn new() -> Self {"},{"Add":" FrameLog {"},{"Add":" entries: Vec::new(),"},{"Add":" checksum_flag: 1,"},{"Add":" seek_table_pos: 0,"},{"Add":" seek_table_index: 0,"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" pub fn with_capacity(x: usize) -> Self {"},{"Add":" FrameLog {"},{"Add":" entries: Vec::with_capacity(x),"},{"Add":" checksum_flag: 1,"},{"Add":" seek_table_pos: 0,"},{"Add":" seek_table_index: 0,"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" pub fn log_frame(&mut self, c_size: u32, d_size: u32, checksum: u32) -> Result<(), Error> {"},{"Add":" let size = self.entries.len();"},{"Add":" if size == SEEKABLE_MAX_FRAMES {"},{"Add":" return Err(Error::FIndexTooLarge(size, SEEKABLE_MAX_FRAMES as usize));"},{"Add":" }"},{"Add":""},{"Add":" self.entries.push(FrameLogEntry {"},{"Add":" c_size,"},{"Add":" d_size,"},{"Add":" checksum,"},{"Add":" });"},{"Add":""},{"Add":" Ok(())"},{"Add":" }"},{"Add":""},{"Add":" #[inline(always)]"},{"Add":" pub fn seek_table_size(&self) -> usize {"},{"Add":" let size_p_frame = 8 + if self.checksum_flag != 0 { 4 } else { 0 };"},{"Add":" SKIPPABLE_HEADER_SIZE + size_p_frame * self.entries.len() + SEEK_TABLE_FOOTER_SIZE"},{"Add":" }"},{"Add":""},{"Add":" pub fn stwrite32("},{"Add":" &mut self,"},{"Add":" output: &mut [u8],"},{"Add":" value: u32,"},{"Add":" offset: u32,"},{"Add":" pos: &mut usize,"},{"Add":" ) -> usize {"},{"Add":" if self.seek_table_pos < offset + 4 {"},{"Add":" let len_write = std::cmp::min("},{"Add":" output.len() - *pos,"},{"Add":" (offset + 4 - self.seek_table_pos) as usize,"},{"Add":" );"},{"Add":""},{"Add":" output[*pos..*pos + len_write].copy_from_slice(&value.to_ne_bytes());"},{"Add":""},{"Add":" *pos += len_write;"},{"Add":" self.seek_table_pos += len_write as u32;"},{"Add":""},{"Add":" return if len_write < 4 {"},{"Add":" self.seek_table_size() - self.seek_table_pos as usize"},{"Add":" } else {"},{"Add":" 0"},{"Add":" };"},{"Add":" }"},{"Add":" 0"},{"Add":" }"},{"Add":""},{"Add":" pub fn write_seek_table(&mut self, output: &mut [u8], pos: &mut usize) -> Result {"},{"Add":" let size_p_frame = 8 + if self.checksum_flag != 0 { 4 } else { 0 };"},{"Add":" let table_len = self.seek_table_size();"},{"Add":""},{"Add":" let ret = self.stwrite32(output, MAGIC_SKIPPABLE_START | 0xE, 0, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" // assert!(table_len <= usize::MAX);"},{"Add":""},{"Add":" let ret = self.stwrite32(output, (table_len - SKIPPABLE_HEADER_SIZE) as u32, 4, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" let mut i = self.seek_table_index as usize;"},{"Add":""},{"Add":" while i < self.entries.len() {"},{"Add":" let start = (SKIPPABLE_HEADER_SIZE + size_p_frame * i) as u32;"},{"Add":" // assert!(start + 8 <= usize::MAX);"},{"Add":""},{"Add":" let ret = self.stwrite32(output, self.entries[i].c_size, start, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" let ret = self.stwrite32(output, self.entries[i].d_size, start + 4, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" if self.checksum_flag != 0 {"},{"Add":" let ret = self.stwrite32(output, self.entries[i].checksum, start + 8, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":" }"},{"Add":""},{"Add":" i += 1;"},{"Add":" }"},{"Add":""},{"Add":" self.seek_table_index = i as u32;"},{"Add":" // assert!(table_len <= usize::MAX);"},{"Add":""},{"Add":" let ret = self.stwrite32("},{"Add":" output,"},{"Add":" self.entries.len() as u32,"},{"Add":" (table_len - SEEK_TABLE_FOOTER_SIZE) as u32,"},{"Add":" pos,"},{"Add":" );"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" if output.len() - *pos < 1 {"},{"Add":" return Ok(table_len - self.seek_table_pos as usize);"},{"Add":" }"},{"Add":" if (self.seek_table_pos as usize) < (table_len - 4) {"},{"Add":" let sfd = (self.checksum_flag << 7) as u8;"},{"Add":""},{"Add":" output[*pos] = sfd;"},{"Add":" *pos += 1;"},{"Add":" self.seek_table_pos += 1;"},{"Add":" }"},{"Add":""},{"Add":" let ret = self.stwrite32(output, SEEKABLE_MAGIC_NUMBER, (table_len - 4) as u32, pos);"},{"Add":" if ret != 0 {"},{"Add":" return Ok(ret);"},{"Add":" };"},{"Add":""},{"Add":" if (self.seek_table_pos as usize) != table_len {"},{"Add":" Err(Error::Generic)"},{"Add":" } else {"},{"Add":" Ok(0)"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" pub fn write_all(&mut self, mut w: W) -> Result<(), std::io::Error> {"},{"Add":" let mut output = [0; 1024];"},{"Add":" let mut output_ = ZSTD_outBuffer {"},{"Add":" dst: output.as_mut_ptr() as *mut c_void,"},{"Add":" size: 1024,"},{"Add":" pos: 0,"},{"Add":" };"},{"Add":""},{"Add":" while let Ok(ret) = self.write_seek_table(&mut output, &mut output_.pos) {"},{"Add":" if ret == 0 {"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" w.write_all(&output[..output_.pos as usize])?;"},{"Add":" output_.pos = 0;"},{"Add":" }"},{"Add":""},{"Add":" w.write_all(&output[..output_.pos as usize])?;"},{"Add":" Ok(())"},{"Add":" }"},{"Add":"}"}]}}],"owner":"pijul","repo":"zstd-seekable","token":"05mxDNPy22rS4YZrTJAYEhbA+Nzn6cliq6x8MCvhhDc=","login":null}

…

Dependencies

Change contents