173   bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) {  in TraverseStmt()  argument
176       Queue = nullptr;  in TraverseStmt()
188     return VisitorBase::TraverseStmt(StmtToTraverse, Queue);  in TraverseStmt()
485   bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
493   bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) {  in dataTraverseNode()  argument
564           TraverseStmt(NE, Queue);  in dataTraverseNode()
574     return RecursiveASTVisitor<MatchASTVisitor>::dataTraverseNode(S, Queue);  in dataTraverseNode()
1008       std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end());  in matchesAnyAncestorOf()  local
1010       while (!Queue.empty()) {  in matchesAnyAncestorOf()
1012         if (Matcher.matches(Queue.front(), this, &BuilderCopy)) {  in matchesAnyAncestorOf()
1016         for (const auto &Parent : ActiveASTContext->getParents(Queue.front())) {  in matchesAnyAncestorOf()
1021             Queue.push_back(Parent);  in matchesAnyAncestorOf()
1023         Queue.pop_front();  in matchesAnyAncestorOf()
1231 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) {  in TraverseStmt()  argument
1240   return RecursiveASTVisitor<MatchASTVisitor>::TraverseStmt(StmtNode, Queue);  in TraverseStmt()