Lines Matching defs:Successors

30   llvm::SmallDenseSet<const Node *> Successors;
55         // Successors are unique, so we don't test against `Workset` before
99       Interval.Successors.insert(B);
107                              std::queue<const Node *> &Successors,
110   for (const auto *S : Result.Successors)
111     Successors.push(S);
156   std::queue<const Node *> Successors;
158   fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock);
161   while (!Successors.empty()) {
162     const auto *B = Successors.front();
163     Successors.pop();
170     fillIntervalNode(Graph, Index, Successors, Partitioned, B);
191         // `Successors`, rather than a set.
192         Pred->Successors.insert(N);