| /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/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 | 9274 const BasicBlock *Predecessor = L->getLoopPredecessor(); in computeShiftCompareExitLimit() local
9275 if (!Predecessor) in computeShiftCompareExitLimit()
9371 Value *FirstValue = PN->getIncomingValueForBlock(Predecessor); in computeShiftCompareExitLimit()
9373 Predecessor->getTerminator(), &DT); in computeShiftCompareExitLimit()
12130 auto *Predecessor = RLoop->getLoopPredecessor(); in isImpliedViaMerge() local
12131 assert(Predecessor && "Loop with AddRec with no predecessor?"); in isImpliedViaMerge()
12132 const SCEV *L1 = getSCEV(LPhi->getIncomingValueForBlock(Predecessor)); in isImpliedViaMerge()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 71 BlockT *Predecessor = getCyclePredecessor();
72 if (!Predecessor)
77 if (succ_size(Predecessor) != 1)
81 if (!Predecessor->isLegalToHoistInto())
84 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/CodeGen/ |
| H A D | HardwareLoops.cpp | 470 BasicBlock *Predecessor = BB->getSinglePredecessor(); in InitLoopCount() local
473 if (!SCEVE.isSafeToExpandAt(ExitCount, Predecessor->getTerminator())) in InitLoopCount()
476 BB = Predecessor; in InitLoopCount()
|
| H A D | IfConversion.cpp | 1456 for (const MachineBasicBlock *Predecessor : MBB.predecessors()) { in InvalidatePreds() local
1457 BBInfo &PBBI = BBAnalysis[Predecessor->getNumber()]; in InvalidatePreds()
|
| H A D | MachinePipeliner.cpp | 2175 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes() local
2176 if (!PI.isArtificial() && NodesAdded.count(Predecessor) == 0) in addConnectedNodes()
2177 addConnectedNodes(Predecessor, NewSet, NodesAdded); in addConnectedNodes()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAtomicOptimizer.cpp | 875 BasicBlock *Predecessor = nullptr; in optimizeAtomic() local
894 Predecessor = ComputeEnd; in optimizeAtomic()
896 Predecessor = EntryBB; in optimizeAtomic()
914 PHI->addIncoming(PoisonValue::get(Ty), Predecessor); in optimizeAtomic()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 5279 auto *Predecessor = Preds[i]; in simplifyUnreachable() local
5280 Instruction *TI = Predecessor->getTerminator(); in simplifyUnreachable()
5311 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5326 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5374 Predecessor->replaceAllUsesWith(CSI->getUnwindDest()); in simplifyUnreachable()
7463 BasicBlock *Predecessor = PHI.getIncomingBlock(i); in removeUndefIntroducingPredecessor() local
7464 Instruction *T = Predecessor->getTerminator(); in removeUndefIntroducingPredecessor()
7467 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
7500 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
7504 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
[all …]
|
| H A D | LowerSwitch.cpp | 230 BasicBlock *Predecessor, BasicBlock *OrigBlock, in SwitchConvert() argument
243 FixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); in SwitchConvert()
|
| /freebsd/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | MveEmitter.cpp | 467 Ptr Predecessor; member in __anonc95a670f0111::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()
|
| /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/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/lib/Transforms/Vectorize/ |
| H A D | VPlan.h | 451 void appendPredecessor(VPBlockBase *Predecessor) { in appendPredecessor() argument
452 assert(Predecessor && "Cannot add nullptr predecessor!"); in appendPredecessor()
453 Predecessors.push_back(Predecessor); in appendPredecessor()
457 void removePredecessor(VPBlockBase *Predecessor) { in removePredecessor() argument
458 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
|
| H A D | LoopVectorize.cpp | 8093 for (auto *Predecessor : predecessors(BB)) { in createBlockInMask() local
8094 VPValue *EdgeMask = createEdgeMask(Predecessor, BB, Plan); in createBlockInMask()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
|