Home
last modified time | relevance | path

Searched refs:PredSU (Results 1 – 12 of 12) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUExportClustering.cpp70 SUnit *PredSU = Pred.getSUnit(); in buildCluster() local
71 if (!isExport(*PredSU) && !Pred.isWeak()) in buildCluster()
72 DAG->addEdge(ChainHead, SDep(PredSU, SDep::Artificial)); in buildCluster()
86 SUnit *PredSU = Pred.getSUnit(); in removeExportDependencies() local
87 if (Pred.isBarrier() && isExport(*PredSU)) { in removeExportDependencies()
94 for (const SDep &ExportPred : PredSU->Preds) { in removeExportDependencies()
H A DGCNILPSched.cpp66 SUnit *PredSU = Pred.getSUnit(); in CalcNodeSethiUllmanNumber() local
67 unsigned PredSethiUllman = CalcNodeSethiUllmanNumber(PredSU, SUNumbers); in CalcNodeSethiUllmanNumber()
277 auto PredSU = PredEdge.getSUnit(); in releasePredecessors() local
280 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()
282 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge.getLatency()); in releasePredecessors()
284 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()
285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp406 dumpNode(*PredSU); in ReleasePred()
411 --PredSU->NumSuccsLeft; in ReleasePred()
421 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()
428 if (isReady(PredSU)) { in ReleasePred()
824 if (PredSU->isAvailable) { in CapturePred()
826 if (!PredSU->isPending) in CapturePred()
832 ++PredSU->NumSuccsLeft; in CapturePred()
2277 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2380 if (PredSU->getNode() && in hasOnlyLiveInOpers()
2998 SUnit *PredSU = nullptr; in PrescheduleNodesWithMultipleUses() local
[all …]
H A DScheduleDAGFast.cpp136 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local
139 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()
141 dumpNode(*PredSU); in ReleasePred()
146 --PredSU->NumSuccsLeft; in ReleasePred()
150 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()
151 PredSU->isAvailable = true; in ReleasePred()
152 AvailableQueue.push(PredSU); in ReleasePred()
H A DResourcePriorityQueue.cpp73 SUnit *PredSU = Pred.getSUnit(); in numberRCValPredInSU() local
74 const SDNode *ScegN = PredSU->getNode(); in numberRCValPredInSU()
212 SUnit &PredSU = *Pred.getSUnit(); in getSingleUnscheduledPred() local
213 if (!PredSU.isScheduled) { in getSingleUnscheduledPred()
216 if (OnlyAvailablePred && OnlyAvailablePred != &PredSU) in getSingleUnscheduledPred()
218 OnlyAvailablePred = &PredSU; in getSingleUnscheduledPred()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp117 SUnit *PredSU = PredDep.getSUnit(); in addPred() local
121 for (SDep &SuccDep : PredSU->Succs) { in addPred()
241 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty() local
242 if (PredSU->isHeightCurrent) in setHeightDirty()
243 WorkList.push_back(PredSU); in setHeightDirty()
274 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth() local
275 if (PredSU->isDepthCurrent) in ComputeDepth()
277 PredSU->Depth + PredDep.getLatency()); in ComputeDepth()
280 WorkList.push_back(PredSU); in ComputeDepth()
H A DScheduleDAGInstrs.cpp1214 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge() argument
1215 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()
1381 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree() local
1382 unsigned PredNum = PredSU->NodeNum; in joinPredSubtree()
1389 for (const SDep &SuccDep : PredSU->Succs) { in joinPredSubtree()
H A DCriticalAntiDepBreaker.cpp145 const SUnit *PredSU = P.getSUnit(); in CriticalPathStep() local
147 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
H A DMachineScheduler.cpp708 SUnit *PredSU = PredEdge->getSUnit(); in releasePred() local
711 --PredSU->WeakSuccsLeft; in releasePred()
713 NextClusterPred = PredSU; in releasePred()
717 if (PredSU->NumSuccsLeft == 0) { in releasePred()
719 dumpNode(*PredSU); in releasePred()
726 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency()) in releasePred()
727 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); in releasePred()
729 --PredSU->NumSuccsLeft; in releasePred()
730 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()
731 SchedImpl->releaseBottomNode(PredSU); in releasePred()
H A DAggressiveAntiDepBreaker.cpp275 const SUnit *PredSU = Pred.getSUnit(); in CriticalPathStep() local
277 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
H A DMachinePipeliner.cpp3233 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder() local
3235 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey)); in checkValidNodeOrder()
3236 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder()
3238 Pred = PredSU; in checkValidNodeOrder()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAGInstrs.h356 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);