| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 153 /// Topo - A topological ordering for SUnits which permits fast IsReachable
155 ScheduleDAGTopologicalSort Topo;
167 Topo(SUnits, nullptr) {
187 return Topo.IsReachable(SU, TargetSU);
193 return Topo.WillCreateCycle(SU, TargetSU);
200 Topo.AddPred(SU, D.getSUnit());
208 Topo.RemovePred(SU, D.getSUnit());
248 Topo.InitDAGTopologicalSorting();
259 Topo.InitDAGTopologicalSorting();
341 Topo.InitDAGTopologicalSorting()
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 161 /// Topo - A topological ordering for SUnits which permits fast IsReachable
163 ScheduleDAGTopologicalSort Topo;
171 Topo(SUnits) {
191 return Topo.IsReachable(SU, TargetSU);
197 return Topo.WillCreateCycle(SU, TargetSU);
204 Topo.AddPred(SU, D.getSUnit());
212 Topo.RemovePred(SU, D.getSUnit());
256 Topo.InitDAGTopologicalSorting();
267 Topo.InitDAGTopologicalSorting();
340 Topo.InitDAGTopologicalSorting()
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 232 /// Topo - A topological ordering for SUnits which permits fast IsReachable
234 ScheduleDAGTopologicalSort Topo;
258 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU),
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| PostRASchedulerList.cpp | 121 /// Topo - A topological ordering for SUnits.
122 ScheduleDAGTopologicalSort Topo;
188 : ScheduleDAGInstrs(MF, MLI, MDT), Topo(SUnits), AA(AA),
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachinePipeliner.cpp | 208 ScheduleDAGTopologicalSort Topo;
265 Topo(SUnits, &ExitSU) {}
824 Topo.InitDAGTopologicalSorting();
[all...] |
| MachineScheduler.cpp | 534 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
541 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
543 Topo.AddPred(SuccSU, PredDep.getSUnit());
684 Topo.InitDAGTopologicalSorting();
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIMachineScheduler.cpp | [all...] |
