Home
last modified time | relevance | path

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

/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
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()
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()
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/
DScheduleDAG.h693 class ScheduleDAGTopologicalSort {
729 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
DMachinePipeliner.h130 ScheduleDAGTopologicalSort Topo;
175 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits()
DScheduleDAGInstrs.h242 ScheduleDAGTopologicalSort Topo;
/openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.h454 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; } in GetTopo()
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp182 ScheduleDAGTopologicalSort Topo;