Searched refs:m_Root (Results 1 – 5 of 5) sorted by relevance
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| D | BinTree.h | 314 TreeImpl m_Root;
318 NodeType *result = m_Root.produce(); in createNode()
319 result->left = result->right = &m_Root.node; in createNode()
326 m_Root.deallocate(pNode); in destroyNode()
331 : m_Root() in BinaryTreeBase()
338 return m_Root.size(); in size()
342 return m_Root.empty(); in empty()
347 m_Root.clear(); in clear()
391 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); } in bfs_begin()
394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); } in bfs_end()
[all …]
|
| /frameworks/compile/mclinker/include/mcld/ |
| D | InputTree.h | 103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in bfs_begin()
110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in bfs_end()
115 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in bfs_begin()
122 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in bfs_end()
126 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
133 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in dfs_end()
138 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
145 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in dfs_end()
148 { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); } in root()
155 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node)); in root()
[all …]
|
| /frameworks/compile/mclinker/lib/Core/ |
| D | InputTree.cpp | 27 pMover.connect(pRoot, pTree.m_Root.node.right); in merge()
28 BinaryTreeBase<Input>::m_Root.summon( in merge()
29 pTree.BinaryTreeBase<Input>::m_Root); in merge()
30 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root); in merge()
31 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
|
| /frameworks/compile/mclinker/include/mcld/MC/ |
| D | InputBuilder.h | 52 const InputTree::iterator& getCurrentNode() const { return m_Root; } in getCurrentNode()
53 InputTree::iterator& getCurrentNode() { return m_Root; } in getCurrentNode()
94 InputTree::iterator m_Root; variable
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/ |
| D | InputBuilder.cpp | 22 m_pCurrentTree(NULL), m_pMove(NULL), m_Root(), in InputBuilder()
39 m_pCurrentTree(NULL), m_pMove(NULL), m_Root(), in InputBuilder()
65 m_pCurrentTree->enterGroup(m_Root, *m_pMove); in enterGroup()
66 m_pMove->move(m_Root); in enterGroup()
67 m_ReturnStack.push(m_Root); in enterGroup()
77 m_Root = m_ReturnStack.top(); in exitGroup()
104 m_Root = m_pCurrentTree->root(); in setCurrentTree()
|