HomeSort by: relevance | last modified time | path
    Searched refs:Topo (Results 1 - 9 of 9) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 239 /// Topo - A topological ordering for SUnits which permits fast IsReachable
241 ScheduleDAGTopologicalSort Topo;
273 return Topo.IsReachable(SU, TargetSU);
MachinePipeliner.h 121 ScheduleDAGTopologicalSort Topo;
166 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo)
170 for (const auto &NodeNum : Topo)
197 RegClassInfo(rci), II_setByPragma(II), Topo(SUnits, &ExitSU) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 180 /// Topo - A topological ordering for SUnits which permits fast IsReachable
182 ScheduleDAGTopologicalSort Topo;
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.AddSUnitWithoutPredecessors(NewNode);
292 Topo.AddSUnitWithoutPredecessors(NewNode)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 117 Type::getVoidTy(mf.getFunction().getContext()))), Topo(SUnits, &ExitSU) {
1025 Topo.MarkDirty();
1204 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
1211 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
1213 Topo.AddPredQueued(SuccSU, PredDep.getSUnit());
MachinePipeliner.cpp 477 Topo.InitDAGTopologicalSorting();
947 if (Topo.IsReachable(&I, LastSU))
956 Topo.RemovePred(&I, Deps[i].getSUnit());
965 Topo.RemovePred(LastSU, Deps[i].getSUnit());
972 Topo.AddPred(LastSU, &I);
1336 Circuits Cir(SUnits, Topo);
1419 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) {
1421 SDAG->Topo.AddPred(Src, I);
1447 for (int I : Topo) {
1455 for (int I : Topo) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIMachineScheduler.h 455 ScheduleDAGTopologicalSort *GetTopo() { return &Topo; }
SIMachineScheduler.cpp 1789 Topo.InitDAGTopologicalSorting();
1791 TopDownIndex2SU = std::vector<int>(Topo.begin(), Topo.end());
1792 BottomUpIndex2SU = std::vector<int>(Topo.rbegin(), Topo.rend());
GCNIterativeScheduler.cpp 141 Sch.Topo.InitDAGTopologicalSorting();
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 199 Topo.InitDAGTopologicalSorting();

Completed in 30 milliseconds