Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAGInstrs.h262 ScheduleDAGTopologicalSort Topo; variable
294 return Topo.IsReachable(SU, TargetSU); in IsReachable()
H A DMachinePipeliner.h293 ScheduleDAGTopologicalSort Topo; variable
345 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits() argument
349 for (const auto &NodeNum : Topo) in Circuits()
380 Topo(SUnits, &ExitSU), AA(AA), BAA(*AA) { in SwingSchedulerDAG()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp128 … Type::getVoidTy(mf.getFunction().getContext()))), Topo(SUnits, &ExitSU) { in ScheduleDAGInstrs()
1049 Topo.MarkDirty(); in buildSchedGraph()
1236 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()
1243 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU)) in addEdge()
1245 Topo.AddPredQueued(SuccSU, PredDep.getSUnit()); in addEdge()
H A DMachinePipeliner.cpp709 Topo.InitDAGTopologicalSorting(); in schedule()
1298 if (Topo.IsReachable(&I, LastSU)) in changeDependences()
1307 Topo.RemovePred(&I, D.getSUnit()); in changeDependences()
1316 Topo.RemovePred(LastSU, D.getSUnit()); in changeDependences()
1323 Topo.AddPred(LastSU, &I); in changeDependences()
1966 Circuits Cir(SUnits, Topo); in findCircuits()
2046 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) { in apply()
2048 SDAG->Topo.AddPred(Src, I); in apply()
2065 for (int I : Topo) { in computeNodeFunctions()
2073 for (int I : Topo) { in computeNodeFunctions()
[all …]
H A DVLIWMachineScheduler.cpp209 Topo.InitDAGTopologicalSorting(); in schedule()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp182 ScheduleDAGTopologicalSort Topo; member in __anona90f206e0111::ScheduleDAGRRList
193 AvailableQueue(availqueue), Topo(SUnits, nullptr) { in ScheduleDAGRRList()
212 return Topo.IsReachable(SU, TargetSU); in IsReachable()
218 return Topo.WillCreateCycle(SU, TargetSU); in WillCreateCycle()
225 Topo.AddPredQueued(SU, D.getSUnit()); in AddPredQueued()
233 Topo.AddPred(SU, D.getSUnit()); in AddPred()
241 Topo.RemovePred(SU, D.getSUnit()); in RemovePred()
281 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateNewSUnit()
291 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateClone()
376 Topo.MarkDirty(); in Schedule()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp1749 Topo.InitDAGTopologicalSorting(); in topologicalSort()
1751 TopDownIndex2SU = std::vector<int>(Topo.begin(), Topo.end()); in topologicalSort()
1752 BottomUpIndex2SU = std::vector<int>(Topo.rbegin(), Topo.rend()); in topologicalSort()
H A DSIMachineScheduler.h454 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; } in GetTopo()
H A DGCNIterativeScheduler.cpp158 Sch.Topo.InitDAGTopologicalSorting(); in BuildDAG()