Searched refs:RootSet (Results 1 – 3 of 3) sorted by relevance
245 void initializeRootSet(SmallVectorImpl<unsigned> &RootSet) const;246 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet,274 SmallVector<unsigned, 16> RootSet; in finalizeGraph() local276 initializeRootSet(RootSet); in finalizeGraph()277 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
192 SmallVectorImpl<unsigned> &RootSet) const { in initializeRootSet()196 RootSet.emplace_back(I); in initializeRootSet()200 void DependencyGraph::propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, in propagateThroughEdges() argument235 for (unsigned IID : RootSet) { in propagateThroughEdges()255 std::swap(RootSet, ToVisit); in propagateThroughEdges()257 } while (!RootSet.empty()); in propagateThroughEdges()
1279 SparseSet<RootData> RootSet; member in llvm::SchedDFSImpl1283 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()1329 if (RootSet[PredNum].ParentNodeID == SchedDFSResult::InvalidSubtreeID) in visitPostorderNode()1330 RootSet[PredNum].ParentNodeID = SU->NodeNum; in visitPostorderNode()1332 else if (RootSet.count(PredNum)) { in visitPostorderNode()1337 RData.SubInstrCount += RootSet[PredNum].SubInstrCount; in visitPostorderNode()1338 RootSet.erase(PredNum); in visitPostorderNode()1341 RootSet[SU->NodeNum] = RData; in visitPostorderNode()1363 assert(SubtreeClasses.getNumClasses() == RootSet.size() in finalize()1365 for (const RootData &Root : RootSet) { in finalize()