| /src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| ClangCommentHTMLTagsEmitter.cpp | 24 std::vector<StringMatcher::StringPair> Matches;
26 Matches.emplace_back(std::string(Tag->getValueAsString("Spelling")),
33 StringMatcher("Name", Matches, OS).Emit();
|
| ClangCommentCommandInfoEmitter.cpp | 63 std::vector<StringMatcher::StringPair> Matches;
69 Matches.emplace_back(std::move(Name), std::move(Return));
74 StringMatcher("Name", Matches, OS).Emit();
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/TableGen/ |
| StringMatcher.h | 28 /// If a match is found, the code in Matches[i].second is executed; control must
29 /// not exit this code fragment. If nothing matches, execution falls through.
36 const std::vector<StringPair> &Matches;
41 const std::vector<StringPair> &matches, raw_ostream &os)
42 : StrVariableName(strVariableName), Matches(matches), OS(os) {}
47 bool EmitStringMatcherForChar(const std::vector<const StringPair *> &Matches,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/ |
| NativeEnumTypes.h | 39 std::vector<codeview::TypeIndex> Matches;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| LoopWidening.cpp | 70 auto Matches = match(
74 for (BoundNodes Match : Matches) {
|
| BugReporterVisitors.cpp | 468 auto Matches = match(ParentM, *Parent->getBody(), Parent->getASTContext());
469 for (BoundNodes &Match : Matches) {
|
| RegionStore.cpp | 1085 auto Matches =
1089 for (BoundNodes &Match : Matches) {
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| PointerIterationChecker.cpp | 87 auto Matches = match(MatcherM, *D, AM.getASTContext());
88 for (const auto &Match : Matches)
|
| PointerSortingChecker.cpp | 101 auto Matches = match(MatcherM, *D, AM.getASTContext());
102 for (const auto &Match : Matches)
|
| GCDAntipatternChecker.cpp | 212 auto Matches = match(SemaphoreMatcherM, *D->getBody(), AM.getASTContext());
213 for (BoundNodes Match : Matches)
217 Matches = match(GroupMatcherM, *D->getBody(), AM.getASTContext());
218 for (BoundNodes Match : Matches)
|
| ObjCAutoreleaseWriteChecker.cpp | 227 auto Matches = match(MatcherM, *D, AM.getASTContext());
228 for (BoundNodes Match : Matches)
|
| RunLoopAutoreleaseLeakChecker.cpp | 168 auto Matches = match(GroupM, *D, AM.getASTContext());
169 for (BoundNodes Match : Matches)
188 auto Matches = match(GroupM, *D, AM.getASTContext());
190 for (BoundNodes Match : Matches)
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| Regex.cpp | 81 /// matches it contains.
86 bool Regex::match(StringRef String, SmallVectorImpl<StringRef> *Matches,
96 unsigned nmatch = Matches ? preg->re_nsub+1 : 0;
118 if (Matches) { // match position requested
119 Matches->clear();
124 Matches->push_back(StringRef());
128 Matches->push_back(StringRef(String.data()+pm[i].rm_so,
138 SmallVector<StringRef, 8> Matches;
141 if (!match(String, &Matches, Error))
146 std::string Res(String.begin(), Matches[0].begin())
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| PrintfFormatString.cpp | 134 SmallVector<StringRef, 2> Matches;
136 if (R.match(Str, &Matches)) {
137 MatchedStr = Matches[1];
138 I += Matches[0].size();
851 // If we're going to offer a fix anyway, make sure the sign matches.
|
| /src/external/apache2/llvm/dist/clang/tools/clang-refactor/ |
| TestSupport.cpp | 327 SmallVector<StringRef, 4> Matches;
341 if (!RangeRegex.match(Comment, &Matches) || Comment.contains("CHECK")) {
348 if (!Matches[2].empty()) {
350 if (Matches[2].drop_front().getAsInteger(10, ColumnOffset))
356 if (!Matches[3].empty()) {
360 if (!EndLocRegex.match(Matches[3], &EndLocMatches)) {
376 Matches[1].str(), SmallVector<TestSelectionRange, 8>{Range}));
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ExprMutationAnalyzer.cpp | 27 return InnerMatcher.matches(*Range, Finder, Builder);
39 return InnerMatcher.matches(*Result, Finder, Builder);
54 // The 'ConditionalOperator' matches on `<anything> ? <expr> : <expr>`.
74 return ComplexMatcher.matches(Node, Finder, Builder);
83 if (InnerMatcher.matches(*Arg, Finder, &Result)) {
100 return InnerMatcher.matches(*Node.getControllingExpr(), Finder, Builder);
130 const Stmt *tryEachMatch(ArrayRef<ast_matchers::BoundNodes> Matches,
133 for (const auto &Nodes : Matches) {
229 ExprMutationAnalyzer::findExprMutation(ArrayRef<BoundNodes> Matches) {
230 return tryEachMatch<Expr>(Matches, this, &ExprMutationAnalyzer::findMutation)
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/ |
| gtest-matchers.h | 78 // used by a matcher to explain why a value matches or doesn't match.
144 // Returns true if and only if the matcher matches x; also explains the
261 // Returns true if and only if the matcher matches x; also explains the
267 // Returns true if and only if this matcher matches x.
268 bool Matches(const T& x) const {
281 // Explains why x matches, or doesn't match, the matcher.
321 // object that can check whether a value of type T matches. The
640 // Matches anything that can convert to std::string.
653 *os << (full_match_ ? "matches" : "contains") << " regular expression ";
669 // Matches a string that fully matches regular expression 'regex'
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 9 // Implements an algorithm to efficiently search for matches on AST nodes.
10 // Uses memoization to support recursive matches like HasDescendant.
13 // calling the Matches(...) method of each matcher we are running on each
92 // Creates an AST visitor that matches 'matcher' on all children or
102 Bind(Bind), Matches(false) {}
143 return Matches;
316 Matches = false;
349 // Sets 'Matched' to true if 'Matcher' matches 'Node' and:
361 if (Matcher->matches(DynTypedNode::create(Node), Finder,
363 Matches = true
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Passes/ |
| PassBuilder.cpp | 2551 SmallVector<StringRef, 3> Matches;
2552 if (!DefaultAliasRegex.match(Name, &Matches))
2557 assert(Matches.size() == 3 && "Must capture two matched strings!");
2559 OptimizationLevel L = StringSwitch<OptimizationLevel>(Matches[2])
2566 if (L == OptimizationLevel::O0 && Matches[1] != "thinlto" &&
2567 Matches[1] != "lto") {
2568 MPM.addPass(buildO0DefaultPipeline(L, Matches[1] == "thinlto-pre-link" ||
2569 Matches[1] == "lto-pre-link"));
2581 if (Matches[1] == "default") {
2583 } else if (Matches[1] == "thinlto-pre-link")
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/ |
| llvm-pdbutil.cpp | 538 "With -globals, only dump globals whose name matches the given value"),
1404 llvm::SmallVector<llvm::StringRef, 2> Matches;
1405 if (!R.match(Str, &Matches))
1409 if (!to_integer(Matches[1], Parsed->Min))
1412 if (!Matches[3].empty()) {
1414 if (!to_integer(Matches[3], *Parsed->Max))
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ |
| ASTDiff.cpp | 65 /// Matches nodes one-by-one based on their similarity.
580 std::vector<std::pair<NodeId, NodeId>> Matches;
622 Matches.emplace_back(Id1, Id2);
633 return Matches;
|
| /src/external/apache2/llvm/dist/llvm/lib/FileCheck/ |
| FileCheck.cpp | 976 // RegEx matches.
1003 // in two forms: [[foo:.*]] and [[foo]]. The former matches .* (or some
1186 // Handle fixed string matches.
1341 // example regular expression which matches, and use that as the example
1377 // substitution matches or was captured from exactly that range.
1798 SmallVector<StringRef, 2> Matches;
1802 if (!PrefixRE.match(Buffer, &Matches))
1806 StringRef Prefix = Matches[0];
1807 Matches.clear();
1838 // We ran out of buffer while skipping partial matches so give up
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaTemplateDeduction.cpp | 935 // Check the new pack matches any previous value.
1222 /// means no matches, "success" found a single item, and the
1243 // successful matches. Visited contains the set of nodes we have already
1245 // visit. Matches contains a list of matches that have yet to be
1252 Matches;
1280 // If this was a successful deduction, add it to the list of matches,
1283 Matches.insert({NextT, DeducedCopy});
1288 // At this point, 'Matches' contains a list of seemingly valid bases, however
1290 // of one of the matches might be disqualified for being a base of anothe
[all...] |
| SemaTemplate.cpp | 2924 bool Matches(unsigned ParmDepth, SourceLocation Loc = SourceLocation()) {
2952 return !Matches(TL.getTypePtr()->getDepth(), TL.getNameLoc());
2957 return IgnoreNonTypeDependent || !Matches(T->getDepth());
2963 if (Matches(PD->getDepth()))
2971 if (Matches(PD->getDepth(), E->getExprLoc()))
7417 // A template-argument matches a template template-parameter P when P
7424 // If P contains a parameter pack, then A [...] matches P if each of A's
7425 // template parameters matches the corresponding template parameter in
7833 // A template-argument matches a template template-parameter (call it P)
7836 // (call it A) matches the corresponding template parameter in th
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/ |
| gmock-matchers.h | 310 // A<T>() returns a matcher that matches any value of type T.
336 // Matches the value against the given matcher, prints the value and explains
347 return matcher.Matches(value);
369 // TuplePrefix<N>::Matches(matcher_tuple, value_tuple) returns true
370 // if and only if the first N fields of matcher_tuple matches
373 static bool Matches(const MatcherTuple& matcher_tuple,
375 return TuplePrefix<N - 1>::Matches(matcher_tuple, value_tuple) &&
376 std::get<N - 1>(matcher_tuple).Matches(std::get<N - 1>(value_tuple));
418 static bool Matches(const MatcherTuple& /* matcher_tuple */,
442 return TuplePrefix<std::tuple_size<ValueTuple>::value>::Matches(matcher_tuple
2395 const bool matches = inner_matcher_.MatchAndExplain(*it, &inner_listener); local
[all...] |
