HomeSort by: relevance | last modified time | path
    Searched refs:tagTable (Results 1 - 3 of 3) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/compress/
zstd_lazy.c 795 * Returns the next index to insert at within a tagTable row, and updates the "head"
814 * Performs prefetching for the hashTable and tagTable at a given row.
816 FORCE_INLINE_TEMPLATE void ZSTD_row_prefetch(U32 const* hashTable, BYTE const* tagTable, U32 const relRow, U32 const rowLog) {
822 PREFETCH_L1(tagTable + relRow);
824 PREFETCH_L1(tagTable + relRow + 32);
828 assert(ZSTD_isAligned(tagTable + relRow, (size_t)1 << rowLog)); /* prefetched tagRow sits on correct multiple of bytes (32,64,128) */
842 BYTE const* const tagTable = ms->tagTable;
850 ZSTD_row_prefetch(hashTable, tagTable, row, rowLog);
861 * base + idx + ZSTD_ROW_HASH_CACHE_SIZE. Also prefetches the appropriate rows from hashTable and tagTable
    [all...]
zstd_compress.c 2028 ms->tagTable = (BYTE*) ZSTD_cwksp_reserve_aligned_init_once(ws, tagTableSize);
2032 ms->tagTable = (BYTE*) ZSTD_cwksp_reserve_aligned(ws, tagTableSize);
2033 ZSTD_memset(ms->tagTable, 0, tagTableSize);
2439 ZSTD_memcpy(cctx->blockState.matchState.tagTable,
2440 cdict->matchState.tagTable,
4882 ZSTD_memset(ms->tagTable, 0, tagTableSize);
zstd_compress_internal.h 230 BYTE* tagTable; /* For row-based matchFinder: A row-based table containing the hashes and head index. */

Completed in 37 milliseconds