Home
last modified time | relevance | path

Searched refs:btMask (Results 1 – 2 of 2) sorted by relevance

/linux/lib/zstd/compress/
H A Dzstd_opt.c423 U32 const btMask = (1 << btLog) - 1; in ZSTD_insertBt1() local
433 const U32 btLow = btMask >= curr ? 0 : curr - btMask; in ZSTD_insertBt1()
434 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBt1()
445 U32 predictedSmall = *(bt + 2*((curr-1)&btMask) + 0); in ZSTD_insertBt1()
446 U32 predictedLarge = *(bt + 2*((curr-1)&btMask) + 1); in ZSTD_insertBt1()
459 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1()
577 U32 const btMask= (1U << btLog) - 1; in ZSTD_insertBtAndGetAllMatches() local
583 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_insertBtAndGetAllMatches()
586 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBtAndGetAllMatches()
587 U32* largerPtr = bt + 2*(curr&btMask) + 1; in ZSTD_insertBtAndGetAllMatches()
[all …]
H A Dzstd_lazy.c30 U32 const btMask = (1 << btLog) - 1; in ZSTD_updateDUBT() local
72 U32 const btMask = (1 << btLog) - 1; in ZSTD_insertDUBT1() local
82 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertDUBT1()
180 U32 const btMask = (1 << btLog) - 1; in ZSTD_DUBT_findBetterDictMatch() local
181 …U32 const btLow = (btMask >= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit … in ZSTD_DUBT_findBetterDictMatch()
249 U32 const btMask = (1 << btLog) - 1; in ZSTD_DUBT_findBestMatch() local
250 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_DUBT_findBestMatch()
272 nextCandidate = bt + 2*(matchIndex&btMask); in ZSTD_DUBT_findBestMatch()
273 unsortedMark = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch()
303 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_DUBT_findBestMatch()
[all …]