| /frameworks/compile/mclinker/lib/Core/ |
| 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()
35 const InputTree::Mover& pMover) { in enterGroup()
41 InputTree& InputTree::insert(TreeIteratorBase pRoot, in insert()
42 const InputTree::Mover& pMover, in insert()
53 bool isGroup(const InputTree::iterator& pos) { in isGroup()
[all …]
|
| D | Android.bp | 9 "InputTree.cpp",
|
| D | IRBuilder.cpp | 129 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, pType); in CreateInput()
141 m_InputBuilder.createNode<InputTree::Positional>( in ReadInput()
181 m_InputBuilder.createNode<InputTree::Positional>(pNameSpec, *path); in ReadInput()
196 m_InputBuilder.createNode<InputTree::Positional>("file handler", in ReadInput()
215 m_InputBuilder.createNode<InputTree::Positional>(pName, sys::fs::Path("NAN")); in ReadInput()
|
| D | Linker.cpp | 111 InputTree::const_dfs_iterator input, in normalize()
|
| /frameworks/compile/mclinker/unittests/ |
| D | BinTreeTest.cpp | 119 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
120 pos.move<InputTree::Inclusive>(); in TEST_F()
121 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
122 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
123 pos.move<InputTree::Inclusive>(); in TEST_F()
124 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
125 m_pTestee->join<InputTree::Inclusive>(pos, e); in TEST_F()
146 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
147 pos.move<InputTree::Inclusive>(); in TEST_F()
148 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
[all …]
|
| 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()
98 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
99 InputTree::const_iterator const_node = node; in TEST_F()
104 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
108 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
[all …]
|
| D | InputTreeTest.h | 18 class InputTree; variable
52 mcld::InputTree* m_pTestee;
|
| /frameworks/compile/mclinker/include/mcld/MC/ |
| D | InputBuilder.h | 45 const InputTree& getCurrentTree() const;
46 InputTree& getCurrentTree();
48 void setCurrentTree(InputTree& pInputTree);
51 const InputTree::iterator& getCurrentNode() const { return m_Root; } in getCurrentNode()
52 InputTree::iterator& getCurrentNode() { return m_Root; } in getCurrentNode()
54 template <InputTree::Direction DIRECTION>
55 InputTree& createNode(const std::string& pName,
73 InputTree& enterGroup();
75 InputTree& exitGroup();
91 InputTree* m_pCurrentTree;
[all …]
|
| /frameworks/compile/mclinker/include/mcld/ |
| D | InputTree.h | 216 class InputTree : public BinaryTree<Input> {
274 InputTree& enterGroup(TreeIteratorBase pRoot);
277 InputTree& insert(TreeIteratorBase pRoot, Input& pInput);
279 InputTree& merge(TreeIteratorBase pRoot,
281 InputTree& pTree);
283 InputTree& insert(TreeIteratorBase pRoot, const Mover& pMover, Input& pInput);
285 InputTree& enterGroup(TreeIteratorBase pRoot, const Mover& pMover);
288 bool isGroup(const InputTree::iterator& pos);
289 bool isGroup(const InputTree::const_iterator& pos);
290 bool isGroup(const InputTree::dfs_iterator& pos);
[all …]
|
| 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;
|
| D | IRBuilder.h | 32 class InputTree; variable
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| 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;
|
| /frameworks/compile/mclinker/lib/MC/ |
| 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()
|
| 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()
|
| /frameworks/compile/mclinker/lib/Script/ |
| 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()
|
| 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()
|
| D | ScriptFile.cpp | 63 m_pInputTree = new InputTree(); in ScriptFile()
|
| /frameworks/compile/mclinker/include/mcld/Script/ |
| D | GroupCmd.h | 16 class InputTree; variable
29 InputTree& pInputTree,
45 InputTree& m_InputTree;
|
| D | InputCmd.h | 19 class InputTree; variable
31 InputTree& pInputTree,
49 InputTree& m_InputTree;
|
| 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;
|
| /frameworks/compile/mclinker/lib/LD/ |
| 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()
|
| 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()
|
| D | GroupReader.cpp | 133 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input, in readGroup()
|
| /frameworks/compile/mclinker/lib/Object/ |
| 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()
|