/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | LDContext.h | 38 typedef SectionTable::iterator sect_iterator; 42 typedef SymbolTable::iterator sym_iterator;
|
H A D | Archive.h | 77 InputTree::iterator, 87 InputTree::iterator lastPos; 156 /// @param pIter - the iterator in the input tree built from this archive 157 bool addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter); 176 InputTree::iterator pLastPos,
|
H A D | EhFrame.h | 41 typedef CIEListType::iterator cie_iterator; 43 typedef FDEListType::iterator fde_iterator;
|
/frameworks/compile/mclinker/lib/MC/ |
H A D | AttributeFactory.cpp | 31 iterator cur = m_AttrSet.begin(); 32 iterator aEnd = m_AttrSet.end();
|
H A D | SymbolCategory.cpp | 248 SymbolCategory::iterator SymbolCategory::begin() 253 SymbolCategory::iterator SymbolCategory::end() 268 SymbolCategory::iterator SymbolCategory::localBegin() 273 SymbolCategory::iterator SymbolCategory::localEnd() 275 iterator iter = m_OutputSymbols.begin(); 294 SymbolCategory::iterator SymbolCategory::commonBegin() 299 SymbolCategory::iterator SymbolCategory::commonEnd() 301 iterator iter = localEnd(); 318 SymbolCategory::iterator SymbolCategory::regularBegin() 323 SymbolCategory::iterator SymbolCategor [all...] |
/frameworks/compile/mclinker/lib/Target/ARM/ |
H A D | ARMPLT.cpp | 96 ARMGOT::iterator got_it = m_GOT.getNextGOTPLTEntry(); 123 ARMGOT::iterator got_it = m_GOT.getNextGOTPLTEntry(); 136 iterator first = m_SectionData.getFragmentList().begin(); 161 iterator first = m_SectionData.getFragmentList().begin(); 188 ARMPLT::iterator it = m_SectionData.begin(); 189 ARMPLT::iterator ie = m_SectionData.end(); 232 iterator it = begin(); 241 ARMPLT::iterator ie = end();
|
/frameworks/compile/mclinker/lib/Target/X86/ |
H A D | X86GOT.cpp | 78 X86GOT::iterator X86GOT::begin() 88 X86GOT::iterator X86GOT::end()
|
/frameworks/compile/mclinker/include/mcld/Support/ |
H A D | GCFactory.h | 19 #include <iterator> 58 * \brief DataIterator provides STL compatible iterator for allocators 72 typedef DataIterator<ChunkType, nonconst_traits> iterator; typedef in class:mcld::DataIterator 98 assert(0 && "data iterator goes to a invalid position"); 120 typename Alloc::value_type> > iterator; typedef in class:mcld::GCFactoryBase 174 iterator begin() 175 { return iterator(Alloc::m_pRoot, 0); } 180 iterator end() { 183 iterator(Alloc::m_pCurrent, Alloc::m_pCurrent->bound);
|
H A D | TargetRegistry.h | 130 typedef TargetListTy::iterator iterator; typedef in class:mcld::TargetRegistry 136 static iterator begin() { return s_TargetList.begin(); } 137 static iterator end() { return s_TargetList.end(); } 223 llvm::TargetRegistry::iterator TIter, TEnd = llvm::TargetRegistry::end();
|
/frameworks/compile/libbcc/tools/mcld/ |
H A D | Main.cpp | 219 llvm::cl::list<std::string>::iterator wrap, wrap_end = OptWrapList.end(); 225 llvm::cl::list<std::string>::iterator portable, portable_end = OptPortableList.end(); 231 llvm::cl::list<std::string>::iterator sdir, sdir_end = OptSearchDirList.end(); 272 llvm::cl::list<std::string>::iterator file_it = OptInputObjectFiles.begin(); 273 llvm::cl::list<std::string>::iterator lib_it = OptNameSpecList.begin(); 275 llvm::cl::list<std::string>::iterator file_begin = OptInputObjectFiles.begin(); 276 llvm::cl::list<std::string>::iterator lib_begin = OptNameSpecList.begin(); 277 llvm::cl::list<std::string>::iterator file_end = OptInputObjectFiles.end(); 278 llvm::cl::list<std::string>::iterator lib_end = OptNameSpecList.end();
|
/frameworks/compile/mclinker/tools/mcld/ |
H A D | main.cpp | 212 llvm::cl::list<std::string>::iterator wrap, wrap_end = OptWrapList.end(); 218 llvm::cl::list<std::string>::iterator portable, portable_end = OptPortableList.end(); 224 llvm::cl::list<std::string>::iterator sdir, sdir_end = OptSearchDirList.end(); 265 llvm::cl::list<std::string>::iterator file_it = OptInputObjectFiles.begin(); 266 llvm::cl::list<std::string>::iterator lib_it = OptNameSpecList.begin(); 268 llvm::cl::list<std::string>::iterator file_begin = OptInputObjectFiles.begin(); 269 llvm::cl::list<std::string>::iterator lib_begin = OptNameSpecList.begin(); 270 llvm::cl::list<std::string>::iterator file_end = OptInputObjectFiles.end(); 271 llvm::cl::list<std::string>::iterator lib_end = OptNameSpecList.end();
|
/frameworks/base/drm/java/android/drm/ |
H A D | DrmUtils.java | 179 * This method returns an iterator object that can be used to iterate over 182 * @return The iterator object. 184 public Iterator<String> iterator() { method in class:DrmUtils.ExtendedMetadataParser 185 return mMap.values().iterator(); 189 * This method returns an iterator object that can be used to iterate over 192 * @return The iterator object. 195 return mMap.keySet().iterator();
|
/frameworks/compile/mclinker/lib/Support/ |
H A D | MemoryArea.cpp | 109 SpaceList::iterator space, sEnd = m_SpaceList.end(); 116 SpaceList::iterator space, sEnd = m_SpaceList.end(); 128 SpaceList::iterator sIter, sEnd = m_SpaceList.end();
|
/frameworks/compile/mclinker/unittests/ |
H A D | UniqueGCFactoryBaseTest.cpp | 78 TEST_F( UniqueGCFactoryBaseTest, iterator ) 94 MemoryAreaFactory::iterator aIter = memFactory->begin(); 99 MemoryAreaFactory::iterator aEnd = memFactory->end();
|
H A D | InputTreeTest.cpp | 48 InputTree::iterator node = m_pTestee->root(); 75 InputTree::iterator node = m_pTestee->root(); 100 InputTree::iterator node = m_pTestee->root(); 121 InputTree::iterator node = m_pTestee->root();
|
H A D | HashTableTest.cpp | 91 HashTableTy::iterator iter; 117 HashTableTy::iterator entry = hashTable->find(key); 157 HashTableTy::iterator iter; 183 HashTableTy::iterator iter; 206 HashTableTy::iterator iter; 241 HashTableTy::iterator iter; 262 HashTableTy::iterator iter, iEnd = hashTable->end();
|
/frameworks/base/media/mca/filterfw/native/base/ |
H A D | utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator 45 // because the hash_set may call the hash function on the iterator when it is 64 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 116 typename std::set<T>::iterator iter = items_.find(item); 152 std::pair<typename Collection::iterator, bool> ret =
|
/frameworks/base/media/mca/filterpacks/native/base/ |
H A D | utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator 45 // because the hash_set may call the hash function on the iterator when it is 64 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 116 typename std::set<T>::iterator iter = items_.find(item); 152 std::pair<typename Collection::iterator, bool> ret =
|
/frameworks/av/media/libstagefright/foundation/ |
H A D | AAtomizer.cpp | 43 List<AString>::iterator it = entry.begin();
|
/frameworks/base/core/java/android/util/ |
H A D | FastImmutableArraySet.java | 24 * The same iterator instance is reused each time to avoid creating lots of garbage. 39 public Iterator<T> iterator() { method in class:FastImmutableArraySet
|
/frameworks/compile/libbcc/lib/ExecutionEngine/ |
H A D | GDBJITRegistrar.cpp | 106 void deregisterObjectInternal(RegisteredObjectBufferMap::iterator I); 146 for (RegisteredObjectBufferMap::iterator I = ObjectBufferMap.begin(), E = ObjectBufferMap.end(); 148 // Call the private method that doesn't update the map so our iterator 187 RegisteredObjectBufferMap::iterator I = ObjectBufferMap.find(Object); 198 RegisteredObjectBufferMap::iterator I) {
|
/frameworks/compile/mclinker/lib/LD/ |
H A D | LDSectionFactory.cpp | 42 iterator sect_iter, sect_end = end();
|
/frameworks/compile/slang/BitWriter_2_9/ |
H A D | BitcodeWriterPass.cpp | 35 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) 52 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
|
/frameworks/compile/slang/BitWriter_2_9_func/ |
H A D | BitcodeWriterPass.cpp | 35 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) 52 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
|
/frameworks/compile/mclinker/include/mcld/MC/ |
H A D | InputTree.h | 36 typedef PolicyIterator<Input, typename Traits::nonconst_traits, IteratorType> iterator; typedef in class:mcld::PolicyIterator 43 PolicyIterator(const iterator &X) 89 typedef BinaryTree<Input>::iterator iterator; typedef in class:mcld::InputTree 94 * \brief Mover provides the interface for moving iterator forward. 97 * iterator forward in certain direction. @ref Mover::connect 107 * \brief class Succeeder moves the iterator afterward. 120 * \brief class Includer moves the iterator downward. 190 bool isGroup(const InputTree::iterator& pos);
|