Home
last modified time | relevance | path

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

123

/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DCFG.h114 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function
115 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function
119 return pred_begin(BB) == pred_end(BB); in pred_empty()
124 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size()
127 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
130 return const_pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
330 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
339 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DInterval.h112 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
133 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/openbsd/gnu/llvm/llvm/lib/IR/
H A DBasicBlock.cpp285 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
293 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
307 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors()
311 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
/openbsd/gnu/llvm/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp84 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anonb38266460111::DAGDeltaAlgorithmImpl
204 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
336 CurrentSet.insert(pred_begin(CT), pred_end(CT)); in Run()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h359 pred_iterator pred_end() { return Predecessors.end(); }
360 const_pred_iterator pred_end() const { return Predecessors.end(); }
391 return make_range(pred_begin(), pred_end());
394 return make_range(pred_begin(), pred_end());
1249 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1261 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/openbsd/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h238 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
244 const_pred_iterator pred_end() const { in pred_end() function
245 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
/openbsd/gnu/llvm/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp71 e = block->pred_end(); i != e; ++i) { in mapReachability()
H A DReachableCode.cpp436 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
510 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
657 if (PI != B->pred_end()) { in reportDeadCode()
H A DUninitializedValues.cpp568 for (CFGBlock::const_pred_iterator I = B->pred_begin(), E = B->pred_end(); in getUninitUse()
849 E = block->pred_end(); I != E; ++I) { in runOnBlock()
/openbsd/gnu/llvm/clang/include/clang/Analysis/
H A DCFG.h938 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()
1517 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1529 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp154 BB.pred_end()); in runOnMachineFunction()
H A DLiveVariables.cpp708 LiveToEndBlocks.append(UseBB.pred_begin(), UseBB.pred_end()); in recomputeForSingleDefVirtReg()
723 LiveToEndBlocks.append(BB.pred_begin(), BB.pred_end()); in recomputeForSingleDefVirtReg()
H A DTailDuplicator.cpp103 MBB.pred_end()); in VerifyPHIs()
849 Preds.insert(TailBB->pred_begin(), TailBB->pred_end()); in tailDuplicate()
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp184 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DCFG.cpp109 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
H A DLoopInfo.cpp131 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 DBlockFrequencyInfoImpl.cpp726 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
753 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
/openbsd/gnu/llvm/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp316 edge_iterator pred_end() const { return Preds.end(); } in pred_end() function in __anon3d6662b80111::BBState
1445 PE(MyStates.pred_end()); PI != PE; ++PI) { in VisitBottomUp()
1586 PE(MyStates.pred_end()); in VisitTopDown()
1604 if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin())) in VisitTopDown()
1702 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
/openbsd/gnu/llvm/llvm/lib/ExecutionEngine/Orc/
H A DSpeculateAnalyses.cpp168 const_pred_iterator PIt = pred_begin(AtBB), EIt = pred_end(AtBB); in traverseToEntryBlock()
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr()
H A DBasicBlockUtils.cpp1327 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl()
1334 e = pred_end(OrigBB); in SplitLandingPadPredecessorsImpl()
1614 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp573 assert(PI != TopMBB->pred_end() && in getLoopTripCount()
576 if (PI == TopMBB->pred_end()) // dead loop? in getLoopTripCount()
579 if (PI != TopMBB->pred_end()) // multiple backedges? in getLoopTripCount()
1862 MBBVector Preds(Header->pred_begin(), Header->pred_end()); in createPreheaderForLoop()
/openbsd/gnu/llvm/clang/lib/Analysis/FlowSensitive/
H A DTypeErasedDataflowAnalysis.cpp216 Preds.insert(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIModeRegister.cpp380 MachineBasicBlock::pred_iterator P = MBB.pred_begin(), E = MBB.pred_end(); in processBlockPhase2()
/openbsd/gnu/llvm/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h187 SE = CurrBlock->pred_end(); in walk()

123