Home
last modified time | relevance | path

Searched refs:nextPtr (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-6.6/lib/zstd/compress/
H A Dzstd_opt.c459 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1() local
469 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
470 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */ in ZSTD_insertBt1()
477 largerPtr = nextPtr; in ZSTD_insertBt1()
478 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
510 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */ in ZSTD_insertBt1()
511 matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to current */ in ZSTD_insertBt1()
517 largerPtr = nextPtr; in ZSTD_insertBt1()
518 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
690 U32* const nextPtr in ZSTD_insertBtAndGetAllMatches() local
748 const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask); ZSTD_insertBtAndGetAllMatches() local
[all...]
H A Dzstd_lazy.c97 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertDUBT1() local
101 * but it's still possible to have nextPtr[1] == ZSTD_DUBT_UNSORTED_MARK in ZSTD_insertDUBT1()
134 matchIndex, btLow, nextPtr[1]); in ZSTD_insertDUBT1()
135 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */ in ZSTD_insertDUBT1()
136 matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to current */ in ZSTD_insertDUBT1()
143 matchIndex, btLow, nextPtr[0]); in ZSTD_insertDUBT1()
144 largerPtr = nextPtr; in ZSTD_insertDUBT1()
145 matchIndex = nextPtr[0]; in ZSTD_insertDUBT1()
189 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); in ZSTD_DUBT_findBetterDictMatch() local
211 dictMatchIndex = nextPtr[ in ZSTD_DUBT_findBetterDictMatch()
313 U32* const nextPtr = bt + 2*(matchIndex & btMask); ZSTD_DUBT_findBestMatch() local
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H A Dzstd_opt.h296 U32 *nextPtr = bt + 2 * (matchIndex & btMask); in ZSTD_insertBtAndGetAllMatches() local
333 smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */ in ZSTD_insertBtAndGetAllMatches()
334 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curr) */ in ZSTD_insertBtAndGetAllMatches()
343 largerPtr = nextPtr; in ZSTD_insertBtAndGetAllMatches()
344 matchIndex = nextPtr[0]; in ZSTD_insertBtAndGetAllMatches()
H A Dcompress.c1589 U32 *const nextPtr = bt + 2 * (matchIndex & btMask); in ZSTD_insertBt1() local
1620 smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
1621 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curr) */ in ZSTD_insertBt1()
1630 largerPtr = nextPtr; in ZSTD_insertBt1()
1631 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
1671 U32 *const nextPtr = bt + 2 * (matchIndex & btMask); in ZSTD_insertBtAndFindBestMatch() local
1703 smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */ in ZSTD_insertBtAndFindBestMatch()
1704 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curr) */ in ZSTD_insertBtAndFindBestMatch()
1713 largerPtr = nextPtr; in ZSTD_insertBtAndFindBestMatch()
1714 matchIndex = nextPtr[ in ZSTD_insertBtAndFindBestMatch()
[all...]

Completed in 11 milliseconds