391     U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_insertBt1()  local
392     U32* largerPtr  = smallerPtr + 1;  in ZSTD_insertBt1()
420             *smallerPtr = matchIndex;  in ZSTD_insertBt1()
421 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBt1()
422             smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_insertBt1()
460             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBt1()
462 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertBt1()
463 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertBt1()
474     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBt1()
539     U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_insertBtAndGetAllMatches()  local
680             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBtAndGetAllMatches()
682 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBtAndGetAllMatches()
683 …smallerPtr = nextPtr+1;               /* new candidate => larger than match, which was smaller tha…  in ZSTD_insertBtAndGetAllMatches()
693     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBtAndGetAllMatches()