Searched refs:m_Root (Results 1 - 4 of 4) sorted by relevance

/frameworks/compile/mclinker/lib/MC/
H A DInputTree.cpp35 pMover.connect(pRoot, iterator(pTree.m_Root.node.right));
36 BinaryTreeBase<Input>::m_Root.summon(
37 pTree.BinaryTreeBase<Input>::m_Root);
38 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
39 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h314 /// m_Root is a special object who responses:
317 TreeImpl m_Root; member in class:mcld::BinaryTreeBase
321 NodeType *result = m_Root.produce();
322 result->left = result->right = &m_Root.node;
329 m_Root.deallocate(pNode);
334 : m_Root()
341 return m_Root.size();
345 return m_Root.empty();
350 m_Root.clear();
394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root
[all...]
/frameworks/compile/mclinker/unittests/Linker/
H A DTestLinker.cpp76 m_Root = m_pInfo->inputs().root();
146 m_pInfo->inputs().insert<mcld::InputTree::Positional>(m_Root, *input);
171 m_pInfo->inputs().insert<mcld::InputTree::Positional>(m_Root, *input);
189 m_pInfo->inputs().insert<mcld::InputTree::Positional>(m_Root, *input);
240 m_pInfo->inputs().insert<mcld::InputTree::Positional>(m_Root, *input);
317 if (m_Root.isRoot())
318 --m_Root;
320 ++m_Root;
H A DTestLinker.h109 mcld::InputTree::iterator m_Root; member in class:mcld::test::TestLinker

Completed in 143 milliseconds