1449   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
1604   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1768   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ContainsUnresolvedType()
1941     if (getNumChildren() != 0) {  in print()
1944       for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in print()
1987         N->getNumChildren() != getNumChildren())  in isIsomorphicTo()
2005   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
2020     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
2039   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
2050   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
2090     if (getNumChildren() == 0) {  in InlinePatternFragments()
2097         getNumChildren());  in InlinePatternFragments()
2098     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
2162   if (Frag->getNumArgs() != getNumChildren()) {  in InlinePatternFragments()
2418   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
2524     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
2526                " operands, not " + Twine(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
2533     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
2549         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
2556     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2600       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
2651           (i < NonOverridableOperands || ChildNo >= getNumChildren()))  in ApplyTypeConstraints()
2656       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2657         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
2680               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
2682                                         getNumChildren());  in ApplyTypeConstraints()
2701     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
2703                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
2707     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
2731     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
2740   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2772   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2793     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2795       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2849   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
3069   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in SimplifyTree()
3383     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
3439     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
3482     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3499     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
3516   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
3523   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
3594     if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())  in IsNodeBitcast()
3623     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
3752   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3938     SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in parseInstructionPattern()
4028     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
4215   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
4248     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in PromoteXForms()
4399   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in collectModes()
4485     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
4601   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
4692       N->getNumChildren());  in GenerateVariantsOf()
4693   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
4703     assert(N->getNumChildren() >= (2 + Skip) &&  in GenerateVariantsOf()