/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 | 88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } function in namespace:llvm 89 inline const_pred_iterator pred_begin(const BasicBlock *BB) { function in namespace:llvm 293 return pred_begin(N); 307 return pred_begin(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 | RegionInfo.cpp | 173 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; 195 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; 248 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) 403 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 421 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 485 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { 784 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 117 inline Interval::pred_iterator pred_begin(Interval *I) { function in namespace:llvm 144 return pred_begin(N);
|
/external/clang/lib/Analysis/ |
H A D | CFGReachabilityAnalysis.cpp | 71 for (CFGBlock::const_pred_iterator i = block->pred_begin(),
|
H A D | ReachableCode.cpp | 68 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), 138 for (CFGBlock::const_pred_iterator I = Block->pred_begin(),
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 158 for (pred_iterator PI = pred_begin(*BB), 231 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 345 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); 376 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 419 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { 460 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 615 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { 670 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ 774 for (pred_iterator PI = pred_begin(L->getHeader()),
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 192 return pred_empty() ? NULL : *(pred_begin()); 209 pred_iterator pred_begin() { return Preds.begin(); } function in class:clang::ento::ExplodedNode 212 const_pred_iterator pred_begin() const { function in class:clang::ento::ExplodedNode 213 return const_cast<ExplodedNode*>(this)->pred_begin();
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | UndefBranchChecker.cpp | 89 ExplodedNode *PrevN = *N->pred_begin();
|
H A D | UnreachableCodeChecker.cpp | 176 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); 218 const CFGBlock *pred = *CB->pred_begin();
|
/external/llvm/include/llvm/MC/ |
H A D | MCFunction.h | 65 pred_const_iterator pred_begin() const { return Predecessors.begin(); } function in class:llvm::MCBasicBlock
|
/external/llvm/lib/IR/ |
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/Scalar/ |
H A D | Reg2Mem.cpp | 76 assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
|
H A D | CorrelatedValuePropagation.cpp | 171 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); 215 pred_iterator PB = pred_begin(BB), PE = pred_end(BB);
|
H A D | JumpThreading.cpp | 171 if (pred_begin(BB) == pred_end(BB) && 342 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 366 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 521 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ 595 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 615 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 618 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 643 if (pred_begin(BB) == pred_end(BB) && 750 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); 888 for (pred_iterator PI = pred_begin(LoadB [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineBlockPlacement.cpp | 372 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(), 571 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(), 598 (*BestPred->pred_begin())->succ_size() == 1 && 599 *BestPred->pred_begin() != L.getHeader()) 600 BestPred = *BestPred->pred_begin(); 743 for (MachineBasicBlock::pred_iterator PI = Top->pred_begin(), 825 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(), 926 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(),
|
/external/llvm/lib/Transforms/IPO/ |
H A D | PruneEH.cpp | 202 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) 236 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!");
|
/external/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 83 pred_iterator_ty pred_begin(change_ty Node) { function in class:__anon21292::DAGDeltaAlgorithmImpl 214 for (pred_iterator_ty it = pred_begin(Change), 344 CurrentSet.insert(pred_begin(*it), pred_end(*it));
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 260 pred_iterator pred_begin() { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock 261 const_pred_iterator pred_begin() const { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock 715 return N->pred_begin(); 729 return N->pred_begin();
|
/external/llvm/lib/Target/X86/ |
H A D | X86VZeroUpper.cpp | 213 for (MachineBasicBlock::const_pred_iterator PI = BB.pred_begin(),
|
/external/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 72 static PrevBItr PrevBegin(const CFGBlock *B) { return B->pred_begin(); } 98 static NextBItr NextBegin(const CFGBlock *B) { return B->pred_begin(); }
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 101 const ExplodedNode *pred = *(node->pred_begin()); 165 ExplodedNode *pred = *(node->pred_begin());
|