| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMBlockPlacement.cpp | 77 MachineBasicBlock *Predecessor = ML->getLoopPredecessor(); in findWLS() local
78 if (!Predecessor) in findWLS()
80 MachineInstr *WlsInstr = findWLSInBlock(Predecessor); in findWLS()
83 if (Predecessor->pred_size() == 1) in findWLS()
84 return findWLSInBlock(*Predecessor->pred_begin()); in findWLS()
159 MachineBasicBlock *Predecessor = WlsInstr->getParent(); in fixBackwardsWLS() local
165 if (blockIsBefore(Predecessor, LoopExit)) in fixBackwardsWLS()
168 << Predecessor->getFullName() << " to " in fixBackwardsWLS()
181 for (auto It = ++LoopExit->getIterator(); It != Predecessor->getIterator(); in fixBackwardsWLS()
190 if (WLSTarget == Predecessor) { in fixBackwardsWLS()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 93 BlockT *Predecessor = getCyclePredecessor(); variable
94 if (!Predecessor)
99 if (succ_size(Predecessor) != 1)
103 if (!Predecessor->isLegalToHoistInto())
106 return Predecessor;
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDeletion.cpp | 222 BasicBlock *Predecessor = L->getLoopPredecessor(); in canProveExitOnFirstIteration() local
225 if (!Predecessor || !Latch) in canProveExitOnFirstIteration()
270 return PN.getIncomingValueForBlock(Predecessor); in canProveExitOnFirstIteration()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanPredicator.cpp | 136 for (auto *Predecessor : SetVector<VPBlockBase *>( in createBlockInMask() local
138 VPValue *EdgeMask = createEdgeMask(cast<VPBasicBlock>(Predecessor), VPBB); in createBlockInMask()
|
| H A D | VPlan.h | 110 void appendPredecessor(VPBlockBase *Predecessor) { in appendPredecessor() argument
111 assert(Predecessor && "Cannot add nullptr predecessor!"); in appendPredecessor()
112 Predecessors.push_back(Predecessor); in appendPredecessor()
116 void removePredecessor(VPBlockBase *Predecessor) { in removePredecessor() argument
117 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 469 BasicBlock *Predecessor = BB->getSinglePredecessor(); in InitLoopCount() local
472 if (!SCEVE.isSafeToExpandAt(ExitCount, Predecessor->getTerminator())) in InitLoopCount()
475 BB = Predecessor; in InitLoopCount()
|
| H A D | IfConversion.cpp | 1476 for (const MachineBasicBlock *Predecessor : MBB.predecessors()) { in InvalidatePreds() local
1477 BBInfo &PBBI = BBAnalysis[Predecessor->getNumber()]; in InvalidatePreds()
|
| H A D | MachinePipeliner.cpp | 2435 SUnit *Predecessor = IE.getSrc(); in addConnectedNodes() local
2436 if (!IE.isArtificial() && NodesAdded.count(Predecessor) == 0) in addConnectedNodes()
2437 addConnectedNodes(Predecessor, NewSet, NodesAdded); in addConnectedNodes()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAtomicOptimizer.cpp | 835 BasicBlock *Predecessor = nullptr; in optimizeAtomic() local
865 Predecessor = ComputeEnd; in optimizeAtomic()
867 Predecessor = OriginalBB; in optimizeAtomic()
885 PHI->addIncoming(PoisonValue::get(Ty), Predecessor); in optimizeAtomic()
|
| /freebsd/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | MveEmitter.cpp | 465 Ptr Predecessor; member in __anon819a2c470111::Result
499 if (Predecessor) in prerequisites()
500 ToRet.push_back(Predecessor); in prerequisites()
514 while (r->Predecessor) in setPredecessor()
515 r = r->Predecessor.get(); in setPredecessor()
516 r->Predecessor = p; in setPredecessor()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LowerSwitch.cpp | 228 BasicBlock *Predecessor, BasicBlock *OrigBlock, in SwitchConvert() argument
241 FixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); in SwitchConvert()
|
| H A D | SimplifyCFG.cpp | 5496 for (BasicBlock *Predecessor : Preds) { in simplifyUnreachable()
5497 Instruction *TI = Predecessor->getTerminator(); in simplifyUnreachable()
5528 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5543 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5577 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5583 for (auto *PredecessorOfPredecessor : predecessors(Predecessor)) { in simplifyUnreachable()
5588 PredecessorOfPredecessor, Predecessor}); in simplifyUnreachable()
5591 Predecessor->replaceAllUsesWith(CSI->getUnwindDest()); in simplifyUnreachable()
5598 SmallVector<BasicBlock *, 8> EHPreds(predecessors(Predecessor)); in simplifyUnreachable()
5612 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
[all …]
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/TraceExporter/docs/ |
| H A D | htr.rst | 45 - **Predecessor** - the block that occurs directly before (to the left of) the current block
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericLoopInfoImpl.h | 118 for (BlockT *Predecessor : inverse_children<BlockT *>(EB)) in hasDedicatedExits()
119 if (!contains(Predecessor)) in hasDedicatedExits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVStructurizer.cpp | 1021 for (BasicBlock *Predecessor : Predecessors) in removeUselessBlocks()
1022 replaceBranchTargets(Predecessor, &BB, Successor); in removeUselessBlocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineCost.cpp | 1774 auto *Predecessor = CallBB->getSinglePredecessor(); in simplifyCmpInstForRecCall() local
1775 if (!Predecessor) in simplifyCmpInstForRecCall()
1778 auto *Br = dyn_cast<BranchInst>(Predecessor->getTerminator()); in simplifyCmpInstForRecCall()
|
| H A D | ScalarEvolution.cpp | 9390 const BasicBlock *Predecessor = L->getLoopPredecessor(); in computeShiftCompareExitLimit() local
9391 if (!Predecessor) in computeShiftCompareExitLimit()
9487 Value *FirstValue = PN->getIncomingValueForBlock(Predecessor); in computeShiftCompareExitLimit()
9489 Predecessor->getTerminator(), &DT); in computeShiftCompareExitLimit()
12403 auto *Predecessor = RLoop->getLoopPredecessor(); in isImpliedViaMerge() local
12404 assert(Predecessor && "Loop with AddRec with no predecessor?"); in isImpliedViaMerge()
12405 const SCEV *L1 = getSCEV(LPhi->getIncomingValueForBlock(Predecessor)); in isImpliedViaMerge()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 851 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
|