Home
last modified time | relevance | path

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

/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp21 InputTree& pTree) { in merge() argument
22 if (this == &pTree) in merge()
25 if (!pTree.empty()) { in merge()
26 pMover.connect(pRoot, pTree.m_Root.node.right); in merge()
27 BinaryTreeBase<Input>::m_Root.summon(pTree.BinaryTreeBase<Input>::m_Root); in merge()
28 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root); in merge()
29 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
/frameworks/compile/mclinker/include/mcld/
DInputTree.h194 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge() argument
195 if (this == &pTree) in merge()
198 if (!pTree.empty()) { in merge()
199 pPosition.hook<DIRECT>(pTree.m_Root.node.left); in merge()
200 BinaryTreeBase<Input>::m_Root.summon(pTree.BinaryTreeBase<Input>::m_Root); in merge()
201 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root); in merge()
202 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
281 InputTree& pTree);
/frameworks/compile/mclinker/include/mcld/ADT/
DBinTree.h449 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge() argument
450 if (this == &pTree) in merge()
453 if (!pTree.empty()) { in merge()
454 pPosition.hook<DIRECT>(pTree.m_Root.node.left); in merge()
456 pTree.BinaryTreeBase<DataType>::m_Root); in merge()
457 BinaryTreeBase<DataType>::m_Root.delegate(pTree.m_Root); in merge()
458 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()