Lines Matching refs:matches
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;
100 /// is lzma_mf.offset + lzma_mf.read_pos. The distances of the matches are
203 /// Header for find functions. "return 0" indicates that zero matches
217 /// of matches found. Updates the dictionary position and returns the number
218 /// of matches found.
223 matches + matches_count, len_best) \
224 - matches; \
237 /// \param len_limit Don't look for matches longer than len_limit.
245 /// \param matches Array to hold the matches.
257 lzma_match *matches,
265 return matches;
279 matches->len = len;
280 matches->dist = delta - 1;
281 ++matches;
284 return matches;
306 lzma_mf_hc3_find(lzma_mf *mf, lzma_match *matches)
325 matches[0].len = len_best;
326 matches[0].dist = delta2 - 1;
368 lzma_mf_hc4_find(lzma_mf *mf, lzma_match *matches)
387 matches[0].len = 2;
388 matches[0].dist = delta2 - 1;
395 matches[matches_count++].dist = delta3 - 1;
404 matches[matches_count - 1].len = len_best;
462 lzma_match *matches,
476 return matches;
493 matches->len = len;
494 matches->dist = delta - 1;
495 ++matches;
500 return matches;
594 lzma_mf_bt2_find(lzma_mf *mf, lzma_match *matches)
627 lzma_mf_bt3_find(lzma_mf *mf, lzma_match *matches)
646 matches[0].len = len_best;
647 matches[0].dist = delta2 - 1;
683 lzma_mf_bt4_find(lzma_mf *mf, lzma_match *matches)
702 matches[0].len = 2;
703 matches[0].dist = delta2 - 1;
710 matches[matches_count++].dist = delta3 - 1;
719 matches[matches_count - 1].len = len_best;