/freebsd/contrib/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(BB)); in succ_size() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 102 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anoncf29fe990111::DAGDeltaAlgorithmImpl 128 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest() 193 if (succ_begin(Change) == succ_end(Change)) in DAGDeltaAlgorithmImpl() 230 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl() 232 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
|
/freebsd/contrib/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() 338 Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest)); in FunctionPropertiesUpdater() 411 Reinclude.insert(succ_begin(BB), succ_end(BB)); in finish()
|
H A D | BlockFrequencyInfo.cpp | 112 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
|
/freebsd/contrib/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();
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 420 succ_iterator succ_end() { return Successors.end(); } 421 const_succ_iterator succ_end() const { return Successors.end(); } 442 return make_range(succ_begin(), succ_end()); 445 return make_range(succ_begin(), succ_end()); 523 BlockEnd(MBB.succ_end()) { 1297 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } 1306 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
|
/freebsd/contrib/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
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | MergedLoadStoreMotion.cpp | 306 assert(SI != succ_end(HeadBB) && "Diamond head cannot have zero successors"); in mergeStores() 309 assert(SI != succ_end(HeadBB) && "Diamond head cannot have single successor"); in mergeStores()
|
/freebsd/contrib/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(); }
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
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 | 174 MBB->succ_end()); in tailDuplicateAndUpdate() 743 TailBB->succ_end()); in duplicateSimpleBB() 1084 MBB->removeSuccessor(MBB->succ_end() - 1); in removeDeadBlock()
|
H A D | BranchFolding.cpp | 163 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock() 1181 for (auto SuccI = TailMBB.succ_begin(), SuccE = TailMBB.succ_end(); in setCommonTailEdgeWeights() 1197 for (auto SuccI = TailMBB.succ_begin(), SuccE = TailMBB.succ_end(); in setCommonTailEdgeWeights() 1380 for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; ++SI) in OptimizeBlock() 1649 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()
|
H A D | MachineBasicBlock.cpp | 396 for (auto I = succ_begin(), E = succ_end(); I != E; ++I) { in print() 407 for (auto I = succ_begin(), E = succ_end(); I != E; ++I) { in print() 819 assert(OldI != succ_end() && "Old is not a successor of this block!"); in splitSuccessor() 862 succ_iterator E = succ_end(); in replaceSuccessor()
|
H A D | ShrinkWrap.cpp | 415 MBB.succ_end()); in markAllReachable() 421 Worklist.append(SuccMBB->succ_begin(), SuccMBB->succ_end()); in markAllReachable()
|
H A D | MachineSSAUpdater.cpp | 271 static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return BB->succ_end(); } in BlkSucc_end()
|
H A D | WasmEHPrepare.cpp | 181 WL.append(succ_begin(BB), succ_end(BB)); in eraseDeadBBsAndChildren()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonCopyHoisting.cpp | 252 for (auto I = ++(DestBB->succ_begin()), E = DestBB->succ_end(); I != E; ++I) { in moveCopyInstr()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyLateEHPrepare.cpp | 104 WL.append(MBB->succ_begin(), MBB->succ_end()); in eraseDeadBBsAndChildren()
|
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | SpeculateAnalyses.cpp | 210 const_succ_iterator PIt = succ_begin(AtBB), EIt = succ_end(AtBB); in traverseToExitBlock()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 612 SE = Pred->succ_end(); in getUninitUse() 636 E = Block->succ_end(); I != E; ++I) { in getUninitUse()
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 488 const_succ_iterator SI = succ_begin(this), E = succ_end(this); in getSingleSuccessor() 496 const_succ_iterator SI = succ_begin(this), E = succ_end(this); in getUniqueSuccessor()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUInsertDelayAlu.cpp | 444 WorkList.insert(MBB.succ_begin(), MBB.succ_end()); in runOnMachineFunction()
|