56     if (SUnit *SU = Sequence[i])  in dumpSchedule()
73   EntrySU = SUnit();  in Run()
74   ExitSU = SUnit();  in Run()
88 bool SUnit::addPred(const SDep &D) {  in addPred()
97   SUnit *N = D.getSUnit();  in addPred()
125 void SUnit::removePred(const SDep &D) {  in removePred()
134       SUnit *N = D.getSUnit();  in removePred()
168 void SUnit::setDepthDirty() {  in setDepthDirty()
170   SmallVector<SUnit*, 8> WorkList;  in setDepthDirty()
173     SUnit *SU = WorkList.pop_back_val();  in setDepthDirty()
175     for (SUnit::const_succ_iterator I = SU->Succs.begin(),  in setDepthDirty()
177       SUnit *SuccSU = I->getSUnit();  in setDepthDirty()
184 void SUnit::setHeightDirty() {  in setHeightDirty()
186   SmallVector<SUnit*, 8> WorkList;  in setHeightDirty()
189     SUnit *SU = WorkList.pop_back_val();  in setHeightDirty()
191     for (SUnit::const_pred_iterator I = SU->Preds.begin(),  in setHeightDirty()
193       SUnit *PredSU = I->getSUnit();  in setHeightDirty()
203 void SUnit::setDepthToAtLeast(unsigned NewDepth) {  in setDepthToAtLeast()
214 void SUnit::setHeightToAtLeast(unsigned NewHeight) {  in setHeightToAtLeast()
224 void SUnit::ComputeDepth() {  in ComputeDepth()
225   SmallVector<SUnit*, 8> WorkList;  in ComputeDepth()
228     SUnit *Cur = WorkList.back();  in ComputeDepth()
232     for (SUnit::const_pred_iterator I = Cur->Preds.begin(),  in ComputeDepth()
234       SUnit *PredSU = I->getSUnit();  in ComputeDepth()
257 void SUnit::ComputeHeight() {  in ComputeHeight()
258   SmallVector<SUnit*, 8> WorkList;  in ComputeHeight()
261     SUnit *Cur = WorkList.back();  in ComputeHeight()
265     for (SUnit::const_succ_iterator I = Cur->Succs.begin(),  in ComputeHeight()
267       SUnit *SuccSU = I->getSUnit();  in ComputeHeight()
290 void SUnit::dump(const ScheduleDAG *G) const {  in dump()
295 void SUnit::dumpAll(const ScheduleDAG *G) const {  in dumpAll()
307     for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end();  in dumpAll()
328     for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();  in dumpAll()
436   std::vector<SUnit*> WorkList;  in InitDAGTopologicalSorting()
444     SUnit *SU = &SUnits[i];  in InitDAGTopologicalSorting()
460     SUnit *SU = WorkList.back();  in InitDAGTopologicalSorting()
463     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in InitDAGTopologicalSorting()
465       SUnit *SU = I->getSUnit();  in InitDAGTopologicalSorting()
478     SUnit *SU = &SUnits[i];  in InitDAGTopologicalSorting()
479     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in InitDAGTopologicalSorting()
490 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {  in AddPred()
509 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {  in RemovePred()
516 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()
518   std::vector<const SUnit*> WorkList;  in DFS()
570 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *SU, SUnit *TargetSU) {  in WillCreateCycle()
573   for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in WillCreateCycle()
582 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,  in IsReachable()
583                                              const SUnit *TargetSU) {  in IsReachable()
606 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits) : SUnits(sunits) {}  in ScheduleDAGTopologicalSort()