Lines Matching refs:btMask
30 U32 const btMask = (1 << btLog) - 1; in ZSTD_updateDUBT() local
47 U32* const nextCandidatePtr = bt + 2*(idx&btMask); in ZSTD_updateDUBT()
72 U32 const btMask = (1 << btLog) - 1; in ZSTD_insertDUBT1() local
82 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertDUBT1()
97 U32* const nextPtr = bt + 2*(matchIndex & 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()
189 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); 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()
253 U32* nextCandidate = bt + 2*(matchIndex&btMask); in ZSTD_DUBT_findBestMatch()
254 U32* unsortedMark = bt + 2*(matchIndex&btMask) + 1; 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()
289 U32* const nextCandidateIdxPtr = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch()
303 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_DUBT_findBestMatch()
304 U32* largerPtr = bt + 2*(curr&btMask) + 1; in ZSTD_DUBT_findBestMatch()
313 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_DUBT_findBestMatch()