/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
bug-regex12.c | 38 int flags, nmatch; member in struct:__anon22195 70 if (! regexec (&re, tests[i].string, tests[i].nmatch, 71 tests[i].nmatch ? rm : NULL, 0))
|
bug-regex11.c | 38 int flags, nmatch; member in struct:__anon22194 119 if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0)) 127 for (n = 0; n < tests[i].nmatch; ++n)
|
/cts/suite/audio_quality/lib/src/ |
SimpleScriptExec.h | 47 * @param nmatch number of substring pattern match elements. It should be in POSIX 53 int nmatch = 0, regmatch_t pmatch[] = NULL);
|
SimpleScriptExec.cpp | 42 int nmatch, regmatch_t pmatch[]) 50 if (nmatch == 0) { 58 if (regexec(&re, str.string(), nmatch, pmatch, 0) == 0) {
|
/cts/suite/audio_quality/lib/src/audio/ |
AudioHardware.cpp | 49 const int nmatch = 3; local 50 regmatch_t pmatch[nmatch]; 51 if (!SimpleScriptExec::checkIfPassed(resultStr, match, nmatch, pmatch)) {
|
/external/llvm/lib/Support/ |
Regex.cpp | 58 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; local 62 pm.resize(nmatch > 0 ? nmatch : 1); 66 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND); 81 for (unsigned i = 0; i != nmatch; ++i) {
|
regexec.c | 141 llvm_regexec(const llvm_regex_t *preg, const char *string, size_t nmatch, 159 return(smatcher(g, string, nmatch, pmatch, eflags)); 161 return(lmatcher(g, string, nmatch, pmatch, eflags));
|
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/ |
regexec.c | 139 regexec(const regex_t *preg, const char *string, size_t nmatch, 157 return(smatcher(g, (char *)string, nmatch, pmatch, eflags)); 159 return(lmatcher(g, (char *)string, nmatch, pmatch, eflags));
|
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/regex-re2/re2/ |
bitstate.cc | 354 int nmatch) { 361 if (nmatch < 1) { 363 nmatch = 1; 371 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
prog.h | 251 // If match found, fills match[0..nmatch-1] with submatch info. 264 StringPiece* match, int nmatch); 295 StringPiece* match, int nmatch); 301 StringPiece* match, int nmatch); 314 StringPiece* match, int nmatch);
|
onepass.cc | 210 StringPiece* match, int nmatch) { 218 int ncap = 2*nmatch; 297 for (int i = 2; i < 2*nmatch; i++) 299 if (nmatch > 1 && (matchcond & kCapMask)) 316 if ((cond & kCapMask) && nmatch > 1) 325 if (nmatch > 1 && (matchcond & kCapMask)) 337 for (int i = 0; i < nmatch; i++)
|
nfa.cc | 688 StringPiece* match, int nmatch) { 696 if (nmatch == 0) { 698 nmatch = 1; 701 if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch))
|
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/testing/ |
backtrack.cc | 230 int nmatch) { 237 if (nmatch < 1) { 239 nmatch = 1; 247 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
/bionic/libc/upstream-netbsd/libc/regex/ |
regexec.c | 206 size_t nmatch, 231 return(smatcher(g, s, nmatch, pmatch, eflags)); 233 return(lmatcher(g, s, nmatch, pmatch, eflags));
|
engine.c | 129 static int matcher(struct re_guts *g, const char *string, size_t nmatch, regmatch_t pmatch[], int eflags); 173 == size_t nmatch, regmatch_t pmatch[], int eflags); 179 size_t nmatch, 200 nmatch = 0; 244 if (nmatch == 0 && !g->backrefs) 257 if (nmatch == 1 && !g->backrefs) 318 if (nmatch > 0) { 323 if (nmatch > 1) { 325 for (i = 1; i < nmatch; i++)
|
/external/srec/tools/grxmlcompile/ |
sub_min.cpp | 260 int fix, six, fmiss, smiss, nmatch, symTst, newId; local 271 fmiss= smiss= nmatch= 0; 310 nmatch++; 341 assert (nmatch > 0); 345 if (nmatch > 0) { 347 for (int ii= 0; ii < nmatch; ii++) { 354 return nmatch;
|
/ndk/sources/host-tools/sed-4.2.1/lib/ |
regexec.c | 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 [all...] |
/external/oprofile/libregex/ |
op_regex.cpp | 47 size_t nmatch) 49 return regexec(®ex, str.c_str(), nmatch, match, 0) != REG_NOMATCH;
|
/cts/suite/audio_quality/lib/src/task/ |
TaskCase.cpp | 241 const int nmatch = 2; local 242 regmatch_t pmatch[nmatch]; 253 while (regexec(&re, src, nmatch, pmatch, 0) == 0) {
|
/external/jdiff/src/jdiff/ |
DiffMyers.java | 581 int nmatch; local 584 nmatch = counts[equivs[i]]; 585 if (nmatch == 0) 587 else if (nmatch > many)
|
/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 | |