Searched refs:btMask (Results 1 – 2 of 2) sorted by relevance
30 U32 const btMask = (1 << btLog) - 1; in ZSTD_updateDUBT() local47 U32* const nextCandidatePtr = bt + 2*(idx&btMask); in ZSTD_updateDUBT()72 U32 const btMask = (1 << btLog) - 1; in ZSTD_insertDUBT1() local82 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() local181 …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() local250 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_DUBT_findBestMatch()[all …]
392 U32 const btMask = (1 << btLog) - 1; in ZSTD_insertBt1() local402 const U32 btLow = btMask >= curr ? 0 : curr - btMask; in ZSTD_insertBt1()403 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBt1()411 U32 predictedSmall = *(bt + 2*((curr-1)&btMask) + 0); in ZSTD_insertBt1()412 U32 predictedLarge = *(bt + 2*((curr-1)&btMask) + 1); in ZSTD_insertBt1()424 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1()429 …const U32* predictPtr = bt + 2*((matchIndex-1) & btMask); /* written this way, as bt is a roll b… in ZSTD_insertBt1()542 U32 const btMask= (1U << btLog) - 1; in ZSTD_insertBtAndGetAllMatches() local548 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_insertBtAndGetAllMatches()551 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBtAndGetAllMatches()[all …]