Searched refs:pTree (Results 1 - 3 of 3) sorted by relevance

/frameworks/compile/mclinker/lib/Core/
H A DInputTree.cpp21 InputTree& pTree)
23 if (this == &pTree)
26 if (!pTree.empty()) {
27 pMover.connect(pRoot, pTree.m_Root.node.right);
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;
19 merge(TreeIteratorBase pRoot, const InputTree::Mover& pMover, InputTree& pTree) argument
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h201 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { argument
202 if (this == &pTree)
205 if (!pTree.empty()) {
206 pPosition.hook<DIRECT>(pTree.m_Root.node.left);
208 pTree.BinaryTreeBase<Input>::m_Root);
209 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
210 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
296 InputTree& pTree);
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h457 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { argument
458 if (this == &pTree)
461 if (!pTree.empty()) {
462 pPosition.hook<DIRECT>(pTree.m_Root.node.left);
464 pTree.BinaryTreeBase<DataType>::m_Root);
465 BinaryTreeBase<DataType>::m_Root.delegate(pTree.m_Root);
466 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;

Completed in 50 milliseconds