/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | MachineBranchProbabilityInfo.cpp | 40 E = MBB->succ_end(); I != E; ++I) { 55 E = MBB->succ_end(); I != E; ++I) { 77 return getEdgeWeight(Src, std::find(Src->succ_begin(), Src->succ_end(), Dst)); 92 E = MBB->succ_end(); I != E; ++I) {
|
H A D | EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI) 91 SE = I->succ_end(); SI != SE; ++SI)
|
H A D | UnreachableBlockElim.cpp | 82 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 147 while (BB->succ_begin() != BB->succ_end()) {
|
H A D | DeadMachineInstructionElim.cpp | 106 E = MBB->succ_end(); S != E; S++)
|
H A D | MachineBasicBlock.cpp | 233 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) 324 for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI) { 407 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { 443 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { 529 succ_iterator E = succ_end(); 620 return std::find(succ_begin(), succ_end(), MBB) != succ_end(); 1076 while (SI != succ_end()) {
|
H A D | MachineBlockPlacement.cpp | 299 SE = (*CBI)->succ_end(); 342 SE = BB->succ_end(); 660 SE = (*I)->succ_end(); 760 SE = Bottom->succ_end(); 1187 SE = I->succ_end();
|
H A D | TailDuplication.cpp | 202 MBB->succ_end()); 630 SE = A.succ_end(); SI != SE; ++SI) { 665 TailBB->succ_end()); 838 E = TailBB->succ_end(); I != E; ++I) 962 MBB->removeSuccessor(MBB->succ_end()-1);
|
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 99 while (succ_end(node->getEntry()) != BItor && isExit(*BItor)) 109 BItor(succ_end(node->getEntry())) {} 135 while (BItor != succ_end(getNode()->getEntry()) 188 while (succ_end(Node->getEntry()) != Itor 194 Itor(succ_end(node->getEntry())) { 225 while (Itor != succ_end(Node->getEntry()) 254 inline RNSuccIterator<NodeType> succ_end(NodeType* Node) { function in namespace:llvm
|
H A D | Interval.h | 104 /// succ_begin/succ_end - define methods so that Intervals may be used 110 inline Interval::succ_iterator succ_end(Interval *I) { function in namespace:llvm 135 return succ_end(N);
|
/freebsd-10-stable/contrib/llvm/lib/Analysis/ |
H A D | CFG.cpp | 31 if (succ_begin(BB) == succ_end(BB)) 47 while (I != succ_end(ParentBB)) { 172 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) 226 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I)
|
H A D | BranchProbabilityInfo.cpp | 135 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 226 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) 315 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 526 for (succ_const_iterator SI = succ_begin(BI), SE = succ_end(BI); 536 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 559 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 600 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I)
|
H A D | BlockFrequencyInfo.cpp | 62 return succ_end(N);
|
H A D | DominanceFrontier.cpp | 67 for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);
|
H A D | LoopInfo.cpp | 365 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I) { 383 if (std::distance(succ_begin(current), succ_end(current)) <= 2) { 566 succ_iterator I = succ_begin(BB), E = succ_end(BB);
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 220 succ_iterator succ_end() { return Succs.end(); } function in class:clang::ento::ExplodedNode 225 const_succ_iterator succ_end() const { function in class:clang::ento::ExplodedNode 226 return const_cast<ExplodedNode*>(this)->succ_end(); 458 return N->succ_end(); 484 return N->succ_end();
|
/freebsd-10-stable/contrib/llvm/include/llvm/Support/ |
H A D | CFG.h | 236 inline succ_iterator succ_end(BasicBlock *BB) { function in namespace:llvm 239 inline succ_const_iterator succ_end(const BasicBlock *BB) { function in namespace:llvm 265 return succ_end(N); 279 return succ_end(N);
|
/freebsd-10-stable/contrib/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 105 succ_iterator_ty succ_end(change_ty Node) { function in class:__anon2422::DAGDeltaAlgorithmImpl 132 ie2 = succ_end(*it); it2 != ie2; ++it2) 204 if (succ_begin(*it) == succ_end(*it)) 241 if (succ_begin(*it) != succ_end(*it)) { 244 ie2 = succ_end(*it); it2 != ie2; ++it2) {
|
/freebsd-10-stable/contrib/llvm/include/llvm/MC/ |
H A D | MCFunction.h | 62 succ_const_iterator succ_end() const { return Successors.end(); } function in class:llvm::MCBasicBlock
|
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 278 succ_iterator succ_end() { return Successors.end(); } function in class:llvm::MachineBasicBlock 279 const_succ_iterator succ_end() const { return Successors.end(); } function in class:llvm::MachineBasicBlock 685 return N->succ_end(); 698 return N->succ_end();
|
/freebsd-10-stable/contrib/llvm/lib/Target/SystemZ/ |
H A D | SystemZShortenInst.cpp | 108 SE = MBB->succ_end(); SI != SE; ++SI) {
|
/freebsd-10-stable/contrib/llvm/lib/Target/X86/ |
H A D | X86PadShortFunction.cpp | 157 I != MBB->succ_end(); ++I) {
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 60 for (succ_iterator SI = succ_begin(entryBlock), SE = succ_end(entryBlock);
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 134 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE;
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 75 static NextBItr NextEnd(const CFGBlock *B) { return B->succ_end(); } 95 static PrevBItr PrevEnd(const CFGBlock *B) { return B->succ_end(); }
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CFG.h | 464 succ_iterator succ_end() { return Succs.end(); } 466 const_succ_iterator succ_end() const { return Succs.end(); } 529 return filtered_succ_iterator(succ_begin(), succ_end(), this, f); 908 { return N->succ_end(); } 922 { return N->succ_end(); }
|