Searched refs:getNumChildren (Results 1 – 10 of 10) sorted by relevance
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 ++()
93 int getNumChildren (void) const { return (int)m_children.size(); } in getNumChildren() function in xe::TestGroup
322 for (int ndx = 0; ndx < group->getNumChildren(); ndx++) in writeCaseListNode()
46 int getNumChildren (void) const { return deMemPool_getNumChildren(m_pool); } in getNumChildren() function in de::MemPool
298 for (int childNdx = 0; childNdx < group->getNumChildren(); childNdx++) in writeTestCaseListNode()328 for (int childNdx = 0; childNdx < root.getNumChildren(); childNdx++) in writeTestCaseList()
307 for (int childNdx = 0; childNdx < group.getNumChildren(); childNdx++) in addMatchingCases()331 for (int childNdx = 0; childNdx < group.getNumChildren(); childNdx++) in removeMatchingCases()
93 size_t getNumChildren() const { return Children.size(); }98 if (getNumChildren() != Other->getNumChildren())
1138 assert(TN->getNumChildren() == 0 && "Not a tree leaf"); in EraseNode()
830 while (Node->getNumChildren()) in updateDomTree()
759 while (Node->getNumChildren()) { in updateDomTree()