Lines Matching refs:VisitStack
75 // VisitStack - Used to maintain the ordering. Top = current block
78 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack;
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
91 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
118 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
125 VisitStack.pop_back();
126 } while (!VisitStack.empty());
146 return VisitStack == x.VisitStack;
151 return VisitStack.back().first.getPointer();
168 VisitStack.pop_back();
169 if (!VisitStack.empty())
188 unsigned getPathLength() const { return VisitStack.size(); }
193 return VisitStack[n].first.getPointer();
