| /external/llvm-project/llvm/test/MC/AArch64/SVE2/ |
| D | nmatch-diagnostics.s | 6 nmatch p0.b, p8/z, z0.b, z0.b label
15 nmatch p0.b, p0/m, z0.b, z0.b label
24 nmatch p0.s, p0/z, z0.b, z0.b label
29 nmatch p0.d, p0/z, z0.b, z0.b label
37 nmatch p0.b, p0/z, z0.s, z0.s label
42 nmatch p0.b, p0/z, z0.d, z0.d label
52 nmatch p0.b, p0/z, z0.b, z0.b label
58 nmatch p0.b, p0/z, z0.b, z0.b label
|
| D | nmatch.s | 10 nmatch p0.b, p0/z, z0.b, z0.b label
16 nmatch p0.h, p0/z, z0.h, z0.h label
22 nmatch p15.b, p7/z, z30.b, z31.b label
28 nmatch p15.h, p7/z, z30.h, z31.h label
|
| /external/pcre/dist2/src/ |
| D | pcre2posix.c | 216 regexec(const regex_t *preg, const char *string, size_t nmatch, in regexec() argument
219 return pcre2_regexec(preg, string, nmatch, pmatch, eflags); in regexec()
349 pcre2_regexec(const regex_t *preg, const char *string, size_t nmatch, in pcre2_regexec() argument
364 if ((preg->re_cflags & REG_NOSUB) != 0 || pmatch == NULL) nmatch = 0; in pcre2_regexec()
392 if ((size_t)rc > nmatch) rc = (int)nmatch; in pcre2_regexec()
400 for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1; in pcre2_regexec()
|
| /external/kmod/libkmod/ |
| D | libkmod.c | 429 int err, nmatch = 0; in kmod_lookup_alias_from_alias_bin() local
465 nmatch++; in kmod_lookup_alias_from_alias_bin()
469 return nmatch; in kmod_lookup_alias_from_alias_bin()
472 *list = kmod_list_remove_n_latest(*list, nmatch); in kmod_lookup_alias_from_alias_bin()
657 int err, nmatch = 0; in kmod_lookup_alias_from_config() local
675 nmatch++; in kmod_lookup_alias_from_config()
679 return nmatch; in kmod_lookup_alias_from_config()
682 *list = kmod_list_remove_n_latest(*list, nmatch); in kmod_lookup_alias_from_config()
691 int err, nmatch = 0; in kmod_lookup_alias_from_commands() local
714 nmatch = 1; in kmod_lookup_alias_from_commands()
[all …]
|
| /external/llvm/lib/Support/ |
| D | Regex.cpp | 60 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()
|
| D | regexec.c | 141 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()
|
| D | 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++)
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | Regex.cpp | 72 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; in match() local
76 pm.resize(nmatch > 0 ? nmatch : 1); in match()
80 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND); in match()
95 for (unsigned i = 0; i != nmatch; ++i) { in match()
|
| D | regexec.c | 141 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()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | Regex.cpp | 92 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; in match() local
96 pm.resize(nmatch > 0 ? nmatch : 1); in match()
100 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND); in match()
117 for (unsigned i = 0; i != nmatch; ++i) { in match()
|
| D | regexec.c | 141 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()
|
| /external/llvm-project/llvm/lib/Support/ |
| D | Regex.cpp | 96 unsigned nmatch = Matches ? preg->re_nsub+1 : 0; in match() local
100 pm.resize(nmatch > 0 ? nmatch : 1); in match()
104 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND); in match()
121 for (unsigned i = 0; i != nmatch; ++i) { in match()
|
| D | regexec.c | 141 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()
|
| D | 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++)
|
| /external/libcups/vcnet/regex/ |
| D | regexec.c | 113 regexec(preg, string, nmatch, pmatch, eflags) in regexec() argument
116 size_t nmatch;
135 return(smatcher(g, (char *)string, nmatch, pmatch, eflags));
137 return(lmatcher(g, (char *)string, nmatch, pmatch, eflags));
|
| D | engine.c | 66 matcher(g, string, nmatch, pmatch, eflags) in matcher() argument
69 size_t nmatch;
85 nmatch = 0;
128 if (nmatch == 0 && !g->backrefs)
141 if (nmatch == 1 && !g->backrefs)
203 if (nmatch > 0) {
207 if (nmatch > 1) {
209 for (i = 1; i < nmatch; i++)
|
| D | engine.ih | 7 static int matcher(register struct re_guts *g, char *string, size_t nmatch, regmatch_t pmatch[], in…
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | onepass.cc | 217 StringPiece* match, int nmatch) { in SearchOnePass() argument
225 int ncap = 2*nmatch; in SearchOnePass()
301 for (int i = 2; i < 2*nmatch; i++) in SearchOnePass()
303 if (nmatch > 1 && (matchcond & kCapMask)) in SearchOnePass()
320 if ((cond & kCapMask) && nmatch > 1) in SearchOnePass()
329 if (nmatch > 1 && (matchcond & kCapMask)) in SearchOnePass()
341 for (int i = 0; i < nmatch; i++) in SearchOnePass()
|
| D | bitstate.cc | 361 int nmatch) { in SearchBitState() argument
368 if (nmatch < 1) { in SearchBitState()
370 nmatch = 1; in SearchBitState()
378 if (!b.Search(text, context, anchored, longest, match, nmatch)) in SearchBitState()
|
| D | prog.h | 272 StringPiece* match, int nmatch);
317 StringPiece* match, int nmatch);
324 StringPiece* match, int nmatch);
337 StringPiece* match, int nmatch);
|
| D | nfa.cc | 634 StringPiece* match, int nmatch) { in SearchNFA() argument
642 if (nmatch == 0) { in SearchNFA()
644 nmatch = 1; in SearchNFA()
647 if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch)) in SearchNFA()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/ |
| D | backtrack.cc | 251 int nmatch) { in UnsafeSearchBacktrack() argument
258 if (nmatch < 1) { in UnsafeSearchBacktrack()
260 nmatch = 1; in UnsafeSearchBacktrack()
268 if (!b.Search(text, context, anchored, longest, match, nmatch)) in UnsafeSearchBacktrack()
|
| /external/llvm-project/llvm/test/CodeGen/AArch64/ |
| D | sve2-intrinsics-character-match.ll | 39 %out = call <vscale x 16 x i1> @llvm.aarch64.sve.nmatch.nxv16i8(<vscale x 16 x i1> %pg,
49 %out = call <vscale x 8 x i1> @llvm.aarch64.sve.nmatch.nxv8i16(<vscale x 8 x i1> %pg,
57 declare <vscale x 16 x i1> @llvm.aarch64.sve.nmatch.nxv16i8(<vscale x 16 x i1>, <vscale x 16 x i8>,…
58 declare <vscale x 8 x i1> @llvm.aarch64.sve.nmatch.nxv8i16(<vscale x 8 x i1>, <vscale x 8 x i16>, <…
|
| /external/jdiff/src/jdiff/ |
| D | DiffMyers.java | 581 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/ |
| D | cil_resolve_ast.c | 1280 struct cil_list_item *nmatch = NULL; in __cil_ordered_lists_merge() local
1296 for (nmatch = nfirst; nmatch; nmatch = nmatch->next) { in __cil_ordered_lists_merge()
1297 omatch = __cil_ordered_find_match(nmatch, ofirst); in __cil_ordered_lists_merge()
1303 if (!nmatch) { in __cil_ordered_lists_merge()
1308 if (nmatch != nfirst && omatch != ofirst) { in __cil_ordered_lists_merge()
1313 if (nmatch != nfirst) { in __cil_ordered_lists_merge()
1315 rc = __cil_ordered_list_insert(old, NULL, nfirst, nmatch); in __cil_ordered_lists_merge()
1322 ncurr = nmatch->next; in __cil_ordered_lists_merge()
1332 nmatch = __cil_ordered_find_match(ocurr, ncurr->next); in __cil_ordered_lists_merge()
1333 if (nmatch) { in __cil_ordered_lists_merge()
[all …]
|