/external/llvm/utils/TableGen/ |
D | CodeGenDAGPatterns.cpp | 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() [all …]
|
D | DAGISelMatcherGen.cpp | 292 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitOperatorMatchCode() 432 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) { in EmitOperatorMatchCode() 531 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitMatcherCode() 672 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1); in GetInstPatternNode() 700 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in numNodesThatMayLoadOrStore() 814 for (unsigned I = ChildNo, E = N->getNumChildren(); I < E; ++I) in EmitResultInstructionAsOperand() 864 NumFixedArityOperands = Pattern.getSrcPattern()->getNumChildren(); in EmitResultInstructionAsOperand() 914 assert(N->getNumChildren() == 1); in EmitResultSDNodeXFormAsOperand()
|
D | DAGISelMatcherOpt.cpp | 33 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in ContractNodes() 198 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in FactorNodes() 411 SM->setNumChildren(SM->getNumChildren()+1); in FactorNodes() 412 SM->resetChild(SM->getNumChildren()-1, MatcherWithoutCTM); in FactorNodes()
|
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() 465 for (unsigned i = 0, e = Dst->getNumChildren(); i != e; ++i) { in collectPatterns() 515 if (InstPatNode->getNumChildren()) { in collectPatterns() 539 for (unsigned i = 0, e = InstPatNode->getNumChildren(); i != e; ++i) { in collectPatterns() 542 if (DstIndex >= Dst->getNumChildren() || in collectPatterns() 554 if (Op->getName() != "EXTRACT_SUBREG" && DstIndex < Dst->getNumChildren()) in collectPatterns()
|
D | DAGISelMatcherEmitter.cpp | 168 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) { in EmitMatcher() 205 OS.PadToColumn(CommentIndent) << "// " << SM->getNumChildren() in EmitMatcher() 755 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) in BuildHistogram()
|
/external/clang/lib/Rewrite/ |
D | RewriteRope.cpp | 410 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ~RopePieceBTreeInterior() 416 unsigned getNumChildren() const { return NumChildren; } in getNumChildren() function in __anonc78e266c0411::RopePieceBTreeInterior 430 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in FullRecomputeSizeLocally() 502 unsigned i = 0, e = getNumChildren(); in insert() 531 if (i + 1 != getNumChildren()) in HandleChildPiece() 533 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece() 605 if (i != getNumChildren()) in erase() 607 (getNumChildren()-i)*sizeof(Children[0])); in erase()
|
/external/llvm-project/clang/lib/Rewrite/ |
D | RewriteRope.cpp | 414 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ~RopePieceBTreeInterior() 420 unsigned getNumChildren() const { return NumChildren; } in getNumChildren() function in __anon990c70da0311::RopePieceBTreeInterior 436 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in FullRecomputeSizeLocally() 507 unsigned i = 0, e = getNumChildren(); in insert() 536 if (i + 1 != getNumChildren()) in HandleChildPiece() 538 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece() 610 if (i != getNumChildren()) in erase() 612 (getNumChildren()-i)*sizeof(Children[0])); in erase()
|
/external/llvm-project/llvm/utils/TableGen/ |
D | CodeGenDAGPatterns.cpp | 1393 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) { in getPatternSize() 1524 if (OpNo >= N->getNumChildren()) { in getOperandNum() 1685 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ContainsUnresolvedType() 1858 if (getNumChildren() != 0) { in print() 1861 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) { in print() 1914 N->getNumChildren() != getNumChildren()) return false; in isIsomorphicTo() 1915 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in isIsomorphicTo() 1930 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in clone() 1948 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in RemoveAllTypes() 1959 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { in SubstituteFormalArguments() [all …]
|
D | DAGISelMatcherOpt.cpp | 32 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in ContractNodes() 207 for (unsigned i = 0, e = Scope->getNumChildren(); i != e; ++i) { in FactorNodes() 215 for (unsigned j = 0, e = SM->getNumChildren(); j != e; ++j) in FactorNodes() 425 SM->setNumChildren(SM->getNumChildren()+1); in FactorNodes() 426 SM->resetChild(SM->getNumChildren()-1, MatcherWithoutCTM); in FactorNodes()
|
D | DAGISelMatcherGen.cpp | 315 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitOperatorMatchCode() 455 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) { in EmitOperatorMatchCode() 594 for (unsigned i = 0; i < N->getNumChildren(); ++i) { in EmitMatcherCode() 774 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in numNodesThatMayLoadOrStore() 836 (InstOpNo < NonOverridableOperands || ChildNo >= N->getNumChildren())) { in EmitResultInstructionAsOperand() 882 for (unsigned I = ChildNo, E = N->getNumChildren(); I < E; ++I) in EmitResultInstructionAsOperand() 935 NumFixedArityOperands = Pattern.getSrcPattern()->getNumChildren(); in EmitResultInstructionAsOperand() 1005 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 | 206 for (unsigned i = 0, e = InstPatNode->getNumChildren(); i != e; ++i) { in initialize() 475 for (unsigned i = 0, e = Dst->getNumChildren(); i != e; ++i) { in collectPatterns() 525 if (InstPatNode->getNumChildren()) { in collectPatterns() 549 for (unsigned i = 0, e = InstPatNode->getNumChildren(); i != e; ++i) { in collectPatterns() 552 if (DstIndex >= Dst->getNumChildren() || in collectPatterns() 564 if (Op->getName() != "EXTRACT_SUBREG" && DstIndex < Dst->getNumChildren()) in collectPatterns()
|
D | DAGISelMatcherEmitter.cpp | 257 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) { in SizeMatcher() 372 for (unsigned i = 0, e = SM->getNumChildren(); i != e; ++i) { in EmitMatcher() 390 OS << " // " << SM->getNumChildren() << " children in Scope"; in EmitMatcher()
|
/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
|
/external/llvm-project/clang/include/clang/AST/ |
D | DeclOpenMP.h | 121 return llvm::makeArrayRef(Storage, Data->getNumChildren()); in getVars() 126 return llvm::makeMutableArrayRef(Storage, Data->getNumChildren()); in getVars() 143 unsigned varlist_size() const { return Data->getNumChildren(); } in varlist_size() 484 return llvm::makeArrayRef(Storage, Data->getNumChildren()); in getVars() 489 return llvm::makeMutableArrayRef(Storage, Data->getNumChildren()); in getVars() 510 unsigned varlist_size() const { return Data->getNumChildren(); } in varlist_size()
|
/external/llvm-project/clang/lib/AST/ |
D | DeclOpenMP.cpp | 46 assert(VL.size() == Data->getNumChildren() && in setVars() 74 assert(VL.size() == Data->getNumChildren() && in setVars()
|
/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 | 307 for (int childNdx = 0; childNdx < group.getNumChildren(); childNdx++) in addMatchingCases() 331 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/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
D | GenericDomTree.h | 93 size_t getNumChildren() const { return Children.size(); } 98 if (getNumChildren() != Other->getNumChildren())
|
/external/llvm-project/llvm/include/llvm/Support/ |
D | GenericDomTree.h | 99 size_t getNumChildren() const { return Children.size(); } 104 if (getNumChildren() != Other->getNumChildren())
|
/external/oss-fuzz/projects/alembic/ |
D | alembic_dump_info_fuzzer.cc | 182 const size_t childCount = node.getNumChildren(); in dumpNodes()
|