82     const BYTE* const ip,  in LZ4HC_BinTree_InsertAndGetAllMatches()
83     const BYTE* const iHighLimit,  in LZ4HC_BinTree_InsertAndGetAllMatches()
90     const BYTE* const base = ctx->base;  in LZ4HC_BinTree_InsertAndGetAllMatches()
94     const BYTE* const dictBase = ctx->dictBase;  in LZ4HC_BinTree_InsertAndGetAllMatches()
95     const BYTE* match;  in LZ4HC_BinTree_InsertAndGetAllMatches()
120             const BYTE* vLimit = ip + (dictLimit - matchIndex);  in LZ4HC_BinTree_InsertAndGetAllMatches()
170 FORCE_INLINE void LZ4HC_updateBinTree(LZ4HC_CCtx_internal* ctx, const BYTE* const ip, const BYTE* c…  in LZ4HC_updateBinTree()
172     const BYTE* const base = ctx->base;  in LZ4HC_updateBinTree()
183                         const BYTE* const ip, const BYTE* const iHighLimit,  in LZ4HC_BinTree_GetAllMatches()
218     const BYTE *inr = NULL;  in LZ4HC_compress_optimal()
222     const BYTE* ip = (const BYTE*) source;  in LZ4HC_compress_optimal()
223     const BYTE* anchor = ip;  in LZ4HC_compress_optimal()
224     const BYTE* const iend = ip + inputSize;  in LZ4HC_compress_optimal()
225     const BYTE* const mflimit = iend - MFLIMIT;  in LZ4HC_compress_optimal()
226     const BYTE* const matchlimit = (iend - LASTLITERALS);  in LZ4HC_compress_optimal()
227     BYTE* op = (BYTE*) dest;  in LZ4HC_compress_optimal()
228     BYTE* const oend = op + maxOutputSize;  in LZ4HC_compress_optimal()
355 …ITS); lastRun-=RUN_MASK; for(; lastRun > 254 ; lastRun-=255) *op++ = 255; *op++ = (BYTE) lastRun; }  in LZ4HC_compress_optimal()
356         else *op++ = (BYTE)(lastRun<<ML_BITS);  in LZ4HC_compress_optimal()