Home
last modified time | relevance | path

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

12345

/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h113 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function
114 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function
118 return pred_begin(BB) == pred_end(BB); in pred_empty()
123 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size()
126 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
129 return pred_const_range(pred_begin(BB), pred_end(BB)); in predecessors()
333 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
342 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
H A DPredIteratorCache.h48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB)); in GetNumPreds()
H A DCFGDiff.h241 {pred_end(N.second), N.first}), in child_begin()
255 make_range<ExistingChildIterator>({pred_end(N.second), N.first}, in child_end()
256 {pred_end(N.second), N.first}), in child_end()
/freebsd-12.1/contrib/llvm/lib/IR/
H A DBasicBlock.cpp235 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
248 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
262 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors()
266 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
305 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DInterval.h116 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
137 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp123 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
166 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet()
283 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop()
358 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock()
478 PE = pred_end(*BB); PI != PE; ++PI) { in simplifyOneLoop()
648 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
832 PE = pred_end(L->getHeader()); PI != PE; ++PI)
H A DSSAUpdater.cpp128 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in GetValueInMiddleOfBlock()
266 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in FindPredecessorBlocks()
H A DBasicBlockUtils.cpp611 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessors()
618 e = pred_end(OrigBB); in SplitLandingPadPredecessors()
795 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h256 pred_iterator pred_end() { return Predecessors.end(); }
257 const_pred_iterator pred_end() const { return Predecessors.end(); }
288 return make_range(pred_begin(), pred_end());
291 return make_range(pred_begin(), pred_end());
879 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
891 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/freebsd-12.1/contrib/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp86 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anonbc61025e0111::DAGDeltaAlgorithmImpl
209 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
346 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h228 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
233 const_pred_iterator pred_end() const { in pred_end() function
234 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DInterval.cpp30 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
H A DLoopInfo.cpp118 assert(PI != pred_end(H) && "Loop must have at least one backedge!"); in getCanonicalInductionVariable()
120 if (PI == pred_end(H)) in getCanonicalInductionVariable()
123 if (PI != pred_end(H)) in getCanonicalInductionVariable()
H A DCFG.cpp95 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h734 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
736 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
744 return pred_range(pred_begin(), pred_end()); in preds()
748 return pred_const_range(pred_begin(), pred_end()); in preds()
826 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1267 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1279 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp72 e = block->pred_end(); i != e; ++i) { in mapReachability()
H A DReachableCode.cpp429 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()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineSSAUpdater.cpp166 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock()
286 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
H A DTailDuplicator.cpp100 MBB->pred_end()); in VerifyPHIs()
706 TailBB->pred_end()); in duplicateSimpleBB()
816 TailBB->pred_end()); in tailDuplicate()
H A DUnreachableBlockElim.cpp188 BB->pred_end()); in runOnMachineFunction()
/freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLateEHPrepare.cpp82 WL.append(MBB->pred_begin(), MBB->pred_end()); in getMatchingEHPad()
368 TermPad->pred_end()); in mergeTerminatePads()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DTailRecursionElimination.cpp632 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in eliminateRecursiveTailCall()
703 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in foldReturnAndProcessPred()
723 if (!BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB)) in foldReturnAndProcessPred()
/freebsd-12.1/contrib/llvm/lib/Target/PowerPC/
H A DPPCEarlyReturn.cpp71 PIE = ReturnMBB.pred_end(); PI != PIE; ++PI) { in processBlock()
H A DPPCLoopPreIncPrep.cpp438 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
451 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp184 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()

12345