| /aosp12/frameworks/compile/mclinker/lib/Core/ |
| H A D | InputTree.cpp | 13 InputTree::Succeeder InputTree::Afterward;
14 InputTree::Includer InputTree::Downward;
19 InputTree& InputTree::merge(TreeIteratorBase pRoot, in merge()
20 const InputTree::Mover& pMover, in merge()
21 InputTree& pTree) { in merge()
34 InputTree& InputTree::enterGroup(TreeIteratorBase pRoot, in enterGroup()
41 InputTree& InputTree::insert(TreeIteratorBase pRoot, in insert()
53 bool isGroup(const InputTree::iterator& pos) { in isGroup()
57 bool isGroup(const InputTree::const_iterator& pos) { in isGroup()
61 bool isGroup(const InputTree::dfs_iterator& pos) { in isGroup()
[all …]
|
| H A D | Android.bp | 18 "InputTree.cpp",
|
| H A D | IRBuilder.cpp | 130 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, pType); in CreateInput()
142 m_InputBuilder.createNode<InputTree::Positional>( in ReadInput()
182 m_InputBuilder.createNode<InputTree::Positional>(pNameSpec, *path); in ReadInput()
197 m_InputBuilder.createNode<InputTree::Positional>("file handler", in ReadInput()
216 m_InputBuilder.createNode<InputTree::Positional>(pName, sys::fs::Path("NAN")); in ReadInput()
|
| H A D | Linker.cpp | 111 InputTree::const_dfs_iterator input, in normalize()
|
| /aosp12/frameworks/compile/mclinker/unittests/ |
| H A D | BinTreeTest.cpp | 120 pos.move<InputTree::Inclusive>(); in TEST_F()
123 pos.move<InputTree::Inclusive>(); in TEST_F()
147 pos.move<InputTree::Inclusive>(); in TEST_F()
149 pos.move<InputTree::Positional>(); in TEST_F()
151 pos.move<InputTree::Positional>(); in TEST_F()
153 pos.move<InputTree::Positional>(); in TEST_F()
190 pos.move<InputTree::Inclusive>(); in TEST_F()
193 pos.move<InputTree::Inclusive>(); in TEST_F()
219 pos.move<InputTree::Inclusive>(); in TEST_F()
261 pos.move<InputTree::Inclusive>(); in TEST_F()
[all …]
|
| H A D | InputTreeTest.cpp | 31 m_pTestee = new mcld::InputTree(); in InputTreeTest()
68 InputTree::iterator node = m_pTestee->root(); in TEST_F()
69 InputTree::const_iterator const_node = node; in TEST_F()
80 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
82 InputTree::const_iterator const_node2 = node; in TEST_F()
95 InputTree::iterator node = m_pTestee->root(); in TEST_F()
99 InputTree::const_iterator const_node = node; in TEST_F()
120 InputTree::iterator node = m_pTestee->root(); in TEST_F()
139 InputTree::iterator node = m_pTestee->root(); in TEST_F()
142 node.move<InputTree::Inclusive>(); in TEST_F()
[all …]
|
| H A D | InputTreeTest.h | 18 class InputTree; variable
52 mcld::InputTree* m_pTestee;
|
| /aosp12/frameworks/compile/mclinker/include/mcld/MC/ |
| H A D | InputBuilder.h | 45 const InputTree& getCurrentTree() const;
46 InputTree& getCurrentTree();
73 InputTree& enterGroup();
75 InputTree& exitGroup();
91 InputTree* m_pCurrentTree;
92 InputTree::Mover* m_pMove;
93 InputTree::iterator m_Root;
103 inline InputTree& InputBuilder::createNode<InputTree::Inclusive>(
112 m_pMove = &InputTree::Downward;
118 inline InputTree& InputBuilder::createNode<InputTree::Positional>(
[all …]
|
| /aosp12/frameworks/compile/mclinker/include/mcld/ |
| H A D | InputTree.h | 216 class InputTree : public BinaryTree<Input> {
274 InputTree& enterGroup(TreeIteratorBase pRoot);
279 InputTree& merge(TreeIteratorBase pRoot,
281 InputTree& pTree);
288 bool isGroup(const InputTree::iterator& pos);
289 bool isGroup(const InputTree::const_iterator& pos);
290 bool isGroup(const InputTree::dfs_iterator& pos);
291 bool isGroup(const InputTree::const_dfs_iterator& pos);
292 bool isGroup(const InputTree::bfs_iterator& pos);
301 mcld::InputTree& mcld::InputTree::enterGroup(mcld::TreeIteratorBase pRoot) { in enterGroup()
[all …]
|
| H A D | Module.h | 44 typedef InputTree::iterator input_iterator;
45 typedef InputTree::const_iterator const_input_iterator;
93 const InputTree& getInputTree() const { return m_MainTree; } in getInputTree()
94 InputTree& getInputTree() { return m_MainTree; } in getInputTree()
169 InputTree m_MainTree;
|
| H A D | IRBuilder.h | 32 class InputTree; variable
|
| /aosp12/frameworks/compile/mclinker/include/mcld/LD/ |
| H A D | Archive.h | 68 typedef HashEntry<uint32_t, InputTree::iterator, OffsetCompare<uint32_t> >
78 InputTree::iterator lastPos;
79 InputTree::Mover* move;
122 InputTree& inputs();
125 const InputTree& inputs() const;
139 bool addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter);
158 InputTree::iterator pLastPos,
159 InputTree::Mover* pMove);
227 InputTree* m_pInputTree;
|
| /aosp12/frameworks/compile/mclinker/lib/MC/ |
| H A D | InputBuilder.cpp | 61 InputTree& InputBuilder::enterGroup() { in enterGroup()
67 m_pMove = &InputTree::Downward; in enterGroup()
72 InputTree& InputBuilder::exitGroup() { in exitGroup()
77 m_pMove = &InputTree::Afterward; in exitGroup()
86 const InputTree& InputBuilder::getCurrentTree() const { in getCurrentTree()
91 InputTree& InputBuilder::getCurrentTree() { in getCurrentTree()
96 void InputBuilder::setCurrentTree(InputTree& pInputTree) { in setCurrentTree()
99 m_pMove = &InputTree::Downward; in setCurrentTree()
|
| H A D | CommandAction.cpp | 36 pBuilder.createNode<InputTree::Positional>(path().stem().native(), path()); in activate()
74 pBuilder.createNode<InputTree::Positional>(namespec(), *path); in activate()
86 pBuilder.createNode<InputTree::Positional>( in activate()
223 pBuilder.createNode<InputTree::Positional>("defsym", sys::fs::Path("NAN")); in activate()
273 pBuilder.createNode<InputTree::Positional>(path.stem().native(), path); in activate()
|
| /aosp12/frameworks/compile/mclinker/lib/Script/ |
| H A D | InputCmd.cpp | 38 InputTree& pInputTree, in InputCmd()
91 InputTree::iterator input_begin; in activate()
129 m_Builder.createNode<InputTree::Positional>( in activate()
156 m_Builder.createNode<InputTree::Positional>( in activate()
165 InputTree::iterator input = m_Builder.getCurrentNode(); in activate()
180 for (InputTree::iterator input = input_begin, ie = m_InputTree.end(); in activate()
203 m_InputTree.merge<InputTree::Inclusive>(input, archive.inputs()); in activate()
|
| H A D | GroupCmd.cpp | 31 InputTree& pInputTree, in GroupCmd()
80 InputTree::iterator group = m_Builder.getCurrentNode(); in activate()
118 m_Builder.createNode<InputTree::Positional>( in activate()
145 m_Builder.createNode<InputTree::Positional>( in activate()
|
| H A D | ScriptFile.cpp | 63 m_pInputTree = new InputTree(); in ScriptFile()
|
| /aosp12/frameworks/compile/mclinker/lib/LD/ |
| H A D | Archive.cpp | 35 m_pInputTree = new InputTree(); in Archive()
53 InputTree& Archive::inputs() { in inputs()
58 const InputTree& Archive::inputs() const { in inputs()
80 bool Archive::addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter) { in addObjectMember()
111 InputTree::iterator pLastPos, in addArchiveMember()
112 InputTree::Mover* pMove) { in addArchiveMember()
|
| H A D | GNUArchiveReader.cpp | 105 &InputTree::Downward); in readArchive()
380 parent->move = &InputTree::Afterward; in includeMember()
399 member->name(), parent->lastPos, &InputTree::Downward); in includeMember()
423 &InputTree::Downward); in includeAllMembers()
|
| H A D | GroupReader.cpp | 133 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input, in readGroup()
|
| /aosp12/frameworks/compile/mclinker/include/mcld/Script/ |
| H A D | GroupCmd.h | 16 class InputTree; variable
29 InputTree& pInputTree,
45 InputTree& m_InputTree;
|
| H A D | InputCmd.h | 19 class InputTree; variable
31 InputTree& pInputTree,
49 InputTree& m_InputTree;
|
| H A D | ScriptFile.h | 26 class InputTree; variable
75 const InputTree& inputs() const { return *m_pInputTree; } in inputs()
76 InputTree& inputs() { return *m_pInputTree; } in inputs()
158 InputTree* m_pInputTree;
|
| /aosp12/frameworks/compile/mclinker/lib/Object/ |
| H A D | ObjectLinker.cpp | 205 m_pModule->getInputTree().merge<InputTree::Inclusive>(input, in normalize()
217 m_pModule->getInputTree().merge<InputTree::Inclusive>( in normalize()
289 mcld::InputTree::bfs_iterator input, in readRelocations()
|