Searched refs:nextPtr (Results 1 - 2 of 2) sorted by path

/linux-master/lib/zstd/compress/
H A Dzstd_lazy.c97 U32* const nextPtr = bt + 2*(matchIndex & btMask); local
101 * but it's still possible to have nextPtr[1] == ZSTD_DUBT_UNSORTED_MARK
134 matchIndex, btLow, nextPtr[1]);
135 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
136 matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to current */
143 matchIndex, btLow, nextPtr[0]);
144 largerPtr = nextPtr;
145 matchIndex = nextPtr[0];
189 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); local
211 dictMatchIndex = nextPtr[
313 U32* const nextPtr = bt + 2*(matchIndex & btMask); local
[all...]
H A Dzstd_opt.c459 U32* const nextPtr = bt + 2*(matchIndex & btMask); local
469 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */
470 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */
477 largerPtr = nextPtr;
478 matchIndex = nextPtr[0];
510 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
511 matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to current */
517 largerPtr = nextPtr;
518 matchIndex = nextPtr[0];
690 U32* const nextPtr local
748 const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask); local
[all...]

Completed in 198 milliseconds