Searched refs:ParentStack (Results 1 – 2 of 2) sorted by relevance
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Tooling/Refactoring/ |
| H A D | ASTSelection.cpp | 346 llvm::SmallVectorImpl<SelectedASTNode::ReferenceType> &ParentStack) { in findDeepestWithKind() argument
353 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
361 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
366 ParentStack.push_back(std::cref(ASTSelection)); in findDeepestWithKind()
368 findDeepestWithKind(Child, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
369 ParentStack.pop_back(); in findDeepestWithKind()
376 llvm::SmallVector<SelectedASTNode::ReferenceType, 16> ParentStack; in findDeepestWithKind() local
377 findDeepestWithKind(ASTSelection, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/AST/ |
| H A D | ASTContext.cpp | 10206 if (ParentStack.size() > 0) { in TraverseNode()
10219 if (const auto *D = ParentStack.back().get<Decl>()) in TraverseNode()
10221 else if (const auto *S = ParentStack.back().get<Stmt>()) in TraverseNode()
10224 NodeOrVector = new ast_type_traits::DynTypedNode(ParentStack.back()); in TraverseNode()
10239 bool Found = ParentStack.back().getMemoizationData() && in TraverseNode()
10241 ParentStack.back()) != Vector->end(); in TraverseNode()
10243 Vector->push_back(ParentStack.back()); in TraverseNode()
10246 ParentStack.push_back(createDynTypedNode(Node)); in TraverseNode()
10248 ParentStack.pop_back(); in TraverseNode()
10279 llvm::SmallVector<ast_type_traits::DynTypedNode, 16> ParentStack; member in ASTContext::ParentMap::ASTVisitor
|