Lines Matching defs:Nodes
10 // Implements an algorithm to efficiently search for matches on AST nodes.
13 // The general idea is to visit all AST nodes with a RecursiveASTVisitor,
32 /// \brief A \c RecursiveASTVisitor that builds a map from nodes to their
39 /// FIXME: Currently only builds up the map using \c Stmt and \c Decl nodes.
93 // We currently only memoize on nodes whose pointers identify the
94 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
97 // FIXME: Benchmark whether memoization of non-pointer typed nodes
101 // Used to store the result of a match and possibly bound nodes.
104 BoundNodesTree Nodes;
231 // such that other nodes at the current level can be visited).
332 InsertResult.first->second.Nodes =
335 InsertResult.first->second.Nodes.copyTo(Builder);
384 "Invariant broken: only nodes that support memoization may be "
405 // the aggregated bound nodes for each match.
585 MatchFinder::MatchResult::MatchResult(const BoundNodes &Nodes,
587 : Nodes(Nodes), Context(Context),
