Lines Matching full:split

90  * Registers in the splits array all the split points found in the first
311 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_fillHashTable() local
312 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_fillHashTable()
316 entry.offset = (U32)(split - base); in ZSTD_ldm_fillHashTable()
391 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_generateSequences_internal() local
392 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_generateSequences_internal()
395 candidates[n].split = split; in ZSTD_ldm_generateSequences_internal()
406 BYTE const* const split = candidates[n].split; in ZSTD_ldm_generateSequences_internal() local
414 newEntry.offset = (U32)(split - base); in ZSTD_ldm_generateSequences_internal()
417 /* If a split point would generate a sequence overlapping with in ZSTD_ldm_generateSequences_internal()
420 if (split < anchor) { in ZSTD_ldm_generateSequences_internal()
440 ZSTD_count_2segments(split, pMatch, iend, matchEnd, lowPrefixPtr); in ZSTD_ldm_generateSequences_internal()
445 split, anchor, pMatch, lowMatchPtr, dictStart, dictEnd); in ZSTD_ldm_generateSequences_internal()
448 curForwardMatchLength = ZSTD_count(split, pMatch, iend); in ZSTD_ldm_generateSequences_internal()
453 ZSTD_ldm_countBackwardsMatch(split, anchor, pMatch, lowPrefixPtr); in ZSTD_ldm_generateSequences_internal()
473 offset = (U32)(split - base) - bestEntry->offset; in ZSTD_ldm_generateSequences_internal()
481 seq->litLength = (U32)(split - backwardMatchLength - anchor); in ZSTD_ldm_generateSequences_internal()
491 anchor = split + forwardMatchLength; in ZSTD_ldm_generateSequences_internal()
578 * be split into two sequences. This condition holds when using in ZSTD_ldm_generateSequences()
635 * If the sequence length is longer than remaining then the sequence is split