/freebsd-10.0-release/contrib/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); 60 for (Interval::succ_iterator I = Int->Successors.begin(),
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | EdgeBundles.cpp | 44 for (MachineFunction::const_iterator I = MF->begin(), E = MF->end(); I != E; 84 for (MachineFunction::const_iterator I = MF->begin(), E = MF->end();
|
H A D | UnreachableBlockElim.cpp | 76 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) 80 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { 140 for (MachineFunction::iterator I = F.begin(), E = F.end(); I != E; ++I) { 154 MachineBasicBlock::iterator start = succ->begin(); 176 for (MachineFunction::iterator I = F.begin(), E = F.end(); I != E; ++I) { 181 MachineBasicBlock::iterator phi = BB->begin();
|
/freebsd-10.0-release/contrib/llvm/lib/MC/ |
H A D | MCWin64EH.cpp | 25 for (std::vector<MCWin64EHInstruction>::const_iterator I = instArray.begin(), 65 static void EmitUnwindCode(MCStreamer &streamer, MCSymbol *begin, argument 72 EmitAbsDifference(streamer, inst.getLabel(), begin); 77 EmitAbsDifference(streamer, inst.getLabel(), begin); 92 EmitAbsDifference(streamer, inst.getLabel(), begin); 103 EmitAbsDifference(streamer, inst.getLabel(), begin); 113 EmitAbsDifference(streamer, inst.getLabel(), begin); 126 EmitAbsDifference(streamer, inst.getLabel(), begin);
|
/freebsd-10.0-release/contrib/llvm/lib/Target/MBlaze/ |
H A D | MBlazeInstrInfo.cpp | 122 if (I == MBB.begin()) 126 if (I == MBB.begin()) 138 if (I == MBB.begin() || !isUnpredicatedTerminator(--I)) { 158 if (SecondLastInst && I != MBB.begin() && isUnpredicatedTerminator(--I)) 215 if (I == MBB.begin()) return 0; 218 if (I == MBB.begin()) 232 if (I == MBB.begin()) return 1; 286 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | BasicBlockPlacement.cpp | 91 InsertPos = F.begin(); 94 PlaceBlocks(F.begin());
|
H A D | DCE.cpp | 44 for (BasicBlock::iterator DI = BB.begin(); DI != BB.end(); ) { 121 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), I),
|
H A D | GlobalMerge.cpp | 155 std::stable_sort(Globals.begin(), Globals.end(), GlobalCmp(TD)); 214 for (Module::iterator IFn = M.begin(), IEndFn = M.end(); IFn != IEndFn; 216 for (Function::iterator IBB = IFn->begin(), IEndBB = IFn->end(); 281 I = Globals.begin(), E = Globals.end(); I != E; ++I) 286 I = BSSGlobals.begin(), E = BSSGlobals.end(); I != E; ++I) 292 I = ConstGlobals.begin(), E = ConstGlobals.end(); I != E; ++I)
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 85 for (Function::iterator I = F.begin(), E = F.end(); I != E; ) { 106 for (LowerSwitch::CaseVector::const_iterator B = C.begin(), 138 BasicBlock* LBranch = switchConvert(LHS.begin(), LHS.end(), Val, 140 BasicBlock* RBranch = switchConvert(RHS.begin(), RHS.end(), Val, 206 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { 239 for (IntegersSubsetToBB::RangeIterator i = TheClusterifier.begin(), 281 for (BasicBlock::iterator I = Default->begin(); isa<PHINode>(I); ++I) { 297 BasicBlock* SwitchBlock = switchConvert(Cases.begin(), Cases.end(), Val,
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | SourceManagerInternals.h | 123 iterator begin() { return LineEntries.begin(); } function in class:clang::LineTableInfo
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Lex/ |
H A D | HeaderSearch.h | 251 SearchDirs.insert(SearchDirs.begin() + idx, dir); 259 SystemHeaderPrefixes.assign(P.begin(), P.end()); 529 search_dir_iterator search_dir_begin() const { return SearchDirs.begin(); } 534 return SearchDirs.begin(); 537 return SearchDirs.begin() + AngledDirIdx; 541 return SearchDirs.begin() + AngledDirIdx; 544 return SearchDirs.begin() + SystemDirIdx; 548 return SearchDirs.begin() + SystemDirIdx;
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | Environment.h | 72 iterator begin() const { return ExprBindings.begin(); } function in class:clang::ento::Environment
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Lex/ |
H A D | PPCaching.cpp | 106 CachedTokensTy::iterator AnnotBegin = CachedTokens.begin() + i-1; 112 CachedTokens.erase(AnnotBegin + 1, CachedTokens.begin() + CachedLexPos);
|
/freebsd-10.0-release/contrib/llvm/tools/lli/ |
H A D | RecordingMemoryManager.h | 47 const_data_iterator data_begin() const { return AllocatedDataMem.begin(); } 49 const_code_iterator code_begin() const { return AllocatedCodeMem.begin(); }
|
/freebsd-10.0-release/contrib/llvm/tools/opt/ |
H A D | PrintSCC.cpp | 81 for (std::vector<BasicBlock*>::const_iterator I = nextSCC.begin(), 102 for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(),
|
/freebsd-10.0-release/lib/libiconv_modules/mapper_std/ |
H A D | citrus_mapper_std.c | 94 if (n < lz->begin || n > lz->end) { 105 idx = idx * lz->width + n - lz->begin; 135 uint32_t begin, uint32_t end) 138 if (begin > end) 141 lz->begin = begin; 143 lz->width= end - begin + 1; 217 m = be32toh(rcx->rcx_src_rowcol[i].begin), 134 set_linear_zone(struct _citrus_mapper_std_linear_zone *lz, uint32_t begin, uint32_t end) argument
|
/freebsd-10.0-release/contrib/libstdc++/include/bits/ |
H A D | stl_bvector.h | 513 _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start); 537 this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(), 538 begin()); 559 begin() function in class:vector 563 begin() const function in class:vector 584 { return reverse_iterator(begin()); } 588 { return const_reverse_iterator(begin()); } 592 { return size_type(end() - begin()); } 605 - begin()); } 609 { return begin() [all...] |
H A D | stl_list.h | 508 { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } 593 begin() function in class:list 602 begin() const function in class:list 648 { return reverse_iterator(begin()); } 657 { return const_reverse_iterator(begin()); } 661 * Returns true if the %list is empty. (Thus begin() would equal 671 { return std::distance(begin(), end()); } 698 { return *begin(); } 706 { return *begin(); } 745 { this->_M_insert(begin(), __ [all...] |
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | split_fn_imps.hpp | 79 other.m_size = std::distance(other.PB_DS_CLASS_C_DEC::begin(), 160 std::distance(p_internal_nd->begin(), child_it) + 1; 165 std::distance(p_internal_nd->begin(), p_internal_nd->end()) - 187 _GLIBCXX_DEBUG_ASSERT(std::distance(p_internal_nd->begin(), 190 if (std::distance(p_internal_nd->begin(), p_internal_nd->end()) > 1) 198 node_pointer p_ret =* p_internal_nd->begin();
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | ProfileInfo.h | 181 for (typename std::map<const FType*, double>::iterator fi = FunctionInformation.begin(), 188 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end(); 193 for (typename BlockCounts::const_iterator bi = bwi->second.begin(), be = bwi->second.end(); bi != be; ++bi) { 198 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end(); 202 for (typename EdgeWeights::iterator ewi = ei->second.begin(), ewe = ei->second.end(); 213 for (typename FType::const_iterator BI = F->begin(), BE = F->end();
|
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 167 iterator begin() { return Queue.begin(); } function in class:llvm::ReadyQueue 174 return std::find(Queue.begin(), Queue.end(), SU); 185 unsigned idx = I - Queue.begin(); 187 return Queue.begin() + idx; 295 MachineBasicBlock::iterator begin,
|
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/ |
H A D | Function.h | 365 iterator begin() { return BasicBlocks.begin(); } function in class:llvm::Function 366 const_iterator begin() const { return BasicBlocks.begin(); } function in class:llvm::Function 382 return ArgumentList.begin(); 386 return ArgumentList.begin();
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Support/ |
H A D | BumpVector.h | 84 iterator begin() { return Begin; } function in class:clang::BumpVector 85 const_iterator begin() const { return Begin; } function in class:clang::BumpVector 92 reverse_iterator rend() { return reverse_iterator(begin()); } 93 const_reverse_iterator rend() const { return const_reverse_iterator(begin());} 108 return begin()[0]; 111 return begin()[0];
|
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Symbol/ |
H A D | TypeList.cpp | 102 // for (pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 129 for (pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 141 for (auto pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 151 for (auto pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 176 for (iterator pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 254 for (pos = m_types.begin(); pos != end; ++pos) 348 for (pos = m_types.begin(); pos != end; ++pos)
|
/freebsd-10.0-release/contrib/llvm/lib/Bitcode/Writer/ |
H A D | ValueEnumerator.cpp | 39 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I) { 71 for (Module::const_iterator F = M->begin(), E = M->end(); F != E; ++F) { 77 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB) 78 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E;++I){ 146 for (ValueMapType::const_iterator I = Map.begin(), 193 std::stable_sort(Values.begin()+CstStart, Values.begin()+CstEnd, P); 198 std::partition(Values.begin()+CstStart, Values.begin()+CstEnd, 210 for (ValueSymbolTable::const_iterator VI = VST.begin(), V [all...] |