Lines Matching refs:getNumChildren
715 for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)
842 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
972 if (OpNo >= N->getNumChildren()) {
1209 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1285 if (getNumChildren() != 0) {
1288 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
1335 N->getNumChildren() != getNumChildren()) return false;
1336 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1351 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1367 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1378 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
1414 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
1655 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1748 assert(getNumChildren() >= 2 && "Missing RHS of a set?");
1749 unsigned NC = getNumChildren();
1769 for (unsigned i = 0; i < getNumChildren(); ++i)
1784 if (getNumChildren() != NumParamVTs + 1) {
1787 utostr(getNumChildren() - 1) + " operands!");
1794 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {
1809 getNumChildren() != (unsigned)NI.getNumOperands()) {
1816 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1859 unsigned NChild = getNumChildren();
1897 if (ChildNo >= getNumChildren()) {
1898 emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());
1921 if (ChildNo >= getNumChildren()) {
1923 getNumChildren());
1942 if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {
1944 ChildNo, getNumChildren());
1948 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1956 for (unsigned i = 0; i < getNumChildren(); ++i)
1965 if (getNumChildren() != 1) {
2007 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
2028 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
2030 for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)
2081 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2279 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2579 for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
2634 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
2662 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
2678 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
2695 if (Pat->getNumChildren() == 0)
2702 unsigned NumDests = Pat->getNumChildren()-1;
2766 if (N->getNumChildren() != 2)
2776 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())
2802 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2925 for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)
3166 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
3201 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
3405 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
3518 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
3635 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
3726 ChildVariants.resize(N->getNumChildren());
3727 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
3736 assert((N->getNumChildren()==2 || isCommIntrinsic) &&
3740 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
