Home
last modified time | relevance | path

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

1234567

/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp92 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 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/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp139 // Checking if the entry of MBB is reached by some def: add all predecessors in isDefOnEntry()
141 for (MachineBasicBlock *P : MBB.predecessors()) in isDefOnEntry()
174 // entry, or it undefines the range, do not process its predecessors. in isDefOnEntry()
182 // Still don't know: add all predecessors to the work list. in isDefOnEntry()
183 for (MachineBasicBlock *P : B.predecessors()) in isDefOnEntry()
236 for (MachineBasicBlock *Pred : MBB->predecessors()) { in findReachingDefs()
355 // IDom dominates all of our predecessors, but it may not be their in updateSSA()
368 for (MachineBasicBlock *Pred : MBB->predecessors()) { in updateSSA()
452 for (const MachineBasicBlock *P : B->predecessors())
H A DShrinkWrap.cpp405 for (const MachineBasicBlock *PredBB : MBB.predecessors()) in hasDirtyPred()
566 for (MachineBasicBlock *PredBB : CurRestore->predecessors()) { in checkIfRestoreSplittable()
649 NewSave = FindIDom<>(**NewSave->pred_begin(), NewSave->predecessors(), *MDT, in postShrinkWrapping()
774 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in updateSaveRestorePoints()
848 for (const MachineBasicBlock *Pred : MBB->predecessors()) { in performShrinkWrapping()
905 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); in performShrinkWrapping()
H A DReachingDefAnalysis.cpp83 for (MachineBasicBlock *pred : MBB->predecessors()) { in enterBasicBlock()
159 for (MachineBasicBlock *pred : MBB->predecessors()) { in reprocessBasicBlock()
407 for (auto *MBB : MI->getParent()->predecessors()) in getGlobalReachingDefs()
432 for (auto *Pred : MBB->predecessors()) in getLiveOuts()
446 for (auto *Pred : Parent->predecessors()) in getUniqueReachingMIDef()
H A DMachineLateInstrsCleanup.cpp139 for (MachineBasicBlock *Pred : MBB->predecessors()) in clearKillsForDef()
192 drop_begin(MBB->predecessors()), in processBlock()
H A DMachineBlockPlacement.cpp872 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in isProfitableToTailDup()
984 for (auto *SuccPred : Succ->predecessors()) { in isTrellis()
1083 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in getBestTrellisSuccessor()
1162 for (MachineBasicBlock *Pred : Succ->predecessors()) { in canTailDuplicateUnplacedPreds()
1323 for (MachineBasicBlock* Pred : PDom->predecessors()) { in precomputeTriangleChains()
1545 for (MachineBasicBlock *Pred : Succ->predecessors()) { in hasBetterLayoutPredecessor()
1832 for (MachineBasicBlock *Pred : ChainBB->predecessors()) { in fillWorkLists()
1968 for (MachineBasicBlock *Pred : Top->predecessors()) { in TopFallThroughFreq()
2036 for (MachineBasicBlock *Pred : NewTop->predecessors()) { in FallThroughGains()
2129 for (MachineBasicBlock *Pred : OldTop->predecessors()) { in findBestLoopTopHelper()
[all …]
H A DMachineSSAUpdater.cpp168 for (MachineBasicBlock *PredBB : BB->predecessors()) { in GetValueInMiddleOfBlock()
306 append_range(*Preds, BB->predecessors()); in FindPredecessorBlocks()
H A DWinEHPrepare.cpp393 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateCXXStateNumbers()
456 for (const BasicBlock *PredBlock : predecessors(BB)) { in calculateCXXStateNumbers()
526 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers()
562 for (const BasicBlock *PredBlock : predecessors(BB)) in calculateSEHStateNumbers()
977 for (BasicBlock *Pred : predecessors(OldBlock)) in cloneCommonBlocks()
1295 for (BasicBlock *PredBlock : predecessors(EHBlock)) { in insertPHIStores()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp125 for (BasicBlock *P : predecessors(Header)) { in InsertPreheaderForLoop()
167 append_range(Worklist, predecessors(BB)); in addBlockAndPredsToSet()
301 for (BasicBlock *P : predecessors(Header)) { in separateNestedLoop()
376 for (BasicBlock *P : predecessors(Header)) { in insertUniqueBackedgeBlock()
497 for (BasicBlock *P : predecessors(BB)) in simplifyOneLoop()
882 for (BasicBlock *Pred : predecessors(L->getHeader()))
H A DMoveAutoInit.cpp149 // but we can insert it in the non back-edge predecessors, if it exists. in runMoveAutoInit()
160 for (BasicBlock *Pred : predecessors(UsersDominatorHead)) { in runMoveAutoInit()
185 for (BasicBlock *Pred : predecessors(UsersDominator)) in runMoveAutoInit()
H A DFixIrreducible.cpp14 // 2. Collect the set of predecessors P of these headers. These may be inside as
55 // takes a set of incoming blocks (the predecessors) and outgoing blocks (the
59 // predecessors, every value used in the header (or later) but defined in a
177 for (auto *P : predecessors(H)) { in createNaturalLoopInternal()
183 dbgs() << "Found predecessors:"; in createNaturalLoopInternal()
191 // predecessors to the headers. in createNaturalLoopInternal()
289 for (const auto P : predecessors(BB)) { in makeReducible()
290 // Skip unreachable predecessors. in makeReducible()
H A DBreakCriticalEdges.cpp145 for (BasicBlock *P : predecessors(DestBB)) { in SplitKnownCriticalEdge()
318 for (BasicBlock *PredBB : predecessors(BB)) { in findIBRPredecessor()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSetWavePriority.cpp86 for (const MachineBasicBlock *Pred : MBB.predecessors()) { in CanLowerPriorityDirectlyInPredecessors()
188 for (MachineBasicBlock *Pred : MBB.predecessors()) { in runOnMachineFunction()
H A DAMDGPUUnifyDivergentExitNodes.cpp123 SmallVector<BasicBlock *, 8> Stack(predecessors(&BB)); in isUniformlyReached()
131 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
H A DSILowerI1Copies.cpp148 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors() function in __anon952a5e950111::PhiIncomingAnalysis
188 for (MachineBasicBlock *Pred : MBB->predecessors()) { in analyze()
322 for (MachineBasicBlock *Pred : Dom->predecessors()) {
618 for (MachineBasicBlock *MBB : PIA.predecessors()) in lowerPhis()
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVInsertWriteVXRM.cpp249 for (const MachineBasicBlock *P : MBB.predecessors()) in computeAvailable()
318 for (MachineBasicBlock *P : MBB.predecessors()) { in computeAnticipated()
346 for (MachineBasicBlock *P : MBB.predecessors()) { in emitWriteVXRM()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DPredIteratorCache.h47 SmallVector<BasicBlock *, 32> PredCache(predecessors(BB)); in GetPreds()
H A DCFG.h126 inline pred_range predecessors(BasicBlock *BB) { in predecessors() function
129 inline const_pred_range predecessors(const BasicBlock *BB) { in predecessors() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp179 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 DStructurizeCFG.cpp471 for (BasicBlock *P : predecessors(BB)) { in gatherPredicates()
686 for (auto P : predecessors(PHIBlock)) { in findUndefBlocks()
691 append_range(Stack, predecessors(PHIBlock)); in findUndefBlocks()
705 for (auto P : predecessors(Current)) in findUndefBlocks()
814 for (BasicBlock *BB : llvm::make_early_inc_range(predecessors(OldExit))) { in changeExit()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DMustExecute.cpp168 for (const auto *Pred : predecessors(BB)) { in collectTransitivePredecessors()
184 for (const auto *PredPred : predecessors(Pred)) in collectTransitivePredecessors()
207 for (const BasicBlock *Pred : predecessors(CurLoop->getHeader())) in allLoopPathsLeadToBlock()
560 for (const BasicBlock *PredBB : predecessors(InitBB)) { in findBackwardJoinPoint()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DEHUtils.h34 for (auto *PredBB : predecessors(BB)) { in computeEHOnlyBlocks()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h111 for (const auto Pred : predecessors(Header)) {
232 for (BlockT *Pred : predecessors(HeaderCandidate)) { in run()
256 for (BlockT *Pred : predecessors(Block)) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp148 append_range(Preds, MBB->predecessors()); in verifyCTRBranch()

1234567