Searched refs:PredSU (Results 1 – 11 of 11) sorted by relevance
399 dumpNode(*PredSU); in ReleasePred()404 --PredSU->NumSuccsLeft; in ReleasePred()414 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()421 if (isReady(PredSU)) { in ReleasePred()816 if (PredSU->isAvailable) { in CapturePred()818 if (!PredSU->isPending) in CapturePred()824 ++PredSU->NumSuccsLeft; in CapturePred()2250 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()2344 if (PredSU->getNode() && in hasOnlyLiveInOpers()2943 SUnit *PredSU = nullptr; in PrescheduleNodesWithMultipleUses() local[all …]
141 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred() local144 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()146 dumpNode(*PredSU); in ReleasePred()151 --PredSU->NumSuccsLeft; in ReleasePred()155 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()156 PredSU->isAvailable = true; in ReleasePred()157 AvailableQueue.push(PredSU); in ReleasePred()
74 SUnit *PredSU = Pred.getSUnit(); in numberRCValPredInSU() local75 const SDNode *ScegN = PredSU->getNode(); in numberRCValPredInSU()212 SUnit &PredSU = *Pred.getSUnit(); in getSingleUnscheduledPred() local213 if (!PredSU.isScheduled) { in getSingleUnscheduledPred()216 if (OnlyAvailablePred && OnlyAvailablePred != &PredSU) in getSingleUnscheduledPred()218 OnlyAvailablePred = &PredSU; in getSingleUnscheduledPred()
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()
114 SUnit *PredSU = PredDep.getSUnit(); in addPred() local118 for (SDep &SuccDep : PredSU->Succs) { in addPred()236 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty() local237 if (PredSU->isHeightCurrent) in setHeightDirty()238 WorkList.push_back(PredSU); in setHeightDirty()269 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth() local270 if (PredSU->isDepthCurrent) in ComputeDepth()272 PredSU->Depth + PredDep.getLatency()); in ComputeDepth()275 WorkList.push_back(PredSU); in ComputeDepth()
608 bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge() argument609 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()667 SUnit *PredSU = PredEdge->getSUnit(); in releasePred() local670 --PredSU->WeakSuccsLeft; in releasePred()672 NextClusterPred = PredSU; in releasePred()676 if (PredSU->NumSuccsLeft == 0) { in releasePred()678 dumpNode(*PredSU); in releasePred()686 PredSU->BotReadyCycle = SU->BotReadyCycle + PredEdge->getLatency(); in releasePred()688 --PredSU->NumSuccsLeft; in releasePred()689 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()[all …]
152 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep() local154 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
1299 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree() local1300 unsigned PredNum = PredSU->NodeNum; in joinPredSubtree()1307 for (const SDep &SuccDep : PredSU->Succs) { in joinPredSubtree()
286 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep() local288 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
3525 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder() local3528 std::make_pair(PredSU, 0), CompareKey)); in checkValidNodeOrder()3529 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder()3531 Pred = PredSU; in checkValidNodeOrder()
325 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);