Searched refs:TargetSU (Results 1 – 4 of 4) sorted by relevance
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| 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()
717 const SUnit *TargetSU) { in IsReachable() argument
722 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
729 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| D | MachinePipeliner.cpp | 1130 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences() local
1136 TargetSU->addPred(Dep); in swapAntiDependences()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | ScheduleDAG.h | 735 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
739 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
742 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 212 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() argument
213 return Topo.IsReachable(SU, TargetSU); in IsReachable()
218 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle() argument
219 return Topo.WillCreateCycle(SU, TargetSU); in WillCreateCycle()
|