1413   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
1570   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1731   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ContainsUnresolvedType()
1904     if (getNumChildren() != 0) {  in print()
1907       for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in print()
1960       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
1961   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
1976     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
1994   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
2005   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
2046     if (getNumChildren() == 0) {  in InlinePatternFragments()
2053     ChildAlternatives.resize(getNumChildren());  in InlinePatternFragments()
2054     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
2368   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
2473     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
2475                " operands, not " + Twine(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
2482     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
2497         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
2504     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2548       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
2599           (i < NonOverridableOperands || ChildNo >= getNumChildren()))  in ApplyTypeConstraints()
2604       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2605         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
2628               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2630                                         getNumChildren());  in ApplyTypeConstraints()
2649     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
2651                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
2655     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2663     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
2672   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2704   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2725     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2727       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2781   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
2997   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
3313     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
3369     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
3412     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3428     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3445   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
3452   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
3523     if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())  in IsNodeBitcast()
3552     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
3680   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3866     SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in parseInstructionPattern()
3958     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
4145   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
4178     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in PromoteXForms()
4318   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in collectModes()
4401     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
4516   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
4607   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
4608   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
4617     assert((N->getNumChildren()>=2 || isCommIntrinsic) &&  in GenerateVariantsOf()
4621     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()
4645     } else if (NC == N->getNumChildren()) {  in GenerateVariantsOf()