Searched refs:NumSuccsLeft (Results 1 – 8 of 8) sorted by relevance
161 assert(N->NumSuccsLeft < std::numeric_limits<unsigned>::max() && in addPred()163 ++N->NumSuccsLeft; in addPred()207 assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!"); in removePred()208 --N->NumSuccsLeft; in removePred()343 dbgs() << " # succs left : " << NumSuccsLeft << "\n"; in dumpAttributes()416 if (SUnit.NumSuccsLeft != 0) { in VerifyScheduledDAG()
684 if (PredSU->NumSuccsLeft == 0) { in releasePred()696 --PredSU->NumSuccsLeft; in releasePred()697 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) in releasePred()858 if (!SU.NumSuccsLeft) in findRootsAndBiasEdges()3108 bool AtBoundary = isTop ? !SU->NumSuccsLeft : !SU->NumPredsLeft; in biasPhysReg()
280 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()284 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()
1874 SUnits[i].NumSuccsLeft = SUnitsLinksBackup[i].NumSuccsLeft; in restoreSULinksLeft()
143 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()150 --PredSU->NumSuccsLeft; in ReleasePred()154 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()341 if (NewSU->NumSuccsLeft == 0) { in CopyAndMoveSuccessors()
402 if (PredSU->NumSuccsLeft == 0) { in ReleasePred()409 --PredSU->NumSuccsLeft; in ReleasePred()419 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { in ReleasePred()828 assert(PredSU->NumSuccsLeft < std::numeric_limits<unsigned>::max() && in CapturePred()830 ++PredSU->NumSuccsLeft; in CapturePred()1126 if (NewSU->NumSuccsLeft == 0) in TryUnfoldSU()1179 if (SU->NumSuccsLeft == 0) in CopyAndMoveSuccessors()2270 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
269 unsigned NumSuccsLeft = 0; ///< # of succs not scheduled. variable450 return NumSuccsLeft == 0; in isBottomReady()
537 if (SU->NumSuccsLeft == 0) in isSingleUnscheduledSucc()