82     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()
135 …smallerPtr = 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()
347                 smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_DUBT_findBestMatch()
358         *smallerPtr = *largerPtr = 0;  in ZSTD_DUBT_findBestMatch()