| /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);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 155 PE = pred_end(*BB); PI != PE; ++PI) { in ProcessLoop()
222 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in ProcessLoop()
336 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in ProcessLoop()
367 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
402 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in RewriteLoopExitBlock()
445 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in AddBlockAndPredsToSet()
593 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in SeparateNestedLoop()
645 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in InsertUniqueBackedgeBlock()
750 PE = pred_end(L->getHeader()); PI != PE; ++PI) in verifyAnalysis()
|
| D | BreakCriticalEdges.cpp | 97 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
114 E = pred_end(P); in isCriticalEdge()
262 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
355 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); in SplitCriticalEdge()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 124 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
163 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in rewriteLoopExitBlock()
198 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet()
315 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop()
369 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock()
481 PE = pred_end(*BB); PI != PE; ++PI) { in simplifyOneLoop()
544 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in simplifyOneLoop()
674 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
849 PE = pred_end(L->getHeader()); PI != PE; ++PI)
|
| D | BreakCriticalEdges.cpp | 201 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
290 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; in SplitCriticalEdge()
|
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| D | BasicBlock.cpp | 184 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
197 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
219 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | CFG.h | 84 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function
85 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function
282 return pred_end(N);
296 return pred_end(N);
|
| D | PredIteratorCache.h | 46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 119 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
146 return pred_end(N);
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 227 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
240 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
284 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 239 pred_iterator pred_end() { return Predecessors.end(); }
240 const_pred_iterator pred_end() const { return Predecessors.end(); }
271 return make_range(pred_begin(), pred_end());
274 return make_range(pred_begin(), pred_end());
783 return N->pred_end();
797 return N->pred_end();
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | Interval.h | 120 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
147 return pred_end(N);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 169 pred_iterator pred_end() { return Predecessors.end(); }
170 const_pred_iterator pred_end() const { return Predecessors.end(); }
511 return N->pred_end();
525 return N->pred_end();
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 164 if (pred_begin(BB) == pred_end(BB) && in runOnFunction()
326 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
350 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
505 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
579 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
599 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
602 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
627 if (pred_begin(BB) == pred_end(BB) && in ProcessBlock()
732 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock()
863 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | RegionInfo.cpp | 141 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; in getEnteringBlock()
163 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; in getExitingBlock()
218 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) in verifyBBInRegion()
389 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
407 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
469 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in isCommonDomFrontier()
768 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE; in getMaxRegionExit()
|
| D | ProfileInfo.cpp | 71 const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in getExecutionCount()
514 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in CalculateMissingEdge()
586 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in EstimateMissingEdges()
781 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
871 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
895 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
937 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
967 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
|
| D | LoopInfo.cpp | 137 assert(PI != pred_end(H) && in getCanonicalInductionVariable()
140 if (PI == pred_end(H)) return 0; // dead loop in getCanonicalInductionVariable()
142 if (PI != pred_end(H)) return 0; // multiple backedges? in getCanonicalInductionVariable()
312 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI) in hasDedicatedExits()
|
| D | ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in recurseBasicBlock()
370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in runOnFunction()
404 const_pred_iterator predi = pred_begin(BB), prede = pred_end(BB); in runOnFunction()
|
| D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
| /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/Support/ |
| D | DAGDeltaAlgorithm.cpp | 86 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anon1e7b99d80111::DAGDeltaAlgorithmImpl
209 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
338 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 87 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anone6714d840111::DAGDeltaAlgorithmImpl
215 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
344 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()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCLoopPreIncPrep.cpp | 180 std::distance(pred_begin(Header), pred_end(Header)); in runOnLoop()
345 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
358 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 201 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) in SimplifyFunction()
235 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!"); in DeleteBasicBlock()
|