Home
last modified time | relevance | path

Searched refs:Preds (Results 1 – 25 of 80) sorted by relevance

1234

/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp183 return Preds; in getTwoPredecessors()
198 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) || in canSplitCallSite()
199 isa<IndirectBrInst>(Preds[1]->getTerminator())) in canSplitCallSite()
327 for (unsigned i = 0; i < Preds.size(); i++) { in splitCallSite()
328 BasicBlock *PredBB = Preds[i].first; in splitCallSite()
336 addConditions(*NewCI, Preds[i].second); in splitCallSite()
448 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPHIPredicatedArgument() local
449 return {{Preds[0], {}}, {Preds[1], {}}}; in shouldSplitOnPHIPredicatedArgument()
457 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPredicatedArgument() local
458 if (Preds[0] == Preds[1]) in shouldSplitOnPredicatedArgument()
[all …]
H A DGVNSink.cpp765 SmallVector<BasicBlock *, 4> Preds; in sinkBB() local
769 Preds.push_back(B); in sinkBB()
773 if (Preds.size() < 2) in sinkBB()
775 llvm::sort(Preds); in sinkBB()
777 unsigned NumOrigPreds = Preds.size(); in sinkBB()
779 for (auto I = Preds.begin(); I != Preds.end();) { in sinkBB()
781 I = Preds.erase(I); in sinkBB()
786 LockstepReverseIterator LRI(Preds); in sinkBB()
799 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h138 struct And<Pred, Preds...> : And<Preds...> {
140 And(Pred &&p, Preds &&... preds)
141 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
149 template <typename... Preds> struct Or {
157 struct Or<Pred, Preds...> : Or<Preds...> {
159 Or(Pred &&p, Preds &&... preds)
160 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
167 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
168 return And<Preds...>(std::forward<Preds>(preds)...);
171 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp109 for (SDep &PredDep : Preds) { in addPred()
166 Preds.push_back(D); in addPred()
178 if (I == Preds.end()) in removePred()
187 Preds.erase(I); in removePred()
239 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
272 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
336 if (BestI != Preds.begin()) in biasCriticalPath()
337 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
366 if (SU.Preds.size() > 0) { in dumpNodeAll()
368 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
[all …]
H A DMacroFusion.cpp40 for (const SDep &SI : SU.Preds) in getPredClusterSU()
62 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
87 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
113 for (const SDep &SI : SecondSU.Preds) { in fuseInstructionPair()
178 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
H A DTailDuplicator.cpp105 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
111 for (MachineBasicBlock *PredBB : Preds) { in VerifyPHIs()
131 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
728 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->predecessors()); in duplicateSimpleBB() local
730 for (MachineBasicBlock *PredBB : Preds) { in duplicateSimpleBB()
840 SmallSetVector<MachineBasicBlock *, 8> Preds; in tailDuplicate() local
842 Preds.insert(CandidatePtr->begin(), CandidatePtr->end()); in tailDuplicate()
844 Preds.insert(TailBB->pred_begin(), TailBB->pred_end()); in tailDuplicate()
846 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
995 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
H A DMachinePipeliner.cpp901 for (auto &PI : I.Preds) { in updatePhiDependences()
952 for (const SDep &P : I.Preds) in changeDependences()
961 for (auto &P : LastSU->Preds) in changeDependences()
1198 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end(); in swapAntiDependences()
1377 for (auto &Dep : SU.Preds) { in apply()
1524 Preds.clear(); in pred_L()
1545 return !Preds.empty(); in pred_L()
1594 for (auto &PI : Cur->Preds) in computePath()
1809 for (auto &PI : SU->Preds) { in addConnectedNodes()
2466 for (auto &P : SU->Preds) in multipleIterations()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h63 BBInfo **Preds = nullptr; variable
126 SmallVector<BlkT *, 10> Preds; in BuildBlockList() local
129 Preds.clear(); in BuildBlockList()
130 Traits::FindPredecessorBlocks(Info->BB, &Preds); 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()
[all …]
H A DBasicBlockUtils.h186 void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
340 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
360 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
381 ArrayRef<BasicBlock *> Preds,
400 BasicBlock *OrigBB, ArrayRef<BasicBlock *> Preds, const char *Suffix,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp733 PN.getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
735 for (BasicBlock *BB : Preds) in createPHIsForSplitLoopExit()
892 SmallPtrSet<BasicBlock *, 8> UniquePreds(Preds.begin(), Preds.end()); in UpdateAnalysisInformation()
928 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
962 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
992 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
1000 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
1120 if (Preds.empty()) { in SplitBlockPredecessorsImpl()
1131 if (!Preds.empty()) { in SplitBlockPredecessorsImpl()
1133 UpdatePHINodes(BB, NewBB, Preds, BI, HasLoopExit); in SplitBlockPredecessorsImpl()
[all …]
H A DFlattenCFG.cpp147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
148 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr()
165 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr()
181 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
218 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.cpp38 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()
H A DPPCCTRLoops.cpp102 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
138 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
151 append_range(Preds, MBB->predecessors()); in verifyCTRBranch()
155 MBB = Preds.pop_back_val(); in verifyCTRBranch()
160 } while (!Preds.empty()); in verifyCTRBranch()
/freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h129 NodeGroup Preds; variable
200 unsigned pred_size() const { return Preds.size(); } in pred_size()
202 bool pred_empty() const { return Preds.empty(); } in pred_empty()
239 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
240 pred_iterator pred_end() { return Preds.end(); } in pred_end()
241 pred_range preds() { return {Preds.begin(), Preds.end()}; } in preds()
249 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; } in preds()
298 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMInstructionSelector.cpp403 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-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp207 Preds.addNode(V, G); in addPredecessor()
471 if (N->Preds.empty()) { in trim()
477 WL1.append(N->Preds.begin(), N->Preds.end()); in trim()
505 if (N->Preds.empty()) in trim()
513 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUExportClustering.cpp69 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 DGCNMinRegStrategy.cpp90 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 DGCNILPSched.cpp64 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-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp203 for (auto &D : SU.Preds) in apply()
232 for (SDep &PI : SI.getSUnit()->Preds) { in apply()
530 auto F = find(Dst->Preds, T); in restoreLatency()
531 assert(F != Dst->Preds.end()); in restoreLatency()
547 auto F = find(Dst->Preds, T); in changeLatency()
548 assert(F != Dst->Preds.end()); in changeLatency()
592 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds); in isBestZeroLatency()
634 for (auto &I : DstBest->Preds) in isBestZeroLatency()
H A DHexagonMachineScheduler.cpp292 for (const SDep &PI : SU->Preds) { in releaseTopNode()
525 for (auto &Pred : SU->Preds) { in isSingleUnscheduledPred()
652 for (const SDep &PI : SU->Preds) in SchedulingCost()
706 for (const SDep &PI : SU->Preds) { in SchedulingCost()
732 for (const auto &PI : SU->Preds) { in SchedulingCost()
839 CurrSize = (*I)->Preds.size(); in pickNodeFromQueue()
840 CandSize = Candidate.SU->Preds.size(); in pickNodeFromQueue()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h256 SmallVector<SDep, 4> Preds; ///< All sunit predecessors. variable
432 for (const SDep &Pred : Preds) in isPred()
636 return Node->Preds[Operand].getSUnit();
650 return SUnitIterator(N, (unsigned)N->Preds.size()); in end()
664 return Node->Preds[Operand]; in getSDep()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp73 for (SDep &Pred : SU->Preds) { in numberRCValPredInSU()
157 for (SDep &Pred : SU->Preds) in numberCtrlPredInSU()
216 for (const SDep &Pred : SU->Preds) { in getSingleUnscheduledPred()
502 for (SDep &Pred : SU->Preds) { in scheduledNode()
535 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
H A DScheduleDAGRRList.cpp556 for (SDep &Pred : SU->Preds) { in ReleasePredecessors()
839 for (SDep &Pred : SU->Preds) { in UnscheduleNodeBottomUp()
1062 for (SDep &Pred : SU->Preds) { in TryUnfoldSU()
1187 for (SDep &Pred : SU->Preds) in CopyAndMoveSuccessors()
1355 for (SDep &Pred : SU->Preds) { in DelayForLiveRegsBottomUp()
1964 auto &Pred = TempSU->Preds[P]; in CalcNodeSethiUllmanNumber()
2090 for (const SDep &Pred : SU->Preds) { in HighRegPressure()
2139 for (const SDep &Pred : SU->Preds) { in RegPressureDiff()
2182 for (const SDep &Pred : SU->Preds) { in scheduledNode()
2963 for (const SDep &Pred : SU.Preds) in PrescheduleNodesWithMultipleUses()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h842 AdjacentBlocks Preds; variable
861 : Elements(C), Terminator(nullptr), BlockID(blockid), Preds(C, 1), in CFGBlock()
937 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
938 pred_iterator pred_end() { return Preds.end(); } in pred_end()
939 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
940 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
942 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
943 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
944 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
945 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]

1234