Searched refs:Trees (Results 1 - 3 of 3) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp458 Trees.insert(Trees.end(), {&T, L});
465 auto It = Trees.lower_bound(Range.begin());
466 assert(It != Trees.end() && "no node found");
468 assert((std::next(It) == Trees.end() ||
484 auto BeginChildren = Trees.lower_bound(FirstToken);
486 assert((BeginChildren == Trees.end() ||
489 auto EndChildren = Trees.lower_bound(Tokens.end());
491 (EndChildren == Trees.end() || EndChildren->first == Tokens.end()) &&
506 Trees
538 std::map<const syntax::Token *, syntax::Node *> Trees; member in struct:syntax::TreeBuilder::Forest
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h866 /// Trees - The list of pattern trees which corresponds to this pattern.
869 std::vector<TreePatternNodePtr> Trees; member in class:llvm::TreePattern
917 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; }
918 unsigned getNumTrees() const { return Trees.size(); }
919 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; }
920 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; }
922 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
923 return Trees[0];
951 std::vector<TreePatternNodePtr> Copy = Trees;
952 Trees
[all...]
H A DCodeGenDAGPatterns.cpp2694 Trees.push_back(ParseTreePattern(I, ""));
2701 Trees.push_back(ParseTreePattern(Pat, ""));
2708 Trees.push_back(Pat);
2720 for (TreePatternNodePtr &Tree : Trees)
2964 for (TreePatternNodePtr &Tree : Trees) {
2992 if (Node == Trees[0].get() && Node->isLeaf()) {
3023 for (const TreePatternNodePtr &Tree : Trees)
3038 if (Trees.size() > 1)
3040 for (const TreePatternNodePtr &Tree : Trees) {
3046 if (Trees
[all...]

Completed in 130 milliseconds