51   SUnits.clear();  in clearDAG()
385   for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {  in VerifyScheduledDAG()
386     if (!SUnits[i].isScheduled) {  in VerifyScheduledDAG()
387       if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {  in VerifyScheduledDAG()
393       SUnits[i].dump(this);  in VerifyScheduledDAG()
397     if (SUnits[i].isScheduled &&  in VerifyScheduledDAG()
398         (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) >  in VerifyScheduledDAG()
402       SUnits[i].dump(this);  in VerifyScheduledDAG()
408       if (SUnits[i].NumSuccsLeft != 0) {  in VerifyScheduledDAG()
411         SUnits[i].dump(this);  in VerifyScheduledDAG()
416       if (SUnits[i].NumPredsLeft != 0) {  in VerifyScheduledDAG()
419         SUnits[i].dump(this);  in VerifyScheduledDAG()
426   return SUnits.size() - DeadNodes;  in VerifyScheduledDAG()
460   unsigned DAGSize = SUnits.size();  in InitDAGTopologicalSorting()
471     SUnit *SU = &SUnits[i];  in InitDAGTopologicalSorting()
506     SUnit *SU = &SUnits[i];  in InitDAGTopologicalSorting()
547   WorkList.reserve(SUnits.size());  in DFS()
639   : SUnits(sunits), ExitSU(exitsu) {}  in ScheduleDAGTopologicalSort()