Searched refs:hashTable (Results 1 – 10 of 10) sorted by relevance
/linux-5.19.10/lib/zstd/compress/ |
D | zstd_fast.c | 20 U32* const hashTable = ms->hashTable; in ZSTD_fillHashTable() local 34 hashTable[hash0] = curr; in ZSTD_fillHashTable() 40 if (hashTable[hash] == 0) { /* not yet filled */ in ZSTD_fillHashTable() 41 hashTable[hash] = curr + p; in ZSTD_fillHashTable() 53 U32* const hashTable = ms->hashTable; in ZSTD_compressBlock_fast_generic() local 99 U32 const matchIndex0 = hashTable[h0]; in ZSTD_compressBlock_fast_generic() 100 U32 const matchIndex1 = hashTable[h1]; in ZSTD_compressBlock_fast_generic() 110 hashTable[h0] = current0; /* update hash table */ in ZSTD_compressBlock_fast_generic() 111 hashTable[h1] = current1; /* update hash table */ in ZSTD_compressBlock_fast_generic() 160 …hashTable[ZSTD_hashPtr(base+current0+2, hlog, mls)] = current0+2; /* here because current+2 could… in ZSTD_compressBlock_fast_generic() [all …]
|
D | zstd_lazy.c | 25 U32* const hashTable = ms->hashTable; in ZSTD_updateDUBT() local 45 U32 const matchIndex = hashTable[h]; in ZSTD_updateDUBT() 51 hashTable[h] = idx; /* Update Hash Table */ in ZSTD_updateDUBT() 164 const U32 * const dictHashTable = dms->hashTable; in ZSTD_DUBT_findBetterDictMatch() 238 U32* const hashTable = ms->hashTable; in ZSTD_DUBT_findBestMatch() local 241 U32 matchIndex = hashTable[h]; in ZSTD_DUBT_findBestMatch() 309 matchIndex = hashTable[h]; in ZSTD_DUBT_findBestMatch() 310 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_DUBT_findBestMatch() 456 U32* const hashTable = ms->hashTable; in ZSTD_insertAndFindFirstIndex_internal() local 466 NEXT_IN_CHAIN(idx, chainMask) = hashTable[h]; in ZSTD_insertAndFindFirstIndex_internal() [all …]
|
D | zstd_opt.c | 387 U32* const hashTable = ms->hashTable; in ZSTD_insertBt1() local 393 U32 matchIndex = hashTable[h]; in ZSTD_insertBt1() 420 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_insertBt1() 537 U32* const hashTable = ms->hashTable; in ZSTD_insertBtAndGetAllMatches() local 539 U32 matchIndex = hashTable[h]; in ZSTD_insertBtAndGetAllMatches() 652 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_insertBtAndGetAllMatches() 710 U32 dictMatchIndex = dms->hashTable[dmsH]; in ZSTD_insertBtAndGetAllMatches()
|
D | zstd_double_fast.c | 19 U32* const hashLarge = ms->hashTable; in ZSTD_fillDoubleHashTable() 57 U32* const hashLong = ms->hashTable; in ZSTD_compressBlock_doubleFast_generic() 79 dms->hashTable : NULL; in ZSTD_compressBlock_doubleFast_generic() 363 U32* const hashLong = ms->hashTable; in ZSTD_compressBlock_doubleFast_extDict_generic()
|
D | zstd_ldm.c | 148 return ldmState->hashTable + (hash << ldmParams.bucketSizeLog); in ZSTD_ldm_getBucket() 507 ZSTD_ldm_reduceTable(ldmState->hashTable, ldmHSize, correction); in ZSTD_ldm_generateSequences()
|
D | zstd_compress_internal.h | 157 U32* hashTable; member 191 ldmEntry_t* hashTable; member
|
D | zstd_compress.c | 1512 ms->hashTable = (U32*)ZSTD_cwksp_reserve_table(ws, hSize * sizeof(U32)); in ZSTD_reset_matchState() 1699 …zc->ldmState.hashTable = (ldmEntry_t*)ZSTD_cwksp_reserve_aligned(ws, ldmHSize * sizeof(ldmEntry_t)… in ZSTD_resetCCtx_internal() 1700 ZSTD_memset(zc->ldmState.hashTable, 0, ldmHSize * sizeof(ldmEntry_t)); in ZSTD_resetCCtx_internal() 1851 ZSTD_memcpy(cctx->blockState.matchState.hashTable, in ZSTD_resetCCtx_byCopyingCDict() 1852 cdict->matchState.hashTable, in ZSTD_resetCCtx_byCopyingCDict() 1946 ZSTD_memcpy(dstCCtx->blockState.matchState.hashTable, in ZSTD_copyCCtx_internal() 1947 srcCCtx->blockState.matchState.hashTable, in ZSTD_copyCCtx_internal() 2040 ZSTD_reduceTable(ms->hashTable, hSize, reducerValue); in ZSTD_reduceIndex()
|
/linux-5.19.10/lib/lz4/ |
D | lz4_compress.c | 101 const BYTE **hashTable = (const BYTE **)tableBase; in LZ4_putPositionOnHash() local 103 hashTable[h] = p; in LZ4_putPositionOnHash() 108 U32 *hashTable = (U32 *) tableBase; in LZ4_putPositionOnHash() local 110 hashTable[h] = (U32)(p - srcBase); in LZ4_putPositionOnHash() 115 U16 *hashTable = (U16 *) tableBase; in LZ4_putPositionOnHash() local 117 hashTable[h] = (U16)(p - srcBase); in LZ4_putPositionOnHash() 141 const BYTE **hashTable = (const BYTE **) tableBase; in LZ4_getPositionOnHash() local 143 return hashTable[h]; in LZ4_getPositionOnHash() 147 const U32 * const hashTable = (U32 *) tableBase; in LZ4_getPositionOnHash() local 149 return hashTable[h] + srcBase; in LZ4_getPositionOnHash() [all …]
|
D | lz4hc_compress.c | 63 memset((void *)hc4->hashTable, 0, sizeof(hc4->hashTable)); in LZ4HC_init() 78 U32 * const hashTable = hc4->hashTable; in LZ4HC_Insert() local 85 size_t delta = idx - hashTable[h]; in LZ4HC_Insert() 92 hashTable[h] = idx; in LZ4HC_Insert() 107 U32 * const HashTable = hc4->hashTable; in LZ4HC_InsertAndFindBestMatch() 179 U32 * const HashTable = hc4->hashTable; in LZ4HC_InsertAndGetWiderMatch()
|
/linux-5.19.10/include/linux/ |
D | lz4.h | 99 uint32_t hashTable[LZ4_HASH_SIZE_U32]; member 115 unsigned int hashTable[LZ4HC_HASHTABLESIZE]; member
|