Lines Matching refs:SUnits
71 SUnits.clear(); in Run()
356 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in VerifySchedule()
357 if (!SUnits[i].isScheduled) { in VerifySchedule()
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifySchedule()
364 SUnits[i].dump(this); in VerifySchedule()
368 if (SUnits[i].isScheduled && in VerifySchedule()
369 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) > in VerifySchedule()
373 SUnits[i].dump(this); in VerifySchedule()
379 if (SUnits[i].NumSuccsLeft != 0) { in VerifySchedule()
382 SUnits[i].dump(this); in VerifySchedule()
387 if (SUnits[i].NumPredsLeft != 0) { in VerifySchedule()
390 SUnits[i].dump(this); in VerifySchedule()
400 assert(Sequence.size() + DeadNodes - Noops == SUnits.size() && in VerifySchedule()
435 unsigned DAGSize = SUnits.size(); in InitDAGTopologicalSorting()
444 SUnit *SU = &SUnits[i]; in InitDAGTopologicalSorting()
478 SUnit *SU = &SUnits[i]; in InitDAGTopologicalSorting()
519 WorkList.reserve(SUnits.size()); in DFS()
606 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits) : SUnits(sunits) {} in ScheduleDAGTopologicalSort()