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

/frameworks/compile/mclinker/unittests/
H A DBinTreeTest.cpp119 m_pTestee->join<InputTree::Inclusive>(pos, a);
120 pos.move<InputTree::Inclusive>();
122 m_pTestee->join<InputTree::Inclusive>(pos, c);
123 pos.move<InputTree::Inclusive>();
125 m_pTestee->join<InputTree::Inclusive>(pos, e);
146 m_pTestee->join<InputTree::Inclusive>(pos, a);
147 pos.move<InputTree::Inclusive>();
174 m_pTestee->join<InputTree::Inclusive>(pos, 0);
189 m_pTestee->join<InputTree::Inclusive>(pos, a);
190 pos.move<InputTree::Inclusive>();
[all...]
H A DInputTreeTest.cpp98 m_pTestee->insert<InputTree::Inclusive>(node, *input);
104 m_pTestee->insert<InputTree::Inclusive>(node, *input);
141 m_pTestee->insert<InputTree::Inclusive>(node, *input);
142 node.move<InputTree::Inclusive>();
146 m_pTestee->enterGroup<InputTree::Inclusive>(node);
147 node.move<InputTree::Inclusive>();
150 m_pTestee->insert<InputTree::Inclusive>(node, *input);
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h222 Inclusive = TreeIteratorBase::Leftward, enumerator in enum:mcld::InputTree::Direction
259 pFrom.hook<Inclusive>(pTo);
262 void move(TreeIteratorBase& pNode) const { pNode.move<Inclusive>(); }
/frameworks/compile/mclinker/include/mcld/MC/
H A DInputBuilder.h103 inline InputTree& InputBuilder::createNode<InputTree::Inclusive>(
/frameworks/compile/mclinker/lib/LD/
H A DGroupReader.cpp133 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input,
/frameworks/compile/mclinker/lib/Script/
H A DInputCmd.cpp203 m_InputTree.merge<InputTree::Inclusive>(input, archive.inputs());
/frameworks/compile/mclinker/lib/Object/
H A DObjectLinker.cpp205 m_pModule->getInputTree().merge<InputTree::Inclusive>(input,
217 m_pModule->getInputTree().merge<InputTree::Inclusive>(

Completed in 212 milliseconds