Home
last modified time | relevance | path

Searched refs:predecessors (Results 1 – 25 of 126) sorted by relevance

123456

/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp91 for (auto *Pred : MBB->predecessors()) { in ReachabilityGraph()
158 for (auto *Pred : MBB->predecessors()) { in calculate()
177 for (auto *Pred : Looper->predecessors()) { in calculate()
212 for (auto *Pred : Entry->predecessors()) { in calculate()
223 for (auto *Pred : MBB->predecessors()) { in calculate()
395 for (auto *Pred : Entry->predecessors()) { in makeSingleEntryLoop()
H A DWebAssemblyCFGSort.cpp201 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-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp143 for (MachineBasicBlock *P : MBB.predecessors()) in isDefOnEntry()
185 for (MachineBasicBlock *P : B.predecessors()) in isDefOnEntry()
233 for (MachineBasicBlock *Pred : MBB->predecessors()) { in findReachingDefs()
365 for (MachineBasicBlock *Pred : MBB->predecessors()) { in updateSSA()
449 for (const MachineBasicBlock *P : B->predecessors()) in isJointlyDominated()
H A DReachingDefAnalysis.cpp77 for (MachineBasicBlock *pred : MBB->predecessors()) { in enterBasicBlock()
154 for (MachineBasicBlock *pred : MBB->predecessors()) { in reprocessBasicBlock()
403 for (auto *MBB : MI->getParent()->predecessors()) in getGlobalReachingDefs()
428 for (auto *Pred : MBB->predecessors()) in getLiveOuts()
442 for (auto *Pred : Parent->predecessors()) in getUniqueReachingMIDef()
H A DMachineBlockPlacement.cpp836 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in isProfitableToTailDup()
948 for (auto SuccPred : Succ->predecessors()) { in isTrellis()
1126 for (MachineBasicBlock *Pred : Succ->predecessors()) { in canTailDuplicateUnplacedPreds()
1287 for (MachineBasicBlock* Pred : PDom->predecessors()) { in precomputeTriangleChains()
1509 for (MachineBasicBlock *Pred : Succ->predecessors()) { in hasBetterLayoutPredecessor()
1900 for (MachineBasicBlock *Pred : Top->predecessors()) { in TopFallThroughFreq()
1968 for (MachineBasicBlock *Pred : NewTop->predecessors()) { in FallThroughGains()
2059 for (MachineBasicBlock *Pred : OldTop->predecessors()) { in findBestLoopTopHelper()
2266 for (MachineBasicBlock *Pred : Top->predecessors()) { in hasViableTopFallthrough()
2412 for (auto *Pred : ChainHeaderBB->predecessors()) { in rotateLoopWithProfile()
[all …]
H A DWinEHPrepare.cpp258 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateCXXStateNumbers()
320 for (const BasicBlock *PredBlock : predecessors(BB)) { in calculateCXXStateNumbers()
389 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers()
425 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers()
831 for (BasicBlock *Pred : predecessors(OldBlock)) in cloneCommonBlocks()
1155 for (BasicBlock *PredBlock : predecessors(EHBlock)) { in insertPHIStores()
H A DMachineSSAUpdater.cpp167 for (MachineBasicBlock *PredBB : BB->predecessors()) { in GetValueInMiddleOfBlock()
285 append_range(*Preds, BB->predecessors()); in FindPredecessorBlocks()
H A DMachineDominators.cpp106 for (MachineBasicBlock *PredBB : Succ->predecessors()) { in applySplitCriticalEdges()
H A DShrinkWrap.cpp415 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in updateSaveRestorePoints()
554 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in runOnMachineFunction()
H A DMachineLoopInfo.cpp131 for (MachineBasicBlock *P : HB->predecessors()) { in findLoopPreheader()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp130 for (BasicBlock *P : predecessors(Header)) { in InsertPreheaderForLoop()
172 append_range(Worklist, predecessors(BB)); in addBlockAndPredsToSet()
307 for (BasicBlock *P : predecessors(Header)) { in separateNestedLoop()
382 for (BasicBlock *P : predecessors(Header)) { in insertUniqueBackedgeBlock()
504 for (BasicBlock *P : predecessors(*BB)) in simplifyOneLoop()
897 for (BasicBlock *Pred : predecessors(L->getHeader()))
H A DFixIrreducible.cpp171 for (auto P : predecessors(H)) { in createNaturalLoopInternal()
283 for (const auto P : predecessors(BB)) { in makeReducible()
H A DLoopUnrollRuntime.cpp142 for (BasicBlock *PredBB : predecessors(PrologExit)) in ConnectProlog()
164 SmallVector<BasicBlock *, 4> Preds(predecessors(OriginalLoopLatchExit)); in ConnectProlog()
279 SmallVector<BasicBlock*, 4> Preds(predecessors(Exit)); in ConnectEpilog()
709 SmallVector<BasicBlock*, 4> Preds(predecessors(LatchExit)); in UnrollRuntimeLoopRemainder()
H A DSSAUpdater.cpp126 for (BasicBlock *PredBB : predecessors(BB)) { in GetValueInMiddleOfBlock()
258 append_range(*Preds, predecessors(BB)); in FindPredecessorBlocks()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/
H A DPredIteratorCache.h47 SmallVector<BasicBlock *, 32> PredCache(predecessors(BB)); in GetPreds()
H A DCFG.h127 inline pred_range predecessors(BasicBlock *BB) { in predecessors() function
130 inline const_pred_range predecessors(const BasicBlock *BB) { in predecessors() function
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp119 SmallVector<BasicBlock *, 8> Stack(predecessors(&BB)); in isUniformlyReached()
127 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
H A DSILowerI1Copies.cpp144 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors() function in __anonc2da0cc90111::PhiIncomingAnalysis
195 for (MachineBasicBlock *Pred : MBB->predecessors()) { in analyze()
326 for (MachineBasicBlock *Pred : Dom->predecessors()) {
630 for (MachineBasicBlock *MBB : PIA.predecessors()) in lowerPhis()
H A DSIOptimizeVGPRLiveRange.cpp181 for (auto *Pred : MBB->predecessors()) { in collectElseRegionBlocks()
483 for (auto *Pred : Flow->predecessors()) { in optimizeLiveRange()
535 for (auto *Pred : Loop->predecessors()) { in optimizeWaterfallLiveRange()
H A DSIAnnotateControlFlow.cpp268 for (BasicBlock *Pred : predecessors(Target)) { in handleLoop()
299 for (BasicBlock *Pred : predecessors(BB)) { in closeControlFlow()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp181 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); in getTwoPredecessors()
197 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); in canSplitCallSite()
366 SmallVector<BasicBlock *, 2> Splits(predecessors((TailBB))); in splitCallSite()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp151 append_range(Preds, MBB->predecessors()); in verifyCTRBranch()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DMustExecute.cpp170 for (auto *Pred : predecessors(BB)) { in collectTransitivePredecessors()
186 for (auto *PredPred : predecessors(Pred)) in collectTransitivePredecessors()
658 for (const BasicBlock *PredBB : predecessors(InitBB)) { in findBackwardJoinPoint()
/freebsd-13.1/contrib/llvm-project/llvm/lib/IR/
H A DBasicBlock.cpp324 assert((hasNUsesOrMore(16) || llvm::is_contained(predecessors(this), Pred)) && in removePredecessor()
434 for (BasicBlock *Pred : predecessors(this)) { in splitBasicBlockBefore()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCFGOptimizer.cpp110 for (MachineBasicBlock *PB : MBB->predecessors()) in isOnFallThroughPath()

123456