| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 189 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
190 int Id = 0, Depth = 0;
191 NodeId Parent;
192 SyntaxTree::Impl &Tree;
194 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
196 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
231 bool TraverseDecl(Decl *D) { in TraverseDecl()
239 bool TraverseStmt(Stmt *S) { in TraverseStmt()
249 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm10/llvm-10.0.1.src/tools/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 189 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
190 int Id = 0, Depth = 0;
191 NodeId Parent;
192 SyntaxTree::Impl &Tree;
194 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
196 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
231 bool TraverseDecl(Decl *D) { in TraverseDecl()
239 bool TraverseStmt(Stmt *S) { in TraverseStmt()
249 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/tools/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm90/llvm-9.0.1.src/tools/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 189 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
190 int Id = 0, Depth = 0;
191 NodeId Parent;
192 SyntaxTree::Impl &Tree;
194 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
196 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
231 bool TraverseDecl(Decl *D) { in TraverseDecl()
239 bool TraverseStmt(Stmt *S) { in TraverseStmt()
249 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() function
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/devel/llvm70/llvm-7.0.1.src/tools/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|
| /dports/lang/clang-mesa/clang-13.0.1.src/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 190 struct PreorderVisitor : public RecursiveASTVisitor<PreorderVisitor> { struct
191 int Id = 0, Depth = 0;
192 NodeId Parent;
193 SyntaxTree::Impl &Tree;
195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() argument
197 template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) { in PreTraverse()
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
232 bool TraverseDecl(Decl *D) { in TraverseDecl()
240 bool TraverseStmt(Stmt *S) { in TraverseStmt()
250 bool TraverseType(QualType T) { return true; } in TraverseType()
[all …]
|