| /external/llvm/include/llvm/IR/ |
| D | CFG.h | 95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function
96 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function
100 return pred_begin(BB) == pred_end(BB); in pred_empty()
103 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
106 return pred_const_range(pred_begin(BB), pred_end(BB)); in predecessors()
196 return pred_end(N);
210 return pred_end(N);
|
| D | PredIteratorCache.h | 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 123 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
162 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in rewriteLoopExitBlock()
197 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet()
314 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop()
368 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock()
480 PE = pred_end(*BB); PI != PE; ++PI) { in simplifyOneLoop()
551 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in simplifyOneLoop()
681 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
817 PE = pred_end(L->getHeader()); PI != PE; ++PI)
|
| D | BreakCriticalEdges.cpp | 218 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
307 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; in SplitCriticalEdge()
|
| D | BasicBlockUtils.cpp | 37 assert((pred_begin(BB) == pred_end(BB) || in DeleteDeadBlock()
583 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessors()
590 e = pred_end(OrigBB); in SplitLandingPadPredecessors()
799 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
|
| D | SSAUpdater.cpp | 114 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in GetValueInMiddleOfBlock()
252 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in FindPredecessorBlocks()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 117 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
144 return pred_end(N);
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 212 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
225 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
269 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 296 pred_iterator pred_end() { return Predecessors.end(); }
297 const_pred_iterator pred_end() const { return Predecessors.end(); }
328 return make_range(pred_begin(), pred_end());
331 return make_range(pred_begin(), pred_end());
838 return N->pred_end();
852 return N->pred_end();
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 208 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
213 const_pred_iterator pred_end() const { in pred_end() function
214 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
|
| /external/llvm/lib/Analysis/ |
| D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
| D | LoopInfo.cpp | 147 assert(PI != pred_end(H) && in getCanonicalInductionVariable()
150 if (PI == pred_end(H)) return nullptr; // dead loop in getCanonicalInductionVariable()
152 if (PI != pred_end(H)) return nullptr; // multiple backedges? in getCanonicalInductionVariable()
366 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI) in hasDedicatedExits()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 86 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anondc8290600111::DAGDeltaAlgorithmImpl
209 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
338 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
|
| /external/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 71 e = block->pred_end(); i != e; ++i) { in mapReachability()
|
| D | ReachableCode.cpp | 387 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
462 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
610 if (PI != B->pred_end()) { in reportDeadCode()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCLoopPreIncPrep.cpp | 177 std::distance(pred_begin(Header), pred_end(Header)); in runOnLoop()
342 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
355 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
|
| D | PPCEarlyReturn.cpp | 72 PIE = ReturnMBB.pred_end(); PI != PIE; ++PI) { in processBlock()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 407 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
431 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
588 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
662 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
682 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
685 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
985 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
1039 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
1075 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
|
| D | TailRecursionElimination.cpp | 744 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in EliminateRecursiveTailCall()
810 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in FoldReturnAndProcessPred()
830 if (!BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB)) in FoldReturnAndProcessPred()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineSSAUpdater.cpp | 164 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock()
279 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
|
| D | LiveRangeCalc.cpp | 295 PE = MBB->pred_end(); PI != PE; ++PI) { in findReachingDefs()
407 PE = MBB->pred_end(); PI != PE; ++PI) { in updateSSA()
|
| D | MachineVerifier.cpp | 490 MInfo.Preds.insert(MBB.pred_begin(), MBB.pred_end()); in visitMachineFunctionBefore()
547 E = MBB->pred_end(); I != E; ++I) { in visitMachineBasicBlockBefore()
1273 PrE = MBB.pred_end(); PrI != PrE; ++PrI) { in calcRegsRequired()
1287 PrE = MBB->pred_end(); PrI != PrE; ++PrI) { in calcRegsRequired()
1320 PrE = MBB->pred_end(); PrI != PrE; ++PrI) { in checkPHIOps()
1669 PE = MFI->pred_end(); PI != PE; ++PI) { in verifyLiveRangeSegment()
1841 E = MBB->pred_end(); I != E; ++I) { in verifyStackFrame()
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 532 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
534 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
608 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1039 { return N->pred_end(); }
1053 { return N->pred_end(); }
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIAnnotateControlFlow.cpp | 291 for (pred_iterator PI = pred_begin(Target), PE = pred_end(Target); in handleLoop()
311 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in closeControlFlow()
|
| /external/v8/src/compiler/ |
| D | liveness-analyzer.h | 125 ZoneDeque<LivenessAnalyzerBlock*>::const_iterator pred_end() { in pred_end() function
|