| /llvm-project-15.0.7/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 44 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 D | Nodes.h | 127 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 { 527 class TrailingReturnType final : public Tree { [all …]
|
| H A D | Nodes.td | 1 //===- 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 D | Syntax.td | 53 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-15.0.7/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 73 if (&*Tree == &T1) in getMapped() 193 SyntaxTree::Impl &Tree; member 195 PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {} in PreorderVisitor() 199 Tree.Nodes.emplace_back(); in PreTraverse() 489 const SyntaxTree::Impl &Tree; member in clang::diff::Subtree 498 Subtree(const SyntaxTree::Impl &Tree, NodeId SubtreeRoot) : Tree(Tree) { in Subtree() argument 710 const SyntaxTree::Impl &Tree; member 711 HeightLess(const SyntaxTree::Impl &Tree) : Tree(Tree) {} in HeightLess() 713 return Tree.getNode(Id1).Height < Tree.getNode(Id2).Height; in operator ()() 721 const SyntaxTree::Impl &Tree; member in clang::diff::__anonb3398b060611::PriorityList [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | O3-pipeline.ll | 10 ; CHECK-NEXT: Dominator Tree Construction 34 ; CHECK-NEXT: Post-Dominator Tree Construction 52 ; CHECK-NEXT: Dominator Tree Construction 69 ; CHECK-NEXT: Dominator Tree Construction 73 ; CHECK-NEXT: Post-Dominator Tree Construction 86 ; CHECK-NEXT: MachineDominator Tree Construction 90 ; CHECK-NEXT: MachineDominator Tree Construction 98 ; CHECK-NEXT: MachineDominator Tree Construction 104 ; CHECK-NEXT: MachineDominator Tree Construction 108 ; CHECK-NEXT: MachineDominator Tree Construction [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | llc-pipeline.ll | 31 ; GCN-O0-NEXT: Dominator Tree Construction 61 ; GCN-O0-NEXT: Dominator Tree Construction 67 ; GCN-O0-NEXT: Dominator Tree Construction 90 ; GCN-O0-NEXT: Dominator Tree Construction 145 ; GCN-O0-NEXT: Dominator Tree Construction 166 ; GCN-O1-NEXT: Dominator Tree Construction 182 ; GCN-O1-NEXT: Dominator Tree Construction 402 ; GCN-O1-NEXT: Dominator Tree Construction 729 ; GCN-O2-NEXT: Dominator Tree Construction 985 ; GCN-O2-NEXT: Dominator Tree Construction [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AArch64/ |
| H A D | O3-pipeline.ll | 24 ; CHECK-NEXT: Dominator Tree Construction 27 ; CHECK-NEXT: Dominator Tree Construction 79 ; CHECK-NEXT: Dominator Tree Construction 84 ; CHECK-NEXT: Dominator Tree Construction 91 ; CHECK-NEXT: Dominator Tree Construction 96 ; CHECK-NEXT: Dominator Tree Construction 100 ; CHECK-NEXT: Dominator Tree Construction 106 ; CHECK-NEXT: Dominator Tree Construction 232 ; CHECK-NEXT: Dominator Tree Construction 237 ; CHECK-NEXT: Dominator Tree Construction [all …]
|
| /llvm-project-15.0.7/clang/unittests/Tooling/Syntax/ |
| H A D | TreeTest.cpp | 25 Tree *createTree(ArrayRef<const Node *> Children) { in createTree() 39 std::vector<std::vector<const Tree *>> 74 std::vector<const Tree *> 97 std::vector<const Tree *> AllTrees; in generateAllTreesWithShape() 114 ASSERT_TRUE(Tree->findFirstLeaf() != nullptr); in TEST_P() 124 ASSERT_TRUE(Tree->findLastLeaf() != nullptr); in TEST_P() 134 auto *Tree = syntax::createTree(*Arena, in TEST_F() local 139 const auto *ConstTree = Tree; in TEST_F() 141 auto Range = Tree->getChildren(); in TEST_F() 171 EXPECT_EQ(It, Tree::ChildIterator()); in TEST_F() [all …]
|
| /llvm-project-15.0.7/clang/lib/AST/ |
| H A D | ASTDiagnostic.cpp | 952 DiffTree Tree; member in __anon9cc2dc2e0111::TemplateDiff 1360 Tree.AddNode(); in DiffTemplate() 1390 Tree.Up(); in DiffTemplate() 1509 PrintTypeNames(FromType, ToType, Tree.FromDefault(), Tree.ToDefault(), in TreeToString() 1516 PrintExpr(FromExpr, ToExpr, Tree.FromDefault(), Tree.ToDefault(), in TreeToString() 1524 Tree.ToDefault(), Tree.NodeIsSame()); in TreeToString() 1536 Tree.ToDefault(), Tree.NodeIsSame()); in TreeToString() 1549 Tree.FromDefault(), Tree.ToDefault(), Tree.NodeIsSame()); in TreeToString() 1631 Tree.Parent(); in TreeToString() 2102 Tree.StartTraverse(); in Emit() [all …]
|
| /llvm-project-15.0.7/clang/tools/clang-diff/ |
| H A D | ClangDiff.cpp | 267 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-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | O3-pipeline.ll | 25 ; CHECK-NEXT: Dominator Tree Construction 58 ; CHECK-NEXT: Post-Dominator Tree Construction 70 ; CHECK-NEXT: Dominator Tree Construction 86 ; CHECK-NEXT: Post-Dominator Tree Construction 91 ; CHECK-NEXT: MachineDominator Tree Construction 102 ; CHECK-NEXT: MachineDominator Tree Construction 110 ; CHECK-NEXT: MachineDominator Tree Construction 118 ; CHECK-NEXT: MachineDominator Tree Construction 120 ; CHECK-NEXT: MachineDominator Tree Construction 132 ; CHECK-NEXT: MachineDominator Tree Construction [all …]
|
| /llvm-project-15.0.7/clang/lib/Tooling/Syntax/ |
| H A D | Tree.cpp | 21 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() 84 void syntax::Tree::prependChildLowLevel(Node *Child) { in prependChildLowLevel() 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() 293 const syntax::Leaf *syntax::Tree::findLastLeaf() const { in findLastLeaf() 297 if (const auto *L = cast<syntax::Tree>(C)->findLastLeaf()) in findLastLeaf() [all …]
|
| H A D | ComputeReplacements.cpp | 21 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 D | Synthesis.cpp | 22 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-15.0.7/llvm/test/CodeGen/RISCV/ |
| H A D | O3-pipeline.ll | 26 ; CHECK-NEXT: Dominator Tree Construction 50 ; CHECK-NEXT: Post-Dominator Tree Construction 62 ; CHECK-NEXT: Dominator Tree Construction 69 ; CHECK-NEXT: Dominator Tree Construction 73 ; CHECK-NEXT: Post-Dominator Tree Construction 86 ; CHECK-NEXT: MachineDominator Tree Construction 90 ; CHECK-NEXT: MachineDominator Tree Construction 93 ; CHECK-NEXT: MachinePostDominator Tree Construction 107 ; CHECK-NEXT: MachineDominator Tree Construction 132 ; CHECK-NEXT: MachineDominator Tree Construction [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | opt-pipeline.ll | 33 ; CHECK-NEXT: Dominator Tree Construction 54 ; CHECK-NEXT: Post-Dominator Tree Construction 70 ; CHECK-NEXT: Dominator Tree Construction 78 ; CHECK-NEXT: Post-Dominator Tree Construction 83 ; CHECK-NEXT: MachineDominator Tree Construction 95 ; CHECK-NEXT: MachineDominator Tree Construction 102 ; CHECK-NEXT: MachineDominator Tree Construction 106 ; CHECK-NEXT: MachineDominator Tree Construction 121 ; CHECK-NEXT: MachineDominator Tree Construction 124 ; CHECK-NEXT: MachineDominator Tree Construction [all …]
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/unittests/ |
| H A D | DirectiveTreeTest.cpp | 307 DirectiveTree Tree = DirectiveTree::parse(S); in TEST() local 308 chooseConditionalBranches(Tree, S); in TEST() 309 Verify(Tree); in TEST() 341 DirectiveTree Tree = DirectiveTree::parse(S); in TEST() local 342 chooseConditionalBranches(Tree, S); in TEST() 343 EXPECT_THAT(Tree.stripDirectives(S).tokens(), in TEST() 347 ((const DirectiveTree::Conditional &)Tree.Chunks[4]).Branches[0].second; in TEST()
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | GICombinerEmitter.cpp | 72 const GIMatchTree &Tree; member in __anoncdaa66640111::format_partition_name 76 format_partition_name(const GIMatchTree &Tree, unsigned Idx) in format_partition_name() argument 77 : Tree(Tree), Idx(Idx) {} in format_partition_name() 79 Tree.getPartitioner()->emitPartitionName(OS, Idx); in print() 723 if (Tree.getPartitioner() != nullptr) { in generateCodeForTree() 725 for (const auto &EnumChildren : enumerate(Tree.children())) { in generateCodeForTree() 735 for (const auto &Leaf : Tree.possible_leaves()) { in generateCodeForTree() 860 std::unique_ptr<GIMatchTree> Tree; in run() local 875 Tree = TreeBuilder.run(); in run() 878 Tree->writeDOTGraph(outs()); in run() [all …]
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/lib/ |
| H A D | DirectiveTree.cpp | 48 llvm::Optional<DirectiveTree::Directive> parse(DirectiveTree *Tree, in parse() argument 69 Tree->Chunks.push_back(DirectiveTree::Code{ in parse() 84 Tree->Chunks.push_back(std::move(Conditional)); in parse() 91 Tree->Chunks.push_back(std::move(Directive)); in parse() 189 static void dump(llvm::raw_ostream &OS, const DirectiveTree &Tree, in dump() argument 191 for (const auto &Chunk : Tree.Chunks) in dump() 346 void chooseConditionalBranches(DirectiveTree &Tree, const TokenStream &Code) { in chooseConditionalBranches() argument 347 BranchChooser{Code}.choose(Tree); in chooseConditionalBranches()
|
| /llvm-project-15.0.7/clang/utils/TableGen/ |
| H A D | ClangASTNodesEmitter.cpp | 41 ChildMap Tree; member in __anon20fdde350111::ClangASTNodesEmitter 91 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); in EmitNode() 155 Tree.insert(std::make_pair(B, R)); in deriveChildTree()
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | infinite-loop-postdom.ll | 155 ; 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-15.0.7/llvm/test/CodeGen/Generic/ |
| H A D | llc-start-stop.ll | 8 ; STOP-AFTER: Dominator Tree Construction 15 ; STOP-BEFORE: Dominator Tree Construction 21 ; START-AFTER-NEXT: Dominator Tree Construction
|
| /llvm-project-15.0.7/llvm/utils/UnicodeData/ |
| H A D | UnicodeNameMappingGenerator.cpp | 379 const std::vector<uint8_t> &Tree = Data.second; in main() local 416 Tree.size() + 1); in main() 418 for (auto Byte : Tree) { in main() 426 Tree.size() + 1); in main() 433 argv[3], NameCount, Tree.size() / 1024.0, Dict.size() / 1024.0); in main()
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | ImmutableMap.h | 159 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument 289 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
|