Home
last modified time | relevance | path

Searched refs:Topo (Results 1 – 9 of 9) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h128 ScheduleDAGTopologicalSort Topo; variable
173 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits() argument
177 for (const auto &NodeNum : Topo) in Circuits()
206 Topo(SUnits, &ExitSU) { in SwingSchedulerDAG()
H A DScheduleDAGInstrs.h241 ScheduleDAGTopologicalSort Topo; variable
273 return Topo.IsReachable(SU, TargetSU); in IsReachable()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp113 … Type::getVoidTy(mf.getFunction().getContext()))), Topo(SUnits, &ExitSU) { in ScheduleDAGInstrs()
1013 Topo.MarkDirty(); in buildSchedGraph()
1192 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()
1199 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU)) in addEdge()
1201 Topo.AddPredQueued(SuccSU, PredDep.getSUnit()); in addEdge()
H A DMachinePipeliner.cpp477 Topo.InitDAGTopologicalSorting(); in schedule()
947 if (Topo.IsReachable(&I, LastSU)) in changeDependences()
956 Topo.RemovePred(&I, Deps[i].getSUnit()); in changeDependences()
965 Topo.RemovePred(LastSU, Deps[i].getSUnit()); in changeDependences()
972 Topo.AddPred(LastSU, &I); in changeDependences()
1329 Circuits Cir(SUnits, Topo); in findCircuits()
1412 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) { in apply()
1414 SDAG->Topo.AddPred(Src, I); in apply()
1440 for (int I : Topo) { in computeNodeFunctions()
1448 for (int I : Topo) { in computeNodeFunctions()
[all …]
H A DVLIWMachineScheduler.cpp209 Topo.InitDAGTopologicalSorting(); in schedule()
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp182 ScheduleDAGTopologicalSort Topo; member in __anon4c419b9e0111::ScheduleDAGRRList
194 Topo(SUnits, nullptr) { in ScheduleDAGRRList()
213 return Topo.IsReachable(SU, TargetSU); in IsReachable()
219 return Topo.WillCreateCycle(SU, TargetSU); in WillCreateCycle()
226 Topo.AddPredQueued(SU, D.getSUnit()); in AddPredQueued()
234 Topo.AddPred(SU, D.getSUnit()); in AddPred()
242 Topo.RemovePred(SU, D.getSUnit()); in RemovePred()
282 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateNewSUnit()
292 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateClone()
374 Topo.MarkDirty(); in Schedule()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp1769 Topo.InitDAGTopologicalSorting(); in topologicalSort()
1771 TopDownIndex2SU = std::vector<int>(Topo.begin(), Topo.end()); in topologicalSort()
1772 BottomUpIndex2SU = std::vector<int>(Topo.rbegin(), Topo.rend()); in topologicalSort()
H A DSIMachineScheduler.h454 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; } in GetTopo()
H A DGCNIterativeScheduler.cpp141 Sch.Topo.InitDAGTopologicalSorting(); in BuildDAG()