Searched refs:TargetSU (Results 1 – 5 of 5) sorted by relevance
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 599 const SUnit &TargetSU, in GetSubGraph() argument
603 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
652 WorkList.push_back(&TargetSU); in GetSubGraph()
704 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle() argument
707 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
709 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()
725 const SUnit *TargetSU) { in IsReachable() argument
726 assert(TargetSU != nullptr && "Invalid target SUnit"); in IsReachable()
732 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
739 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| H A D | MachinePipeliner.cpp | 1581 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences() local
1587 TargetSU->addPred(Dep); in swapAntiDependences()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAGInstrs.h | 274 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable() argument
275 return Topo.IsReachable(SU, TargetSU); in IsReachable()
|
| H A D | ScheduleDAG.h | 752 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
756 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
759 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 211 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() argument
212 return Topo.IsReachable(SU, TargetSU); in IsReachable()
217 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle() argument
218 return Topo.WillCreateCycle(SU, TargetSU); in WillCreateCycle()
|