Home
last modified time | relevance | path

Searched refs:pred_end (Results 1 – 25 of 46) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h115 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()
341 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
355 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h429 pred_iterator pred_end() { return Predecessors.end(); }
430 const_pred_iterator pred_end() const { return Predecessors.end(); }
461 return make_range(pred_begin(), pred_end());
464 return make_range(pred_begin(), pred_end());
1389 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1409 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1430 inline auto pred_end(const MachineBasicBlock *BB) { return BB->pred_end(); }
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp83 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anoncf29fe990111::DAGDeltaAlgorithmImpl
203 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
336 CurrentSet.insert(pred_begin(CT), pred_end(CT)); in Run()
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h239 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
245 const_pred_iterator pred_end() const { in pred_end() function
246 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp70 e = block->pred_end(); i != e; ++i) { in mapReachability()
H A DReachableCode.cpp437 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
554 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
706 if (PI != B->pred_end()) { in reportDeadCode()
H A DUninitializedValues.cpp579 for (CFGBlock::const_pred_iterator I = B->pred_begin(), E = B->pred_end(); in getUninitUse()
855 E = block->pred_end(); I != E; ++I) { in runOnBlock()
H A DConsumed.cpp1003 PE = TargetBlock->pred_end(); PI != PE; ++PI) { in allBackEdgesVisited()
1075 PE = Block->pred_end(); PI != PE; ++PI) { in isBackEdgeTarget()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h973 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
975 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
983 return pred_range(pred_begin(), pred_end()); in preds()
987 return pred_const_range(pred_begin(), pred_end()); in preds()
1067 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1515 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1527 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DBasicBlock.cpp438 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
446 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
460 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors()
464 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopInfo.cpp132 assert(PI != pred_end(H) && "Loop must have at least one backedge!"); in getIncomingAndBackEdge()
134 if (PI == pred_end(H)) in getIncomingAndBackEdge()
137 if (PI != pred_end(H)) in getIncomingAndBackEdge()
H A DCFG.cpp110 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
H A DBlockFrequencyInfoImpl.cpp703 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
730 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp315 edge_iterator pred_end() const { return Preds.end(); } in pred_end() function in __anon0b2926eb0111::BBState
1449 PE(MyStates.pred_end()); PI != PE; ++PI) { in VisitBottomUp()
1590 PE(MyStates.pred_end()); in VisitTopDown()
1608 if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin())) in VisitTopDown()
1706 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DSpeculateAnalyses.cpp165 const_pred_iterator PIt = pred_begin(AtBB), EIt = pred_end(AtBB); in traverseToEntryBlock()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp566 assert(PI != TopMBB->pred_end() && in getLoopTripCount()
569 if (PI == TopMBB->pred_end()) // dead loop? in getLoopTripCount()
572 if (PI != TopMBB->pred_end()) // multiple backedges? in getLoopTripCount()
1895 MBBVector Preds(Header->pred_begin(), Header->pred_end()); in createPreheaderForLoop()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveVariables.cpp711 LiveToEndBlocks.append(UseBB.pred_begin(), UseBB.pred_end()); in recomputeForSingleDefVirtReg()
734 LiveToEndBlocks.append(BB.pred_begin(), BB.pred_end()); in recomputeForSingleDefVirtReg()
H A DShrinkWrap.cpp454 Worklist.append(CleanBB->pred_begin(), CleanBB->pred_end()); in isSaveReachableThroughClean()
H A DTailDuplicator.cpp113 MBB.pred_end()); in VerifyPHIs()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIModeRegister.cpp374 MachineBasicBlock::pred_iterator P = MBB.pred_begin(), E = MBB.pred_end(); in processBlockPhase2()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp1333 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl()
1340 e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl()
1675 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h188 SE = CurrBlock->pred_end(); in walk()
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DTypeErasedDataflowAnalysis.cpp234 std::vector<const CFGBlock *> Preds(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DTailRecursionElimination.cpp584 pred_iterator PB = pred_begin(HeaderBB), PE = pred_end(HeaderBB); in insertAccumulator()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86FlagsCopyLowering.cpp499 std::accumulate(std::next(TestMBB->pred_begin()), TestMBB->pred_end(), in runOnMachineFunction()

12