| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| H A D | ARMBlockPlacement.cpp | 73 MachineBasicBlock *Predecessor = ML->getLoopPredecessor(); in findWLS() local
74 if (!Predecessor) in findWLS()
76 MachineInstr *WlsInstr = findWLSInBlock(Predecessor); in findWLS()
79 if (Predecessor->pred_size() == 1) in findWLS()
80 return findWLSInBlock(*Predecessor->pred_begin()); in findWLS()
95 MachineBasicBlock *Predecessor = WlsInstr->getParent(); in fixBackwardsWLS() local
101 if (blockIsBefore(Predecessor, LoopExit)) in fixBackwardsWLS()
104 << Predecessor->getFullName() << " to " in fixBackwardsWLS()
117 for (auto It = ++LoopExit->getIterator(); It != Predecessor->getIterator(); in fixBackwardsWLS()
126 if (WLSTarget == Predecessor) { in fixBackwardsWLS()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | Interval.cpp | 34 for (const BasicBlock *Predecessor : Predecessors) in print() local
35 OS << *Predecessor << "\n"; in print()
|
| H A D | ScalarEvolution.cpp | 8004 const BasicBlock *Predecessor = L->getLoopPredecessor(); in computeShiftCompareExitLimit() local
8005 if (!Predecessor) in computeShiftCompareExitLimit()
8101 Value *FirstValue = PN->getIncomingValueForBlock(Predecessor); in computeShiftCompareExitLimit()
8103 Predecessor->getTerminator(), &DT); in computeShiftCompareExitLimit()
10773 auto *Predecessor = RLoop->getLoopPredecessor(); in isImpliedViaMerge() local
10774 assert(Predecessor && "Loop with AddRec with no predecessor?"); in isImpliedViaMerge()
10775 const SCEV *L1 = getSCEV(LPhi->getIncomingValueForBlock(Predecessor)); in isImpliedViaMerge()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 150 for (auto *Predecessor : PredsOfBB) in mergeEmptyReturnBlocks() local
153 if (!PredsOfRetBlock.contains(Predecessor)) in mergeEmptyReturnBlocks()
154 Updates.push_back({DominatorTree::Insert, Predecessor, RetBlock}); in mergeEmptyReturnBlocks()
155 for (auto *Predecessor : PredsOfBB) in mergeEmptyReturnBlocks() local
156 Updates.push_back({DominatorTree::Delete, Predecessor, &BB}); in mergeEmptyReturnBlocks()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 399 BasicBlock *Predecessor = BB->getSinglePredecessor(); in InitLoopCount() local
402 if (!isSafeToExpandAt(TripCount, Predecessor->getTerminator(), SE)) in InitLoopCount()
405 BB = Predecessor; in InitLoopCount()
|
| H A D | MachinePipeliner.cpp | 1810 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes() local
1811 if (!PI.isArtificial() && NodesAdded.count(Predecessor) == 0) in addConnectedNodes()
1812 addConnectedNodes(Predecessor, NewSet, NodesAdded); in addConnectedNodes()
|
| H A D | IfConversion.cpp | 1462 for (const MachineBasicBlock *Predecessor : MBB.predecessors()) { in InvalidatePreds() local
1463 BBInfo &PBBI = BBAnalysis[Predecessor->getNumber()]; in InvalidatePreds()
|
| /netbsd-src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| H A D | MveEmitter.cpp | 471 Ptr Predecessor; member in __anone3a730d20111::Result
505 if (Predecessor) in prerequisites()
506 ToRet.push_back(Predecessor); in prerequisites()
520 while (r->Predecessor) in setPredecessor()
521 r = r->Predecessor.get(); in setPredecessor()
522 r->Predecessor = p; in setPredecessor()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | LowerSwitch.cpp | 223 BasicBlock *Predecessor, BasicBlock *OrigBlock, in SwitchConvert() argument
237 FixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); in SwitchConvert()
|
| H A D | SimplifyCFG.cpp | 4717 auto *Predecessor = Preds[i]; in simplifyUnreachable() local
4718 Instruction *TI = Predecessor->getTerminator(); in simplifyUnreachable()
4745 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
4760 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
4792 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
4798 for (auto *PredecessorOfPredecessor : predecessors(Predecessor)) { in simplifyUnreachable()
4803 PredecessorOfPredecessor, Predecessor}); in simplifyUnreachable()
4806 Predecessor->replaceAllUsesWith(CSI->getUnwindDest()); in simplifyUnreachable()
4813 SmallVector<BasicBlock *, 8> EHPreds(predecessors(Predecessor)); in simplifyUnreachable()
4827 Updates.push_back({DominatorTree::Delete, Predecessor, BB}); in simplifyUnreachable()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlan.h | 420 void appendPredecessor(VPBlockBase *Predecessor) { in appendPredecessor() argument
421 assert(Predecessor && "Cannot add nullptr predecessor!"); in appendPredecessor()
422 Predecessors.push_back(Predecessor); in appendPredecessor()
426 void removePredecessor(VPBlockBase *Predecessor) { in removePredecessor() argument
427 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
|
| H A D | LoopVectorize.cpp | 8582 for (auto *Predecessor : predecessors(BB)) { in createBlockInMask() local
8583 VPValue *EdgeMask = createEdgeMask(Predecessor, BB, Plan); in createBlockInMask()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 98 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
99 if (!contains(Predecessor)) in hasDedicatedExits()
|
| H A D | BlockFrequencyInfoImpl.h | 860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1429 for (BasicBlock *Predecessor : predecessors(Phi->getParent())) { in foldICmpWithConstant()
1431 cast<Constant>(Phi->getIncomingValueForBlock(Predecessor)); in foldICmpWithConstant()
1433 NewPhi->addIncoming(BoolInput, Predecessor); in foldICmpWithConstant()
|