408     const int* starting_dist_cache, const size_t num_matches,  in UpdateNodes()  argument
505       for (j = 0; j < num_matches; ++j) {  in UpdateNodes()
614     const ZopfliCostModel* model, const uint32_t* num_matches,  in ZopfliIterate()  argument
627         num_matches[i], &matches[cur_match_pos], model, &queue, nodes);  in ZopfliIterate()
629     cur_match_pos += num_matches[i];  in ZopfliIterate()
630     if (num_matches[i] == 1 &&  in ZopfliIterate()
642         cur_match_pos += num_matches[i];  in ZopfliIterate()
676     size_t num_matches;  in BrotliZopfliComputeShortestPath()  local
677     num_matches = FindAllMatchesH10(hasher,  in BrotliZopfliComputeShortestPath()
681     if (num_matches > 0 &&  in BrotliZopfliComputeShortestPath()
682         BackwardMatchLength(&matches[num_matches - 1]) > max_zopfli_len) {  in BrotliZopfliComputeShortestPath()
683       matches[0] = matches[num_matches - 1];  in BrotliZopfliComputeShortestPath()
684       num_matches = 1;  in BrotliZopfliComputeShortestPath()
687         params, max_backward_limit, dist_cache, num_matches, matches, &model,  in BrotliZopfliComputeShortestPath()
690     if (num_matches == 1 && BackwardMatchLength(&matches[0]) > max_zopfli_len) {  in BrotliZopfliComputeShortestPath()
735   uint32_t* num_matches = BROTLI_ALLOC(m, uint32_t, num_bytes);  in BrotliCreateHqZopfliBackwardReferences()  local
772     num_matches[i] = (uint32_t)num_found_matches;  in BrotliCreateHqZopfliBackwardReferences()
778         num_matches[i] = 1;  in BrotliCreateHqZopfliBackwardReferences()
782         memset(&num_matches[i + 1], 0, skip * sizeof(num_matches[0]));  in BrotliCreateHqZopfliBackwardReferences()
812         ringbuffer_mask, params, gap, dist_cache, &model, num_matches, matches,  in BrotliCreateHqZopfliBackwardReferences()
820   BROTLI_FREE(m, num_matches);  in BrotliCreateHqZopfliBackwardReferences()