Searched refs:TargetSU (Results 1 – 5 of 5) sorted by relevance
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 598 const SUnit &TargetSU, in GetSubGraph() argument
602 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
651 WorkList.push_back(&TargetSU); in GetSubGraph()
703 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle() argument
706 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
708 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()
724 const SUnit *TargetSU) { in IsReachable() argument
729 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
736 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| D | MachinePipeliner.cpp | 1160 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences() local
1166 TargetSU->addPred(Dep); in swapAntiDependences()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| D | ScheduleDAGInstrs.h | 273 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable() argument
274 return Topo.IsReachable(SU, TargetSU); in IsReachable()
|
| D | ScheduleDAG.h | 743 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
747 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
750 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
|
| /openbsd/src/gnu/llvm/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()
|