Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp441 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() { in InitDAGTopologicalSorting()
526 void ScheduleDAGTopologicalSort::FixOrder() { in FixOrder()
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()
600 std::vector<int> ScheduleDAGTopologicalSort::GetSubGraph(const SUnit &StartSU, in GetSubGraph()
681 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift()
706 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle()
718 void ScheduleDAGTopologicalSort::AddSUnitWithoutPredecessors(const SUnit *SU) { in AddSUnitWithoutPredecessors()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h720 class ScheduleDAGTopologicalSort {
756 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
H A DMachinePipeliner.h135 ScheduleDAGTopologicalSort Topo;
180 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits()
H A DScheduleDAGInstrs.h248 ScheduleDAGTopologicalSort Topo;
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h454 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; } in GetTopo()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp182 ScheduleDAGTopologicalSort Topo;