Lines Matching refs:DFSStack
138 DFSStack(std::move(G.DFSStack)),
152 DFSStack = std::move(G.DFSStack);
378 SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack,
400 while (!DFSStack.empty())
401 insert(*DFSStack.pop_back_val().first);
416 DFSStack.push_back(std::make_pair(N, I));
437 if (DFSStack.empty())
447 assert(!DFSStack.empty() && "We shouldn't have an empty stack!");
450 N = DFSStack.back().first;
451 I = DFSStack.back().second;
452 DFSStack.pop_back();
490 SmallVector<std::pair<Node *, Node::iterator>, 4> DFSStack;
495 internalDFS(DFSStack, PendingSCCStack, N, ResultSCCs);
497 assert(DFSStack.empty() && "Didn't flush the entire DFS stack!");
532 assert(SCCMap.empty() && DFSStack.empty() &&
539 assert(SCCMap.empty() && DFSStack.empty() &&
617 if (!DFSStack.empty()) {
618 N = DFSStack.back().first;
619 I = DFSStack.back().second;
620 DFSStack.pop_back();
645 DFSStack.push_back(std::make_pair(N, N->begin()));
676 assert(!DFSStack.empty() && "We never found a viable root!");
677 N = DFSStack.back().first;
678 I = DFSStack.back().second;
679 DFSStack.pop_back();
