reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1238 SchedDFSImpl(SchedDFSResult &r): R(r), SubtreeClasses(R.DFSNodeData.size()) { 1239 RootSet.setUniverse(R.DFSNodeData.size()); 1247 return R.DFSNodeData[SU->NodeNum].SubtreeID 1254 R.DFSNodeData[SU->NodeNum].InstrCount = 1264 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; 1273 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; 1278 if ((InstrCount - R.DFSNodeData[PredNum].InstrCount) < R.SubtreeLimit) 1278 if ((InstrCount - R.DFSNodeData[PredNum].InstrCount) < R.SubtreeLimit) 1282 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { 1304 R.DFSNodeData[Succ->NodeNum].InstrCount 1305 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; 1318 R.DFSTreeData.resize(SubtreeClasses.getNumClasses()); 1324 R.DFSTreeData[TreeID].ParentTreeID = SubtreeClasses[Root.ParentNodeID]; 1325 R.DFSTreeData[TreeID].SubInstrCount = Root.SubInstrCount; 1331 R.SubtreeConnections.resize(SubtreeClasses.getNumClasses()); 1332 R.SubtreeConnectLevels.resize(SubtreeClasses.getNumClasses()); 1333 LLVM_DEBUG(dbgs() << R.getNumSubtrees() << " subtrees:\n"); 1334 for (unsigned Idx = 0, End = R.DFSNodeData.size(); Idx != End; ++Idx) { 1335 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; 1337 << R.DFSNodeData[Idx].SubtreeID << '\n'); 1360 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) 1372 if (CheckLimit && R.DFSNodeData[PredNum].InstrCount > R.SubtreeLimit) 1372 if (CheckLimit && R.DFSNodeData[PredNum].InstrCount > R.SubtreeLimit) 1374 R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum; 1386 R.SubtreeConnections[FromTree]; 1394 FromTree = R.DFSTreeData[FromTree].ParentTreeID;