44 					 size_t nmatch, regmatch_t pmatch[],
69 			 Idx cur_idx, Idx nmatch) internal_function;
77 			       size_t nmatch, regmatch_t *pmatch,
226 regexec (preg, string, nmatch, pmatch, eflags)  in regexec()  argument
229     size_t nmatch;
259 			      length, nmatch, pmatch, eflags);
274 		  const char *_Restrict_ string, size_t nmatch,  in __compat_regexec()  argument
277   return regexec (preg, string, nmatch, pmatch,  in __compat_regexec()
646 		    size_t nmatch, regmatch_t pmatch[],  in re_search_internal()  argument
675   extra_nmatch = (nmatch > preg->re_nsub) ? nmatch - (preg->re_nsub + 1) : 0;  in re_search_internal()
676   nmatch -= extra_nmatch;  in re_search_internal()
703   fl_longest_match = (nmatch != 0 || dfa->nbackref);  in re_search_internal()
722   if (nmatch > 1 || dfa->has_mb_node)  in re_search_internal()
874 	      if ((!preg->no_sub && nmatch > 1) || dfa->nbackref)  in re_search_internal()
880 	      if ((!preg->no_sub && nmatch > 1 && dfa->has_plural_match)  in re_search_internal()
904   if (nmatch > 0)  in re_search_internal()
909       for (reg_idx = 1; reg_idx < nmatch; ++reg_idx)  in re_search_internal()
919       if (!preg->no_sub && nmatch > 1)  in re_search_internal()
921 	  err = set_regs (preg, &mctx, nmatch, pmatch,  in re_search_internal()
930       for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)  in re_search_internal()
953 	  pmatch[nmatch + reg_idx].rm_so = -1;  in re_search_internal()
954 	  pmatch[nmatch + reg_idx].rm_eo = -1;  in re_search_internal()
958         for (reg_idx = 0; reg_idx + 1 < nmatch; reg_idx++)  in re_search_internal()
1438 set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch,  in set_regs()  argument
1450   assert (nmatch > 1);  in set_regs()
1466   if (__libc_use_alloca (nmatch * sizeof (regmatch_t)))  in set_regs()
1467     prev_idx_match = (regmatch_t *) alloca (nmatch * sizeof (regmatch_t));  in set_regs()
1470       prev_idx_match = re_malloc (regmatch_t, nmatch);  in set_regs()
1478   memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);  in set_regs()
1482       update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);  in set_regs()
1489 	      for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)  in set_regs()
1492 	      if (reg_idx == nmatch)  in set_regs()
1499 	      cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,  in set_regs()
1512       cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,  in set_regs()
1526 	    cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,  in set_regs()
1563 	     regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch)  in update_regs()  argument
1571       if (reg_num < nmatch)  in update_regs()
1580       if (reg_num < nmatch)  in update_regs()
1588 	      memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);  in update_regs()
1599 		memcpy (pmatch, prev_idx_match, sizeof (regmatch_t) * nmatch);  in update_regs()