Searched refs:PredSU (Results 1 – 11 of 11) sorted by relevance
399 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local402 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()404 dumpNode(*PredSU); in ReleasePred()409 --PredSU->NumSuccsLeft; in ReleasePred()414 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency()); in ReleasePred()419 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()420 PredSU->isAvailable = true; in ReleasePred()422 unsigned Height = PredSU->getHeight(); in ReleasePred()426 if (isReady(PredSU)) { in ReleasePred()427 AvailableQueue->push(PredSU); in ReleasePred()[all …]
73 SUnit *PredSU = Pred.getSUnit(); in numberRCValPredInSU() local74 const SDNode *ScegN = PredSU->getNode(); in numberRCValPredInSU()213 SUnit &PredSU = *Pred.getSUnit(); in getSingleUnscheduledPred() local214 if (!PredSU.isScheduled) { in getSingleUnscheduledPred()217 if (OnlyAvailablePred && OnlyAvailablePred != &PredSU) in getSingleUnscheduledPred()219 OnlyAvailablePred = &PredSU; in getSingleUnscheduledPred()
140 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local143 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()145 dumpNode(*PredSU); in ReleasePred()150 --PredSU->NumSuccsLeft; in ReleasePred()154 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()155 PredSU->isAvailable = true; in ReleasePred()156 AvailableQueue.push(PredSU); in ReleasePred()
67 SUnit *PredSU = Pred.getSUnit(); in CalcNodeSethiUllmanNumber() local68 unsigned PredSethiUllman = CalcNodeSethiUllmanNumber(PredSU, SUNumbers); in CalcNodeSethiUllmanNumber()278 auto PredSU = PredEdge.getSUnit(); in releasePredecessors() local281 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()283 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge.getLatency()); in releasePredecessors()285 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
118 SUnit *PredSU = PredDep.getSUnit(); in addPred() local122 for (SDep &SuccDep : PredSU->Succs) { in addPred()240 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty() local241 if (PredSU->isHeightCurrent) in setHeightDirty()242 WorkList.push_back(PredSU); in setHeightDirty()273 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth() local274 if (PredSU->isDepthCurrent) in ComputeDepth()276 PredSU->Depth + PredDep.getLatency()); in ComputeDepth()279 WorkList.push_back(PredSU); in ComputeDepth()
1196 bool ScheduleDAGInstrs::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge() argument1197 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()1363 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree() local1364 unsigned PredNum = PredSU->NodeNum; in joinPredSubtree()1371 for (const SDep &SuccDep : PredSU->Succs) { in joinPredSubtree()
658 SUnit *PredSU = PredEdge->getSUnit(); in releasePred() local661 --PredSU->WeakSuccsLeft; in releasePred()663 NextClusterPred = PredSU; in releasePred()667 if (PredSU->NumSuccsLeft == 0) { in releasePred()669 dumpNode(*PredSU); in releasePred()676 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency()) in releasePred()677 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); in releasePred()679 --PredSU->NumSuccsLeft; in releasePred()680 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()681 SchedImpl->releaseBottomNode(PredSU); in releasePred()
151 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep() local153 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
285 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep() local287 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
2705 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder() local2707 *llvm::lower_bound(Indices, std::make_pair(PredSU, 0), CompareKey)); in checkValidNodeOrder()2708 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder()2710 Pred = PredSU; in checkValidNodeOrder()
349 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);