66   EntrySU = SUnit();  in clearDAG()
67   ExitSU = SUnit();  in clearDAG()
107 bool SUnit::addPred(const SDep &D, bool Required) {  in addPred()
118         SUnit *PredSU = PredDep.getSUnit();  in addPred()
136   SUnit *N = D.getSUnit();  in addPred()
175 void SUnit::removePred(const SDep &D) {  in removePred()
183   SUnit *N = D.getSUnit();  in removePred()
217 void SUnit::setDepthDirty() {  in setDepthDirty()
219   SmallVector<SUnit*, 8> WorkList;  in setDepthDirty()
222     SUnit *SU = WorkList.pop_back_val();  in setDepthDirty()
225       SUnit *SuccSU = SuccDep.getSUnit();  in setDepthDirty()
232 void SUnit::setHeightDirty() {  in setHeightDirty()
234   SmallVector<SUnit*, 8> WorkList;  in setHeightDirty()
237     SUnit *SU = WorkList.pop_back_val();  in setHeightDirty()
240       SUnit *PredSU = PredDep.getSUnit();  in setHeightDirty()
247 void SUnit::setDepthToAtLeast(unsigned NewDepth) {  in setDepthToAtLeast()
255 void SUnit::setHeightToAtLeast(unsigned NewHeight) {  in setHeightToAtLeast()
264 void SUnit::ComputeDepth() {  in ComputeDepth()
265   SmallVector<SUnit*, 8> WorkList;  in ComputeDepth()
268     SUnit *Cur = WorkList.back();  in ComputeDepth()
273       SUnit *PredSU = PredDep.getSUnit();  in ComputeDepth()
295 void SUnit::ComputeHeight() {  in ComputeHeight()
296   SmallVector<SUnit*, 8> WorkList;  in ComputeHeight()
299     SUnit *Cur = WorkList.back();  in ComputeHeight()
304       SUnit *SuccSU = SuccDep.getSUnit();  in ComputeHeight()
325 void SUnit::biasCriticalPath() {  in biasCriticalPath()
329   SUnit::pred_iterator BestI = Preds.begin();  in biasCriticalPath()
331   for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E;  in biasCriticalPath()
341 LLVM_DUMP_METHOD void SUnit::dumpAttributes() const {  in dumpAttributes()
354 LLVM_DUMP_METHOD void ScheduleDAG::dumpNodeName(const SUnit &SU) const {  in dumpNodeName()
363 LLVM_DUMP_METHOD void ScheduleDAG::dumpNodeAll(const SUnit &SU) const {  in dumpNodeAll()
393   for (const SUnit &SUnit : SUnits) {  in VerifyScheduledDAG()  local
394     if (!SUnit.isScheduled) {  in VerifyScheduledDAG()
395       if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) {  in VerifyScheduledDAG()
401       dumpNode(SUnit);  in VerifyScheduledDAG()
405     if (SUnit.isScheduled &&  in VerifyScheduledDAG()
406         (isBottomUp ? SUnit.getHeight() : SUnit.getDepth()) >  in VerifyScheduledDAG()
410       dumpNode(SUnit);  in VerifyScheduledDAG()
416       if (SUnit.NumSuccsLeft != 0) {  in VerifyScheduledDAG()
419         dumpNode(SUnit);  in VerifyScheduledDAG()
424       if (SUnit.NumPredsLeft != 0) {  in VerifyScheduledDAG()
427         dumpNode(SUnit);  in VerifyScheduledDAG()
471   std::vector<SUnit*> WorkList;  in InitDAGTopologicalSorting()
480   for (SUnit &SU : SUnits) {  in InitDAGTopologicalSorting()
496     SUnit *SU = WorkList.back();  in InitDAGTopologicalSorting()
501       SUnit *SU = PredDep.getSUnit();  in InitDAGTopologicalSorting()
514   for (SUnit &SU : SUnits)  {  in InitDAGTopologicalSorting()
536 void ScheduleDAGTopologicalSort::AddPredQueued(SUnit *Y, SUnit *X) {  in AddPredQueued()
548 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {  in AddPred()
566 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {  in RemovePred()
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()
572   std::vector<const SUnit*> WorkList;  in DFS()
598 std::vector<int> ScheduleDAGTopologicalSort::GetSubGraph(const SUnit &StartSU,  in GetSubGraph()
599                                                          const SUnit &TargetSU,  in GetSubGraph()
601   std::vector<const SUnit*> WorkList;  in GetSubGraph()
620     const SUnit *SU = WorkList.back();  in GetSubGraph()
623       const SUnit *Succ = SU->Succs[I].getSUnit();  in GetSubGraph()
654     const SUnit *SU = WorkList.back();  in GetSubGraph()
657       const SUnit *Pred = SU->Preds[I].getSUnit();  in GetSubGraph()
704 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {  in WillCreateCycle()
716 void ScheduleDAGTopologicalSort::AddSUnitWithoutPredecessors(const SUnit *SU) {  in AddSUnitWithoutPredecessors()
724 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,  in IsReachable()
725                                              const SUnit *TargetSU) {  in IsReachable()
748 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits, SUnit *exitsu)  in ScheduleDAGTopologicalSort()