| /llvm-project/llvm/include/llvm/IR/ |
| H A D | CFG.h | 251 inline succ_iterator succ_end(Instruction *I) { return succ_iterator(I, true); } in succ_end() function
252 inline const_succ_iterator succ_end(const Instruction *I) { in succ_end() function
256 return succ_begin(I) == succ_end(I); in succ_empty()
259 return std::distance(succ_begin(I), succ_end(I)); in succ_size()
262 return succ_range(succ_begin(I), succ_end(I)); in successors()
265 return const_succ_range(succ_begin(I), succ_end(I)); in successors()
274 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function
277 inline const_succ_iterator succ_end(const BasicBlock *BB) { in succ_end() function
281 return succ_begin(BB) == succ_end(BB); in succ_empty()
284 return std::distance(succ_begin(BB), succ_end(B in succ_size()
[all...] |
| /llvm-project/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 101 succ_iterator_ty succ_end(change_ty Node) { in succ_begin()
127 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
192 if (succ_begin(Change) == succ_end(Change)) in DAGDeltaAlgorithmImpl()
229 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl()
231 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
102 succ_iterator_ty succ_end(change_ty Node) { succ_end() function in __anon5dbb262c0111::DAGDeltaAlgorithmImpl
|
| /llvm-project/bolt/lib/Core/ |
| H A D | BinaryBasicBlock.cpp | 272 for (; I != succ_end(); ++I) { in replaceSuccessor()
278 assert(I != succ_end() && "no such successor!"); in replaceSuccessor()
286 SmallPtrSet<BinaryBasicBlock *, 2> UniqSuccessors(succ_begin(), succ_end()); in removeAllSuccessors()
297 for (; I != succ_end(); ++I) { in removeSuccessor()
303 assert(I != succ_end() && "no such successor!"); in removeSuccessor()
530 for (auto itr = succ_begin(); itr != succ_end(); ++itr) { in dump()
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 53 while (I != succ_end(ParentBB)) { in FindFunctionBackedges()
215 Worklist.append(succ_begin(BB), succ_end(BB)); in isReachableImpl()
312 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
| H A D | FunctionPropertiesAnalysis.cpp | 327 Successors.insert(succ_begin(&CallSiteBB), succ_end(&CallSiteBB)); in FunctionPropertiesUpdater()
352 Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest)); in FunctionPropertiesUpdater()
457 Reinclude.insert(succ_begin(BB), succ_end(BB));
|
| /llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 251 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
257 const_succ_iterator succ_end() const { in succ_end() function
258 return const_cast<ExplodedNode*>(this)->succ_end(); in succ_end()
528 return N->succ_end();
|
| /llvm-project/mlir/include/mlir/IR/ |
| H A D | RegionGraphTraits.h | 33 static ChildIteratorType child_end(NodeRef node) { return node->succ_end(); }
64 return const_cast<mlir::Block *>(node)->succ_end();
|
| H A D | Block.h | 245 bool hasNoSuccessors() { return succ_begin() == succ_end(); }
266 succ_iterator succ_end() { return getSuccessors().end(); }
264 succ_iterator succ_end() { return getSuccessors().end(); } succ_end() function
|
| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 423 succ_iterator succ_end() { return Successors.end(); }
424 const_succ_iterator succ_end() const { return Successors.end(); }
445 return make_range(succ_begin(), succ_end());
448 return make_range(succ_begin(), succ_end());
526 BlockEnd(MBB.succ_end()) {
1301 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
1318 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
1384 inline auto succ_end(const MachineBasicBlock *BB) { return BB->succ_end(); }
|
| /llvm-project/bolt/include/bolt/Core/ |
| H A D | BinaryBasicBlock.h | 239 succ_iterator succ_end() { return Successors.end(); } in succ_end() function
240 const_succ_iterator succ_end() const { return Successors.end(); } in succ_rbegin()
291 return iterator_range<succ_iterator>(succ_begin(), succ_end()); in successors()
295 return iterator_range<const_succ_iterator>(succ_begin(), succ_end()); in successors()
981 static inline ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
992 static inline ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
238 succ_iterator succ_end() { return Successors.end(); } succ_end() function
|
| /llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopIterator.h | 79 {succ_end(Node.second), Node.first}), in child_begin()
87 {succ_end(Node.second), Node.first}), in child_end()
|
| H A D | RegionIterator.h | 235 while (Itor != succ_end(Node->getEntry())
254 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_end(NodeRef Node) { in succ_end() function
|
| /llvm-project/bolt/lib/Passes/ |
| H A D | TailDuplication.cpp | 129 for (auto Itr = StartBB.succ_begin(); Itr != StartBB.succ_end(); ++Itr) { in isOverwrittenBeforeUsed()
154 for (auto Itr = CurrBB->succ_begin(); Itr != CurrBB->succ_end(); ++Itr) { in isOverwrittenBeforeUsed()
286 for (auto Itr = Tail.succ_begin(); Itr != Tail.succ_end(); ++Itr) { in moderateDuplicate()
560 LastOriginalBB->succ_begin(), LastOriginalBB->succ_end(), in duplicateBlocks()
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | GCEmptyBasicBlocks.cpp | 82 MBB->removeSuccessor(MBB->succ_end() - 1); in runOnMachineFunction()
|
| H A D | BasicBlockPathCloning.cpp | 72 for (auto SI = OrigBB.succ_begin(), SE = OrigBB.succ_end(); SI != SE; ++SI) in CloneMachineBasicBlock()
|
| H A D | TailDuplicator.cpp | 173 MBB->succ_end()); in tailDuplicateAndUpdate()
747 TailBB->succ_end()); in duplicateSimpleBB()
1088 MBB->removeSuccessor(MBB->succ_end() - 1); in removeDeadBlock()
|
| H A D | BranchFolding.cpp | 163 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
1180 for (auto SuccI = TailMBB.succ_begin(), SuccE = TailMBB.succ_end(); in setCommonTailEdgeWeights()
1196 for (auto SuccI = TailMBB.succ_begin(), SuccE = TailMBB.succ_end(); in setCommonTailEdgeWeights()
1370 for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; ++SI) in OptimizeBlock()
1639 for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; in OptimizeBlock()
|
| H A D | MachineBlockFrequencyInfo.cpp | 103 static ChildIteratorType child_end(const NodeRef N) { return N->succ_end(); } in child_end()
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | MergedLoadStoreMotion.cpp | 308 assert(SI != succ_end(HeadBB) && "Diamond head cannot have zero successors"); in mergeStores()
311 assert(SI != succ_end(HeadBB) && "Diamond head cannot have single successor"); in mergeStores()
|
| /llvm-project/clang/include/clang/Analysis/ |
| H A D | CFG.h | 985 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
987 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end() function
995 return succ_range(succ_begin(), succ_end()); in succs()
999 return succ_const_range(succ_begin(), succ_end()); in succs()
1065 return filtered_succ_iterator(succ_begin(), succ_end(), this, f); in filtered_succ_start_end()
1487 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
1496 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
|
| /llvm-project/bolt/lib/Rewrite/ |
| H A D | BoltDiff.cpp | 377 while (SuccIter1 != (*Iter1)->succ_end()) { in matchBasicBlocks()
378 if (SuccIter2 == (*Iter2)->succ_end()) { in matchBasicBlocks()
395 if (SuccIter2 != (*Iter2)->succ_end()) in matchBasicBlocks()
|
| /llvm-project/bolt/include/bolt/Passes/ |
| H A D | DominatorAnalysis.h | 59 BB.succ_begin() == BB.succ_end()) in getDominanceFrontierFor()
|
| /llvm-project/llvm/unittests/Target/X86/ |
| H A D | MachineSizeOptsTest.cpp | 115 ASSERT_TRUE(iter == BB0.succ_end()); in TEST_F()
|
| /llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCopyHoisting.cpp | |
| /llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyLateEHPrepare.cpp | 105 WL.append(MBB->succ_begin(), MBB->succ_end()); in eraseDeadBBsAndChildren()
|