| /frameworks/compile/mclinker/lib/MC/ |
| D | MCLDInputTree.cpp | 14 InputTree::Succeeder InputTree::Afterward;
15 InputTree::Includer InputTree::Downward;
19 InputTree::InputTree(InputFactory& pInputFactory) in InputTree() function in InputTree
23 InputTree::~InputTree() in ~InputTree()
27 InputTree& InputTree::merge(InputTree::iterator pPosition, in merge()
28 const InputTree::Connector& pConnector, in merge()
29 InputTree& pTree) in merge()
44 InputTree& InputTree::insert(InputTree::iterator pPosition, in insert()
45 const InputTree::Connector& pConnector, in insert()
56 InputTree& InputTree::enterGroup(InputTree::iterator pPosition, in enterGroup()
[all …]
|
| D | MCLDDriver.cpp | 40 InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in normalize()
76 mcld::InputTree* archive_member = m_LDBackend.getArchiveReader()->readArchive(**input); in normalize()
82 m_LDInfo.inputs().merge<InputTree::Inclusive>(input, *archive_member); in normalize()
108 mcld::InputTree::const_bfs_iterator input, inEnd = m_LDInfo.inputs().bfs_end(); in linkable()
191 mcld::InputTree::bfs_iterator input, inEnd = m_LDInfo.inputs().bfs_end(); in readSections()
213 mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in readSymbolTables()
233 mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in mergeSymbolTables()
267 mcld::InputTree::bfs_iterator input, inEnd = m_LDInfo.inputs().bfs_end(); in readRelocations()
|
| D | MCLDInfo.cpp | 33 m_pInputTree = new InputTree(*m_pInputFactory); in MCLDInfo()
|
| /frameworks/compile/mclinker/unittests/ |
| D | InputTreeTest.cpp | 23 m_pTestee = new InputTree(*m_pAlloc); in InputTreeTest()
48 InputTree::iterator node = m_pTestee->root(); in TEST_F()
49 m_pTestee->insert<InputTree::Inclusive>(node, "FileSpec", "path1"); in TEST_F()
51 InputTree::const_iterator const_node = node; in TEST_F()
60 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
62 InputTree::const_iterator const_node2 = node; in TEST_F()
75 InputTree::iterator node = m_pTestee->root(); in TEST_F()
78 m_pTestee->insert<InputTree::Inclusive>(node, "FileSpec", "path1"); in TEST_F()
79 InputTree::const_iterator const_node = node; in TEST_F()
84 m_pTestee->insert<InputTree::Inclusive>(node,"FileSpec", "path1"); in TEST_F()
[all …]
|
| D | BinTreeTest.cpp | 130 m_pTestee->join<InputTree::Inclusive>(pos,a); in TEST_F()
131 pos.move<InputTree::Inclusive>(); in TEST_F()
132 m_pTestee->join<InputTree::Positional>(pos,10); in TEST_F()
133 m_pTestee->join<InputTree::Inclusive>(pos,9); in TEST_F()
134 pos.move<InputTree::Inclusive>(); in TEST_F()
135 m_pTestee->join<InputTree::Positional>(pos,8); in TEST_F()
136 m_pTestee->join<InputTree::Inclusive>(pos,7); in TEST_F()
159 m_pTestee->join<InputTree::Inclusive>(pos,0); in TEST_F()
160 pos.move<InputTree::Inclusive>(); in TEST_F()
161 m_pTestee->join<InputTree::Positional>(pos,1); in TEST_F()
[all …]
|
| D | InputTreeTest.h | 16 class InputTree; variable
48 mcld::InputTree* m_pTestee;
|
| /frameworks/compile/mclinker/include/mcld/MC/ |
| D | MCLDInputTree.h | 78 class InputTree : public BinaryTree<Input>
127 InputTree(InputFactory& pInputFactory);
128 ~InputTree();
137 InputTree& insert(iterator pPosition,
143 InputTree& enterGroup(iterator pPosition);
146 InputTree& insert(iterator pPosition,
149 InputTree& merge(iterator pPosition,
151 InputTree& pTree);
153 InputTree& insert(iterator pPosition,
159 InputTree& insert(iterator pPosition,
[all …]
|
| D | MCLDInfo.h | 68 InputTree& inputs() in inputs()
71 const InputTree& inputs() const in inputs()
120 InputTree *m_pInputTree;
|
| /frameworks/compile/mclinker/lib/LD/ |
| D | GNUArchiveReader.cpp | 94 InputTree *GNUArchiveReader::readArchive(Input &pInput) in readArchive()
103 InputTree *GNUArchiveReader::setupNewArchive(Input &pInput, in setupNewArchive()
113 InputTree *resultTree = new InputTree(m_pLDInfo.inputFactory()); in setupNewArchive()
160 InputTree::iterator node = resultTree->root(); in setupNewArchive()
186 resultTree->insert<InputTree::Positional>(node, *insertObjectFile); in setupNewArchive()
188 node.move<InputTree::Inclusive>(); in setupNewArchive()
190 node.move<InputTree::Positional>(); in setupNewArchive()
207 resultTree->insert<InputTree::Positional>(node, *newArchive); in setupNewArchive()
209 node.move<InputTree::Inclusive>(); in setupNewArchive()
211 node.move<InputTree::Positional>(); in setupNewArchive()
[all …]
|
| D | BSDArchiveReader.cpp | 23 InputTree *BSDArchiveReader::readArchive(Input &input) in readArchive()
|
| /frameworks/compile/mclinker/lib/CodeGen/ |
| D | SectLinker.cpp | 116 InputTree::const_dfs_iterator input, inEnd = info.inputs().dfs_end(); in doFinalization()
204 InputTree::Connector *prev_ward = &InputTree::Downward; in initializeInputTree()
206 std::stack<InputTree::iterator> returnStack; in initializeInputTree()
207 InputTree::iterator cur_node = info.inputs().root(); in initializeInputTree()
223 prev_ward = &InputTree::Afterward; in initializeInputTree()
234 prev_ward = &InputTree::Afterward; in initializeInputTree()
259 prev_ward = &InputTree::Afterward; in initializeInputTree()
266 prev_ward = &InputTree::Downward; in initializeInputTree()
271 prev_ward = &InputTree::Afterward; in initializeInputTree()
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| D | GNUArchiveReader.h | 32 class InputTree; variable
54 InputTree *readArchive(Input &input);
64 InputTree *setupNewArchive(Input &pInput, size_t off);
|
| D | ArchiveReader.h | 20 class InputTree; variable
33 virtual InputTree *readArchive(Input &input) = 0;
|
| D | BSDArchiveReader.h | 20 class InputTree; variable
32 InputTree *readArchive(Input &input);
|
| /frameworks/compile/mclinker/lib/Target/ |
| D | GNULDBackend.cpp | 268 InputTree::const_bfs_iterator input, inputEnd = pLDInfo.inputs().bfs_end(); in sizeNamePools()
565 InputTree::const_bfs_iterator input, inputEnd = pLDInfo.inputs().bfs_end(); in emitDynNamePools()
|
| /frameworks/compile/mclinker/lib/Target/Mips/ |
| D | MipsLDBackend.cpp | 360 InputTree::const_bfs_iterator input, inputEnd = pLDInfo.inputs().bfs_end(); in emitDynNamePools()
|