| /external/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.cpp | 686 for (size_t i = 0, e = N->getNumChildren(); i != e; ++i) in FindDepVarsOf()
814 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) { in getPatternSize()
934 if (OpNo >= N->getNumChildren()) { in getOperandNum()
1163 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ~TreePatternNode()
1240 if (getNumChildren() != 0) { in print()
1243 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) { in print()
1290 N->getNumChildren() != getNumChildren()) return false; in isIsomorphicTo()
1291 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in isIsomorphicTo()
1306 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in clone()
1322 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in RemoveAllTypes()
[all …]
|
| D | DAGISelMatcherOpt.cpp | 34 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in ContractNodes()
199 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in SinkPatternPredicates()
271 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in FactorNodes()
483 SM->setNumChildren(SM->getNumChildren()+1); in FactorNodes()
484 SM->resetChild(SM->getNumChildren()-1, MatcherWithoutCTM); in FactorNodes()
|
| D | DAGISelMatcherGen.cpp | 295 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitOperatorMatchCode()
437 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) { in EmitOperatorMatchCode()
536 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitMatcherCode()
677 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1); in GetInstPatternNode()
705 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in numNodesThatMayLoadOrStore()
819 for (unsigned I = ChildNo, E = N->getNumChildren(); I < E; ++I) in EmitResultInstructionAsOperand()
869 NumFixedArityOperands = Pattern.getSrcPattern()->getNumChildren(); in EmitResultInstructionAsOperand()
919 assert(N->getNumChildren() == 1); in EmitResultSDNodeXFormAsOperand()
|
| D | DAGISelEmitter.cpp | 53 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) in getResultPatternCost()
69 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) in getResultPatternSize()
|
| D | FastISelEmitter.cpp | 195 for (unsigned i = 0, e = InstPatNode->getNumChildren(); i != e; ++i) { in initialize()
467 for (unsigned i = 0, e = Dst->getNumChildren(); i != e; ++i) { in collectPatterns()
517 if (InstPatNode->getNumChildren()) { in collectPatterns()
541 for (unsigned i = 0, e = InstPatNode->getNumChildren(); i != e; ++i) { in collectPatterns()
544 if (DstIndex >= Dst->getNumChildren() || in collectPatterns()
556 if (Op->getName() != "EXTRACT_SUBREG" && DstIndex < Dst->getNumChildren()) in collectPatterns()
|
| D | DAGISelMatcherEmitter.cpp | 150 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) { in EmitMatcher()
187 OS.PadToColumn(CommentIndent) << "// " << SM->getNumChildren() in EmitMatcher()
736 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) in BuildHistogram()
|
| D | CodeGenDAGPatterns.h | 384 unsigned getNumChildren() const { return Children.size(); } in getNumChildren() function
502 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ContainsUnresolvedType()
|
| D | DAGISelMatcher.cpp | 110 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { in printImpl()
|
| D | DAGISelMatcher.h | 199 unsigned getNumChildren() const { return Children.size(); } in getNumChildren() function
|
| /external/clang/lib/Rewrite/ |
| D | RewriteRope.cpp | 408 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ~RopePieceBTreeInterior()
414 unsigned getNumChildren() const { return NumChildren; } in getNumChildren() function in __anona82c88c50411::RopePieceBTreeInterior
428 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in FullRecomputeSizeLocally()
500 unsigned i = 0, e = getNumChildren(); in insert()
529 if (i + 1 != getNumChildren()) in HandleChildPiece()
531 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece()
603 if (i != getNumChildren()) in erase()
605 (getNumChildren()-i)*sizeof(Children[0])); in erase()
|
| /external/deqp/executor/ |
| D | xeTestCase.cpp | 260 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in addChildGroupsToMap()
330 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in addChildren()
342 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in removeChildren()
354 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in hasChildrenInSet()
457 static_cast<const TestGroup*>(curNode)->getNumChildren() > 0) in operator ++()
467 int numChildren = group ? group->getNumChildren() : 1; in operator ++()
|
| D | xeTestCase.hpp | 93 int getNumChildren (void) const { return (int)m_children.size(); } in getNumChildren() function in xe::TestGroup
|
| D | xeBatchExecutor.cpp | 316 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in writeCaseListNode()
|
| /external/deqp/framework/delibs/decpp/ |
| D | deMemPool.hpp | 46 int getNumChildren (void) const { return deMemPool_getNumChildren(m_pool); } in getNumChildren() function in de::MemPool
|
| /external/deqp/executor/tools/ |
| D | xeBatchResultToXml.cpp | 298 for (int childNdx = 0; childNdx < group->getNumChildren(); childNdx++) in writeTestCaseListNode()
328 for (int childNdx = 0; childNdx < root.getNumChildren(); childNdx++) in writeTestCaseList()
|
| D | xeCommandLineExecutor.cpp | 249 for (int childNdx = 0; childNdx < group.getNumChildren(); childNdx++) in addMatchingCases()
273 for (int childNdx = 0; childNdx < group.getNumChildren(); childNdx++) in removeMatchingCases()
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 103 size_t getNumChildren() const { return Children.size(); } in getNumChildren() function
108 if (getNumChildren() != Other->getNumChildren()) in compare()
|
| /external/llvm/lib/CodeGen/ |
| D | EarlyIfConversion.cpp | 638 while (Node->getNumChildren()) { in updateDomTree()
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64ConditionalCompares.cpp | 793 while (Node->getNumChildren()) in updateDomTree()
|