438 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() {  in InitDAGTopologicalSorting()
523 void ScheduleDAGTopologicalSort::FixOrder() {  in FixOrder()
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()
597 std::vector<int> ScheduleDAGTopologicalSort::GetSubGraph(const SUnit &StartSU,  in GetSubGraph()
678 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,  in Shift()
703 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {  in WillCreateCycle()
715 void ScheduleDAGTopologicalSort::AddSUnitWithoutPredecessors(const SUnit *SU) {  in AddSUnitWithoutPredecessors()
723 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,  in IsReachable()
741 void ScheduleDAGTopologicalSort::Allocate(int n, int index) {  in Allocate()
746 ScheduleDAGTopologicalSort::
747 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits, SUnit *exitsu)  in ScheduleDAGTopologicalSort()  function in ScheduleDAGTopologicalSort