| /freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGSort.cpp | 242 for (const MachineBasicBlock *Pred : MBB.predecessors()) in SortBlocks() 363 for (auto Pred : MBB.predecessors()) in SortBlocks() 370 for (auto Pred : MBB.predecessors()) in SortBlocks() 379 for (auto Pred : MBB.predecessors()) in SortBlocks()
|
| H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 208 for (auto *Pred : MBB->predecessors()) { in run() 234 for (auto *Pred : Looper->predecessors()) { in run() 307 for (auto *Pred : MBB->predecessors()) { in run()
|
| /freebsd-12.1/contrib/gcc/ |
| H A D | ddg.h | 47 #define NODE_PREDECESSORS(x) ((x)->predecessors) 73 sbitmap predecessors; member
|
| H A D | ddg.c | 501 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg() 502 sbitmap_zero (g->nodes[i].predecessors); in create_ddg() 539 sbitmap_free (g->nodes[i].predecessors); in free_ddg() 650 gcc_assert (src->successors && dest->predecessors); in add_edge_to_ddg() 653 SET_BIT (dest->predecessors, src->cuid); in add_edge_to_ddg()
|
| H A D | modulo-sched.c | 1908 sbitmap predecessors = sbitmap_alloc (num_nodes); in order_nodes_in_scc() local 1911 sbitmap_zero (predecessors); in order_nodes_in_scc() 1912 find_predecessors (predecessors, g, nodes_ordered); in order_nodes_in_scc() 1918 if (sbitmap_a_and_b_cg (tmp, predecessors, scc)) in order_nodes_in_scc() 1963 sbitmap_zero (predecessors); in order_nodes_in_scc() 1964 find_predecessors (predecessors, g, nodes_ordered); in order_nodes_in_scc() 1965 sbitmap_a_and_b (workset, predecessors, scc); in order_nodes_in_scc() 1992 sbitmap_free (predecessors); in order_nodes_in_scc()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 295 for (MachineBasicBlock *P : MBB.predecessors()) in isDefOnEntry() 338 for (MachineBasicBlock *P : B.predecessors()) in isDefOnEntry() 387 for (MachineBasicBlock *Pred : MBB->predecessors()) { in findReachingDefs() 519 for (MachineBasicBlock *Pred : MBB->predecessors()) { in updateSSA() 603 for (const MachineBasicBlock *P : B->predecessors()) in isJointlyDominated()
|
| H A D | MachineBlockPlacement.cpp | 781 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in isProfitableToTailDup() 893 for (auto SuccPred : Succ->predecessors()) { in isTrellis() 992 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in getBestTrellisSuccessor() 1066 for (MachineBasicBlock *Pred : Succ->predecessors()) { in canTailDuplicateUnplacedPreds() 1184 for (MachineBasicBlock* Pred : PDom->predecessors()) { in precomputeTriangleChains() 1406 for (MachineBasicBlock *Pred : Succ->predecessors()) { in hasBetterLayoutPredecessor() 1673 for (MachineBasicBlock *Pred : ChainBB->predecessors()) { in fillWorkLists() 1795 for (MachineBasicBlock *Pred : L.getHeader()->predecessors()) { in findBestLoopTop() 1970 for (MachineBasicBlock *Pred : Top->predecessors()) { in rotateLoop() 2065 for (auto *Pred : HeaderBB->predecessors()) { in rotateLoopWithProfile() [all …]
|
| H A D | WinEHPrepare.cpp | 253 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateCXXStateNumbers() 300 for (const BasicBlock *PredBlock : predecessors(BB)) { in calculateCXXStateNumbers() 366 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers() 402 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers() 814 for (BasicBlock *Pred : predecessors(OldBlock)) in cloneCommonBlocks() 1140 for (BasicBlock *PredBlock : predecessors(EHBlock)) { in insertPHIStores()
|
| H A D | MachineDominators.cpp | 109 for (MachineBasicBlock *PredBB : Succ->predecessors()) { in applySplitCriticalEdges()
|
| H A D | ShrinkWrap.cpp | 412 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in updateSaveRestorePoints() 553 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in runOnMachineFunction()
|
| H A D | MachineLoopInfo.cpp | 121 for (MachineBasicBlock *P : HB->predecessors()) { in findLoopPreheader()
|
| H A D | ReachingDefAnalysis.cpp | 55 for (MachineBasicBlock *pred : MBB->predecessors()) { in enterBasicBlock()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 103 for (BasicBlock *Pred : predecessors(&BB)) in isUniformlyReached() 111 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
|
| H A D | SILowerI1Copies.cpp | 138 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors() function in __anon8a17bcda0111::PhiIncomingAnalysis 192 for (MachineBasicBlock *Pred : MBB->predecessors()) { in analyze() 323 for (MachineBasicBlock *Pred : Dom->predecessors()) { 572 for (MachineBasicBlock *MBB : PIA.predecessors()) in lowerPhis()
|
| H A D | SIAnnotateControlFlow.cpp | 268 for (BasicBlock *Pred : predecessors(Target)) in handleLoop() 290 for (BasicBlock *Pred : predecessors(BB)) { in closeControlFlow()
|
| H A D | AMDGPUAnnotateUniformValues.cpp | 82 for (auto I : predecessors(Root)) in DFS()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | CallSiteSplitting.cpp | 181 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); in getTwoPredecessors() 195 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); in canSplitCallSite() 366 SmallVector<BasicBlock *, 2> Splits(predecessors((TailBB))); in splitCallSite()
|
| H A D | JumpThreading.cpp | 591 for (BasicBlock *Pred : predecessors(BB)) in ComputeValueKnownInPredecessorsImpl() 619 for (BasicBlock *P : predecessors(BB)) { in ComputeValueKnownInPredecessorsImpl() 817 for (BasicBlock *P : predecessors(BB)) { in ComputeValueKnownInPredecessorsImpl() 849 for (BasicBlock *P : predecessors(BB)) { in ComputeValueKnownInPredecessorsImpl() 936 for (BasicBlock *Pred : predecessors(BB)) in ComputeValueKnownInPredecessorsImpl() 1342 for (BasicBlock *PredBB : predecessors(LoadBB)) { in SimplifyPartiallyRedundantLoad() 1430 for (BasicBlock *P : predecessors(LoadBB)) { in SimplifyPartiallyRedundantLoad() 2105 for (auto Pred : predecessors(NewBB)) { in SplitBlockPreds()
|
| H A D | SimpleLoopUnswitch.cpp | 1220 for (auto *Pred : predecessors(ClonedHeader)) { in buildClonedLoops() 1255 for (auto *Pred : predecessors(BB)) in buildClonedLoops() 1359 for (BasicBlock *PredBB : predecessors(BB)) { in buildClonedLoops() 1548 for (auto *Pred : predecessors(Header)) { in recomputeLoopBlockSet() 1621 for (auto *Pred : predecessors(BB)) in recomputeLoopBlockSet() 1759 for (BasicBlock *PredBB : predecessors(BB)) { in rebuildLoopAfterUnswitch() 1978 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) { in unswitchNontrivialInvariants() 2677 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) { in unswitchBestCondition()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnrollRuntime.cpp | 140 for (BasicBlock *PredBB : predecessors(PrologExit)) in ConnectProlog() 162 SmallVector<BasicBlock *, 4> Preds(predecessors(OriginalLoopLatchExit)); in ConnectProlog() 277 SmallVector<BasicBlock*, 4> Preds(predecessors(Exit)); in ConnectEpilog() 681 SmallVector<BasicBlock*, 4> Preds(predecessors(LatchExit)); in UnrollRuntimeLoopRemainder()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 161 for (auto *Pred : predecessors(BB)) { in collectTransitivePredecessors() 177 for (auto *PredPred : predecessors(Pred)) in collectTransitivePredecessors()
|
| /freebsd-12.1/contrib/llvm/include/llvm/IR/ |
| H A D | CFG.h | 125 inline pred_range predecessors(BasicBlock *BB) { in predecessors() function 128 inline pred_const_range predecessors(const BasicBlock *BB) { in predecessors() function
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | BlockExtractor.cpp | 104 for (auto PredBB : predecessors(LPad)) { in splitLandingPadPreds()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AArch64/ |
| H A D | AArch64A53Fix835769.cpp | 144 for (MachineBasicBlock *S : MBB->predecessors()) in getBBFallenThrough()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCFGOptimizer.cpp | 110 for (MachineBasicBlock *PB : MBB->predecessors()) in isOnFallThroughPath()
|