Home
last modified time | relevance | path

Searched refs:VisitStack (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h86 std::vector<StackElement> VisitStack; variable
114 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
119 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
155 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
164 assert(!VisitStack.empty()); in DFSVisitChildren()
165 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
167 NodeRef childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
177 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
178 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
184 while (!VisitStack.empty()) { in GetNextSCC()
[all …]
H A DDepthFirstIterator.h107 std::vector<StackElement> VisitStack; variable
111 VisitStack.push_back(StackElement(Node, std::nullopt)); in df_iterator()
119 VisitStack.push_back(StackElement(Node, std::nullopt)); in df_iterator()
129 NodeRef Node = VisitStack.back().first; in toNext()
130 std::optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
143 VisitStack.push_back(StackElement(Next, std::nullopt)); in toNext()
150 VisitStack.pop_back(); in toNext()
151 } while (!VisitStack.empty()); in toNext()
168 return VisitStack == x.VisitStack;
172 reference operator*() const { return VisitStack.back().first; }
[all …]
H A DPostOrderIterator.h115 SmallVector<std::tuple<NodeRef, ChildItTy, ChildItTy>, 8> VisitStack; variable
119 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
128 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
139 auto &Entry = VisitStack.back(); in traverseChild()
145 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in traverseChild()
163 return VisitStack == x.VisitStack;
167 reference operator*() const { return std::get<0>(VisitStack.back()); }
176 this->finishPostorder(std::get<0>(VisitStack.back()));
177 VisitStack.pop_back();
178 if (!VisitStack.empty())
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp42 SmallVector<std::pair<const BasicBlock *, const_succ_iterator>, 8> VisitStack; in FindFunctionBackedges() local
46 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
49 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
68 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
71 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
73 } while (!VisitStack.empty()); in FindFunctionBackedges()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaDecl.cpp9730 SmallVector<const Decl *, 4> VisitStack; in checkIsValidOpenCLKernelParameter() local
9740 VisitStack.push_back(PD); in checkIsValidOpenCLKernelParameter()
9741 assert(VisitStack.back() && "First decl null?"); in checkIsValidOpenCLKernelParameter()
9744 const Decl *Next = VisitStack.pop_back_val(); in checkIsValidOpenCLKernelParameter()
9773 VisitStack.push_back(nullptr); in checkIsValidOpenCLKernelParameter()
9786 VisitStack.push_back(FD); in checkIsValidOpenCLKernelParameter()
9825 } while (!VisitStack.empty()); in checkIsValidOpenCLKernelParameter()