Searched refs:DFSNodeData (Results 1 – 2 of 2) sorted by relevance
105 std::vector<NodeData> DFSNodeData; variable128 bool empty() const { return DFSNodeData.empty(); } in empty()132 DFSNodeData.clear(); in clear()140 DFSNodeData.resize(NumSUnits); in resize()149 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()162 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()175 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()176 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
1036 SchedDFSImpl(SchedDFSResult &r): R(r), SubtreeClasses(R.DFSNodeData.size()) { in SchedDFSImpl()1037 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()1045 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()1052 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()1062 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()1071 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()1077 if ((InstrCount - R.DFSNodeData[PredNum].InstrCount) < R.SubtreeLimit) in visitPostorderNode()1081 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()1103 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()1104 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()[all …]