HomeSort by: relevance | last modified time | path
    Searched defs:Topo (Results 1 - 3 of 3) 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...]

Completed in 59 milliseconds