Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DSCCIterator.h82 std::vector<StackElement> VisitStack; variable
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
157 assert(!VisitStack.empty()); in DFSVisitChildren()
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
170 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
171 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
177 while (!VisitStack.empty()) { in GetNextSCC()
181 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
184 VisitStack.pop_back(); in GetNextSCC()
187 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h99 std::vector<StackElement> VisitStack; variable
104 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
112 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
122 NodeRef Node = VisitStack.back().first; in toNext()
123 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
136 VisitStack.push_back(StackElement(Next, None)); in toNext()
143 VisitStack.pop_back(); in toNext()
144 } while (!VisitStack.empty()); in toNext()
163 return VisitStack == x.VisitStack;
185 VisitStack.pop_back(); in skipChildren()
[all …]
H A DPostOrderIterator.h105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack; variable
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
129 NodeRef BB = *VisitStack.back().second++; in traverseChild()
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
152 return VisitStack == x.VisitStack;
156 const NodeRef &operator*() const { return VisitStack.back().first; }
165 this->finishPostorder(VisitStack.back().first);
166 VisitStack.pop_back();
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCFG.cpp34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack; in FindFunctionBackedges() local
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
60 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
63 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
65 } while (!VisitStack.empty()); in FindFunctionBackedges()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaDecl.cpp8175 SmallVector<const Decl *, 4> VisitStack; in checkIsValidOpenCLKernelParameter() local
8189 VisitStack.push_back(RecTy->getDecl()); in checkIsValidOpenCLKernelParameter()
8190 assert(VisitStack.back() && "First decl null?"); in checkIsValidOpenCLKernelParameter()
8193 const Decl *Next = VisitStack.pop_back_val(); in checkIsValidOpenCLKernelParameter()
8222 VisitStack.push_back(nullptr); in checkIsValidOpenCLKernelParameter()
8235 VisitStack.push_back(FD); in checkIsValidOpenCLKernelParameter()
8273 } while (!VisitStack.empty()); in checkIsValidOpenCLKernelParameter()