Home
last modified time | relevance | path

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

1234567

/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineSSAContext.h30 inline auto predecessors(const MachineBasicBlock *BB) { in predecessors() function
31 return BB->predecessors(); in predecessors()
/openbsd/gnu/gcc/gcc/
H A Dddg.h47 #define NODE_PREDECESSORS(x) ((x)->predecessors)
73 sbitmap predecessors; member
H A Dddg.c501 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()
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp141 for (MachineBasicBlock *P : MBB.predecessors()) in isDefOnEntry()
183 for (MachineBasicBlock *P : B.predecessors()) in isDefOnEntry()
231 for (MachineBasicBlock *Pred : MBB->predecessors()) { in findReachingDefs()
363 for (MachineBasicBlock *Pred : MBB->predecessors()) { in updateSSA()
447 for (const MachineBasicBlock *P : B->predecessors()) in isJointlyDominated()
H A DMachineLateInstrsCleanup.cpp130 for (MachineBasicBlock *Pred : MBB->predecessors()) in clearKillsForDef()
183 drop_begin(MBB->predecessors()), in processBlock()
H A DReachingDefAnalysis.cpp83 for (MachineBasicBlock *pred : MBB->predecessors()) { in enterBasicBlock()
160 for (MachineBasicBlock *pred : MBB->predecessors()) { in reprocessBasicBlock()
408 for (auto *MBB : MI->getParent()->predecessors()) in getGlobalReachingDefs()
433 for (auto *Pred : MBB->predecessors()) in getLiveOuts()
447 for (auto *Pred : Parent->predecessors()) in getUniqueReachingMIDef()
H A DMachineBlockPlacement.cpp868 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { in isProfitableToTailDup()
980 for (auto *SuccPred : Succ->predecessors()) { in isTrellis()
1158 for (MachineBasicBlock *Pred : Succ->predecessors()) { in canTailDuplicateUnplacedPreds()
1319 for (MachineBasicBlock* Pred : PDom->predecessors()) { in precomputeTriangleChains()
1541 for (MachineBasicBlock *Pred : Succ->predecessors()) { in hasBetterLayoutPredecessor()
1932 for (MachineBasicBlock *Pred : Top->predecessors()) { in TopFallThroughFreq()
2000 for (MachineBasicBlock *Pred : NewTop->predecessors()) { in FallThroughGains()
2093 for (MachineBasicBlock *Pred : OldTop->predecessors()) { in findBestLoopTopHelper()
2300 for (MachineBasicBlock *Pred : Top->predecessors()) { in hasViableTopFallthrough()
2446 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()
828 for (BasicBlock *Pred : predecessors(OldBlock)) in cloneCommonBlocks()
1149 for (BasicBlock *PredBlock : predecessors(EHBlock)) { in insertPHIStores()
H A DMachineSSAUpdater.cpp173 for (MachineBasicBlock *PredBB : BB->predecessors()) { in GetValueInMiddleOfBlock()
295 append_range(*Preds, BB->predecessors()); in FindPredecessorBlocks()
H A DMachineDominators.cpp108 for (MachineBasicBlock *PredBB : Succ->predecessors()) { in applySplitCriticalEdges()
/openbsd/gnu/llvm/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()
498 for (BasicBlock *P : predecessors(BB)) in simplifyOneLoop()
883 for (BasicBlock *Pred : predecessors(L->getHeader()))
H A DFixIrreducible.cpp180 for (auto *P : predecessors(H)) { in createNaturalLoopInternal()
292 for (const auto P : predecessors(BB)) { in makeReducible()
/openbsd/gnu/llvm/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.cpp119 SmallVector<BasicBlock *, 8> Stack(predecessors(&BB)); in isUniformlyReached()
127 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
H A DSILowerI1Copies.cpp146 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors() function in __anon3998d4c20111::PhiIncomingAnalysis
186 for (MachineBasicBlock *Pred : MBB->predecessors()) { in analyze()
317 for (MachineBasicBlock *Pred : Dom->predecessors()) {
629 for (MachineBasicBlock *MBB : PIA.predecessors()) in lowerPhis()
/openbsd/gnu/llvm/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py339 self.predecessors = []
392 self.nodes[succ].predecessors.append(pred)
866 if self._do_diffs and len(node.predecessors) == 1 \
868 prev_s = self._graph.nodes[node.predecessors[0]].state
958 succ.predecessors = [node_id]
1000 for pred_id in node.predecessors:
1009 node.predecessors = [succ_id for succ_id in node.predecessors
/openbsd/gnu/llvm/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
/openbsd/gnu/llvm/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h96 for (const auto Pred : predecessors(Header)) {
200 for (BlockT *Pred : predecessors(HeaderCandidate)) { in run()
224 for (BlockT *Pred : predecessors(Block)) { in run()
/openbsd/gnu/llvm/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()
365 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()
816 for (BasicBlock *BB : llvm::make_early_inc_range(predecessors(OldExit))) { in changeExit()
/openbsd/usr.bin/make/
H A Dgnode.h138 LIST predecessors; member
/openbsd/gnu/llvm/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()
665 for (const BasicBlock *PredBB : predecessors(InitBB)) { in findBackwardJoinPoint()

1234567