Lines Matching refs:matches
407 const BackwardMatch* matches, const ZopfliCostModel* model,
443 /* Look for last distance matches using the distance cache from this
500 /* At higher iterations look only for new last distance matches, since
509 BackwardMatch match = matches[j];
513 /* We already tried all possible last distance matches, so we can use
620 const BackwardMatch* matches, ZopfliNode* nodes) {
633 num_matches[i], &matches[cur_match_pos], model, &queue, nodes);
637 BackwardMatchLength(&matches[cur_match_pos - 1]) > max_zopfli_len) {
639 BackwardMatchLength(&matches[cur_match_pos - 1]), skip);
666 BackwardMatch matches[2 * (MAX_NUM_MATCHES_H10 + 64)];
690 dictionary_start + gap, params, &matches[lz_matches_offset]);
692 BackwardMatchLength(&matches[num_matches - 1]) > max_zopfli_len) {
693 matches[0] = matches[num_matches - 1];
697 params, max_backward_limit, dist_cache, num_matches, matches, &model,
700 if (num_matches == 1 && BackwardMatchLength(&matches[0]) > max_zopfli_len) {
701 skip = BROTLI_MAX(size_t, BackwardMatchLength(&matches[0]), skip);
758 BackwardMatch* matches = BROTLI_ALLOC(m, BackwardMatch, matches_size);
763 BROTLI_IS_NULL(matches)) {
776 BROTLI_ENSURE_CAPACITY(m, BackwardMatch, matches, matches_size,
783 &matches[cur_match_pos + shadow_matches]);
786 BROTLI_DCHECK(BackwardMatchLength(&matches[j]) <=
787 BackwardMatchLength(&matches[j + 1]));
791 const size_t match_len = BackwardMatchLength(&matches[cur_match_end - 1]);
794 matches[cur_match_pos++] = matches[cur_match_end - 1];
830 ringbuffer_mask, params, gap, dist_cache, &model, num_matches, matches,
837 BROTLI_FREE(m, matches);