Lines Matching full:split

89  * Registers in the splits array all the split points found in the first
291 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_fillHashTable() local
292 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_fillHashTable()
296 entry.offset = (U32)(split - base); in ZSTD_ldm_fillHashTable()
369 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_generateSequences_internal() local
370 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_generateSequences_internal()
373 candidates[n].split = split; in ZSTD_ldm_generateSequences_internal()
384 BYTE const* const split = candidates[n].split; in ZSTD_ldm_generateSequences_internal() local
392 newEntry.offset = (U32)(split - base); in ZSTD_ldm_generateSequences_internal()
395 /* If a split point would generate a sequence overlapping with in ZSTD_ldm_generateSequences_internal()
398 if (split < anchor) { in ZSTD_ldm_generateSequences_internal()
418 ZSTD_count_2segments(split, pMatch, iend, matchEnd, lowPrefixPtr); in ZSTD_ldm_generateSequences_internal()
423 split, anchor, pMatch, lowMatchPtr, dictStart, dictEnd); in ZSTD_ldm_generateSequences_internal()
426 curForwardMatchLength = ZSTD_count(split, pMatch, iend); in ZSTD_ldm_generateSequences_internal()
431 ZSTD_ldm_countBackwardsMatch(split, anchor, pMatch, lowPrefixPtr); in ZSTD_ldm_generateSequences_internal()
451 offset = (U32)(split - base) - bestEntry->offset; in ZSTD_ldm_generateSequences_internal()
459 seq->litLength = (U32)(split - backwardMatchLength - anchor); in ZSTD_ldm_generateSequences_internal()
469 anchor = split + forwardMatchLength; in ZSTD_ldm_generateSequences_internal()
556 * be split into two sequences. This condition holds when using in ZSTD_ldm_generateSequences()
613 * If the sequence length is longer than remaining then the sequence is split