| /openbsd/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | IndirectBrExpandPass.cpp | 115 for (BasicBlock *SuccBB : IBr->successors()) in runOnFunction()
176 for (BasicBlock *SuccBB : IBr->successors()) in runOnFunction()
218 for (BasicBlock *SuccBB : IBr->successors()) in runOnFunction()
242 for (BasicBlock *SuccBB : IBr->successors()) in runOnFunction()
|
| H A D | EdgeBundles.cpp | 49 for (const MachineBasicBlock *Succ : MBB.successors()) in runOnMachineFunction()
88 for (const MachineBasicBlock *Succ : MBB.successors()) in WriteGraph()
|
| H A D | ShrinkWrap.cpp | 368 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT); in updateSaveRestorePoints()
435 IPdom = FindIDom<>(*IPdom, LoopExitBB->successors(), *MPDT); in updateSaveRestorePoints()
568 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT); in runOnMachineFunction()
|
| H A D | MachineBlockPlacement.cpp | 677 for (MachineBasicBlock *Succ : MBB->successors()) { in markBlockSuccessors()
724 for (MachineBasicBlock *Succ : BB->successors()) { in collectViableSuccessors()
772 for (MachineBasicBlock *Succ : BB.successors()) in hasSameSuccessors()
1299 for (MachineBasicBlock *Succ : BB.successors()) { in precomputeTriangleChains()
1940 for (MachineBasicBlock *Succ : Pred->successors()) { in TopFallThroughFreq()
2214 for (MachineBasicBlock *Succ : MBB->successors()) { in findBestLoopExit()
2308 for (MachineBasicBlock *Succ : Pred->successors()) { in hasViableTopFallthrough()
2468 for (auto *Succ : BB->successors()) { in rotateLoopWithProfile()
3180 for (MachineBasicBlock *Succ : Pred->successors()) in isBestSuccessor()
3521 for (MachineBasicBlock *Succ : MBB.successors()) { in applyExtTsp()
[all …]
|
| H A D | MachineBranchProbabilityInfo.cpp | 60 return getEdgeProbability(Src, find(Src->successors(), Dst)); in getEdgeProbability()
|
| H A D | ReturnProtectorLowering.cpp | 47 for (auto &SuccMBB : MBB.successors()) in markUsedRegsInSuccessors()
265 for (auto &SuccMBB : RB->successors()) in determineReturnProtectorRegister()
|
| H A D | LoopTraversal.cpp | 45 for (MachineBasicBlock *Succ : ActiveMBB->successors()) { in traverse()
|
| /openbsd/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachineSSAContext.h | 29 inline auto successors(const MachineBasicBlock *BB) { return BB->successors(); } in successors() function
|
| /openbsd/gnu/gcc/gcc/ |
| H A D | ddg.h | 46 #define NODE_SUCCESSORS(x) ((x)->successors)
72 sbitmap successors; member
|
| H A D | ddg.c | 421 if (! TEST_BIT (dest_node->successors, j)) in build_intra_loop_deps()
499 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
500 sbitmap_zero (g->nodes[i].successors); in create_ddg()
538 sbitmap_free (g->nodes[i].successors); in free_ddg()
650 gcc_assert (src->successors && dest->predecessors); in add_edge_to_ddg()
652 SET_BIT (src->successors, dest->cuid); in add_edge_to_ddg()
|
| /openbsd/gnu/llvm/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 144 for (auto *Succ : MBB->successors()) { in calculate()
404 for (auto *Entry : Pred->successors()) { in makeSingleEntryLoop()
420 for (auto *Entry : Pred->successors()) in makeSingleEntryLoop()
433 for (auto *Entry : Pred->successors()) { in makeSingleEntryLoop()
469 for (auto *Succ : Pred->successors()) { in makeSingleEntryLoop()
|
| H A D | WebAssemblyLateEHPrepare.cpp | 103 SmallVector<MachineBasicBlock *, 4> Succs(MBB->successors()); in eraseDeadBBsAndChildren()
278 SmallVector<MachineBasicBlock *, 8> Succs(MBB.successors()); in removeUnnecessaryUnreachables()
|
| /openbsd/gnu/llvm/llvm/lib/Analysis/ |
| H A D | SyncDependenceAnalysis.cpp | 193 for (const auto *SuccBB : successors(NextBB)) { in computeStackPO()
232 for (const auto *BB : successors(LoopHeader)) { in computeLoopPO()
362 for (const auto *SuccBlock : successors(&DivTermBlock)) { in computeJoinPoints()
413 for (const auto *SuccBlock : successors(Block)) { in computeJoinPoints()
|
| H A D | BranchProbabilityInfo.cpp | 264 for (const auto *Succ : successors(BB)) in getSccExitBlocks()
296 if (llvm::any_of(successors(BB), [&](const BasicBlock *Succ) { in calculateSccBlockType()
620 if (!CmpLHSConst || !llvm::is_contained(successors(BB), B)) in computeUnlikelySuccessors()
864 auto MaxWeight = getMaxEstimatedEdgeWeight(LoopBB, successors(BB)); in computeEestimateBlockWeight()
892 for (const BasicBlock *SuccBB : successors(BB)) { in calcEstimatedHeuristics()
1078 for (const BasicBlock *Succ : successors(&BI)) in print()
1121 return BranchProbability(llvm::count(successors(Src), Dst), succ_size(Src)); in getEdgeProbability()
|
| /openbsd/gnu/llvm/llvm/include/llvm/IR/ |
| H A D | CFG.h | 261 inline succ_range successors(Instruction *I) { in successors() function
264 inline const_succ_range successors(const Instruction *I) { in successors() function
286 inline succ_range successors(BasicBlock *BB) { in successors() function
289 inline const_succ_range successors(const BasicBlock *BB) { in successors() function
|
| /openbsd/gnu/llvm/clang/utils/analyzer/ |
| H A D | exploded-graph-rewriter.py | 340 self.successors = []
391 self.nodes[pred].successors.append(succ)
867 and len(node.successors) > 0:
933 for succ in sorted(graph.nodes[node].successors):
954 if len(node.successors) > 0:
955 succ_id = node.successors[0]
957 node.successors = [succ_id]
1007 node.successors = [succ_id for succ_id in node.successors
|
| /openbsd/gnu/llvm/llvm/examples/IRTransforms/ |
| H A D | SimplifyCFG.cpp | 75 for (BasicBlock *Succ : successors(&BB)) in removeDeadBlocks_v1()
116 for (BasicBlock *Succ : successors(&BB)) { in removeDeadBlocks_v2()
323 for (BasicBlock *Succ : successors(&BB)) { in mergeIntoSinglePredecessor_v2()
|
| /openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUSetWavePriority.cpp | 89 for (const MachineBasicBlock *Succ : Pred->successors()) { in CanLowerPriorityDirectlyInPredecessors()
150 for (const MachineBasicBlock *Succ : MBB->successors()) { in runOnMachineFunction()
|
| /openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | ADCE.cpp | 286 for (auto *Succ : successors(BB)) in initialize()
399 for (auto *BB : successors(I->getParent())) in markLive()
605 for (auto *Succ : successors(BB)) { in updateDeadRegions()
616 for (auto *Succ : successors(BB)) { in updateDeadRegions()
|
| H A D | LoopSimplifyCFG.cpp | 194 for (auto *Succ : successors(BB)) in hasIrreducibleCFG()
244 for (BasicBlock *Succ : successors(BB)) in analyze()
296 return any_of(successors(BB), [&](BasicBlock *Succ) { in analyze()
495 for (auto *Succ : successors(BB)) in foldTerminators()
|
| /openbsd/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1357 ArrayRef<BasicBlock *> successors();
1359 ArrayRef<BasicBlock *> successors() const { in successors() function
1360 return const_cast<Terminator*>(this)->successors(); in successors()
1385 ArrayRef<BasicBlock *> successors() { return TargetBlock; } in successors() function
1464 ArrayRef<BasicBlock *> successors() { return std::nullopt; } in successors() function
1484 inline ArrayRef<BasicBlock*> Terminator::successors() { in successors() function
1486 case COP_Goto: return cast<Goto>(this)->successors(); in successors()
1487 case COP_Branch: return cast<Branch>(this)->successors(); in successors()
1488 case COP_Return: return cast<Return>(this)->successors(); in successors()
1564 ArrayRef<BasicBlock*> successors() { return TermInstr->successors(); } in successors() function
[all …]
|
| /openbsd/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | X86VZeroUpper.cpp | 274 for (MachineBasicBlock *Succ : MBB.successors()) in processBasicBlock()
347 for (MachineBasicBlock *Succ : MBB.successors()) in runOnMachineFunction()
|
| /openbsd/gnu/llvm/llvm/lib/Transforms/Instrumentation/ |
| H A D | CFGMST.h | 130 if (int successors = TI->getNumSuccessors()) { in buildEdges() local
131 for (int i = 0; i != successors; ++i) { in buildEdges()
|
| /openbsd/gnu/llvm/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 169 for (auto *Block : successors()) in topologicalSort()
238 for (auto *Succ : successors()) { in computePostDominator()
|
| /openbsd/usr.bin/make/ |
| H A D | gnode.h | 139 LIST successors; member
|