Lines Matching refs:nmatch
44 size_t nmatch, regmatch_t pmatch[],
69 Idx cur_idx, Idx nmatch) internal_function;
77 size_t nmatch, regmatch_t *pmatch,
215 If NMATCH is zero or REG_NOSUB was set in the cflags argument to
217 least NMATCH elements, and we set them to the offsets of the
227 regexec (preg, string, nmatch, pmatch, eflags)
230 size_t nmatch;
260 length, nmatch, pmatch, eflags);
275 const char *_Restrict_ string, size_t nmatch,
278 return regexec (preg, string, nmatch, pmatch,
636 length is LENGTH. NMATCH, PMATCH, and EFLAGS have the same
649 size_t nmatch, regmatch_t pmatch[],
678 extra_nmatch = (nmatch > preg->re_nsub) ? nmatch - (preg->re_nsub + 1) : 0;
679 nmatch -= extra_nmatch;
705 /* We must check the longest matching, if nmatch > 0. */
706 fl_longest_match = (nmatch != 0 || dfa->nbackref);
722 if nmatch > 1, or this dfa has "multibyte node", which is a
725 if (nmatch > 1 || dfa->has_mb_node)
877 if ((!preg->no_sub && nmatch > 1) || dfa->nbackref)
883 if ((!preg->no_sub && nmatch > 1 && dfa->has_plural_match)
907 if (nmatch > 0)
912 for (reg_idx = 1; reg_idx < nmatch; ++reg_idx)
922 if (!preg->no_sub && nmatch > 1)
924 err = set_regs (preg, &mctx, nmatch, pmatch,
933 for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)
956 pmatch[nmatch + reg_idx].rm_so = -1;
957 pmatch[nmatch + reg_idx].rm_eo = -1;
961 for (reg_idx = 0; reg_idx + 1 < nmatch; reg_idx++)
1437 pmatch[i].rm_so == pmatch[i].rm_eo == -1 for 0 < i < nmatch. */
1441 set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch,
1453 assert (nmatch > 1);
1469 if (__libc_use_alloca (nmatch * sizeof (regmatch_t)))
1470 prev_idx_match = (regmatch_t *) alloca (nmatch * sizeof (regmatch_t));
1473 prev_idx_match = re_malloc (regmatch_t, nmatch);
1481 memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);
1485 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1492 for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)
1495 if (reg_idx == nmatch)
1502 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1515 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1529 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1566 regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch)
1574 if (reg_num < nmatch)
1583 if (reg_num < nmatch)
1591 memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);
1602 memcpy (pmatch, prev_idx_match, sizeof (regmatch_t) * nmatch);
