Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/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); }
/llvm-project-15.0.7/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); }
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DBlock.h224 pred_iterator pred_end() { return pred_iterator(nullptr); } in pred_end() function
226 return {pred_begin(), pred_end()}; in getPredecessors()
230 bool hasNoPredecessors() { return pred_begin() == pred_end(); } in hasNoPredecessors()
H A DRegionGraphTraits.h48 return node->pred_end();
/llvm-project-15.0.7/llvm/lib/IR/
H A DBasicBlock.cpp262 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
270 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
284 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors()
288 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
/llvm-project-15.0.7/mlir/lib/IR/
H A DBlock.cpp253 if (it == pred_end()) in getSinglePredecessor()
257 return it == pred_end() ? firstPred : nullptr; in getSinglePredecessor()
263 auto it = pred_begin(), e = pred_end(); in getUniquePredecessor()
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryBasicBlock.h228 pred_iterator pred_end() { return Predecessors.end(); } in pred_end() function
229 const_pred_iterator pred_end() const { return Predecessors.end(); } in pred_end() function
289 return iterator_range<pred_iterator>(pred_begin(), pred_end()); in predecessors()
293 return iterator_range<const_pred_iterator>(pred_begin(), pred_end()); in predecessors()
1016 static inline ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1028 static inline ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/llvm-project-15.0.7/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp84 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anona2548bc90111::DAGDeltaAlgorithmImpl
204 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
336 CurrentSet.insert(pred_begin(CT), pred_end(CT)); in Run()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h328 pred_iterator pred_end() { return Predecessors.end(); }
329 const_pred_iterator pred_end() const { return Predecessors.end(); }
360 return make_range(pred_begin(), pred_end());
363 return make_range(pred_begin(), pred_end());
1194 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
1206 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/llvm-project-15.0.7/mlir/lib/Dialect/Linalg/Transforms/
H A DDetensorize.cpp220 pred != block->pred_end(); ++pred) { in computeBranchOpDetensoring()
331 pred != ownerBlock->pred_end(); ++pred) { in compute()
416 pred != block->pred_end(); ++pred) { in compute()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp71 e = block->pred_end(); i != e; ++i) { in mapReachability()
H A DReachableCode.cpp429 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
503 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
650 if (PI != B->pred_end()) { in reportDeadCode()
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A DCFG.h939 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
941 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
949 return pred_range(pred_begin(), pred_end()); in preds()
953 return pred_const_range(pred_begin(), pred_end()); in preds()
1031 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(); }
1528 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DLiveness.cpp134 toProcess.insert(block->pred_begin(), block->pred_end()); in buildBlockMapping()
147 toProcess.insert(current->pred_begin(), current->pred_end()); in buildBlockMapping()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUSetWavePriority.cpp113 Worklist.append(MBB->pred_begin(), MBB->pred_end()); in runOnMachineFunction()
/llvm-project-15.0.7/mlir/lib/Analysis/DataFlow/
H A DDenseAnalysis.cpp127 for (Block::pred_iterator it = block->pred_begin(), e = block->pred_end(); in visitBlock()
H A DSparseAnalysis.cpp191 for (Block::pred_iterator it = block->pred_begin(), e = block->pred_end(); in visitBlock()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp154 BB.pred_end()); in runOnMachineFunction()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp183 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFG.cpp109 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
H A DLoopInfo.cpp127 assert(PI != pred_end(H) && "Loop must have at least one backedge!"); in getIncomingAndBackEdge()
129 if (PI == pred_end(H)) in getIncomingAndBackEdge()
132 if (PI != pred_end(H)) in getIncomingAndBackEdge()
/llvm-project-15.0.7/mlir/lib/Transforms/Utils/
H A DRegionUtils.cpp571 for (auto it = block->pred_begin(), e = block->pred_end(); it != e; ++it) { in ableToUpdatePredOperands()
628 for (auto predIt = block->pred_begin(), predE = block->pred_end(); in merge()
/llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp319 edge_iterator pred_end() const { return Preds.end(); } in pred_end() function in __anonbfeb721b0111::BBState
1488 PE(MyStates.pred_end()); PI != PE; ++PI) { in VisitBottomUp()
1629 PE(MyStates.pred_end()); in VisitTopDown()
1647 if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin())) in VisitTopDown()
1745 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/Orc/
H A DSpeculateAnalyses.cpp168 const_pred_iterator PIt = pred_begin(AtBB), EIt = pred_end(AtBB); in traverseToEntryBlock()

123