/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 | 125 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, pType); 138 m_InputBuilder.createNode<InputTree::Positional>(pName, pPath, Input::Unknown); 179 m_InputBuilder.createNode<InputTree::Positional>(pNameSpec, *path); 194 m_InputBuilder.createNode<InputTree::Positional>("file handler", 213 m_InputBuilder.createNode<InputTree::Positional>(pName, "NAN");
|
Linker.cpp | 111 InputTree::const_dfs_iterator input, inEnd = pModule.getInputTree().dfs_end();
|
/frameworks/compile/mclinker/include/mcld/MC/ |
InputBuilder.h | 15 #include <mcld/InputTree.h> 28 * \brief InputBuilder recieves InputActions and build the InputTree. 46 const InputTree& getCurrentTree() const; 47 InputTree& getCurrentTree(); 49 void setCurrentTree(InputTree& pInputTree); 52 const InputTree::iterator& getCurrentNode() const { return m_Root; } 53 InputTree::iterator& getCurrentNode() { return m_Root; } 55 template<InputTree::Direction DIRECTION> 56 InputTree& createNode(const std::string& pName, 74 InputTree& enterGroup() [all...] |
/frameworks/compile/mclinker/include/mcld/Script/ |
GroupCmd.h | 18 class InputTree; 31 InputTree& pInputTree, 48 InputTree& m_InputTree;
|
ScriptFile.h | 23 class InputTree; 73 const InputTree& inputs() const { return *m_pInputTree; } 74 InputTree& inputs() { return *m_pInputTree; } 148 InputTree* m_pInputTree;
|
/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,b); 133 m_pTestee->join<InputTree::Inclusive>(pos,c); 134 pos.move<InputTree::Inclusive>(); 135 m_pTestee->join<InputTree::Positional>(pos,d); 136 m_pTestee->join<InputTree::Inclusive>(pos,e); 158 m_pTestee->join<InputTree::Inclusive>(pos,a); 159 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 | 12 #include <mcld/InputTree.h> 75 InputTree::iterator, 85 InputTree::iterator lastPos; 86 InputTree::Mover* move; 138 InputTree& inputs(); 141 const InputTree& inputs() const; 155 bool addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter); 174 InputTree::iterator pLastPos, 175 InputTree::Mover* pMove); 244 InputTree *m_pInputTree [all...] |
/frameworks/compile/mclinker/include/mcld/ |
InputTree.h | 1 //===- InputTree.h --------------------------------------------------------===// 216 /** \class InputTree 217 * \brief InputTree is the input tree to contains all inputs from the 220 * InputTree, of course, is uncopyable. 224 class InputTree : public BinaryTree<Input> 288 InputTree& enterGroup(TreeIteratorBase pRoot); 291 InputTree& insert(TreeIteratorBase pRoot, 294 InputTree& merge(TreeIteratorBase pRoot, 296 InputTree& pTree); 298 InputTree& insert(TreeIteratorBase pRoot [all...] |
Module.h | 16 #include <mcld/InputTree.h> 45 typedef InputTree::iterator input_iterator; 46 typedef InputTree::const_iterator const_input_iterator; 94 const InputTree& getInputTree() const { return m_MainTree; } 95 InputTree& getInputTree() { return m_MainTree; } 168 InputTree m_MainTree;
|
IRBuilder.h | 37 class InputTree;
|
/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 | 31 pBuilder.createNode<InputTree::Positional>(path().stem().native(), path()); 72 pBuilder.createNode<InputTree::Positional>(namespec(), *path); 85 pBuilder.createNode<InputTree::Positional>("bitcode", path(), Input::External); 232 pBuilder.createNode<InputTree::Positional>("defsym", "NAN"); 279 pBuilder.createNode<InputTree::Positional>(path.stem().native(), path);
|
/frameworks/compile/mclinker/lib/LD/ |
Archive.cpp | 35 m_pInputTree = new InputTree(); 56 InputTree& Archive::inputs() 62 const InputTree& Archive::inputs() const 88 bool Archive::addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter) 123 InputTree::iterator pLastPos, 124 InputTree::Mover* pMove)
|
GNUArchiveReader.cpp | 12 #include <mcld/InputTree.h> 113 &InputTree::Downward); 399 parent->move = &InputTree::Afterward; 420 &InputTree::Downward); 446 &InputTree::Downward);
|
GroupReader.cpp | 135 // InputTree 139 m_Module.getInputTree().merge<InputTree::Inclusive>((*it)->input,
|
/frameworks/compile/mclinker/lib/Script/ |
GroupCmd.cpp | 17 #include <mcld/InputTree.h> 29 InputTree& pInputTree, 80 InputTree::iterator group = m_Builder.getCurrentNode(); 117 m_Builder.createNode<InputTree::Positional>( 143 m_Builder.createNode<InputTree::Positional>(
|
ScriptFile.cpp | 26 #include <mcld/InputTree.h> 61 m_pInputTree = new InputTree();
|
/frameworks/compile/mclinker/lib/Object/ |
ObjectLinker.cpp | 14 #include <mcld/InputTree.h> 207 m_pModule->getInputTree().merge<InputTree::Inclusive>(input, 219 m_pModule->getInputTree().merge<InputTree::Inclusive>(input, 291 mcld::InputTree::bfs_iterator input, inEnd = m_pModule->getInputTree().bfs_end(); [all...] |
/frameworks/compile/mclinker/lib/CodeGen/ |
MCLinker.cpp | 18 #include <mcld/InputTree.h>
|
/frameworks/compile/mclinker/lib/Target/ |
GNULDBackend.cpp | 15 #include <mcld/InputTree.h> [all...] |