77                  U32 nbCompares, U32 btLow,  in ZSTD_insertDUBT1()  argument
104     assert(curr >= btLow);  in ZSTD_insertDUBT1()
143 …  if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertDUBT1()
145                         matchIndex, btLow, nextPtr[1]);  in ZSTD_insertDUBT1()
152 …   if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop searching */  in ZSTD_insertDUBT1()
154                         matchIndex, btLow, nextPtr[0]);  in ZSTD_insertDUBT1()
193 …U32         const btLow = (btMask >= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit …  in ZSTD_DUBT_findBetterDictMatch()  local
221             if (dictMatchIndex <= btLow) { break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBetterDictMatch()
226             if (dictMatchIndex <= btLow) { break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBetterDictMatch()
263     U32    const btLow = (btMask >= curr) ? 0 : curr - btMask;  in ZSTD_DUBT_findBestMatch()  local
264     U32    const unsortLimit = MAX(btLow, windowLow);  in ZSTD_DUBT_findBestMatch()
359 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBestMatch()
366 …  if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBestMatch()