/external/llvm/include/llvm/IR/ |
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 | 95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 96 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 100 return pred_begin(BB) == pred_end(BB); 103 return pred_range(pred_begin(BB), pred_end(BB)); 106 return pred_const_range(pred_begin(BB), pred_end(BB)); 332 return pred_end(N); 346 return pred_end(N);
|
/external/llvm/lib/Analysis/ |
Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
|
LoopInfo.cpp | 144 assert(PI != pred_end(H) && 147 if (PI == pred_end(H)) return nullptr; // dead loop 149 if (PI != pred_end(H)) return nullptr; // multiple backedges? 339 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI)
|
/external/llvm/include/llvm/Analysis/ |
Interval.h | 111 /// pred_begin/pred_end - define methods so that Intervals may be used 117 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm 144 return pred_end(N);
|
/external/clang/lib/Analysis/ |
CFGReachabilityAnalysis.cpp | 71 e = block->pred_end(); i != e; ++i) {
|
ReachableCode.cpp | 387 E = Block->pred_end(); I != E; ++I) { 462 E = Block->pred_end(); I != E; ++I) { 610 if (PI != B->pred_end()) {
|
/external/llvm/lib/IR/ |
BasicBlock.cpp | 215 pred_iterator PI = pred_begin(this), E = pred_end(this); 228 pred_iterator PI = pred_begin(this), E = pred_end(this); 264 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
|
/external/llvm/include/llvm/CodeGen/ |
MachineBasicBlock.h | 272 pred_iterator pred_end() { return Predecessors.end(); } function in class:llvm::MachineBasicBlock 273 const_pred_iterator pred_end() const { return Predecessors.end(); } function in class:llvm::MachineBasicBlock 304 return iterator_range<pred_iterator>(pred_begin(), pred_end()); 307 return iterator_range<const_pred_iterator>(pred_begin(), pred_end()); 751 return N->pred_end(); 765 return N->pred_end();
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ExplodedGraph.h | 208 pred_iterator pred_end() { return Preds.end(); } function in class:clang::ento::ExplodedNode 213 const_pred_iterator pred_end() const { function in class:clang::ento::ExplodedNode 214 return const_cast<ExplodedNode*>(this)->pred_end();
|
/external/llvm/lib/Transforms/Utils/ |
LoopSimplify.cpp | 128 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 167 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { 202 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 324 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { 379 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ 497 PE = pred_end(*BB); PI != PE; ++PI) { 568 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 699 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); 831 PE = pred_end(L->getHeader()); PI != PE; ++PI) [all...] |
BreakCriticalEdges.cpp | 220 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); 309 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E;
|
SSAUpdater.cpp | 114 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 252 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
|
/external/llvm/lib/Support/ |
DAGDeltaAlgorithm.cpp | 86 pred_iterator_ty pred_end(change_ty Node) { function in class:__anon14909::DAGDeltaAlgorithmImpl 209 ie = pred_end(Change); it != ie; ++it) { 338 CurrentSet.insert(pred_begin(*it), pred_end(*it));
|
/external/llvm/lib/Target/PowerPC/ |
PPCLoopPreIncPrep.cpp | 169 std::distance(pred_begin(Header), pred_end(Header)); 297 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 310 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
|
PPCEarlyReturn.cpp | 72 PIE = ReturnMBB.pred_end(); PI != PIE; ++PI) {
|
/external/llvm/lib/Transforms/Scalar/ |
SimplifyCFGPass.cpp | 106 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock);
|
CorrelatedValuePropagation.cpp | 175 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); 221 pred_iterator PB = pred_begin(BB), PE = pred_end(BB);
|
JumpThreading.cpp | 360 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 384 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 541 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ 615 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 635 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 638 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 766 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); [all...] |
TailRecursionElimination.cpp | 738 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); [all...] |
LoopRotation.cpp | 533 SmallVector<BasicBlock *, 4> ExitPreds(pred_begin(Exit), pred_end(Exit)); 580 for (pred_iterator PE = pred_end(BB); PI != PE; ++PI)
|
/external/llvm/lib/CodeGen/ |
MachineSSAUpdater.cpp | 164 E = BB->pred_end(); PI != E; ++PI) { 279 E = BB->pred_end(); PI != E; ++PI)
|
LiveRangeCalc.cpp | 288 PE = MBB->pred_end(); PI != PE; ++PI) { 400 PE = MBB->pred_end(); PI != PE; ++PI) {
|
/external/clang/include/clang/Analysis/ |
CFG.h | 533 pred_iterator pred_end() { return Preds.end(); } function in class:clang::CFGBlock::ElementList 535 const_pred_iterator pred_end() const { return Preds.end(); } function in class:clang::CFGBlock::ElementList 609 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); [all...] |
/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 283 for (pred_iterator PI = pred_begin(Target), PE = pred_end(Target); 303 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) {
|