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