715     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()
842   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()
972   if (OpNo >= N->getNumChildren()) {  in getOperandNum()
1209   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ~TreePatternNode()
1285     if (getNumChildren() != 0) {  in print()
1288       for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {  in print()
1335       N->getNumChildren() != getNumChildren()) return false;  in isIsomorphicTo()
1336   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()
1351     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()
1367   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()
1378   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()
1414     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()
1655   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()
1748     assert(getNumChildren() >= 2 && "Missing RHS of a set?");  in ApplyTypeConstraints()
1749     unsigned NC = getNumChildren();  in ApplyTypeConstraints()
1769     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
1784     if (getNumChildren() != NumParamVTs + 1) {  in ApplyTypeConstraints()
1787                utostr(getNumChildren() - 1) + " operands!");  in ApplyTypeConstraints()
1794     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()
1809         getNumChildren() != (unsigned)NI.getNumOperands()) {  in ApplyTypeConstraints()
1816     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
1859       unsigned NChild = getNumChildren();  in ApplyTypeConstraints()
1897       if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
1898         emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());  in ApplyTypeConstraints()
1921               if (ChildNo >= getNumChildren()) {  in ApplyTypeConstraints()
1923                                         getNumChildren());  in ApplyTypeConstraints()
1942     if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {  in ApplyTypeConstraints()
1944                                ChildNo, getNumChildren());  in ApplyTypeConstraints()
1948     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()
1956     for (unsigned i = 0; i < getNumChildren(); ++i)  in ApplyTypeConstraints()
1965   if (getNumChildren() != 1) {  in ApplyTypeConstraints()
2007   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()
2028     if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {  in canPatternMatch()
2030       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()
2081   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()
2279   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()
2579     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()
2634     assert(Slot->getNumChildren() == 0 && "can't be a use with children!");  in HandleUse()
2662     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
2678     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()
2695   if (Pat->getNumChildren() == 0)  in FindPatternInputsAndOutputs()
2702   unsigned NumDests = Pat->getNumChildren()-1;  in FindPatternInputsAndOutputs()
2766     if (N->getNumChildren() != 2)  in IsNodeBitcast()
2776     if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())  in IsNodeBitcast()
2802     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()
2925   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()
3173       SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();  in ParseInstructions()
3208     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()
3412   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()
3525     for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {  in ParsePatterns()
3642   assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");  in GatherChildrenOfAssociativeOpcode()
3733   ChildVariants.resize(N->getNumChildren());  in GenerateVariantsOf()
3734   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()
3743     assert((N->getNumChildren()==2 || isCommIntrinsic) &&  in GenerateVariantsOf()
3747     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()