Home
last modified time | relevance | path

Searched refs:Trees (Results 1 – 6 of 6) sorted by relevance

/llvm-project-15.0.7/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp581 Trees.insert(Trees.end(), {&T, L}); in Forest()
590 assert((std::next(It) == Trees.end() || in assignRole()
602 assert((BeginChildren == Trees.end() || in shrinkToFitList()
636 assert((BeginChildren == Trees.end() || in foldChildren()
656 Trees.erase(BeginChildren, EndChildren); in foldChildren()
657 Trees.insert({FirstToken, Node}); in foldChildren()
662 assert(Trees.size() == 1); in finalize()
663 auto *Root = Trees.begin()->second; in finalize()
664 Trees = {}; in finalize()
670 for (auto It = Trees.begin(); It != Trees.end(); ++It) { in str()
[all …]
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h871 std::vector<TreePatternNodePtr> Trees; variable
919 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; } in getTrees()
920 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()
921 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; } in getTree()
922 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
924 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()
925 return Trees[0]; in getOnlyTree()
953 std::vector<TreePatternNodePtr> Copy = Trees; in InlinePatternFragments()
954 Trees.clear(); in InlinePatternFragments()
956 Copy[i]->InlinePatternFragments(Copy[i], *this, Trees); in InlinePatternFragments()
H A DCodeGenDAGPatterns.cpp2823 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()
2830 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()
2837 Trees.push_back(Pat); in TreePattern()
2849 for (TreePatternNodePtr &Tree : Trees) in ComputeNamedNodes()
3095 for (TreePatternNodePtr &Tree : Trees) { in InferAllTypes()
3123 if (Node == Trees[0].get() && Node->isLeaf()) { in InferAllTypes()
3154 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes()
3170 if (Trees.size() > 1) in print()
3172 for (const TreePatternNodePtr &Tree : Trees) { in print()
3178 if (Trees.size() > 1) in print()
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Disl.bib435 title = {Schedule Trees},
H A Duser.pod9722 =head2 Schedule Trees
11245 L</"Schedule Trees">.
12246 (see L</"Schedule Trees">).
/llvm-project-15.0.7/mlir/docs/
H A DLangRef.md64 represent other compiler-like data structures, such as Abstract Syntax Trees in