/external/llvm/lib/CodeGen/ |
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) {
|
EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI) 91 SE = I->succ_end(); SI != SE; ++SI)
|
UnreachableBlockElim.cpp | 84 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 151 while (BB->succ_begin() != BB->succ_end()) {
|
DeadMachineInstructionElim.cpp | 106 E = MBB->succ_end(); S != E; S++)
|
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(); [all...] |
ShrinkWrapping.cpp | 206 SE = MBB->succ_end(); SI != SE; ++SI) { 474 SE = EntryBlock->succ_end(); SI != SE; ++SI) { 561 SE = MBB->succ_end(); SI != SE; ++SI) { 595 SE = MBB->succ_end(); SI != SE; ++SI) { 746 SE = MBB->succ_end(); SI != SE; ++SI) { 893 SE = EntryBlock->succ_end(); SI != SE; ++SI) { [all...] |
/external/llvm/include/llvm/Analysis/ |
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
|
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);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
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();
|
/external/llvm/include/llvm/MC/ |
MCFunction.h | 62 succ_const_iterator succ_end() const { return Successors.end(); } function in class:llvm::MCBasicBlock
|
/external/llvm/include/llvm/Support/ |
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);
|
/external/llvm/lib/Transforms/Scalar/ |
BasicBlockPlacement.cpp | 127 succ_iterator SI = succ_begin(BB), E = succ_end(BB);
|
SimplifyCFGPass.cpp | 75 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) 182 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) 209 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
|
LoopInstSimplify.cpp | 134 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE;
|
/external/llvm/lib/Analysis/ |
CFG.cpp | 31 if (succ_begin(BB) == succ_end(BB)) 47 while (I != succ_end(ParentBB)) { 219 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I)
|
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) { 512 for (succ_const_iterator SI = succ_begin(BI), SE = succ_end(BI); 522 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 545 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 586 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I)
|
ProfileVerifierPass.cpp | 117 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); 139 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); 263 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); 342 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
|
ProfileInfo.cpp | 98 succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB); 250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); 386 for(succ_const_iterator BBI = succ_begin(FirstBB), BBE = succ_end(FirstBB); 528 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB); 599 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB); 650 // succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); 681 succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); 751 for (succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); 803 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); 818 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB) [all...] |
ProfileEstimatorPass.cpp | 263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); 312 for (succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); 413 succ_const_iterator succi = succ_begin(BB), succe = succ_end(BB);
|
DominanceFrontier.cpp | 67 for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);
|
/external/llvm/lib/Support/ |
DAGDeltaAlgorithm.cpp | 105 succ_iterator_ty succ_end(change_ty Node) { function in class:__anon23676::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) {
|
/external/llvm/include/llvm/CodeGen/ |
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();
|
/external/llvm/lib/Target/X86/ |
X86PadShortFunction.cpp | 157 I != MBB->succ_end(); ++I) {
|
/external/llvm/lib/Transforms/IPO/ |
PartialInlining.cpp | 60 for (succ_iterator SI = succ_begin(entryBlock), SE = succ_end(entryBlock);
|
/external/clang/include/clang/Analysis/FlowSensitive/ |
DataflowSolver.h | 76 static NextBItr NextEnd(const CFGBlock *B) { return B->succ_end(); } 96 static PrevBItr PrevEnd(const CFGBlock *B) { return B->succ_end(); }
|