HomeSort by: relevance | last modified time | path
    Searched refs:Trees (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
BuildTree.cpp 542 // Most declarations own a semicolon in syntax trees, but not in clang AST.
561 /// A collection of trees covering the input tokens.
564 /// node and update the list of trees accordingly.
577 Trees.insert(Trees.end(), {&T, L});
583 auto It = Trees.lower_bound(Range.begin());
584 assert(It != Trees.end() && "no node found");
586 assert((std::next(It) == Trees.end() ||
597 auto BeginChildren = Trees.lower_bound(Range.begin());
598 assert((BeginChildren == Trees.end() |
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenDAGPatterns.h 860 /// Trees - The list of pattern trees which corresponds to this pattern.
863 std::vector<TreePatternNodePtr> Trees;
865 /// NamedNodes - This is all of the nodes that have names in the trees in this
911 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; }
912 unsigned getNumTrees() const { return Trees.size(); }
913 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; }
914 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; }
916 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
917 return Trees[0]
    [all...]
CodeGenDAGPatterns.cpp 1344 // If this is using PatFrags, there are multiple trees to search. They should
1362 "PatFrags trees do not have consistent class");
2747 Trees.push_back(ParseTreePattern(I, ""));
2754 Trees.push_back(ParseTreePattern(Pat, ""));
2761 Trees.push_back(Pat);
2773 for (TreePatternNodePtr &Tree : Trees)
3017 for (TreePatternNodePtr &Tree : Trees) {
3045 if (Node == Trees[0].get() && Node->isLeaf()) {
3076 for (const TreePatternNodePtr &Tree : Trees)
3092 if (Trees.size() > 1
    [all...]

Completed in 46 milliseconds