/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUExportClustering.cpp | 70 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 D | GCNILPSched.cpp | 66 SUnit *PredSU = Pred.getSUnit(); in CalcNodeSethiUllmanNumber() local 67 unsigned PredSethiUllman = CalcNodeSethiUllmanNumber(PredSU, SUNumbers); in CalcNodeSethiUllmanNumber() 275 auto PredSU = PredEdge.getSUnit(); in releasePredecessors() local 278 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors() 280 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge.getLatency()); in releasePredecessors() 282 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors() 283 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
|
H A D | AMDGPUIGroupLP.cpp | 1416 for (auto &PredSU : ExpPipeCands) { in analyzeDAG() local 1418 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG() 1420 TempExp = PredSU; in analyzeDAG() 1448 for (auto &PredSU : ExpPipeCands) { in analyzeDAG() local 1449 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 401 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local 404 if (PredSU->NumSuccsLeft == 0) { in ReleasePred() 406 dumpNode(*PredSU); in ReleasePred() 411 --PredSU->NumSuccsLeft; in ReleasePred() 416 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency()); in ReleasePred() 421 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred() 422 PredSU->isAvailable = true; in ReleasePred() 424 unsigned Height = PredSU->getHeight(); in ReleasePred() 428 if (isReady(PredSU)) { in ReleasePred() 429 AvailableQueue->push(PredSU); in ReleasePred() [all …]
|
H A D | ScheduleDAGFast.cpp | 136 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 D | ResourcePriorityQueue.cpp | 73 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/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 117 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 D | ScheduleDAGInstrs.cpp | 1218 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge() argument 1219 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge() 1385 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree() local 1386 unsigned PredNum = PredSU->NodeNum; in joinPredSubtree() 1393 for (const SDep &SuccDep : PredSU->Succs) { in joinPredSubtree()
|
H A D | CriticalAntiDepBreaker.cpp | 145 const SUnit *PredSU = P.getSUnit(); in CriticalPathStep() local 147 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
|
H A D | MachineScheduler.cpp | 744 SUnit *PredSU = PredEdge->getSUnit(); in releasePred() local 747 --PredSU->WeakSuccsLeft; in releasePred() 749 NextClusterPred = PredSU; in releasePred() 753 if (PredSU->NumSuccsLeft == 0) { in releasePred() 755 dumpNode(*PredSU); in releasePred() 762 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency()) in releasePred() 763 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); in releasePred() 765 --PredSU->NumSuccsLeft; in releasePred() 766 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred() 767 SchedImpl->releaseBottomNode(PredSU); in releasePred()
|
H A D | AggressiveAntiDepBreaker.cpp | 275 const SUnit *PredSU = Pred.getSUnit(); in CriticalPathStep() local 277 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
|
H A D | MachinePipeliner.cpp | 3302 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder() local 3304 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey)); in checkValidNodeOrder() 3305 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder() 3307 Pred = PredSU; in checkValidNodeOrder()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAGInstrs.h | 361 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);
|