403     U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_insertBt1()  local
404     U32* largerPtr  = smallerPtr + 1;  in ZSTD_insertBt1()
432             *smallerPtr = matchIndex;  in ZSTD_insertBt1()
433 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBt1()
434             smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_insertBt1()
472             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBt1()
474 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertBt1()
475 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertBt1()
486     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBt1()
551     U32* smallerPtr = bt + 2*(curr&btMask);  in ZSTD_insertBtAndGetAllMatches()  local
692             *smallerPtr = matchIndex;             /* update smaller idx */  in ZSTD_insertBtAndGetAllMatches()
694 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_insertBtAndGetAllMatches()
695 …smallerPtr = nextPtr+1;               /* new candidate => larger than match, which was smaller tha…  in ZSTD_insertBtAndGetAllMatches()
705     *smallerPtr = *largerPtr = 0;  in ZSTD_insertBtAndGetAllMatches()