Home
last modified time | relevance | path

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

/src/sys/contrib/zstd/lib/compress/
H A Dzstd_lazy.c254 U32* unsortedMark = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch() local
265 && (*unsortedMark == ZSTD_DUBT_UNSORTED_MARK) in ZSTD_DUBT_findBestMatch()
269 …*unsortedMark = previousCandidate; /* the unsortedMark becomes a reversed chain, to move up back … in ZSTD_DUBT_findBestMatch()
273 unsortedMark = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch()
280 && (*unsortedMark==ZSTD_DUBT_UNSORTED_MARK) ) { in ZSTD_DUBT_findBestMatch()
283 *nextCandidate = *unsortedMark = 0; in ZSTD_DUBT_findBestMatch()
/src/sys/contrib/openzfs/module/zstd/lib/compress/
H A Dzstd_lazy.c267 U32* unsortedMark = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch() local
278 && (*unsortedMark == ZSTD_DUBT_UNSORTED_MARK) in ZSTD_DUBT_findBestMatch()
282 …*unsortedMark = previousCandidate; /* the unsortedMark becomes a reversed chain, to move up back … in ZSTD_DUBT_findBestMatch()
286 unsortedMark = bt + 2*(matchIndex&btMask) + 1; in ZSTD_DUBT_findBestMatch()
293 && (*unsortedMark==ZSTD_DUBT_UNSORTED_MARK) ) { in ZSTD_DUBT_findBestMatch()
296 *nextCandidate = *unsortedMark = 0; in ZSTD_DUBT_findBestMatch()