Searched refs:DFSNodeData (Results 1 – 2 of 2) sorted by relevance
103 std::vector<NodeData> DFSNodeData; variable126 bool empty() const { return DFSNodeData.empty(); } in empty()130 DFSNodeData.clear(); in clear()138 DFSNodeData.resize(NumSUnits); in resize()147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
1180 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()1188 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()1195 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()1205 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()1214 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()1223 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()1245 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()1246 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()1276 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()1301 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()[all …]