Home
last modified time | relevance | path

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

/linux/lib/zstd/compress/
H A Dzstd_opt.c491 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1() local
501 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
502 …matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */ in ZSTD_insertBt1()
509 largerPtr = nextPtr; in ZSTD_insertBt1()
510 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
542 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertBt1()
543 …matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to curren… in ZSTD_insertBt1()
549 largerPtr = nextPtr; in ZSTD_insertBt1()
550 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
726 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBtAndGetAllMatches() local
[all …]
H A Dzstd_lazy.c108 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertDUBT1() local
145 matchIndex, btLow, nextPtr[1]); in ZSTD_insertDUBT1()
146 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertDUBT1()
147 …matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to curren… in ZSTD_insertDUBT1()
154 matchIndex, btLow, nextPtr[0]); in ZSTD_insertDUBT1()
155 largerPtr = nextPtr; in ZSTD_insertDUBT1()
156 matchIndex = nextPtr[0]; in ZSTD_insertDUBT1()
201 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); in ZSTD_DUBT_findBetterDictMatch() local
223 …dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_DUBT_findBetterDictMatch()
228 dictMatchIndex = nextPtr[0]; in ZSTD_DUBT_findBetterDictMatch()
[all …]