| /openbsd-src/gnu/llvm/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 …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | Interval.cpp | 33 for (const BasicBlock *Predecessor : Predecessors) in print() local
34 OS << *Predecessor << "\n"; in print()
|
| H A D | ScalarEvolution.cpp | 9294 const BasicBlock *Predecessor = L->getLoopPredecessor(); in computeShiftCompareExitLimit() local
9295 if (!Predecessor) in computeShiftCompareExitLimit()
9391 Value *FirstValue = PN->getIncomingValueForBlock(Predecessor); in computeShiftCompareExitLimit()
9393 Predecessor->getTerminator(), &DT); in computeShiftCompareExitLimit()
12167 auto *Predecessor = RLoop->getLoopPredecessor(); in isImpliedViaMerge() local
12168 assert(Predecessor && "Loop with AddRec with no predecessor?"); in isImpliedViaMerge()
12169 const SCEV *L1 = getSCEV(LPhi->getIncomingValueForBlock(Predecessor)); in isImpliedViaMerge()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 71 BlockT *Predecessor = getCyclePredecessor(); variable
72 if (!Predecessor)
77 if (succ_size(Predecessor) != 1)
81 if (!Predecessor->isLegalToHoistInto())
84 return Predecessor;
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDeletion.cpp | 224 BasicBlock *Predecessor = L->getLoopPredecessor(); in canProveExitOnFirstIteration() local
227 if (!Predecessor || !Latch) in canProveExitOnFirstIteration()
272 return PN.getIncomingValueForBlock(Predecessor); in canProveExitOnFirstIteration()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 407 BasicBlock *Predecessor = BB->getSinglePredecessor(); in InitLoopCount() local
410 if (!SCEVE.isSafeToExpandAt(ExitCount, Predecessor->getTerminator())) in InitLoopCount()
413 BB = Predecessor; in InitLoopCount()
|
| H A D | IfConversion.cpp | 1460 for (const MachineBasicBlock *Predecessor : MBB.predecessors()) { in InvalidatePreds() local
1461 BBInfo &PBBI = BBAnalysis[Predecessor->getNumber()]; in InvalidatePreds()
|
| H A D | MachinePipeliner.cpp | 1757 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes() local
1758 if (!PI.isArtificial() && NodesAdded.count(Predecessor) == 0) in addConnectedNodes()
1759 addConnectedNodes(Predecessor, NewSet, NodesAdded); in addConnectedNodes()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 5141 auto *Predecessor = Preds[i]; in simplifyUnreachable() local
5142 Instruction *TI = Predecessor->getTerminator(); in simplifyUnreachable()
5169 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5184 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5218 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5224 for (auto *PredecessorOfPredecessor : predecessors(Predecessor)) { in simplifyUnreachable()
5229 PredecessorOfPredecessor, Predecessor}); in simplifyUnreachable()
5232 Predecessor->replaceAllUsesWith(CSI->getUnwindDest()); in simplifyUnreachable()
5239 SmallVector<BasicBlock *, 8> EHPreds(predecessors(Predecessor)); in simplifyUnreachable()
5253 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
[all …]
|
| H A D | LowerSwitch.cpp | 231 BasicBlock *Predecessor, BasicBlock *OrigBlock, in SwitchConvert() argument
244 FixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); in SwitchConvert()
|
| /openbsd-src/gnu/llvm/clang/utils/TableGen/ |
| H A D | MveEmitter.cpp | 467 Ptr Predecessor; member in __anonece5a09e0111::Result
501 if (Predecessor) in prerequisites()
502 ToRet.push_back(Predecessor); in prerequisites()
516 while (r->Predecessor) in setPredecessor()
517 r = r->Predecessor.get(); in setPredecessor()
518 r->Predecessor = p; in setPredecessor()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 118 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
119 if (!contains(Predecessor)) in hasDedicatedExits()
|
| H A D | BlockFrequencyInfoImpl.h | 860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
|
| /openbsd-src/gnu/llvm/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
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlan.h | 419 void appendPredecessor(VPBlockBase *Predecessor) { in appendPredecessor() argument
420 assert(Predecessor && "Cannot add nullptr predecessor!"); in appendPredecessor()
421 Predecessors.push_back(Predecessor); in appendPredecessor()
425 void removePredecessor(VPBlockBase *Predecessor) { in removePredecessor() argument
426 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
|
| H A D | LoopVectorize.cpp | 8135 for (auto *Predecessor : predecessors(BB)) { in createBlockInMask() local
8136 VPValue *EdgeMask = createEdgeMask(Predecessor, BB, Plan); in createBlockInMask()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1338 for (BasicBlock *Predecessor : predecessors(Phi->getParent())) { in foldICmpWithConstant()
1340 cast<Constant>(Phi->getIncomingValueForBlock(Predecessor)); in foldICmpWithConstant()
1342 NewPhi->addIncoming(BoolInput, Predecessor); in foldICmpWithConstant()
|