HomeSort by: relevance | last modified time | path
    Searched refs:btMask (Results 1 - 2 of 2) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/compress/
zstd_opt.c 454 U32 const btMask = (1 << btLog) - 1;
464 const U32 btLow = btMask >= curr ? 0 : curr - btMask;
465 U32* smallerPtr = bt + 2*(curr&btMask);
476 U32 predictedSmall = *(bt + 2*((curr-1)&btMask) + 0);
477 U32 predictedLarge = *(bt + 2*((curr-1)&btMask) + 1);
490 U32* const nextPtr = bt + 2*(matchIndex & btMask);
495 const U32* predictPtr = bt + 2*((matchIndex-1) & btMask); /* written this way, as bt is a roll buffer */
612 U32 const btMask= (1U << btLog) - 1;
618 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask
    [all...]
zstd_lazy.c 39 U32 const btMask = (1 << btLog) - 1;
56 U32* const nextCandidatePtr = bt + 2*(idx&btMask);
70 * assumption : curr >= btlow == (curr - btmask)
82 U32 const btMask = (1 << btLog) - 1;
92 U32* smallerPtr = bt + 2*(curr&btMask);
107 U32* const nextPtr = bt + 2*(matchIndex & btMask);
191 U32 const btMask = (1 << btLog) - 1;
192 U32 const btLow = (btMask >= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit - btMask;
200 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask);
    [all...]

Completed in 22 milliseconds