Home
last modified time | relevance | path

Searched refs:matcher (Results 1 – 25 of 199) sorted by relevance

12345678

/netbsd-src/external/apache2/llvm/dist/clang/docs/
H A DLibASTMatchers.rst29 For example, to create a matcher that matches all class or union declarations
33 insert a `hasName <LibASTMatchersReference.html#hasName0Anchor>`_ matcher: the
34 call ``recordDecl(hasName("Foo"))`` returns a matcher that matches classes or
41 How to create a matcher
45 when trying to figure out how to create a matcher for a specific pattern. This
47 matcher you are interested in. Note that there will always be matchers missing
69 #. Repeat until the matcher is finished.
92 There are multiple different ways to define a matcher, depending on its type
100 *Derived*. ``VariadicDynCastAllOfMatchers`` are the backbone of the matcher
112 Most matcher definitions use the matcher creation macros. Those define both
[all …]
H A DLibASTMatchersTutorial.rst177 Intermezzo: Learn AST matcher basics
189 is a matcher to do exactly that, conveniently named ``binaryOperator``.
190 I'll give you one guess what this matcher does:
199 expand to 0. The matcher will also not match against calls to the
201 matcher to handle overloaded operators.
209 All matcher that are nouns describe entities in the AST and can be
220 Okay, on to using matchers for real. Let's start by defining a matcher
229 portion of the loop, so we can extend the matcher to
243 It is fairly easy to read and understand the matcher definition ("match
246 is more difficult. Note that this matcher will not match loops whose
[all …]
/netbsd-src/external/bsd/tre/dist/lib/
H A DREADME30 - Parallel TNFA matcher.
31 * The matcher basically takes a string and a TNFA and finds the
35 * The matcher cannot handle back references, but the worst case
40 - A traditional backtracking matcher.
41 * Like the parallel matcher, takes a string and a TNFA and finds
49 - Approximate parallel TNFA matcher.
56 bounds are the same as for the parallel exact matcher, but
57 in general this matcher is slower than the exact matcher.
65 * The appropriate matcher is dispatched according to the
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/
H A Dthompson.d519 auto matcher = fwdMatcher(t.pc, end, subCounters.get(t.pc, 0)); in with() local
521 auto matcher = bwdMatcher(t.pc, end, subCounters.get(t.pc, 0)); in with() local
522 matcher.re.ngroup = me - ms; in with()
523 matcher.backrefed = backrefed.empty ? t.matches : backrefed; in with()
525 auto mRes = matcher.matchOneShot(t.matches.ptr[ms .. me], IRL!(IR.LookbehindStart)); in with()
526 freelist = matcher.freelist; in with()
527 subCounters[t.pc] = matcher.genCounter; in with()
548 auto matcher = bwdMatcher(t.pc, end, subCounters.get(t.pc, 0)); in with() local
550 auto matcher = fwdMatcher(t.pc, end, subCounters.get(t.pc, 0)); in with() local
551 matcher.re.ngroup = me - ms; in with()
[all …]
H A Dbacktracking.d185 auto fwdMatcher(ref BacktrackingMatcher matcher, void[] memBlock) in BacktrackingMatcher()
189 auto fwdMatcher = BackMatcher(matcher.re, s, memBlock, front, index); in BacktrackingMatcher()
193 auto bwdMatcher(ref BacktrackingMatcher matcher, void[] memBlock) in BacktrackingMatcher()
198 BackMatcher(matcher.re, s.loopBack(index), memBlock); in BacktrackingMatcher()
585 auto matcher = bwdMatcher(this, mem); in BacktrackingMatcher() local
589 auto matcher = fwdMatcher(this, mem); in BacktrackingMatcher() local
591 matcher.matches = matches[ms .. me]; in BacktrackingMatcher()
592 matcher.backrefed = backrefed.empty ? matches : backrefed; in BacktrackingMatcher()
593 matcher.re.ir = re.ir[ in BacktrackingMatcher()
596 … immutable match = (matcher.matchImpl() != 0) ^ (re.ir[pc].code == IR.NeglookaheadStart); in BacktrackingMatcher()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/
H A Dgmock-matchers.h244 static Matcher<T> Cast(const Matcher<T>& matcher) { return matcher; } in Cast() argument
254 inline Matcher<T> MatcherCast(const M& matcher) { in MatcherCast() argument
255 return internal::MatcherCastImpl<T, M>::Cast(matcher); in MatcherCast()
282 static inline Matcher<T> Cast(const Matcher<U>& matcher) { in Cast() argument
301 return MatcherCast<T>(matcher); in Cast()
342 bool MatchPrintAndExplain(Value& value, const Matcher<T>& matcher, in MatchPrintAndExplain() argument
347 return matcher.Matches(value); in MatchPrintAndExplain()
351 const bool match = matcher.MatchAndExplain(value, &inner_listener); in MatchPrintAndExplain()
392 typename std::tuple_element<N - 1, MatcherTuple>::type matcher = in ExplainMatchFailuresTo() local
397 if (!matcher.MatchAndExplain(value, &listener)) { in ExplainMatchFailuresTo()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/
H A Dthompson.d519 auto matcher = fwdMatcher(t.pc, end, me - ms, subCounters.get(t.pc, 0)); in with() local
521 auto matcher = bwdMatcher(t.pc, end, me - ms, subCounters.get(t.pc, 0)); in with() local
522 matcher.backrefed = backrefed.empty ? t.matches : backrefed; in with()
524 auto mRes = matcher.matchOneShot(t.matches.ptr[ms .. me], IRL!(IR.LookbehindStart)); in with()
525 freelist = matcher.freelist; in with()
526 subCounters[t.pc] = matcher.genCounter; in with()
547 auto matcher = bwdMatcher(t.pc, end, me - ms, subCounters.get(t.pc, 0)); in with() local
549 auto matcher = fwdMatcher(t.pc, end, me - ms, subCounters.get(t.pc, 0)); in with() local
550 matcher.backrefed = backrefed.empty ? t.matches : backrefed; in with()
551 auto mRes = matcher.matchOneShot(t.matches.ptr[ms .. me], IRL!(IR.LookaheadStart)); in with()
[all …]
H A Dbacktracking.d616 auto matcher = bwdMatcher(slicedRe, mem); in matchImpl() local
620 auto matcher = fwdMatcher(slicedRe, mem); in matchImpl() local
622 matcher.matches = matches[ms .. me]; in matchImpl()
623 matcher.backrefed = backrefed.empty ? matches : backrefed; in matchImpl()
624 … immutable match = (matcher.matchImpl() != 0) ^ (re.ir[pc].code == IR.NeglookaheadStart); in matchImpl()
646 auto matcher = new Matcher(slicedRe, s, mem, front, index); in matchImpl() local
651 auto matcher = new Matcher(slicedRe, s.loopBack(index), mem); in matchImpl() local
653 matcher.matches = matches[ms .. me]; in matchImpl()
654 matcher.backrefed = backrefed.empty ? matches : backrefed; in matchImpl()
655 … immutable match = (matcher.matchImpl() != 0) ^ (re.ir[pc].code == IR.NeglookbehindStart); in matchImpl()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/src/
H A Dgtest-death-test.cc380 Matcher<const std::string&> matcher, const char* file, in Create() argument
383 statement, std::move(matcher), file, line, test); in Create()
399 DeathTestImpl(const char* a_statement, Matcher<const std::string&> matcher) in DeathTestImpl() argument
401 matcher_(std::move(matcher)), in DeathTestImpl()
651 WindowsDeathTest(const char* a_statement, Matcher<const std::string&> matcher, in WindowsDeathTest() argument
653 : DeathTestImpl(a_statement, std::move(matcher)), in WindowsDeathTest()
815 FuchsiaDeathTest(const char* a_statement, Matcher<const std::string&> matcher, in FuchsiaDeathTest() argument
817 : DeathTestImpl(a_statement, std::move(matcher)), in FuchsiaDeathTest()
1075 ForkingDeathTest(const char* statement, Matcher<const std::string&> matcher);
1090 Matcher<const std::string&> matcher) in ForkingDeathTest() argument
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-death-test-internal.h83 static bool Create(const char* statement, Matcher<const std::string&> matcher,
150 Matcher<const std::string&> matcher, const char* file, in GTEST_DISABLE_MSC_WARNINGS_POP_()
157 bool Create(const char* statement, Matcher<const std::string&> matcher,
183 Matcher<const ::std::string&> matcher) { in MakeDeathTestMatcher()
184 return matcher; in MakeDeathTestMatcher()
/netbsd-src/external/gpl2/grep/dist/src/
H A Dgrep.h29 extern struct matcher struct
37 extern char const *matcher; argument
H A Dgrep.c1157 if (matcher && strcmp (matcher, m) != 0) in setmatcher()
1159 matcher = m; in setmatcher()
1682 if (! matcher) in main()
1684 matcher = __progname; in main()
1686 matcher = "grep"; in main()
1691 printf (_("%s (GNU grep) %s\n"), matcher, VERSION); in main()
1726 if (!install_matcher (matcher) && !install_matcher ("default")) in main()
H A Dgrepmat.c8 char const *matcher; variable
/netbsd-src/external/gpl2/grep/dist/
H A DTODO5 Fix the DFA matcher to never use exponential space. (Fortunately, these
8 Improve the performance of the regex backtracking matcher. This matcher
H A DREADME9 GNU grep is based on a fast lazy-state deterministic matcher (about
12 considered by the full regexp matcher without necessarily having to
H A DAUTHORS6 Richard Stallman and Karl Berry wrote the regex backtracking matcher.
19 non-matching text before calling the regexp matcher was originally due
/netbsd-src/external/gpl2/gettext/dist/gettext-tools/src/
H A Dmsggrep.c83 matcher_t *matcher; member
191 gt->matcher = &matcher_grep; in main()
234 grep_task[grep_pass].matcher = &matcher_egrep; in main()
287 grep_task[grep_pass].matcher = &matcher_fgrep; in main()
447 gt->matcher->compile (gt->patterns, gt->patterns_size, in main()
670 gt->matcher->execute (gt->compiled_patterns, str, len, in is_string_selected()
/netbsd-src/external/gpl2/diffutils/dist/lib/
H A Dexclude.c170 int (*matcher) PARAMS ((char const *, char const *, int)) = in excluded_filename() local
174 bool matched = ((*matcher) (pattern, f, options) == 0); in excluded_filename()
180 matched = ((*matcher) (pattern, p + 1, options) == 0); in excluded_filename()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/VE/
H A DVE.td36 // Use both VE register name matcher to accept "S0~S63" register names
37 // and default register matcher to accept other registeres.
/netbsd-src/external/bsd/elftosb/dist/common/
H A DELFSourceFile.cpp193 WildcardMatcher matcher; in createDataSource() local
194 return createDataSource(matcher); in createDataSource()
197 DataSource * ELFSourceFile::createDataSource(StringMatcher & matcher) in createDataSource() argument
224 if (matcher.match(name)) in createDataSource()
H A DSourceFile.cpp139 FixedMatcher matcher(section); in createDataSource() local
140 return createDataSource(matcher); in createDataSource()
/netbsd-src/external/bsd/tre/dist/
H A DTODO24 - Transposition operation for the approximate matcher?
36 - Make specialized versions of matcher loops for REG_NOSUB.
H A DChangeLog.old78 matcher loop one by one with a user specified function. Unless
79 the backtracking matcher is used, the user specified function does
88 approximate matcher and backtracking matcher, respectively.
92 matcher loops.
95 correctly in multibyte mode. Before the approximate matcher did
138 * tests/retest.c: Changed to run all tests with all matcher
141 matcher.
327 If the TNFA has a loop with an empty back reference, the matcher
360 matcher loop referred past an array, sometimes crashing.
377 reset if macros were used (this caused the wrong matcher to be
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Target/GlobalISel/
H A DTarget.td20 // GlobalISel matcher.
26 // Defines a matcher for complex operands. This is analogous to ComplexPattern
/netbsd-src/external/apache2/llvm/dist/llvm/utils/gn/secondary/llvm/lib/Target/Sparc/AsmParser/
H A DBUILD.gn5 args = [ "-gen-asm-matcher" ]

12345678