Searched refs:NumSuccsLeft (Results 1 – 8 of 8) sorted by relevance
160 assert(N->NumSuccsLeft < std::numeric_limits<unsigned>::max() && in addPred()162 ++N->NumSuccsLeft; in addPred()206 assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!"); in removePred()207 --N->NumSuccsLeft; in removePred()344 dbgs() << " # succs left : " << NumSuccsLeft << "\n"; in dumpAttributes()417 if (SUnit.NumSuccsLeft != 0) { in VerifyScheduledDAG()
717 if (PredSU->NumSuccsLeft == 0) { in releasePred()729 --PredSU->NumSuccsLeft; in releasePred()730 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()891 if (!SU.NumSuccsLeft) in findRootsAndBiasEdges()3419 bool AtBoundary = isTop ? !SU->NumSuccsLeft : !SU->NumPredsLeft; in biasPhysReg()
564 if (SU->NumSuccsLeft == 0) in isSingleUnscheduledSucc()
139 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()146 --PredSU->NumSuccsLeft; in ReleasePred()150 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()333 if (NewSU->NumSuccsLeft == 0) { in CopyAndMoveSuccessors()
404 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()411 --PredSU->NumSuccsLeft; in ReleasePred()421 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()830 assert(PredSU->NumSuccsLeft < std::numeric_limits<unsigned>::max() && in CapturePred()832 ++PredSU->NumSuccsLeft; in CapturePred()1123 if (NewSU->NumSuccsLeft == 0) in TryUnfoldSU()1176 if (SU->NumSuccsLeft == 0) in CopyAndMoveSuccessors()2277 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
280 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()284 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()
1854 SUnits[i].NumSuccsLeft = SUnitsLinksBackup[i].NumSuccsLeft; in restoreSULinksLeft()
269 unsigned NumSuccsLeft = 0; ///< # of succs not scheduled. variable450 return NumSuccsLeft == 0; in isBottomReady()