30   llvm::SmallDenseSet<const Node *> Successors;  member
99       Interval.Successors.insert(B);  in buildInterval()
107                       std::queue<const Node *> &Successors,  in fillIntervalNode()  argument
110   for (const auto *S : Result.Successors)  in fillIntervalNode()
111     Successors.push(S);  in fillIntervalNode()
156   std::queue<const Node *> Successors;  in partitionIntoIntervalsImpl()  local
158   fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock);  in partitionIntoIntervalsImpl()
161   while (!Successors.empty()) {  in partitionIntoIntervalsImpl()
162     const auto *B = Successors.front();  in partitionIntoIntervalsImpl()
163     Successors.pop();  in partitionIntoIntervalsImpl()
170     fillIntervalNode(Graph, Index, Successors, Partitioned, B);  in partitionIntoIntervalsImpl()
192         Pred->Successors.insert(N);  in partitionIntoIntervalsImpl()