Home
last modified time | relevance | path

Searched refs:ScheduleDAGTopologicalSort (Results 1 – 9 of 9) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/CodeGen/
DScheduleDAG.cpp434 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() { 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()
542 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift()
570 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle()
582 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable()
600 void ScheduleDAGTopologicalSort::Allocate(int n, int index) { in Allocate()
605 ScheduleDAGTopologicalSort::
606 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits) : SUnits(sunits) {} in ScheduleDAGTopologicalSort() function in ScheduleDAGTopologicalSort
DPostRASchedulerList.cpp122 ScheduleDAGTopologicalSort Topo;
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp459 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() { in InitDAGTopologicalSorting()
518 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) { in AddPred()
537 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) { in RemovePred()
544 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS()
573 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift()
601 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle()
614 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable()
632 void ScheduleDAGTopologicalSort::Allocate(int n, int index) { in Allocate()
637 ScheduleDAGTopologicalSort::
638 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits, SUnit *exitsu) in ScheduleDAGTopologicalSort() function in ScheduleDAGTopologicalSort
DMachinePipeliner.cpp208 ScheduleDAGTopologicalSort Topo;
1527 for (ScheduleDAGTopologicalSort::const_iterator I = Topo.begin(), in computeNodeFunctions()
1537 for (ScheduleDAGTopologicalSort::const_iterator I = Topo.begin(), in computeNodeFunctions()
1556 for (ScheduleDAGTopologicalSort::const_reverse_iterator I = Topo.rbegin(), in computeNodeFunctions()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DScheduleDAG.h664 class ScheduleDAGTopologicalSort {
688 explicit ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits);
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h709 class ScheduleDAGTopologicalSort {
734 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
DMachineScheduler.h234 ScheduleDAGTopologicalSort Topo;
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp155 ScheduleDAGTopologicalSort Topo;
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp163 ScheduleDAGTopologicalSort Topo;