Searched refs:PredSU (Results 1 - 12 of 12) sorted by relevance
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUExportClustering.cpp | 72 SUnit *PredSU = Pred.getSUnit(); local 73 if (!isExport(*PredSU) && !Pred.isWeak()) 74 DAG->addEdge(ChainHead, SDep(PredSU, SDep::Artificial)); 88 SUnit *PredSU = Pred.getSUnit(); local 89 if (Pred.isBarrier() && isExport(*PredSU)) { 96 for (const SDep &ExportPred : PredSU->Preds) {
|
H A D | GCNILPSched.cpp | 67 SUnit *PredSU = Pred.getSUnit(); local 68 unsigned PredSethiUllman = CalcNodeSethiUllmanNumber(PredSU, SUNumbers); 278 auto PredSU = PredEdge.getSUnit(); local 281 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); 283 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge.getLatency()); 285 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) 286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 399 SUnit *PredSU = PredEdge->getSUnit(); local 402 if (PredSU->NumSuccsLeft == 0) { 404 dumpNode(*PredSU); 409 --PredSU->NumSuccsLeft; 414 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency()); 419 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { 420 PredSU->isAvailable = true; 422 unsigned Height = PredSU->getHeight(); 426 if (isReady(PredSU)) { 821 SUnit *PredSU = PredEdge->getSUnit(); local [all...] |
H A D | ResourcePriorityQueue.cpp | 77 SUnit *PredSU = Pred.getSUnit(); local 78 const SDNode *ScegN = PredSU->getNode(); 217 SUnit &PredSU = *Pred.getSUnit(); local 218 if (!PredSU.isScheduled) { 221 if (OnlyAvailablePred && OnlyAvailablePred != &PredSU) 223 OnlyAvailablePred = &PredSU;
|
H A D | ScheduleDAGFast.cpp | 140 SUnit *PredSU = PredEdge->getSUnit(); local 143 if (PredSU->NumSuccsLeft == 0) { 145 dumpNode(*PredSU); 150 --PredSU->NumSuccsLeft; 154 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { 155 PredSU->isAvailable = true; 156 AvailableQueue.push(PredSU);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 118 SUnit *PredSU = PredDep.getSUnit(); local 122 for (SDep &SuccDep : PredSU->Succs) { 240 SUnit *PredSU = PredDep.getSUnit(); 241 if (PredSU->isHeightCurrent) 242 WorkList.push_back(PredSU); 273 SUnit *PredSU = PredDep.getSUnit(); 274 if (PredSU->isDepthCurrent) 276 PredSU->Depth + PredDep.getLatency()); 279 WorkList.push_back(PredSU);
|
H A D | ScheduleDAGInstrs.cpp | 1197 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { argument 1198 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); 1226 /// List PredSU, SuccSU pairs that represent data edges between subtrees. 1364 const SUnit *PredSU = PredDep.getSUnit(); local 1365 unsigned PredNum = PredSU->NodeNum; 1372 for (const SDep &SuccDep : PredSU->Succs) {
|
H A D | CriticalAntiDepBreaker.cpp | 148 const SUnit *PredSU = P->getSUnit(); local 150 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
|
H A D | MachineScheduler.cpp | 656 /// FIXME: Adjust PredSU height based on MinLatency. 658 SUnit *PredSU = PredEdge->getSUnit(); local 661 --PredSU->WeakSuccsLeft; 663 NextClusterPred = PredSU; 667 if (PredSU->NumSuccsLeft == 0) { 669 dumpNode(*PredSU); 676 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency()) 677 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); 679 --PredSU->NumSuccsLeft; 680 if (PredSU [all...] |
H A D | AggressiveAntiDepBreaker.cpp | 280 const SUnit *PredSU = P->getSUnit(); 282 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
|
H A D | MachinePipeliner.cpp | 2797 SUnit *PredSU = PredEdge.getSUnit(); local 2799 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey)); 2800 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { 2802 Pred = PredSU;
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAGInstrs.h | 347 /// True if an edge can be added from PredSU to SuccSU without creating 349 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);
|
Completed in 206 milliseconds