| /external/llvm/include/llvm/IR/ |
| D | CFG.h | 91 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() function
92 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin() 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()
193 return pred_begin(N);
207 return pred_begin(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()
479 for (pred_iterator PI = pred_begin(*BB), 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()
816 for (pred_iterator PI = pred_begin(L->getHeader()),
|
| 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()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 114 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin() function
141 return pred_begin(N);
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 190 return pred_empty() ? nullptr : *(pred_begin()); in getFirstPred()
207 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
210 const_pred_iterator pred_begin() const { in pred_begin() function
211 return const_cast<ExplodedNode*>(this)->pred_begin(); in pred_begin()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 294 pred_iterator pred_begin() { return Predecessors.begin(); }
295 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
328 return make_range(pred_begin(), pred_end());
331 return make_range(pred_begin(), pred_end());
835 return N->pred_begin();
849 return N->pred_begin();
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCEarlyReturn.cpp | 71 for (MachineBasicBlock::pred_iterator PI = ReturnMBB.pred_begin(), in processBlock()
160 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin(); in processBlock()
|
| 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()
|
| /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/clang/lib/StaticAnalyzer/Checkers/ |
| D | UnreachableCodeChecker.cpp | 179 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
224 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath()
|
| D | UndefBranchChecker.cpp | 87 ExplodedNode *PrevN = *N->pred_begin(); in checkBranchCondition()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 82 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin() function in __anon048303070111::DAGDeltaAlgorithmImpl
208 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl()
338 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
|
| /external/llvm/lib/Analysis/ |
| D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
| D | LoopInfo.cpp | 146 pred_iterator PI = pred_begin(H); in getCanonicalInductionVariable()
365 for (pred_iterator PI = pred_begin(ExitBlocks[i]), in hasDedicatedExits()
394 pred_iterator PI = pred_begin(*I); in getUniqueExitBlocks()
|
| /external/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 70 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
|
| D | ReachableCode.cpp | 386 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
461 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in scanBackwards()
609 CFGBlock::const_pred_iterator PI = B->pred_begin(); in reportDeadCode()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 102 PredBB = *PredBB->pred_begin(); in applySplitCriticalEdges()
|
| D | MachineSSAUpdater.cpp | 163 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in GetValueInMiddleOfBlock()
278 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in FindPredecessorBlocks()
|
| /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/clang/include/clang/Analysis/ |
| D | CFG.h | 531 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
533 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() function
608 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1036 { return N->pred_begin(); }
1050 { return N->pred_begin(); }
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | ExplodedGraph.cpp | 102 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect()
170 ExplodedNode *pred = *(node->pred_begin()); in collectNode()
|
| /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 | 122 ZoneDeque<LivenessAnalyzerBlock*>::const_iterator pred_begin() { in pred_begin() function
|