37 					 size_t nmatch, regmatch_t pmatch[],
59 			 Idx cur_idx, Idx nmatch);
66 			       size_t nmatch, regmatch_t *pmatch,
194 	 size_t nmatch, regmatch_t pmatch[_REGEX_NELTS (nmatch)], int eflags)  in regexec()  argument
220 			      length, nmatch, pmatch, eflags);  in regexec()
237 		  const char *__restrict string, size_t nmatch,  in __compat_regexec()  argument
238 		  regmatch_t pmatch[_REGEX_NELTS (nmatch)], int eflags)  in __compat_regexec()  argument
240   return regexec (preg, string, nmatch, pmatch,  in __compat_regexec()
587 		    Idx start, Idx last_start, Idx stop, size_t nmatch,  in re_search_internal()  argument
607   extra_nmatch = (nmatch > preg->re_nsub) ? nmatch - (preg->re_nsub + 1) : 0;  in re_search_internal()
608   nmatch -= extra_nmatch;  in re_search_internal()
634   fl_longest_match = (nmatch != 0 || dfa->nbackref);  in re_search_internal()
653   if (nmatch > 1 || dfa->has_mb_node)  in re_search_internal()
804 	      if ((!preg->no_sub && nmatch > 1) || dfa->nbackref)  in re_search_internal()
810 	      if ((!preg->no_sub && nmatch > 1 && dfa->has_plural_match)  in re_search_internal()
832   if (nmatch > 0)  in re_search_internal()
837       for (reg_idx = 1; reg_idx < nmatch; ++reg_idx)  in re_search_internal()
847       if (!preg->no_sub && nmatch > 1)  in re_search_internal()
849 	  err = set_regs (preg, &mctx, nmatch, pmatch,  in re_search_internal()
858       for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)  in re_search_internal()
881 	  pmatch[nmatch + reg_idx].rm_so = -1;  in re_search_internal()
882 	  pmatch[nmatch + reg_idx].rm_eo = -1;  in re_search_internal()
886 	for (reg_idx = 0; reg_idx + 1 < nmatch; reg_idx++)  in re_search_internal()
1380 set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch,  in set_regs()  argument
1391   DEBUG_ASSERT (nmatch > 1);  in set_regs()
1406   if (!regmatch_list_resize (&prev_match, nmatch))  in set_regs()
1413   memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);  in set_regs()
1417       update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);  in set_regs()
1426 	      for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)  in set_regs()
1429 		    cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,  in set_regs()
1443       cur_node = proceed_next_node (mctx, nmatch, pmatch, prev_idx_match,  in set_regs()
1456 	  cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,  in set_regs()
1490 	     regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch)  in update_regs()  argument
1498       if (reg_num < nmatch)  in update_regs()
1508       if (reg_num < nmatch)  in update_regs()
1515 	      memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);  in update_regs()
1526 		memcpy (pmatch, prev_idx_match, sizeof (regmatch_t) * nmatch);  in update_regs()