Home
last modified time | relevance | path

Searched refs:matchIndex (Results 1 – 6 of 6) sorted by relevance

/linux-6.6.21/lib/zstd/compress/
Dzstd_lazy.c45 U32 const matchIndex = hashTable[h]; in ZSTD_updateDUBT() local
52 *nextCandidatePtr = matchIndex; /* update BT like a chain */ in ZSTD_updateDUBT()
84 …U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached t… in ZSTD_insertDUBT1() local
96 for (; nbCompares && (matchIndex > windowLow); --nbCompares) { in ZSTD_insertDUBT1()
97 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertDUBT1()
99 assert(matchIndex < curr); in ZSTD_insertDUBT1()
105 || (matchIndex+matchLength >= dictLimit) /* both in current segment*/ in ZSTD_insertDUBT1()
108 || (matchIndex+matchLength >= dictLimit)) ? in ZSTD_insertDUBT1()
110 …assert( (matchIndex+matchLength >= dictLimit) /* might be wrong if extDict is incorrectly set to… in ZSTD_insertDUBT1()
112 match = mBase + matchIndex; in ZSTD_insertDUBT1()
[all …]
Dzstd_opt.c424 U32 matchIndex = hashTable[h]; in ZSTD_insertBt1() local
458 for (; nbCompares && (matchIndex >= windowLow); --nbCompares) { in ZSTD_insertBt1()
459 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1()
461 assert(matchIndex < curr); in ZSTD_insertBt1()
464 …const U32* predictPtr = bt + 2*((matchIndex-1) & btMask); /* written this way, as bt is a roll b… in ZSTD_insertBt1()
465 if (matchIndex == predictedSmall) { in ZSTD_insertBt1()
467 *smallerPtr = matchIndex; in ZSTD_insertBt1()
468 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_insertBt1()
470matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */ in ZSTD_insertBt1()
474 if (matchIndex == predictedLarge) { in ZSTD_insertBt1()
[all …]
Dzstd_fast.c429 U32 const matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_dictMatchState_generic() local
430 const BYTE* match = base + matchIndex; in ZSTD_compressBlock_fast_dictMatchState_generic()
443 } else if ( (matchIndex <= prefixStartIndex) ) { in ZSTD_compressBlock_fast_dictMatchState_generic()
585 const U32 matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_extDict_generic() local
586 const BYTE* const matchBase = matchIndex < prefixStartIndex ? dictBase : base; in ZSTD_compressBlock_fast_extDict_generic()
587 const BYTE* match = matchBase + matchIndex; in ZSTD_compressBlock_fast_extDict_generic()
605 if ( (matchIndex < dictStartIndex) || in ZSTD_compressBlock_fast_extDict_generic()
611 { const BYTE* const matchEnd = matchIndex < prefixStartIndex ? dictEnd : iend; in ZSTD_compressBlock_fast_extDict_generic()
612 … const BYTE* const lowMatchPtr = matchIndex < prefixStartIndex ? dictStart : prefixStart; in ZSTD_compressBlock_fast_extDict_generic()
613 U32 const offset = curr - matchIndex; in ZSTD_compressBlock_fast_extDict_generic()
Dzstd_double_fast.c566 const U32 matchIndex = hashSmall[hSmall]; in ZSTD_compressBlock_doubleFast_extDict_generic() local
567 const BYTE* const matchBase = matchIndex < prefixStartIndex ? dictBase : base; in ZSTD_compressBlock_doubleFast_extDict_generic()
568 const BYTE* match = matchBase + matchIndex; in ZSTD_compressBlock_doubleFast_extDict_generic()
601 } else if ((matchIndex > dictStartIndex) && (MEM_read32(match) == MEM_read32(ip))) { in ZSTD_compressBlock_doubleFast_extDict_generic()
616 const BYTE* const matchEnd = matchIndex < prefixStartIndex ? dictEnd : iend; in ZSTD_compressBlock_doubleFast_extDict_generic()
617 … const BYTE* const lowMatchPtr = matchIndex < prefixStartIndex ? dictStart : prefixStart; in ZSTD_compressBlock_doubleFast_extDict_generic()
619 offset = curr - matchIndex; in ZSTD_compressBlock_doubleFast_extDict_generic()
/linux-6.6.21/lib/lz4/
Dlz4hc_compress.c114 U32 matchIndex; in LZ4HC_InsertAndFindBestMatch() local
120 matchIndex = HashTable[LZ4HC_hashPtr(ip)]; in LZ4HC_InsertAndFindBestMatch()
122 while ((matchIndex >= lowLimit) in LZ4HC_InsertAndFindBestMatch()
125 if (matchIndex >= dictLimit) { in LZ4HC_InsertAndFindBestMatch()
126 const BYTE * const match = base + matchIndex; in LZ4HC_InsertAndFindBestMatch()
139 const BYTE * const match = dictBase + matchIndex; in LZ4HC_InsertAndFindBestMatch()
144 + (dictLimit - matchIndex); in LZ4HC_InsertAndFindBestMatch()
158 *matchpos = base + matchIndex; in LZ4HC_InsertAndFindBestMatch()
162 matchIndex -= DELTANEXTU16(matchIndex); in LZ4HC_InsertAndFindBestMatch()
187 U32 matchIndex; in LZ4HC_InsertAndGetWiderMatch() local
[all …]
/linux-6.6.21/drivers/net/wireless/ath/ath9k/
Deeprom.c289 int matchIndex = -1, lowIndex = -1; in ath9k_hw_get_legacy_target_powers() local
297 matchIndex = 0; in ath9k_hw_get_legacy_target_powers()
303 matchIndex = i; in ath9k_hw_get_legacy_target_powers()
313 if ((matchIndex == -1) && (lowIndex == -1)) in ath9k_hw_get_legacy_target_powers()
314 matchIndex = i - 1; in ath9k_hw_get_legacy_target_powers()
317 if (matchIndex != -1) { in ath9k_hw_get_legacy_target_powers()
318 *pNewPower = powInfo[matchIndex]; in ath9k_hw_get_legacy_target_powers()
344 int matchIndex = -1, lowIndex = -1; in ath9k_hw_get_target_powers() local
351 matchIndex = 0; in ath9k_hw_get_target_powers()
357 matchIndex = i; in ath9k_hw_get_target_powers()
[all …]