Lines Matching refs:getNumTypes
1393 if (!Child->isLeaf() && Child->getNumTypes()) {
1793 NumResults = std::max(NumResults, T->getNumTypes());
1924 New = std::make_shared<TreePatternNode>(getLeafValue(), getNumTypes());
1931 getNumTypes());
2030 getOperator(), std::move(NewChildren), getNumTypes());
2037 for (unsigned i = 0, e = getNumTypes(); i != e; ++i)
2102 for (unsigned i = 0, e = FragTree->getNumTypes(); i != e; ++i)
2435 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
2490 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
2803 assert(New->getNumTypes() == 1 && "FIXME: Unhandled");
2999 assert(Node->getNumTypes() == 1 &&
3000 InNodes[0]->getNumTypes() == 1 &&
3012 assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 &&
3374 if (Pat->getChild(i)->getNumTypes() == 0)
3667 if (Pat->getNumTypes() != 0) {
3669 for (unsigned k = 0, ke = Pat->getNumTypes(); k != ke; ++k) {
3779 OpNode->getNumTypes());
3794 assert(ResNodes[i]->getNumTypes() == 1 && "FIXME: Unhandled");
4108 for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) {
4127 N->getNumTypes());
4170 for (unsigned i = 0, e = std::min(Result.getOnlyTree()->getNumTypes(),
4171 T->getNumTypes());
4424 Orig->getOperator(), std::move(NewChildren), Orig->getNumTypes());
4431 for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i)