HomeSort by relevance Sort by last modified time
    Searched refs:nmatch (Results 26 - 31 of 31) sorted by null

12

  /external/llvm/lib/Support/
regengine.inc 131 matcher(struct re_guts *g, const char *string, size_t nmatch,
147 nmatch = 0;
192 if (nmatch == 0 && !g->backrefs)
205 if (nmatch == 1 && !g->backrefs)
268 if (nmatch > 0) {
272 if (nmatch > 1) {
274 for (i = 1; i < nmatch; i++)
  /ndk/sources/host-tools/ndk-stack/regex/
engine.c 128 matcher(struct re_guts *g, char *string, size_t nmatch, regmatch_t pmatch[],
143 nmatch = 0;
188 if (nmatch == 0 && !g->backrefs)
201 if (nmatch == 1 && !g->backrefs)
264 if (nmatch > 0) {
268 if (nmatch > 1) {
270 for (i = 1; i < (ssize_t)nmatch; i++)
  /external/chromium_org/third_party/re2/re2/
re2.h 456 // On a successful match, fills in match[] (up to nmatch entries)
460 // match[3] = NULL, ..., up to match[nmatch-1] = NULL.
463 // runs much faster with nmatch == 1 than nmatch > 1, and
464 // runs even faster if nmatch == 0.
465 // Doesn't make sense to use nmatch > 1 + NumberOfCapturingGroups(),
477 int nmatch) const;
    [all...]
  /external/regex-re2/re2/
re2.h 456 // On a successful match, fills in match[] (up to nmatch entries)
460 // match[3] = NULL, ..., up to match[nmatch-1] = NULL.
463 // runs much faster with nmatch == 1 than nmatch > 1, and
464 // runs even faster if nmatch == 0.
465 // Doesn't make sense to use nmatch > 1 + NumberOfCapturingGroups(),
477 int nmatch) const;
    [all...]
  /external/libppp/src/
command.c 1031 int nmatch; local
1037 nmatch = 0;
1044 nmatch++;
1051 nmatch++
1085 int nmatch; local
    [all...]
  /external/guava/guava/lib/
jdiff.jar 

Completed in 693 milliseconds

12