/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/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
D | CFG.h | 112 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function 113 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function 117 return pred_begin(BB) == pred_end(BB); in pred_empty() 122 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size() 125 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors() 128 return pred_const_range(pred_begin(BB), pred_end(BB)); in predecessors() 328 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 337 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
D | PredIteratorCache.h | 47 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds() 61 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB)); in GetNumPreds()
|
D | CFGDiff.h | 240 {pred_end(N.second), N.first}), in child_begin() 254 make_range<ExistingChildIterator>({pred_end(N.second), N.first}, in child_end() 255 {pred_end(N.second), N.first}), in child_end()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
D | BasicBlock.cpp | 241 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor() 254 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor() 268 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors() 272 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore() 311 std::find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
|
/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/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/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | Interval.h | 115 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function 136 static ChildIteratorType child_end(NodeRef N) { 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-10.0/llvm/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 266 pred_iterator pred_end() { return Predecessors.end(); } 267 const_pred_iterator pred_end() const { return Predecessors.end(); } 298 return make_range(pred_begin(), pred_end()); 301 return make_range(pred_begin(), pred_end()); 903 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); } 915 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
D | LoopSimplify.cpp | 130 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop() 174 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet() 291 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop() 367 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock() 492 PE = pred_end(*BB); PI != PE; ++PI) { in simplifyOneLoop() 672 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop() 892 PE = pred_end(L->getHeader()); PI != PE; ++PI)
|
/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 | 115 assert(PI != pred_end(H) && in getCanonicalInductionVariable() 118 if (PI == pred_end(H)) return nullptr; // dead loop in getCanonicalInductionVariable() 120 if (PI != pred_end(H)) return nullptr; // multiple backedges? in getCanonicalInductionVariable()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | Interval.cpp | 29 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
D | CFG.cpp | 99 assert(find(predecessors(Dest), TI->getParent()) != pred_end(Dest) && in isCriticalEdge() 102 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
|
/external/llvm/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 86 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anon168f7fa00111::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-10.0/llvm/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 85 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anon848d24420111::DAGDeltaAlgorithmImpl 208 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl() 345 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()
|
/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/llvm/lib/CodeGen/ |
D | MachineSSAUpdater.cpp | 163 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock() 278 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
D | MachineSSAUpdater.cpp | 165 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock() 285 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
|