| /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()
329 return pred_begin(N);
343 return pred_begin(N);
|
| D | PredIteratorCache.h | 46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 128 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
167 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in rewriteLoopExitBlock()
202 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet()
324 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop()
379 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock()
496 for (pred_iterator PI = pred_begin(*BB), in simplifyOneLoop()
568 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in simplifyOneLoop()
699 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
830 for (pred_iterator PI = pred_begin(L->getHeader()),
|
| D | BreakCriticalEdges.cpp | 220 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
309 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; in SplitCriticalEdge()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCEarlyReturn.cpp | 71 for (MachineBasicBlock::pred_iterator PI = ReturnMBB.pred_begin(), in processBlock()
155 (*ReturnMBB.pred_begin())->isLayoutSuccessor(&ReturnMBB)) { in processBlock()
157 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin(); in processBlock()
|
| D | PPCLoopPreIncPrep.cpp | 169 std::distance(pred_begin(Header), pred_end(Header)); in runOnLoop()
297 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
310 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
|
| /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 | 270 pred_iterator pred_begin() { return Predecessors.begin(); }
271 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
304 return iterator_range<pred_iterator>(pred_begin(), pred_end());
307 return iterator_range<const_pred_iterator>(pred_begin(), pred_end());
748 return N->pred_begin();
762 return N->pred_begin();
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 215 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
228 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
264 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 | 89 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 __anon7ef96bbb0111::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 | 143 pred_iterator PI = pred_begin(H); in getCanonicalInductionVariable()
338 for (pred_iterator PI = pred_begin(ExitBlocks[i]), in hasDedicatedExits()
367 pred_iterator PI = pred_begin(*I); in getUniqueExitBlocks()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 360 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
384 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
541 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
615 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
635 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
638 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
766 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock()
929 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
982 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
1019 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
|
| D | CorrelatedValuePropagation.cpp | 175 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); in processCmp()
221 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); in processSwitch()
|
| D | TailRecursionElimination.cpp | 738 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in EliminateRecursiveTailCall()
805 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in FoldReturnAndProcessPred()
825 if (!BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB)) in FoldReturnAndProcessPred()
|
| /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/clang/include/clang/Analysis/ |
| D | CFG.h | 532 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
534 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() function
609 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/R600/ |
| D | SIAnnotateControlFlow.cpp | 283 for (pred_iterator PI = pred_begin(Target), PE = pred_end(Target); in handleLoop()
303 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in closeControlFlow()
|