Searched refs:ParentStack (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 373 if (ParentStack.empty()) in addParent()
388 if (const auto *D = ParentStack.back().get<Decl>()) in addParent()
390 else if (const auto *S = ParentStack.back().get<Stmt>()) in addParent()
393 NodeOrVector = new DynTypedNode(ParentStack.back()); in addParent()
407 bool Found = ParentStack.back().getMemoizationData() && in addParent()
408 llvm::is_contained(*Vector, ParentStack.back()); in addParent()
410 Vector->push_back(ParentStack.back()); in addParent()
424 ParentStack.push_back(createDynTypedNode(Node)); in TraverseNode()
426 ParentStack.pop_back(); in TraverseNode()
462 ParentStack.push_back(DynTypedNode::create(*StmtNode)); in dataTraverseStmtPre()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Refactoring/ |
| H A D | ASTSelection.cpp | 345 llvm::SmallVectorImpl<SelectedASTNode::ReferenceType> &ParentStack) { in findDeepestWithKind() argument
352 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
360 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
365 ParentStack.push_back(std::cref(ASTSelection)); in findDeepestWithKind()
367 findDeepestWithKind(Child, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
368 ParentStack.pop_back(); in findDeepestWithKind()
375 llvm::SmallVector<SelectedASTNode::ReferenceType, 16> ParentStack; in findDeepestWithKind() local
376 findDeepestWithKind(ASTSelection, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
|