HomeSort by: relevance | last modified time | path
    Searched refs:smallerPtr (Results 1 - 2 of 2) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/compress/
zstd_opt.c 465 U32* smallerPtr = bt + 2*(curr&btMask);
466 U32* largerPtr = smallerPtr + 1;
498 *smallerPtr = matchIndex;
499 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
500 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */
538 *smallerPtr = matchIndex; /* update smaller idx */
540 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */
541 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
552 *smallerPtr = *largerPtr = 0;
621 U32* smallerPtr = bt + 2*(curr&btMask)
    [all...]
zstd_lazy.c 92 U32* smallerPtr = bt + 2*(curr&btMask);
93 U32* largerPtr = smallerPtr + 1;
94 U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *largerPtr contains previous unsorted candidate (which is already saved and can be overwritten) */
140 *smallerPtr = matchIndex; /* update smaller idx */
142 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */
145 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
158 *smallerPtr = *largerPtr = 0;
315 U32* smallerPtr = bt + 2*(curr&btMask);
356 *smallerPtr = matchIndex; /* update smaller idx *
    [all...]

Completed in 15 milliseconds