Home
last modified time | relevance | path

Searched refs:m_children (Results 1 - 9 of 9) sorted by relevance

/third_party/vk-gl-cts/framework/common/
H A DtcuTestCase.cpp73 for (int i = 0; i < (int)m_children.size(); i++) in getChildren()
74 res.push_back(m_children[i]); in getChildren()
91 for (int i = 0; i < (int)m_children.size(); i++) in addChild()
93 if (deStringEqual(node->getName(), m_children[i]->getName())) in addChild()
102 if (!m_children.empty()) in addChild()
103 DE_ASSERT(getTestNodeTypeClass(m_children.front()->getNodeType()) == getTestNodeTypeClass(node->getNodeType())); in addChild()
105 m_children.push_back(node); in addChild()
114 for (int i = 0; i < (int)m_children.size(); i++) in deinit()
115 delete m_children[i]; in deinit()
116 m_children in deinit()
[all...]
H A DtcuTestCase.hpp127 bool empty () const { return m_children.empty(); } in empty()
140 std::vector<TestNode*> m_children; member in tcu::TestNode
H A DtcuCommandLine.cpp423 bool hasChildren (void) const { return !m_children.empty(); } in hasChildren()
428 void addChild (CaseTreeNode* child) { m_children.push_back(child); } in addChild()
439 std::vector<CaseTreeNode*> m_children; member in tcu::CaseTreeNode
444 for (vector<CaseTreeNode*>::const_iterator i = m_children.begin(); i != m_children.end(); ++i) in ~CaseTreeNode()
450 for (int ndx = 0; ndx < (int)m_children.size(); ++ndx) in findChildNdx()
452 if (m_children[ndx]->getHash() == hash) in findChildNdx()
466 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
/third_party/vk-gl-cts/executor/
H A DxeTestCase.hpp93 int getNumChildren (void) const { return (int)m_children.size(); } in getNumChildren()
94 TestNode* getChild (int ndx) { return m_children[ndx]; } in getChild()
95 const TestNode* getChild (int ndx) const { return m_children[ndx]; } in getChild()
107 std::vector<TestNode*> m_children; member in xe::TestGroup
110 // For adding TestCase to m_children. \todo [2012-06-15 pyry] Is the API broken perhaps?
H A DxeTestCase.cpp98 m_parent->m_children.push_back(this);
188 for (std::vector<TestNode*>::iterator i = m_children.begin(); i != m_children.end(); i++) in ~TestGroup()
209 for (vector<TestNode*>::const_iterator iter = m_children.begin(); iter != m_children.end(); iter++) in findChildNode()
/third_party/vk-gl-cts/framework/randomshaders/
H A DrsgStatement.cpp155 for (vector<Statement*>::iterator i = m_children.begin(); i != m_children.end(); i++) in ~BlockStatement()
157 m_children.clear(); in ~BlockStatement()
164 m_children.push_back(statement); in addChild()
175 if ((int)m_children.size() < m_numChildrenToCreate) in createNextChild()
207 for (vector<Statement*>::const_reverse_iterator i = m_children.rbegin(); i != m_children.rend(); i++) in tokenize()
215 for (vector<Statement*>::const_reverse_iterator i = m_children.rbegin(); i != m_children.rend(); i++) in execute()
H A DrsgStatement.hpp109 std::vector<Statement*> m_children; member in rsg::BlockStatement
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ray_tracing/
H A DvktRayTracingPipelineLibraryTests.cpp123 , m_children () in Node()
128 void appendChild (Node* child) { m_children.push_back(child); } in appendChild()
136 for (auto& node : m_children) in calcOffsetRecursively()
144 std::vector<Node*> m_children; // How many child pipelines. Related to LibraryConfiguration::pipelineLibraries[0] member in vkt::RayTracing::__anon28561::PipelineTree::Node
/third_party/libabigail/tests/lib/
H A Dcatch.hpp7571 Children m_children;
12645 // **The check for m_children.empty cannot be removed**.
12649 if ( m_children.empty() ) {
12654 m_children.begin(),
12655 m_children.end(),
12658 } ) != m_children.end() ) {
12682 for ( auto const& child : m_children ) {
12702 m_children.clear();
14421 return !m_children.empty();
14425 m_children
[all...]

Completed in 22 milliseconds