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

/frameworks/compile/mclinker/lib/Core/
H A DInputTree.cpp27 pMover.connect(pRoot, pTree.m_Root.node.right);
28 BinaryTreeBase<Input>::m_Root.summon(
29 pTree.BinaryTreeBase<Input>::m_Root);
30 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
31 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h311 /// m_Root is a special object who responses:
314 TreeImpl m_Root; member in class:mcld::BinaryTreeBase
318 NodeType *result = m_Root.produce();
319 result->left = result->right = &m_Root.node;
326 m_Root.deallocate(pNode);
331 : m_Root()
338 return m_Root.size();
342 return m_Root.empty();
347 m_Root.clear();
391 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root
[all...]
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
115 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
122 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
126 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
133 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
138 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
145 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
148 { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
155 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root
[all...]
/frameworks/compile/mclinker/include/mcld/MC/
H A DInputBuilder.h52 const InputTree::iterator& getCurrentNode() const { return m_Root; }
53 InputTree::iterator& getCurrentNode() { return m_Root; }
94 InputTree::iterator m_Root; member in class:mcld::InputBuilder
112 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
113 m_pMove->move(m_Root);
127 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
128 m_pMove->move(m_Root);
/frameworks/compile/mclinker/lib/MC/
H A DInputBuilder.cpp22 m_pCurrentTree(NULL), m_pMove(NULL), m_Root(),
39 m_pCurrentTree(NULL), m_pMove(NULL), m_Root(),
65 m_pCurrentTree->enterGroup(m_Root, *m_pMove);
66 m_pMove->move(m_Root);
67 m_ReturnStack.push(m_Root);
77 m_Root = m_ReturnStack.top();
104 m_Root = m_pCurrentTree->root();

Completed in 681 milliseconds