Searched refs:nextToUpdate (Results 1 – 14 of 14) sorted by relevance
| /freebsd-14.2/sys/contrib/openzfs/module/zstd/lib/compress/ |
| H A D | zstd_opt.c | 490 U32 idx = ms->nextToUpdate; in ZSTD_updateTree_internal() 501 ms->nextToUpdate = target; in ZSTD_updateTree_internal() 634 ms->nextToUpdate = current+1; /* skip insertion */ in ZSTD_insertBtAndGetAllMatches() 737 ms->nextToUpdate = matchEndIdx - 8; /* skip repetitive patterns */ in ZSTD_insertBtAndGetAllMatches() 754 if (ip < ms->window.base + ms->nextToUpdate) return 0; /* skipped area */ in ZSTD_BtGetAllMatches() 815 U32 nextToUpdate3 = ms->nextToUpdate; in ZSTD_compressBlock_opt_generic() 823 (U32)(ip - base), ms->window.dictLimit, ms->nextToUpdate); in ZSTD_compressBlock_opt_generic() 1119 …assert(ms->window.dictLimit - ms->nextToUpdate <= 1); /* no prefix (note: intentional overflow, d… in ZSTD_initStats_ultra() 1128 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_initStats_ultra()
|
| H A D | zstd_ldm.c | 250 if (current > ms->nextToUpdate + 1024) { in ZSTD_ldm_limitTableUpdate() 251 ms->nextToUpdate = in ZSTD_ldm_limitTableUpdate() 252 current - MIN(512, current - ms->nextToUpdate - 1024); in ZSTD_ldm_limitTableUpdate()
|
| H A D | zstd_compress.c | 1301 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_invalidateMatchState() 1727 dstMatchState->nextToUpdate = srcMatchState->nextToUpdate; in ZSTD_resetCCtx_byCopyingCDict() 1818 dstMatchState->nextToUpdate = srcMatchState->nextToUpdate; in ZSTD_copyCCtx_internal() 2268 if (current > ms->nextToUpdate + 384) in ZSTD_buildSeqStore() 2269 ms->nextToUpdate = current - MIN(192, (U32)(current - ms->nextToUpdate - 384)); in ZSTD_buildSeqStore() 2428 (unsigned)zc->blockState.matchState.nextToUpdate); in ZSTD_compressBlock_internal() 2567 if (ms->nextToUpdate < correction) ms->nextToUpdate = 0; in ZSTD_overflowCorrectIfNeeded() 2568 else ms->nextToUpdate -= correction; in ZSTD_overflowCorrectIfNeeded() 2614 if (ms->nextToUpdate < ms->window.lowLimit) ms->nextToUpdate = ms->window.lowLimit; in ZSTD_compress_frameChunk() 2758 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_compressContinue_internal() [all …]
|
| H A D | zstd_lazy.c | 34 U32 idx = ms->nextToUpdate; in ZSTD_updateDUBT() 55 ms->nextToUpdate = target; in ZSTD_updateDUBT() 367 ms->nextToUpdate = matchEndIdx - 8; /* skip repetitive patterns */ in ZSTD_DUBT_findBestMatch() 387 if (ip < ms->window.base + ms->nextToUpdate) return 0; /* skipped area */ in ZSTD_BtFindBestMatch() 460 U32 idx = ms->nextToUpdate; in ZSTD_insertAndFindFirstIndex_internal() 469 ms->nextToUpdate = target; in ZSTD_insertAndFindFirstIndex_internal()
|
| H A D | zstd_fast.c | 24 const BYTE* ip = base + ms->nextToUpdate; in ZSTD_fillHashTable()
|
| H A D | zstd_double_fast.c | 25 const BYTE* ip = base + ms->nextToUpdate; in ZSTD_fillDoubleHashTable()
|
| H A D | zstd_compress_internal.h | 145 U32 nextToUpdate; /* index from which to continue table update */ member
|
| /freebsd-14.2/sys/contrib/zstd/lib/compress/ |
| H A D | zstd_opt.c | 537 U32 idx = ms->nextToUpdate; in ZSTD_updateTree_internal() 548 ms->nextToUpdate = target; in ZSTD_updateTree_internal() 681 ms->nextToUpdate = curr+1; /* skip insertion */ in ZSTD_insertBtAndGetAllMatches() 781 ms->nextToUpdate = matchEndIdx - 8; /* skip repetitive patterns */ in ZSTD_insertBtAndGetAllMatches() 809 if (ip < ms->window.base + ms->nextToUpdate) in ZSTD_btGetAllMatches_internal() 1058 U32 nextToUpdate3 = ms->nextToUpdate; in ZSTD_compressBlock_opt_generic() 1071 (U32)(ip - base), ms->window.dictLimit, ms->nextToUpdate); in ZSTD_compressBlock_opt_generic() 1367 …assert(ms->window.dictLimit - ms->nextToUpdate <= 1); /* no prefix (note: intentional overflow, d… in ZSTD_initStats_ultra() 1376 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_initStats_ultra()
|
| H A D | zstd_lazy.c | 34 U32 idx = ms->nextToUpdate; in ZSTD_updateDUBT() 55 ms->nextToUpdate = target; in ZSTD_updateDUBT() 405 U32 idx = ms->nextToUpdate; in ZSTD_dedicatedDictSearch_lazy_loadDictionary() 499 for (idx = ms->nextToUpdate; idx < target; idx++) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary() 509 ms->nextToUpdate = target; in ZSTD_dedicatedDictSearch_lazy_loadDictionary() 628 U32 idx = ms->nextToUpdate; in ZSTD_insertAndFindFirstIndex_internal() 637 ms->nextToUpdate = target; in ZSTD_insertAndFindFirstIndex_internal() 948 U32 idx = ms->nextToUpdate; in ZSTD_row_update_internal() 970 ms->nextToUpdate = target; in ZSTD_row_update_internal() 1223 row[pos] = ms->nextToUpdate++; in ZSTD_RowFindBestMatch() [all …]
|
| H A D | zstd_ldm.c | 315 if (curr > ms->nextToUpdate + 1024) { in ZSTD_ldm_limitTableUpdate() 316 ms->nextToUpdate = in ZSTD_ldm_limitTableUpdate() 317 curr - MIN(512, curr - ms->nextToUpdate - 1024); in ZSTD_ldm_limitTableUpdate()
|
| H A D | zstd_compress.c | 1686 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_invalidateMatchState() 2167 dstMatchState->nextToUpdate = srcMatchState->nextToUpdate; in ZSTD_resetCCtx_byCopyingCDict() 2269 dstMatchState->nextToUpdate = srcMatchState->nextToUpdate; in ZSTD_copyCCtx_internal() 2844 if (curr > ms->nextToUpdate + 384) in ZSTD_buildSeqStore() 2845 ms->nextToUpdate = curr - MIN(192, (U32)(curr - ms->nextToUpdate - 384)); in ZSTD_buildSeqStore() 3679 (unsigned)zc->blockState.matchState.nextToUpdate); in ZSTD_compressBlock_splitBlock_internal() 3917 if (ms->nextToUpdate < correction) ms->nextToUpdate = 0; in ZSTD_overflowCorrectIfNeeded() 3918 else ms->nextToUpdate -= correction; in ZSTD_overflowCorrectIfNeeded() 3965 if (ms->nextToUpdate < ms->window.lowLimit) ms->nextToUpdate = ms->window.lowLimit; in ZSTD_compress_frameChunk() 4138 ms->nextToUpdate = ms->window.dictLimit; in ZSTD_compressContinue_internal() [all …]
|
| H A D | zstd_fast.c | 24 const BYTE* ip = base + ms->nextToUpdate; in ZSTD_fillHashTable()
|
| H A D | zstd_double_fast.c | 25 const BYTE* ip = base + ms->nextToUpdate; in ZSTD_fillDoubleHashTable()
|
| H A D | zstd_compress_internal.h | 217 U32 nextToUpdate; /* index from which to continue table update */ member
|