Searched refs:ParentStack (Results 1 - 2 of 2) sorted by relevance

/freebsd-12-stable/contrib/llvm-project/clang/lib/Tooling/Refactoring/
H A DASTSelection.cpp345 llvm::SmallVectorImpl<SelectedASTNode::ReferenceType> &ParentStack) {
352 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}});
360 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}});
365 ParentStack.push_back(std::cref(ASTSelection));
367 findDeepestWithKind(Child, MatchingNodes, Kind, ParentStack);
368 ParentStack.pop_back();
375 llvm::SmallVector<SelectedASTNode::ReferenceType, 16> ParentStack; local
376 findDeepestWithKind(ASTSelection, MatchingNodes, Kind, ParentStack);
341 findDeepestWithKind( const SelectedASTNode &ASTSelection, llvm::SmallVectorImpl<SelectedNodeWithParents> &MatchingNodes, SourceSelectionKind Kind, llvm::SmallVectorImpl<SelectedASTNode::ReferenceType> &ParentStack) argument
[all...]
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/
H A DASTContext.cpp10579 if (ParentStack.size() > 0) {
10592 if (const auto *D = ParentStack.back().get<Decl>())
10594 else if (const auto *S = ParentStack.back().get<Stmt>())
10597 NodeOrVector = new ast_type_traits::DynTypedNode(ParentStack.back());
10612 bool Found = ParentStack.back().getMemoizationData() &&
10614 ParentStack.back()) != Vector->end();
10616 Vector->push_back(ParentStack.back());
10619 ParentStack.push_back(createDynTypedNode(Node));
10621 ParentStack.pop_back();
10656 llvm::SmallVector<ast_type_traits::DynTypedNode, 16> ParentStack;
[all...]

Completed in 301 milliseconds