/external/llvm/include/llvm/Support/ |
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));
|
CFG.h | 86 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } function in namespace:llvm 87 inline const_pred_iterator pred_begin(const BasicBlock *BB) { function in namespace:llvm 285 return pred_begin(N); 299 return pred_begin(N);
|
/external/llvm/lib/Analysis/ |
Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
|
RegionInfo.cpp | 140 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; 162 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; 215 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) 370 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 388 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 452 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { 751 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE;
|
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);
|
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); [all...] |
/external/llvm/include/llvm/Analysis/ |
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/ |
CFGReachabilityAnalysis.cpp | 71 for (CFGBlock::const_pred_iterator i = block->pred_begin(),
|
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/ |
LoopSimplify.cpp | 157 for (pred_iterator PI = pred_begin(*BB), 230 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 344 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); 375 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 418 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { 459 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 614 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { 669 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ 773 for (pred_iterator PI = pred_begin(L->getHeader()),
|
BreakCriticalEdges.cpp | 97 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); 262 // faster than iterating pred_begin/end. 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/ |
ExplodedGraph.h | 192 return pred_empty() ? NULL : *(pred_begin()); 205 pred_iterator pred_begin() { return Preds.begin(); } function in class:clang::ento::ExplodedNode 208 const_pred_iterator pred_begin() const { function in class:clang::ento::ExplodedNode 209 return const_cast<ExplodedNode*>(this)->pred_begin();
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
UndefBranchChecker.cpp | 89 ExplodedNode *PrevN = *N->pred_begin();
|
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/lib/IR/ |
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/include/llvm/CodeGen/ |
MachineBasicBlock.h | 257 pred_iterator pred_begin() { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock 258 const_pred_iterator pred_begin() const { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock 707 return N->pred_begin(); 721 return N->pred_begin();
|
/external/llvm/lib/Transforms/Scalar/ |
Reg2Mem.cpp | 76 assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
|
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);
|
JumpThreading.cpp | 169 if (pred_begin(BB) == pred_end(BB) && 340 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 364 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 519 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ 593 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 613 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 616 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 641 if (pred_begin(BB) == pred_end(BB) && 748 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); [all...] |
/external/llvm/lib/CodeGen/ |
MachineBlockPlacement.cpp | 366 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(), 565 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(), 592 (*BestPred->pred_begin())->succ_size() == 1 && 593 *BestPred->pred_begin() != L.getHeader()) 594 BestPred = *BestPred->pred_begin(); 737 for (MachineBasicBlock::pred_iterator PI = Top->pred_begin(), [all...] |
/external/llvm/lib/Transforms/IPO/ |
PruneEH.cpp | 204 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) 238 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!");
|
/external/llvm/lib/Support/ |
DAGDeltaAlgorithm.cpp | 83 pred_iterator_ty pred_begin(change_ty Node) { function in class:__anon11576::DAGDeltaAlgorithmImpl 214 for (pred_iterator_ty it = pred_begin(Change), 344 CurrentSet.insert(pred_begin(*it), pred_end(*it));
|
/external/llvm/lib/Target/X86/ |
X86VZeroUpper.cpp | 208 for (MachineBasicBlock::const_pred_iterator PI = BB.pred_begin(),
|
/external/clang/include/clang/Analysis/FlowSensitive/ |
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/ |
ExplodedGraph.cpp | 101 const ExplodedNode *pred = *(node->pred_begin()); 165 ExplodedNode *pred = *(node->pred_begin());
|