| /llvm-project-15.0.7/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 …]
|
| /llvm-project-15.0.7/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 | 9027 const BasicBlock *Predecessor = L->getLoopPredecessor(); in computeShiftCompareExitLimit() local
9028 if (!Predecessor) in computeShiftCompareExitLimit()
9124 Value *FirstValue = PN->getIncomingValueForBlock(Predecessor); in computeShiftCompareExitLimit()
9126 Predecessor->getTerminator(), &DT); in computeShiftCompareExitLimit()
11819 auto *Predecessor = RLoop->getLoopPredecessor(); in isImpliedViaMerge() local
11820 assert(Predecessor && "Loop with AddRec with no predecessor?"); in isImpliedViaMerge()
11821 const SCEV *L1 = getSCEV(LPhi->getIncomingValueForBlock(Predecessor)); in isImpliedViaMerge()
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | CMOVConversion.cpp | 71 BinaryBasicBlock *Predecessor = *RHS.pred_begin(); in isIfThenSubgraph() local
72 assert(Predecessor && LHS.isPredecessor(Predecessor) && "invalid subgraph"); in isIfThenSubgraph()
73 (void)Predecessor; in isIfThenSubgraph()
|
| H A D | BinaryPasses.cpp | 281 BinaryBasicBlock *Predecessor = *BB.pred_begin(); in runOnFunction() local
282 if (Predecessor->hasJumpTable()) in runOnFunction()
285 if (Predecessor == Successor) in runOnFunction()
288 BinaryBasicBlock::BinaryBranchInfo &BI = Predecessor->getBranchInfo(BB); in runOnFunction()
289 Predecessor->replaceSuccessor(&BB, Successor, BI.Count, in runOnFunction()
|
| /llvm-project-15.0.7/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;
|
| /llvm-project-15.0.7/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 | MachinePipeliner.cpp | 1800 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes() local
1801 if (!PI.isArtificial() && NodesAdded.count(Predecessor) == 0) in addConnectedNodes()
1802 addConnectedNodes(Predecessor, NewSet, NodesAdded); in addConnectedNodes()
|
| H A D | IfConversion.cpp | 1460 for (const MachineBasicBlock *Predecessor : MBB.predecessors()) { in InvalidatePreds() local
1461 BBInfo &PBBI = BBAnalysis[Predecessor->getNumber()]; in InvalidatePreds()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDeletion.cpp | 225 BasicBlock *Predecessor = L->getLoopPredecessor(); in canProveExitOnFirstIteration() local
228 if (!Predecessor || !Latch) in canProveExitOnFirstIteration()
273 return PN.getIncomingValueForBlock(Predecessor); in canProveExitOnFirstIteration()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 4974 auto *Predecessor = Preds[i]; in simplifyUnreachable() local
4975 Instruction *TI = Predecessor->getTerminator(); in simplifyUnreachable()
5002 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5017 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
5063 Predecessor->replaceAllUsesWith(CSI->getUnwindDest()); in simplifyUnreachable()
7021 BasicBlock *Predecessor = PHI.getIncomingBlock(i); in removeUndefIntroducingPredecessor() local
7022 Instruction *T = Predecessor->getTerminator(); in removeUndefIntroducingPredecessor()
7025 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
7055 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
7059 BB->removePredecessor(Predecessor); in removeUndefIntroducingPredecessor()
[all …]
|
| H A D | LowerSwitch.cpp | 232 BasicBlock *Predecessor, BasicBlock *OrigBlock, in SwitchConvert() argument
246 FixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); in SwitchConvert()
|
| /llvm-project-15.0.7/clang/utils/TableGen/ |
| H A D | MveEmitter.cpp | 467 Ptr Predecessor; member in __anondd1c47770111::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()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 97 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
98 if (!contains(Predecessor)) in hasDedicatedExits()
|
| H A D | BlockFrequencyInfoImpl.h | 860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
|
| /llvm-project-15.0.7/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
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlan.h | 414 void appendPredecessor(VPBlockBase *Predecessor) { in appendPredecessor() argument
415 assert(Predecessor && "Cannot add nullptr predecessor!"); in appendPredecessor()
416 Predecessors.push_back(Predecessor); in appendPredecessor()
420 void removePredecessor(VPBlockBase *Predecessor) { in removePredecessor() argument
421 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
|
| H A D | LoopVectorize.cpp | 8048 for (auto *Predecessor : predecessors(BB)) { in createBlockInMask() local
8049 VPValue *EdgeMask = createEdgeMask(Predecessor, BB, Plan); in createBlockInMask()
|
| /llvm-project-15.0.7/clang/test/CodeGenObjC/ |
| H A D | exceptions.m | 144 // finally.no-call-exit: Predecessor is when the catch throws.
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/ |
| H A D | mve-wls-block-placement.mir | 5 ; Checks that Predecessor gets moved (to before the LoopExit) if it contains a backward WLS.
11 …; Checks that Predecessor (containing a backwards WLS) does not get moved to before the loopExit i…
17 …; Checks that Predecessor (to which a forward WLS exists) is not moved if moving it would cause th…
29 ; Within a nested (Both the WLS and loopExit are at depth=3 here) loop, checks that Predecessor
36 …; Checks that Predecessor (to which a forward WLS exists) is moved if moving it would NOT cause th…
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1448 for (BasicBlock *Predecessor : predecessors(Phi->getParent())) { in foldICmpWithConstant()
1450 cast<Constant>(Phi->getIncomingValueForBlock(Predecessor)); in foldICmpWithConstant()
1452 NewPhi->addIncoming(BoolInput, Predecessor); in foldICmpWithConstant()
|