zstd/compress/zstd_lazy.c

82     U32* smallerPtr = bt + 2*(curr&btMask);
83     U32* largerPtr  = smallerPtr + 1;
84     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) */
130             *smallerPtr = matchIndex;             /* update smaller idx */
132             if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
135             smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller than target */
148     *smallerPtr = *largerPtr = 0;
303         U32* smallerPtr = bt + 2*(curr&btMask);
344                 *smallerPtr = matchIndex;             /* update smaller idx */
346                 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
347                 smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
358         *smallerPtr = *largerPtr = 0;