Lines Matching refs:match
36 // that match on every statement over a very large codebase.
44 // AST node twice. This struct is the key for looking up match
69 // Used to store the result of a match and possibly bound nodes.
101 // Returns true if a match is found in the subtree rooted at the
131 // no match in this recursive branch, the result set is empty
158 // hierarchy level. Thus, we try to match either of them.
163 // Match the Type.
164 if (!match(*TypeNode))
170 // on the same hierarchy level. Thus, we try to match all of them.
175 // Match the Type.
176 if (!match(*TypeLocNode.getType()))
178 // Match the QualType.
179 if (!match(TypeLocNode.getType()))
192 if (!match(*NNS.getNestedNameSpecifier()))
245 // returns, i.e. if no match is found or 'Bind' is 'BK_All'.
247 bool match(const T &Node) {
257 return false; // Abort as soon as a match is found.
263 // After the first match the matcher succeeds.
277 if (!match(Node))
293 // Controls the outermost traversal of the AST and allows to match multiple
384 // Note that we key on the bindings *before* the match.
452 void match(const ast_type_traits::DynTypedNode& Node) {
465 template <typename T> void match(const T &Node) {
466 match(ast_type_traits::DynTypedNode::create(Node));
486 // the result of the match along the way, as long as there is only a single
512 // calls to match might invalidate the result cache iterators.
528 // match above.
569 // the aggregated bound nodes for each match.
613 // Maps (matcher, node) -> the match result for memoization.
682 // current declaration did not match, we can safely return false.
700 match(*DeclNode);
708 match(*StmtNode);
713 match(TypeNode);
719 // We still want to find those types via matchers, so we match them here. Note
723 match(TypeLocNode);
724 match(TypeLocNode.getType());
729 match(*NNS);
735 match(NNS);
736 // We only match the nested name specifier here (as opposed to traversing it)
738 match(*NNS.getNestedNameSpecifier());
830 void MatchFinder::match(const clang::ast_type_traits::DynTypedNode &Node,
834 Visitor.match(Node);
