| /frameworks/compile/mclinker/lib/Core/ |
| InputTree.cpp | 1 //===- InputTree.cpp ------------------------------------------------------===//
9 #include <mcld/InputTree.h>
13 InputTree::Succeeder InputTree::Afterward;
14 InputTree::Includer InputTree::Downward;
17 // InputTree
19 InputTree& InputTree::merge(TreeIteratorBase pRoot,
20 const InputTree::Mover& pMover
[all...] |
| Android.mk | 9 InputTree.cpp \
|
| IRBuilder.cpp | 121 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, pType);
134 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, Input::Unknown);
175 m_InputBuilder.createNode<InputTree::Positional>(pNameSpec, *path);
192 m_InputBuilder.createNode<InputTree::Positional>(
201 m_InputBuilder.createNode<InputTree::Positional>("memory ostream", "NAN");
213 m_InputBuilder.createNode<InputTree::Positional>("file handler",
232 m_InputBuilder.createNode<InputTree::Positional>(pName, "NAN");
|
| Linker.cpp | 102 InputTree::const_dfs_iterator input, inEnd = pModule.getInputTree().dfs_end();
|
| /frameworks/compile/mclinker/include/mcld/MC/ |
| InputBuilder.h | 18 #include <mcld/InputTree.h>
32 * \brief InputBuilder recieves InputActions and build the InputTree.
50 const InputTree& getCurrentTree() const;
51 InputTree& getCurrentTree();
53 void setCurrentTree(InputTree& pInputTree);
56 const InputTree::iterator& getCurrentNode() const { return m_Root; }
57 InputTree::iterator& getCurrentNode() { return m_Root; }
59 template<InputTree::Direction DIRECTION>
60 InputTree& createNode(const std::string& pName,
78 InputTree& enterGroup()
[all...] |
| /frameworks/compile/mclinker/include/mcld/ |
| InputTree.h | 1 //===- InputTree.h --------------------------------------------------------===//
70 /** \class InputTree
71 * \brief InputTree is the input tree to contains all inputs from the
74 * InputTree, of course, is uncopyable.
78 class InputTree : public BinaryTree<Input>
142 InputTree& enterGroup(TreeIteratorBase pRoot);
145 InputTree& insert(TreeIteratorBase pRoot,
148 InputTree& merge(TreeIteratorBase pRoot,
150 InputTree& pTree);
152 InputTree& insert(TreeIteratorBase pRoot
[all...] |
| Module.h | 24 #include <mcld/InputTree.h>
53 typedef InputTree::iterator input_iterator;
54 typedef InputTree::const_iterator const_input_iterator;
95 const InputTree& getInputTree() const { return m_MainTree; }
96 InputTree& getInputTree() { return m_MainTree; }
156 InputTree m_MainTree;
|
| IRBuilder.h | 38 class InputTree;
|
| /frameworks/compile/mclinker/unittests/ |
| BinTreeTest.cpp | 12 #include <mcld/InputTree.h>
130 m_pTestee->join<InputTree::Inclusive>(pos,a);
131 pos.move<InputTree::Inclusive>();
132 m_pTestee->join<InputTree::Positional>(pos,10);
133 m_pTestee->join<InputTree::Inclusive>(pos,9);
134 pos.move<InputTree::Inclusive>();
135 m_pTestee->join<InputTree::Positional>(pos,8);
136 m_pTestee->join<InputTree::Inclusive>(pos,7);
159 m_pTestee->join<InputTree::Inclusive>(pos,0);
160 pos.move<InputTree::Inclusive>()
[all...] |
| InputTreeTest.cpp | 14 #include <mcld/InputTree.h>
37 m_pTestee = new mcld::InputTree();
78 InputTree::iterator node = m_pTestee->root();
79 InputTree::const_iterator const_node = node;
90 m_pTestee->enterGroup(node, InputTree::Downward);
92 InputTree::const_iterator const_node2 = node;
105 InputTree::iterator node = m_pTestee->root();
109 m_pTestee->insert<InputTree::Inclusive>(node, *input);
110 InputTree::const_iterator const_node = node;
116 m_pTestee->insert<InputTree::Inclusive>(node, *input)
[all...] |
| InputTreeTest.h | 18 class InputTree;
28 * \see InputTree
53 mcld::InputTree* m_pTestee;
|
| LinkerTest.cpp | 13 #include <mcld/InputTree.h>
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| Archive.h | 15 #include <mcld/InputTree.h>
80 InputTree::iterator,
90 InputTree::iterator lastPos;
91 InputTree::Mover* move;
143 InputTree& inputs();
146 const InputTree& inputs() const;
160 bool addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter);
179 InputTree::iterator pLastPos,
180 InputTree::Mover* pMove);
249 InputTree *m_pInputTree
[all...] |
| /frameworks/compile/mclinker/lib/MC/ |
| InputBuilder.cpp | 61 InputTree& InputBuilder::enterGroup()
68 m_pMove = &InputTree::Downward;
73 InputTree& InputBuilder::exitGroup()
79 m_pMove = &InputTree::Afterward;
89 const InputTree& InputBuilder::getCurrentTree() const
95 InputTree& InputBuilder::getCurrentTree()
101 void InputBuilder::setCurrentTree(InputTree& pInputTree)
105 m_pMove = &InputTree::Downward;
|
| CommandAction.cpp | 29 pBuilder.createNode<InputTree::Positional>(path().stem().native(), path());
70 pBuilder.createNode<InputTree::Positional>(namespec(), *path);
83 pBuilder.createNode<InputTree::Positional>("bitcode", path(), Input::External);
|
| /frameworks/compile/mclinker/lib/LD/ |
| Archive.cpp | 37 m_pInputTree = new InputTree();
58 InputTree& Archive::inputs()
64 const InputTree& Archive::inputs() const
90 bool Archive::addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter)
125 InputTree::iterator pLastPos,
126 InputTree::Mover* pMove)
|
| GNUArchiveReader.cpp | 12 #include <mcld/InputTree.h>
110 &InputTree::Downward);
384 parent->move = &InputTree::Afterward;
400 &InputTree::Downward);
421 &InputTree::Downward);
|
| GroupReader.cpp | 120 // InputTree
124 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input,
|
| /frameworks/compile/mclinker/lib/Object/ |
| ObjectLinker.cpp | 13 #include <mcld/InputTree.h>
171 m_pModule->getInputTree().merge<InputTree::Inclusive>(input,
225 mcld::InputTree::bfs_iterator input, inEnd = m_pModule->getInputTree().bfs_end();
|
| /frameworks/compile/mclinker/lib/CodeGen/ |
| MCLinker.cpp | 17 #include <mcld/InputTree.h>
|
| /frameworks/compile/mclinker/lib/Target/ |
| GNULDBackend.cpp | 21 #include <mcld/InputTree.h>
[all...] |
