Home
last modified time | relevance | path

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

/minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/
H A DSCCIterator.h80 std::vector<StackElement> VisitStack; variable
108 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
113 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
155 assert(!VisitStack.empty()); in DFSVisitChildren()
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
158 NodeType *childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
168 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
169 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
175 while (!VisitStack.empty()) { in GetNextSCC()
[all …]
H A DPostOrderIterator.h102 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; variable
105 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
106 NodeType *BB = *VisitStack.back().second++; in traverseChild()
107 if (this->insertEdge(VisitStack.back().first, BB)) { in traverseChild()
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
116 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
124 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
146 return VisitStack == x.VisitStack;
151 return VisitStack.back().first;
161 this->finishPostorder(VisitStack.back().first);
[all …]
H A DDepthFirstIterator.h79 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack; variable
83 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0), in df_iterator()
92 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0), in df_iterator()
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext()
119 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0), in toNext()
126 VisitStack.pop_back(); in toNext()
127 } while (!VisitStack.empty()); in toNext()
147 return VisitStack == x.VisitStack;
152 return VisitStack.back().first.getPointer();
169 VisitStack.pop_back(); in skipChildren()
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp95 SmallVector<WorklistItem, 16> VisitStack; in runOnLoop() local
103 VisitStack.clear(); in runOnLoop()
106 VisitStack.push_back(WorklistItem(L->getHeader(), false)); in runOnLoop()
108 while (!VisitStack.empty()) { in runOnLoop()
109 WorklistItem Item = VisitStack.pop_back_val(); in runOnLoop()
163 VisitStack.push_back(WorklistItem(SuccBB, true)); in runOnLoop()
171 VisitStack.push_back(WorklistItem(ExitBB, false)); in runOnLoop()
182 VisitStack.push_back(WorklistItem(SuccBB, false)); in runOnLoop()
/minix3/external/bsd/llvm/dist/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()
/minix3/external/bsd/llvm/dist/clang/lib/Sema/
H A DSemaDecl.cpp6831 SmallVector<const Decl *, 4> VisitStack; in checkIsValidOpenCLKernelParameter() local
6839 VisitStack.push_back(PD); in checkIsValidOpenCLKernelParameter()
6841 assert(VisitStack.back() && "First decl null?"); in checkIsValidOpenCLKernelParameter()
6844 const Decl *Next = VisitStack.pop_back_val(); in checkIsValidOpenCLKernelParameter()
6865 VisitStack.push_back(nullptr); in checkIsValidOpenCLKernelParameter()
6878 VisitStack.push_back(FD); in checkIsValidOpenCLKernelParameter()
6914 } while (!VisitStack.empty()); in checkIsValidOpenCLKernelParameter()