Searched refs:RootSet (Results 1 – 3 of 3) sorted by relevance
242 void initializeRootSet(SmallVectorImpl<unsigned> &RootSet) const;243 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet,271 SmallVector<unsigned, 16> RootSet; in finalizeGraph() local273 initializeRootSet(RootSet); in finalizeGraph()274 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
193 SmallVectorImpl<unsigned> &RootSet) const { in initializeRootSet()197 RootSet.emplace_back(I); in initializeRootSet()201 void DependencyGraph::propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, in propagateThroughEdges() argument236 for (unsigned IID : RootSet) { in propagateThroughEdges()256 std::swap(RootSet, ToVisit); in propagateThroughEdges()258 } while (!RootSet.empty()); in propagateThroughEdges()
1235 SparseSet<RootData> RootSet; member in llvm::SchedDFSImpl1239 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()1285 if (RootSet[PredNum].ParentNodeID == SchedDFSResult::InvalidSubtreeID) in visitPostorderNode()1286 RootSet[PredNum].ParentNodeID = SU->NodeNum; in visitPostorderNode()1288 else if (RootSet.count(PredNum)) { in visitPostorderNode()1293 RData.SubInstrCount += RootSet[PredNum].SubInstrCount; in visitPostorderNode()1294 RootSet.erase(PredNum); in visitPostorderNode()1297 RootSet[SU->NodeNum] = RData; in visitPostorderNode()1319 assert(SubtreeClasses.getNumClasses() == RootSet.size() in finalize()1321 for (const RootData &Root : RootSet) { in finalize()