Lines Matching defs:RootSet

193     SmallVectorImpl<unsigned> &RootSet) const {
197       RootSet.emplace_back(I);
201 void DependencyGraph::propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet,
206   // RootSet to a leaf node (i.e. a node with no successors).  The RootSet is
222   // RootSet.  A node N is added to the `unvisited nodes` if all its
232   // The algorithm terminates when the set of unvisited nodes (i.e. our RootSet)
236     for (unsigned IID : RootSet) {
256     std::swap(RootSet, ToVisit);
258   } while (!RootSet.empty());