/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
H A D | CFG.h | 115 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function 116 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function 120 return pred_begin(BB) == pred_end(BB); in pred_empty() 125 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size() 128 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors() 131 return const_pred_range(pred_begin(BB), pred_end(BB)); in predecessors() 331 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 340 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 112 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function 133 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 123 for (pred_iterator PI = pred_begin(&BB), E = pred_end(&BB); in mergeEmptyReturnBlocks() 146 SmallPtrSet<BasicBlock *, 2> PredsOfBB(pred_begin(&BB), pred_end(&BB)); in mergeEmptyReturnBlocks() 148 pred_end(RetBlock)); in mergeEmptyReturnBlocks() 167 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); in mergeEmptyReturnBlocks()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 265 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor() 273 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor() 287 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors() 291 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 318 pred_iterator pred_end() { return Predecessors.end(); } 319 const_pred_iterator pred_end() const { return Predecessors.end(); } 350 return make_range(pred_begin(), pred_end()); 353 return make_range(pred_begin(), pred_end()); 1166 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); } 1178 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 85 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anon1494bb440111::DAGDeltaAlgorithmImpl 208 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl() 345 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
|
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 240 pred_iterator pred_end() { return Preds.end(); } in pred_end() function 246 const_pred_iterator pred_end() const { in pred_end() function 247 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/ |
H A D | CFGReachabilityAnalysis.cpp | 71 e = block->pred_end(); i != e; ++i) { in mapReachability()
|
H A D | ReachableCode.cpp | 430 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot() 504 E = Block->pred_end(); I != E; ++I) { in scanBackwards() 652 if (PI != B->pred_end()) { in reportDeadCode()
|
H A D | UninitializedValues.cpp | 571 for (CFGBlock::const_pred_iterator I = B->pred_begin(), E = B->pred_end(); in getUninitUse() 844 E = block->pred_end(); I != E; ++I) { in runOnBlock()
|
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/ |
H A D | CFG.h | 938 pred_iterator pred_end() { return Preds.end(); } in pred_end() function 940 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function 948 return pred_range(pred_begin(), pred_end()); in preds() 952 return pred_const_range(pred_begin(), pred_end()); in preds() 1030 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end() 1516 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); } 1531 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
H A D | PPCEarlyReturn.cpp | 66 PIE = ReturnMBB.pred_end(); PI != PIE; ++PI) { in processBlock()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 161 BB->pred_end()); in runOnMachineFunction()
|
H A D | TailDuplicator.cpp | 106 MBB->pred_end()); in VerifyPHIs() 845 Preds.insert(TailBB->pred_begin(), TailBB->pred_end()); in tailDuplicate()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 131 assert(PI != pred_end(H) && "Loop must have at least one backedge!"); in getIncomingAndBackEdge() 133 if (PI == pred_end(H)) in getIncomingAndBackEdge() 136 if (PI != pred_end(H)) in getIncomingAndBackEdge()
|
H A D | CFG.cpp | 109 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
|
H A D | BlockFrequencyInfoImpl.cpp | 713 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders() 740 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
H A D | UnreachableCodeChecker.cpp | 183 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
H A D | SystemZMachineScheduler.cpp | 49 for (auto I = MBB->pred_begin(); I != MBB->pred_end(); ++I) in getSingleSchedPred()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 319 edge_iterator pred_end() const { return Preds.end(); } in pred_end() function in __anon5b8b86760111::BBState 1487 PE(MyStates.pred_end()); PI != PE; ++PI) { in VisitBottomUp() 1579 PE(MyStates.pred_end()); in VisitTopDown() 1597 if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin())) in VisitTopDown() 1694 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/ |
H A D | SpeculateAnalyses.cpp | 168 const_pred_iterator PIt = pred_begin(AtBB), EIt = pred_end(AtBB); in traverseToEntryBlock()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | HexagonHardwareLoops.cpp | 570 assert(PI != TopMBB->pred_end() && in getLoopTripCount() 573 if (PI == TopMBB->pred_end()) // dead loop? in getLoopTripCount() 576 if (PI != TopMBB->pred_end()) // multiple backedges? in getLoopTripCount() 1874 MBBVector Preds(Header->pred_begin(), Header->pred_end()); in createPreheaderForLoop()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 853 pred_end(New)); in splitBlockBefore() 1203 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl() 1210 e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl() 1471 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
|
H A D | FlattenCFG.cpp | 147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | SIModeRegister.cpp | 343 MachineBasicBlock::pred_iterator P = MBB.pred_begin(), E = MBB.pred_end(); in processBlockPhase2()
|