93     U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_insertDUBT1()  local
94     U32* largerPtr  = smallerPtr + 1;  in ZSTD_insertDUBT1()
95 …U32 matchIndex = *smallerPtr;   /* this candidate is unsorted : next sorted candidate is reached t…  in ZSTD_insertDUBT1()
141             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertDUBT1()
143 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertDUBT1()
146 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertDUBT1()
159     *smallerPtr = *largerPtr = 0;  in ZSTD_insertDUBT1()
316         U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_DUBT_findBestMatch()  local
357                 *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_DUBT_findBestMatch()
359 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBestMatch()
360                 smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_DUBT_findBestMatch()
371         *smallerPtr = *largerPtr = 0;  in ZSTD_DUBT_findBestMatch()