589     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
713   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
820   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1000   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ~TreePatternNode()
1062     if (getNumChildren() != 0) {  in print()
1065       for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {  in print()
1112       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
1113   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
1128     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
1144   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
1155   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
1185     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
1362   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
1433     assert(getNumChildren() >= 2 && "Missing RHS of a set?");  in ApplyTypeConstraints()
1434     unsigned NC = getNumChildren();  in ApplyTypeConstraints()
1454     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
1488     if (getNumChildren() != NumParamVTs + 1)  in ApplyTypeConstraints()
1491                utostr(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
1496     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
1511         getNumChildren() != (unsigned)NI.getNumOperands())  in ApplyTypeConstraints()
1516     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
1588       if (ChildNo >= getNumChildren())  in ApplyTypeConstraints()
1619     if (ChildNo != getNumChildren())  in ApplyTypeConstraints()
1629   if (getNumChildren() != 1)  in ApplyTypeConstraints()
1669   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
1687     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
1689       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
1737   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
1902   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
2206       for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
2265     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
2293     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
2309     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
2326   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
2333   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
2401     if (N->getNumChildren() != 2)  in IsNodeBitcast()
2411     if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())  in IsNodeBitcast()
2436     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
2734       SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in ParseInstructions()
2769     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
2849   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
2958     for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {  in ParsePatterns()
3085   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
3176   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
3177   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
3186     assert((N->getNumChildren()==2 || isCommIntrinsic) &&  in GenerateVariantsOf()
3190     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()