Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp402 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local
405 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()
407 dumpNode(*PredSU); in ReleasePred()
412 --PredSU->NumSuccsLeft; in ReleasePred()
417 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency()); in ReleasePred()
422 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()
423 PredSU->isAvailable = true; in ReleasePred()
425 unsigned Height = PredSU->getHeight(); in ReleasePred()
429 if (isReady(PredSU)) { in ReleasePred()
430 AvailableQueue->push(PredSU); in ReleasePred()
[all …]
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()
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()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DScheduleDAG.cpp118 SUnit *PredSU = PredDep.getSUnit(); in addPred() local
122 for (SDep &SuccDep : PredSU->Succs) { in addPred()
240 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty() local
241 if (PredSU->isHeightCurrent) in setHeightDirty()
242 WorkList.push_back(PredSU); in setHeightDirty()
273 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth() local
274 if (PredSU->isDepthCurrent) in ComputeDepth()
276 PredSU->Depth + PredDep.getLatency()); in ComputeDepth()
279 WorkList.push_back(PredSU); in ComputeDepth()
H A DScheduleDAGInstrs.cpp1204 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge() argument
1205 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()
1371 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree() local
1372 unsigned PredNum = PredSU->NodeNum; in joinPredSubtree()
1379 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.cpp682 SUnit *PredSU = PredEdge->getSUnit(); in releasePred() local
685 --PredSU->WeakSuccsLeft; in releasePred()
687 NextClusterPred = PredSU; in releasePred()
691 if (PredSU->NumSuccsLeft == 0) { in releasePred()
693 dumpNode(*PredSU); in releasePred()
700 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency()) in releasePred()
701 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); in releasePred()
703 --PredSU->NumSuccsLeft; in releasePred()
704 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()
705 SchedImpl->releaseBottomNode(PredSU); in releasePred()
H A DAggressiveAntiDepBreaker.cpp276 const SUnit *PredSU = Pred.getSUnit(); in CriticalPathStep() local
278 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
H A DMachinePipeliner.cpp2802 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder() local
2804 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey)); in checkValidNodeOrder()
2805 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder()
2807 Pred = PredSU; in checkValidNodeOrder()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DScheduleDAGInstrs.h355 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);