Searched refs:ScheduleDAGTopologicalSort (Results 1 - 4 of 4) sorted by relevance
| /external/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 461 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() {
520 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {
539 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {
546 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
575 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
603 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {
616 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,
634 void ScheduleDAGTopologicalSort::Allocate(int n, int index) {
639 ScheduleDAGTopologicalSort::
640 ScheduleDAGTopologicalSort(st
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 685 /// ScheduleDAGTopologicalSort is a class that computes a topological
691 class ScheduleDAGTopologicalSort { class in class:llvm::SUnit
716 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
|
| H A D | MachineScheduler.h | 230 ScheduleDAGTopologicalSort Topo;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 155 ScheduleDAGTopologicalSort Topo;
|
Completed in 125 milliseconds