Home
last modified time | relevance | path

Searched refs:nmatch (Results 1 – 19 of 19) sorted by relevance

/external/pcre/dist/
Dpcreposix.c322 regexec(const regex_t *preg, const char *string, size_t nmatch, in regexec() argument
343 if (nosub || pmatch == NULL) nmatch = 0; in regexec()
345 else if (nmatch > 0) in regexec()
347 if (nmatch <= POSIX_MALLOC_THRESHOLD) in regexec()
353 if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE; in regexec()
354 ovector = (int *)malloc(sizeof(int) * nmatch * 3); in regexec()
377 0, options, ovector, (int)(nmatch * 3)); in regexec()
379 if (rc == 0) rc = (int)nmatch; /* All captured slots were filled in */ in regexec()
394 for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1; in regexec()
DChangeLog2344 value for nmatch with a NULL value for pmatch, the value of
2345 nmatch is forced to zero.
3934 9. In the POSIX regexec() interface, if nmatch is specified as a ridiculously
3942 with this option is matched, the nmatch and pmatch options of regexec() are
/external/llvm/lib/Support/
DRegex.cpp60 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; in match() local
64 pm.resize(nmatch > 0 ? nmatch : 1); in match()
68 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND); in match()
83 for (unsigned i = 0; i != nmatch; ++i) { in match()
Dregexec.c141 llvm_regexec(const llvm_regex_t *preg, const char *string, size_t nmatch, in llvm_regexec() argument
159 return(smatcher(g, string, nmatch, pmatch, eflags)); in llvm_regexec()
161 return(lmatcher(g, string, nmatch, pmatch, eflags)); in llvm_regexec()
Dregengine.inc131 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++)
/external/regex-re2/re2/
Donepass.cc210 StringPiece* match, int nmatch) { in SearchOnePass() argument
218 int ncap = 2*nmatch; in SearchOnePass()
297 for (int i = 2; i < 2*nmatch; i++) in SearchOnePass()
299 if (nmatch > 1 && (matchcond & kCapMask)) in SearchOnePass()
316 if ((cond & kCapMask) && nmatch > 1) in SearchOnePass()
325 if (nmatch > 1 && (matchcond & kCapMask)) in SearchOnePass()
337 for (int i = 0; i < nmatch; i++) in SearchOnePass()
Dprog.h264 StringPiece* match, int nmatch);
295 StringPiece* match, int nmatch);
301 StringPiece* match, int nmatch);
314 StringPiece* match, int nmatch);
Dbitstate.cc354 int nmatch) { in SearchBitState() argument
361 if (nmatch < 1) { in SearchBitState()
363 nmatch = 1; in SearchBitState()
371 if (!b.Search(text, context, anchored, longest, match, nmatch)) in SearchBitState()
Dnfa.cc688 StringPiece* match, int nmatch) { in SearchNFA() argument
696 if (nmatch == 0) { in SearchNFA()
698 nmatch = 1; in SearchNFA()
701 if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch)) in SearchNFA()
Dre2.h477 int nmatch) const;
/external/regex-re2/re2/testing/
Dbacktrack.cc230 int nmatch) { in UnsafeSearchBacktrack() argument
237 if (nmatch < 1) { in UnsafeSearchBacktrack()
239 nmatch = 1; in UnsafeSearchBacktrack()
247 if (!b.Search(text, context, anchored, longest, match, nmatch)) in UnsafeSearchBacktrack()
/external/libmicrohttpd/src/examples/
Dmhd2spdy_structures.c76 size_t nmatch = 10; in parse_uri() local
79 if (0 != (ret = regexec(preg, full_uri, nmatch, pmatch, 0))) in parse_uri()
/external/jdiff/src/jdiff/
DDiffMyers.java581 int nmatch; in discardable() local
584 nmatch = counts[equivs[i]]; in discardable()
585 if (nmatch == 0) in discardable()
587 else if (nmatch > many) in discardable()
/external/selinux/libsepol/cil/src/
Dcil_resolve_ast.c1230 struct cil_list_item *nmatch = NULL; in __cil_ordered_lists_merge() local
1246 for (nmatch = nfirst; nmatch; nmatch = nmatch->next) { in __cil_ordered_lists_merge()
1247 omatch = __cil_ordered_find_match(nmatch, ofirst); in __cil_ordered_lists_merge()
1253 if (!nmatch) { in __cil_ordered_lists_merge()
1258 if (nmatch != nfirst && omatch != ofirst) { in __cil_ordered_lists_merge()
1263 if (nmatch != nfirst) { in __cil_ordered_lists_merge()
1265 rc = __cil_ordered_list_insert(old, NULL, nfirst, nmatch); in __cil_ordered_lists_merge()
1272 ncurr = nmatch->next; in __cil_ordered_lists_merge()
1282 nmatch = __cil_ordered_find_match(ocurr, ncurr->next); in __cil_ordered_lists_merge()
1283 if (nmatch) { in __cil_ordered_lists_merge()
[all …]
/external/toybox/toys/posix/
Dsed.c215 static int ghostwheel(regex_t *preg, char *string, long len, int nmatch, in ghostwheel() argument
230 rc = regexec(preg, s, nmatch, pmatch, eflags); in ghostwheel()
232 for (rc = 0; rc<nmatch && pmatch[rc].rm_so!=-1; rc++) { in ghostwheel()
/external/libmicrohttpd/src/spdy2http/
Dproxy.c239 size_t nmatch = 10; in parse_uri() local
242 if (0 != (ret = regexec(preg, full_uri, nmatch, pmatch, 0))) in parse_uri()
/external/guava/guava/lib/
Djdiff.jarMETA-INF/ META-INF/MANIFEST.MF jdiff/ jdiff/API.class API ...
/external/guice/lib/build/jdiff/
Djdiff.jarMETA-INF/ META-INF/MANIFEST.MF jdiff/ jdiff/API.class API ...
/external/pcre/dist/doc/
Dpcre.txt9524 size_t nmatch, regmatch_t pmatch[], int eflags);
9608 ing, the nmatch and pmatch arguments are ignored, and no captured
9713 nmatch. This is a BSD extension, compatible with but not specified by
9720 matched strings is returned. The nmatch and pmatch arguments of
9723 If the value of nmatch is zero, or if the value pmatch is NULL, no data
9728 an array of nmatch structures of type regmatch_t, containing the mem-