Lines Matching full:num_matches
376 const int* starting_dist_cache, const size_t num_matches,
464 for (j = 0; j < num_matches; ++j) {
577 const uint32_t* num_matches,
590 num_matches[i], &matches[cur_match_pos], model, &queue, nodes);
592 cur_match_pos += num_matches[i];
593 if (num_matches[i] == 1 &&
605 cur_match_pos += num_matches[i];
642 size_t num_matches = FindAllMatchesH10(hasher, dictionary, ringbuffer,
645 if (num_matches > 0 &&
646 BackwardMatchLength(&matches[num_matches - 1]) > max_zopfli_len) {
647 matches[0] = matches[num_matches - 1];
648 num_matches = 1;
651 params, max_backward_limit, dist_cache, num_matches, matches, &model,
654 if (num_matches == 1 && BackwardMatchLength(&matches[0]) > max_zopfli_len) {
702 uint32_t* num_matches = BROTLI_ALLOC(m, uint32_t, num_bytes);
737 num_matches[i] = (uint32_t)num_found_matches;
743 num_matches[i] = 1;
747 memset(&num_matches[i + 1], 0, skip * sizeof(num_matches[0]));
778 &model, num_matches, matches, nodes);
785 BROTLI_FREE(m, num_matches);
