Searched refs:PredSU (Results 1 - 11 of 11) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp67 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-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp399 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 DResourcePriorityQueue.cpp73 SUnit *PredSU = Pred.getSUnit(); local
74 const SDNode *ScegN = PredSU->getNode();
213 SUnit &PredSU = *Pred.getSUnit(); local
214 if (!PredSU.isScheduled) {
217 if (OnlyAvailablePred && OnlyAvailablePred != &PredSU)
219 OnlyAvailablePred = &PredSU;
H A DScheduleDAGFast.cpp140 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-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp118 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 DScheduleDAGInstrs.cpp1196 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { argument
1197 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
1225 /// List PredSU, SuccSU pairs that represent data edges between subtrees.
1363 const SUnit *PredSU = PredDep.getSUnit(); local
1364 unsigned PredNum = PredSU->NodeNum;
1371 for (const SDep &SuccDep : PredSU->Succs) {
H A DCriticalAntiDepBreaker.cpp151 const SUnit *PredSU = P->getSUnit(); local
153 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
H A DMachineScheduler.cpp656 /// 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 DAggressiveAntiDepBreaker.cpp285 const SUnit *PredSU = P->getSUnit();
287 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
H A DMachinePipeliner.cpp2705 SUnit *PredSU = PredEdge.getSUnit(); local
2707 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey));
2708 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) {
2710 Pred = PredSU;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAGInstrs.h347 /// True if an edge can be added from PredSU to SuccSU without creating
349 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);

Completed in 221 milliseconds