1393   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
1524   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1685   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ContainsUnresolvedType()
1858     if (getNumChildren() != 0) {  in print()
1861       for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {  in print()
1914       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
1915   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
1930     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
1948   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
1959   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
2000     if (getNumChildren() == 0) {  in InlinePatternFragments()
2007     ChildAlternatives.resize(getNumChildren());  in InlinePatternFragments()
2008     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
2319   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
2424     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
2426                " operands, not " + Twine(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
2433     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
2448         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
2455     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2499       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
2550           (i < NonOverridableOperands || ChildNo >= getNumChildren()))  in ApplyTypeConstraints()
2555       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2556         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
2579               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2581                                         getNumChildren());  in ApplyTypeConstraints()
2600     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
2602                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
2606     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2614     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
2623   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2653   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2674     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2676       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2730   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
2945   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
3260     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
3316     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
3359     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3375     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3392   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
3399   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
3470     if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())  in IsNodeBitcast()
3496     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
3624   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3809     SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in parseInstructionPattern()
3901     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
4103   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
4136     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in PromoteXForms()
4277   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in collectModes()
4367     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
4482   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
4573   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
4574   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
4583     assert((N->getNumChildren()>=2 || isCommIntrinsic) &&  in GenerateVariantsOf()
4587     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()
4611     } else if (NC == N->getNumChildren()) {  in GenerateVariantsOf()