/frameworks/base/tools/split-select/ |
H A D | Rule_test.cpp | 68 expected.erase(std::remove_if(expected.begin(), expected.end(), ::isspace), expected.end()); 72 result.erase(std::remove_if(result.begin(), result.end(), ::isspace), result.end());
|
/frameworks/compile/libbcc/bcinfo/BitReader_2_7/ |
H A D | BitcodeReader.cpp | 311 std::sort(ResolveConstants.begin(), ResolveConstants.end()); 350 std::lower_bound(ResolveConstants.begin(), ResolveConstants.end(), 1253 std::transform(Vals.begin(), Vals.end(), Words.begin(), 1632 for (Module::iterator FI = TheModule->begin(), FE = TheModule->end(); 1676 for (Module::iterator FI = TheModule->begin(), FE = TheModule->end(); 1742 std::reverse(FunctionsWithBodies.begin(), FunctionsWithBodies.end()); 2945 for (UpgradedIntrinsicMap::iterator I = UpgradedIntrinsics.begin(), 2984 for (Module::iterator F = TheModule->begin(), E = TheModule->end(); 2997 UpgradedIntrinsics.begin(), [all...] |
/frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
H A D | BitcodeReader.cpp | 50 I = BB->begin(), E = BB->end(); I != E; ++I) { 152 I = M->begin(), E = M->end(); I != E; ++I) { 156 II = F.begin(), IE = F.end(); II != IE; ++II) { 177 I = InvokeToIntrinsicsMap.begin(), E = InvokeToIntrinsicsMap.end(); 209 II = UnwindDest->begin(); isa<PHINode>(II); ++II) { 238 I = InvokeToIntrinsicsMap.begin(), E = InvokeToIntrinsicsMap.end(); 258 I = DeadInsts.begin(), E = DeadInsts.end(); I != E; ++I) { 590 std::sort(ResolveConstants.begin(), ResolveConstants.end()); 629 std::lower_bound(ResolveConstants.begin(), ResolveConstants.end(), 1554 std::transform(Vals.begin(), Val [all...] |
/frameworks/compile/libbcc/bcinfo/Wrap/ |
H A D | bitcode_wrapperer.cpp | 179 for (vector<BCHeaderField>::iterator it = header_fields_.begin();
|
/frameworks/compile/libbcc/bcinfo/tools/ |
H A D | main.cpp | 103 outFile = std::string(inFile.begin(), inFile.end() - 3) + ".ll"; 104 infoFile = std::string(inFile.begin(), inFile.end() - 3) + ".bcinfo";
|
/frameworks/compile/libbcc/lib/Core/ |
H A D | BCCContextImpl.cpp | 31 std::vector<Source *> Sources(mOwnSources.begin(), mOwnSources.end());
|
/frameworks/compile/libbcc/lib/ExecutionEngine/ |
H A D | GDBJITRegistrar.cpp | 146 for (RegisteredObjectBufferMap::iterator I = ObjectBufferMap.begin(), E = ObjectBufferMap.end();
|
/frameworks/compile/libbcc/lib/Renderscript/ |
H A D | RSExecutable.cpp | 66 var_iter = export_var_names.begin(), 83 func_iter = export_func_names.begin(), 100 foreach_iter = export_foreach_funcs.begin(), 117 for (RSInfo::PragmaListTy::const_iterator pragma_iter = pragmas.begin(),
|
H A D | RSForEachExpand.cpp | 381 llvm::IRBuilder<> Builder(ExpandedFunction->getEntryBlock().begin()); 511 llvm::IRBuilder<> Builder(ExpandedFunction->getEntryBlock().begin()); 793 for (std::vector<std::string>::iterator FI = Funcs.begin(),
|
H A D | RSInfo.cpp | 173 for (PragmaListTy::const_iterator pragma_iter = mPragmas.begin(), 179 for (ObjectSlotListTy::const_iterator slot_iter = mObjectSlots.begin(), 185 for (ExportVarNameListTy::const_iterator var_iter = mExportVarNames.begin(), 191 for (ExportFuncNameListTy::const_iterator func_iter = mExportFuncNames.begin(), 198 foreach_iter = mExportForeachFuncs.begin(), 239 for (PragmaListTy::const_iterator pragma_iter = mPragmas.begin(),
|
H A D | RSInfoWriter.cpp | 122 for (typename ItemContainer::const_iterator item_iter = pList.begin(),
|
/frameworks/compile/libbcc/lib/Support/ |
H A D | CompilerConfig.cpp | 212 for (std::vector<std::string>::const_iterator attr_iter = pAttrs.begin(),
|
/frameworks/compile/libbcc/tools/bcc_strip_attr/ |
H A D | bcc_strip_attr.cpp | 74 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | BinTree.h | 272 // | begin | 301 for (data = pClient.begin(); data!=dEnd; ++data ) { 420 iterator begin() function in class:mcld::BinaryTree 426 const_iterator begin() const function in class:mcld::BinaryTree
|
H A D | HashTable.h | 101 iterator begin(); 104 const_entry_iterator begin() const; 107 chain_iterator begin(const key_type& pKey); 109 const_chain_iterator begin(const key_type& pKey) const;
|
/frameworks/compile/mclinker/include/mcld/Fragment/ |
H A D | Stub.h | 94 fixup_iterator fixup_begin() { return m_FixupList.begin(); } 96 const_fixup_iterator fixup_begin() const { return m_FixupList.begin(); }
|
/frameworks/compile/mclinker/include/mcld/ |
H A D | GeneralOptions.h | 345 const_rpath_iterator rpath_begin() const { return m_RpathList.begin(); } 346 rpath_iterator rpath_begin() { return m_RpathList.begin(); } 354 const_script_iterator script_begin() const { return m_ScriptList.begin(); } 355 script_iterator script_begin() { return m_ScriptList.begin(); } 364 { return m_UndefSymList.begin(); } 366 { return m_UndefSymList.begin(); } 386 const_aux_iterator aux_begin() const { return m_AuxiliaryList.begin(); } 387 aux_iterator aux_begin() { return m_AuxiliaryList.begin(); }
|
H A D | InputTree.h | 158 iterator begin() function in class:mcld::BinaryTree 167 const_iterator begin() const function in class:mcld::BinaryTree
|
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | BranchIsland.h | 58 iterator begin(); 60 const_iterator begin() const; 68 { return m_Relocations.begin(); } 71 { return m_Relocations.begin(); }
|
H A D | ELFSegment.h | 43 iterator begin() { return m_SectionList.begin(); } function in class:mcld::ELFSegment 44 const_iterator begin() const { return m_SectionList.begin(); } function in class:mcld::ELFSegment
|
H A D | ELFSegmentFactory.h | 32 const_iterator begin() const { return m_Segments.begin(); } function in class:mcld::ELFSegmentFactory 33 iterator begin() { return m_Segments.begin(); } function in class:mcld::ELFSegmentFactory
|
H A D | EhFrame.h | 118 const_fde_iterator begin() const { return m_FDEs.begin(); } function in class:mcld::EhFrame::CIE 119 fde_iterator begin() { return m_FDEs.begin(); } function in class:mcld::EhFrame::CIE 197 const_cie_iterator cie_begin() const { return m_CIEs.begin(); } 198 cie_iterator cie_begin() { return m_CIEs.begin(); }
|
H A D | LDContext.h | 45 const_sect_iterator sectBegin() const { return m_SectionTable.begin(); } 46 sect_iterator sectBegin() { return m_SectionTable.begin(); } 72 const_sym_iterator symTabBegin() const { return m_SymTab.begin(); } 73 sym_iterator symTabBegin() { return m_SymTab.begin(); } 79 const_sect_iterator relocSectBegin() const { return m_RelocSections.begin(); } 80 sect_iterator relocSectBegin() { return m_RelocSections.begin(); }
|
H A D | NamePool.h | 103 { return m_Table.begin(); } 109 { return m_Table.begin(); } 117 { return m_FreeInfoSet.begin(); } 123 { return m_FreeInfoSet.begin(); }
|
H A D | RelocData.h | 82 const_iterator begin () const { return m_Relocations.begin(); } function in class:mcld::RelocData 83 iterator begin () { return m_Relocations.begin(); } function in class:mcld::RelocData 94 for (iterator it = begin(), ie = end(); it != ie; ++it) 98 for (std::list<Relocation*>::iterator it = relocs.begin(),
|