Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp438 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()
679 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift()
724 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable()
742 void ScheduleDAGTopologicalSort::Allocate(int n, int index) { in Allocate()
747 ScheduleDAGTopologicalSort::
[all …]
H A DMachinePipeliner.cpp1477 for (ScheduleDAGTopologicalSort::const_reverse_iterator I = Topo.rbegin(), in computeNodeFunctions()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h121 ScheduleDAGTopologicalSort Topo;
166 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits()
H A DScheduleDAG.h694 class ScheduleDAGTopologicalSort {
730 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
H A DScheduleDAGInstrs.h241 ScheduleDAGTopologicalSort Topo;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h455 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; } in GetTopo()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp182 ScheduleDAGTopologicalSort Topo;