| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 92 for (auto *Pred : MBB->predecessors()) { in ReachabilityGraph() 159 for (auto *Pred : MBB->predecessors()) { in calculate() 178 for (auto *Pred : Looper->predecessors()) { in calculate() 213 for (auto *Pred : Entry->predecessors()) { in calculate() 224 for (auto *Pred : MBB->predecessors()) { in calculate() 394 for (auto *Pred : Entry->predecessors()) { in makeSingleEntryLoop()
|
| H A D | WebAssemblyCFGSort.cpp | 200 for (const MachineBasicBlock *Pred : MBB.predecessors()) in sortBlocks() 351 for (auto *Pred : MBB.predecessors()) in sortBlocks() 358 for (auto *Pred : MBB.predecessors()) in sortBlocks() 367 for (auto *Pred : MBB.predecessors()) in sortBlocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 140 for (MachineBasicBlock *P : MBB.predecessors()) in isDefOnEntry() 182 for (MachineBasicBlock *P : B.predecessors()) in isDefOnEntry() 235 for (MachineBasicBlock *Pred : MBB->predecessors()) { in findReachingDefs() 367 for (MachineBasicBlock *Pred : MBB->predecessors()) { in updateSSA() 457 for (const MachineBasicBlock *P : B->predecessors()) in isJointlyDominated()
|
| H A D | ShrinkWrap.cpp | 410 for (const MachineBasicBlock *PredBB : MBB.predecessors()) in hasDirtyPred() 569 for (MachineBasicBlock *PredBB : CurRestore->predecessors()) { in checkIfRestoreSplittable() 652 NewSave = FindIDom<>(**NewSave->pred_begin(), NewSave->predecessors(), *MDT, in postShrinkWrapping() 777 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in updateSaveRestorePoints() 851 for (const MachineBasicBlock *Pred : MBB->predecessors()) { in performShrinkWrapping() 908 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in performShrinkWrapping()
|
| H A D | ReachingDefAnalysis.cpp | 99 for (MachineBasicBlock *pred : MBB->predecessors()) { in enterBasicBlock() 182 for (MachineBasicBlock *pred : MBB->predecessors()) { in reprocessBasicBlock() 492 for (auto *MBB : MI->getParent()->predecessors()) in getGlobalReachingDefs() 517 for (auto *Pred : MBB->predecessors()) in getLiveOuts() 530 for (auto *Pred : Parent->predecessors()) in getUniqueReachingMIDef()
|
| H A D | MachineLateInstrsCleanup.cpp | 161 for (MachineBasicBlock *Pred : MBB->predecessors()) in clearKillsForDef() 213 drop_begin(MBB->predecessors()), in processBlock()
|
| H A D | GCEmptyBasicBlocks.cpp | 73 SmallVector<MachineBasicBlock *, 8> Preds(MBB->predecessors()); in runOnMachineFunction()
|
| H A D | MachineBlockPlacement.cpp | 928 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in isProfitableToTailDup() 1045 for (auto *SuccPred : Succ->predecessors()) { in isTrellis() 1144 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in getBestTrellisSuccessor() 1225 for (MachineBasicBlock *Pred : Succ->predecessors()) { in canTailDuplicateUnplacedPreds() 1384 for (MachineBasicBlock *Pred : PDom->predecessors()) { in precomputeTriangleChains() 1611 for (MachineBasicBlock *Pred : Succ->predecessors()) { in hasBetterLayoutPredecessor() 1897 for (MachineBasicBlock *Pred : ChainBB->predecessors()) { in fillWorkLists() 2028 for (MachineBasicBlock *Pred : Top->predecessors()) { in TopFallThroughFreq() 2093 for (MachineBasicBlock *Pred : NewTop->predecessors()) { in FallThroughGains() 2184 for (MachineBasicBlock *Pred : OldTop->predecessors()) { in findBestLoopTopHelper() [all …]
|
| H A D | MachineSSAUpdater.cpp | 168 for (MachineBasicBlock *PredBB : BB->predecessors()) { in GetValueInMiddleOfBlock() 306 append_range(*Preds, BB->predecessors()); in FindPredecessorBlocks()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/ |
| H A D | SuspendCrossingInfo.h | 81 iterator_range<pred_iterator> predecessors(BlockData const &BD) const { in predecessors() function 83 return llvm::predecessors(BB); in predecessors()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 122 for (BasicBlock *P : predecessors(Header)) { in InsertPreheaderForLoop() 164 append_range(Worklist, predecessors(BB)); in addBlockAndPredsToSet() 298 for (BasicBlock *P : predecessors(Header)) { in separateNestedLoop() 373 for (BasicBlock *P : predecessors(Header)) { in insertUniqueBackedgeBlock() 494 for (BasicBlock *P : predecessors(BB)) in simplifyOneLoop() 877 for (BasicBlock *Pred : predecessors(L->getHeader()))
|
| H A D | MoveAutoInit.cpp | 158 for (BasicBlock *Pred : predecessors(UsersDominatorHead)) { in runMoveAutoInit() 183 for (BasicBlock *Pred : predecessors(UsersDominator)) in runMoveAutoInit()
|
| H A D | FixIrreducible.cpp | 239 for (BasicBlock *P : predecessors(Header)) { in fixIrreducible() 262 for (BasicBlock *P : predecessors(E)) { in fixIrreducible()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUSetWavePriority.cpp | 95 for (const MachineBasicBlock *Pred : MBB.predecessors()) { in CanLowerPriorityDirectlyInPredecessors() 207 for (MachineBasicBlock *Pred : MBB.predecessors()) { in run()
|
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 119 SmallVector<BasicBlock *, 8> Stack(predecessors(&BB)); in isUniformlyReached() 127 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
|
| H A D | SILowerI1Copies.cpp | 126 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors() function in __anon952a5e950111::PhiIncomingAnalysis 160 for (MachineBasicBlock *Pred : MBB->predecessors()) { in analyze() 294 for (MachineBasicBlock *Pred : Dom->predecessors()) { 549 for (MachineBasicBlock *MBB : PIA.predecessors()) in lowerPhis()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVInsertWriteVXRM.cpp | 268 for (const MachineBasicBlock *P : MBB.predecessors()) in computeAvailable() 342 for (MachineBasicBlock *P : MBB.predecessors()) { in computeAnticipated() 370 for (MachineBasicBlock *P : MBB.predecessors()) { in emitWriteVXRM()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | SuspendCrossingInfo.cpp | 104 if (all_of(predecessors(B), [this](BasicBlock *BB) { in computeBlockData() 116 for (BasicBlock *PI : predecessors(B)) { in computeBlockData()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | PredIteratorCache.h | 41 SmallVector<BasicBlock *, 32> PredCache(predecessors(BB)); in get()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | CallSiteSplitting.cpp | 179 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); in getTwoPredecessors() 195 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); in canSplitCallSite() 363 SmallVector<BasicBlock *, 2> Splits(predecessors((TailBB))); in splitCallSite()
|
| H A D | StructurizeCFG.cpp | 517 for (BasicBlock *P : predecessors(BB)) { in gatherPredicates() 720 for (auto P : predecessors(PHIBlock)) { in findUndefBlocks() 725 append_range(Stack, predecessors(PHIBlock)); in findUndefBlocks() 738 llvm::append_range(Stack, predecessors(Current)); in findUndefBlocks() 939 for (BasicBlock *BB : llvm::make_early_inc_range(predecessors(OldExit))) { in changeExit()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 174 for (const auto *Pred : predecessors(BB)) { in collectTransitivePredecessors() 192 for (const auto *PredPred : predecessors(Pred)) in collectTransitivePredecessors() 215 for (const BasicBlock *Pred : predecessors(CurLoop->getHeader())) in allLoopPathsLeadToBlock() 568 for (const BasicBlock *PredBB : predecessors(InitBB)) { in findBackwardJoinPoint()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | EHUtils.h | 32 for (auto *PredBB : predecessors(BB)) { in computeEHOnlyBlocks()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 118 for (const auto Pred : predecessors(Header)) { 342 for (BlockT *Pred : predecessors(HeaderCandidate)) { in run() 368 for (BlockT *Pred : predecessors(Block)) { in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCCTRLoopsVerify.cpp | 146 append_range(Preds, MBB->predecessors()); in verifyCTRBranch()
|