28     U32* const bt = ms->chainTable;  in ZSTD_updateDUBT()
70     U32* const bt = ms->chainTable;  in ZSTD_insertDUBT1()
178     U32*        const dictBt = dms->chainTable;  in ZSTD_DUBT_findBetterDictMatch()
247     U32*   const bt = ms->chainTable;  in ZSTD_DUBT_findBestMatch()
403     U32* const chainTable = ms->chainTable;  in ZSTD_dedicatedDictSearch_lazy_loadDictionary()  local
468                     chainTable[chainPos++] = i;  in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
539         PREFETCH_L1(&dms->chainTable[chainIndex]);  in ZSTD_dedicatedDictSearch_lazy_search()
581             PREFETCH_L1(ddsBase + dms->chainTable[chainIndex + chainAttempt]);  in ZSTD_dedicatedDictSearch_lazy_search()
587             matchIndex = dms->chainTable[chainIndex];  in ZSTD_dedicatedDictSearch_lazy_search()
613 #define NEXT_IN_CHAIN(d, mask)   chainTable[(d) & (mask)]
624     U32* const chainTable = ms->chainTable;  in ZSTD_insertAndFindFirstIndex_internal()  local
655     U32* const chainTable = ms->chainTable;  in ZSTD_HcFindBestMatch()  local
719         const U32* const dmsChainTable = dms->chainTable;  in ZSTD_HcFindBestMatch()