Lines Matching refs:DFSResult
692 // This may initialize a DFSResult to be used for queue priority.
767 // Order predecessors so DFSResult follows the critical path.
862 delete DFSResult;
1086 // This may initialize a DFSResult to be used for queue priority.
1116 if (DFSResult) {
1117 unsigned SubtreeID = DFSResult->getSubtreeID(SU);
1120 DFSResult->scheduleTree(SubtreeID);
1167 if (!DFSResult)
1168 DFSResult = new SchedDFSResult(/*BottomU*/true, MinSubtreeSize);
1169 DFSResult->clear();
1171 DFSResult->resize(SUnits.size());
1172 DFSResult->compute(SUnits);
1173 ScheduledTrees.resize(DFSResult->getNumSubtrees());
3272 const SchedDFSResult *DFSResult;
3277 : DFSResult(nullptr), ScheduledTrees(nullptr), MaximizeILP(MaxILP) {}
3283 unsigned SchedTreeA = DFSResult->getSubtreeID(A);
3284 unsigned SchedTreeB = DFSResult->getSubtreeID(B);
3291 if (DFSResult->getSubtreeLevel(SchedTreeA)
3292 != DFSResult->getSubtreeLevel(SchedTreeB)) {
3293 return DFSResult->getSubtreeLevel(SchedTreeA)
3294 < DFSResult->getSubtreeLevel(SchedTreeB);
3298 return DFSResult->getILP(A) < DFSResult->getILP(B);
3300 return DFSResult->getILP(A) > DFSResult->getILP(B);
3317 Cmp.DFSResult = DAG->getDFSResult();
