65   EntrySU = SUnit();  in clearDAG()
66   ExitSU = SUnit();  in clearDAG()
106 bool SUnit::addPred(const SDep &D, bool Required) {  in addPred()
117         SUnit *PredSU = PredDep.getSUnit();  in addPred()
135   SUnit *N = D.getSUnit();  in addPred()
174 void SUnit::removePred(const SDep &D) {  in removePred()
182   SUnit *N = D.getSUnit();  in removePred()
218 void SUnit::setDepthDirty() {  in setDepthDirty()
220   SmallVector<SUnit*, 8> WorkList;  in setDepthDirty()
223     SUnit *SU = WorkList.pop_back_val();  in setDepthDirty()
226       SUnit *SuccSU = SuccDep.getSUnit();  in setDepthDirty()
233 void SUnit::setHeightDirty() {  in setHeightDirty()
235   SmallVector<SUnit*, 8> WorkList;  in setHeightDirty()
238     SUnit *SU = WorkList.pop_back_val();  in setHeightDirty()
241       SUnit *PredSU = PredDep.getSUnit();  in setHeightDirty()
248 void SUnit::setDepthToAtLeast(unsigned NewDepth) {  in setDepthToAtLeast()
256 void SUnit::setHeightToAtLeast(unsigned NewHeight) {  in setHeightToAtLeast()
265 void SUnit::ComputeDepth() {  in ComputeDepth()
266   SmallVector<SUnit*, 8> WorkList;  in ComputeDepth()
269     SUnit *Cur = WorkList.back();  in ComputeDepth()
274       SUnit *PredSU = PredDep.getSUnit();  in ComputeDepth()
296 void SUnit::ComputeHeight() {  in ComputeHeight()
297   SmallVector<SUnit*, 8> WorkList;  in ComputeHeight()
300     SUnit *Cur = WorkList.back();  in ComputeHeight()
305       SUnit *SuccSU = SuccDep.getSUnit();  in ComputeHeight()
326 void SUnit::biasCriticalPath() {  in biasCriticalPath()
330   SUnit::pred_iterator BestI = Preds.begin();  in biasCriticalPath()
332   for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E;  in biasCriticalPath()
344 LLVM_DUMP_METHOD void SUnit::dumpAttributes() const {  in dumpAttributes()
357 LLVM_DUMP_METHOD void ScheduleDAG::dumpNodeName(const SUnit &SU) const {  in dumpNodeName()
366 LLVM_DUMP_METHOD void ScheduleDAG::dumpNodeAll(const SUnit &SU) const {  in dumpNodeAll()
396   for (const SUnit &SUnit : SUnits) {  in VerifyScheduledDAG()  local
397     if (!SUnit.isScheduled) {  in VerifyScheduledDAG()
398       if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) {  in VerifyScheduledDAG()
404       dumpNode(SUnit);  in VerifyScheduledDAG()
408     if (SUnit.isScheduled &&  in VerifyScheduledDAG()
409         (isBottomUp ? SUnit.getHeight() : SUnit.getDepth()) >  in VerifyScheduledDAG()
413       dumpNode(SUnit);  in VerifyScheduledDAG()
419       if (SUnit.NumSuccsLeft != 0) {  in VerifyScheduledDAG()
422         dumpNode(SUnit);  in VerifyScheduledDAG()
427       if (SUnit.NumPredsLeft != 0) {  in VerifyScheduledDAG()
430         dumpNode(SUnit);  in VerifyScheduledDAG()
474   std::vector<SUnit*> WorkList;  in InitDAGTopologicalSorting()
483   for (SUnit &SU : SUnits) {  in InitDAGTopologicalSorting()
499     SUnit *SU = WorkList.back();  in InitDAGTopologicalSorting()
504       SUnit *SU = PredDep.getSUnit();  in InitDAGTopologicalSorting()
517   for (SUnit &SU : SUnits)  {  in InitDAGTopologicalSorting()
539 void ScheduleDAGTopologicalSort::AddPredQueued(SUnit *Y, SUnit *X) {  in AddPredQueued()
551 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {  in AddPred()
569 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {  in RemovePred()
573 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()
575   std::vector<const SUnit*> WorkList;  in DFS()
600 std::vector<int> ScheduleDAGTopologicalSort::GetSubGraph(const SUnit &StartSU,  in GetSubGraph()
601                                                          const SUnit &TargetSU,  in GetSubGraph()
603   std::vector<const SUnit*> WorkList;  in GetSubGraph()
622     const SUnit *SU = WorkList.back();  in GetSubGraph()
625       const SUnit *Succ = SD.getSUnit();  in GetSubGraph()
656     const SUnit *SU = WorkList.back();  in GetSubGraph()
659       const SUnit *Pred = SD.getSUnit();  in GetSubGraph()
706 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {  in WillCreateCycle()
718 void ScheduleDAGTopologicalSort::AddSUnitWithoutPredecessors(const SUnit *SU) {  in AddSUnitWithoutPredecessors()
726 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,  in IsReachable()
727                                              const SUnit *TargetSU) {  in IsReachable()
752 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits, SUnit *exitsu)  in ScheduleDAGTopologicalSort()