Searched refs:Topo (Results 1 - 9 of 9) sorted by relevance
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 127 ScheduleDAGTopologicalSort Topo; member in class:llvm::SwingSchedulerDAG
172 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) argument
176 for (const auto &NodeNum : Topo)
203 RegClassInfo(rci), II_setByPragma(II), Topo(SUnits, &ExitSU) {
|
| H A D | ScheduleDAGInstrs.h | 239 /// Topo - A topological ordering for SUnits which permits fast IsReachable
241 ScheduleDAGTopologicalSort Topo; member in class:llvm::ScheduleDAGInstrs
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 180 /// Topo - A topological ordering for SUnits which permits fast IsReachable
182 ScheduleDAGTopologicalSort Topo; member in class:__anon1818::ScheduleDAGRRList
194 Topo(SUnits, nullptr) {
213 return Topo.IsReachable(SU, TargetSU);
219 return Topo.WillCreateCycle(SU, TargetSU);
226 Topo.AddPredQueued(SU, D.getSUnit());
234 Topo.AddPred(SU, D.getSUnit());
242 Topo.RemovePred(SU, D.getSUnit());
282 Topo.MarkDirty();
292 Topo
[all...] |
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 116 Type::getVoidTy(mf.getFunction().getContext()))), Topo(SUnits, &ExitSU) {
1018 Topo.MarkDirty();
1197 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
1204 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
1206 Topo.AddPredQueued(SuccSU, PredDep.getSUnit());
|
| H A D | MachinePipeliner.cpp | 430 Topo.InitDAGTopologicalSorting();
866 if (Topo.IsReachable(&I, LastSU))
876 Topo.RemovePred(&I, Deps[i].getSUnit());
885 Topo.RemovePred(LastSU, Deps[i].getSUnit());
892 Topo.AddPred(LastSU, &I);
1257 Circuits Cir(SUnits, Topo);
1340 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) {
1342 SDAG->Topo.AddPred(Src, I);
1368 for (ScheduleDAGTopologicalSort::const_iterator I = Topo.begin(),
1369 E = Topo
[all...] |
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIMachineScheduler.h | 460 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; }
|
| H A D | SIMachineScheduler.cpp | 1810 Topo.InitDAGTopologicalSorting();
1812 TopDownIndex2SU = std::vector<int>(Topo.begin(), Topo.end());
1813 BottomUpIndex2SU = std::vector<int>(Topo.rbegin(), Topo.rend());
|
| H A D | GCNIterativeScheduler.cpp | 157 Sch.Topo.InitDAGTopologicalSorting();
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonMachineScheduler.cpp | 199 Topo.InitDAGTopologicalSorting();
|
Completed in 117 milliseconds