Searched refs:TargetSU (Results 1 – 5 of 5) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 603 const SUnit &TargetSU, in GetSubGraph() argument
607 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
656 WorkList.push_back(&TargetSU); in GetSubGraph()
708 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle() argument
711 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
713 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()
729 const SUnit *TargetSU) { in IsReachable() argument
730 assert(TargetSU != nullptr && "Invalid target SUnit"); in IsReachable()
736 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
743 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAGInstrs.h | 293 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable() argument
294 return Topo.IsReachable(SU, TargetSU); in IsReachable()
|
| H A D | ScheduleDAG.h | 776 const SUnit &TargetSU, bool &Success);
779 LLVM_ABI bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
782 LLVM_ABI bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
|
| /freebsd/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()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUIGroupLP.cpp | 936 auto Reaches = any_of(*Cache, [&SU, &DAG](SUnit *TargetSU) { in apply() argument
937 return DAG->IsReachable(TargetSU, const_cast<SUnit *>(SU)); in apply()
|