1302   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
1428   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1589   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ContainsUnresolvedType()
1762     if (getNumChildren() != 0) {  in print()
1765       for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {  in print()
1818       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
1819   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
1834     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
1852   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
1863   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
1904     if (getNumChildren() == 0) {  in InlinePatternFragments()
1911     ChildAlternatives.resize(getNumChildren());  in InlinePatternFragments()
1912     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
2222   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
2327     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
2329                " operands, not " + Twine(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
2336     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
2351         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
2358     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2402       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
2440       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2441         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
2464               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2466                                         getNumChildren());  in ApplyTypeConstraints()
2485     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
2487                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
2491     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2499     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
2508   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2538   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2559     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2561       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2615   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
2822   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
3137     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
3193     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
3236     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3252     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3269   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
3276   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
3347     if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())  in IsNodeBitcast()
3373     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
3498   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3683     SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in parseInstructionPattern()
3775     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
3977   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
4010     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in PromoteXForms()
4151   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in collectModes()
4241     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
4356   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
4447   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
4448   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
4457     assert((N->getNumChildren()>=2 || isCommIntrinsic) &&  in GenerateVariantsOf()
4461     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()
4485     } else if (NC == N->getNumChildren()) {  in GenerateVariantsOf()