Home
last modified time | relevance | path

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

/linux-6.1.9/lib/zstd/compress/
Dzstd_opt.c403 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBt1() local
404 U32* largerPtr = smallerPtr + 1; in ZSTD_insertBt1()
432 *smallerPtr = matchIndex; in ZSTD_insertBt1()
433 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_insertBt1()
434 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
472 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertBt1()
474 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertBt1()
475smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertBt1()
486 *smallerPtr = *largerPtr = 0; in ZSTD_insertBt1()
551 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBtAndGetAllMatches() local
[all …]
Dzstd_lazy.c82 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertDUBT1() local
83 U32* largerPtr = smallerPtr + 1; in ZSTD_insertDUBT1()
84 …U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached t… in ZSTD_insertDUBT1()
130 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertDUBT1()
132 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertDUBT1()
135smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertDUBT1()
148 *smallerPtr = *largerPtr = 0; in ZSTD_insertDUBT1()
303 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_DUBT_findBestMatch() local
344 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_DUBT_findBestMatch()
346 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBestMatch()
[all …]