Home
last modified time | relevance | path

Searched refs:Tree (Results 1 – 25 of 104) sorted by relevance

12345

/llvm-project/llvm/unittests/ADT/
H A DIntervalTreeTest.cpp79 UUTree Tree(Allocator); in TEST() local
83 EXPECT_TRUE(Tree.empty()); in TEST()
84 Tree.clear(); in TEST()
85 EXPECT_TRUE(Tree.empty()); in TEST()
91 Tree.insert(10, 20, 10.20); in TEST()
92 Tree.insert(30, 40, 30.40); in TEST()
93 Tree.create(); in TEST()
97 Intervals = Tree.getContaining(Point); in TEST()
102 Intervals = Tree.getContaining(Point); in TEST()
107 Intervals = Tree.getContaining(Point); in TEST()
[all …]
/llvm-project/clang/include/clang/Tooling/Syntax/
H A DTree.h44 class Tree; variable
90 const Tree *getParent() const { return Parent; } in getParent()
91 Tree *getParent() { return Parent; } in getParent()
111 friend class Tree;
121 Tree *Parent;
144 class Tree : public Node {
186 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
191 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf()); in findLastLeaf()
215 return const_cast<Node *>(const_cast<const Tree *>(this)->findChild(R)); in findChild()
254 class List : public Tree {
[all …]
H A DNodes.h127 class UnqualifiedId final : public Tree {
129 UnqualifiedId() : Tree(NodeKind::UnqualifiedId) {} in UnqualifiedId()
209 class Statement : public Tree {
211 Statement(NodeKind K) : Tree(K) {} in Statement()
354 class Declaration : public Tree {
356 Declaration(NodeKind K) : Tree(K) {} in Declaration()
486 class Declarator : public Tree {
488 Declarator(NodeKind K) : Tree(K) {} in Declarator()
515 class ArraySubscript final : public Tree {
517 ArraySubscript() : Tree(NodeKind::ArraySubscript) {} in ArraySubscript()
[all …]
H A DNodes.td1 //===- Nodes.td - Node types in the Syntax Tree grammar -------------------===//
26 def UnqualifiedId : External<Tree> {}
29 def List : External<Tree> {}
42 def UnaryOperatorExpression : External<Tree> {}
221 def Statement : External<Tree> {}
239 def Declaration : External<Tree> {}
254 def Declarator : External<Tree> {}
258 def ArraySubscript : External<Tree> {}
259 def TrailingReturnType : External<Tree> {}
260 def ParametersAndQualifiers : External<Tree> {}
[all …]
H A DSyntax.td53 def Tree : External<Node> {}
60 class Alternatives<NodeType base_ = Tree> : NodeType { let base = base_; }
64 class Unconstrained<NodeType base_ = Tree> : NodeType { let base = base_; }
79 class Sequence<NodeType base_ = Tree> : NodeType {
/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp72 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped() argument
74 if (&*Tree == &T1) in getMapped()
76 assert(&*Tree == &T2 && "Invalid tree."); in getMapped()
192 SyntaxTree::Impl &Tree; member
194 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor()
198 Tree.Nodes.emplace_back(); in PreTraverse()
199 Node &N = Tree.getMutableNode(MyId); in PreTraverse()
206 Node &P = Tree.getMutableNode(Parent); in PreTraverse()
212 return std::make_tuple(MyId, Tree.getNode(MyId).Parent); in PreTraverse()
220 Node &N = Tree.getMutableNode(MyId); in PostTraverse()
[all …]
/llvm-project/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp41 ChildMap Tree;
92 auto [II, E] = Tree.equal_range(Base);
161 Tree.insert({B, R}); in EmitNode()
211 printDeclContext(const std::multimap<const Record *, const Record *> &Tree, in run()
215 auto [II, E] = Tree.equal_range(DeclContext); in run()
217 printDeclContext(Tree, II->second, OS); in run()
232 std::multimap<const Record *, const Record *> Tree; in printDeclContext()
236 Tree.insert({B, R});
241 printDeclContext(Tree, DeclContext, OS); in EmitClangDeclContext()
42 ChildMap Tree; global() member in __anon45288b380111::ClangASTNodesEmitter
226 printDeclContext(const std::multimap<Record *,Record * > & Tree,Record * DeclContext,raw_ostream & OS) printDeclContext() argument
253 std::multimap<Record *, Record *> Tree; EmitClangDeclContext() local
/llvm-project/llvm/test/CodeGen/AArch64/
H A DO3-pipeline.ll27 ; CHECK-NEXT: Dominator Tree Construction
30 ; CHECK-NEXT: Dominator Tree Construction
57 ; CHECK-NEXT: Post-Dominator Tree Construction
70 ; CHECK-NEXT: Post-Dominator Tree Construction
79 ; CHECK-NEXT: Dominator Tree Construction
84 ; CHECK-NEXT: Dominator Tree Construction
96 ; CHECK-NEXT: Dominator Tree Construction
99 ; CHECK-NEXT: Dominator Tree Construction
103 ; CHECK-NEXT: Dominator Tree Construction
107 ; CHECK-NEXT: Dominator Tree Constructio
[all...]
/llvm-project/llvm/test/CodeGen/ARM/
H A DO3-pipeline.ll12 ; CHECK-NEXT: Dominator Tree Construction
35 ; CHECK-NEXT: Post-Dominator Tree Construction
56 ; CHECK-NEXT: Dominator Tree Construction
69 ; CHECK-NEXT: Dominator Tree Construction
80 ; CHECK-NEXT: Post-Dominator Tree Construction
94 ; CHECK-NEXT: MachineDominator Tree Construction
98 ; CHECK-NEXT: MachineDominator Tree Construction
101 ; CHECK-NEXT: MachinePostDominator Tree Construction
106 ; CHECK-NEXT: MachineDominator Tree Construction
112 ; CHECK-NEXT: MachineDominator Tree Constructio
[all...]
/llvm-project/clang/lib/AST/
H A DASTDiagnostic.cpp950 DiffTree Tree;
1177 Tree.SetTypeDiff(FromType, ToType, FromDefault, ToDefault); in DiffTypes()
1178 Tree.SetSame(!FromType.isNull() && !ToType.isNull() && in DiffTypes()
1187 Tree.SetTemplateDiff(FromArgTST->getTemplateName().getAsTemplateDecl(), in DiffTypes()
1200 Tree.SetTemplateTemplateDiff(FromDecl, ToDecl, FromIter.isEnd() && FromDecl, in DiffTemplateTemplates()
1202 Tree.SetSame(FromDecl && ToDecl && in DiffTemplateTemplates()
1324 Tree.SetFromDeclarationAndToIntegerDiff( in DiffNonTypes()
1327 Tree.SetSame(false); in DiffNonTypes()
1333 Tree.SetFromIntegerAndToDeclarationDiff( in DiffNonTypes()
1336 Tree in DiffNonTypes()
952 DiffTree Tree; global() member in __anoned0faff10111::TemplateDiff
[all...]
/llvm-project/clang/unittests/Tooling/Syntax/
H A DTreeTest.cpp9 #include "clang/Tooling/Syntax/Tree.h"
25 Tree *createTree(ArrayRef<const Node *> Children) { in createTree()
39 std::vector<std::vector<const Tree *>>
50 std::vector<std::vector<const Tree *>> AllForests; in generateAllForests()
65 // `Node`s per layer. An example of Tree with `Base` = {`(`, `)`} and
67 // Tree
68 // |-Tree
69 // `-Tree
70 // |-Tree
72 // `-Tree
113 for (const auto *Tree : generateAllTreesWithShape(Leafs, {3u})) { TEST_P() local
123 for (const auto *Tree : generateAllTreesWithShape(Leafs, {3u})) { TEST_P() local
134 auto *Tree = syntax::createTree(*Arena, TEST_F() local
[all...]
/llvm-project/clang/tools/clang-diff/
H A DClangDiff.cpp267 diff::SyntaxTree &Tree, bool IsLeft, in printHtmlForNode() argument
269 const diff::Node &Node = Tree.getNode(Id); in printHtmlForNode()
272 diff::NodeId TargetId = Diff.getMapped(Tree, Id); in printHtmlForNode()
285 std::tie(Begin, End) = Tree.getSourceRangeOffsets(Node); in printHtmlForNode()
286 const SourceManager &SrcMgr = Tree.getASTContext().getSourceManager(); in printHtmlForNode()
295 std::string Value = Tree.getNodeValue(Node); in printHtmlForNode()
306 Offset = printHtmlForNode(OS, Diff, Tree, IsLeft, Child, Offset); in printHtmlForNode()
310 if (Id == Tree.getRootId()) { in printHtmlForNode()
344 static void printNodeAttributes(raw_ostream &OS, diff::SyntaxTree &Tree, argument
346 const diff::Node &N = Tree.getNode(Id);
/llvm-project/llvm/test/CodeGen/PowerPC/
H A DO3-pipeline.ll28 ; CHECK-NEXT: Dominator Tree Construction
59 ; CHECK-NEXT: Post-Dominator Tree Construction
73 ; CHECK-NEXT: Dominator Tree Construction
94 ; CHECK-NEXT: Post-Dominator Tree Construction
100 ; CHECK-NEXT: MachineDominator Tree Construction
104 ; CHECK-NEXT: MachineDominator Tree Construction
114 ; CHECK-NEXT: MachineDominator Tree Construction
122 ; CHECK-NEXT: MachineDominator Tree Construction
125 ; CHECK-NEXT: MachinePostDominator Tree Construction
130 ; CHECK-NEXT: MachineDominator Tree Constructio
[all...]
/llvm-project/clang/lib/Tooling/Syntax/
H A DTree.cpp21 if (auto *T = dyn_cast<syntax::Tree>(N)) { in traverse()
52 void syntax::Tree::appendChildLowLevel(Node *Child, NodeRole Role) { in appendChildLowLevel()
60 void syntax::Tree::appendChildLowLevel(Node *Child) { in appendChildLowLevel()
76 void syntax::Tree::prependChildLowLevel(Node *Child, NodeRole Role) { in prependChildLowLevel()
84 void syntax::Tree::prependChildLowLevel(Node *Child) { in prependChildLowLevel()
100 void syntax::Tree::replaceChildRangeLowLevel(Node *Begin, Node *End, in replaceChildRangeLowLevel()
195 const auto *T = cast<syntax::Tree>(N); in dumpNode()
246 const auto *T = dyn_cast<Tree>(this); in assertInvariants()
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
287 if (const auto *L = cast<syntax::Tree>(C).findFirstLeaf()) in findFirstLeaf()
[all …]
H A DComputeReplacements.cpp21 void enumerateTokenSpans(const syntax::Tree *Root, in enumerateTokenSpans()
30 void run(const syntax::Tree *Root) { in enumerateTokenSpans()
39 if (auto *T = dyn_cast<syntax::Tree>(N)) { in enumerateTokenSpans()
H A DSynthesis.cpp22 static void prependChildLowLevel(syntax::Tree *T, syntax::Node *Child, in prependChildLowLevel()
26 static void appendChildLowLevel(syntax::Tree *T, syntax::Node *Child, in appendChildLowLevel()
70 syntax::Tree *allocateTree(syntax::Arena &A, syntax::NodeKind Kind) { in allocateTree()
204 syntax::Tree *clang::syntax::createTree( in createTree()
226 const auto *T = cast<syntax::Tree>(N); in deepCopyExpandingMacros()
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Dllc-pipeline.ll38 ; GCN-O0-NEXT: Dominator Tree Construction
64 ; GCN-O0-NEXT: Post-Dominator Tree Construction
65 ; GCN-O0-NEXT: Dominator Tree Construction
69 ; GCN-O0-NEXT: Dominator Tree Construction
74 ; GCN-O0-NEXT: Post-Dominator Tree Construction
97 ; GCN-O0-NEXT: Dominator Tree Construction
102 ; GCN-O0-NEXT: MachineDominator Tree Construction
104 ; GCN-O0-NEXT: MachinePostDominator Tree Construction
112 ; GCN-O0-NEXT: MachineDominator Tree Construction
139 ; GCN-O0-NEXT: MachineDominator Tree Constructio
[all...]
/llvm-project/llvm/test/CodeGen/M68k/
H A Dpipeline.ll9 ; CHECK-NEXT: Dominator Tree Construction
29 ; CHECK-NEXT: Post-Dominator Tree Construction
43 ; CHECK-NEXT: Dominator Tree Construction
55 ; CHECK-NEXT: Post-Dominator Tree Construction
70 ; CHECK-NEXT: MachineDominator Tree Construction
74 ; CHECK-NEXT: MachineDominator Tree Construction
77 ; CHECK-NEXT: MachinePostDominator Tree Construction
89 ; CHECK-NEXT: MachineDominator Tree Construction
114 ; CHECK-NEXT: MachineDominator Tree Construction
115 ; CHECK-NEXT: MachinePostDominator Tree Constructio
[all...]
/llvm-project/llvm/test/CodeGen/LoongArch/
H A Dopt-pipeline.ll38 ; LAXX-NEXT: Dominator Tree Construction
58 ; LAXX-NEXT: Post-Dominator Tree Construction
73 ; LAXX-NEXT: Dominator Tree Construction
85 ; LAXX-NEXT: Post-Dominator Tree Construction
99 ; LAXX-NEXT: MachineDominator Tree Construction
103 ; LAXX-NEXT: MachineDominator Tree Construction
106 ; LAXX-NEXT: MachinePostDominator Tree Construction
121 ; LAXX-NEXT: MachineDominator Tree Construction
147 ; LAXX-NEXT: MachineDominator Tree Construction
148 ; LAXX-NEXT: MachinePostDominator Tree Constructio
[all...]
/llvm-project/llvm/test/CodeGen/RISCV/
H A DO3-pipeline.ll30 ; CHECK-NEXT: Dominator Tree Construction
61 ; CHECK-NEXT: Post-Dominator Tree Construction
76 ; CHECK-NEXT: Dominator Tree Construction
81 ; CHECK-NEXT: Dominator Tree Construction
92 ; CHECK-NEXT: Post-Dominator Tree Construction
107 ; CHECK-NEXT: MachineDominator Tree Construction
111 ; CHECK-NEXT: MachineDominator Tree Construction
114 ; CHECK-NEXT: MachinePostDominator Tree Construction
125 ; CHECK-NEXT: MachineDominator Tree Construction
167 ; CHECK-NEXT: MachineDominator Tree Constructio
[all...]
/llvm-project/clang-tools-extra/pseudo/unittests/
H A DDirectiveTreeTest.cpp
/llvm-project/llvm/test/CodeGen/X86/
H A Dopt-pipeline.ll36 ; CHECK-NEXT: Dominator Tree Construction
56 ; CHECK-NEXT: Post-Dominator Tree Construction
73 ; CHECK-NEXT: Dominator Tree Construction
85 ; CHECK-NEXT: Post-Dominator Tree Construction
91 ; CHECK-NEXT: MachineDominator Tree Construction
104 ; CHECK-NEXT: MachineDominator Tree Construction
111 ; CHECK-NEXT: MachineDominator Tree Construction
115 ; CHECK-NEXT: MachineDominator Tree Construction
118 ; CHECK-NEXT: MachinePostDominator Tree Construction
133 ; CHECK-NEXT: MachineDominator Tree Constructio
[all...]
/llvm-project/clang-tools-extra/pseudo/lib/
H A DDirectiveTree.cpp
/llvm-project/llvm/test/Transforms/InstCombine/
H A Dinfinite-loop-postdom.ll155 ; CHECK-POSTDOM-NEXT: Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
165 ; CHECK-POSTDOM-NEXT: Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
175 ; CHECK-POSTDOM-NEXT: Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
185 ; CHECK-POSTDOM-NEXT: Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
195 ; CHECK-POSTDOM-NEXT:Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
210 ; CHECK-POSTDOM-NEXT:Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries.
/llvm-project/llvm/utils/UnicodeData/
H A DUnicodeNameMappingGenerator.cpp393 const std::vector<uint8_t> &Tree = Data.second; in main() local
430 Tree.size() + 1); in main()
432 for (auto Byte : Tree) { in main()
440 Tree.size() + 1); in main()
447 argv[3], NameCount, Tree.size() / 1024.0, Dict.size() / 1024.0); in main()

12345