138     assert(NumPreds < std::numeric_limits<unsigned>::max() &&  in addPred()
140     assert(N->NumSuccs < std::numeric_limits<unsigned>::max() &&  in addPred()
150       assert(NumPredsLeft < std::numeric_limits<unsigned>::max() &&  in addPred()
160       assert(N->NumSuccsLeft < std::numeric_limits<unsigned>::max() &&  in addPred()
184   assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");  in removePred()
187     assert(NumPreds > 0 && "NumPreds will underflow!");  in removePred()
188     assert(N->NumSuccs > 0 && "NumSuccs will underflow!");  in removePred()
194       assert(WeakPredsLeft > 0 && "WeakPredsLeft will underflow!");  in removePred()
197       assert(NumPredsLeft > 0 && "NumPredsLeft will underflow!");  in removePred()
203       assert(N->WeakSuccsLeft > 0 && "WeakSuccsLeft will underflow!");  in removePred()
206       assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!");  in removePred()
436   assert(!AnyNotSched);  in VerifyScheduledDAG()
491       assert(SU.Succs.empty() && "SUnit should have no successors");  in InitDAGTopologicalSorting()
519       assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] &&  in InitDAGTopologicalSorting()
561     assert(!HasLoop && "Inserted edge creates a loop!");  in AddPred()
593       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in DFS()
635       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in GetSubGraph()
668       if (!VisitedBack.test(s) && Visited.test(s)) {  in GetSubGraph()
676   assert(Found && "Error in SUnit Graph!");  in GetSubGraph()
690     if (Visited.test(w)) {  in Shift()
719   assert(SU->NodeNum == Index2Node.size() && "Node cannot be added at the end");  in AddSUnitWithoutPredecessors()
720   assert(SU->NumPreds == 0 && "Can only add SU's with no predecessors");  in AddSUnitWithoutPredecessors()
728   assert(TargetSU != nullptr && "Invalid target SUnit");  in IsReachable()
729   assert(SU != nullptr && "Invalid SUnit");  in IsReachable()