1264   SchedDFSImpl(SchedDFSResult &r): R(r), SubtreeClasses(R.DFSNodeData.size()) {  in SchedDFSImpl()
1265     RootSet.setUniverse(R.DFSNodeData.size());  in SchedDFSImpl()
1273     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1280     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1290     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1299     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1305       if ((InstrCount - R.DFSNodeData[PredNum].InstrCount) < R.SubtreeLimit)  in visitPostorderNode()
1309       if (R.DFSNodeData[PredNum].SubtreeID == PredNum) {  in visitPostorderNode()
1331     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1332       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1362     for (unsigned Idx = 0, End = R.DFSNodeData.size(); Idx != End; ++Idx) {  in finalize()
1363       R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx];  in finalize()
1365             << R.DFSNodeData[Idx].SubtreeID << '\n');  in finalize()
1390     if (R.DFSNodeData[PredNum].SubtreeID != PredNum)  in joinPredSubtree()
1403     if (CheckLimit && R.DFSNodeData[PredNum].InstrCount > R.SubtreeLimit)  in joinPredSubtree()
1405     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()