Home
last modified time | relevance | path

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

/external/swiftshader/third_party/LLVM/utils/TableGen/
DCodeGenDAGPatterns.h530 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees() function
DCodeGenDAGPatterns.cpp2200 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!"); in ParseDefaultOperands()
2587 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) { in ParseInstructions()
2890 if (Result->getNumTrees() != 1) in ParsePatterns()
2950 for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j) in ParsePatterns()
/external/llvm/utils/TableGen/
DCodeGenDAGPatterns.h577 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees() function
DCodeGenDAGPatterns.cpp2573 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!"); in ParseDefaultOperands()
2975 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) { in parseInstructionPattern()
3457 if (Result.getNumTrees() != 1) in ParsePatterns()
3517 for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j) in ParsePatterns()
/external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
DCodeGenDAGPatterns.cpp3096 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!"); in ParseDefaultOperands()
3506 for (unsigned j = 0, e = I.getNumTrees(); j != e; ++j) { in parseInstructionPattern()
3975 if (Result.getNumTrees() != 1) in ParseOnePattern()
4079 if (Result.getNumTrees() != 1) in ParsePatterns()
4087 for (unsigned j = 0, ee = Pattern.getNumTrees(); j != ee; ++j) in ParsePatterns()
DCodeGenDAGPatterns.h832 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees() function