Home
last modified time | relevance | path

Searched refs:chainTable (Results 1 – 3 of 3) sorted by relevance

/lib/lz4/
Dlz4hc_compress.c51 #define DELTANEXTU16(p) chainTable[(U16)(p)] /* faster */
64 memset(hc4->chainTable, 0xFF, sizeof(hc4->chainTable)); in LZ4HC_init()
77 U16 * const chainTable = hc4->chainTable; in LZ4HC_Insert() local
106 U16 * const chainTable = hc4->chainTable; in LZ4HC_InsertAndFindBestMatch() local
178 U16 * const chainTable = hc4->chainTable; in LZ4HC_InsertAndGetWiderMatch() local
/lib/zstd/
Dcompress.c80 U32 *chainTable; member
283 zc->chainTable = zc->hashTable + hSize; in ZSTD_resetCCtx_advanced()
284 zc->hashTable3 = zc->chainTable + chainSize; in ZSTD_resetCCtx_advanced()
419 ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue); in ZSTD_reduceIndex()
1239 U32 *const hashSmall = cctx->chainTable; in ZSTD_fillDoubleHashTable()
1258 U32 *const hashSmall = cctx->chainTable; in ZSTD_compressBlock_doubleFast_generic()
1399 U32 *const hashSmall = ctx->chainTable; in ZSTD_compressBlock_doubleFast_extDict_generic()
1566 U32 *const bt = zc->chainTable; in ZSTD_insertBt1()
1649 U32 *const bt = zc->chainTable; in ZSTD_insertBtAndFindBestMatch()
1791 #define NEXT_IN_CHAIN(d, mask) chainTable[(d)&mask]
[all …]
Dzstd_opt.h244 U32 *const bt = zc->chainTable; in ZSTD_insertBtAndGetAllMatches()