ZSTD_compressSeqStore_singleBlock(): * Compresses a seqStore into a block with a block header, into the buffer dst. * * Returns the total size of t

Internal */

! ZSTD_compress_usingCDict_internal(): * Implementation of various ZSTD_compress_usingCDict* functions. */

* Return the number of additional bytes required to align a pointer to the given number of bytes. * alignBytes must be a power of two. */

* Invalidates all buffer, aligned, and table allocations. * Object allocations remain valid. */

* Moves the cwksp to the next phase, and does any necessary allocations. * Returns a 0 on success, or zstd error */

* Returns whether this object/buffer/etc was allocated in this workspace. */

* Internal function. Do not use directly. */

* Internal function. Do not use directly. * Reserves the given number of bytes within the aligned/buffer segment of the wksp, which * counts from th

ZSTD_decompressContinue() : * srcSize : must be the exact nb of bytes expected (see ZSTD_nextSrcSizeToDecompress()) * @return : nb of bytes genera

Calls ZSTD_decompressContinue() with the right parameters for ZSTD_decompressStream() * and updates the stage and the output buffer state. This call

This decoding function employs prefetching * to reduce latency impact of cache misses. * It's generally employed when block contains a significant p

! ZSTD_decompress_usingDDict() : * Decompression using a pre-digested Dictionary * Use dictionary without significant overhead. */

Returns the longest match length found in the dedicated dict search structure. * If none are longer than the argument ml, then ml will be returned.

Returns an offset code, given a sequence's raw offset, the ongoing repcode array, and whether litLength == 0 */

ZSTD_findFrameCompressedSize() : * compatible with legacy mode * `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable fr

ZSTD_getFrameContentSize() : * compatible with legacy mode * @return : decompressed size of the single frame pointed to be `src` if known, otherwis

ZSTD_getMatchPrice() : * Provides the cost of the match part (offset + matchLength) of a sequence * Must be combined with ZSTD_fullLiteralsCost() to

Update chains up to ip (excluded) Assumption : always within prefix (i.e. not within extDict) */

ZSTD_isAligned(): * Checks that a pointer is aligned to "align" bytes which must be a power of 2. */

ZSTD_ldm_fillFastTables() : * * Fills the relevant tables for the ZSTD_fast and ZSTD_dfast strategies. * This is similar to ZSTD_loadDictionaryCo

ZSTD_ldm_gear_feed(): * * Registers in the splits array all the split points found in the first * size bytes following the data pointer. This funct

ZSTD_ldm_gear_init(): * * Initializes the rolling hash state such that it will honor the * settings in params. */

ZSTD_ldm_gear_reset() * Feeds [data, data + minMatchLength) into the hash without registering any * splits. This effectively resets the hash state.

ZSTD_ldm_getBucket() : * Returns a pointer to the start of the bucket associated with hash. */

ZSTD_ldm_limitTableUpdate() : * * Sets cctx->nextToUpdate to a position corresponding closer to anchor * if it is far way * (after a long match

! ZSTD_loadDEntropy() : * dict : must point at beginning of a valid zstd dictionary. * @return : size of entropy tables read */

Returns true if the given block may be RLE. * This is just a heuristic based on the compressibility. * It may return both false positives and false

-************************************** * Advanced Streaming Decompression API * Bufferless and synchronous **************************************

ZSTD_optLdm_processMatchCandidate(): * Wrapper function to update ldm seq store and call ldm functions as necessary. */

ZSTD_opt_getNextMatchAndUpdateSeqStore(): * Calculates the beginning and end of the next match in the current block. * Updates 'pos' and 'posInSeque

! ZSTD_overlapCopy8() : * Copies 8 bytes from ip to op and updates op and ip where ip <= op. * If the offset is < 8 then the offset is spread to a

! ZSTD_reduceTable() : * reduce table indexes by `reducerValue`, or squash to zero. * PreserveMark preserves "unsorted mark" for btlazy2 strategy.

* Returns the raw offset represented by the combination of offCode, ll0, and repcode history. * offCode must be an offCode representing a repcode, th

ZSTD_rollingHash_append() : * Add the buffer to the hash value. */

ZSTD_rollingHash_compute() : * Compute the rolling hash value of the buffer. */

ZSTD_row_fillHashCache(): * Fill up the hash cache starting at idx, prefetching up to ZSTD_ROW_HASH_CACHE_SIZE entries, * but not beyond iLimit. */

Returns a ZSTD_VecMask (U32) that has the nth bit set to 1 if the newly-computed "tag" matches * the hash at the nth position in a row of the tagTabl

ZSTD_row_nextCachedHash(): * Returns the hash of base + idx, and replaces the hash in the hash cache with the byte at * base + idx + ZSTD_ROW_HASH_C

ZSTD_row_nextIndex(): * Returns the next index to insert at within a tagTable row, and updates the "head" * value to reflect the update. Essentially

ZSTD_row_update_internal(): * Inserts the byte at ip into the appropriate position in the hash table. * Determines the relative row, and the positio

! ZSTD_safecopy() : * Specialized version of memcpy() that is allowed to READ up to WILDCOPY_OVERLENGTH past the input buffer * and write up to 16

ZSTD_selectBlockCompressor() : * Not static, but internal use only (used by long distance matcher) * assumption : strat is a valid strategy */

* Returns true if we should use ncount=-1 else we should * use ncount=1 for low probability symbols instead. */

Returns a ZSTD error code if sequence is not valid */

* ZSTD_window_correctOverflow(): * Reduces the indices to protect from index overflow. * Returns the correction made to the indices, which must be a

* ZSTD_window_enforceMaxDist(): * Updates lowLimit so that: * (srcEnd - base) - lowLimit == maxDist + loadedDictEnd * * It ensures index is val

* ZSTD_window_needOverflowCorrection(): * Returns non-zero if the indices are getting too large and need overflow * protection. */

Pop trailing draw command (used before merging or presenting to user) Note that this leaves the ImDrawList in a state unfit for further commands, as m

Initialize before use in a new frame. We always have a command ready in the buffer.