1468   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
1625   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1789   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ContainsUnresolvedType()
1962     if (getNumChildren() != 0) {  in print()
1965       for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in print()
2018       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
2019   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
2034     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
2052   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
2063   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
2104     if (getNumChildren() == 0) {  in InlinePatternFragments()
2111     ChildAlternatives.resize(getNumChildren());  in InlinePatternFragments()
2112     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
2428   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
2533     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
2535                " operands, not " + Twine(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
2542     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
2557         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
2564     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2608       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
2659           (i < NonOverridableOperands || ChildNo >= getNumChildren()))  in ApplyTypeConstraints()
2664       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2665         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
2688               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2690                                         getNumChildren());  in ApplyTypeConstraints()
2709     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
2711                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
2715     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2739     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
2748   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2780   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2801     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2803       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2857   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
3074   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
3390     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
3446     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
3489     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3505     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3522   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
3529   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
3600     if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())  in IsNodeBitcast()
3629     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
3757   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3943     SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in parseInstructionPattern()
4035     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
4222   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
4255     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in PromoteXForms()
4395   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in collectModes()
4478     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
4593   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
4684   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
4685   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
4695     assert(N->getNumChildren() >= (2 + Skip) &&  in GenerateVariantsOf()
4720       for (; i != N->getNumChildren(); ++i)  in GenerateVariantsOf()