Home
last modified time | relevance | path

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

/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.h106 // VisitStack - Used to maintain the ordering. Top = current block in df_iterator()
107 std::vector<StackElement> VisitStack; in df_iterator()
111 VisitStack.push_back(StackElement(Node, std::nullopt));
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()
136 // VisitStack.back().second actually gets updated as the iterator in toNext()
143 VisitStack.push_back(StackElement(Next, std::nullopt)); in toNext()
150 VisitStack.pop_back();
151 } while (!VisitStack
103 std::vector<StackElement> VisitStack; global() variable
[all...]
H A DPostOrderIterator.h115 SmallVector<std::tuple<NodeRef, ChildItTy, ChildItTy>, 8> VisitStack; in po_iterator()
119 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB));
128 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB));
139 auto &Entry = VisitStack.back(); in traverseChild()
145 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB));
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
111 SmallVector<std::tuple<NodeRef, ChildItTy, ChildItTy>, 8> VisitStack; global() variable
[all...]
/llvm-project/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/clang/lib/Sema/
H A DSemaDecl.cpp9664 SmallVector<const Decl *, 4> VisitStack; in ActOnFunctionDeclarator()
9667 // VisitStack to HistoryStack as we do the DFS for bad field. in ActOnFunctionDeclarator()
9678 VisitStack.push_back(RecTy->getDecl()); in ActOnFunctionDeclarator()
9679 assert(VisitStack.back() && "First decl null?"); in ActOnFunctionDeclarator()
9682 const Decl *Next = VisitStack.pop_back_val(); in ActOnFunctionDeclarator()
9711 VisitStack.push_back(nullptr); in ActOnFunctionDeclarator()
9724 VisitStack.push_back(FD); in ActOnFunctionDeclarator()
9763 } while (!VisitStack.empty()); in ActOnFunctionDeclarator()
9488 SmallVector<const Decl *, 4> VisitStack; checkIsValidOpenCLKernelParameter() local