Lines Matching refs:traverse
84 // to traverse: use 1 for matching the children and INT_MAX for
106 // - Traverse(node) calls BaseTraverse(node) when it needs
108 // - BaseTraverse(node) then calls (via VisitorBase::Traverse*(node))
109 // Traverse*(c) for each child c of 'node'.
110 // - Traverse*(c) in turn calls Traverse(c), completing the
115 traverse(*D);
117 traverse(*S);
120 traverse(*NNS);
123 traverse(*NNSLoc);
125 traverse(*Q);
127 traverse(*T);
143 return (DeclNode == NULL) || traverse(*DeclNode);
155 return (StmtToTraverse == NULL) || traverse(*StmtToTraverse);
166 // The QualType is matched inside traverse.
167 return traverse(TypeNode);
181 // The TypeLoc is matched inside traverse.
182 return traverse(TypeLocNode);
186 return (NNS == NULL) || traverse(*NNS);
194 return traverse(NNS);
199 // Disables data recursion. We intercept Traverse* methods in the RAV, which
219 // Forwards the call to the corresponding Traverse*() method in the
274 bool traverse(const T &Node) {
326 // The following Visit*() and Traverse*() functions "override"
474 // Disables data recursion. We intercept Traverse* methods in the RAV, which
