HomeSort by: relevance | last modified time | path
    Searched defs:hashSalt (Results 1 - 2 of 2) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/compress/
zstd_lazy.c 848 U32 const hash = (U32)ZSTD_hashPtrSalted(base + idx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, ms->hashSalt);
869 U64 const hashSalt)
871 U32 const newHash = (U32)ZSTD_hashPtrSalted(base+idx+ZSTD_ROW_HASH_CACHE_SIZE, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, hashSalt);
897 U32 const hash = useCache ? ZSTD_row_nextCachedHash(ms->hashCache, hashTable, tagTable, base, updateStartIdx, hashLog, rowLog, mls, ms->hashSalt)
898 : (U32)ZSTD_hashPtrSalted(base + updateStartIdx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, ms->hashSalt);
904 assert(hash == ZSTD_hashPtrSalted(base + updateStartIdx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, ms->hashSalt));
1168 const U64 hashSalt = ms->hashSalt;
1207 hash = ZSTD_row_nextCachedHash(hashCache, hashTable, tagTable, base, curr, hashLog, rowLog, mls, hashSalt);
1212 hash = (U32)ZSTD_hashPtrSalted(ip, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, hashSalt);
    [all...]
zstd_compress_internal.h 232 U64 hashSalt; /* For row-based matchFinder: salts the hash for reuse of tag table */
843 size_t ZSTD_hashPtrSalted(const void* p, U32 hBits, U32 mls, const U64 hashSalt) {
851 case 4: return ZSTD_hash4PtrS(p, hBits, (U32)hashSalt);
852 case 5: return ZSTD_hash5PtrS(p, hBits, hashSalt);
853 case 6: return ZSTD_hash6PtrS(p, hBits, hashSalt);
854 case 7: return ZSTD_hash7PtrS(p, hBits, hashSalt);
855 case 8: return ZSTD_hash8PtrS(p, hBits, hashSalt);

Completed in 28 milliseconds