Searched refs:ParentStack (Results 1 – 2 of 2) sorted by relevance
| /llvm-project-15.0.7/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 363 if (ParentStack.empty()) in addParent()
378 if (const auto *D = ParentStack.back().get<Decl>()) in addParent()
380 else if (const auto *S = ParentStack.back().get<Stmt>()) in addParent()
383 NodeOrVector = new DynTypedNode(ParentStack.back()); in addParent()
397 bool Found = ParentStack.back().getMemoizationData() && in addParent()
400 Vector->push_back(ParentStack.back()); in addParent()
414 ParentStack.push_back(createDynTypedNode(Node)); in TraverseNode()
416 ParentStack.pop_back(); in TraverseNode()
452 ParentStack.push_back(DynTypedNode::create(*StmtNode)); in dataTraverseStmtPre()
456 ParentStack.pop_back(); in dataTraverseStmtPost()
[all …]
|
| /llvm-project-15.0.7/clang/lib/Tooling/Refactoring/ |
| H A D | ASTSelection.cpp | 344 llvm::SmallVectorImpl<SelectedASTNode::ReferenceType> &ParentStack) { in findDeepestWithKind() argument
351 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
359 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}}); in findDeepestWithKind()
364 ParentStack.push_back(std::cref(ASTSelection)); in findDeepestWithKind()
366 findDeepestWithKind(Child, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
367 ParentStack.pop_back(); in findDeepestWithKind()
374 llvm::SmallVector<SelectedASTNode::ReferenceType, 16> ParentStack; in findDeepestWithKind() local
375 findDeepestWithKind(ASTSelection, MatchingNodes, Kind, ParentStack); in findDeepestWithKind()
|