Home | History | Annotate | Download | only in ADT

Lines Matching refs:VisitStack

51   /// Element of VisitStack during DFS.
82   std::vector<StackElement> VisitStack;
110     assert(!CurrentSCC.empty() || VisitStack.empty());
115     return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148   VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157   assert(!VisitStack.empty());
158   while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160     NodeRef childN = *VisitStack.back().NextChild++;
170     if (VisitStack.back().MinVisited > childNum)
171       VisitStack.back().MinVisited = childNum;
177   while (!VisitStack.empty()) {
180     // Pop the leaf on top of the VisitStack.
181     NodeRef visitingN = VisitStack.back().Node;
182     unsigned minVisitNum = VisitStack.back().MinVisited;
183     assert(VisitStack.back().NextChild == GT::child_end(visitingN));
184     VisitStack.pop_back();
187     if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum)
188       VisitStack.back().MinVisited = minVisitNum;