HomeSort by relevance Sort by last modified time
    Searched refs:ScheduleDAGTopologicalSort (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 404 void ScheduleDAGTopologicalSort::InitDAGTopologicalSorting() {
460 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {
479 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {
486 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
512 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
540 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
552 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,
570 void ScheduleDAGTopologicalSort::Allocate(int n, int index) {
575 ScheduleDAGTopologicalSort::
576 ScheduleDAGTopologicalSort(std::vector<SUnit> &sunits) : SUnits(sunits) {
    [all...]
PostRASchedulerList.cpp 116 ScheduleDAGTopologicalSort Topo;
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 643 /// ScheduleDAGTopologicalSort is a class that computes a topological
649 class ScheduleDAGTopologicalSort {
673 explicit ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits);
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 147 ScheduleDAGTopologicalSort Topo;
    [all...]

Completed in 90 milliseconds