liblzma/lz/lz_encoder_mf.c

18 /// \brief      Find matches starting from the current byte
22 lzma_mf_find(lzma_mf *mf, uint32_t *count_ptr, lzma_match *matches)
27 	const uint32_t count = mf->find(mf, matches);
29 	// Length of the longest match; assume that no matches were found
35 		// Validate the matches.
37 			assert(matches[i].len <= mf->nice_len);
38 			assert(matches[i].dist < mf->read_pos);
40 				mf_ptr(mf) - matches[i].dist - 2,
41 				matches[i].len) == 0);
47 		len_best = matches[count - 1].len;
66 			const uint8_t *p2 = p1 - matches[count - 1].dist - 1;
98 /// is lzma_mf.offset + lzma_mf.read_pos. The distances of the matches are
204 /// Header for find functions. "return 0" indicates that zero matches
218 /// of matches found. Updates the dictionary position and returns the number
219 /// of matches found.
225 				matches + matches_count, len_best) \
226 			- matches); \
239 /// \param      len_limit       Don't look for matches longer than len_limit.
247 /// \param      matches         Array to hold the matches.
259 		lzma_match *matches,
267 			return matches;
278 				matches->len = len;
279 				matches->dist = delta - 1;
280 				++matches;
283 					return matches;
305 lzma_mf_hc3_find(lzma_mf *mf, lzma_match *matches)
323 		matches[0].len = len_best;
324 		matches[0].dist = delta2 - 1;
366 lzma_mf_hc4_find(lzma_mf *mf, lzma_match *matches)
385 		matches[0].len = 2;
386 		matches[0].dist = delta2 - 1;
393 		matches[matches_count++].dist = delta3 - 1;
401 		matches[matches_count - 1].len = len_best;
459 		lzma_match *matches,
473 			return matches;
488 				matches->len = len;
489 				matches->dist = delta - 1;
490 				++matches;
495 					return matches;
587 lzma_mf_bt2_find(lzma_mf *mf, lzma_match *matches)
620 lzma_mf_bt3_find(lzma_mf *mf, lzma_match *matches)
638 		matches[0].len = len_best;
639 		matches[0].dist = delta2 - 1;
675 lzma_mf_bt4_find(lzma_mf *mf, lzma_match *matches)
694 		matches[0].len = 2;
695 		matches[0].dist = delta2 - 1;
702 		matches[matches_count++].dist = delta3 - 1;
710 		matches[matches_count - 1].len = len_best;