Home
last modified time | relevance | path

Searched refs:DynTypedNode (Results 1 – 23 of 23) sorted by relevance

/openbsd-src/gnu/llvm/clang/lib/AST/
H A DParentMapContext.cpp45 DynTypedNode ParentMapContext::traverseIgnored(const DynTypedNode &N) const { in traverseIgnored()
47 return DynTypedNode::create(*traverseIgnored(E)); in traverseIgnored()
64 using ParentVector = llvm::SmallVector<DynTypedNode, 2>;
72 DynTypedNode *, ParentVector *>>;
77 llvm::DenseMap<DynTypedNode,
79 DynTypedNode *, ParentVector *>>;
85 static DynTypedNode
88 return DynTypedNode::create(*D); in getSingleDynTypedNodeFromParentMap()
90 return DynTypedNode::create(*S); in getSingleDynTypedNodeFromParentMap()
91 return *U.get<DynTypedNode *>(); in getSingleDynTypedNodeFromParentMap()
[all …]
H A DASTTypeTraits.cpp171 void DynTypedNode::print(llvm::raw_ostream &OS, in print()
204 void DynTypedNode::dump(llvm::raw_ostream &OS, in dump()
216 SourceRange DynTypedNode::getSourceRange() const { in getSourceRange()
/openbsd-src/gnu/llvm/clang/include/clang/AST/
H A DParentMapContext.h55 DynTypedNodeList getParents(const DynTypedNode &Node);
65 DynTypedNode traverseIgnored(const DynTypedNode &N) const;
94 DynTypedNode SingleNode;
95 ArrayRef<DynTypedNode> Nodes;
100 DynTypedNodeList(const DynTypedNode &N) : IsSingleNode(true) { in DynTypedNodeList()
101 new (&SingleNode) DynTypedNode(N); in DynTypedNodeList()
104 DynTypedNodeList(ArrayRef<DynTypedNode> A) : IsSingleNode(false) { in DynTypedNodeList()
105 new (&Nodes) ArrayRef<DynTypedNode>(A); in DynTypedNodeList()
108 const DynTypedNode *begin() const { in begin()
112 const DynTypedNode *end() const { in end()
[all …]
H A DASTTypeTraits.h248 class DynTypedNode {
252 static DynTypedNode create(const T &Node) {
309 bool operator<(const DynTypedNode &Other) const {
339 bool operator==(const DynTypedNode &Other) const {
359 bool operator!=(const DynTypedNode &Other) const {
366 static inline DynTypedNode getEmptyKey() {
367 DynTypedNode Node;
371 static inline DynTypedNode getTombstoneKey() {
372 DynTypedNode Node;
376 static unsigned getHashValue(const DynTypedNode &Val) {
[all …]
H A DASTNodeTraverser.h275 void Visit(const DynTypedNode &N) { in Visit()
/openbsd-src/gnu/llvm/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h195 match(clang::DynTypedNode::create(Node), Context); in match()
197 void match(const clang::DynTypedNode &Node, ASTContext &Context);
257 SmallVector<BoundNodes, 1> match(MatcherT Matcher, const DynTypedNode &Node,
302 SmallVector<BoundNodes, 1> match(MatcherT Matcher, const DynTypedNode &Node, in match()
314 return match(Matcher, DynTypedNode::create(Node), Context); in match()
328 matchDynamic(internal::DynTypedMatcher Matcher, const DynTypedNode &Node, in matchDynamic()
341 return matchDynamic(Matcher, DynTypedNode::create(Node), Context); in matchDynamic()
H A DASTMatchersInternal.h220 void addNode(StringRef ID, const DynTypedNode &DynNode) {
237 DynTypedNode getNode(StringRef ID) const {
240 return DynTypedNode();
255 using IDToNodeMap = std::map<std::string, DynTypedNode, std::less<>>;
294 void setBinding(StringRef Id, const DynTypedNode &DynNode) {
350 virtual bool dynMatches(const DynTypedNode &DynNode, ASTMatchFinder *Finder,
376 bool dynMatches(const DynTypedNode &DynNode, ASTMatchFinder *Finder,
473 bool matches(const DynTypedNode &DynNode, ASTMatchFinder *Finder,
480 bool matchesNoKindCheck(const DynTypedNode &DynNode, ASTMatchFinder *Finder,
613 return Implementation.matches(DynTypedNode::create(Node), Finder, Builder);
[all …]
H A DASTMatchers.h5410 Predicate.Node = DynTypedNode::create(Node); in AST_POLYMORPHIC_MATCHER_P()
8013 llvm::SmallVector<DynTypedNode, 8> Stack(Parents.begin(), Parents.end()); in AST_MATCHER_P()
8063 llvm::SmallVector<DynTypedNode, 8> Stack(Parents.begin(), Parents.end()); in AST_MATCHER_P()
/openbsd-src/gnu/llvm/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp68 DynTypedNode Node;
116 bool findMatch(const DynTypedNode &DynNode) { in findMatch()
376 if (Matcher->matches(DynTypedNode::create(Node), Finder, in match()
384 if (Matcher->matches(DynTypedNode::create(Node), Finder, in match()
594 bool memoizedMatchesRecursively(const DynTypedNode &Node, ASTContext &Ctx, in memoizedMatchesRecursively()
629 bool matchesRecursively(const DynTypedNode &Node, in matchesRecursively()
660 bool matchesChildOf(const DynTypedNode &Node, ASTContext &Ctx, in matchesChildOf()
668 bool matchesDescendantOf(const DynTypedNode &Node, ASTContext &Ctx, in matchesDescendantOf()
678 bool matchesAncestorOf(const DynTypedNode &Node, ASTContext &Ctx, in matchesAncestorOf()
693 void match(const DynTypedNode &Node) { in match()
[all …]
H A DASTMatchersInternal.cpp52 static bool notUnaryOperator(const DynTypedNode &DynNode,
57 static bool allOfVariadicOperator(const DynTypedNode &DynNode,
62 static bool eachOfVariadicOperator(const DynTypedNode &DynNode,
67 static bool anyOfVariadicOperator(const DynTypedNode &DynNode,
72 static bool optionallyVariadicOperator(const DynTypedNode &DynNode,
112 const DynTypedNode &DynNode, ASTMatchFinder *Finder,
121 bool dynMatches(const DynTypedNode &DynNode, ASTMatchFinder *Finder, in dynMatches()
136 bool dynMatches(const DynTypedNode &DynNode, ASTMatchFinder *Finder, in dynMatches()
157 bool dynMatches(const DynTypedNode &, ASTMatchFinder *, in dynMatches() argument
174 bool dynMatches(const DynTypedNode &DynNode, ASTMatchFinder *Finder, in dynMatches()
[all …]
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/ASTDiff/
H A DASTDiffInternal.h18 using DynTypedNode = DynTypedNode; variable
H A DASTDiff.h41 DynTypedNode ASTNode;
/openbsd-src/gnu/llvm/clang/lib/Tooling/Transformer/
H A DRangeSelector.cpp54 static Expected<DynTypedNode> getNode(const ast_matchers::BoundNodes &Nodes, in getNode()
143 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in node()
156 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in statement()
190 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in member()
202 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in name()
260 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in operator ()()
H A DStencil.cpp36 static llvm::Expected<DynTypedNode> getNode(const BoundNodes &Nodes, in getNode()
H A DRewriteRule.cpp328 transformer::detail::rewriteDescendants(const DynTypedNode &DNode, in rewriteDescendants()
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/Refactoring/
H A DASTSelection.h53 DynTypedNode Node;
57 SelectedASTNode(const DynTypedNode &Node, SourceSelectionKind SelectionKind) in SelectedASTNode()
/openbsd-src/gnu/llvm/clang/lib/Tooling/Refactoring/
H A DASTSelection.cpp50 SelectedASTNode(DynTypedNode::create(*Context.getTranslationUnitDecl()), in ASTSelectionFinder()
98 SelectedASTNode(DynTypedNode::create(*D), SelectionKind)); in TraverseDecl()
126 SelectedASTNode(DynTypedNode::create(*S), SelectionKind)); in TraverseStmt()
425 const DynTypedNode &Node = Parent.get().Node; in isInFunctionLikeBodyOfCode()
443 const DynTypedNode &Node = Parent.get().Node; in getFunctionLikeNearestParent()
/openbsd-src/gnu/llvm/clang/lib/Tooling/
H A DEmptyNodeIntrospection.inc.in44 NodeIntrospection::GetLocations(clang::DynTypedNode const &) {
/openbsd-src/gnu/llvm/clang/lib/Analysis/
H A DUnsafeBufferUsage.cpp40 bool findMatch(const DynTypedNode &DynNode) { in findMatch()
94 if (Matcher->matches(DynTypedNode::create(Node), Finder, in match()
116 return Visitor.findMatch(DynTypedNode::create(Node)); in AST_MATCHER_P()
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/
H A DNodeIntrospection.h97 NodeLocationAccessors GetLocations(clang::DynTypedNode const &Node);
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/Transformer/
H A DRewriteRule.h505 rewriteDescendants(const DynTypedNode &Node, RewriteRule Rule,
/openbsd-src/gnu/llvm/clang/lib/Tooling/Refactoring/Rename/
H A DUSRLocFinder.cpp448 getClosestAncestorDecl(DynTypedNode::create(TargetLoc)), in VisitTypeLoc()
/openbsd-src/gnu/llvm/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp202 N.ASTNode = DynTypedNode::create(*ASTNode); in PreTraverse()
413 const DynTypedNode &DTN = N.ASTNode; in getNodeValue()