97         U32* const nextPtr = bt + 2*(matchIndex & btMask);  in ZSTD_insertDUBT1()  local
134                         matchIndex, btLow, nextPtr[1]);  in ZSTD_insertDUBT1()
135 …smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller t…  in ZSTD_insertDUBT1()
136 …matchIndex = nextPtr[1];              /* new matchIndex, larger than previous and closer to curren…  in ZSTD_insertDUBT1()
143                         matchIndex, btLow, nextPtr[0]);  in ZSTD_insertDUBT1()
144             largerPtr = nextPtr;  in ZSTD_insertDUBT1()
145             matchIndex = nextPtr[0];  in ZSTD_insertDUBT1()
189         U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask);  in ZSTD_DUBT_findBetterDictMatch()  local
211 …dictMatchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to curren…  in ZSTD_DUBT_findBetterDictMatch()
216             dictMatchIndex = nextPtr[0];  in ZSTD_DUBT_findBetterDictMatch()
313             U32* const nextPtr = bt + 2*(matchIndex & btMask);  in ZSTD_DUBT_findBestMatch()  local
347                 smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */  in ZSTD_DUBT_findBestMatch()
348 …matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */  in ZSTD_DUBT_findBestMatch()
354                 largerPtr = nextPtr;  in ZSTD_DUBT_findBestMatch()
355                 matchIndex = nextPtr[0];  in ZSTD_DUBT_findBestMatch()