Lines Matching refs:inputs

40   InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end();  in normalize()
41   for (input = m_LDInfo.inputs().dfs_begin(); input!=inEnd; ++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()
109   for (input=m_LDInfo.inputs().bfs_begin(); input!=inEnd; ++input) {  in linkable()
191   mcld::InputTree::bfs_iterator input, inEnd = m_LDInfo.inputs().bfs_end();  in readSections()
192   for (input=m_LDInfo.inputs().bfs_begin(); input!=inEnd; ++input) {  in readSections()
213   mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end();  in readSymbolTables()
214   for (input=m_LDInfo.inputs().dfs_begin(); input!=inEnd; ++input) {  in readSymbolTables()
233   mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end();  in mergeSymbolTables()
234   for (input=m_LDInfo.inputs().dfs_begin(); input!=inEnd; ++input) {  in mergeSymbolTables()
267   mcld::InputTree::bfs_iterator input, inEnd = m_LDInfo.inputs().bfs_end();  in readRelocations()
268   for (input=m_LDInfo.inputs().bfs_begin(); input!=inEnd; ++input) {  in readRelocations()