Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h85 std::vector<StackElement> VisitStack; variable
118 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
163 assert(!VisitStack.empty()); in DFSVisitChildren()
164 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
176 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
177 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
183 while (!VisitStack.empty()) { in GetNextSCC()
187 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
190 VisitStack.pop_back(); in GetNextSCC()
193 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h104 std::vector<StackElement> VisitStack; variable
108 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
116 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
126 NodeRef Node = VisitStack.back().first; in toNext()
127 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
140 VisitStack.push_back(StackElement(Next, None)); in toNext()
147 VisitStack.pop_back(); in toNext()
148 } while (!VisitStack.empty()); in toNext()
165 return VisitStack == x.VisitStack;
187 VisitStack.pop_back(); in skipChildren()
[all …]
H A DPostOrderIterator.h110 SmallVector<std::pair<NodeRef, ChildItTy>, 8> VisitStack; variable
114 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
123 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
133 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
134 NodeRef BB = *VisitStack.back().second++; in traverseChild()
137 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
155 return VisitStack == x.VisitStack;
159 const NodeRef &operator*() const { return VisitStack.back().first; }
168 this->finishPostorder(VisitStack.back().first);
169 VisitStack.pop_back();
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFG.cpp41 SmallVector<std::pair<const BasicBlock *, const_succ_iterator>, 8> VisitStack; in FindFunctionBackedges() local
45 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
67 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
70 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
72 } while (!VisitStack.empty()); in FindFunctionBackedges()
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaDecl.cpp9274 SmallVector<const Decl *, 4> VisitStack; in checkIsValidOpenCLKernelParameter() local
9288 VisitStack.push_back(RecTy->getDecl()); in checkIsValidOpenCLKernelParameter()
9289 assert(VisitStack.back() && "First decl null?"); in checkIsValidOpenCLKernelParameter()
9292 const Decl *Next = VisitStack.pop_back_val(); in checkIsValidOpenCLKernelParameter()
9321 VisitStack.push_back(nullptr); in checkIsValidOpenCLKernelParameter()
9334 VisitStack.push_back(FD); in checkIsValidOpenCLKernelParameter()
9372 } while (!VisitStack.empty()); in checkIsValidOpenCLKernelParameter()