/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | CallSiteSplitting.cpp | 181 return Preds; in getTwoPredecessors() 196 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) || in canSplitCallSite() 197 isa<IndirectBrInst>(Preds[1]->getTerminator())) in canSplitCallSite() 324 for (unsigned i = 0; i < Preds.size(); i++) { in splitCallSite() 325 BasicBlock *PredBB = Preds[i].first; in splitCallSite() 333 addConditions(*NewCI, Preds[i].second); in splitCallSite() 447 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPHIPredicatedArgument() local 448 return {{Preds[0], {}}, {Preds[1], {}}}; in shouldSplitOnPHIPredicatedArgument() 456 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPredicatedArgument() local 457 if (Preds[0] == Preds[1]) in shouldSplitOnPredicatedArgument() [all …]
|
H A D | GVNSink.cpp | 768 SmallVector<BasicBlock *, 4> Preds; in sinkBB() local 772 Preds.push_back(B); in sinkBB() 776 if (Preds.size() < 2) in sinkBB() 778 llvm::sort(Preds); in sinkBB() 780 unsigned NumOrigPreds = Preds.size(); in sinkBB() 782 llvm::erase_if(Preds, [](BasicBlock *BB) { in sinkBB() 786 LockstepReverseIterator LRI(Preds); in sinkBB() 799 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 63 BBInfo **Preds = nullptr; variable 126 SmallVector<BlkT *, 10> Preds; in BuildBlockList() local 129 Preds.clear(); in BuildBlockList() 131 Info->NumPreds = Preds.size(); in BuildBlockList() 133 Info->Preds = nullptr; in BuildBlockList() 139 BlkT *Pred = Preds[p]; in BuildBlockList() 144 Info->Preds[p] = BBMapBucket.second; in BuildBlockList() 152 Info->Preds[p] = PredInfo; in BuildBlockList() 252 BBInfo *Pred = Info->Preds[p]; in FindDominators() 344 Info->DefBB = Info->Preds[0]->DefBB; in FindSingularVal() [all …]
|
H A D | BasicBlockUtils.h | 195 void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, 343 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds, 363 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds, 382 BasicBlock *OrigBB, ArrayRef<BasicBlock *> Preds, const char *Suffix,
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 108 for (SDep &PredDep : Preds) { in addPred() 165 Preds.push_back(D); in addPred() 177 if (I == Preds.end()) in removePred() 211 Preds.erase(I); in removePred() 240 for (SDep &PredDep : SU->Preds) { in setHeightDirty() 273 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth() 337 if (BestI != Preds.begin()) in biasCriticalPath() 338 std::swap(*Preds.begin(), *BestI); in biasCriticalPath() 367 if (SU.Preds.size() > 0) { in dumpNodeAll() 369 for (const SDep &Dep : SU.Preds) { in dumpNodeAll() [all …]
|
H A D | MacroFusion.cpp | 39 for (const SDep &SI : SU.Preds) in getPredClusterSU() 61 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair() 86 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair() 112 for (const SDep &SI : SecondSU.Preds) { in fuseInstructionPair() 192 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
|
H A D | GCEmptyBasicBlocks.cpp | 74 SmallVector<MachineBasicBlock *, 8> Preds(MBB->predecessors()); in runOnMachineFunction() local 76 for (auto &Pred : Preds) in runOnMachineFunction()
|
H A D | TailDuplicator.cpp | 102 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB.pred_begin(), in VerifyPHIs() local 108 for (MachineBasicBlock *PredBB : Preds) { in VerifyPHIs() 128 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs() 727 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->predecessors()); in duplicateSimpleBB() local 729 for (MachineBasicBlock *PredBB : Preds) { in duplicateSimpleBB() 848 SmallSetVector<MachineBasicBlock *, 8> Preds; in tailDuplicate() local 850 Preds.insert(CandidatePtr->begin(), CandidatePtr->end()); in tailDuplicate() 852 Preds.insert(TailBB->pred_begin(), TailBB->pred_end()); in tailDuplicate() 854 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate() 1012 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
|
H A D | VLIWMachineScheduler.cpp | 311 for (const SDep &PI : SU->Preds) { in releaseTopNode() 552 for (auto &Pred : SU->Preds) { in isSingleUnscheduledPred() 672 for (const SDep &PI : SU->Preds) in SchedulingCost() 710 for (const SDep &PI : SU->Preds) { in SchedulingCost() 736 for (const auto &PI : SU->Preds) { in SchedulingCost() 844 CurrSize = (*I)->Preds.size(); in pickNodeFromQueue() 845 CandSize = Candidate.SU->Preds.size(); in pickNodeFromQueue()
|
H A D | MachinePipeliner.cpp | 938 for (auto &PI : I.Preds) { in updatePhiDependences() 1573 for (SDep &Pred : SU.Preds) in swapAntiDependences() 1748 for (auto &Dep : SU.Preds) { in apply() 1891 Preds.clear(); in pred_L() 1911 return !Preds.empty(); in pred_L() 1961 for (auto &PI : Cur->Preds) in computePath() 2174 for (auto &PI : SU->Preds) { in addConnectedNodes() 2850 for (auto &P : SU->Preds) in multipleIterations() 3004 for (auto &P : SU->Preds) { in orderDependence() 3114 for (auto &Dep : SU->Preds) in computeUnpipelineableNodes() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | MIPatternMatch.h | 281 struct And<Pred, Preds...> : And<Preds...> { 283 And(Pred &&p, Preds &&... preds) 284 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) { 292 template <typename... Preds> struct Or { 300 struct Or<Pred, Preds...> : Or<Preds...> { 302 Or(Pred &&p, Preds &&... preds) 303 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {} 310 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) { 311 return And<Preds...>(std::forward<Preds>(preds)...); 314 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) { [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoopsVerify.cpp | 99 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local 135 if (!CheckPreds && Preds.empty()) in verifyCTRBranch() 148 append_range(Preds, MBB->predecessors()); in verifyCTRBranch() 152 MBB = Preds.pop_back_val(); in verifyCTRBranch() 157 } while (!Preds.empty()); in verifyCTRBranch()
|
H A D | PPCHazardRecognizers.cpp | 38 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isLoadAfterStore() 39 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isLoadAfterStore() 43 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier()) in isLoadAfterStore() 47 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isLoadAfterStore() 64 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isBCTRAfterSet() 65 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isBCTRAfterSet() 69 if (SU->Preds[i].isCtrl()) in isBCTRAfterSet() 73 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isBCTRAfterSet()
|
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 130 NodeGroup Preds; variable 199 unsigned pred_size() const { return Preds.size(); } in pred_size() 201 bool pred_empty() const { return Preds.empty(); } in pred_empty() 238 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() 239 pred_iterator pred_end() { return Preds.end(); } in pred_end() 240 pred_range preds() { return {Preds.begin(), Preds.end()}; } in preds() 248 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; } in preds() 297 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMInstructionSelector.cpp | 403 Preds.first = ARMCC::EQ; in getComparePreds() 407 Preds.first = ARMCC::GT; in getComparePreds() 411 Preds.first = ARMCC::GE; in getComparePreds() 415 Preds.first = ARMCC::HI; in getComparePreds() 418 Preds.first = ARMCC::MI; in getComparePreds() 422 Preds.first = ARMCC::LS; in getComparePreds() 425 Preds.first = ARMCC::VC; in getComparePreds() 428 Preds.first = ARMCC::VS; in getComparePreds() 431 Preds.first = ARMCC::PL; in getComparePreds() 435 Preds.first = ARMCC::LT; in getComparePreds() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 994 for (BasicBlock *BB : Preds) in createPHIsForSplitLoopExit() 1153 for (auto *Pred : Preds) in UpdateAnalysisInformation() 1187 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation() 1221 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation() 1251 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes() 1259 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes() 1361 for (BasicBlock *Pred : Preds) { in SplitBlockPredecessorsImpl() 1374 if (Preds.empty()) { in SplitBlockPredecessorsImpl() 1385 if (!Preds.empty()) { in SplitBlockPredecessorsImpl() 1387 UpdatePHINodes(BB, NewBB, Preds, BI, HasLoopExit); in SplitBlockPredecessorsImpl() [all …]
|
H A D | FlattenCFG.cpp | 147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local 148 for (BasicBlock *Pred : Preds) { in FlattenParallelAndOr() 163 if (UnCondBlock || !PP || !Preds.contains(PP) || in FlattenParallelAndOr() 179 if (PP && Preds.count(PP)) { in FlattenParallelAndOr() 216 if (!Preds.contains(PS)) { in FlattenParallelAndOr()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUExportClustering.cpp | 69 for (const SDep &Pred : SUb->Preds) { in buildCluster() 85 for (const SDep &Pred : SU.Preds) { in removeExportDependencies() 94 for (const SDep &ExportPred : PredSU->Preds) { in removeExportDependencies()
|
H A D | GCNMinRegStrategy.cpp | 90 for (auto PDep : SDep.getSUnit()->Preds) { in getReadySuccessors() 183 for (const auto &P : S.getSUnit()->Preds) { in bumpPredsPriority() 195 for (const auto &P : SU->Preds) { in bumpPredsPriority()
|
H A D | GCNILPSched.cpp | 64 for (const SDep &Pred : SU->Preds) { in CalcNodeSethiUllmanNumber() 123 for (const SDep &Pred : SU->Preds) { in calcMaxScratches() 276 for (const auto &PredEdge : SU->Preds) { in releasePredecessors()
|
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 206 Preds.addNode(V, G); in addPredecessor() 469 if (N->Preds.empty()) { in trim() 475 WL1.append(N->Preds.begin(), N->Preds.end()); in trim() 503 if (N->Preds.empty()) in trim() 511 for (const ExplodedNode *Pred : N->Preds) { in trim()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonSubtarget.cpp | 255 for (auto &D : SU.Preds) in apply() 284 for (SDep &PI : SI.getSUnit()->Preds) { in apply() 599 auto F = find(Dst->Preds, T); in restoreLatency() 600 assert(F != Dst->Preds.end()); in restoreLatency() 616 auto F = find(Dst->Preds, T); in changeLatency() 617 assert(F != Dst->Preds.end()); in changeLatency() 661 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds); in isBestZeroLatency() 703 for (auto &I : DstBest->Preds) in isBestZeroLatency()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 69 for (SDep &Pred : SU->Preds) { in numberRCValPredInSU() 153 for (SDep &Pred : SU->Preds) in numberCtrlPredInSU() 211 for (const SDep &Pred : SU->Preds) { in getSingleUnscheduledPred() 497 for (SDep &Pred : SU->Preds) { in scheduledNode() 530 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 256 SmallVector<SDep, 4> Preds; ///< All sunit predecessors. variable 432 for (const SDep &Pred : Preds) in isPred() 644 return Node->Preds[Operand].getSUnit(); 658 return SUnitIterator(N, (unsigned)N->Preds.size()); in end() 672 return Node->Preds[Operand]; in getSDep()
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
H A D | CFG.h | 870 AdjacentBlocks Preds; variable 889 : Elements(C), Terminator(nullptr), BlockID(blockid), Preds(C, 1), in CFGBlock() 965 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() 966 pred_iterator pred_end() { return Preds.end(); } in pred_end() 967 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() 968 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() 970 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin() 971 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend() 972 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin() 973 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend() [all …]
|