Home
last modified time | relevance | path

Searched refs:pred_begin (Results 1 – 25 of 126) sorted by relevance

123456

/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h109 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() function
110 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin() 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()
332 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
341 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(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()
/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.h113 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin() function
136 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(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()
477 for (pred_iterator PI = pred_begin(*BB), in simplifyOneLoop()
648 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
831 for (pred_iterator PI = pred_begin(L->getHeader()),
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()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h206 return pred_empty() ? nullptr : *(pred_begin()); in getFirstPred()
227 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
230 const_pred_iterator pred_begin() const { in pred_begin() function
231 return const_cast<ExplodedNode*>(this)->pred_begin(); in pred_begin()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h254 pred_iterator pred_begin() { return Predecessors.begin(); }
255 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
288 return make_range(pred_begin(), pred_end());
291 return make_range(pred_begin(), pred_end());
878 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
890 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/freebsd-12.1/contrib/llvm/lib/Target/PowerPC/
H A DPPCEarlyReturn.cpp70 for (MachineBasicBlock::pred_iterator PI = ReturnMBB.pred_begin(), in processBlock()
159 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin(); 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/lib/Support/
H A DDAGDeltaAlgorithm.cpp82 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin() function in __anonbc61025e0111::DAGDeltaAlgorithmImpl
208 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl()
346 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DInterval.cpp30 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
/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()
231 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath()
H A DUndefBranchChecker.cpp88 ExplodedNode *PrevN = *N->pred_begin(); in checkBranchCondition()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h733 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
735 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() 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()
1266 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
1278 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/freebsd-12.1/contrib/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp44 PredMBB = *MBB->pred_begin(); in getSingleSchedPred()
49 for (auto I = MBB->pred_begin(); I != MBB->pred_end(); ++I) in getSingleSchedPred()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp71 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
H A DReachableCode.cpp428 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
503 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in scanBackwards()
651 CFGBlock::const_pred_iterator PI = B->pred_begin(); in reportDeadCode()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineSSAUpdater.cpp165 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in GetValueInMiddleOfBlock()
285 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in FindPredecessorBlocks()
H A DMachineDominators.cpp128 PredBB = *PredBB->pred_begin(); in applySplitCriticalEdges()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp93 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect()
161 ExplodedNode *pred = *(node->pred_begin()); in collectNode()
/freebsd-12.1/contrib/llvm/lib/Target/AArch64/
H A DAArch64RedundantCopyElimination.cpp156 MachineBasicBlock *PredMBB = *MBB->pred_begin(); in knownRegValInBlock()
287 MachineBasicBlock *PredMBB = *MBB->pred_begin(); in optimizeBlock()
/freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLateEHPrepare.cpp82 WL.append(MBB->pred_begin(), MBB->pred_end()); in getMatchingEHPad()
367 SmallVector<MachineBasicBlock *, 2> Preds(TermPad->pred_begin(), 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/Lanai/
H A DLanaiAsmPrinter.cpp219 const MachineBasicBlock *Pred = *MBB->pred_begin(); in isBlockOnlyReachableByFallthrough()

123456