Searched refs:TargetSU (Results 1 – 4 of 4) sorted by relevance
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 562 const SUnit &TargetSU, in GetSubGraph() argument
566 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
615 WorkList.push_back(&TargetSU); in GetSubGraph()
667 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle() argument
669 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
671 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()
679 const SUnit *TargetSU) { in IsReachable() argument
683 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
690 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| H A D | MachinePipeliner.cpp | 913 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences() local
919 TargetSU->addPred(Dep); in swapAntiDependences()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 728 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
732 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
735 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 213 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() argument
214 return Topo.IsReachable(SU, TargetSU); in IsReachable()
219 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle() argument
220 return Topo.WillCreateCycle(SU, TargetSU); in WillCreateCycle()
|