Searched refs:Inclusive (Results 1 - 6 of 6) sorted by relevance

/frameworks/compile/mclinker/unittests/
H A DBinTreeTest.cpp130 m_pTestee->join<InputTree::Inclusive>(pos,a);
131 pos.move<InputTree::Inclusive>();
133 m_pTestee->join<InputTree::Inclusive>(pos,c);
134 pos.move<InputTree::Inclusive>();
136 m_pTestee->join<InputTree::Inclusive>(pos,e);
158 m_pTestee->join<InputTree::Inclusive>(pos,a);
159 pos.move<InputTree::Inclusive>();
188 m_pTestee->join<InputTree::Inclusive>(pos,0);
204 m_pTestee->join<InputTree::Inclusive>(pos,a);
205 pos.move<InputTree::Inclusive>();
[all...]
H A DInputTreeTest.cpp109 m_pTestee->insert<InputTree::Inclusive>(node, *input);
116 m_pTestee->insert<InputTree::Inclusive>(node, *input);
156 m_pTestee->insert<InputTree::Inclusive>(node, *input);
157 node.move<InputTree::Inclusive>();
161 m_pTestee->enterGroup<InputTree::Inclusive>(node);
162 node.move<InputTree::Inclusive>();
165 m_pTestee->insert<InputTree::Inclusive>(node, *input);
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h231 Inclusive = TreeIteratorBase::Leftward, enumerator in enum:mcld::InputTree::Direction
270 pFrom.hook<Inclusive>(pTo);
274 pNode.move<Inclusive>();
/frameworks/compile/mclinker/include/mcld/MC/
H A DInputBuilder.h105 InputBuilder::createNode<InputTree::Inclusive>(const std::string& pName,
/frameworks/compile/mclinker/lib/LD/
H A DGroupReader.cpp139 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input,
/frameworks/compile/mclinker/lib/Object/
H A DObjectLinker.cpp207 m_pModule->getInputTree().merge<InputTree::Inclusive>(input,
219 m_pModule->getInputTree().merge<InputTree::Inclusive>(input,

Completed in 81 milliseconds