18465     U32* smallerPtr = bt + 2*(current&btMask);  in ZSTD_insertDUBT1()  local
18466     U32* largerPtr  = smallerPtr + 1;  in ZSTD_insertDUBT1()
18467 …U32 matchIndex = *smallerPtr;   /* this candidate is unsorted : next sorted candidate is reached t…  in ZSTD_insertDUBT1()
18513             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertDUBT1()
18515 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertDUBT1()
18518 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertDUBT1()
18531     *smallerPtr = *largerPtr = 0;  in ZSTD_insertDUBT1()
18685         U32* smallerPtr = bt + 2*(current&btMask);  in ZSTD_DUBT_findBestMatch()  local
18726                 *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_DUBT_findBestMatch()
18728 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBestMatch()
18729                 smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_DUBT_findBestMatch()
18740         *smallerPtr = *largerPtr = 0;  in ZSTD_DUBT_findBestMatch()
20535     U32* smallerPtr = bt + 2*(current&btMask);  in ZSTD_insertBt1()  local
20536     U32* largerPtr  = smallerPtr + 1;  in ZSTD_insertBt1()
20564             *smallerPtr = matchIndex;  in ZSTD_insertBt1()
20565 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBt1()
20566             smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_insertBt1()
20604             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBt1()
20606 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertBt1()
20607 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertBt1()
20618     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBt1()
20683     U32* smallerPtr = bt + 2*(current&btMask);  in ZSTD_insertBtAndGetAllMatches()  local
20824             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBtAndGetAllMatches()
20826 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBtAndGetAllMatches()
20827 …smallerPtr = nextPtr+1;               /* new candidate => larger than match, which was smaller tha…  in ZSTD_insertBtAndGetAllMatches()
20837     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBtAndGetAllMatches()