Searched refs:RootSet (Results 1 – 3 of 3) sorted by relevance
241 void initializeRootSet(SmallVectorImpl<unsigned> &RootSet) const;242 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, unsigned Iterations);269 SmallVector<unsigned, 16> RootSet; in finalizeGraph() local271 initializeRootSet(RootSet); in finalizeGraph()272 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
195 SmallVectorImpl<unsigned> &RootSet) const { in initializeRootSet()199 RootSet.emplace_back(I); in initializeRootSet()204 SmallVectorImpl<unsigned> &RootSet, unsigned Iterations) { in propagateThroughEdges() argument238 for (unsigned IID : RootSet) { in propagateThroughEdges()258 std::swap(RootSet, ToVisit); in propagateThroughEdges()260 } while (!RootSet.empty()); in propagateThroughEdges()
1247 SparseSet<RootData> RootSet; member in llvm::SchedDFSImpl1251 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()1297 if (RootSet[PredNum].ParentNodeID == SchedDFSResult::InvalidSubtreeID) in visitPostorderNode()1298 RootSet[PredNum].ParentNodeID = SU->NodeNum; in visitPostorderNode()1300 else if (RootSet.count(PredNum)) { in visitPostorderNode()1305 RData.SubInstrCount += RootSet[PredNum].SubInstrCount; in visitPostorderNode()1306 RootSet.erase(PredNum); in visitPostorderNode()1309 RootSet[SU->NodeNum] = RData; in visitPostorderNode()1331 assert(SubtreeClasses.getNumClasses() == RootSet.size() in finalize()1333 for (const RootData &Root : RootSet) { in finalize()