/external/llvm/include/llvm/Support/ |
H A D | PredIteratorCache.h | 41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
|
H A D | CFG.h | 90 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 91 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 288 return pred_end(N); 302 return pred_end(N);
|
/external/llvm/lib/Analysis/ |
H A D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
|
H A D | LoopInfo.cpp | 143 assert(PI != pred_end(H) && 146 if (PI == pred_end(H)) return 0; // dead loop 148 if (PI != pred_end(H)) return 0; // multiple backedges? 236 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI)
|
H A D | RegionInfo.cpp | 141 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; 163 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; 216 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) 371 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 389 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 453 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { 752 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE;
|
H A D | ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); 370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); 404 const_pred_iterator predi = pred_begin(BB), prede = pred_end(BB);
|
H A D | ProfileInfo.cpp | 71 const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB); 514 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); 586 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); 641 // const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); 781 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); 871 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); 895 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); 937 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); 967 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB);
|
/external/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 114 /// pred_begin/pred_end - define methods so that Intervals may be used 120 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm 147 return pred_end(N);
|
/external/clang/lib/Analysis/ |
H A D | CFGReachabilityAnalysis.cpp | 72 e = block->pred_end(); i != e; ++i) {
|
H A D | ReachableCode.cpp | 69 E = Block->pred_end(); I != E; ++I) { 139 E = Block->pred_end(); I != E; ++I) {
|
/external/llvm/lib/VMCore/ |
H A D | BasicBlock.cpp | 184 pred_iterator PI = pred_begin(this), E = pred_end(this); 197 pred_iterator PI = pred_begin(this), E = pred_end(this); 219 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 156 PE = pred_end(*BB); PI != PE; ++PI) { 223 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 337 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); 368 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 411 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { 452 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 607 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { 662 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ 767 PE = pred_end(L->getHeader()); PI != PE; ++PI)
|
H A D | BreakCriticalEdges.cpp | 97 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); 114 E = pred_end(P); 268 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); 358 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 203 pred_iterator pred_end() { return Preds.end(); } function in class:clang::ento::ExplodedNode 208 const_pred_iterator pred_end() const { function in class:clang::ento::ExplodedNode 209 return const_cast<ExplodedNode*>(this)->pred_end();
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Reg2Mem.cpp | 76 assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
|
H A D | CorrelatedValuePropagation.cpp | 152 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); 196 pred_iterator PB = pred_begin(BB), PE = pred_end(BB);
|
H A D | JumpThreading.cpp | 169 if (pred_begin(BB) == pred_end(BB) && 331 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 355 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 510 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ 584 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 604 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 607 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 632 if (pred_begin(BB) == pred_end(BB) && 739 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); 873 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadB [all...] |
/external/llvm/lib/Transforms/IPO/ |
H A D | PruneEH.cpp | 200 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) 234 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!");
|
/external/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 87 pred_iterator_ty pred_end(change_ty Node) { function in class:__anon8809::DAGDeltaAlgorithmImpl 215 ie = pred_end(Change); it != ie; ++it) { 344 CurrentSet.insert(pred_begin(*it), pred_end(*it));
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 259 pred_iterator pred_end() { return Predecessors.end(); } function in class:llvm::MachineBasicBlock 260 const_pred_iterator pred_end() const { return Predecessors.end(); } function in class:llvm::MachineBasicBlock 661 return N->pred_end(); 675 return N->pred_end();
|
/external/llvm/lib/Target/X86/ |
H A D | X86VZeroUpper.cpp | 199 PE = BB.pred_end(); PI != PE; ++PI) {
|
/external/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 73 static PrevBItr PrevEnd(const CFGBlock *B) { return B->pred_end(); } 99 static NextBItr NextEnd(const CFGBlock *B) { return B->pred_end(); }
|
/external/llvm/lib/CodeGen/ |
H A D | LiveRangeCalc.cpp | 205 PE = MBB->pred_end(); PI != PE; ++PI) { 294 PE = MBB->pred_end(); PI != PE; ++PI) {
|
H A D | MachineSSAUpdater.cpp | 162 E = BB->pred_end(); PI != E; ++PI) { 288 E = BB->pred_end(); PI != E; ++PI)
|
/external/clang/include/clang/Analysis/ |
H A D | CFG.h | 394 pred_iterator pred_end() { return Preds.end(); } 396 const_pred_iterator pred_end() const { return Preds.end(); } 465 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); 867 { return N->pred_end(); } 881 { return N->pred_end(); }
|