Lines Matching refs:idx
44 U32 idx = ms->nextToUpdate; in ZSTD_updateDUBT() local
46 if (idx != target) in ZSTD_updateDUBT()
48 idx, target, ms->window.dictLimit); in ZSTD_updateDUBT()
52 assert(idx >= ms->window.dictLimit); /* condition for valid base+idx */ in ZSTD_updateDUBT()
53 for ( ; idx < target ; idx++) { in ZSTD_updateDUBT()
54 … size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls); /* assumption : ip + 8 <= iend */ in ZSTD_updateDUBT()
57 U32* const nextCandidatePtr = bt + 2*(idx&btMask); in ZSTD_updateDUBT()
60 DEBUGLOG(8, "ZSTD_updateDUBT: insert %u", idx); in ZSTD_updateDUBT()
61 hashTable[h] = idx; /* Update Hash Table */ in ZSTD_updateDUBT()
419 U32 idx = ms->nextToUpdate; in ZSTD_dedicatedDictSearch_lazy_loadDictionary() local
420 U32 const minChain = chainSize < target - idx ? target - chainSize : idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
435 U32 const tmpMinChain = tmpChainSize < target ? target - tmpChainSize : idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
440 assert(idx != 0); in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
444 for ( ; idx < target; idx++) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
445 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch); in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
446 if (idx >= tmpMinChain) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
447 tmpChainTable[idx - tmpMinChain] = hashTable[h]; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
449 tmpHashTable[h] = idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
513 for (idx = ms->nextToUpdate; idx < target; idx++) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
514 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch) in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
520 hashTable[h] = idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
644 U32 idx = ms->nextToUpdate; in ZSTD_insertAndFindFirstIndex_internal() local
646 while(idx < target) { /* catch up */ in ZSTD_insertAndFindFirstIndex_internal()
647 size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls); in ZSTD_insertAndFindFirstIndex_internal()
648 NEXT_IN_CHAIN(idx, chainMask) = hashTable[h]; in ZSTD_insertAndFindFirstIndex_internal()
649 hashTable[h] = idx; in ZSTD_insertAndFindFirstIndex_internal()
650 idx++; in ZSTD_insertAndFindFirstIndex_internal()
840 U32 idx, const BYTE* const iLimit) in ZSTD_row_fillHashCache() argument
845 U32 const maxElemsToPrefetch = (base + idx) > iLimit ? 0 : (U32)(iLimit - (base + idx) + 1); in ZSTD_row_fillHashCache()
846 U32 const lim = idx + MIN(ZSTD_ROW_HASH_CACHE_SIZE, maxElemsToPrefetch); in ZSTD_row_fillHashCache()
848 for (; idx < lim; ++idx) { in ZSTD_row_fillHashCache()
849 …U32 const hash = (U32)ZSTD_hashPtrSalted(base + idx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls, ms->ha… in ZSTD_row_fillHashCache()
852 ms->hashCache[idx & ZSTD_ROW_HASH_CACHE_MASK] = hash; in ZSTD_row_fillHashCache()
868 U32 idx, U32 const hashLog, in ZSTD_row_nextCachedHash() argument
872 …U32 const newHash = (U32)ZSTD_hashPtrSalted(base+idx+ZSTD_ROW_HASH_CACHE_SIZE, hashLog + ZSTD_ROW_… in ZSTD_row_nextCachedHash()
875 { U32 const hash = cache[idx & ZSTD_ROW_HASH_CACHE_MASK]; in ZSTD_row_nextCachedHash()
876 cache[idx & ZSTD_ROW_HASH_CACHE_MASK] = newHash; in ZSTD_row_nextCachedHash()
921 U32 idx = ms->nextToUpdate; in ZSTD_row_update_internal() local
934 if (UNLIKELY(target - idx > kSkipThreshold)) { in ZSTD_row_update_internal()
935 U32 const bound = idx + kMaxMatchStartPositionsToUpdate; in ZSTD_row_update_internal()
936 ZSTD_row_update_internalImpl(ms, idx, bound, mls, rowLog, rowMask, useCache); in ZSTD_row_update_internal()
937 idx = target - kMaxMatchEndPositionsToUpdate; in ZSTD_row_update_internal()
938 ZSTD_row_fillHashCache(ms, base, rowLog, mls, idx, ip+1); in ZSTD_row_update_internal()
941 assert(target >= idx); in ZSTD_row_update_internal()
942 ZSTD_row_update_internalImpl(ms, idx, target, mls, rowLog, rowMask, useCache); in ZSTD_row_update_internal()