| /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/pcre/dist/ |
| pcreposix.c | 318 be set. When this is the case, the nmatch and pmatch arguments are ignored, and
322 regexec(const regex_t *preg, const char *string, size_t nmatch,
340 to put it, ensure that nmatch is zero. Otherwise, ensure the vector for holding
343 if (nosub || pmatch == NULL) nmatch = 0;
345 else if (nmatch > 0)
347 if (nmatch <= POSIX_MALLOC_THRESHOLD)
353 if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE;
354 ovector = (int *)malloc(sizeof(int) * nmatch * 3);
377 0, options, ovector, (int)(nmatch * 3));
379 if (rc == 0) rc = (int)nmatch; /* All captured slots were filled in *
[all...] |
| /external/llvm/lib/Support/ |
| Regex.cpp | 60 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; local
64 pm.resize(nmatch > 0 ? nmatch : 1);
68 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND);
83 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/lib/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++)
|
| /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/boringssl/src/ssl/ |
| t1_lib.c | 2353 size_t i, j, nmatch = 0; local
2385 size_t nmatch; local
[all...] |
| internal.h | [all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_resolve_ast.c | 1162 struct cil_list_item *nmatch = NULL; local
1178 for (nmatch = nfirst; nmatch; nmatch = nmatch->next) {
1179 omatch = __cil_ordered_find_match(nmatch, ofirst);
1185 if (!nmatch) {
1190 if (nmatch != nfirst && omatch != ofirst) {
1195 if (nmatch != nfirst) {
1197 rc = __cil_ordered_list_insert(old, NULL, nfirst, nmatch);
[all...] |
| /external/toybox/toys/posix/ |
| sed.c | 215 static int ghostwheel(regex_t *preg, char *string, long len, int nmatch,
230 rc = regexec(preg, s, nmatch, pmatch, eflags);
232 for (rc = 0; rc<nmatch && pmatch[rc].rm_so!=-1; rc++) {
|
| /external/guava/guava/lib/ |
| jdiff.jar | |
