dist/lib/regexec.c

44 					 size_t nmatch, regmatch_t pmatch[],
69 			 Idx cur_idx, Idx nmatch) internal_function;
76 			       size_t nmatch, regmatch_t *pmatch,
205 	 size_t nmatch, regmatch_t pmatch[], int eflags)
233 			      length, nmatch, pmatch, eflags);
248 		  const char *__restrict string, size_t nmatch,
251   return regexec (preg, string, nmatch, pmatch,
616 		    size_t nmatch, regmatch_t pmatch[],
645   extra_nmatch = (nmatch > preg->re_nsub) ? nmatch - (preg->re_nsub + 1) : 0;
646   nmatch -= extra_nmatch;
672   /* We must check the longest matching, if nmatch > 0.  */
673   fl_longest_match = (nmatch != 0 || dfa->nbackref);
689      if nmatch > 1, or this dfa has "multibyte node", which is a
692   if (nmatch > 1 || dfa->has_mb_node)
837 	      if ((!preg->re_no_sub && nmatch > 1) || dfa->nbackref)
843 	      if ((!preg->re_no_sub && nmatch > 1 && dfa->has_plural_match)
867   if (nmatch > 0)
872       for (reg_idx = 1; reg_idx < nmatch; ++reg_idx)
882       if (!preg->re_no_sub && nmatch > 1)
884 	  err = set_regs (preg, &mctx, nmatch, pmatch,
893       for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)
916 	  pmatch[nmatch + reg_idx].rm_so = -1;
917 	  pmatch[nmatch + reg_idx].rm_eo = -1;
921         for (reg_idx = 0; reg_idx + 1 < nmatch; reg_idx++)
1385    pmatch[i].rm_so == pmatch[i].rm_eo == -1 for 0 < i < nmatch.  */
1390 	  size_t nmatch, regmatch_t *pmatch, bool fl_backtrack)
1401   assert (nmatch > 1);
1417   if (re_alloc_oversized (nmatch, sizeof (regmatch_t)))
1423   if (__libc_use_alloca (nmatch * sizeof (regmatch_t)))
1424     prev_idx_match = (regmatch_t *) alloca (nmatch * sizeof (regmatch_t));
1428       prev_idx_match = re_malloc (regmatch_t, nmatch);
1436   memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);
1440       update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1447 	      for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)
1450 	      if (reg_idx == nmatch)
1457 	      cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1470       cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1484 	    cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1521 	     Idx cur_node, Idx cur_idx, Idx nmatch)
1529       if (reg_num < nmatch)
1538       if (reg_num < nmatch)
1546 	      memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);
1557 		memcpy (pmatch, prev_idx_match, sizeof (regmatch_t) * nmatch);