Lines Matching refs:zc
215 U32 ZSTD_insertAndFindFirstIndexHash3(ZSTD_CCtx *zc, const BYTE *ip) in ZSTD_insertAndFindFirstIndexHash3() argument
217 U32 *const hashTable3 = zc->hashTable3; in ZSTD_insertAndFindFirstIndexHash3()
218 U32 const hashLog3 = zc->hashLog3; in ZSTD_insertAndFindFirstIndexHash3()
219 const BYTE *const base = zc->base; in ZSTD_insertAndFindFirstIndexHash3()
220 U32 idx = zc->nextToUpdate3; in ZSTD_insertAndFindFirstIndexHash3()
221 const U32 target = zc->nextToUpdate3 = (U32)(ip - base); in ZSTD_insertAndFindFirstIndexHash3()
235 static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLi… in ZSTD_insertBtAndGetAllMatches() argument
238 const BYTE *const base = zc->base; in ZSTD_insertBtAndGetAllMatches()
240 const U32 hashLog = zc->params.cParams.hashLog; in ZSTD_insertBtAndGetAllMatches()
242 U32 *const hashTable = zc->hashTable; in ZSTD_insertBtAndGetAllMatches()
244 U32 *const bt = zc->chainTable; in ZSTD_insertBtAndGetAllMatches()
245 const U32 btLog = zc->params.cParams.chainLog - 1; in ZSTD_insertBtAndGetAllMatches()
248 const BYTE *const dictBase = zc->dictBase; in ZSTD_insertBtAndGetAllMatches()
249 const U32 dictLimit = zc->dictLimit; in ZSTD_insertBtAndGetAllMatches()
253 const U32 windowLow = zc->lowLimit; in ZSTD_insertBtAndGetAllMatches()
264 U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3(zc, ip); in ZSTD_insertBtAndGetAllMatches()
351 zc->nextToUpdate = (matchEndIdx > curr + 8) ? matchEndIdx - 8 : curr + 1; in ZSTD_insertBtAndGetAllMatches()
356 static U32 ZSTD_BtGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, cons… in ZSTD_BtGetAllMatches() argument
359 if (ip < zc->base + zc->nextToUpdate) in ZSTD_BtGetAllMatches()
361 ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtGetAllMatches()
362 return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen); in ZSTD_BtGetAllMatches()
365 static U32 ZSTD_BtGetAllMatches_selectMLS(ZSTD_CCtx *zc, /* Index table will be updated */ in ZSTD_BtGetAllMatches_selectMLS() argument
370 case 3: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
372 case 4: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
373 case 5: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
375 case 6: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen); in ZSTD_BtGetAllMatches_selectMLS()
380 static U32 ZSTD_BtGetAllMatches_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLim… in ZSTD_BtGetAllMatches_extDict() argument
383 if (ip < zc->base + zc->nextToUpdate) in ZSTD_BtGetAllMatches_extDict()
385 ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtGetAllMatches_extDict()
386 return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen); in ZSTD_BtGetAllMatches_extDict()
389 static U32 ZSTD_BtGetAllMatches_selectMLS_extDict(ZSTD_CCtx *zc, /* Index table will be updated */ in ZSTD_BtGetAllMatches_selectMLS_extDict() argument
394 …case 3: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatc… in ZSTD_BtGetAllMatches_selectMLS_extDict()
396 …case 4: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatc… in ZSTD_BtGetAllMatches_selectMLS_extDict()
397 …case 5: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatc… in ZSTD_BtGetAllMatches_selectMLS_extDict()
399 …case 6: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatc… in ZSTD_BtGetAllMatches_selectMLS_extDict()